node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
5,285 | 9 | PowerHouse_(programming_language):powerhouse programming language powerhouse trademarked name byte-compiled fourth-generation programming language 4gl originally produced quasar corporation later renamed cognos incorporated hewlett-packard hp3000 mini-computer initially composed five components powerhouse introduced 1982 bundled together single product quiz quick/qdesign previously available separately new batch processor qtp 1983 quasar changed name cognos corporation began porting application development tools platforms notably digital equipment corporation vax data general eclipse mv ibm as/400 along unix platforms vendors cognos also began extending product line add-ons powerhouse example architect end-user applications written powerhouse example multiview subsequent development product added support platform-specific relational databases hp allbase/sql dec rdb microsoft sql server well cross-platform relational databases oracle sybase ibm db2 powerhouse language represented considerable achievement compared languages like cobol pascal pl/1 powerhouse substantially cut amount labour required produce useful applications chosen platforms achieved use central data-dictionary compiled file extended attributes data fields natively available dbms frequently used programming idioms order support data dictionary powerhouse tightly coupled underlying database management system and/or file system target platforms case hp3000 image shallow-network dbms ksam indexed file system entire powerhouse language reflected origins described data dictionary need describe attributes applications unless need change fly example change size item make fit within constraints defined item simple quick screens could generated four lines source code screenname name screen programmer assigned program filename file name accessed data dictionary whether items file would fit screen would determined many items size n't fit program would modified eliminate unneeded items change size items size etc file couple items quick easy generate screen data entry deletion simply look data index simple quiz reports almost easy one-file report simple items file would sent screen maybe desired fashion simple since qtp programs usually involved adding deleting modifying data much need simple code programs care exercised potential danger whole file files data could wiped rather easily quick quiz qtp programs could run compiled converted machine language uncompiled source code compiled programs generally ran faster good method modifications source code corrupt object code quick screens used primarily data entry could call quick screens quiz reports qtp applications update data also things done source code order generate compiled code example go command run source code equivalent build command generate compiled code commands could abbreviated first three characters writing source code access could abbreviated acc well define report screen etc quiz reports could routed printer screen ascii text files set report device printer screen disk command given right access commands novice could write simple report programs dangerous though novice could easily destroy data security whether one call interpreters access quiz also access qtp quick like virtual machine languages powerhouse cpu intensive sometimes produced visibly negative impact overall transaction performance necessitating hardware upgrades cognos practice tying license fees hardware performance metrics resulted high licensing costs powerhouse users cognos initially attempted move intel platform 1988 dos-based powerhouse pc product used numerous partners build bespoke applications small medium-sized customers entirely unsuccessful time however cognos eventually produced axiant c.1995 ported powerhouse-like syntax intel-based microsoft windows visual development environment linked sql aware dbms running machines radical changes wrought pc revolution began time powerhouse introduced eventually brought cost host computers extent high-priced software development tools powerhouse became unattractive customers around 1999 powerhouse web released order support development web-aware applications products like business intelligence financial performance management run commodity architectures high-end unix servers form core cognos product line cognos acquired ibm january 30 2008 powerhouse application development tools including powerhouse server axiant 4gl powerhouse web acquired ibm unicom systems division unicom global december 31 2013 unicom continues support worldwide customer base products | [
7213,
3764,
2866,
4759,
8117,
7715,
84,
1015
] | Validation |
5,286 | 0 | Sentence_embedding:sentence embedding sentence embedding collective name set techniques natural language processing nlp sentences mapped vectors real numbers sentence embedding used machine learning software libraries pytorch tensorflow way testing sentence encodings apply sentences involving compositional knowledge sick corpus entailment sick-e relatedness sick-r best results obtained using bilstm network trained stanford natural language inference snli corpus pearson correlation coefficient sick-r 0.885 result sick-e 86.3 slight improvement previous scores presented sick-r 0.888 sick-e 87.8 using concatenation bidirectional gated recurrent unit infersent sentence embeddings training code learning general purpose distributed sentence representations via large scale multi-task learning | [
5429,
6925,
3158
] | Test |
5,287 | 4 | Content_Threat_Removal:content threat removal content threat removal ctr cyber security technology intended defeat threat posed handling digital content cyberspace unlike defences including antivirus software sandboxed execution rely able detect threats similarly content disarm reconstruction ctr designed remove threat without knowing whether done acts without knowing data contains threat detection strategies work detecting unsafe content blocking removing content content deemed safe delivered destination contrast content threat removal assumes data hostile delivers none destination regardless whether actually hostile although data delivered business information carried data delivered using new data created purpose advanced attacks continuously defeat defences based detection often referred zero day attacks soon discovered attack detection mechanisms must updated identify neutralise attack systems unprotected attacks succeed attackers skilled finding new ways evading detection polymorphic code used evade detection known unsafe data sandbox detection allows attacks evade dynamic analysis content threat removal defence works intercepting data way destination business information carried data extracted data discarded entirely new clean safe data built carry information destination effect building new data carry business information unsafe elements original data left behind discarded includes executable data macros scripts malformed data triggers vulnerabilities applications ctr form content transformation transformations provide complete defence content threat ctr applicable user-to-user traffic email chat machine-to-machine traffic web services data transfers intercepted in-line application layer proxies transform way information content delivered remove threat ctr works extracting business information data possible extract information executable code means ctr directly applicable web browsing since web pages code however applied content downloaded uploaded web sites although web pages transformed render safe web browsing isolated remote access protocols used reach isolated environment subjected ctr ctr provides solution problem stegware naturally removes detectable steganography eliminates symbiotic permutation steganography normalisation deep secure pioneered development ctr number products services incorporate ctr including application layer proxies email web services icap internet content adaptation protocol sidecar servers uploaded downloaded content garrison provide remote desktop isolation solution display content converted video signal recoded video stream using separate hardware chips process removes threat content display content | [
7122,
2791,
5482,
3495,
3338,
1805
] | Test |
5,288 | 9 | IDL_(programming_language):idl programming language idl short interactive data language programming language used data analysis popular particular areas science astronomy atmospheric physics medical imaging idl shares common syntax pv-wave originated codebase though languages subsequently diverged detail also two free implementations gnu data language gdl fawlty language fl idl vectorized numerical interactive commonly used interactive processing large amounts data including image processing syntax includes many constructs fortran c. idl originated early vax/vms/fortran syntax still shows heritage findgen function example returns one-dimensional array floating point numbers values equal series integers starting 0 note operation second line applies vectorized manner whole 100-element array created first line analogous way general-purpose array programming languages apl j k would example contains divide zero idl report arithmetic overflow store nan value corresponding element array first one array elements finite nan excluded visualization generated plot command array programming languages idl fast vector operations sometimes fast well-coded custom loop fortran c quite slow elements need processing individually hence part art using idl array programming language matter numerically heavy computations make use built-in vector operations predecessor versions idl developed 1970s laboratory atmospheric space physics lasp university colorado boulder lasp david stern involved efforts allow scientists test hypotheses without employing programmers write modify individual applications first program evolutionary chain idl stern developed named rufus simple vector-oriented calculator ran pdp-12 accepted two-letter codes specified arithmetic operation input registers serve operands destination register version rufus developed pdp-8 mars mariner spectrum editor mmed mmed used lasp scientists interpret data mariner 7 mariner 9 later stern wrote program named sol also ran pdp-8 unlike predecessors true programming language fortran-like syntax sol array-oriented language primitive graphics capabilities stern left lasp found research systems inc. rsi 1977 first rsi product idl pdp-11 release graphics supported idl primarily tektronix terminals raster graphics displays rsi sold first idl licenses nasa goddard space flight center ball aerospace technologies corp. 1979 two years later rsi released initial vax/vms version idl written vax-11 macro fortran took advantage vax virtual memory 32-bit address space national center atmospheric research ncar university michigan university colorado naval research laboratory started use idl version 1987 rsi shifted development work idl unix environment required complete re-write code c rather port existing version vax idl stern ali bahrami rewrote idl unix sun 3 taking advantage re-write extend improve language subsequently idl expanded ported several variants unix vms linux microsoft windows 1992 mac os 1994 widgets added idl 1992 providing event-driven programming graphical user interfaces 1997 ion idl net web server-based system commercially released first version envi application remote sensing multispectral hyperspectral image analysis written idl released 1994 envi created developed owned better solutions consulting llc purchased bsc october 2000 eastman kodak coincident purchase rsi rsi sold marketed supported envi terms license agreement bsc llc 1994 october 2000 new object pointer types limited object-oriented programming capabilities added idl 1997 idl applied widely space science example solar physics european space agency used idl process almost pictures halley comet taken giotto spacecraft team repairing hubble space telescope used idl help diagnose anomalies main mirror 1995 astronauts board space shuttle used idl loaded laptop study ultraviolet radiation currently amongst applications idl used analysis secchi part stereo mission nrl usa rutherford appleton laboratory uk rsi became wholly owned subsidiary itt industries march 2004 15 may 2006 rsi began business itt visual information solutions effective 31 october 2011 result restructuring company became exelis visual information solutions idl owned maintained harris geospatial solutions computer language idl features make idl simple use interactively also cause difficulties building large programs single namespace particularly problematic example language updates include new built-in functions occasion invalidated large scientific libraries arrays passed reference mechanism advertised feature language pass data back subroutine – contrast array slices copied passed data modifications flow back array ranges subroutine exits violating principle least surprise many historical irregularities survive early heritage language requiring individual workarounds programmer example preceding issue alleviated using compiler option also provision idl eula effect australia result sections 47d 47h country copyright act following graphics created idl source code included | [
6507,
5363,
5098,
5983,
3606,
2820,
1626,
4759,
5548,
3772,
6882,
1731,
3619,
5117,
6356,
4872,
7005,
4705,
1569,
7655,
4067,
3981,
3388,
4070,
2866,
3807,
5592,
1398,
3898,
1879,
7579,
7299,
7860,
3410,
8137,
5965,
3915,
4999,
2803,
7951... | Validation |
5,289 | 1 | Commitment_ordering:commitment ordering commitment ordering co class interoperable serializability techniques concurrency control databases transaction processing related applications allows optimistic non-blocking implementations proliferation multi-core processors co also increasingly utilized concurrent programming transactional memory especially software transactional memory stm achieving serializability optimistically co also name resulting transaction schedule history property originally defined 1988 name dynamic atomicity co compliant schedule chronological order commitment events transactions compatible precedence order respective transactions co broad special case conflict serializability effective means reliable high-performance distributed scalable achieve global serializability modular serializability across collection database systems possibly use different concurrency control mechanisms co also makes system serializability compliant already not-co-compliant database system augmented co component commitment order coordinator—coco orders commitment events co compliance neither data-access transaction operation interference co provides low overhead general solution global serializability distributed serializability instrumental global concurrency control distributed concurrency control multi database systems transactional objects possibly highly distributed e.g. within cloud computing grid computing networks smartphones atomic commitment protocol acp type fundamental part solution utilized break global cycles conflict precedence serializability graph co general property necessary condition guarantees global serializability database systems involved share concurrency control information beyond atomic commitment protocol unmodified messages knowledge whether transactions global local database systems autonomous thus co variants general technique require typically costly distribution local concurrency control information e.g. local precedence relations locks timestamps tickets generalizes popular strong strict two-phase locking ss2pl property conjunction two-phase commit protocol 2pc de facto standard achieve global serializability across ss2pl based database systems result co compliant database systems different concurrency control types transparently join ss2pl based solutions global serializability addition locking based global deadlocks resolved automatically co based multi-database environment important side-benefit including special case completely ss2pl based environment previously unnoticed fact ss2pl furthermore strict commitment ordering sco raz 1991c intersection strictness co provides better performance shorter average transaction completion time resulting better transaction throughput ss2pl whenever read-write conflicts present identical blocking behavior write-read write-write conflicts comparable locking overhead advantage sco especially significant lock contention strictness allows ss2pl sco use effective database recovery mechanisms two major generalizing variants co exist extended co eco raz 1993a multi-version co mvco raz 1993b well provide global serializability without local concurrency control information distribution combined relevant concurrency control allow optimistic non-blocking implementations use additional information relaxing co constraints achieving better concurrency performance vote ordering vo generalized co gco raz 2009 container schedule set property technique co variants local vo necessary condition guaranteeing global serializability atomic commitment protocol acp participants share concurrency control information generalized autonomy property co variants inter-operate transparently guaranteeing global serializability automatic global deadlock resolution also together mixed heterogeneous environment different variants commitment ordering co raz 1990 1992 1994 2009 schedule property referred also dynamic atomicity since 1988 commit ordering commit order serializability strong recoverability since 1991 latter misleading name since co incomparable recoverability term strong implies special case means schedule strong recoverability property necessarily co property vice versa 2009 co characterized major concurrency control method together previously known since 1980s three major methods locking time-stamp ordering serialization graph testing enabler interoperability systems using different concurrency control mechanisms federated database system loosely defined multidatabase system typically distributed communication network transactions span multiple possibly distributed databases enforcing global serializability system problematic even every local schedule single database serializable still global schedule whole system necessarily serializable massive communication exchanges conflict information needed databases reach conflict serializability would lead unacceptable performance primarily due computer communication latency problem achieving global serializability effectively characterized open public disclosure co 1991 inventor yoav raz raz 1991a see also global serializability enforcing co effective way enforce conflict serializability globally distributed system since enforcing co locally database transactional object also enforces globally database may use possibly different type concurrency control mechanism local mechanism already provides conflict serializability enforcing co locally cause additional aborts since enforcing co locally affect data access scheduling strategy mechanism scheduling determines serializability related aborts mechanism typically consider commitment events order co solution requires communication overhead since uses unmodified atomic commitment protocol messages already needed distributed transaction reach atomicity atomic commitment protocol plays central role distributed co algorithm enforces co globally breaking global cycles cycles span two databases global conflict graph co special cases generalizations interoperable achieve global serializability transparently utilized together single heterogeneous distributed environment comprising objects possibly different concurrency control mechanisms commitment ordering including special cases together generalizations see co variants provides general high performance fully distributed solution central processing component central data structure needed guaranteeing global serializability heterogeneous environments multidatabase systems multiple transactional objects objects states accessed modified transactions e.g. framework transactional processes within cloud computing grid computing co solution scales network size number databases without negative impact performance assuming statistics single distributed transaction e.g. average number databases involved single transaction unchanged proliferation multi-core processors optimistic co oco also increasingly utilized achieve serializability software transactional memory numerous stm articles patents utilizing commit order already published e.g. zhang et al 2006 commitment ordering co special case conflict serializability co enforced non-blocking mechanisms transaction complete task without data-access blocked allows optimistic concurrency control however commitment could blocked co schedule commitment events partial precedence order transactions corresponds precedence partial order respective transactions directed conflict graph precedence graph serializability graph induced conflicting access operations usually read write insert/modify/delete operations co also applies higher level operations conflicting noncommutative well conflicts operations upon multi-version data commitment decision events generated either local commitment mechanism atomic commitment protocol different processes need reach consensus whether commit abort protocol may distributed centralized transactions may committed concurrently commit partial order allows conflicting operations different conflicting operations induce different partial orders transactions conflict graph cycles schedule violate serializability transactions cycle committed case partial order commitment events found thus cycles conflict graph need broken aborting transactions however conflict serializable schedule made co without aborting transaction properly delaying commit events comply transactions precedence partial order co enforcement sufficient concurrency control mechanism since co lacks recoverability property supported well fully distributed global commitment ordering enforcement algorithm exists uses local co participating database needs unmodified atomic commitment protocol messages communication distributed algorithm combination local database co algorithm processes atomic commitment protocol fully distributed atomic commitment protocol essential enforce atomicity distributed transaction decide whether commit abort procedure always carried distributed transactions independently concurrency control co common example atomic commitment protocol two-phase commit protocol resilient many types system failure reliable environment processes usually fail together e.g. integrated circuit simpler protocol atomic commitment may used e.g. simple handshake distributed transaction participating processes arbitrary known special participant transaction coordinator i.e. type one-phase commit protocol atomic commitment protocol reaches consensus among participants whether commit abort distributed global transaction spans participants essential stage protocol yes vote either explicit implicit participant means obligation voting participant obey decision protocol either commit abort otherwise participant unilaterally abort transaction explicit vote protocol commits transaction yes votes received participants thus missing vote typically considered otherwise protocol aborts transaction various atomic commit protocols differ abilities handle different computing environment failure situations amounts work computing resources needed different situations entire co solution global serializability based fact case missing vote distributed transaction atomic commitment protocol eventually aborts transaction database system local co algorithm determines needed commitment order database characterization co order depends local precedence order transactions results local data access scheduling mechanisms accordingly yes votes atomic commitment protocol scheduled unaborted distributed transaction follows vote means yes vote precedence relation conflict exists two transactions second voted first completed either committed aborted prevent possible commit order violation atomic commitment protocol happen since commit order protocol necessarily voting order precedence relation exists voted concurrently vote ordering strategy ensures also atomic commitment protocol maintains commitment order necessary condition guaranteeing global co local co database without global co local co property meaning database co compliant may violated however since database systems schedule transactions independently possible transactions precedence orders two databases compatible global partial order exists embed respective local partial orders together co precedence orders also commitment orders participating databases distributed transaction compatible local precedence orders transaction without knowing typically coordination database systems exists conflicts since needed communication massive unacceptably degrades performance means transaction resides global cycle involving two databases global conflict graph case atomic commitment protocol fail collect votes needed commit transaction vote ordering strategy least one database delay vote transaction indefinitely comply commitment precedence order since waiting completion another preceding transaction global cycle delayed indefinitely another database different order means voting-deadlock situation involving databases cycle result protocol eventually abort deadlocked transaction global cycle since transaction missing least one participant vote selection specific transaction cycle aborted depends atomic commitment protocol abort policies timeout mechanism common may result one needed abort per cycle preventing unnecessary aborts abort time shortening achieved dedicated abort mechanism co abort break global cycle involving distributed transaction deadlocked transactions possibly conflict deadlocked thus blocked free voted worthwhile noting database involved voting-deadlock continues vote regularly transactions conflict deadlocked transaction typically almost outstanding transactions thus case incompatible local partial commitment orders action needed since atomic commitment protocol resolves automatically aborting transaction cause incompatibility means vote ordering strategy also sufficient condition guaranteeing global co following concluded global co implies global serializability global co algorithm comprises enforcing local co participating database system ordering commits local transactions see enforcing co locally enforcing vote ordering strategy theorem global transactions global cycle elimination process voting deadlock explained detail following observation first assumed simplicity every transaction reaches ready-to-commit state voted least one database implies blocking locks occurs define wait vote commit graph directed graph transactions nodes directed edge first transaction second transaction first transaction blocks vote commit second transaction opposite conventional edge direction wait-for graph blocking happens second transaction conflict first transaction see thus wait vote commit graph identical global conflict graph cycle wait vote commit graph means deadlock voting hence deadlock voting cycle conflict graph local cycles confined single database eliminated local serializability mechanisms consequently global cycles left eliminated atomic commitment protocol aborts deadlocked transactions missing blocked respective votes secondly also local commits dealt note enforcing co also waiting regular local commit local transaction block local commits votes transactions upon conflicts situation global transactions change also without simplifying assumption final result also local commitment local transactions without voting atomic commitment finally blocking lock excluded far needs considered lock blocks conflicting operation prevents conflict materialized lock released transaction end may block indirectly either vote local commit another transaction get ready state effect direct blocking vote local commit case cycle generated conflict graph blocking lock also represented edge added edges representing events blocking-by-a-lock conflict graph becoming augmented conflict graph presence co augmented conflict graph fact reversed edge local-commit voting wait-for graph edge exists first transaction either local global second second waiting first end order either voted global locally committed local global cycles across two databases graph generate voting-deadlocks graph global cycles provide complete characterization voting deadlocks may include combination materialized non-materialized conflicts cycles materialized conflicts also cycles regular conflict graph affect serializability one lock related non-materialized conflicts cycle prevent cycle regular conflict graph make locking related deadlock global cycles voting-deadlocks need broken resolved maintain global serializability resolve global deadlocks involving data access locking indeed broken atomic commitment protocol due missing votes upon voting deadlock comment observation also explains correctness extended co eco global transactions voting order must follow conflict graph order vote blocking order relation graph path exists two global transactions local transactions voted local commits blocked upon conflicts results voting-deadlock situations resulting global cycle elimination process eco voting-deadlock situation summarized follows also following locking based special case concluded voting-deadlocks key operation distributed co global cycle elimination voting-deadlock resolution atomic commitment resulting aborted transactions re-executions time consuming regardless concurrency control used databases schedule transactions independently global cycles unavoidable complete analogy cycles/deadlocks generated local ss2pl distribution transaction operation scheduling coordination results autonomy violation typically also substantial performance penalty however many cases likelihood made low implementing database transaction design guidelines reduce number conflicts involving global transaction primarily properly handling hot spots database objects frequent access avoiding conflicts using commutativity possible e.g. extensively using counters finances especially multi-transaction accumulation counters typically hot spots atomic commitment protocols intended designed achieve atomicity without considering database concurrency control abort upon detecting heuristically finding e.g. timeout sometimes mistakenly unnecessarily missing votes typically unaware global cycles protocols specially enhanced co including co variants prevent unnecessary aborts accelerate aborts used breaking global cycles global augmented conflict graph better performance earlier release upon transaction-end computing resources typically locked data example existing locking based global deadlock detection methods timeout generalized consider also local commit vote direct blocking besides data access blocking possible compromise mechanisms effectively detecting breaking frequent relatively simple handle length-2 global cycles using timeout undetected much less frequent longer cycles commitment ordering enforced locally single database dedicated co algorithm algorithm/protocol provides special case co. important protocol utilized extensively database systems generates co schedule strong strict two phase locking protocol ss2pl release transaction locks transaction either committed aborted see ss2pl proper subset intersection 2pl strictness generic local co algorithm raz 1992 algorithm 4.1 algorithm independent implementation details enforces exactly co property block data access nonblocking consists aborting certain set transactions needed upon committing transaction aborts uniquely determined given time minimal set undecided neither committed aborted transactions run locally cause serializability violation future later generate cycles committed transactions conflict graph abort set committed transaction committing transaction abort commit time committed doomed aborted set consists undecided transactions directed edges conflict graph committed transaction size set increase transaction waiting committed ready state processing ended typically decreases time transactions decided thus unless real-time constraints exist complete transaction preferred wait committing transaction let set decrease size another serializability mechanism exists locally eliminates cycles local conflict graph cycle involving transaction exists set empty eventually abort set member needed otherwise set stabilize transactions local cycles aborting set members occur break cycles since case co conflicts generate blocking commit local cycles augments conflict graph see indicate local commit-deadlocks deadlock resolution techniques ss2pl used e.g. like timeout wait-for graph local cycle augmented conflict graph least one non-materialized conflict reflects locking-based deadlock local algorithm applied local augmented conflict graph rather regular local conflict graph comprises generic enhanced local co algorithm single local cycle elimination mechanism guaranteeing local serializability handling locking based local deadlocks practically additional concurrency control mechanism always utilized even solely enforce recoverability generic co algorithm affect local data access scheduling strategy runs alongside local concurrency control mechanism affects commit order reason need abort transactions needed aborted serializability violation prevention combined local concurrency control mechanism net effect co may delay commit events voting distributed environment comply needed commit order delay special cases example ss2pl average significantly less following theorem concluded proliferation multi-core processors variants generic local co algorithm also increasingly utilized concurrent programming transactional memory especially software transactional memory achieving serializability optimistically commit order e.g. ramadan et al 2009 zhang et al 2006 von parun et al 2007 numerous related articles patents utilizing co already published database system multidatabase environment assumed software architecture point view co component implements generic co algorithm locally commitment order coordinator coco designed straightforward way mediator single database system atomic commitment protocol component raz 1991b however coco typically integral part database system coco functions vote commit ready global transactions processing ended according local commitment order vote abort transactions database system initiated abort database system initiate abort transaction many reasons pass atomic commitment decision database system local transactions identified voting needed determining commitment order coco maintains updated representation local conflict graph local augmented conflict graph capturing also locking deadlocks undecided neither committed aborted transactions data structure e.g. utilizing mechanisms similar locking capturing conflicts data-access blocking coco component interface database system receive conflict ready processing ended readiness vote global transaction commit local one abort notifications database system also interfaces atomic commitment protocol vote receive atomic commitment protocol decision global transaction decisions delivered coco database system interface well local transactions commit notifications proper commit order coco including interfaces enhanced implements another variant co see plays role database concurrency control mechanism beyond voting atomic commitment coco also guarantees co locally single isolated database system interface atomic commitment protocol databases participate distributed transactions i.e. transactions span single database use shared concurrency control information use unmodified atomic commitment protocol messages reaching atomicity maintaining local commitment ordering one generalizing variants see necessary condition guaranteeing global serializability proof technique found raz 1992 different proof method raz 1993a also sufficient condition mathematical fact derived definitions serializability transaction means complying co global serializability guaranteed condition condition local concurrency control information sharing databases beyond atomic commit protocol messages atomic commitment minimal requirement distributed transaction since always needed implied definition transaction raz 1992 defines database autonomy independence complying requirement without using additional local knowledge using definition following concluded however definition autonomy implies example transactions scheduled way local transactions confined single database identified autonomous database system realistic transactional objects restrictive less realistic general purpose database systems autonomy augmented ability identify local transactions compliance general property extended commitment ordering eco see makes eco necessary condition raz 2009 notion generalized autonomy captures intended notion autonomy definition probably broadest definition possible context database concurrency control makes co together useful concurrency control information distribution generalizing variants vote ordering vo see co variants necessary condition global serializability i.e. union co generalizing variants necessary set vo may include also new unknown useful generalizing variants commitment ordering co solution technique global serializability summarized follows database transactional object multidatabase environment complies co i.e. arranges local transactions commitments votes global distributed transactions atomic commitment protocol according local database partial order induced local conflict graph serializability graph respective transactions global co global serializability guaranteed database co compliance achieved effectively local conflict serializability based concurrency control mechanism neither affecting transaction execution process scheduling aborting also database autonomy violated low overhead incurred detecting conflicts e.g. locking data-access blocking already detected purposes ordering votes local transactions commits according conflicts case incompatible partial orders two databases global partial order embed respective local partial orders together global cycle spans two databases global conflict graph generated together co results cycle blocked votes voting-deadlock occurs databases cycle however allowed concurrent voting database typically almost outstanding votes continue execute case atomic commitment protocol fails collect votes needed blocked transactions global cycle consequently protocol aborts transaction missing vote breaks global cycle voting-deadlock resolved related blocked votes free executed breaking global cycle global conflict graph ensures global co global serializability maintained thus case incompatible local partial commitment orders action needed since atomic commitment protocol resolves automatically aborting transaction cause incompatibility furthermore also global deadlocks due locking global cycles augmented conflict graph least one data access blocking result voting deadlocks resolved automatically mechanism local co necessary condition guaranteeing global serializability databases involved share concurrency control information beyond unmodified atomic commitment protocol messages i.e. databases autonomous context concurrency control means every global serializability solution autonomous databases must comply co otherwise global serializability may violated thus likely violated quickly high-performance environment co solution scales network size number databases without performance penalty utilizes common distributed atomic commitment architecture distinguishing characteristic co solution distributed serializability techniques fact requires conflict information distributed e.g. local precedence relations locks timestamps tickets makes uniquely effective utilizes unmodified atomic commitment protocol messages already used instead common way achieve distributed serializability distributed system distributed lock manager dlm dlms communicate lock non-materialized conflict information distributed environment typically suffer computer communication latency reduces performance system co allows achieve distributed serializability general conditions without distributed lock manager exhibiting benefits already explored multidatabase environments particular reliability high performance scalability possibility using optimistic concurrency control desired conflict information related communications network incurred overhead delays automatic distributed deadlock resolution distributed transactional systems rely atomic commitment protocol coordinate atomicity whether commit abort among processes distributed transaction also typically recoverable data i.e. data transactions control e.g. database data confused recoverability property schedule directly accessed single transactional data manager component also referred resource manager handles local sub-transactions distributed transaction portion single location e.g. network node even data accessed indirectly entities distributed system transaction i.e. indirect access requires direct access local sub-transaction thus recoverable data distributed transactional system typically partitioned among transactional data managers system transactional data managers typically comprise participants system atomic commitment protocol participant complies co e.g. using ss2pl cocos combination see entire distributed system provides co theorems participant considered separate transactional object thus distributed serializability furthermore co utilized together atomic commitment protocol also distributed deadlocks i.e. deadlocks span two data managers caused data-access locking resolved automatically thus following corollary concluded theorem also means ss2pl co variant used locally transactional data manager data manager exclusive control data distributed lock manager often utilized enforce distributed ss2pl needed distributed ss2pl serializability relevant wide range distributed transactional applications easily designed meet theorem conditions implementing distributed optimistic co doco generic local co algorithm utilized atomic commitment protocol participants system data access blocking thus local deadlocks previous theorem following corollary distributed database system utilizes ss2pl resides two remote nodes b database system two transactional data managers resource managers one node database data partitioned two data managers way exclusive control local node portion data handles data locks without knowledge manager distributed transaction data managers need execute available atomic commitment protocol two distributed transactions formula_3 formula_2 running concurrently access data x y. x exclusive control data manager b manager access x b respective local sub-transactions b portions formula_3 formula_2 nodes following database system schedule certain point time following formula_3 holds read-lock x formula_2 holds read-locks thus formula_27 formula_30 blocked lock compatibility rules ss2pl executed distributed deadlock situation also voting-deadlock see distributed global cycle length 2 number edges conflicts 2 frequent length local sub-transactions following states since atomic commitment protocol receive votes blocked sub-transactions voting-deadlock eventually abort transaction missing vote timeout either formula_3 formula_2 timeouts fall close resolve global deadlock remaining transaction complete running voted committed aborted transaction immediately restarted re-executed scenario conflicts non-materialized global voting-deadlock reflected cycle global wait-for graph global conflict graph see exact characterization voting-deadlocks global cycles however database system utilize co variant exactly conflicts voting-deadlock situation resolution conflicts either materialized non-materialized depending co variant used example sco used distributed database system instead ss2pl two conflicts example materialized local sub-transactions ready states vote blocking occurs two transactions one node co voting rule applied independently b due conflicts formula_52 voted formula_53 ends formula_54 voted formula_55 ends voting-deadlock conflict graph global cycle conflicts materialized resolved atomic commitment protocol distributed serializability maintained unlikely distributed database system possible principle occurs multi-database employ ss2pl b employs sco case global cycle neither wait-for graph serializability graph still augmented conflict graph union two various combinations summarized following table comment examples describe real recommended utilization co example hypothetical demonstration certain experimental distributed memory-resident databases advocate multi single-threaded core music transactional environments single-threaded refers transaction threads serial execution transactions purpose possible orders magnitude gain performance e.g. h-store voltdb relatively conventional transaction execution multiple threads core described music independent way cores distributed may reside one integrated circuit chip many chips possibly distributed geographically many computers environment recoverable transactional data partitioned among threads cores implemented conventional way distributed co described previous sections doco strictness exist automatically however downsides exist straightforward implementation environment practicality general-purpose solution questionable hand tremendous performance gain achieved applications bypass downsides situations comment music straightforward implementation described uses example usual distributed co voting transaction thread blocking atomic commitment protocol needed demonstration connection implementation h-store project music environment local schedules serial thus local optimistic co oco see global co enforcement vote ordering strategy condition atomic commitment protocol met automatically results distributed co compliance thus distributed serializability automatic global voting deadlock resolution furthermore also local strictness follows automatically serial schedule theorem 5.2 raz 1992 page 307 co vote ordering strategy applied also global strictness guaranteed note serial locally mode allows strictness optimistic data access blocking together following concluded special case schedule property classes e.g. ss2pl sco strictly contained co class generalizing classes eco mvco strictly contain co class i.e. include also schedules co compliant generalizing variants also guarantee global serializability without distributing local concurrency control information database generalized autonomy property uses local information relaxing co constraints utilizing additional local information better concurrency performance eco uses knowledge transactions local i.e. confined single database mvco uses availability data versions values like co generalizing variants non-blocking interfere transaction operation scheduling seamlessly combined relevant concurrency control mechanism term co variant refers general co eco mvco combination relevant concurrency control mechanism property including multi-version based eco mveco generalizing variants guarantee global serializability local concurrency control information distribution known may discovered strong strict two phase locking ss2pl also referred rigorousness rigorous scheduling means read write locks transaction released transaction ended either committed aborted set ss2pl schedules proper subset set co schedules property widely utilized database systems since implies co databases use participate global transactions generate together serializable global schedule using atomic commitment protocol needed atomicity multi-database environment database modification addition needed case participate co distributed solution set undecided transactions aborted committing local generic co algorithm empty locks hence algorithm unnecessary case transaction voted database system immediately entering ready state i.e. completing running task locally locks released database system decided atomic commitment protocol thus condition global co enforcing theorem kept automatically local timeout mechanism used database system resolve local ss2pl deadlocks aborting blocked transactions breaks potential local cycles global conflict graph real cycles augmented conflict graph also database system potential global cycles side effect atomic commitment protocol abort mechanism relatively slow independent aborts several entities typically may result unnecessary aborts one transaction per global cycle situation different local wait-for graph based mechanisms identify global cycles atomic commitment protocol break global cycle resulting voting deadlock resolved earlier another database local ss2pl together atomic commitment implying global serializability also deduced directly transactions including distributed obey 2pl ss2pl rules atomic commitment protocol mechanism needed consensus commit rather end phase-two synchronization point probably reason without considering atomic commitment voting mechanism automatic global deadlock resolution noticed co strict commitment ordering sco raz 1991c intersection strictness special case recoverability co provides upper bound schedule concurrency properties exist implemented using blocking mechanisms locking similar used popular ss2pl similar overheads unlike ss2pl sco block read-write conflict possibly blocks commit instead sco ss2pl identical blocking behavior two conflict types write-read write-write result sco shorter average blocking periods concurrency e.g. performance simulations single database significant variant locks ordered sharing identical sco clearly show approximately 100 gain transaction loads also identical transaction loads sco reach higher transaction rates ss2pl lock thrashing occurs concurrency means given computing resources transactions completed time unit higher transaction rate throughput average duration transaction shorter faster completion see chart advantage sco especially significant lock contention sco practical ss2pl since ss2pl provides besides serializability also strictness widely utilized basis efficient recovery databases failure ss2pl mechanism converted sco one better performance straightforward way without changing recovery methods description sco implementation found perrizo tatarinov 1998 see also semi-optimistic database scheduler ss2pl proper subset sco another explanation sco less constraining provides concurrency ss2pl implementing optimistic commitment ordering oco generic local co algorithm utilized without data access blocking thus without local deadlocks oco without transaction operation scheduling constraints covers entire co class special case co class rather useful co variant mechanism characterization extended commitment ordering eco raz 1993a generalizes co local transactions transactions confined single database distinguished global distributed transactions transactions span two databases commitment order applied global transactions thus local database schedule eco property chronological partial order commit events global transactions unimportant local transactions consistent order respective local conflict graph distributed algorithm guarantee global eco exists co algorithm needs unmodified atomic commitment protocol messages order guarantee global serializability database needs guarantee also conflict serializability transactions local concurrency control mechanism condition eco local serializability weaker co allows concurrency cost little complicated local algorithm however practical overhead difference co exists transactions assumed global e.g. information available transactions local eco reduces co. global transaction committed generic local database eco algorithm aborts minimal set undecided transactions neither committed aborted either local transactions global run locally cause later cycle conflict graph set aborted transactions unique contrary co optimized transaction assigned weight determined transaction importance computing resources already invested running transaction optimization carried example reduction max flow networks problem raz 1993a like co set time dependent becomes empty eventually practically almost needed implementations transaction committed set empty set optimization applicable local database concurrency control mechanism separate eco algorithm ensures local cycles eliminated unlike co implies serializability however practically also co local concurrency mechanism utilized least ensure recoverability local transactions always committed concurrently even precedence relation exists unlike co overall transactions local partial order determined local conflict graph possible temporary local cycles since cycles eliminated local serializability mechanism allows also global transactions voted committed concurrently transitively indirect preceding via conflict global transactions committed transitively preceding local transactions state analogy distributed co algorithm stronger concurrent voting condition transitively preceding transactions need committed condition guaranteeing global eco summarized similarly co global eco global cycles global conflict graph eliminated atomic commitment together local serializability i.e. database system maintains serializability locally local cycles eliminated imply global serializability cycles eliminated means database system multidatabase environment provides local serializability mechanism enforces vote ordering strategy theorem generalization co vote ordering strategy global serializability guaranteed local co needed anymore similarly co well eco voting-deadlock situation summarized follows co means also global deadlocks due data-access locking least one lock blocking voting deadlocks automatically resolved atomic commitment multi-version commitment ordering mvco raz 1993b generalization co databases multi-version resources resources read-only transactions block blocked better performance utilizing resources common way nowadays increase concurrency performance generating new version database object time object written allowing transactions read operations several last relevant versions object mvco implies one-copy-serializability 1ser 1sr generalization serializability multi-version resources like co mvco non-blocking combined relevant multi-version concurrency control mechanism without interfering introduced underlying theory mvco conflicts generalized different versions resource differently earlier multi-version theories different versions conflict chronological order replaced version order possibly reversed keeping usual definitions conflicting operations results regular augmented conflict graphs remain unchanged similarly co distributed mvco enforcing algorithm exists mixed environment single-version multi-version resources single-version special case multi-version co mvco algorithm needs unmodified atomic commitment protocol messages additional communication overhead locking-based global deadlocks translate voting deadlocks resolved automatically analogy co following holds mvco generalized employ generalization eco mveco co based snapshot isolation cosi intersection snapshot isolation si mvco si multiversion concurrency control method widely utilized due good performance similarity serializability 1ser several aspects theory raz 1993b mvco described utilized later fekete et al 2005 articles si e.g. cahill et al 2008 see also making snapshot isolation serializable references analyzing conflicts si order make serializable method presented cahill et al 2008 serializable snapshot isolation serializablesi low overhead modification si provides good performance results versus si small penalty enforcing serializability different method combining si mvco cosi makes si serializable well relatively low overhead similarly combining generic co algorithm single-version mechanisms furthermore resulting combination cosi mvco compliant allows cosi compliant database systems inter-operate transparently participate co solution distributed/global serializability see besides overheads also protocols behaviors need compared quantitatively one hand serializable si schedules made mvco cosi possible commit delays needed without aborting transactions hand serializablesi known unnecessarily abort restart certain percentages transactions also serializable si schedules co variants e.g. ss2pl sco oco eco mvco global serializability achieved via atomic commitment protocol based distributed algorithms co variants atomic commitment protocol instrument eliminate global cycles cycles span two databases global augmented thus also regular conflict graph implicitly global data structure implementation needed cases either incompatible local commitment orders two databases global partial order embed respective local partial orders together data-access locking related voting deadlock implying global cycle global augmented conflict graph missing votes atomic commitment protocol breaks cycle aborting undecided transaction see distributed co algorithm differences various variants exist local level within participating database systems local co instance variant role determine position every global transaction transaction spans two databases within local commitment order i.e. determine transaction turn voted locally atomic commitment protocol thus co variants exhibit behavior regard atomic commitment means interoperable via atomic commitment using software interfaces typically provided services already standardized atomic commitment primarily two phase commit protocol e.g. x/open xa transparently utilized together distributed environment co variant instance possibly associated relevant local concurrency control mechanism type summary single global transaction participate simultaneously databases may employ possibly different co variant concurrently running processes database running concurrently local global transactions database atomic commitment protocol indifferent co distinguish various co variants global cycle generated augmented global conflict graph may span databases different co variants generate broken local abort voting deadlock resolved atomic commitment exactly way single co variant environment local cycles possibly mixed materialized non-materialized conflicts serializability data-access-locking deadlock related e.g. sco resolved locally respective variant instance local mechanisms vote ordering vo generalized co gco raz 2009 union co variants useful concept global serializability technique comply vo local serializability general form commutativity based including multi-versioning vote order strategy voting local precedence order needed combining results co variants following concluded | [
2633,
5209,
3951,
5289,
7453,
740,
6739,
3801,
4159,
2411,
3396,
2054,
7115,
2961,
1132,
8132,
6315,
5447,
2359
] | Test |
5,290 | 1 | Domain_relational_calculus:domain relational calculus computer science domain relational calculus drc calculus introduced michel lacroix alain pirotte declarative database query language relational data model drc queries form x either domain variable constant formula_2 denotes drc formula result query set tuples x x make drc formula true language uses operators tuple calculus logical connectives ∧ ∨ ¬ existential quantifier ∃ universal quantifier ∀ used bind variables computational expressiveness equivalent relational algebra let b c mean rank name id enterprise relation let e f mean name deptname id department relation find captains starship uss enterprise formula_3 example b c denotes result set set table enterprise find names enterprise crew members stellar cartography formula_4 example 're looking name b condition f c requirement need find enterprise crew members stellar cartography department alternate representation previous example would formula_5 example value requested f domain directly placed formula c domain variable re-used query existence department since already holds crew member id | [
2878,
3011,
6543,
684
] | Train |
5,291 | 4 | Reboot_Restore_Rx:reboot restore rx reboot restore rx horizon data sys freeware application microsoft windows acts alternative windows steadystate allows users restore computer back established baseline helps prevent long term damage computer operating system os upon installation administrator reboot restore rx establish baseline baseline point computer return upon reboot administrator allowed update baseline done tray icon program program operates outside windows master boot record mbr protects mbr also allows user boot windows even windows otherwise unbootable whether software change blue screen death alternative windows steadystate reboot restore rx works maintain computer constant state alternatives including faronic deep freeze toolwiz time machine reboot restore rx pro formerly drive vaccine rollback rx latter two developed developer reboot restore rx horizon data sys reboot restore rx received generally favourable reviews received many awards review techrepublic said looking make -accessible pc junk proof consistently reliable reboot restore rx definitely nice product consider preserving peace freeware release might nearly customizable microsoft steadystate time least system thank allowing condition deteriorate rapidly abuse review product lifehacker wrote nothing worse rebooting computer thinking everything fine find something busted need troubleshoot especially bad start problems driver update series windows updates 're stuck trying figure thing caused problem first place reboot restore rx takes hassle app even restore windows wo n't boot reboot restore rx award best new product 31st annual tech learning awards | [
4759,
5571
] | Test |
5,292 | 2 | Greg_Kroah-Hartman:greg kroah-hartman greg kroah-hartman gkh major linux kernel developer linux kernel maintainer codice_1 branch staging subsystem usb driver core debugfs kref kobject sysfs kernel subsystems userspace i/o hans j. koch tty layer also created linux-hotplug udev project linux driver project worked novell suse labs division works linux foundation co-author linux device drivers 3rd edition author linux kernel nutshell used contributing editor linux journal also contributes articles lwn.net computing news site kroah-hartman frequently helps documentation kernel driver development talks tutorials 2006 released cd image material introduce programmer working linux device driver development kroah-hartman strong advocate stable kernel–user space api i.e advocate stable kernel interface/binary kernel interface general user space programs also initiated development opensuse tumbleweed bleeding-edge rolling release model edition opensuse | [
2182,
3938,
3613,
1822,
7528,
7532,
4685,
5744,
6443,
4341,
7559,
5759,
5762,
412,
3666,
2260,
5453,
7242,
462,
1535,
1924,
6892,
1176,
4401,
1933,
5829,
1192,
1208,
6211,
2680,
4435,
2689,
5865,
7669,
3404,
1227,
1596,
165,
7312,
1607,
... | Test |
5,293 | 0 | Pheme_(project):pheme project pheme 36-month research project establishing veracity claims made internet unverified content dominant prolific social media messages big data typically presents challenges information volume variety velocity social media presents fourth establishing veracity pheme project aims analyse content real time determine accurate claims made claims propagate social network individual chooses whether pass information based accurate think analysing language used spread information network well spatial temporal context information used build real-time lie detector social media help example emergency services already integrate social media part alerting response systems flag potential hoax emergencies evaluating authority sources automatically also project goal based treatment news information comes example tweet bbc news article would hold weight one unknown source project named greek goddess pheme pheme addresses social media lies two scenarios information healthcare particularly damaging wrong information used journalists pheme addresses speculation controversy misinformation disinformation project partnership university sheffield part gate university warwick king college london saarland university germany modul university vienna four companies also taking part atos ihub nairobi ontotext swissinfo pheme funded eu | [
5429
] | Test |
5,294 | 3 | Labyrinth:_The_Computer_Game:labyrinth computer game labyrinth computer game 1986 graphic adventure game developed lucasfilm games published activision based fantasy film labyrinth tasks player navigating maze solving puzzles evading dangers player goal find defeat main antagonist jareth within 13 real-time hours unlike adventure games period labyrinth feature command-line interface instead player uses two scrolling word wheel menus screen construct basic sentences labyrinth first adventure game created lucasfilm project led designer david fox invented word wheels avoid text parsers syntax guessing typical text-based adventure games early development team collaborated author douglas adams week-long series brainstorming sessions inspired much final product labyrinth received positive reviews united states bigger commercial success film upon based design influenced lucasfilm subsequent adventure title critically acclaimed maniac mansion labyrinth computer game graphic adventure game player maneuvers character maze solving puzzles evading dangers adaptation 1986 film labyrinth many whose events characters reproduced game however follow plot film beginning player enters name sex favorite color last two fields determine appearance player character afterward short text-based adventure sequence unfolds wherein player enters movie theater watch film labyrinth game changes graphic adventure format jareth main antagonist appears projection screen transports protagonist labyrinthine prison player goal locate destroy jareth within 13 real-time hours otherwise protagonist trapped maze forever traveling maze player passes series scrolling hallways contain doors enemies things radar bar screen allows player see hallway miniature form locations doorways items characters given hallway displayed unlike adventure games period labyrinth feature command-line interface instead typing commands player selects two scrolling word wheels one verbs one nouns example verb congratulate may selected one wheel noun jareth inputs command congratulate jareth based player items location available verbs nouns change context-sensitively lucasfilm games began design labyrinth computer game 1985 company head george lucas requested tie-in video game movie name production lucasfilm common lucasfilm games projects lucas provided little direction team labyrinth first licensed game developed company earlier products rescue fractalus eidolon original intellectual properties according project leader david fox working license frees ways restricts adaptation team pressured reuse events characters labyrinth film felt obligated follow source material saw film adventure story chose set adaptation adventure game genre however fox disliked genre then-reliance text parsers syntax guessing created word wheel menus replacement meant supply limited set words still let lot things order streamline game without hampering player freedom game visual design shared lucasfilm habitat massively multiplayer online game production time early development game team screened rough cut film afterward sent london lucasfilm management one-week brainstorming session douglas adams author hitchhiker guide galaxy adams worked previously infocom development book 1984 video game adaptation also present meetings writer christopher cerf friend film director jim henson brenda laurel activision game publisher team worked extensively adams period laurel later wrote every day fresh blast wild intelligent humor stoked creativity team view pinnacle meetings adams idea opening sequence suggested reference wizard oz famous transition black-and-white color transition text-based format graphical one fox given job taking notes trip although hoped complete design emerge meetings returned london sheets sheets ideas sifted find usable concepts however material influenced game many adams suggestions used retrospectively fox felt opening sequence mistake called tedious believed alienated potential fans labyrinth released 1986 commodore 64 apple ii msx united states labyrinth commercially successful film upon based commodore magazine mark cotone lauded game puzzle design detailed graphics newcomer-friendly interface believed experienced players would enjoy depth challenging puzzles keith campbell commodore user praised animation dubbed superb game —which found unusual given status tie-in product however campbell hesitated call adventure game wrote word wheels rather tedious genre veterans roy wagner computer gaming world summarized labyrinth well done game excellent user interface writing computer video games matthew woodley praised game variety interface disliked long loading times believed small price pay brilliant game however labyrinth criticized three reviewers zzap 64 although praised visuals co-reviewer paul sumner called game slow-paced action title simplistic adventure co-reviewer julian rignall considered boring real disappointment given lucasfilm strong track record labyrinth first adventure game produced lucasfilm became critically acclaimed commercially successful developer genre game technology mechanics influenced company subsequent title maniac mansion whose scumm engine reused many lucasfilm adventure games word wheels predecessor game point-and-click interface gary winnick artist labyrinth went lead production maniac mansion ron gilbert fox contributed maniac mansion well later directed lucasfilm zak mckracken alien mindbenders retrospectively writers australian broadcasting corporation regarded labyrinth solid first attempt inferior real classics made afterward lucasfilm | [
8195,
3571
] | Train |
5,295 | 1 | ArcSDE:arcsde arcsde spatial database engine server-software sub-system produced marketed esri aims enable usage relational database management systems spatial data spatial data may used part geodatabase geographic technologies incorporated gti australia originally designed database software named spatial database engine sdbe development shifted salamanca software pvt ltd. developed first production version sdbe originally used interbase dbms president esri jack dangermond announced sde gis'95 conference vancouver british columbia esri purchased salamanca software 1996 esri rebranded software arcsde follow naming convention products arcsde grew meet need users geographic data robust multi-user editing storage access extremely large geospatial databases arcsde supports esri geodatabase implementation product began stand-alone software esri integrated arcgis version 9.2 2013 esri announced plans deprecate arcsde command line tools arcsde application server following forthcoming release arcgis 10.2. release 10.1 esri sells arcsde component arcgis server part arcgis family software products integrates geographic-information query mapping spatial analysis editing within multi-user enterprise dbms environment 2010 alternative tools connecting arcmap dbms postgres sql server.. st-links pgmap blue spatial server arcsde enables organizations move traditional approach — managing separate collections geographic data files — integrated environment one manage spatial data continuous database accessible entire organization simultaneously easily publishable web arcsde application server facilitates storing managing spatial data raster vector survey dbms makes data available many applications arcsde allows one manage spatial data four commercial databases ibm db2 informix microsoft sql server oracle starting 9.3 release esri added support open-source postgresql database arcsde serves data advanced arcgis desktop products arcview arceditor arcinfo arcgis development products arcgis engine arcgis server arcview 3.x well arcims key component managing multi-user esri-based gis traditional rdbms software keeps track tables records contained database arcsde pushes relational model higher client software manage geographic data comprise several tables seamlessly user need awareness dealings particulars rdbms gis environment routes connections database arcsde middleware manages storing retrieval data | [
4798,
4759,
5571,
84,
7715,
578,
900,
5666,
5956
] | Test |
5,296 | 3 | MOS_Technology_6508:mos technology 6508 mos technology 6508 8-bit microprocessor designed mos technology based popular 6502 6508 augmented two additional features internal 8-bit digital i/o port 256 bytes internal static ram internal ram mapped cpu address space 0000- 00ff 0100- 01ff serve zero page stack space i/o port available location 0001 data-direction register 0000 layout used 6510 may different strapping/bonding variants chip datasheet lists pin 40 clock phase two cbm900 computer 6508 controlling floppydisk pin 40 set overflow pin also offered 40-pin 6502 omitted 28-pin 650x variants 6503–6507 pin 6500 family cpus sets overflow flag p register tested using bvc/bvs instructions using tight polling loop 3 machine cycles constructed tighter minimum two instructions test branch loop using pin functionality | [
7960,
7519,
468,
5114,
7531,
7730,
310,
2237,
4532,
7668,
3905,
7222,
1237,
3918,
5087
] | Test |
5,297 | 4 | Reception_and_criticism_of_WhatsApp_security_and_privacy_features:reception criticism whatsapp security privacy features article provides detailed historic account reception criticism security privacy features whatsapp messaging service may 20 2011 unconfirmed security researcher netherlands pseudonym whatsapphack published dutch websites tweakers.net geenstijl method whatsapp accounts could hijacked researcher noticed flaw authentication process allowed researcher hijack account trying login another phone number intercepting verification sms text message specific conditions remained outbox symbian phone whatsapp client would attempt send android verification message could obtained reading radio tool named logcat researcher would copy send intercepted verification message real number phone using sms gateway spoof sender phone number number researcher tried maliciously login method worked whatsapp issued patch within one day publication articles android symbian clients whatsapp security mechanism design would disable account phone original owner phone number whatsapp account may 2011 another security hole reported left communication whatsapp susceptible packet analysis whatsapp communications encrypted data sent received plaintext meaning messages could easily read packet traces available may 2012 security researchers noticed new updates whatsapp longer sent messages plaintext cryptographic method implemented subsequently described broken august 2012 whatsapp support staff said messages encrypted latest version whatsapp software ios android blackberry windows phone symbian without specifying cryptographic method january 6 2012 unknown hacker published website made possible change status arbitrary whatsapp user long phone number known make work required restart app according hacker one many security problems whatsapp january 9 whatsapp reported resolved problem although measure actually taken block website ip address reaction windows tool made available download providing functionality problem since resolved form ip address check currently logged-in sessions german tech site h demonstrated use whatsapi hijack whatsapp account september 14 2012 shortly legal threat whatsapi developers alleged characterized h apparent reaction security reports whatsapi source code taken days whatsapi team since returned active development march 31 2013 saudi arabian communications information technology commission citc issued statement regarding possible measures whatsapp among applications unless service providers took serious steps comply monitoring privacy regulations february 2014 public authority data privacy german state schleswig-holstein advised using whatsapp service lacked privacy protection end-to-end client side encryption technology whatsapp started implementing end-to-end encryption late 2014 finished april 2016 major privacy security problem subject joint canadian-dutch government investigation primary concern whatsapp required users upload mobile phone entire address book whatsapp servers whatsapp could discover among users contacts available via whatsapp fast convenient way quickly find connect user contacts also using whatsapp meant address book mirrored whatsapp servers including contact information contacts using whatsapp information consisted solely phone numbers without additional information name contact stored hashed though salted form late 2015 dutch government released press-statement claiming whatsapp changed hashing method making much harder reverse thus fully complies rules regulations user need send friend request send messages another user due contact discovery mentioned november 2014 whatsapp introduced feature named read receipts alerts senders messages read recipients within week whatsapp introduced update allowing users disable feature message recipients send acknowledgements december 1 2014 indrajeet bhuyan saurav kar 17 years old demonstrated whatsapp message handler vulnerability allows anyone remotely crash whatsapp sending specially crafted message 2kb size escape problem user receives specially crafted message delete his/her whole conversation start fresh chat opening message keeps crashing whatsapp unless chat deleted completely early 2015 whatsapp launched web client used browser bhuyan also found two security issues compromised user privacy whatsapp photo privacy bug whatsapp web photo sync bug february 2015 dutch university student named maikel zweerink published app set prove anyone could track whatsapp user status also keep eye changing profile pictures privacy settings status messages regardless privacy settings march 2 2016 whatsapp introduced document-sharing feature initially allowing users share pdf files contacts however whatsapp default state automatically downloading attachments raised concerns press risk security support document sharing expanded beyond pdf files august 2016 whatsapp announced start sharing account information facebook consisting phone number account owner aggregated analytical data address books metadata users shared according whatsapp account information shared track basic metrics often people use services better fight spam whatsapp connecting phone number facebook systems facebook offer better friend suggestions show relevant ads account means facebook target advertisements facebook platform better making links users based phone numbers make friend suggestions users based whatsapp data user data shared advertisers used internally facebook services whatsapp emphasizes content user messages still kept private thanks end-to-end encryption means whatsapp read content chats however users given choice opt sharing data facebook advertisement purposes october 2016 article 29 working party stated serious concerns regarding manner information relating updated terms service privacy policy provided users consequently validity users ’ consent april 5 2016 end-to-end encryption users communications including file transfers voice calls supported users latest client encryption enabled default uses curve25519 key exchange hkdf generation session keys aes-256 cbc mode encryption hmac-sha256 integrity verification sha512 generating two 30 digit fingerprints users identity keys verify needed even company would unable decrypt users communications amnesty international security professionals praised move us federal bureau investigation criticised threatening work law enforcement telegram another messaging service reported bbc used islamic state extremists whatsapp messaging service provides end-to-end encryption among others threema wickr signal silent phone line also provide encryption default imessage viber provide special circumstances telegram provides end-to-end encryption opt-in feature support end-to-end encrypted group messaging whatsapp score 6 7 points electronic frontier foundation secure messaging scorecard received points communications encrypted transit communications encrypted keys provider n't access allowing users verify contacts identities past messages secure encryption keys stolen completed recent independent security audit security designs properly documented missing point code open independent review january 13 2017 guardian reported security researcher tobias boelter found whatsapp policy forcing re-encryption initially undelivered messages without informing recipient constituted serious loophole whereby whatsapp could disclose compelled disclose content messages whatsapp open whisper systems officials disagreed assessment follow-up article boelter explained greater detail considered specific vulnerability article since removed guardian due inaccuracies boelter representation facts complaints 73 renowned security researchers guardian forced substantially revise correct articles well therefore june 2017 guardian readers ’ editor paul chadwick wrote guardian wrong report january popular messaging service whatsapp security flaw serious huge threat freedom speech chadwick also noted since guardian article whatsapp better secured introduction optional two-factor verification february however important note feature already introduced public beta versions whatsapp early november 2016 months guardian wrote alleged issue january 15 2017 research team ruhr university bochum published security analysis group messaging protocols whatsapp signal threema among deficiencies found whatsapp servers effectively control membership groups consequently server add arbitrary phone numbers groups including future communication becomes insecure even though manipulations could detected weakens end-to-end security guarantees october 2017 german software company open-xchange criticised whatapps slack using proprietary software stated plans create open source alternative may 2019 revealed security vulnerability whatsapp allowing remote person install spyware making call even need answered later june 2019 another vulnerability revealed allowing user transform audio call video call without victim consent without victim noticing bug bounty 5000 usd offered bug june 2019 whatsapp announced would take legal action users send disproportionately high number messages using communication platform company reiterated platform meant private messaging businesses interact customers business app notification website company stated beginning december 7 2019 whatsapp take legal action determine engaged assisting others abuse violates terms service automated bulk messaging | [
6574,
1998,
6312,
501,
3050,
6305
] | Test |
5,298 | 3 | Hotbit:hotbit hotbit hb-8000 msx home computer developed sold brazilian subsidiary sharp corporation epcom home computer division mid-1980s msx machines popular brazil time virtually killed competing 8 bit microcomputers brazilian market hotbit three versions 1.0 1.1 gray white case 1.2 black case rom slightly modified solve ascii table compatibility issue popular brazilian msx gradiente expert | [
768,
8003,
824,
5571,
1237,
974
] | Test |
5,299 | 8 | Web_Application_Description_Language:web application description language web application description language wadl machine-readable xml description http-based web services wadl models resources provided service relationships wadl intended simplify reuse web services based existing http architecture web platform language independent aims promote reuse applications beyond basic use web browser wadl submitted world wide web consortium sun microsystems 31 august 2009 consortium current plans standardize wadl rest equivalent soap web services description language wsdl also used describe rest web services service described using set resource elements resource contains param elements describe inputs method elements describe request response resource request element specifies represent input types required specific http headers required response describes representation service response well fault information deal errors following listing shows example wadl description yahoo news search application multiple tools generate java code existing wadl app xmlns= http //research.sun.com/wadl/2006/10 xmlns xs= http //www.w3.org/2001/xmlschema /app | [
7299,
6986,
5631,
5874,
2797,
7315,
1479,
87,
3383
] | Test |
5,300 | 9 | EMSO_simulator:emso simulator emso simulator equation-oriented process simulator graphical interface modeling complex dynamic steady-state processes cape-open compliant emso stands environment modeling simulation optimization alsoc project portuguese acronym free environment simulation optimization control processes based ufrgs develops maintains distributes object-oriented software pre-built models available emso modeling library eml new models written emso modeling language user embed models coded c c++ fortran simulation environment | [
6527,
4759,
5571,
5659,
578,
2803,
6566,
6912,
1435,
5117
] | Test |
5,301 | 3 | DB13W3:db13w3 db13w3 13w3 style d-subminiature connector commonly used analog video interfaces used primarily sun microsystems silicon graphics sgi ibm risc workstations well displays apple computer next computer intergraph corporation 13w3 connector longer used modern displays superseded use analog displays vga connector display market moved digital flat panel displays turn replaced almost entirely digital connections dvi hdmi displayport connector contains 10 standard signal pins 3 larger positions fitted either special pins two concentric contacts coaxial cable special high-current pins used video signals computer side pins female coaxial connectors large positions male coaxial connectors carry video signal split red green/gray blue standard signal pins carry four grounds three sense pins used communicate monitor vertical sync horizontal sync composite sync signal 13w3 connector converted standard vga connector using commonly available cables adapters allows multisync monitors became prevalent personal computing late 1980s used workstations long sync-on-green compatible likewise later-generation sun monitors began supporting multisync 1998 connected via similar cables personal computers even though 13w3 standard connector sync signals maintained different pins based display system sun intergraph ibm sgi use different pin configurations monitor sense id sync signals sun sgi even two different pin configurations without display data channel support sun ddc connector used least upa graphics adapters creator 3d expert 3d corresponding monitors gd5410 gd5510 make matching correct cable monitor virtually impossible many monitors 13w3 connectors support separate sync supplied pc systems converters exist allow connecting newer monitors vga connectors older systems workstations popular cable series dip switches built used set sync signals variant db13w3 connector high-current pins instead high-frequency pins used video applications also used 3com superstack ethernet switches carry dc power | [
6307,
7010,
4799,
5587,
7679,
7659,
7781,
5450,
5335
] | Test |
5,302 | 2 | Android_Lollipop:android lollipop android lollipop codenamed android l development fifth major version android mobile operating system developed google spanning versions 5.0 5.1.1 unveiled june 25 2014 google i/o 2014 conference became available official over-the-air ota updates november 12 2014 select devices run distributions android serviced google nexus google play edition devices source code made available november 3 2014 fifth major update twelfth version android one prominent changes lollipop release redesigned user interface built around design language known material design made retain paper-like feel interface changes include improvements notifications accessed lockscreen displayed within applications top-of-the-screen banners google also made internal changes platform android runtime art officially replacing dalvik improved application performance changes intended improve optimize battery usage statistics issued google indicate lollipop versions 14.5 share combined android devices accessing google play android lollipop succeeded android marshmallow released october 2015 release internally codenamed lemon meringue pie android 5.0 first unveiled codename android l june 25 2014 keynote presentation google i/o developers conference alongside lollipop presentation focused number new android-oriented platforms technologies including android tv in-car platform android auto wearable computing platform android wear health tracking platform google fit part presentation dedicated new cross-platform design language referred material design expanding upon card motifs first seen google design increased use grid-based layouts responsive animations transitions padding depth effects lighting shadows designer matías duarte explained unlike real paper digital material expand reform intelligently material physical surfaces edges seams shadows provide meaning touch material design language used android across google suite web software well providing consistent experience across platforms android 5.0 introduces refreshed notification system individual notifications displayed cards adhere material design language batches notifications grouped app produced notifications displayed lock screen cards heads notifications also displayed large banners across top screen along respective action buttons do-not-disturb feature also added notifications recent apps menu redesigned use three-dimensional stack cards represent open apps individual apps also display multiple cards recents menu web browser open tabs lollipop also contains major new platform features developers 5,000 new apis added use applications example possibility save photos raw image format additionally dalvik virtual machine officially replaced android runtime art new runtime environment introduced technology preview kitkat art cross-platform runtime supports x86 arm mips architectures 32-bit 64-bit environments unlike dalvik uses just-in-time compilation jit art compiles apps upon installation run exclusively compiled version technique removes processing overhead associated jit process improving system performance lollipop also aims improve battery consumption series optimizations known project volta among changes new battery saver mode job scheduling apis restrict certain tasks occur wi-fi batching tasks reduce overall amount time internal radios active new developer tool called battery historian used tracking battery consumption apps use android extension pack apis also provide graphics functions new shaders aiming provide pc-level graphics 3d games android devices number system-level enterprise-oriented features also introduced banner android work samsung knox security framework initially planned used foundation android work instead google opted use technology segregating personal work-oriented data device along accompanying apis managing environment smart lock feature devices also configured users perform device unlocking pin pattern trusted location proximity designated bluetooth device nfc tag lollipop additionally device encryption enabled default capable devices however due performance issues change held successor android marshmallow developer preview android l build lpv79 released nexus 5 2013 nexus 7 june 26 2014 form flashable images source code gpl-licensed components developer preview released via android open source project aosp july 2014 second developer preview build lpv81c released august 7 2014 alongside beta version google fit platform sdk previous build second developer preview build available nexus 5 2013 nexus 7 october 15 2014 google officially announced android l would known android 5.0 lollipop company also unveiled launch devices android5.0including motorola nexus 6 htc nexus 9for release november 3 2014 google stated nexus including nexus 4 5 7 10 google play edition devices would receive updates lollipop coming weeks one developer preview build nexus devices new sdk revision application developers would released october 17 2014 update schedules third-party android devices may vary manufacturer full source code android5.0 pushed aosp november 3 2014 allowing developers oems begin producing builds operating system december 2 2014 factory images nexus smartphones tablets updated 5.0.1 version introduces bug fixes serious bug affects nexus 4 devices prevents audio working phone calls device-specific lollipop 5.0.2 lrx22g version released first-generation nexus 7 december 19 2014 android5.1 updated version lollipop unveiled february 2015 part indonesian launch android one preloaded android one devices sold indonesia philippines google officially announced 5.1 releasing updates existing devices march 9 2015 2015 amazon.com forked lollipop produce fire os 5 bellini amazon fire hd-series devices | [
3933,
5372,
6427,
1095,
740,
5055,
4340,
42,
3309,
3310,
7924,
2591,
5771,
5775,
6153,
7956,
5455,
6176,
5473,
474,
6183,
822,
831,
5141,
136,
2317,
2673,
6209,
1582,
2683,
855,
6937,
168,
6232,
6950,
2712,
4116,
5195,
2003,
195,
6978,
... | Test |
5,303 | 0 | EuroWordNet:eurowordnet eurowordnet system semantic networks european languages based wordnet language develops wordnet interconnected interlingual links stored interlingual index ili unlike original princeton wordnet wordnets freely available original eurowordnet project dealt dutch italian spanish german french czech estonian wordnets frozen wordnets languages developed varying degrees examples eurowordnet available free access full database however charged cases openthesaurus babelnet may serve free alternative | [
4288,
1314,
282
] | Train |
5,304 | 0 | Text_corpus:text corpus linguistics corpus plural corpora text corpus large structured set texts nowadays usually electronically stored processed corpus linguistics used statistical analysis hypothesis testing checking occurrences validating linguistic rules within specific language territory corpus may contain texts single language monolingual corpus text data multiple languages multilingual corpus multilingual corpora specially formatted side-by-side comparison called aligned parallel corpora two main types parallel corpora contain texts two languages translation corpus texts one language translations texts language comparable corpus texts kind cover content translations exploit parallel text kind text alignment identifying equivalent text segments phrases sentences prerequisite analysis machine translation algorithms translating two languages often trained using parallel fragments comprising first language corpus second language corpus element-for-element translation first language corpus order make corpora useful linguistic research often subjected process known annotation example annotating corpus part-of-speech tagging pos-tagging information word part speech verb noun adjective etc added corpus form tags another example indicating lemma base form word language corpus working language researchers use interlinear glossing used make annotation bilingual corpora structured levels analysis applied particular number smaller corpora may fully parsed corpora usually called treebanks parsed corpora difficulty ensuring entire corpus completely consistently annotated means corpora usually smaller containing around one three million words levels linguistic structured analysis possible including annotations morphology semantics pragmatics corpora main knowledge base corpus linguistics analysis processing various types corpora also subject much work computational linguistics speech recognition machine translation often used create hidden markov models part speech tagging purposes corpora frequency lists derived useful language teaching corpora considered type foreign language writing aid contextualised grammatical knowledge acquired non-native language users exposure authentic texts corpora allows learners grasp manner sentence formation target language enabling effective writing text corpora also used study historical documents example attempts decipher ancient scripts biblical scholarship archaeological corpora short duration provide snapshot time one shortest corpora time may 15–30 year amarna letters texts 1350 bc corpus ancient city example kültepe texts turkey may go series corpora determined find site dates | [
3601,
5800,
1718,
7422,
1444,
4760,
8065,
715,
4037,
2645,
3959,
2648,
3960,
2022,
3965,
3292,
2215,
1751,
5136,
7372,
4337,
1573,
3651,
2590,
4349,
1966,
7389,
8013,
7578,
4089,
1314,
5429,
6942,
6767,
2611,
5528,
5612,
7410,
3158,
7138,... | Test |
5,305 | 4 | Row_hammer:row hammer row hammer also written rowhammer unintended undesirable side effect dynamic random-access memory dram memory cells leak charges interact electrically possibly leaking changing contents nearby memory rows addressed original memory access bypass isolation dram memory cells results high cell density modern dram triggered specially crafted memory access patterns rapidly activate memory rows numerous times row hammer effect used privilege escalation computer security exploits network-based attacks also theoretically possible fast network connection attacker victim different hardware-based techniques exist prevent row hammer effect occurring including required support processors types dram memory modules row hammer rarely never affects ddr ddr2 sdram modules affects many ddr3 ddr4 sdram modules dynamic ram dram bit stored data occupies separate memory cell electrically implemented one capacitor one transistor charge state capacitor charged discharged determines whether dram cell stores 1 0 binary value huge numbers dram memory cells packed integrated circuits together additional logic organises cells purposes reading writing refreshing data memory cells blue squares illustration organised matrices addressed rows columns memory address applied matrix broken row address column address processed row column address decoders illustration vertical horizontal green rectangles respectively row address selects row read operation selection also known row activation bits cells row transferred sense amplifiers form row buffer red squares illustration exact bit selected using column address consequently read operations destructive nature design dram requires memory cells rewritten values read transferring cell charges row buffer write operations decode addresses similar way result design entire rows must rewritten value single bit changed result storing data bits using capacitors natural discharge rate dram memory cells lose state time require periodic rewriting memory cells process known refreshing another result design dram memory susceptible random changes stored data known soft memory errors attributed cosmic rays causes different techniques counteract soft memory errors improve reliability dram error-correcting code ecc memory advanced variants lockstep memory commonly used increased densities dram integrated circuits ics led physically smaller memory cells capable storing smaller charges resulting lower operational noise margins increased rates electromagnetic interactions memory cells greater possibility data loss result disturbance errors observed caused cells interfering operation manifesting random changes values bits stored affected memory cells awareness disturbance errors dates back early 1970s intel 1103 first commercially available dram ic since dram manufacturers employed various mitigation techniques counteract disturbance errors improving isolation cells performing production testing however researchers proved 2014 analysis commercially available ddr3 sdram chips manufactured 2012 2013 susceptible disturbance errors using term row hammer name associated side effect led observed bit flips opportunity row hammer effect occur ddr3 memory primarily attributed ddr3 high density memory cells results associated interactions cells rapid dram row activations determined primary cause frequent row activations cause voltage fluctuations associated row selection lines observed induce higher-than-natural discharge rates capacitors belonging nearby adjacent cases memory rows called victim rows affected memory cells refreshed lose much charge disturbance errors occur tests show disturbance error may observed performing around 139,000 subsequent memory row accesses cache flushes one memory cell every 1,700 cells may susceptible tests also show rate disturbance errors substantially affected increased environment temperature depends actual contents dram certain bit patterns result significantly higher disturbance error rates variant called double-sided hammering involves targeted activations two dram rows surrounding victim row illustration provided section variant would activating yellow rows aim inducing bit flips purple row case would victim row tests show approach may result significantly higher rate disturbance errors compared variant activates one victim row neighbouring dram rows different methods exist less successful detection prevention correction mitigation row hammer effect tests show simple ecc solutions providing single-error correction double-error detection sec ded capabilities able correct detect observed disturbance errors include two flipped bits per memory word flipping three bits prevents ecc noticing modification effective solution introduce frequent memory refreshing refresh intervals shorter usual 64 ms technique results higher power consumption increased processing overhead vendors provide firmware updates implement type mitigation one complex prevention measures performs counter-based identification frequently accessed memory rows proactively refreshes neighbouring rows another method issues additional infrequent random refreshes memory rows neighbouring accessed rows regardless access frequency research shows two prevention measures cause negligible performance impacts since release ivy bridge microarchitecture intel xeon processors support so-called pseudo target row refresh ptrr used combination ptrr-compliant ddr3 dual in-line memory modules dimms mitigate row hammer effect automatically refreshing possible victim rows negative impact performance power consumption used dimms ptrr-compliant xeon processors default fall back performing dram refreshes twice usual frequency results slightly higher memory access latency may reduce memory bandwidth 2–4 lpddr4 mobile memory standard published jedec includes optional hardware support so-called target row refresh trr prevents row hammer effect without negatively impacting performance power consumption additionally manufacturers implement trr ddr4 products although part ddr4 memory standard published jedec internally trr identifies possible victim rows counting number row activations comparing predefined chip-specific maximum activate count mac maximum activate window values refreshes rows prevent bit flips mac value maximum total number row activations may encountered particular dram row within time interval equal shorter amount time neighbouring rows identified victim rows trr may also flag row victim row sum row activations two neighbouring rows reaches mac limit within time window due necessity huge numbers rapidly performed dram row activations row hammer exploits issue large numbers uncached memory accesses cause cache misses detected monitoring rate cache misses unusual peaks using hardware performance counters version 5.0 memtest86 memory diagnostic software released december 3 2013 added row hammer test checks whether computer ram susceptible disturbance errors works computer boots uefi without uefi boots older version hammer test memory protection way preventing processes accessing memory assigned one concepts behind modern operating systems using memory protection combination security-related mechanisms protection rings possible achieve privilege separation processes programs computer systems general divided parts limited specific privileges require perform particular task using privilege separation also reduce extent potential damage caused computer security attacks restricting effects specific parts system disturbance errors explained section effectively defeat various layers memory protection short circuiting low hardware level practically creating unique attack vector type allows processes alter contents arbitrary parts main memory directly manipulating underlying memory hardware comparison conventional attack vectors buffer overflows aim circumventing protection mechanisms software level exploiting various programming mistakes achieve alterations otherwise inaccessible main memory contents initial research row hammer effect published june 2014 described nature disturbance errors indicated potential constructing attack provide examples working security exploit subsequent october 2014 research paper imply existence security-related issues arising row hammer effect march 9 2015 google project zero revealed two working privilege escalation exploits based row hammer effect establishing exploitable nature x86-64 architecture one revealed exploits targets google native client nacl mechanism running limited subset x86-64 machine instructions within sandbox exploiting row hammer effect escape sandbox gain ability issue system calls directly nacl vulnerability tracked mitigated modifying nacl allow execution codice_1 cache line flush machine instruction previously believed required constructing effective row hammer attack second exploit revealed project zero runs unprivileged linux process x86-64 architecture exploiting row hammer effect gain unrestricted access physical memory installed computer combining disturbance errors memory spraying exploit capable altering page table entries ptes used virtual memory system mapping virtual addresses physical addresses results exploit gaining unrestricted memory access due nature inability x86-64 architecture make codice_1 privileged machine instruction exploit hardly mitigated computers use hardware built-in row hammer prevention mechanisms testing viability exploits project zero found half 29 tested laptops experienced disturbance errors occurring vulnerable laptops less five minutes running row-hammer-inducing code tested laptops manufactured 2010 2014 used non-ecc ddr3 memory july 2015 group security researchers published paper describes architecture- instruction-set-independent way exploiting row hammer effect instead relying codice_1 instruction perform cache flushes approach achieves uncached memory accesses causing high rate cache eviction using carefully selected memory access patterns although cache replacement policies differ processors approach overcomes architectural differences employing adaptive cache eviction strategy algorithm proof concept approach provided native code implementation pure javascript implementation runs firefox 39 javascript implementation called rowhammer.js uses large typed arrays relies internal allocation using large pages result demonstrates high-level exploit low-level vulnerability october 2016 researchers vusec systems network security group vu amsterdam published drammer android app uses rowhammer methods reliably gain root access several popular models smartphones vulnerability acknowledged cve-2016-6728 patch released google within month mitigate effect however due general nature possible implementations attack effective software patch difficult reliably implement fact june 2018 proposals made academia industry either impractical deploy insufficient stopping attacks mitigate attacks researchers vusec systems proposed lightweight defense prevents dma-based attacks isolating dma buffers guard rows software states vulnerable rowhammer attacks attacker thus needs find right target states order utilise rowhammer errors practice one main challenges identifying target states typically done domain experts mainstream fault tolerance community responded rowhammer attacks systematic methodology used identify validate evaluate rowhammer attack target states exploitability work based well-established fault injection-based experimental methodology generalised attack target states found practical target states previously unknown | [
704,
3932,
4670,
5021,
376,
13,
3271,
3277,
2923,
3626,
5041,
7550,
405,
2587,
3323,
65,
5779,
5783,
5088,
2617,
6500,
785,
5449,
2266,
788,
7600,
1522,
4025,
7605,
1528,
4759,
2991,
1173,
4397,
5814,
5116,
6526,
2300,
6904,
4783,
6541,... | Test |
5,306 | 6 | File_system_API:file system api file system api application programming interface utility user program requests services file system operating system may provide abstractions accessing different file systems transparently file system apis may also include interfaces maintenance operations creating initializing file system verifying file system integrity defragmentation operating system includes apis needed file systems supports microsoft windows file system apis ntfs several fat file systems linux systems include apis ext2 ext3 reiserfs btrfs name early operating systems capable handling tape disk file systems provided basic interfaces coordination device allocation deallocation required addition file systems provided services interfaces defined additional file system types hierarchy structure supported media increased additional features needed specialized functions multi-user systems required apis writing user data file system provided use directly user program run-time library run-time library programming languages may provide type conversion formatting blocking file systems provide identification records key may include re-writing existing record operation sometimes called codice_1 record exists reading user data sometimes called get may include direction forward reverse case keyed file system specific key writing run-time libraries may intercede user program positioning includes adjusting location next record may include skipping forward reverse well positioning beginning end file open api may explicitly requested implicitly invoked upon issuance first operation process object may cause mounting removable media establishing connection another host validating location accessibility object updates system structures indicate object use usual requirements requesting access file system object include additional information may necessary example requested via programming language library may provide coordination among modules process addition forwarding request file system must expected something may go wrong processing open depending programming language additional specifications open may establish modules handle conditions libraries specify library module file system permitting analysis opening program unable perform meaningful action result failure example failure attempt open necessary input file action may report failure abort program languages simply return code indicating type failure always must checked program decides report continue close may cause dismounting ejecting removable media updating library file system structures indicate object longer use minimal specification close references object additionally file systems provide specifying disposition object may indicate object discarded longer part file system similar open must expected something may go wrong considerations handling failure similar open information data file called metadata metadata maintained file system example last-modification date various dates depending file system location beginning file size file file system backup utility saved current version files items usually altered user program additional meta data supported file systems may include owner file group file belongs well permissions and/or access control i.e access updates various users groups may perform whether file normally visible directory listed items usually modifiable file system utilities may executed owner applications store metadata images metadata may include camera model settings used take photo audio files meta data may include album artist recorded recording comments recording may specific particular copy file i.e different copies recording may different comments update owner file documents may include items like checked-by approved-by etc renaming file moving file subdirectory one directory another deleting file examples operations provide file system management directories metadata operations permitting restricting access directory various users groups users usually included filesystem used directories files records may added deleted modified usually causes inefficiencies underlying data structures things like logically sequential blocks distributed across media way causes excessive repositioning partially used even empty blocks included linked structures incomplete structures inconsistencies may caused device media errors inadequate time detection impending loss power actual power loss improper system shutdown media removal rare occasions file system coding errors specialized routines file system included optimize repair structures usually invoked user directly triggered within file system internal counters number levels structures number inserted objects may compared thresholds may cause user access suspended specific structure usually displeasure user users effected may started low priority asynchronous tasks may deferred time low user activity sometimes routines invoked scheduled system manager case defragmentation api kernel-level kernel provides interfaces filesystems developers also space filesystem code resides differs old schema kernel uses facilities talk filesystem driver vice versa contrary kernel one handles filesystem layout filesystem one directly access hardware cleanest scheme resolves difficulties major rewrite old scheme modular kernels allows adding filesystems kernel module even third party ones non-modular kernels however requires kernel recompiled new filesystem code closed-source kernels makes third party filesystem impossible unixes unix-like systems linux used modular scheme variation scheme used ms-dos dos 4.0 onward compatibles support cd-rom network file systems instead adding code kernel old scheme using kernel facilities kernel-based scheme traps calls file identifies redirected kernel equivalent function handled specific filesystem driver filesystem driver directly access disk contents using low-level bios functions api driver-based kernel provides facilities file system code resides totally external kernel even module modular kernel cleaner scheme filesystem code totally independent allows filesystems created closed-source kernels online filesystem additions removals system examples scheme windows nt os/2 respective ifss api filesystems kernel like kernel-based apis automatically trapped another api driver-based os scheme used windows 3.1 providing fat filesystem driver 32-bit protected mode cached vfat bypassed dos fat driver kernel msdos.sys completely later windows 9x series 95 98 vfat iso9660 filesystem driver along joliet network shares third party filesystem drivers well adding original dos apis lfn api ifs drivers intercept already existent dos file apis also add new ones within 32-bit protected mode executable however api completely documented third parties found make-it-by-yourself scenario even worse kernel-based apis api user space filesystem directly use kernel facilities accesses disks using high-level operating system functions provides functions library series utilities use access filesystem useful handling disk images advantage filesystem made portable operating systems high-level operating system functions uses common ansi c disadvantage api unique application implements one examples scheme hfsutils adflib filesystems least disk ones need equivalent functions provided kernel possible easily port filesystem code one api another even different types example ext2 driver os/2 simply wrapper linux vfs os/2 ifs linux ext2 kernel-based hfs driver os/2 port hfsutils os/2 ifs also exists project uses windows nt ifs driver making ntfs work linux | [
3599,
2547,
7161,
4672,
6431,
3626,
5049,
6117,
759,
6854,
5437,
4375,
6500,
6505,
5457,
4759,
460,
1534,
7976,
4771,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
1989,
174,
27... | Validation |
5,307 | 3 | Autonomous_peripheral_operation:autonomous peripheral operation computing autonomous peripheral operation hardware feature found modern microcontroller architectures off-load certain tasks embedded autonomous peripherals order minimize latencies improve throughput hard real-time applications well save energy ultra-low-power designs forms autonomous peripherals microcontrollers first introduced around 2005 allowing embedded peripherals work independently cpu even interact certain pre-configurable ways off-loads event-driven communication peripherals help improve real-time performance due lower latency allows potentially higher data throughput due added parallelism since 2009 scheme improved newer implementations continue functioning sleep modes well thereby allowing cpu remain dormant longer periods time order save energy partially driven iot market conceptually autonomous peripheral operation seen generalization mixture direct memory access dma hardware interrupts peripherals issue event signals called event generators producers whereas target peripherals called event users consumers implementations peripherals configured pre-process incoming data perform various peripheral-specific functions like comparing windowing filtering averaging hardware without pass data cpu processing known implementations include | [
3365,
6720,
6919,
2743,
1772
] | Test |
5,308 | 4 | Memory_forensics:memory forensics memory forensics forensic analysis computer memory dump primary application investigation advanced computer attacks stealthy enough avoid leaving data computer hard drive consequently memory ram must analyzed forensic information prior 2004 memory forensics done ad hoc basis using generic data analysis tools like strings grep tools specifically created memory forensics therefore difficult use also provide limited information general primary usage extract text memory dump many operating systems provide features kernel developers end-users actually create snapshot physical memory either debugging core dump blue screen death purposes experience enhancement hibernation computing case microsoft windows crash dumps hibernation present since microsoft windows nt microsoft crash dumps always analyzable microsoft windbg windows hibernation files hiberfil.sys nowadays convertible microsoft crash dumps using utilities like moonsols windows memory toolkit designed matthieu suiche february 2004 michael ford introduced memory forensics security investigations article sysadmin magazine article demonstrated analysis memory based rootkit process utilized existing linux crash utility well two tools developed specifically recover analyze memory forensically memget mempeek 2005 dfrws issued memory analysis forensics challenge response challenge tools generation specifically designed analyze memory dumps created tools knowledge operating system internal data structures thus capable reconstructing operating system process list process information although intended research tools proved operating system level memory forensics possible practical subsequently several memory forensics tools developed intended practical use include commercial tools like memoryze moonsols windows memory toolkit winen belkasoft live ram capturer etc open source tools like volatility new features added analysis linux mac os x memory dumps substantial academic research carried unlike microsoft windows mac os x interest relatively new initiated matthieu suiche 2010 black hat briefings security conference currently memory forensics standard component incident response since 2010 started see utilities focusing visualization aspect memory analysis moonsols livecloudkd presented matthieu suiche microsoft bluehat security briefings inspired new feature microsoft livekd written mark russinovich allow virtual machines introspection accessing memory guest virtual machine host virtual machine order either analyze directly assistance microsoft windbg acquire memory dump microsoft crash dump file format | [
5316,
1594,
2204,
3700,
4759,
5571,
6256,
1949
] | Validation |
5,309 | 4 | Information_diving:information diving information diving practice recovering technical data sometimes confidential secret discarded material recent times chiefly data storage elements discarded computers notably recoverable data remaining hard drives charge discarding computers usually neglect erase hard drive often circumstances information diver copy installed software e.g. word processors operating systems computer games etc. data may also available credit card information stored machine companies claim especially careful customer data number data breaches type entity e.g. education health care insurance government ... suggest problems well uk information diving referred binology earlier times available discarded data included printed manuals design records famous case student jerry schneider discovered discarded manuals telephone system ordering shipping system able build business selling 'surplus gear ordered telephone company though internal company department today files letters memos photographs ids passwords credit cards found dumpsters many people consider sensitive information items discarded may recovered information recovered sometimes usable fraudulent purposes see also identity theft physical information security two mit students purchased large number obsolete computers yard sales like found everything credit card information tax return data published paper remembrance things past documenting discoveries supposedly information diving common 1980s due lax security businesses became aware need increased security early 1990s sensitive documents shredded placed dumpsters still considerable internet activity subject dumpster diving unlikely stopped widespread introduction document shredding security mythology curious hackers malicious crackers commonly use technique dumpster diving commonly practiced watchdog organizations seeking information groups investigating trinity foundation successfully used technique report activities televangelist robert tilton also obtained information benny hinn using practice also sometimes used attorneys agents seeking enforce court-ordered money judgments judgment debtor trash may contain information assets more-readily located levying | [
2813,
1993,
1805,
3486
] | Test |
5,310 | 8 | Tntnet:tntnet tntnet web server software coded c++ enables c++ programs bundle requests modules enables developing web applications c++ get post requests interpreted tntnet server sent web application program send reply back network tntnet free software released gnu lesser general public license lgpl tntnet provides many features script-based cgi different tradeoffs c++ based tntnet allows use methods object-oriented programming polymorphism also supported modern scripting languages tntnet web application compiled ahead time script-based cgis often interpreted compiled modules native generally faster scripts programs cgid fastcgi used improve performance script-based cgis tntnet directly integrates web application webserver webservers often apis apache http server uses module system internet information services iis uses internet server application programming interface isapi tntnet originally used apache module system changed due difficulty interfacing apache c api maintaining benefits using c++ situation tommi mäkitalo developed tntnet framework tntnet also webserver present source code way tntnet acts layer front actual web application use webserver part receives http requests interpretes sends binary web application part web application webserver communicate constantly extra libraries provide tools programmer tntnet uses library tools named cxxtools build applications written using tntnet cxxtools needed library tntdb database abstraction layer programs developed using tntdb depend specific type underlying database system tntdb handle following database systems | [
7213,
6604,
3863,
5571,
3290,
578,
5956,
1435,
3135
] | Test |
5,311 | 9 | Unspecified_behavior:unspecified behavior unspecified behavior behavior may vary different implementations programming language program said contain unspecified behavior source code may produce executable exhibits different behavior compiled different compiler compiler different settings indeed different parts executable respective language standards specifications may impose range possible behaviors exact behavior depends implementation may completely determined upon examination program source code unspecified behavior often manifest resulting program external behavior may sometimes lead differing outputs results potentially causing portability problems enable compilers produce optimal code respective target platforms programming language standards always impose certain specific behavior given source code construct failing explicitly define exact behavior every possible program considered error weakness language specification would infeasible c c++ languages non-portable constructs generally grouped three categories implementation-defined unspecified undefined behavior exact definition unspecified behavior varies c++ defined behavior well-formed program construct correct data depends implementation c++ standard also notes range possible behaviors usually provided unlike implementation-defined behavior requirement implementation document behavior similarly c standard defines behavior standard provides two possibilities imposes requirements chosen instance unspecified behavior different undefined behavior latter typically result erroneous program construct data requirements placed translation execution constructs c c++ distinguish implementation-defined behavior unspecified behavior implementation-defined behavior implementation must choose particular behavior document example c/c++ size integer data types choice behavior must consistent documented behavior within given execution program many programming languages specify order evaluation sub-expressions complete expression non-determinism allow optimal implementations specific platforms e.g utilise parallelism one sub-expressions side effects result evaluating full-expression may different depending order evaluation sub-expressions example given codice_1 codice_2 modify codice_3 result stored codice_4 may different depending whether codice_5 codice_6 evaluated first c c++ languages also applies function arguments example resulting program write two lines output unspecified order languages java order evaluation operands function arguments explicitly defined | [
1361,
908,
6118,
7385,
1116,
233,
2871
] | Test |
5,312 | 9 | Statement_(computer_science):statement computer science computer programming statement syntactic unit imperative programming language expresses action carried program written language formed sequence one statements statement may internal components e.g. expressions many imperative languages e.g c make distinction statements definitions statement containing executable code definition instantiating identifier expression evaluates value distinction also made simple compound statements latter may contain statements components following major generic kinds statements pseudocoded pseudocoded statements immediate corresponding syntax typical imperative language like pascal c fortran etc appearance statements shapes look programs programming languages characterized type statements use e.g curly brace language family many statements introduced identifiers like repeat often statement keywords reserved used names variables functions imperative languages typically use special syntax statement looks quite different function calls common methods describe syntax statements backus–naur form syntax diagrams semantically many statements differ subroutine calls handling parameters usually actual subroutine parameter evaluated subroutine called contrasts many statement parameters evaluated several times e.g condition loop e.g loop body loop technically statement parameters call-by-name parameters call-by-name parameters evaluated needed see also lazy evaluation call-by-name parameters available statement like behaviour implemented subroutines see lisp languages without call-by-name parameters semantic description loop conditional usually beyond capabilities language therefore standard documents often refer semantic descriptions natural language languages statements contrast expressions statements return results executed solely side effects expressions always return result often side effects among imperative programming languages algol 68 one statement return result languages mix imperative functional styles lisp family distinction expressions statements made even expressions executed sequential contexts solely side effects whose return values used considered 'expressions purely functional programming statements everything expression distinction frequently observed wording statement executed expression evaluated found codice_17 codice_18 functions found languages python found codice_17 applied statements codice_18 applied expressions languages fixed set statements defined language experiments extensible languages allow programmer define new statements | [
3931,
2451,
4573,
4302,
109,
6428,
5734,
3784,
1478,
1854,
7375,
666,
3722,
7382,
5948,
6394,
5606,
4543,
5082,
5965,
6585,
171,
6778,
4743,
2803,
5711,
1435
] | Test |
5,313 | 2 | Windows_HPC_Server_2008:windows hpc server 2008 windows hpc server 2008 released microsoft 22 september 2008 successor product windows compute cluster server 2003 like wccs windows hpc server 2008 designed high-end applications require high performance computing clusters hpc stands high performance computing version server software claimed efficiently scale thousands cores includes features unique hpc workloads new high-speed networkdirect rdma highly efficient scalable cluster management tools service-oriented architecture soa job scheduler mpi library based open-source mpich2 cluster interoperability standards high performance computing basic profile hpcbp specification produced open grid forum ogf june 2008 system built collaboratively national center supercomputing applications ncsa microsoft ranked 23 top500 list ranking world fastest supercomputers linpack score 68.5 teraflops ncsa supercomputer uses windows server hpc red hat enterprise linux 4 november 2011 ranking dropped 253 since windows computers dropped top500 list linux also replaced operating systems list november 2008 rankings published top500 windows hpc system built shanghai supercomputer center achieved peak performance 180.6 teraflops ranked 11 list june 2015 last windows machine left list dropped later ranked 436 barely made top500 windows azure dropping earlier windows hpc server 2008 r2 based windows server 2008 r2 released 20 september 2010 windows hpc server 2008 r2 microsoft released hpc pack 2008 r2 four flavors express enterprise workstation cycle harvesting later simplified offer releasing hpc pack 2012 combined capabilities four versions hpc pack 2008 r2 hpc pack 2012 installed top windows server 2012 standard datacenter | [
448,
2452,
458,
4759,
5637,
6256,
7616,
1536,
3180,
3693,
3187,
2472,
4500,
4687,
1097,
224,
4067,
7660,
8118,
2329,
3048,
6136,
3907,
1227,
2066,
5781,
2885,
6580,
7685,
3585,
5539,
5442,
4377,
5794,
444,
447
] | Validation |
5,314 | 9 | RPL_(programming_language):rpl programming language /ref rpl derived reverse polish lisp according original developers whilst short 1987 hp marketing attempted coin backronym rom-based procedural language handheld calculator operating system application programming language used hewlett-packard scientific graphing rpn reverse polish notation calculators hp 28 48 49 50 series also usable non-rpn calculators 38 39 40 series rpl structured programming language based rpn equally capable processing algebraic expressions formulae implemented threaded interpreter rpl many similarities forth languages stack-based well list-based lisp contrary previous hp rpn calculators fixed four-level stack stack used rpl limited available calculator ram rpl originated hp corvallis oregon development facility 1984 replacement previous practice implementing operating systems calculators assembly language last pocket calculator supporting rpl hp 50g discontinued 2015 however multiple emulators emulate hp rpl calculators exist run range operating systems devices including ios android smartphones internal low- medium-level variant rpl called system rpl sysrpl used earlier hp calculators well aforementioned ones part operating system implementation language hp 48 series variant rpl accessible calculator user without use external tools hp 49/50 series compiler built rom use sysrpl possible cause serious crash coding sysrpl caution must used using high-level user rpl userrpl version language available said graphing calculators developing textual well graphical application programs userrpl programs internally represented sysrpl programs use safe subset available sysrpl commands error checking part userrpl commands however makes userrpl programs noticeably slower equivalent sysrpl programs userrpl command syseval tells calculator process designated parts userrpl program sysrpl code rpl control blocks strictly postfix although notable exceptions control block structures appear would standard infix language calculator manages allowing implementation blocks skip ahead program stream necessary rpl supports basic conditional testing if/then/else structure basic syntax block following example tests see number bottom stack 1 replaces equal one construct evaluates condition tests bottom stack result result rpl optionally support forth-style blocks allowing condition determined block leaving condition empty statement make changes stack condition execution use existing result bottom stack test postfix conditional testing may accomplished using ift if-then ifte if-then-else functions ift ifte pop two three commands stack respectively topmost value evaluated boolean true second topmost value pushed back stack ifte allows third else value pushed back stack boolean false following example uses ift function pop object bottom stack equal 1 replaces one following example uses ifte function pop object bottom stack equal 1 replaces one equal 1 replaces string one ift ifte evaluate program block given one arguments allowing compact form conditional logic if/then/else/end structure following example pops object bottom stack replaces one less depending whether equal less greater 1 support complex conditional logic rpl provides case/then/end structure handling multiple exclusive tests one branches within case statement executed basic syntax block following code illustrates use case/then/end block given letter bottom stack replaces string equivalent unknown letter code identical following nested if/then/else/end block equivalent rpl provides for/next statement looping one index another index loop stored temporary local variable accessed loop syntax for/next block following example uses loop sum numbers 1 10 index variable loop start/next block used simple block runs start index end index unlike for/next loop looping variable available syntax start/next block for/next start/next support user-defined step increment replacing terminating next keyword increment step keyword loop variable incremented decremented different value default +1 instance following loop steps back 10 2 decrementing loop index 2 while/repeat/end block rpl supports indefinite loop condition test start loop syntax while/repeat/end block do/until/end block rpl supports indefinite loop condition test end loop syntax do/until/end block | [
6507,
7878,
3764,
1445,
897,
6796,
6888,
6087,
4588,
2734,
6981,
5734,
3188,
6352,
5571,
1557,
218,
1478,
5494,
4704,
3880,
4609,
6116,
3212,
5501,
6210,
144,
1116,
1670,
6471,
7481,
2144,
2600,
336,
7298,
5515,
8025,
5077,
7032,
4543,
... | Validation |
5,315 | 2 | Nokia_5530_XpressMusic:nokia 5530 xpressmusic nokia 5530 xpressmusic smartphone nokia announced june 15 2009 part xpressmusic series phones emphasizes music multimedia playback nokia third touchscreen phone 5800 n97 based symbian os s60 5th edition platform terms specifications rests lower nokia 5230 higher 5800 bearing much lower price tag lacks 5800 3g capability gps receiver compact sleek design models well stereo speakers | [
1066,
5979,
2271,
6517,
372,
1724,
463,
7521,
3615,
1453,
4935,
3694,
3524,
3952,
472,
5909,
8072,
2922,
4407,
118,
23,
2564,
3703,
7261,
7545,
5044,
5493,
740,
1202,
3029,
5499,
7012,
139,
6465,
5062,
3039,
3653,
1582,
4894,
5068,
597,... | Train |
5,316 | 4 | Volatility_(memory_forensics):volatility memory forensics volatility open-source memory forensics framework incident response malware analysis written python supports microsoft windows mac os x linux version 2.5 volatility created computer scientist entrepreneur aaron walters drawing academic research memory forensics volatility supports investigations following memory images windows mac osx linux volatility supports variety sample file formats ability convert formats | [
1594,
3700,
5965,
4759,
5571,
5308,
578
] | Validation |
5,317 | 4 | Juliana_Mickwitz:juliana mickwitz juliana mickwitz 1889-1976 finnish-born russian became naturalized american citizen employed american military later national security agency translator linguist cryptanalyst inducted cryptologic hall honor 2012 juliane charlotte ernestine von mickwitz born elisabeth marie caroline née von dittmann ernst theodor leopold von mickwitz aka mikvits minckwitz 15 may 1889 vyborg grand duchy finland russian empire grandfather estate called halila oldest two children brother alexander would later join united states learning english german russian home tutor entered st ann gymnasium saint petersburg 1903 graduated gold medal excellence 1907 tutored students 1909 year began working secretary michael lazareff president russian unified oil company continued working widow eugenia lazareff death 1919 rise bolsheviks russian civil war mickwitz managed hide assets lazareff turn secured passage poland story mickwitz engaged polish doctor 15 april 1920 two women arrived warsaw mickwitz began trying preserve lazareff assets outside soviet union protect confiscation worked translator various organizations including american consulate warsaw british embassy canadian us timber corporation 1925 year began working foreign correspondent polish agricultural syndicate kooprolna cooperative year applied full-time position american military attaché office 1926 mickwitz became employed us military attaché office warsaw working major general william h. colbern colonel r. i. mckenney colonel john winslow general emer yeager thirteen years worked warsaw nazi invasion poland december 1939 transferred rest office hague netherlands taking lazareff aunt months germans invaded low countries office evacuated berlin three months august 1940 relocated athens germans followed july 1941 mickwitz lazareff fled lisbon assistance former employers able secure travel visas united states march 1942 arriving u.s. mickwitz began working war department military intelligence directorate translating german polish russian documents october 1946 released service awarded meritorious civilian service medal month hired army security agency stationed arlington hall 1952 transferred national security agency nsa founded linguistic unit managed translate plaintext voice remained agency 1963 retired receiving second meritorious service award continued consult nsa 1966 inducted cryptologic hall honor 2012 mickwitz member russian orthodox church helped founding construction russian orthodox cathedral st. john baptist washington dc served head parish many years worked establish congress russian americans virginia help russian immigrants became naturalized american citizen mickwitz died 21 august 1976 sacred heart nursing home hyattsville maryland suffering stroke previous november priest greece father nicolas pekatoros officiated funeral | [] | Validation |
5,318 | 4 | Data_Protection_Act_2018:data protection act 2018 data protection act 2018 c 12 united kingdom act parliament updates data protection laws uk national law complements european union general data protection regulation gdpr updates data protection act 1998 data protection act 2018 achieved royal assent 23 may 2018 applies eu gdpr standards whereas gdpr gives member states limited opportunities make provisions applies country one element dpa 2018 details applying national law dpa 2018 however limited uk gdpr provisions act seven parts outlined section 1 act introduces new offences include knowingly recklessly obtaining disclosing personal data without consent data controller procuring disclosure retaining data obtained without consent selling offering sell personal data knowingly recklessly obtained disclosed would also offence essentially act implements eu law enforcement directive implements parts gdpr 'are determined member state law creates framework similar gdpr processing personal data outside scope gdpr includes intelligence services processing immigration services processing processing personal data held unstructured form public authorities section 3 european union withdrawal act 2018 gdpr incorporated directly domestic law immediately uk exits european union | [
2727,
3609
] | Test |
5,319 | 4 | Smudge_attack:smudge attack smudge attack method discern password pattern touchscreen device cell phone tablet computer method investigated team university pennsylvania researchers reported 4th usenix workshop offensive technologies smudge attack relies detecting oily smudges left behind user fingers operating device using simple cameras image processing software proper lighting camera settings finger smudges easily detected heaviest smudges used infer frequent user input pattern password researchers able break password 68 time proper conditions research widely covered technical press including reports pc pro zdnet engadget threat recognized least one product introduced whisper systems mitigate risk | [
6515,
1805,
6046
] | Validation |
5,320 | 4 | GoGuardian:goguardian goguardian founded 2014 based los angeles ca offer four core products including goguardian admin web filtering goguardian teacher classroom management goguardian fleet chrome device management goguardian beacon suicide self harm alerting services enable school administrators monitor student activity online filter potentially harmful distracting content help students need june 2018 goguardian claimed active 10,150 schools protect five million students 2018 goguardian named fastest growing education company inc 500 goguardian founded 2014 based los angeles ca feature set includes chromebook filtering monitoring management well usage analytics activity flagging theft recovery device running chrome operating system chrome os goguardian also offers filtering functionality third-party tools youtube services enable school administrators monitor student activity online filter potentially harmful distracting content recover lost stolen devices june 2015 goguardian claimed active 1,600 estimated 15,000 school districts united states january 2015 los angeles unified school district lausd chose goguardian support 1:1 device rollout program 661,000 students chromebooks one device options lausd 1:1 rollout partnership provides lausd device tracking grade-level-specific filtering capabilities facilitates compliance children internet protection act cipa september 2015 company unveiled goguardian teachers tool designed help teachers manage chromebook usage classrooms monitor student activity device goal tool help keep students on-task away inappropriate content january 2016 goguardian announced launch google classroom integration goguardian teachers january 2016 two company co-founders aza steel advait shinde named forbes magazine annual 30 30 list education category 2018 goguardian launched beacon suicide prevention tool aimed help school counselors discover students silently suffering based online activity behavior 2018 goguardian acquired private equity firm sumeru equity partners appointed tony miller board directors afsp 2018 goguardian partnered american foundation suicide prevention provide free prevention training schools https //www.businesswire.com/news/home/20180904005255/en/american-foundation-suicide-prevention-partners-goguardian-provide aas 2017 goguardian announced partnership american association suicidology help tackle youth suicide crisis every school purchases beacon receive on-site sad training free charge http //www.businesswire.com/news/home/20170911005211/en/goguardian-american-association-suicidology-join-forces-tackle google education partner https //edu.google.com/products/classroom/apps/ modal_active=none story-card_activeel=connect-with-school-systems global educator institute endorsed goguardian teacher http //geiendorsed.com/products/goguardian/ | [] | Test |
5,321 | 2 | Windows_Runtime_XAML_Framework:windows runtime xaml framework 'windows runtime xaml framework code name jupiter user interface api part windows runtime winrt programming model forms backbone windows store apps formerly known metro-style immersive windows 8 windows 8.1 windows phone 8.1 operating systems enables declaring user interfaces using extensible application markup language xaml technology xaml framework one multiple ui apis windows runtime others html5 e.g. via winjs directx windows phone 8.0 windows runtime xaml framework supported xaml applications based silverlight xaml framework deployed xap format windows phone 8.1 windows runtime xaml available along improved windows runtime support convergence platforms enable universal apps target windows 8.1 windows phone 8.1 sharing code including user interface windows phone 8.1 still capable running silverlight based xaml apps new features api also added framework called silverlight 8.1 xaml framework related windows presentation foundation wpf silverlight—similar xaml-based ui frameworks used desktop applications portable applications respectively xaml framework uses lot names apis older technologies—especially silverlight use limited windows os specifically windows 8 later wpf major difference silverlight wpf largely based common language runtime clr require using programming languages c visual basic xaml framework part windows runtime written native code also available tools development c++ c++/cx | [
7149,
1445,
6420,
714,
6428,
2198,
720,
1460,
1840,
2568,
2928,
7907,
5747,
405,
6116,
2953,
6840,
7573,
422,
5786,
1895,
5787,
4017,
5091,
6504,
1152,
4022,
1154,
4026,
7607,
1526,
3687,
4759,
2639,
2283,
5479,
3368,
7263,
486,
5850,
1... | Test |
5,322 | 9 | Roger_Hui:roger hui roger hui born 1953 computer scientist codeveloper programming language j 1953 born hong kong 1966 immigrated canada whole family 1973 hui entered university alberta second year took course probability statistics students expected learn programming language apl little formal instruction used time could muster heavily-burdened computer benefited apl\360 user manual book apl language published march 1975 manual written adin falkoff kenneth e. iverson hui thinks reasonable say learned apl falkoff iverson summer student 1975 1976 hui worked i. p. sharp associates ipsa calgary workspaces statistical probability calculations major attraction job unrestricted computer time access apl receiving b.sc degree first class honors computer science 1977 hui worked two years full-time programmer analyst new edmonton office ipsa main duty support clients use apl time-sharing attended apl79 conference rochester new york iverson gave two papers role operators apl derivative operator way hui stopped ipsa toronto obtained copy operators functions ibm research report 7091 1978 studying paper successors ever since september 1979 hui entered department computer science university toronto received m.sc may 1981 thesis complexity decompositions matrix algebra completing master degree hui worked 1981 1985 apl systems analyst programmer alberta energy company edmonton february 1982 hui purchased source book apl 1981 memorable papers design apl 1973 evolution apl 1978 notation tool thought 1980 hui work described apl85 conference paper design financial modelling system written jointly supervisor fred appleyard basic objects system direct definition iverson 1976 1980 falkoff iverson design apl cited hui left alberta energy shortly promoted non-apl non-programming position work access computers september 1985 april 1986 gave plenty time intense study iverson rationalized apl 1983 dictionary apl language named early 1990s ken iverson hui began collaborating advanced continuation apl-like language named j improvements intended fix persistent character set issues plagued apl since inception add new advanced features support parallel multiple instruction multiple data mimd operations intended j language improvement extant apl j interpreter language continue evolve 1996 received kenneth e. iverson award outstanding contribution apl | [
811,
6263,
470,
3464,
6285,
752,
1774,
1308,
7758,
6846,
8137,
3060,
1892,
6778,
6064,
356
] | Test |
5,323 | 3 | List_of_ARM_microarchitectures:list arm microarchitectures list microarchitectures based arm family instruction sets designed arm holdings 3rd parties sorted version arm instruction set release name arm provides summary numerous vendors implement arm cores design keil also provides somewhat newer summary vendors arm based processors arm provides chart displaying overview arm processor lineup performance functionality versus capabilities recent arm core families dhrystone synthetic benchmark developed 1980s longer representative prevailing workloadsuse caution cores implement arm instruction set developed independently companies architectural license arm following table lists core year announced cores arm7 n't included table | [
1818,
6082,
6421,
7890,
722,
2926,
5740,
1473,
5042,
5750,
5752,
5405,
5406,
1864,
67,
6148,
446,
451,
6874,
6165,
463,
804,
4397,
5472,
469,
4041,
3008,
3365,
6910,
1197,
5845,
7654,
6919,
3397,
1977,
2339,
2711,
1995,
550,
4847,
3786,... | Validation |
5,324 | 8 | Path_analysis_(computing):path analysis computing path analysis analysis path portrayal chain consecutive events given user cohort performs set period time using website online game ecommerce platform subset behavioral analytics path analysis way understand user behavior order gain actionable insights data path analysis provides visual portrayal every event user cohort performs part path set period time possible track user ’ path site even show path visual representation real question gain actionable insights path analysis simply outputs pretty graph may look nice provide anything concrete act upon order get path analysis first step would determine needs analyzed goals analysis company might trying figure site running slow certain types users interested certain pages products user interface set logical way goal set ways performing analysis large percentage certain cohort people ages 18-25 logs online game creates profile spends next 10 minutes wandering around menu page may user interface logical seeing group users following path developer able analyze data realize creating profile “ play game ” button appear thus path analysis able provide actionable data company act fix error ecommerce path analysis help customize shopping experience user looking products customers certain cohort looked buying one company suggest “ items may also like ” next customer increase chances making purchase also path analysis help solve performance issues platform example company looks path realizes site freezes certain combinations events analyzing path progression events led error company pinpoint error fix historically path analysis fell broad category website analytics related analysis paths websites path analysis website analytics process determining sequence pages visited visitor session prior desired event visitor purchasing item requesting newsletter precise order pages visited may may important may may specified practice analysis done aggregate ranking paths sequences pages visited prior desired event descending frequency use idea determine features website encourage desired result fallout analysis subset path analysis looks black holes site paths lead dead end frequently paths features confuse lose potential customers advent big data along web-based applications online games ecommerce platforms path analysis come include much web path analysis understanding users move app game web platform part modern-day path analysis real world visit shop shelves products placed random order shop owner carefully analyzes visitors path walk shop especially selecting buying products next shop owner reorder shelves products optimize sales putting everything logical order visitors supermarket typically result wine shelf next variety cookies chips nuts etc simply people drink wine eat nuts web sites logic applied visitors questions product go product information support section web site make logical step frequently asked questions page specific question web site owner also wants analyze visitor behavior example web site offers products sale owner wants convert many visitors completed purchase sign-up form multiple pages web site owners want guide visitors final sign-up page path analysis answers typical questions like visitors go enter home page strong visitor relation product product b web site questions ca n't answered page hits unique visitors statistics google analytics provides path function funnels goals predetermined path web site pages specified every visitor walking path goal approach helpful analyzing many visitors reach certain destination page called end point analysis paths visitors walk web site lead endless number unique paths result point analyzing path look strongest paths strongest paths typically shown graphical map text like page -- page b -- page -- exit | [] | Validation |
5,325 | 4 | TeslaCrypt:teslacrypt teslacrypt ransomware trojan defunct master key released developers early forms teslacrypt targeted game-play data specific computer games newer variants malware also affect file types original game-player campaign upon infection malware searched 185 file extensions related 40 different games include call duty series world warcraft minecraft world tanks encrypted files files targeted involve save data player profiles custom maps game mods stored victim hard drives newer variants teslacrypt focused computer games alone also encrypted word pdf jpeg files cases victim would prompted pay ransom 500 worth bitcoins order obtain key decrypt files although resembling cryptolocker form function teslacrypt shares code cryptolocker developed independently malware infected computers via angler adobe flash exploit even though ransomware claimed teslacrypt used asymmetric encryption researchers cisco talos group found symmetric encryption used developed decryption tool deficiency changed version 2.0 rendering impossible decrypt files affected teslacrypt-2.0 november 2015 security researchers kaspersky quietly circulating new weakness version 2.0 carefully keeping knowledge away malware developer could fix flaw january 2016 new version 3.0 discovered fixed flaw full behavior report shows behaviorgraphs executiongraphs published joesecurity may 2016 developers teslacrypt shut ransomware released master decryption key thus bringing end ransomware days eset released public tool decrypt affected computers charge | [
91,
4759,
5571,
1376,
376,
744
] | Test |
5,326 | 9 | Attribute_grammar:attribute grammar attribute grammar formal way define attributes productions formal grammar associating attributes values evaluation occurs nodes abstract syntax tree language processed parser compiler attributes divided two groups synthesized attributes inherited attributes synthesized attributes result attribute evaluation rules may also use values inherited attributes inherited attributes passed parent nodes approaches synthesized attributes used pass semantic information parse tree inherited attributes help pass semantic information across instance constructing language translation tool compiler may used assign semantic values syntax constructions also possible validate semantic checks associated grammar representing rules language explicitly imparted syntax definition attribute grammars also used translate syntax tree directly code specific machine intermediate language one strength attribute grammars transport information anywhere abstract syntax tree anywhere else controlled formal way attribute grammars invented donald knuth peter wegner donald knuth credited overall concept peter wegner invented inherited attributes conversation knuth embryonic ideas trace back work edgar t. ned irons author imp following simple context-free grammar describe language made multiplication addition integers following attribute grammar used calculate result expression written grammar note grammar uses synthesized values therefore s-attributed grammar synthesized attribute computed values attributes children since values children must computed first example bottom-up propagation formally define synthesized attribute let formula_1 formal grammar given string nonterminal symbols formula_6 attribute name formula_7 formula_8 synthesized attribute three conditions met inherited attribute node parse tree defined using attribute values parent siblings inherited attributes convenient expressing dependence programming language construct context appears example use inherited attribute keep track whether identifier appears left right side assignment order decide whether address value identifier needed contrast synthesized attributes inherited attributes take values parent and/or siblings following production get values b c. b take values c. likewise c take values b | [
1619,
1157,
7515,
6882,
1446,
8179,
1361,
2740,
1463,
5498,
7474,
1580,
1877,
1498,
6311,
7305
] | Validation |
5,327 | 4 | Acoustic_cryptanalysis:acoustic cryptanalysis acoustic cryptanalysis type side channel attack exploits sounds emitted computers devices modern acoustic cryptanalysis focuses sounds produced computer keyboards internal computer components historically also applied impact printers electromechanical deciphering machines victor marchetti john d. marks eventually negotiated declassification cia acoustic intercepts sounds cleartext printing encryption machines technically method attack dates time fft hardware cheap enough perform task—in case late 1960s mid-1970s however using primitive means acoustical attacks made mid-1950s book spycatcher former mi5 operative peter wright discusses use acoustic attack egyptian hagelin cipher machines 1956 attack codenamed engulf 2004 dmitri asonov rakesh agrawal ibm almaden research center announced computer keyboards keypads used telephones automated teller machines atms vulnerable attacks based sounds produced different keys attack employed neural network recognize key pressed analyzing recorded sounds able recover text data entered techniques allow attacker using covert listening devices obtain passwords passphrases personal identification numbers pins information entered via keyboards 2005 group uc berkeley researchers performed number practical experiments demonstrating validity kind threat also 2004 adi shamir eran tromer demonstrated may possible conduct timing attacks cpu performing cryptographic operations analyzing variations acoustic emissions analyzed emissions ultrasonic noise emanating capacitors inductors computer motherboards electromagnetic emissions human-audible humming cooling fan shamir tromer along new collaborator daniel genkin others went successfully implement attack laptop running version gnupg rsa implementation using either mobile phone located close laptop laboratory-grade microphone located 4 away published experimental results december 2013 acoustic emissions occur coils capacitors small movements current surge passes capacitors particular change diameter slightly many layers experience electrostatic attraction/repulsion piezoelectric size change coil capacitor emits acoustic noise conversely also microphonic high-end audio industry takes steps coils capacitors reduce microphonics emissions muddy hi-fi amplifier sound march 2015 made public inkjet printers using ultrasonic heads read back using high frequency mems microphones record unique acoustic signals nozzle using timing reconstruction known printed data confidential 12-point font thermal printers also read using similar methods less fidelity signals bursting bubbles weaker hack also involved implanting microphone chip storage ic burst transmitter long-life li+ battery doctored cartridges substituted genuine ones sent post target typically bank retrieved garbage using challenge-response rfid chip similar work reconstructing printouts made dot-matrix printers publicized 2011 kind cryptanalysis defeated generating sounds spectrum form keypresses sounds actual keypresses randomly replayed may possible totally defeat kinds attacks advisable use least 5 different recorded variations 36 x 5 180 variations keypress get around issue fft fingerprinting alternatively white noise sufficient volume may simpler generate playback also mask acoustic emanations individual keypresses | [
1811,
4930,
464,
807,
3100,
119,
7548,
6637,
6647,
7200,
4805,
5765,
6657,
1587,
5333,
6763,
433,
1320,
1237,
613,
5440,
1146,
4917
] | Test |
5,328 | 3 | Enterprise_interoperability:enterprise interoperability enterprise interoperability ability enterprise—a company large organization—to functionally link activities product design supply chains manufacturing efficient competitive way research interoperability enterprise practised various domains enterprise modelling ontologies information systems architectures platforms question positioning enterprise architecture ea presents high level design enterprise capabilities defines successful projects coherence enterprise principals business related requirements ea covers mainly business capabilities analysis validation ii development business application data technical architectures solutions finally iii control programme project implementation governance application ea methodology feeds enterprise repository reference frame sets building blocks used compose targeted system interoperability considered either principal requirement constraint impact definition patterns compose building blocks definition targeted architectural roadmap scope ea within togaf perspective aims reconcile interoperability requirements potential solutions make developed systems interoperable maintain interoperability challenge quite present next steps system ’ lifecycle several models frameworks developed topic enterprise interoperability preserve interoperability several enterprise interoperability frameworks identified literature majority frameworks considers enterprise several aspects viewpoints abstraction levels business process knowledge application technology data technic etc proposes guidelines support modeling connection capabilities levels semantic challenge considered transversal abstraction levels setting applying guidelines methodologies developed within frameworks requires modeling efforts identify connect artifacts evolution technologies aims outsource capabilities vendors manage use demand evolution pathway starts form packaged solutions goes infrastructure service iaas platform service paas software service saas recently cloud interoperability efforts still mainly expected among levels dealing business process definition alignment collaboration interoperability several international standards propose methodologies guidelines perspectives addition recent standards bpmn bpel etc implementation technologies propose relevant integration capabilities furthermore model driven-engineering provides capabilities connect transform refine models support interoperability following approaches propose metrics assess interoperability maturity several interoperability aspects identified previously listed maturity approaches define interoperability categories dimensions propose qualitative well qualitative cross cutting issues assess interoperability aspects covered single maturity approach propositions go deeply definition metric dimensions one interoperability aspect business interoperability measurement proposed aneesh | [
2087,
3513
] | Validation |
5,329 | 7 | Aventri:aventri aventri formerly known etouches cloud-based event management software company based norwalk connecticut best known integrated events management saas solutions company 1,200 users spanning 35 countries worldwide large corporations like coca-cola mastercard dell part client mix aventri five-time honoree inc. magazine inc. 5,000 ranking fastest-growing private companies america 2012 – 2016 annual ranking also places aventri among top companies connecticut aventri founded global executive business service 1998 leonora valvo tim cummins business operated fee-for-service event managing company 2008 company relaunched etouches year etouches introduced first event management solution 2010 company raised 2.5 million first round venture capital investments lead investor greycroft partners investors connecticut innovations cava capital growth continued 2012 company launched mobile application emobile enabling users create manage event scheduling smartphones application integrates etouches modules including ereg esocial also year etouches received 7.75 million series b financing led level equity etouches raised 6 million series c round investments 2013 september year company appointed oni chukwu president chief executive officer veteran software industry executive sits board directors connecticut technology council board governors university new haven.the momentum continued throughout 2015. etouches expanded operations middle east opening headquarters office dubai company raised 14 million series c funding investors including argentum group also year etouches expanded platform acquisition tapcrowd company creates mobile applications provides marketing data businesses associations worldwide new partnership integrated ingo social media marketing suite etouches event management platform company also acquired inevention venue sourcing platform estimating tool help planners manage cost offsite meetings events rapid growth earned etouches spot deloitte 2015 technology fast 500 list fastest-growing technology companies north america also year smartceo magazine honored chukwu new york future 50 award recognizing region fastest-growing mid-sized companies etouches continued develop end-to-end event management platform enterprise market throughout 2016 company closed 20 million funding round later year acquired venue sourcing booking platform zentila etouches also introduced event roi product etouches also integrates directly popular software including salesforce passkey march 2 2017 etouches acquired loopd leading onsite data-drive technology acquisition complements etouches focus data-driven approach enhance clients event success positions etouches full enterprise solution two months later may 9 2017 etouches acquired hggc leading middle market private equity firm hggc ’ investment helped etouches expand business invest market-leading cloud platform win greater share 6 billion event management software ems venue sourcing market july 12 2018 company rebranded aventri aventri headquartered norwalk connecticut offices throughout north america europe middle east asian pacific company offers multilingual multi-currency product versions accommodate global customer base | [
972,
330
] | Test |
5,330 | 4 | DarkHotel:darkhotel darkhotel darkhotel targeted spear-phishing spyware malware-spreading campaign appears selectively attacking business hotel visitors hotel in-house wifi network characterized kaspersky lab advanced persistent threat attacks specifically targeted senior company executives using forged digital certificates generated factoring underlying weak public keys real certificates convince victims prompted software downloads valid uploading malicious code hotel servers attackers able target specific users guests luxury hotels primarily asia united states zetter 2014 explains group dubbed darkhotel tapaoux also actively infecting users spear-phishing peer-to-peer networks since 2007 key logging reverse engineering targets aimed primarily executives investments development government agencies defense industries electronic manufacturers energy policy makers large number victims located korea china russia japan attackers victim computer sensitive information passwords intellectual property quickly stolen attackers erase tools hopes getting caught july 2017 bitdefender published new research inexsmar another version darkhotel malware used target political figures instead business targets | [
704,
5452,
4025,
7328,
1528,
2991,
7799,
7066,
376,
1173,
6526,
998,
3528,
3277,
2923,
7818,
5922,
3864,
6628,
6904,
1376,
6541,
6194,
7087,
1383,
2854,
7093,
7600,
6025,
2587,
2678,
3038,
1996,
4531,
600,
1307,
3047,
6569,
2693,
1043,
... | Validation |
5,331 | 2 | NeXT_Laser_Printer:next laser printer next laser printer next pn n2000 400 dpi postscript laser printer sold next late nextstation nextcube workstations manufactured canon inc included adjustable paper tray enabled print several paper sizes including a4 letter-size legal envelope varieties similar printers based canon sx engine apple laserwriter ii series hp laserjet ii/iii although printers printed 300x300 dpi parts toner cartridge input paper tray interchangeable laserjet ii/iii printer used proprietary high-speed serial interface essence predecessor software-rendering approach used displaypostscript renderer nextstep rather hardware postscript renderer regardless lack dedicated rendering hardware usually achieved close rated speed 8 ppm nextstation much faster cpu 25 33mhz 68040 greater memory capacity 128 mb turbo models rendering engines contemporary printers nextstep used displaypostscript extensively windowing system postscript rendering path optimized thus printed documents true output wysiwyg corresponding screen next also produced color inkjet printer scsi-i-connected tabloid-capable 360 dpi color bubblejet model next pn n2004 us n2005 uk based technology canon bubblejet | [
7259,
1599,
5101,
5450,
6016,
4355,
246
] | Train |
5,332 | 5 | Frequency_grid:frequency grid frequency grid table central frequencies corresponding wavelengths channels allowed communications system common frequency grid used fiber-optic communication used channel spacing dense wavelength division multiplexing dwdm wavelengths around 1550 nm defined itu-t g.694.1 grid defined relative 193.1 thz extends 191.7 thz 196.1 thz 100 ghz spacing defined frequency grid often expressed terms wavelength case covers wavelength range 1528.77 nm 1563.86 nm approximately 0.8 nm channel spacing practical purposes grid extended cover 186 thz 201 thz subdivided provide 50 ghz 25 ghz spaced grids | [
3724
] | Validation |
5,333 | 4 | Mod_n_cryptanalysis:mod n cryptanalysis cryptography mod n cryptanalysis attack applicable block stream ciphers form partitioning cryptanalysis exploits unevenness cipher operates equivalence classes congruence classes modulo n method first suggested 1999 john kelsey bruce schneier david wagner applied rc5p variant rc5 m6 family block ciphers used firewire standard attacks used properties binary addition bit rotation modulo fermat prime rc5p analysis conducted modulo 3 observed operations cipher rotation addition 32-bit words somewhat biased congruence classes mod 3 illustrate approach consider left rotation single bit follows thus left rotation single bit simple description modulo 3 analysis operations data dependent rotation modular addition reveals similar notable biases although theoretical problems analysing operations combination bias detected experimentally entire cipher kelsey et al. 1999 experiments conducted seven rounds based conjecture many 19 20 rounds rc5p distinguished random using attack also corresponding method recovering secret key m6 attacks mod 5 mod 257 even effective | [
1811,
4930,
464,
807,
1353,
2918,
907,
3100,
119,
6015,
6016,
7548,
1283,
6637,
1480,
6647,
7200,
4805,
5765,
5327,
6657,
7928,
1587,
762,
6763,
6049,
161,
433,
1320,
613,
1146,
4917
] | Train |
5,334 | 3 | Codeplay:codeplay codeplay software limited privately owned software tools developer based edinburgh scotland codeplay produces compilers debuggers runtimes testing systems specialized tools aid software development heterogeneous systems special purpose processor architectures including gpus dsps codeplay contributing member multicore association khronos group hsa foundation codeplay founded 2002 andrew richards experienced games developer formerly head software development eutechnyx initial funding company provided jez san obe founder argonaut games arc international codeplay began business developing compilers aimed games programmers releasing vectorc compiler playstation 2 x86 windows pc 2005 codeplay shifted focus developing bespoke c/c++ compilers processor designers since expanded services include development debuggers runtimes testing tools 2011 codeplay announced provided real-time car damage system utilising offload technology 2013 codeplay formed r division received investors people accreditation 2014 codeplay announced working implementation khronos group new provisional standard heterogeneous computing sycl codeplay ceo andrew richards currently chairs working group standard within khronos group computeaorta codeplay multi-target multi-platform toolkit rapidly enabling delivery opencl spir vulkan compute standards currently supporting linux windows android operating systems across x86 arm powerpc mips targets computeaorta also easily customized support new novel hardware architectures opencl standard widely adopted programming model gpus cpus dsps fpgas used extensively professional graphics applications adobe photoshop premiere well wide range open-source software codeplay built proprietary bespoke implementations opencl several customers well significantly contributing development opencl related standards within khronos group codeplay computecpp implementation sycl open standard enabling single source c++ software high-level object-oriented programming codeplay extensive participation standards bodies ensure industry benefits extensive varied knowledge codeplay chairs following standards codeplay contributed following eu-funded research projects | [
1361,
5055,
6435,
4759,
352,
2420,
578
] | Test |
5,335 | 3 | VESA_Enhanced_Video_Connector:vesa enhanced video connector vesa enhanced video connector vesa standard intended reduce number cables around computer incorporating video audio firewire usb single cable system intention system make monitor central point connection although specific idea find favour computer manufacturers evolved somewhat popular vesa plug display standard vesa evc connector capable carrying analog video vga-based output video input composite firewire audio analogue stereo usb signals pinout somewhat similar newer vesa plug display distinguished plug display connector shell shaped like isosceles trapezoid similar shell d-subminiature instead -shaped shell dvi connector | [
6307,
7659,
5301
] | Test |
5,336 | 2 | Global_Address_Space_Programming_Interface:global address space programming interface global address space programming interface gpi application programming interface api development scalable asynchronous fault tolerant parallel applications implementation partitioned global address space programming model gpi developed fraunhofer institute industrial mathematics itwm since 2005 initially known fvm fraunhofer virtual machine 2009 name changed global address programming interface gpi 2011 fraunhofer itwm partners fraunhofer scai tud t-systems sfr dlr kit fzj dwd scapos initiated launched gaspi project define novel specification api gaspi based gpi make novel specification reliable scalable universal tool hpc community gpi-2 first open source implementation standard software freely available application developers researchers licenses commercial use available scapos ag gpi completely replaced mpi fraunhofer itwm products research based new gpi-2 modern hardware typically involves hierarchy memory respect bandwidth latency read write accesses within hierarchy non-uniform memory access numa partitions solid state devices ssds graphical processing unit gpu memory many integrated cores mic memory memory segments supposed map variety hardware layers software layer spirit pgas approach gpi segments may globally accessible every thread every gpi process gpi segments also used leverage different memory models within single application even run different applications group subset ranks group members common collective operations collective operation group restricted ranks forming group initial group gaspi_group_all ranks members forming group involves 3 steps creation addition commit operations must performed ranks forming group creation performed using codice_1 operation successful ranks added created group using codice_2 able use created group ranks added must commit group performed using codice_3 collective operation ranks group one-sided asynchronous communication basic communication mechanism provided gpi-2 one-sided communication comes two flavors read write operations single list allocated segments moreover write operations extended notifications enable remote completion events remote rank react one-sided operations non-blocking asynchronous allowing program continue execution along data transfer mechanisms communication gpi-2 following codice_4 possibility use different queues communication requests request submitted one queues queues allow scalability used channels different types requests similar types requests queued get synchronised together independently ones separation concerns gpi-2 provides atomic operations variables manipulated atomically two basic atomic operations codice_5 codice_6 values used global shared variables synchronise processes events failure tolerant parallel programs require non-blocking communication calls gpi-2 provides timeout mechanism potentially blocking procedures timeouts procedures specified milliseconds instance gaspi_block pre-defined timeout value blocks procedure call completion gaspi_test another predefined timeout value blocks procedure shortest time possible i. e. time procedure call processes atomic portion work | [
5571,
578
] | Test |
5,337 | 3 | TruCluster:trucluster trucluster closed-source high-availability clustering solution tru64 unix operating system originally developed digital equipment corporation dec transferred compaq 1998 digital acquired company later merged hewlett-packard hp | [
7788,
3764,
2112,
5571,
83,
2776
] | Validation |
5,338 | 1 | Network_model:network model network model database model conceived flexible way representing objects relationships distinguishing feature schema viewed graph object types nodes relationship types arcs restricted hierarchy lattice hierarchical database model structures data tree records record one parent record many children network model allows record multiple parent child records forming generalized graph structure property applies two levels schema generalized graph record types connected relationship types called set types codasyl database generalized graph record occurrences connected relationships codasyl sets cycles permitted levels chief argument favour network model comparison hierarchical model allowed natural modeling relationships entities although model widely implemented used failed become dominant two main reasons firstly ibm chose stick hierarchical model semi-network extensions established products ims dl/i secondly eventually displaced relational model offered higher-level declarative interface early 1980s performance benefits low-level navigational interfaces offered hierarchical network databases persuasive many large-scale applications hardware became faster extra productivity flexibility relational model led gradual obsolescence network model corporate enterprise usage network model original inventor charles bachman developed standard specification published 1969 conference data systems languages codasyl consortium followed second publication 1971 became basis implementations subsequent work continued early 1980s culminating iso specification little influence products bachman influence recognized term bachman diagram diagrammatic notation represents database schema expressed using network model bachman diagram named rectangles represent record types arrows represent one-to-many relationship types records codasyl set types well-known database systems use network model include | [
1905,
3928,
4781,
6543,
2937,
6364,
7999,
4252,
6462,
1768,
2054,
5419,
7757,
5778,
7213,
7303,
4457,
784,
4463,
2265
] | Test |
5,339 | 3 | Reservation_station:reservation station unified reservation station also known unified scheduler decentralized feature microarchitecture cpu allows register renaming used tomasulo algorithm dynamic instruction scheduling reservation stations permit cpu fetch re-use data value soon computed rather waiting stored register re-read instructions issued designate reservation station want input read multiple instructions need write register proceed logically last one need actually written checks operands available raw execution unit free structural hazard starting execution instructions stored available parameters executed ready results identified unit execute corresponding instruction implicitly register renaming solves war waw hazards since fully associative structure high cost comparators need compare results returned processing units stored addresses tomasulo algorithm instructions issued sequence reservation stations buffer instruction well operands instruction operand available reservation station listens common data bus operand become available operand becomes available reservation station buffers execution instruction begin functional units adder multiplier corresponding reservation station output functional unit connects common data bus reservation stations listening operands need | [
5012,
5371,
3948,
7527,
7529,
5737,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
441,
4047,
5483,
5487,
6198,
1568,
1570,
7666,
515,
5521,
3747,
6236,
1237,
534,
7314,
1252,
4847,
4479,
895,
4864,
216,
4154,
5939,
4524,
5243,
6299,
8117,
2... | Test |
5,340 | 1 | Virtual_column:virtual column relational databases virtual column table column whose value automatically computed using columns values another deterministic expression virtual columns part sql standard implemented dbmss like mariadb sql server oracle firebird database server computed syntax two types virtual columns virtual columns values computed fly needed example returned select statement persistent column values computed row inserted table written like values change values change virtual persistent columns advantages disadvantages virtual columns n't consume space disk must computed every time query refers persistent columns n't require cpu time consume disk space however sometimes choice available dbms support one column type neither mariadb mysql fork virtual columns added 5.2 tree expressions used compute virtual columns following limitations persistent columns indexed part foreign key small limitations concerning constraint enforcement virtual columns used tables use storage engine supports storage engines supporting virtual columns mrg_myisam tables based myisam tables include persistent columns corresponding mrg_myisam column defined regular column create table alter table statement used add virtual column syntax used define virtual column following support virtual columns known mysql generated columns started becoming available v5.17.6 various limitations use relaxed subsequent versions since version 11g oracle supports virtual columns microsoft sql server supports virtual columns called computed columns sql server supports persisted non-persisted computed columns firebird always supported virtual columns precursor interbase supports called computed columns firebird supports virtual columns persistent ones allows sub-selects calling built functions external functions stored routines virtual column expression creating virtual column done table creation adding columns existing table syntax used define virtual column following industry standard | [
7213,
6056,
6538,
6279,
2054,
7715,
3776
] | Test |
5,341 | 2 | John_Lions:john lions john lions 19 january 1937 – 5 december 1998 australian computer scientist best known author lions commentary unix 6th edition source code commonly known lions book lions gained degree first-class honours university sydney 1959 applied received scholarship study university cambridge earned doctorate control engineering 1963 graduation worked consulting firm kcs ltd toronto ontario canada 1967 briefly took position dalhousie university halifax canada moving working burroughs los angeles systems analyst 1972 moved back sydney australia became senior lecturer department computer science university new south wales unsw 1980 promoted associate professor apart sabbaticals 1978 1983 1989 bell laboratories remained school retiring 1995 due bad health john lions married marianne two children katherine elizabeth death john o'brien steve jenkin chris maltby greg rose former students lions commenced campaign raise funds create chair name unsw john lions chair operating systems donations many unsw alumni corporations usenix linux australia chair created 2006 becoming first chair unsw funded contributions alumni 2009 gernot heiser became inaugural john lions chair 2002 unsw dedicated john lions garden front new computer science engineering building lions memory 2011 school computer science engineering unsw initiated john lions award contribution open software prize open high school undergraduate university students enrolled australian secondary tertiary institution full-time part-time students eligible well local internationals students annual prize valued 1,000 | [
1294,
5571,
6046
] | Train |
5,342 | 8 | YaCy:yacy yacy pronounced ya see free distributed search engine built principles peer-to-peer p2p networks core computer program written java distributed several hundred computers so-called yacy-peers yacy-peer independently crawls internet analyzes indexes found web pages stores indexing results common database called index shared yacy-peers using principles p2p networks free search engine everyone use build search portal intranet help search public internet clearly compared semi-distributed search engines yacy-network decentralised architecture yacy-peers equal central server exists run either crawling mode local proxy server indexing web pages visited person running yacy computer several mechanisms provided protect user privacy access search functions made locally running web server provides search box enter search terms returns search results similar format popular search engines yacy available windows mac linux yacy created 2003 michael christen yacy search engine based four elements yacy uses combination techniques networking administration maintenance indexing search engine including blacklisting moderation communication community yacy performs operations | [
6025,
8084,
3915,
4759,
1057,
80,
5451,
5571,
6835,
3338,
578,
3160,
876,
518
] | Test |
5,343 | 3 | NetBurst_(microarchitecture):netburst microarchitecture netburst microarchitecture called p68 inside intel successor p6 microarchitecture x86 family cpus made intel first cpu use architecture willamette -core pentium 4 released november 20 2000 first pentium 4 cpus subsequent pentium 4 pentium variants also based netburst mid-2004 intel released foster core also based netburst thus switching xeon cpus new architecture well pentium 4-based celeron cpus also use netburst architecture netburst replaced core microarchitecture based p6 released july 2006 netburst microarchitecture includes features hyper-threading hyper pipelined technology rapid execution engine execution trace cache replay system introduced first time particular microarchitecture never appeared afterwards hyper-threading intel proprietary simultaneous multithreading smt implementation used improve parallelization computations multiple tasks performed x86 microprocessors intel introduced netburst processors 2002 later intel reintroduced nehalem microarchitecture absence core microarchitecture northwood willamette feature external front-side bus runs 100 mhz 64-bits wide also quad-pumped thus giving 3.2 gb/s memory bandwidth intel northwood i850 chipset dual-channel rd-ram provide 3.2 gb/s memory bandwidth presler 800 mhz front-side bus 64-bits wide capable transferring 6.4 gb/s 800 mhz ddr2 memory name given 20-stage instruction pipeline within willamette core significant increase number stages compared pentium iii 10 stages pipeline prescott core 31-stage pipeline stages moving data around cpu although deeper pipeline increased branch misprediction penalty greater number stages pipeline allow cpu higher clock speeds thought offset loss performance smaller instructions per clock ipc indirect consequence pipeline depth—a matter design compromise small number long pipelines smaller ipc greater number short pipelines another drawback stages pipeline increase number stages need traced back event branch predictor makes mistake increasing penalty paid mis-prediction address issue intel devised rapid execution engine invested great deal branch prediction technology intel claims reduces branch mispredictions 33 pentium iii technology two alus core cpu double-pumped meaning actually operate twice core clock frequency example 3.8 ghz processor alus effectively operating 7.6 ghz reason behind generally make low ipc count additionally considerably enhances integer performance cpu intel also replaced high-speed barrel shifter shift/rotate execution unit operates frequency cpu core downside certain instructions much slower relatively absolutely making optimization multiple target cpus difficult example shift rotate operations suffer lack barrel shifter present every x86 cpu beginning i386 including main competitor processor athlon within l1 cache cpu intel incorporated execution trace cache stores decoded micro-operations executing new instruction instead fetching decoding instruction cpu directly accesses decoded micro-ops trace cache thereby saving considerable time moreover micro-ops cached predicted path execution means instructions fetched cpu cache already present correct order execution intel later introduced similar simpler concept sandy bridge called micro-operation cache uop cache replay system little-known subsystem within intel pentium 4 processor primary function catch operations mistakenly sent execution processor scheduler operations caught replay system re-executed loop conditions necessary proper execution fulfilled intel netburst architecture allows branch prediction hints inserted code tell whether static prediction taken taken feature abandoned later intel processors according intel netburst branch prediction algorithm 33 better one p6 despite enhancements netburst architecture created obstacles engineers trying scale performance microarchitecture intel looked attain clock speeds 10 ghz rising clock speeds intel faced increasing problems keeping power dissipation within acceptable limits intel reached speed barrier 3.8 ghz november 2004 encountered problems trying achieve even intel abandoned netburst 2006 heat problems reached level severity developed core microarchitecture inspired p6 core pentium pro tualatin pentium iii-s directly pentium m. intel replaced original willamette core redesigned version netburst microarchitecture called northwood january 2002 northwood design combined increased cache size smaller 130 nm fabrication process hyper-threading technology although initially models 3.06 ghz model feature disabled produce modern higher-performing version netburst microarchitecture february 2004 intel introduced prescott radical revision microarchitecture prescott core produced 90 nm process included several major design changes including addition even larger cache 512 kb northwood 1 mb 2 mb prescott 2m much deeper instruction pipeline 31 stages compared 20 northwood heavily improved branch predictor introduction sse3 instructions later implementation intel 64 intel branding compatible implementation x86-64 64-bit version x86 microarchitecture hyper-threading prescott chips branded pentium 4 ht hardware support feature initially enabled high-end xeon processors officially introduced processors pentium trademark power consumption heat dissipation also became major issues prescott quickly became hottest-running power-hungry intel single-core x86 x86-64 processors power heat concerns prevented intel releasing prescott clocked 3.8 ghz along mobile version core clocked 3.46 ghz intel also released dual-core processor based netburst microarchitecture branded pentium d. first pentium core codenamed smithfield actually two prescott cores single die later presler consists two cedar mill cores two separate dies cedar mill 65 nm die-shrink prescott intel netburst based successors development called tejas jayhawk 40 50 pipeline stages ultimately decided replace netburst core microarchitecture released july 2006 successors directly derived 1995 pentium pro p6 microarchitecture august 8 2008 marked end intel netburst based processors reason netburst abandonment severe heat problems caused high clock speeds core- nehalem-based processors higher tdps processors multi-core core gives fraction maximum tdp highest-clocked core-based single-core processors give maximum 27 w heat fastest-clocked desktop pentium 4 processors single-core tdps 115 w compared 88 w fastest clocked mobile versions although introduction new steppings tdps models eventually lowered nehalem microarchitecture successor core microarchitecture actually supposed evolution netburst according intel roadmaps dating back 2000 due netburst abandonment nehalem completely different project similarities netburst nehalem reimplements hyper-threading technology first introduced 3.06 ghz northwood core pentium 4 nehalem also implements l3 cache processors based consumer processor implementation l3 cache first used gallatin core pentium 4 extreme edition oddly missing prescott 2m core brand | [
2449,
2814,
5802,
6332,
6698,
6793,
4847,
3942,
3849,
4765,
6170,
3443,
6344,
2828,
2830,
4108,
4314,
5737,
7449,
5042,
7453,
3020,
7364,
3717,
5669,
5670,
4968,
3803,
6647,
4972,
5947,
1867,
3565,
4077,
7118,
4985,
766,
2248,
691,
5343,
... | Test |
5,344 | 3 | Ganbare_Goemon!_Karakuri_Dōchū:ganbare goemon karakuri dōchū game revolves around main character goemon exploits name suggests character based ishikawa goemon noble thief japanese folklore unlike sequels game still n't feature comic situation strange characters define series goemon portrayed noble thief rather plain hero game plays top view action/adventure game similar legend zelda though separated stages level goemon must find three passes order advance passes found boxes secret passages bought finishing stages game present new japanese province eight total levels remain ending however different like rest series goemon powered certain items found and/or bought lost hits msx version option played turns two players second player playing ninja named nezumi kozō basis goemon sidekick ebisumaru addition unlike family computer version game six provinces completely new levels finishing game | [] | Train |
5,345 | 9 | Convolution_(computer_science):convolution computer science computer science specifically formal languages convolution sometimes referred zip function maps tuple sequences sequence tuples name zip derives action zipper interleaves two formerly disjoint sequences reverse function unzip performs deconvolution given three words cat fish cat 3 fish 4 2 let formula_1 denote length longest word fish formula_2 convolution cat fish 4 tuples elements symbol original alphabet haskell truncates shortest sequence formula_4 formula_5 let σ alphabet symbol σ let x x ... x ... z z ... z ... n words i.e finite sequences elements σ let formula_1 denote length longest word i.e maximum x z ... convolution words finite sequence n -tuples elements σ ∪ i.e element formula_7 index w w convolution x z ... denoted conv x z ... zip x z ... x ⋆ ⋆ z ⋆ ... inverse convolution sometimes denoted unzip variation convolution operation defined formula_4 minimum length input words avoids use adjoined element formula_11 destroys information elements input sequences beyond formula_4 convolution functions often available programming languages often referred zip lisp-dialects one simply map desired function desired lists map variadic lisp take arbitrary number lists argument example clojure common lisp languages python provide zip function older version python 2 allowed mapping none lists get similar effect zip conjunction operator unzips list haskell method convolving sequences requires specific function arity zip two sequences zip3 three etc similarly functions unzip unzip3 available unzipping list languages support convolution | [
2740,
4543,
5965,
1445,
6428
] | Test |
5,346 | 7 | Symphony_(software):symphony software ibm spectrum symphony previously known ibm platform symphony platform symphony high-performance computing hpc software system developed platform computing company developed load sharing facility lsf focusing financial services symphony designed deliver scalability enhances performance compute-intensive risk analytical applications product lets users run applications using distributed computing version 4.0 platform included developer edition restrictions time limits symphony developer edition free high-performance computing hpc grid computing software development kit middleware described first solution tailored developing testing grid-ready service-oriented architecture applications | [
4159,
4759,
5571,
2530,
578,
5666
] | Validation |
5,347 | 3 | TIM-001:tim-001 tim-001 application development microcomputer developed mihajlo pupin institute serbia 1983/84 1 dragoljub milićević dušan hristović ed računari tim naučna knjiga belgrade 1990 serbian language 2 dušan hristović razvoj računarstva u srbiji computing serbia phlogiston journal 18/19 pp.89-105 museum mnt-sanu belgrade 2010/2011 serbian 3 d.b.vujaklija n.markovic ed 50 years computing serbia pp.37-44 dis imp pc-press belgrade 2011 | [
4803,
7225,
6693,
7423
] | Test |
5,348 | 6 | Source_Code_Control_System:source code control system source code control system sccs version control system designed track changes source code text files development piece software allows user retrieve previous versions original source code changes stored originally developed bell labs 1972 marc rochkind ibm system/370 computer running os/360 sccs also known codice_1 string example string contains file name date also contain comment compilation string found binary object files looking pattern used determine source code files used compilation command available automate search version strings 1972 marc rochkind developed sccs snobol4 bell labs ibm system/370 computer running os/360 mvt later rewritten c unix running pdp-11 first publicly released version sccs version 4 february 18 1977 available programmer workbench pwb edition operating system release 4 sccs first version used text-based history file format earlier versions use binary history file formats release 4 longer written maintained marc rochkind subsequently sccs included commercial system iii system v distributions licensed 32v ancestor bsd sccs command set part single unix specification sccs dominant version control system unix later version control systems notably rcs later cvs gained widespread adoption today early version control systems generally considered obsolete particularly open-source community largely embraced distributed version control systems however sccs file format still used internally newer version control programs including bitkeeper teamware latter frontend sccs sablime developed modified version sccs uses history file format incompatible sccs sccs file format uses storage technique called interleaved deltas weave storage technique considered many version control system developers foundational advanced merging versioning techniques precise codeville pcdv merge apart fixing year 2000 problems 1999 active development various unix vendor specific sccs versions 2006 sun microsystems today part oracle released solaris version sccs open-source cddl license part efforts open-source solaris source code control system sccs system controlling file history changes software typically upgraded new version fixing bugs optimizing algorithms adding extra functions changing software causes problems require version control solve sccs built solve problems sccs five major versions ibm os five major versions unix two specific implementations using sccs pdp 11 unix ibm 370 os sccs consists two parts sccs commands sccs files basic operations e.g. create delete edit realized sccs commands sccs files unique format prefix codice_2 controlled sccs commands sccs file composed three different parts sccs delta refers change sccs file deltas stored delta table sccs file record changes every operation sccs file tracked flags functions three types control records used keep track insertions deletions applied different deltas insertion control record deletion control record end control record whenever user changes part text control record inserted surrounding change control records stored body along original source code text records lots commands used sccs commands helps users finish want achieve without understanding worked also sccs allows users access history files moreover also provides commands allow edit monitor change source files sccs create command uses text source file create new history file example outputs name version lines create command macro expands admin create new history file followed get retrieve file edit specific file edit command macro expands get -e. check new version get new version sccs delget command macro expands delta check new version file followed get retrieve file outputs version lines want get specific file command produces report changes made unix versions include version sccs however often longer actively developed jörg schilling requested release sccs early days opensolaris project maintains fork sccs based opensolaris source code received major feature enhancements remains compatible original sccs versions unless using new project mode heirloom project includes version sccs derived opensolaris source code maintained december 2006 april 2007 gnu offers sccs compatible program gnu cssc compatibly stupid source control occasionally used convert sccs archives newer systems like cvs subversion complete sccs implementation recommended use new projects mostly meant converting modern version control system since 1990s many new version control systems developed become popular designed managing projects large number files offer advanced functionality multi-user operation access control automatic building network support release management distributed version control bitkeeper teamware use sccs file format internally considered successors sccs src version control system also use sccs file format internally rcs aims provide better user interface sccs still managing single-file projects | [
1155,
5216,
7383,
1554,
5571,
1426,
1493,
2118,
3463,
6785,
1435,
6367
] | Train |
5,349 | 6 | Pack_(compression):pack compression pack deprecated unix shell compression program based huffman coding unpack utility restore files original state compressed using pack utility files specified standard input uncompressed standard output although obsolete support packed files exists modern compression tools gzip 7-zip files compressed pack typically given extension .z confused .z compress files returned original state using unpack addition may also pcat command reads compressed file sends output stdout | [
4213,
7058,
985,
1352,
6992,
4700,
1955,
7746,
3032,
7201,
7387,
3219,
510,
1127,
2334,
6940,
8126,
4732,
5256,
3152,
169,
1139,
4461,
2897,
619
] | Test |
5,350 | 4 | Humming_Heads:humming heads humming heads inc. eip enterprise information protection software developer based japan humming heads inc. founded 1999 focus computer security shipped first product security platform sep 2001 anti-virus software taking sox seriously humming heads introduced functionality preventing unauthorized access confidential information theft electronic systems humming heads came implementation desktop file manager 2017 firm entered us market sep prevents unauthorized information access pc well external devices sep client controlling storage devices automatically performs operations like encryption also keeps log user operations stored server side analyzed needed one important features sep marginal effect client pc performance originally sep available japanese language chinese english versions sep software development | [] | Validation |
5,351 | 8 | Mobile_web_analytics:mobile web analytics mobile web analytics studies behavior mobile website visitors similar way traditional web analytics commercial context mobile web analytics refers use data collected visitors access website mobile phone helps determine aspects website work best mobile traffic mobile marketing campaigns work best business including mobile advertising mobile search marketing text campaigns desktop promotion mobile sites services data collected part mobile analytics typically includes page views visits visitors countries well information specific mobile devices device model manufacturer screen resolution device capabilities service provider preferred user language data typically compared key performance indicators performance return investment used improve website mobile marketing campaign audience response majority modern smartphones able browse websites browsing experiences similar desktop computers w3c mobile web initiative identifies best practices help websites support mobile phone browsing many companies use guidelines mobile-specific code like wireless markup language html5 optimize websites viewing mobile devices begin way users interact cell phone tablet differs immensely way interact desktop laptop action clicking mouse replaced action swiping finger scrolling longer pages relevant information one place replaced top heavy navigation styles factors greatly influence click-through rates consequently way web analytics used collecting mobile web analytics data proven less straightforward traditional web analytics due defining factors traditional analytics software mobile website provides data http requests coming advanced mobile browsers found iphone smart phones pdas data mobile devices browsing site common web analytics software use server log parsing associate different ip addresses unique visits may fail actually identify unique visitors due ip addresses mobile device originating gateway ip address network access provider several dynamic server-side platforms used develop mobile sites server-side tracking code recommended accurate analytics reporting different tracking processes mechanisms available platforms unsupported/html sites javascript pixel tracking mechanism commonly used mobile websites typically open access kind network fixed wi-fi cellular wireless satellite wireless etc traditional web analytics solution could range fairly accurate mostly inaccurate depending http requests coming addition mobile web analytics involve metrics kpis associated mobile device information model manufacturer screen resolution data usually assembled combining device identification information taken special http headers user-agents device capabilities stored device information registry wurfl method provided traditional web analytics solutions mobile web-specific visitor identification important aspect usable mobile web analytics one hardest technical aspects accomplish primarily javascript http cookies unreliable mobile browsers result mobile web analytics solutions detect count user visits per day best solutions provide reliable persistent unique user identities allowing accurate measurement repeat visits long-term customer loyalty javascript-based page tagging notifies third-party server page rendered web browser method assumes end user browser javascript capabilities javascript enabled though possible neither may true time mobile web browsers support javascript sufficiently work http cookies commonly used mark identify visitors cookies standard capability desktop web browsers prevalence iphones androids http cookies supported smartphones default iphones android phones accept browser cookies web sites desktop browsers mobile device user may choose disable cookies http referrer information showing visitor navigated generally provided mobile web browsing either device manufacturer disabled sending information http request save bandwidth network usage mobile network operator internet gateway removes alters original http header due gateway software use mobile web transcoding software handset caching mechanisms impact use images page tagging cases image caching handsets performed regardless anti-caching headers output remote server desktop web browsing network address client machine usually gives form user identification location mobile web browsing client ip address refers internet gateway machine owned network operator devices blackberry phones using opera mini browser software ip address refers operator-owned internet gateway machine canada norway collection mobile web analytics data requires different approach collecting traditional web analytics data number solutions available best results obtained use one technology also known tagless data capture passive network capture technique uses tap mobile users web server capture full content client-server exchange tagless data capture techniques increasing popularity mobile web analytics capture users work devices require javascript cookies server logs plugins images forced work mobile web analytics provided transmitted image always unique level information recorded transmissions depends architecture provided supplier image beacon solutions link redirection important method tracking mobile visitor activities reliable way record clicks advertising search marketing activities also records visitors clicking links leave site method helps address lack http referrer information mobile tells number basic facts mobile phone browser used conjunction device database wurfl operator database used identify operators countries based ip addresses internet gateway devices ip addresses alone identify operators countries operators share mobile networks virtual network operators mvno boost wireless example uses sprint network two operators different customer demographics clear differentiation operators critical good mobile marketing campaigns carriers may also share mobile internet gateways sometimes across multiple countries many change add gateways regular basis wap gateway logs mine information analysed get relevant information mobile traffic goes servers companies like openwave tools analyse logs provide information required | [
1544,
3857,
6029,
6788,
2451,
2,
5965,
4600,
2530,
3543,
740,
6024
] | Test |
5,352 | 9 | S-1_Lisp:s-1 lisp s-1 lisp lisp implementation written lisp 36-bit pipelined s-1 mark iia supercomputer computer architecture 32 megawords ram | [
7878,
1445,
897,
6796,
6888,
6087,
4588,
2734,
6981,
5734,
3188,
6352,
1557,
218,
1478,
5494,
4704,
3880,
4609,
6116,
3212,
1023,
5501,
5947,
6210,
1116,
144,
6922,
6471,
7481,
2144,
2600,
7298,
5515,
8025,
5077,
7032,
4543,
1889,
2156,
... | Test |
5,353 | 9 | Whiley_(programming_language):whiley programming language whiley experimental programming language combines features functional imperative paradigms supports formal specification function preconditions postconditions loop invariants language uses flow-sensitive typing also known flow typing whiley project began 2009 response verifying compiler grand challenge put forward tony hoare 2003 first public release whiley june 2010 primarily developed david pearce whiley open source project contributions small community system used student research projects teaching undergraduate classes supported 2012 2014 royal society new zealand marsden fund whiley compiler generates code java virtual machine inter-operate java jvm based languages goal whiley provide realistic programming language verification used routinely without thought idea tool long history strongly promoted early 2000s hoare verifying compiler grand challenge purpose challenge spur new efforts develop verifying compiler roughly described follows primary purpose tool improve software quality ensuring program meets formal specification whiley follows many attempts develop tools including notable efforts spark/ada esc/java spec dafny why3 frama-c previous attempts develop verifying compiler focused extending existing programming languages constructs writing specifications example esc/java java modeling language add annotations specifying preconditions postconditions java likewise spec frama-c add similar constructs c c programming languages however languages known contain numerous features pose difficult insurmountable problems verification contrast whiley language designed scratch effort avoid common pitfalls make verification tractable syntax whiley follows general appearance imperative object-oriented languages indentation syntax chosen use braces delineate statement blocks given strong resemblance python however imperative look whiley somewhat misleading language core functional pure whiley distinguishes codice_1 pure codice_2 may side-effects distinction necessary allows functions used specifications familiar set primitive data types available including codice_3 codice_4 arrays e.g codice_5 records e.g codice_6 however unlike programming languages integer data type codice_4 unbounded correspond fixed-width representation 32-bit two complement thus unconstrained integer whiley take possible integer value subject memory constraints host environment choice simplifies verification reasoning modulo arithmetic known hard problem compound objects e.g arrays records references values heap languages java c instead immutable values whiley takes unusual approach type checking referred flow typing variables different static types different points function method flow typing similar occurrence typing found racket aid flow typing whiley supports union intersection negation types union types comparable sum types found functional languages like haskell whiley disjoint intersection negation types used context flow typing determine type variable true false branches runtime type test example suppose variable codice_8 type codice_9 runtime type test codice_10 true branch type codice_8 becomes codice_12 whilst false branch becomes codice_13 whiley uses structural rather nominal type system modula-3 go ceylon examples languages support structural typing form whiley supports reference lifetimes similar found rust lifetimes given allocating new objects indicate safely deallocated references objects must include lifetime identifier prevent dangling references every method implicit lifetime referred codice_14 variable type codice_15 represents reference object type codice_9 deallocated enclosing method subtyping lifetimes determined outlives relation thus codice_17 subtype codice_18 lifetime codice_19 statically outlives lifetime codice_20 lifetime whose scope encloses another said outlive lifetimes whiley differ rust currently include concept ownership whiley built-in support concurrency formal memory model determine reading/writing shared mutable state interpreted following example illustrates many interesting features whiley including use postconditions loop invariants type invariants union types flow typing function intended return first index integer codice_21 array integer codice_22 index exists codice_23 returned // define type natural numbers type nat int x x 0 public function indexof int items int item int|null index // int returned element position matches item ensures index int == items index == item // int returned element position first match // null returned element items matches item ensures index null == 0 .. |items| items == item function declared return type given union type codice_24 indicates either codice_4 value returned codice_23 returned function postcondition made three codice_27 clauses describe different properties must hold returned codice_28 flow typing employed clauses runtime type test operator codice_29 example first codice_27 clause variable codice_28 retyped codice_24 codice_4 right-hand side implication operator i.e codice_34 example also illustrates use inductive loop invariant loop invariant must shown hold entry loop given iteration loop loop exits case loop invariant states known elements codice_22 examined far — namely none matches given codice_21 loop invariant affect meaning program sense might considered unnecessary however loop invariant required help automated verifier using whiley compiler prove function meets specification example also defines type codice_37 appropriate type invariant type used declare variable codice_38 indicate never hold negative value case declaration prevents need additional loop invariant form codice_39 would otherwise necessary whiley began 2009 first public release codice_40 following june 2010 codice_41 september year language evolved slowly numerous syntactical changes made to-date versions prior codice_42 supported first-class codice_43 codice_44 data types removed favour representing strings constrained codice_5 arrays likewise versions prior codice_46 supported first-class set e.g codice_47 dictionary e.g codice_48 resizeable list codice_49 dropped favour simple arrays e.g codice_5 perhaps controversial removal codice_51 datatype version codice_52 many changes motivated desire simplify language make compiler development manageable another important milestone evolution whiley came version codice_53 inclusion reference lifetimes developed sebastian schweizer part master thesis university kaiserslautern | [
6507,
1363,
2740,
5751,
1889,
1600,
5965,
7385,
5506,
3069,
7435,
1852,
993,
1435
] | Test |
5,354 | 6 | SuperCopier:supercopier supercopier file-copying software windows macos linux superseded ultracopier noted supercopier official website main features include normal vs ultimate version | [
1688,
5948,
5571,
7046,
578
] | Validation |
5,355 | 8 | URL_normalization:url normalization url normalization process urls modified standardized consistent manner goal normalization process transform url normalized url possible determine two syntactically different urls may equivalent search engines employ url normalization order reduce indexing duplicate pages web crawlers perform url normalization order avoid crawling resource web browsers may perform normalization determine link visited determine page cached several types normalization may performed always semantics preserving may following normalizations described rfc 3986 result equivalent urls http https urls following normalizations listed rfc 3986 may result equivalent urls guaranteed standards applying following normalizations result semantically different url although may refer resource normalization rules may developed specific websites examining url lists obtained previous crawls web server logs example url appears crawl log several times along may assume two urls equivalent normalized one url forms schonfeld et al 2006 present heuristic called dustbuster detecting dust different urls similar text rules applied url lists showed correct dust rules found applied normalization algorithm able find 68 redundant urls url list | [
1411,
2086,
80,
4198,
7390,
84
] | Test |
5,356 | 1 | TRICS:trics trics trip rate information computer system database trip rates developments used united kingdom transport planning purposes specifically quantify trip generation new developments trics consortium describes trics follows database established 1989 six county councils south east england county councils dorset east sussex hampshire kent surrey west sussex run trics consortium limited trics 7 major update released late 2013 trics includes following development categories trics also developed sam standard assessment methodology system measure effectiveness travel plans | [] | Validation |
5,357 | 2 | Mtrace:mtrace codice_1 memory debugger included gnu c library note codice_1 tool works single threaded applications one thread could temporarily remove hook another thread could malloc memory sametime leading missed allocations multithreaded application function codice_1 installs handlers codice_4 codice_5 codice_6 function codice_7 disables handlers prototypes defined header file codice_8 handlers log memory allocations frees file defined environment variable malloc_trace variable unset describes invalid filename describes filename user permissions handlers installed perl script called codice_1 confused function name also distributed gnu c library script parses output file reports allocations freed following example bad source code problem program allocates memory ’ free memory exiting mtrace command reports “ memory leaks ” memory allocated last execution program also released way hand mtrace gives output means programmer still work following example good source code releases memory allocated uses mtrace notify programmer memory leaks | [
5983,
1435,
572,
5480
] | Test |
5,358 | 4 | Yalu_(iOS):yalu ios yalu formerly yalu mach portal jailbreaking tool created qwertyoruiop luca todesco marcograssi supports ios 10.1 10.1.1 ios 10.2 64-bit devices pre-iphone 7 ios 10.1 10.1.1 iphone 7 jailbreak semi-untethered requires rerun upon reboot however app certificate expires seven days sideloaded using cydia impactor jailbreak uses vulnerabilities released google project zero mach_portal intended developers final release mach_portal beta 4.1 developer reported broken initially saurik mobile substrate working later versions mach_portal attempted fix remained unstable developers launch app sideloaded using cydia impactor wait crash activate mach_portal supported iphone 7 iphone 6s ipad pro yalu successor mach_portal uses vulnerabilities patched ios 10.2.1 released 64-bit devices pre-iphone 7 beta 1 verifies mobile substrate works beta 2 added support iphone 5s/se 6 present mach_portal beta 3 fixes glitch users apple watch would experience beta 4 patches kernel forces dropbear use secure port instead 0.0.0.0 underneath beta 5 yalu download page qwertyoruiop writes placebo effect minor bug fixes patched release beta 7 adds support ios 10 64-bit devices jailbreakers reported final release stable | [
3511,
4522,
1123
] | Validation |
5,359 | 3 | King's_Valley:king valley king ’ valley platform game released konami msx 1985 game plays like lode runner takes place egyptian pyramids intrepid adventurer player goal collect various gems evading angry mummies monsters long enough find exit next level port ms-dos made korean company named aproman supports monochrome cga graphic cards sequel king valley ii released msx two versions specifically designed msx msx2 respectively | [
3213,
6380
] | Test |
5,360 | 4 | Malware_Bell:malware bell malware bell malware program made taiwan somewhere 2006 2007 malware bell tries install automatically upon visiting website promoting containing malware | [] | Validation |
5,361 | 5 | Media_gateway_control_protocol_architecture:media gateway control protocol architecture media gateway control protocol architecture methodology providing telecommunication services using decomposed multimedia gateways transmitting telephone calls internet protocol network traditional analog facilities public switched telephone network pstn architecture originally defined rfc 2805 used several prominent voice ip voip protocol implementations media gateway control protocol mgcp megaco h.248 successors obsolete simple gateway control protocol sgcp architecture divides functions required integration traditional telecommunication networks modern packet networks several physical logical components notably media gateway media gateway controller signaling gateways interaction media gateway controller defined media gateway control protocol media gateway protocols developed based internet model networking internet protocol suite referred device control protocols media gateway device offers ip interface legacy telephone interface converts media audio video streams legacy telephone interface may complex interface pstn switch may simple interface traditional telephone depending size purpose gateway may allow ip-originated calls terminate pstn vice versa may simply provide means connect telephone telecommunication system via ip network originally gateways viewed monolithic devices call control using protocols h.323 session initiation protocol hardware required control pstn interface 1998 idea splitting gateway two logical parts proposed one part contains call control logic called media gateway controller mgc call agent ca part interfaces pstn called media gateway mg functional split new interface existed mgc mg requiring framework communication elements resulting media gateway control protocol architecture sip h.323 signaling protocols media gateway control protocols device control protocols architectural difference sip h.323 media gateway control protocols relationships entities sip h.323 peer-to-peer relationships entities media gateway control protocols use master/slave technology model sip h.323 handle call setup connection management tear-down calls like interfaces whereas media gateway control protocols define mechanisms setup media paths streams ip networks several implementations media gateway control protocol common use names best-known protocols abbreviations protocol group although similar architecture mgcp h.248/megaco distinctly different protocols interoperable h.248/megaco mgcp protocols complementary h.323 sip may referred intelligent endpoint protocols h.248/megaco mgcp may referred device control protocols media gateway control protocols include predecessors mgcp namely simple gateway control protocol sgcp internet protocol device control ipdc proprietary protocol using similar architecture cisco skinny call control protocol sccp media gateway device converts media streams form digital data analog signals telecommunication services voice video fax applications two usually dissimilar interfaces using different technologies one technologies usually packet frame cell network example may convert voice telephone calls traditional analog telephone digital format transmission internet protocol ip network facilitate voice ip communications media gateway controller mgc also known call agent controls media gateways monitors gateways events off-hook state user intends initiate telephone call issues requests gateway initiate complete sessions alert called party terminate call protocols used interaction gateway controller evolved various types versions simple gateway control protocol sgcp internet protocol device control ipdc replaced media gateway control protocol mgcp megaco also known h.248 mgcs interface signaling protocols signalling system 7 ss7 interconnection traditional telephone system h.323 session initiation protocol sip device control protocols evolved several versions mgcp emerged group called international softswitch consortium group started early level 3 communications acquisition xcom telcordia bellcore july 1998 telcordia bellcore cisco systems created protocol called simple gateway control protocol sgcp controlling telephony gateways external call control elements meanwhile mid-1998 level 3 created technical advisory council tac composed dozen leading communications equipment manufacturers tac proposed device protocol called internet protocol device control ipdc august 1998 ipdc intended used media gateway media gateway controller media gateway capable acting voice ip gateway voice atm gateway dialup modem media gateway circuit switch cross- connect october 1998 simple gateway control protocol sgcp combined internet protocol device control ipdc resulting mgcp mgcp submitted ietf ’ megaco working group october 1998 november 1998 lucent technologies submitted draft third device protocol called media device control protocol mdcp use media gateways controllers ietf merged mgcp mdcp proposed new improved protocol named megaco protocol also known h.248 april 1999 first official version mgcp defined rfc 2705 informational rfc 3435 obsoleted rfc 2705 mgcp currently purely informational rather standard-track protocol although includes protocol specification even mgcp still internet draft many companies developed included mgcp development rather wait standardized protocol therefore decision made release mgcp informational rfc october 1999 ietf development mgcp stopped although companies continue implement mgcp driven efforts packetcable development network-based call signaling standardization mgcp effort pursued ietf megaco working group also itu-t/sg16 code name h.gcp rfc 3015 standard tracks megaco protocol also h.248 motivation megaco need satisfy various requirements addressed properly mgcp megaco evolution mgcp combination mgcp mdcp published standard rfc 3015 november 2000 megaco mgcp different interoperable h.248 h.248.1 gateway control protocol version 3 published international telecommunication union telecommunication itu-t protocol standard itu-t published three versions h.248.1 ietf published gateway control protocol version 1 informational rfc 3525 h.248 mgcp protocol controlling media gateways using media gateway controller call agent voip system h.248 mgcp used sip h.323 sip h.323 provide intercommunication gateway controllers mgcp used manage media establishment media gateways | [
3821,
430,
3887,
6775,
4738,
4783,
7170
] | Test |
5,362 | 2 | SUPER-UX:super-ux super-ux version unix operating system nec used sx series supercomputers initial version super-ux based unix system v version 3.1 features bsd 4.3 version nec sx-9 based svr4.2mp bsd enhancements super-ux 64-bit unix operating system supports supercomputer file system sfs earth simulator uses custom os called esos earth simulator operating system based super-ux many enhanced features custom designed earth simulator regular super-ux os | [
1522,
4751,
4478,
1923,
900,
2467,
5822,
2294,
5571,
2300,
2118,
6360,
578,
6367,
1023,
4447,
443
] | Test |
5,363 | 9 | NumPy:numpy numpy pronounced sometimes library python programming language adding support large multi-dimensional arrays matrices along large collection high-level mathematical functions operate arrays ancestor numpy numeric originally created jim hugunin contributions several developers 2005 travis oliphant created numpy incorporating features competing numarray numeric extensive modifications numpy open-source software many contributors python programming language initially designed numerical computing attracted attention scientific engineering community early special interest group called matrix-sig founded 1995 aim defining array computing package among members python designer maintainer guido van rossum implemented extensions python syntax particular indexing syntax make array computing easier implementation matrix package completed jim fulton generalized jim hugunin become numeric also variously called numerical python extensions numpy hugunin graduate student massachusetts institute technology mit joined corporation national research initiatives cnri work jpython 1997 leaving paul dubois lawrence livermore national laboratory llnl take maintainer early contributors include david ascher konrad hinsen travis oliphant new package called numarray written flexible replacement numeric like numeric deprecated numarray faster operations large arrays slower numeric small ones time packages used different use cases last version numeric v24.2 released 11 november 2005 numarray v1.5.2 released 24 august 2006 desire get numeric python standard library guido van rossum decided code maintainable state early 2005 numpy developer travis oliphant wanted unify community around single array package ported numarray features numeric releasing result numpy 1.0 2006 new project part scipy avoid installing large scipy package get array object new package separated called numpy support python 3 added 2011 numpy version 1.5.0 2011 pypy started development implementation numpy api pypy yet fully compatible numpy numpy targets cpython reference implementation python non-optimizing bytecode interpreter mathematical algorithms written version python often run much slower compiled equivalents numpy addresses slowness problem partly providing multidimensional arrays functions operators operate efficiently arrays requiring rewriting code mostly inner loops using numpy using numpy python gives functionality comparable matlab since interpreted allow user write fast programs long operations work arrays matrices instead scalars comparison matlab boasts large number additional toolboxes notably simulink whereas numpy intrinsically integrated python modern complete programming language moreover complementary python packages available scipy library adds matlab-like functionality matplotlib plotting package provides matlab-like plotting functionality internally matlab numpy rely blas lapack efficient linear algebra computations python bindings widely used computer vision library opencv utilize numpy arrays store operate data since images multiple channels simply represented three-dimensional arrays indexing masking arrays efficient ways access specific pixels image numpy array universal data structure opencv images extracted feature points filter kernels many vastly simplifies programming workflow debugging core functionality numpy ndarray n -dimensional array data structure arrays strided views memory contrast python built-in list data structure despite name dynamic array arrays homogeneously typed elements single array must type arrays also views memory buffers allocated c/c++ cython fortran extensions cpython interpreter without need copy data around giving degree compatibility existing numerical libraries functionality exploited scipy package wraps number libraries notably blas lapack numpy built-in support memory-mapped ndarrays inserting appending entries array trivially possible python lists np.pad ... routine extend arrays actually creates new arrays desired shape padding values copies given array new one returns numpy np.concatenate a1 a2 operation actually link two arrays returns new one filled entries given arrays sequence reshaping dimensionality array np.reshape ... possible long number elements array change circumstances originate fact numpy arrays must views contiguous memory buffers replacement package called blaze attempts overcome limitation algorithms expressible vectorized operation typically run slowly must implemented pure python vectorization may increase memory complexity operations constant linear temporary arrays must created large inputs runtime compilation numerical code implemented several groups avoid problems open source solutions interoperate numpy include codice_1 numexpr numba cython pythran static-compiling alternatives | [
3607,
7966,
5288,
5117,
1361,
5571,
1435,
7459,
3898,
7848,
1494,
6489,
8137,
5965,
256,
3915,
1892,
6497,
4280,
2803,
1336
] | Validation |
5,364 | 3 | Elbrus-8S:elbrus-8s elbrus-8s russian 28 nanometer 8-core microprocessor developed moscow center sparc technologies mcst first prototypes produced end 2014 serial production started 2016 elbrus-8s used servers workstations four elbrus processors server motherboard puts total 32 processor cores server blade 2018 mcst announced plans production updated version twice performance elbrus-8sv cpu features 576 gflops 1.5 ghz well ddr4 support instead ddr3 engineering samples already completed q3 2017 | [
3098,
4657,
5055,
1761,
3747,
1237,
352,
971,
1753,
1778,
8102,
6480
] | Test |
5,365 | 4 | Cloudbric_Labs:cloudbric labs cloudbric labs collection free web security resources tools provided cloud-based web security provider cloudbric ’ designed use developers webmasters end users interested achieving maintaining basic website security cloudbric labs composed api offered allow users integrate information cloudbric labs security platforms | [
230,
758
] | Test |
5,366 | 2 | Woof_(software):woof software woof software application used build puppy linux distribution another linux distribution application must run inside puppy linux internet connection required order download linux distro binary packages cd-remaster program available puppy linux used build variants puppy linux distribution process used woof build puppy linux distribution another linux distribution linux distributions woof use foundation puppy linux distribution | [
336,
4603,
6984,
7075,
3559,
4435,
352,
1535,
3751,
578,
5232,
1435
] | Test |
5,367 | 9 | Tiny_BASIC:tiny basic tiny basic dialect basic programming language fit little 2 3 kb memory small size made invaluable early days mid-1970s typical memory size 4 8 kb meet strict size limits math purely integer based lacked arrays language written part alternative microsoft basic ms basic would also run 4 kb machines left 790 bytes free programs free space significant advantage tiny basic another reason tiny basic popularity open letter published bill gates complaining users ripping ms basic tiny basic published openly later invented term copyleft describe made popular burgeoning early microcomputer market tiny basic published newsletter offshoot people computer company dozens versions created almost every platform era many variations additions published time newsletter eventually became dr. dobb journal long-lived computing magazine tiny basic example free software project existed free software movement dennis allison member computer science faculty stanford university wrote specification simple version basic programming language urged create standard bob albrecht homebrew computer club seen basic minicomputers felt would perfect match new machines like mits altair 8800 released january 1975 allison proposed design used integer arithmetic support arrays goal program fit 2 3 kilobytes memory first version published people computer company separate newsletter format known tiny basic journal full name dr. dobb tiny basic journal calisthenics orthodontia running light without overbyte first issue released january 1976 point programmers began modifying code sending results back published future issues sending magazines like interface age scope original newsletter expanded eventually became known simply dr. dobb journal dick whipple john arnold wrote interpreter required 3k ram middle 1976 tiny basic interpreters available intel 8080 motorola 6800 mos technology 6502 processors forerunner free software community collaborative development internet allowed easy transfer files example free software project free software movement computer hobbyists would exchange paper tapes cassettes even retype files printed listings jim warren editor dr. dobb wrote july 1976 acm programming language newsletter motivations methods successful project started viable alternative problems raised bill gates irate letter computer hobbyists concerning 'ripping software software free inexpensive easier pay duplicate wo n't 'stolen bill gates letter written make software products alternative method experienced professional overall design outline implementation strategy knowledgeable amateurs would implement design variety computer systems warren predicted strategy would continued expanded may 1976 issue dr. dobbs li-chen wang palo alto tiny basic intel 8080 microprocessor listing began usual title author name date also copyleft wrongs reserved fellow homebrew computer club member roger rauskolb modified improved li-chen wang program published december 1976 issue interface age magazine roger added name preserved copyleft notice versions tiny basic existed one written thomas f. waitman 1976 hewlett-packard hp-2640 hp-2645 terminals used intel 8008 8080 processors 8080 ran tiny basic interpreter thomas f. waitman wrote articles hewlett-packard journal 1977 radioshack released first computer trs-80 basic interpreter rom derived palo-alto tiny basic dr. wang version occupied less 2kb radioshack derivation replaced integer representation numbers floating point representation added i/o support e.g cassette tape interface version known level basic fit 4kb rom grammar listed backus-naur form listing asterisk denotes zero object left — except first asterisk definition term multiplication operator parentheses group objects epsilon ε signifies empty set common computer language grammar notation vertical bar distinguishes alternatives listed separate lines symbol cr denotes carriage return usually generated keyboard enter key break console interrupt execution program implementations including first tiny basic tom pittman tiny basic virtual machine used others palo alto tiny basic 6800 tiny basic direct interpreters virtual machine implementation tiny basic interpreter run virtual machine interpreter designer idea use application virtual machine goes back val schorre meta ii 1964 glennie syntax machine following table gives partial list commands virtual machine first tiny basic interpreter written length whole interpreter program 120 virtual machine operations thus choice virtual machine approach economized memory space implementation effort although basic programs run thereon executed somewhat slowly | [
1255,
12,
2463,
6891,
6898,
4946,
4139,
5651,
8183,
2925,
7448,
5926,
5129,
7906,
5137,
5234,
2941,
3303,
3987,
1304,
61,
6394,
4003,
7864,
1789,
5877,
6778,
4012,
4745,
1064
] | Test |
5,368 | 7 | Epos_Now:epos epos cloud-based software provider specialising design manufacture electronic point sale commonly referred epos encompasses features including limited reporting stock control crm retail hospitality businesses epos software operated device platform web-browser using epos ios android app epos uk headquarters located norwich england us headquarters orlando florida founded june 2011 company pioneer cloud-technology epos industry notable first epos company introduce appstore customers allows users customise system epos appstore introduced december 2014 epos innovation recognised 2016 company queen award enterprise uk highest accolade business success epos uk 13th fastest growing private technology company fastest growing epos company uk epos founded jacyn heavens 2011 external investment ceo founder jacyn heavens identified gap market affordable epos system whilst managing bar searching epos system would suitable business started building software would suit business owners like epos appstore officially launched september 2015 making first appstore released within epos industry 30,000 businesses using epos 2015 epos awarded 'epos innovation year retail systems shortlisted edp business awards tech cities 2015 2016 epos shortlisted uk cloud awards innovative smb product year category engagement loyalty awards innovative technology category epos also finalist 2016 grocer gold awards technology supplier year category 21 april 2016 announced epos queen award enterprise innovation category epos named gold stevie award winners international business awards innovative company year 2016 epos three eastern daily press business awards 2016 categories employer year tech innovator year business year sponsored barclays company made tech track 100 three years running named 13th 32nd 53rd fastest growing tech company uk named 30th fastest growing company 2016 deloitte fast 50 growth 597 epos named 179th fastest growing tech company deloitte 2016 fast 500 emea epos named europes 46th fastest growing company financial times 1000 listing epos recognised commitment professional development employees winning princess royal training award 2017 epos noted 'best saas product small business/smbs 2017 saas awards | [] | Test |
5,369 | 8 | WEBrick:webrick webrick ruby library providing simple http web servers webrick primarily written masayoshi takahashi yuuzou gotou contributions developers via open-source model software development uses basic access authentication digest access authentication different kinds servers create http based server https server proxy server virtual-host server construction several non-http servers day time server uses daytime protocol rather http also facilitated webrick used ruby rails padrino frameworks test applications development environment well production mode small loads part ruby standard library webrick originated idea article named internet programming ruby open design japanese engineering magazine initially developed toolkit development http servers using ruby due nature open source model contributions several ruby developers across world webrick greatly augmented eventually bundled standard library ruby 1.8.0 webrick erb handler webrick proxy server first introduced ruby 1.9.3 webrick virtual host included ruby 2.0.0 webrick server understands language servlets uses multiple independent servlets joined together programmer handling cgi scripts erb pages ruby blocks directory listings provide web application service request uri per-host per-path basis example httpservlet :filehandler httpservlet :prochandler httpservlet :cgihandler httpservlet :erbhandler examples standard servlets webrick comes webrick included ruby hence available user additional cost webrick written completely ruby supports several standards http html even rhtml development stage necessity installation discrete web server since webrick already built rails framework default web server ruby application deployed without procfile rails furthermore since implemented entirely ruby direct calls made webrick rails application whole provides reliable low configuration option testing development following commands used start http server required port require 'webrick' root file.expand_path '/var/myapp/' server webrick :httpserver.new port 1234 documentroot root server.mount_proc '/ |request response| end trap 'int server.shutdown server.start servlets mounted provide advanced custom behavior compared proc increase modularity webrick creates listening port various ports ‘ virtual hosts ’ also created time listen shown vhost webrick :httpserver.new servername 'vhost.example vhost.mount '/ ... server.virtual_host vhost nowiki /nowiki documentroot provided instance servlet set service request uri otherwise 404 error returned enabling ssl providing ssl certificate name https server initiated self-signed certificate changes every restart server require 'webrick' require 'webrick/https' cert_name w cn localhost server webrick :httpserver.new port 1234 however pre-determined key certificate also provided instantiating https server shown require 'openssl' cert openssl :x509 :certificate.new file.read '/var/myapp/cert.pem' pkey openssl :pkey :rsa.new file.read '/var/myapp/pkey.pem' server webrick :httpserver.new port 1234 webrick also proxy get head post requests require 'webrick/httpproxy' proxy webrick :httpproxyserver.new port 1234 trap 'int proxy.shutdown end unlike servers used production webrick scalable since single threaded web server default hence multiple requests time handled subsequent requests would wait till previous requests handled incurring large delay hence developers prefer multi-threaded full-fledged web servers like lighttpd mongrel deploying rails applications | [
3168,
1532,
1349,
5206,
6428,
5820,
5214,
2646,
6270,
8182,
2291,
6536,
26,
5571,
7544,
7988,
397,
3021,
4151,
4701,
1287,
3879,
1392,
3889,
7786,
417,
2506,
7671,
952,
1686,
3408,
609,
8137,
3915,
6061,
1989,
3338,
7411,
7952,
2807
] | Test |
5,370 | 2 | Gutenprint:gutenprint gutenprint formerly gimp-print collection free-software printer drivers use unix spooling systems cups lpr lprng drivers provide printing services unix-like systems including linux macos risc os haiku originally developed plug-in gimp later became general tool use programs operating systems macos windows apple introduced mac os x omitted printer drivers claiming printer manufacturer task produce many update drivers since apple chosen use cups core printing system gimp-print filled void gutenprint 1,300 drivers apollo apple brother canon citizen compaq dai nippon dec epson fujifilm fujitsu gestetner hp ibm infotec kodak kyocera lanier lexmark minolta nec nrg oki olivetti olympus panasonic pcpi raven ricoh samsung savin seiko sharp shinko sony star tally tektronix xerox printers many users incorrectly called gimp software renamed gutenprint clearly distinguish gimp name gutenprint recognizes johannes gutenberg inventor movable type printing press epson backend active development new printers bug fixes capability additions contributed new release backend active development new printers bug fixes capability additions contributed new release canon printers use intelligent printheads control quality final output given metadata sent printer driver consequence design print quality specified resolution alone via resolution mode quality setting 5 quality settings available time resolution parameter driver-output data meta-resolution typically either 300 600 dpi sometimes 1200 dpi certain monochrome high-quality photo modes limited number printers firmware controls printhead creates physical ink output marketed resolution available quality selections depends number parameters applicable media printed duplex simplex borderless bordered color monochrome printing inkset selection cartridge selection thus number available resolution modes per media available depending parameters set printjob since gutenprint options always available via ppd driver attempts select reasonable defaults cases user settings contradiction prioritization follows media type resolution mode cartridge selection inkset selection duplex selection parameter clash detected driver resolution mode parameters set according priority substitution resolution mode carried try maintain required quality initially requested borderless selection added version 5.2.9 currently part prioritization replacement algorithm small number printers analyzed discover appropriate modes media borderless printing pcl color laser lexmark backends currently unmaintained volunteers welcome fairly often printers would use backends emulation capability languages particular postscript case printer configured use standard postscript driver | [
2815,
5826,
5571,
7663,
578,
1435
] | Test |
5,371 | 3 | Manycore_processor:manycore processor manycore processors specialist multi-core processors designed high degree parallel processing containing large number simpler independent processor cores tens cores thousands manycore processors used extensively embedded computers high-performance computing manycore processors distinct multi-core processors optimized outset higher degree explicit parallelism higher throughput lower power consumption expense latency lower single thread performance broader category multi-core processors contrast usually designed efficiently run parallel serial code therefore place emphasis high single thread performance e.g devoting silicon order execution deeper pipelines superscalar execution units larger general caches shared memory techniques devote runtime resources toward figuring implicit parallelism single thread used systems evolved continuously backward compatibility single core processors usually 'few cores e.g 2,4,8 may complemented manycore accelerator gpu heterogeneous system cache coherency issue limiting scaling multicore processors manycore processors may bypass tricks message passing scratchpad memory dma partitioned global address space read-only/non-coherent caches manycore processor using network chip local memories gives software opportunity explicitly optimise spatial layout tasks e.g seen tooling developed truenorth manycore processors may common conceptually technologies originating high performance computing clusters vector processors gpus may considered form manycore processor multiple shader processing units suitable highly parallel code high throughput extremely poor single thread performance number computers built multicore processors one million individual cpu cores examples include | [
5012,
1447,
3948,
7527,
7529,
5737,
4318,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
2957,
2961,
2248,
3667,
2969,
6148,
2614,
441,
4742,
5447,
6865,
2266,
4047,
1546,
4049,
5483,
3014,
1556,
5487,
6198,
1568,
1570,
6922,
3041,
7666,
1586,... | Test |
5,372 | 2 | Android_Auto:android auto android auto mobile app developed google mirror features android device smartphone car compatible in-dash information entertainment head unit android device paired head unit system mirrors qualified apps device vehicle display simple driver-friendly user interface supported apps include gps mapping/navigation music playback sms telephone web search system supports touchscreen button-controlled head unit displays although hands-free operation voice commands encouraged minimize driving distraction android auto part open automotive alliance announced june 25 2014 joint effort 28 automobile manufacturers nvidia tech supplier available 36 countries common way android auto deployed via android mobile device running android auto app acting master vehicle dashboard head unit supports functionality user android device connected vehicle head unit serve external display android device presenting supported software car-specific user interface provided android auto app android auto first iterations device required connected via usb car alternatively november 2016 google added option run android auto regular app android device i.e. tethered car head unit allows used android-powered head units simply personal phone tablet vehicle addition january 1 2018 announced jvckenwood would exhibiting wireless android auto-enabled head units ces 2018 would capable operating without need wired connection may 2019 android auto available 36 countries availability apps system varies android auto sdk released allowing third parties modify apps work android auto initially apis music messaging apps would available expected android auto mobile device access several automobile sensors inputs gps high-quality gps antennas steering-wheel mounted buttons sound system directional speakers directional microphones wheel speed compass mobile antennas etc also partial access car data feature still development ces 2018 google confirmed google assistant would coming android auto later year currently supported apps include google maps waze popular music players google play music youtube music amazon music apple music spotify messaging apps including whatsapp facebook messenger google hangouts skype telegram may 2015 hyundai became first manufacturer offer android auto support making available first 2015 hyundai sonata automobile manufacturers offer android auto support cars include abarth acura alfa romeo audi bentley buick cadillac chevrolet chrysler dodge fiat ford gmc genesis holden honda hyundai infiniti jaguar land rover jeep kia lamborghini lexus lincoln mahindra mahindra maserati mazda mercedes-benz mitsubishi nissan opel peugeot ram renault seat škoda ssangyong subaru suzuki tata motors cars toyota volkswagen volvo additionally aftermarket car-audio systems supporting android auto add technology host vehicles including pioneer kenwood panasonic sony may 2019 italy filed antitrust complaint targeting android auto citing google policy allowing third-party media messaging apps platform prevented enel offering app locating vehicle charging stations | [
2902,
3933,
6427,
1095,
2569,
740,
4340,
42,
4343,
3309,
3310,
7924,
2591,
5771,
5775,
6153,
7956,
5455,
4762,
7967,
6176,
5473,
474,
5476,
6183,
822,
831,
5141,
136,
2317,
2673,
6209,
7285,
2683,
855,
6937,
168,
6232,
6950,
5534,
2712,... | Test |
5,373 | 2 | OpenBSD_version_history:openbsd version history following table summarizes version history openbsd operating system | [
4655,
6329,
1155,
6414,
2001,
2453,
5634,
191,
2549,
1824,
2291,
5571,
6630,
8194,
578,
3635,
6367,
4515,
6369,
1572,
588,
1394,
3557,
7752,
3219,
3134,
3572,
617,
4990,
1133,
7214,
2433,
2883,
7765,
1236,
6149,
1245,
6242
] | Test |
5,374 | 3 | Torch_Triple_X:torch triple x torch triple x xxx unix workstation computer produced british company torch computers launched 1985 based motorola 68010 microprocessor ran version unix system v. triple x based 8 mhz 68010 cpu hitachi 6303 service processor cpu accompanied 68451 memory management unit 68450 dma controller vmebus bbc micro-compatible 1mhz bus expansion buses provided scsi host adapter optional ethernet interface rs-423 x.25-compatible synchronous serial ports provided latter feature made triple x attractive uk academic community x.25 networks prevalent time standard ram capacity 1 mb expandable 7 mb via vme cards 720 kb 5.25 floppy disk drive st-506-compatible 20 mb hard disk fitted standard interfaced scsi bus via omti adapter either 10 13 inch colour monitor supplied two graphics modes available 720 × 256 pixels four colours 720 × 512 two colours triple x novel touch-sensitive soft power switch switching commanded operating system shut gracefully powering triple x firmware called caretaker native operating system uniplus+ unix system v release 2 graphical user interface called opentop also included standard quad x enhanced version triple x 68020 processor three vme expansion slots produced small numbers torch became insolvent | [
4321,
5571,
1237,
2118,
2379,
1454
] | Test |
5,375 | 8 | Click_path:click path click path clickstream sequence hyperlinks one website visitors follows given site presented order viewed visitor click path may start within website separate 3rd party website often search engine results page continues sequence successive webpages visited user click paths take call data match ad sources keywords and/or referring domains order capture data clickstream analysis useful web activity analysis software testing market research analyzing employee productivity navigating world wide web user agent web browser makes requests another computer known web server every time user selects hyperlink web servers store information sequence links user clicks visiting websites host log files site operator ’ benefit information interest vary may include information downloaded webpage visited previously webpage visited afterwards duration time spent page etc information useful client/user identified done website registration record matching client ’ internet service provider isp storage also occur router proxy server ad server data mining column-oriented dbms integrated olap systems used conjunction clickstreams better record analyze data use clickstream data raise privacy concerns especially since internet service providers resorted selling users clickstream data way enhance revenue 10-12 companies purchase data typically 0.40/month per user practice may directly identify individual users often possible indirectly identify specific users example aol search data scandal consumers unaware practice potential compromising privacy addition isps publicly admit practice world online shopping grows becoming easier privacy individuals become exploited many cases email addresses phone numbers personal information stolen illegally shoppers clients many used third parties third parties range advertisers hackers consumers actually benefit gaining targeted advertising deals harmed lack privacy world technology grows consumers risk losing privacy clickstreams used allow user see allow easily return page already visited function already incorporated browsers clickstream display specific time position individuals browsed closed website web pages viewed duration spent page also show pages viewed frequently abundant information analyzed individuals check visitors clickstream association statistical information visiting length retrieval words isp countries explorers etc process enables individuals know visitors deeply webmasters gain insight visitors site using clickstream data neutral sense dataset neutral data used various scenarios one marketing additionally webmaster researcher blogger person website learn improve site growing e-commerce industry made necessary tailor needs preferences consumers click path data used personalize product offerings using previous click path data websites predict products user likely purchase click path data contain information user ’ goals interests knowledge therefore used predict future actions decisions using statistical models websites potentially increase operating profits streamlining results based user likely purchase analyzing data clients visit company website important order remain competitive analysis used generate two findings company first analysis user ’ clickstream using website reveal usage patterns turn gives heightened understanding customer behaviour use analysis creates user profile aids understanding types people visit company ’ website discussed van den poel buckinx 2005 clickstream analysis used predict whether customer likely purchase e-commerce website clickstream analysis also used improve customer satisfaction website company generate business advantage used assess effectiveness advertising web page site researchers stand behind click path analysis note path analytical method estimates system equations specify possible causal linkages among set variables click paths enable researchers break correlations among variables direct indirect spurious components finally click path analysis helps researchers disentangle complex interrelationships among variables identify significant pathways involved predicting outcome even advantages technique still critiqued many due large margin error model must assume variable exact manifestation theoretical concepts underlying reasonably free measurable error another casualty hypothesized model path must flow one direction feedback loops bidirectional causality otherwise model solved ordinary least squares regression techniques lastly models based correlations path analysis demonstrate causality direction causal effects ” due limitations many believe click path analysis tends waste time money resources websites store data visitors site click path information typically used improve website deliver personalized relevant content addition data results used designer review improve redesign website also used model user browsing behaviour online world e-commerce information collected click path allows advertisers construct personal profiles use individually target consumers much effectively ever result advertisers create relevant advertising efficiently spend advertising dollars meanwhile wrong hands click path data poses serious threat personal privacy unauthorized clickstream data collection considered spyware however authorized clickstream data collection comes organizations use opt-in panels generate market research using panelists agree share clickstream data companies downloading installing specialized clickstream collection agents number paths user potentially take greatly increases depending number pages particular website many tools determine path analysis linear account complexity internet usage cases less 5 users follow common path however even users used path still way tell page influential determining behavior even linear forms path analysis see customers drop website “ ” factor still missed main challenge path analysis lies fact tries regulate force users follow certain path reality users diverse specific preference opinions | [
1411,
2086,
5419,
3486,
4600,
3338,
84
] | Test |
5,376 | 1 | African_Origins:african origins african origins project database run researchers emory university aims document known facts african diaspora including documentary material pertaining transatlantic slave trade sister project | [] | Validation |
5,377 | 3 | Slot_A:slot slot physical electrical specification 242-lead single-edge-connector used early versions amd athlon processor slot connector allows higher bus rate socket 7 super socket 7 slot motherboards use ev6 bus protocol technology originally developed digital equipment corporation dec alpha 21264 microprocessor slot mechanically compatible electrically incompatible intel slot 1 consequence slot motherboards designed connector installed orientation rotated 180 degrees relative slot 1 motherboards discourage accidental insertion slot 1 processor slot motherboard vice versa choice use mechanical connector intel slot 1 also allowed motherboard manufacturers keep costs stocking part slot 1 slot assemblies slot superseded socket | [
2539,
6599,
2541,
5895,
4931,
7163,
3002,
3362,
1735,
5379,
6351,
913,
7826,
2751,
6545,
5404,
6373,
5063,
6655,
6562,
2685,
3145,
4090,
866,
694,
5436,
1143
] | Test |
5,378 | 2 | Internet_Explorer_8:internet explorer 8 windows internet explorer 8 ie8 eighth version internet explorer web browser microsoft released march 19 2009 successor internet explorer 7 released 2006 default browser windows 7 windows server 2008 r2 operating systems internet explorer 8 first version ie pass acid2 test last major browsers later acid3 test scores 24/100. according microsoft security ease use improvements rss css ajax support priorities ie8 internet explorer 8 last version internet explorer run windows server 2003 windows xp following version internet explorer 9 works windows vista later support internet explorer 8 bound lifecycle windows version installed considered os component thus unsupported windows xp due end extended support latter april 2014 effective january 12 2016 internet explorer 8 longer supported client server version windows due new policies specifying newest version ie available supported version windows supported however several windows embedded versions remain supported respective eol unless otherwise specified ie8 development started march 2006 february 2008 microsoft sent private invitations ie8 beta 1 march 5 2008 released beta 1 general public although focus web developers release launched windows internet explorer 8 readiness toolkit website promoting ie8 white papers related software tools new features addition download links beta microsoft developer network msdn added new sections detailing new ie8 technology major press focused controversy version targeting two new features called webslice activities readiness toolkit promoted something developers exploit make internet explorer 8 'light august 27 2008 microsoft made ie8 beta 2 generally available pc world noted various beta 2 features inprivate mode tab isolation color-coding improved standards compatibility compared internet explorer 7 two name changes included activities accelerators ie7 phishing filter renamed safety filter first beta smartscreen accompanied incremental technical changes well august 2008 new feature called inprivate taken spotlight first non-beta version released march 19 2009 january 5 2009 tool provided microsoft block automatic install internet explorer 8 via windows update may 20 2009 windows xpe embedded supported platform internet explorer 8 announcements planned support may 27 2010 microsoft released internet explorer 8 optimized bing msn file name boie8_enus_xp.exe support versions ie windows xp ended effective april 8 2014 due end-of-life january 12 2016 support ie8 supported windows operating systems ceased due new support policies dictating newest version ie available supported version windows supported internet explorer 11 supported except windows vista windows server 2008 internet explorer 9 supported windows server 2012 internet explorer 10 supported language support localization complete release ie8 released 25 languages grew 63 vista 32-bit june 2009 support additional languages come pre-installed based os downloaded installed via multilingual user interface mui packages ie8 contains many new features including webslices accelerators accelerators form selection-based search allow user invoke online service page using mouse actions selecting text objects give users access usable accelerator services blogging selected text viewing map selected geographical location invoked selected object according microsoft accelerators eliminate need copy paste content web pages ie8 specifies xml-based encoding allows web application web service invoked accelerator service service invoked categories content show specified xml file similarities drawn accelerators controversial smart tags feature experimented ie 6 beta withdrawn criticism though later included ms office address bar features domain highlighting added security top-level domain shown black whereas parts url grayed domain highlighting turned users web sites features address bar include support pasting multi-line urls improved model inserting selection caret selecting words entire urls address bar inline autocomplete feature dropped internet explorer 8 leading criticism beta users website add-on causes tab crash internet explorer 8 tab affected browser remains stable tabs remain unaffected thereby minimizing disruption browsing experience tab unexpectedly closes crashes automatically reloaded content crash developers internet explorer 8 includes tools allow debugging html css javascript vbscript within browser another new feature ie8 redesigned favorites bar host content web slices web feeds documents addition website links internet explorer 8 replaced find ... dialog box inline find toolbar activated pressing ctrl+f search box drop-down menu f3 kind keyboard-driven nextfind command gone internet explorer 8 highlights instances found words allowing user continue navigation normally new security mode called inprivate debuted ie8 consists two main features inprivate browsing inprivate filtering inprivate browsing described porn mode various news outlets similar feature first introduced safari 2005 later implemented firefox 3.5 opera 10.5 google chrome informationweek mentioned stealth privacy mode inprivate browsing internet explorer 8 helps prevent one browsing history temporary internet files form data cookies usernames passwords retained browser leaving easily accessible evidence browsing search history inprivate filtering provides users added level control choice information third party websites use track browsing activity inprivate subscriptions allow augment capability inprivate blocking subscribing lists websites block allow private browsing modes ways information browsing session recovered internet explorer 8 includes performance improvements across html parser css engine mark-up tree manipulation well jscript runtime associated garbage collector memory leaks due inconsistent handling circular references jscript objects dom objects corrected better security stability ie8 uses loosely coupled internet explorer lcie architecture runs browser frame tabs separate processes lcie prevents glitches hangs bringing entire browser leads higher performance scalability permissions activex controls made flexible instead enabling disabling globally allowed per-site basis smartscreen filter extended internet explorer 7 phishing filter include protection socially engineered malware every website download checked local list popular legitimate websites site listed entire address sent microsoft checks labeled impostor harmful internet explorer 8 show screen prompting site reported harmful n't visited user either visit homepage visit previous site continue unsafe page user attempts download file location reported harmful download cancelled effectiveness smartscreen filtering reported superior socially engineered malware protection browsers feature disabled enforced using group policy feature described microsoft tool suggest websites done browser sending information microsoft secure connection keeps information per-session uniquely generated identifier short time suggested sites feature turned default disabled user browsing inprivate enabled visiting ssl-secured intranet ip address idn address sites information could personally identifiable user ip address browser information sent microsoft artifact https protocol microsoft stated store information functionality defended microsoft itworld.com gregg keizer described phone home feature web slices snippets entire page user subscribe web slices kept updated browser automatically viewed directly favorites bar complete graphics visuals developers mark parts pages web slices using codice_1 codice_2 microformat web slices compared active desktop introduced internet explorer 4 1997 microsoft donated specification public domain creative commons public domain dedication also covered microsoft open specification promise windows rss platform also supports authenticated feeds beginning internet explorer 8 full-page zoom reflows text remove appearance horizontal scrollbars zooming image scaling done using bicubic interpolation resulting smoother looking images scaled using compatibility mode cause style issues select form elements changing zoom levels information bar lets users allow activex control run web sites current one users easily make changes behavior manage add-ons dialog box activex control list sites approved user internet explorer 8 main rendering mode known standards mode improved support various web standards especially css compared internet explorer 7 earlier versions web standards supported ie8 include following however ie8 support w3c standards ie8 passes acid2 test fails acid3 test score 20/100 development microsoft developed 7,000 tests css level 2 compliance submitted w3c inclusion test suite internet explorer 8 promoted microsoft stricter adherence w3c described web standards internet explorer 7 result every ie version percentage web pages coded behavior older versions would break ie8 would repetition situation ie7 fixed bugs ie6 broke pages used ie6-specific hacks work around non-compliance especially problem offline html documents may updatable e.g stored read-only medium cd-rom dvd-rom avoid situation ie8 implements form version targeting whereby page could authored specific version browser using codice_8 declaration either meta element http headers order maintain backwards compatibility sites opt-into ie7-like handling content inserting specially created meta element web page triggers compatibility mode browser using five weeks release ie 8 beta 2 august 2008 beta 1 market share grown 0.05 percent 0.61 percent according net applications july 2009 four months final release market share jumped 13 percent estimates ie8 global market share ranged 6.93 8.73 according net applications web analytics october 2014 internet explorer 8 accounts 17.31 web traffic overtaken ie11 usage march 19 2009 review benny har-even pro offered praise internet explorer 8 noting reliability good features concluding certainly best version internet explorer long time also yet anything make firefox users want jump ship offered praise microsoft paying attention competition producing better featured faster reliable browsing experience masses suggested microsoft continues improve product would become harder persuade unconverted switch away ie next month april 2 mark joseph edwards wrote newsletter windows secrets new edition internet explorer greatly improved security speed compatibility opined still lagged behind competitors three areas edwards noted time internet explorer 8 still underperforming relative browsers speed successful displaying webpages intended display browsers firefox opera terms security wrote continued reliance activex makes browser vulnerable foundation reasons suggested firefox remained better alternative internet explorer 8 even though much better browser ie 7 ie8 requires least | [
4655,
6802,
7537,
6809,
7176,
393,
3291,
2574,
6452,
7564,
4352,
422,
1496,
4725,
6135,
6136,
1136,
6495,
84,
445,
1152,
4026,
93,
458,
4759,
7628,
5821,
113,
5127,
2657,
3383,
8006,
3043,
1970,
6221,
520,
3057,
3060,
3412,
5887,
1616,
... | Validation |
5,379 | 3 | Slot_2:slot 2 slot 2 refers physical electrical specification 330-lead single edge contact cartridge edge-connector used intel pentium ii xeon certain models pentium iii xeon first introduced slot 1 pentium iis intended replace pentium pentium pro processors home desktop low-end symmetric multiprocessing smp markets pentium ii xeon aimed multiprocessor workstations servers largely similar later pentium iiis based p6 deschutes core aside wider choice l2 cache ranging 512 2048 kb full-speed off-die l2 cache pentium 2 used cheaper third-party sram chips running 50 cpu speed reduce cost design 242-lead slot 1 connector support full-speed l2 cache xeon extended 330-lead connector developed new connector dubbed 'slot 2 used pentium ii xeon first two pentium iii xeon cores codenamed 'tanner 'cascades slot 2 finally replaced socket 370 pentium iii tualatin tualatin pentium iiis packaged 'pentium iii 'xeon though identical | [
2541,
4123,
3849,
1729,
2828,
6173,
7974,
2830,
3002,
4314,
5377,
3193,
1841,
1645,
3203,
4968,
3385,
4972,
5853,
2685,
6935,
8021,
7302,
5963,
866,
3333,
7134,
262,
2351,
6683,
5886
] | Validation |
5,380 | 4 | Core_International:core international core international inc. commonly known core multinational computer technology corporation headquartered boca raton florida united states company part sony longer exists stand-alone identity company founded 1979 hal prewitt technology firm develop market support computer related products services best known supporting ibm first business microcomputers 5100 5110 5120 introduction ibm pc pc company provided extensive line disk drives backup personal computer products core became well known leading industry developer disk array computer data storage many core products first kind direct competition widely regarded superior performance reliability users computer press raved core products infoworld described core atplus built like sherman tank offering exceptional performance reliability pc magazine called workhorses performance computing high-quality construction..breaks speed barrier access times asked manufactures follow suit core known advertising perhaps produced pc industry greatest promotions 1985 1986 rebate recall ad ibm pc hard disk drives successful controversial rumor topic ibm board directors meeting time gave away free ibm pc purchasing one core atplus 72 mb drives core remained private company solely owned prewitt 1993 purchased aiwa wholly owned subsidiary sony business history pre-incorporation company built early work prewitt using business personal computer development experiences period creation first microcomputers launch altair 8800 founding microsoft selling programming minicomputers assembling microcomputers attaching computer peripherals programming building business computer systems core created different business model initially marketed association structured for-profit organization specifically users ibm 5100 series ibm system/23 objective sell mail-order computer supplies pre-developed off-the-shelf programs hardware maintenance service supplies included printer ribbons paper diskettes tape cartridges software ranged simple mortgage interest calculations word processing games utilities advanced payroll accounting industry specific applications users wanted readily available simple install support software also low cost core able fill niche ibm developed machines engineering scientific applications mind business programs construction agriculture manufacturing generally available computer maintenance insurance program provided on-site repairs replacement parts provided ibm service lower cost available directly ibm company successful attracting users ibm 5100 series many ibm sales representatives referred customers organization core grew profits used continuing development computer data storage ibm machines closed architecture design information unpublished held secret computer systems design extremely likely impossible ability swap components obtain support vendors upgrade better configuration/another model unless option available original manufacturer limitations make customer dependent one vendor products services software hardware parts system core sensed opportunity provide greater faster computer data storage five-year effort september 1982 announced availability first hard disk drives local area network lan ibm 5100 series ibm systems sold storage limited without network option 5100 tape 5110 5120 restricted 1.2 mb floppy disks core drives available starting 10 mb increased 160 mb removable fixed configurations corenet lan built core storage system allowed interconnection eight ibm 5100 series systems providing ability share storage data configuration pre-dated lans period ibm pc compatibles 1983 core introduced two major solutions ibm withdrawing marketing ibm 5100 series first software called pc51 would run allowed 5100 series computer programs written basic run unmodified ibm pc compatibles ms-dos second lan card ibm pc compatibles provided connection ibm 5100 series network solutions allowed ibm 5110/5120 series users add new technology increase productivity retaining investment equipment software core development storage systems lan pc51 software major technology engineering feat without rivals due complexity successful reverse engineering systems resulted captive market organization able provide upgrade path ibm owners 1984 core expanded product focus entered personal computer pc marketplace company first product introduced year called pc-51 completely new operating system language ibm pc compatibles enabled pc function like ibm 5110/5120 system demonstrating company strong software development capabilities allow users continue using application software already developed increased processing speed factor two ten times reduced maintenance cost 90 new product opened unexplored marketplace core allowing company become ibm value-added dealer vad sell ibm pc core products individually combined package ibm authorized promoted relationship provided upgrade path customers previously unavailable result early development effort ibm 5100 series core released family high-performance hard disk drives called atplus series better capacity reliability performance ibm drives weeks introduction new ibm august 1984 core discovered problems factory-issued hard disk drive media marketplace learned ibm disk problems core unique position capitalize opportunity without significant competition six months ibm model cmi short supply delays attributed lack drives technical problems machine undisclosed issues core desired major partner selected control data corporation cdc assist introduction drives pc marketplace announcement made february 1985 generated significant amount press coverage core discovered general lack understanding existed among news media users regarding technology different computer mass storage systems understood value different systems end-user rate many choices marketplace response core began placing considerable emphasis user education resulted major contribution computer industry directly efforts news media computer magazines product reviewers dealers computer manufactures started discussing providing promoting seek time access time transfer time value understand hard disk drives importance computer system company believed end-users learned computers engineering behind core products less users wanted product purchasers ibm reporting dealers installing inferior drives computer without disclosing fact help buyers industry education core developed diskp program later replaced coretest dos based identify sub-standard products providing visual demonstration speed comparative measurements hard disk drives controllers many computer publications hardware manufacturers distributors dealers independent evaluation firms relied coretest product comparison made coretest industry standard often quoted benchmark programs provide without charge freely available bbs computer magazines dealers believed installed base million copies worldwide promoting core technology education two years newspapers magazines computer publications ran stories ibm computer memories inc. cmi hard disk drives problems | [
6289,
2390,
1254,
6380,
4277,
4199,
7093
] | Validation |
5,381 | 4 | Shellcode:shellcode hacking shellcode small piece code used payload exploitation software vulnerability called shellcode typically starts command shell attacker control compromised machine piece code performs similar task called shellcode function payload limited merely spawning shell suggested name shellcode insufficient however attempts replacing term gained wide acceptance shellcode commonly written machine code shellcode either local remote depending whether gives attacker control machine runs local another machine network remote local shellcode used attacker limited access machine exploit vulnerability example buffer overflow higher-privileged process machine successfully executed shellcode provide attacker access machine higher privileges targeted process remote shellcode used attacker wants target vulnerable process running another machine local network intranet remote network successfully executed shellcode provide attacker access target machine across network remote shellcodes normally use standard tcp/ip socket connections allow attacker access shell target machine shellcode categorized based connection set shellcode establishes connection called reverse shell connect-back shellcode shellcode connects back attacker machine hand attacker establishes connection shellcode called bindshell shellcode binds certain port victim machine third much less common type socket-reuse shellcode type shellcode sometimes used exploit establishes connection vulnerable process closed shellcode run shellcode re-use connection communicate attacker socket re-using shellcode elaborate since shellcode needs find connection re-use machine may many connections open firewall used detect outgoing connections made connect-back shellcode well incoming connections made bindshells therefore offer protection attacker even system vulnerable preventing attacker connecting shell created shellcode one reason socket re-using shellcode sometimes used create new connections therefore harder detect block download execute type remote shellcode downloads executes form malware target system type shellcode spawn shell rather instructs machine download certain executable file network save disk execute nowadays commonly used drive-by download attacks victim visits malicious webpage turn attempts run download execute shellcode order install software victim machine variation type shellcode downloads loads library advantages technique code smaller require shellcode spawn new process target system shellcode need code clean targeted process done library loaded process amount data attacker inject target process limited execute useful shellcode directly may possible execute stages first small piece shellcode stage 1 executed code downloads larger piece shellcode stage 2 process memory executes another form staged shellcode used attacker inject larger shellcode process determine process end small egg-hunt shellcode injected process predictable location executed code searches process address space larger shellcode egg executes type shellcode similar egg-hunt shellcode looks multiple small blocks data eggs recombines one larger block omelette subsequently executed used attacker inject number small blocks data process exploit commonly inject shellcode target process time exploits vulnerability gain control program counter program counter adjusted point shellcode gets executed performs task injecting shellcode often done storing shellcode data sent network vulnerable process supplying file read vulnerable process command line environment case local exploits processes filter restrict data injected shellcode often needs written allow restrictions includes making code small null-free alphanumeric various solutions found get around restrictions including since intrusion detection detect signatures simple shellcodes sent network often encoded made self-decrypting polymorphic avoid detection exploits target browsers commonly encode shellcode javascript string using percent-encoding escape sequence encoding \uxxxx entity encoding exploits also obfuscate encoded shellcode string prevent detection ids example ia-32 architecture two codice_1 no-operation instructions would look first unencoded encoded string using percent-encoding using codice_2 function decode next encoded string using \uxxxx -encoding finally encoded string using entity encoding shellcodes written without use null bytes intended injected target process null-terminated strings null-terminated string copied copied including first null subsequent bytes shellcode processed shellcode contains nulls injected way part shellcode would injected making incapable running successfully produce null-free shellcode shellcode contains null bytes one substitute machine instructions contain zeroes instructions effect free nulls example ia-32 architecture one could replace instruction contains zeroes part literal 1 expands 0x00000001 instructions effect take fewer bytes encode free nulls certain circumstances target process filter byte injected shellcode printable alphanumeric character circumstances range instructions used write shellcode becomes limited solution problem published rix phrack 57 showed possible turn code alphanumeric code technique often used create self-modifying code allows code modify bytes include bytes outside normally allowed range thereby expanding range instructions use using trick self-modifying decoder created initially uses bytes allowed range main code shellcode encoded also using bytes allowed range output shellcode run decoder modify code able use instruction requires function properly continues decode original shellcode decoding shellcode decoder transfers control executed normal shown possible create arbitrarily complex shellcode looks like normal text english modern programs use unicode strings allow internationalization text often programs convert incoming ascii strings unicode processing unicode strings encoded utf-16 use two bytes encode character four bytes special characters ascii string transformed utf-16 zero byte inserted byte original string obscou proved phrack 61 possible write shellcode run successfully transformation programs automatically encode shellcode alphanumeric utf-16-proof shellcode exist based principle small self-modifying decoder decodes original shellcode shellcode written machine code low level vulnerability exploited gives attacker access process shellcode therefore often created target one specific combination processor operating system service pack called platform exploits due constraints put shellcode target process specific shellcode must created however impossible one shellcode work multiple exploits service packs operating systems even processors versatility commonly achieved creating multiple versions shellcode target various platforms creating header branches correct version platform code running executed code behaves differently different platforms executes right part shellcode platform running shellcode executed directly order analyze shellcode attempts must loaded another process one common analysis technique write small c program holds shellcode byte buffer use function pointer use inline assembler transfer execution another technique use online tool shellcode_2_exe embed shellcode pre-made executable husk analyzed standard debugger specialized shellcode analysis tools also exist idefense sclog project originally released 2005 part malcode analyst pack sclog designed load external shellcode files execute within api logging framework emulation based shellcode analysis tools also exist sctest application part cross platform libemu package another emulation based shellcode analysis tool built around libemu library scdbg includes basic debug shell integrated reporting features | [
449,
5627,
3932,
8064,
3855,
5116,
7533,
5482,
5485,
5571,
3635,
5051,
1019,
3220,
1495,
3486,
4729,
524,
5697,
1237,
352,
1989,
2621,
5190,
1805
] | Validation |
5,382 | 4 | Cobian_Backup:cobian backup cobian backup free donation-supported backup software microsoft windows written delphi luis cobian umeå university cobian backup originally released 2000 program later rewritten released version 7 next version version 8 released 2006 source code later released mozilla public license late january 2007 however version 9 author cobian backup decided switch back completely closed source model older versions remain open source forever release program mozilla public license revoked development support original author discontinued version 11.2.0.582 source code since sold cobian backup supports unicode ftp compression zip sqx 7z encryption including blowfish rijndael des rsa-rijndael incremental differential backup example differential backup every night backs user files changed since last full backup full backup every seventh night backing full set user files backups saved cd dvd usb memory stick second hard drive internal external etc supports long file names 32,000 characters backup routines | [
6289,
4386,
1254,
3413,
2566,
4759,
5571
] | Train |
5,383 | 3 | Dynamite_Dan:dynamite dan dynamite dan platform game written rod bowkett zx spectrum published mirrorsoft 1985 ported amstrad cpc commodore 64 msx sequel dynamite dan 2 released following year gameplay similar jet set willy highly rated game time game starts dan lands airship top evil dr blitzen hideout aim game find eight sticks dynamite placed randomly around playing area whilst avoiding perils game moving monsters drowning falling great heights dan eight sticks dynamite player must make way central safe blow open steal plans evil doctor death ray escape airship playing area essentially one large building split multiple screens wrap around central elevator screen contains number moving monsters player moves destroyed take life return exception destroyed walked dr blitzen assistant donner donner blitzen located screen safe perils dan life include running energy caused collecting enough food falling heights hit laser beams dan also fall underground river flows beneath building player receive game unless dan picked oxygen case sent back start game completed game provides secret code deciphered telephone number call answer number longer works prize ride mirrorsoft blimp background music choosing game settings waiting game start third movement rondo alla turca wolfgang amadeus mozart piano sonata 11 major k. 331 readers crash magazine voted best platform game year zx spectrum version voted 24th best game time special issue sinclair magazine 2004 | [] | Validation |
5,384 | 6 | Apple_ISO_9660_Extensions:apple iso 9660 extensions apple set iso 9660 extensions extends filesystem hfs properties primary file system apple macintosh computers hfs hfs+ hfs file system properties fat file systems primarily used windows 95 98 operating systems metadata properties include order allow non-macintosh systems access macintosh files cd-roms apple chose use extension standard iso 9660 format data apple specific metadata remains visible operating systems able read iso 9660 | [
3554,
1254,
3672,
5128,
5571,
5656,
5660,
3903
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.