node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
8,186 | 3 | X32_ABI:x32 abi x32 abi application binary interface abi one interfaces linux kernel allows programs take advantage benefits x86-64 instruction set larger number cpu registers better floating-point performance faster position-independent code shared libraries function parameters passed via registers faster syscall instruction using 32-bit pointers thus avoiding overhead 64-bit pointers though x32 abi limits program virtual address space 4 gib also decreases memory footprint program making pointers smaller allow run faster fitting data cache best results testing 181.mcf spec cpu 2000 benchmark x32 abi version 40 faster x86-64 version average x32 5–8 faster spec cpu integer benchmarks compared x86-64 speed advantage x86-64 spec cpu floating-point benchmarks running userspace consists mostly programs compiled ilp32 mode also principal access 64-bit cpu instructions uncommon especially field classic risc chips example solaris operating system sparc x86-64 linux side sparc powerpc linux distributions aurora sparc linux debian also ship ilp32 userspace underlying reason somewhat expensive nature lp64 code like shown x86-64 regard x32 abi extends ilp32-on-64bit concept x86-64 platform several people discussed benefits x86-64 abi 32-bit pointers years since athlon 64 release 2003 notably donald knuth 2008 little publicly visible progress towards implementing mode august 27 2011 hans peter anvin announced linux kernel mailing list h. j. lu working x32-abi day linus torvalds replied concern use 32-bit time values x32 abi could cause problems future use 32-bit time values would cause time values overflow year 2038 following request developers x32 abi changed time values 64-bit presentation linux plumbers conference september 7 2011 covered x32 abi x32 abi merged linux kernel 3.4 release support added gnu c library version 2.16 december 2018 considered deprecate x32 abi happened march 2019 | [
4616,
3082,
5139,
10780,
10785,
6180,
8242,
9266,
4161,
8260,
6213,
8772,
8268,
589,
593,
6244,
5222,
10856,
5742,
4207,
5244,
4734,
11391,
7812,
7821,
4238,
10382,
2195,
2711,
6808,
9882,
1694,
2723,
8364,
10933,
5815,
9911,
5822,
5824,
... | None |
8,187 | 7 | GARUDA:garuda garuda global access resource using distributed architecture india grid computing initiative connecting 17 cities across country 45 participating institutes nationwide project include iits c-dac centers major institutes india garuda collaboration science researchers experimenters nationwide grid computational nodes mass storage scientific instruments aims provide technological advances required enable data compute intensive science 21st century one garuda ’ important challenges strike right balance research daunting task deploying innovation complex scientific engineering endeavors undertaken today department information technology dit government india funded centre development advanced computing c-dac deploy nationwide computational grid garuda proof concept poc phase ended march 2008 17 cities across country connected aim bring “ grid ” networked computing research labs industry april 2008 foundation phase progress aim include users ’ applications providing service oriented architecture improving network stability upgrading grid resources garuda assist accelerate india ’ drive turn substantial research investment tangible economic benefits main monitoring centre also called garuda monitoring management centre set c-dac knowledge park bangalore point whole grid extended even europe monitored managed c-dac young scientists india garuda uses national knowledge network network backbone garuda adopted pragmatic approach using existing grid infrastructure web services technologies deployment grid tools services garuda based judicious mix in-house developed components globus toolkit gt industry grade open source components foundation phase garuda based stable version gt4 resource management scheduling garuda based deployment industry grade schedulers hierarchical architecture cluster level scheduling achieved load leveler aix platforms torque linux clusters garuda portal provides user interface grid resources hides complexity grid users allows submission sequential parallel jobs also provides job accounting facilities problem solving environment pse domains bio-informatics community atmospheric model support entire cycle problem solving specific domains supporting problem formulation algorithm selection numerical simulation solution visualization | [
11353,
5956
] | Train |
8,188 | 1 | Embedded_SQL:embedded sql embedded sql method combining computing power programming language database manipulation capabilities sql embedded sql statements sql statements written inline program source code host language embedded sql statements parsed embedded sql preprocessor replaced host-language calls code library output preprocessor compiled host compiler allows programmers embed sql statements programs written number languages cobol fortran differs sql-derived programming languages n't go discrete preprocessors pl/sql t-sql sql standards committee defined embedded sql standard two steps formalism called module language defined embedded sql standard derived module language sql standard defines embedding sql embedded sql language sql queries embedded referred host language popular host language c. host language c embedded sql example called pro*c oracle sybase database management systems ecpg postgresql database management system sql may also embedded languages like php etc ibm db2 version 9 linux unix windows supports embedded sql c c++ java cobol fortran rexx although support fortran rexx deprecated mimer sql linux openvms windows support embedded sql raima database manager 14.0 supports embedded sql c/c++ sql pl sap sybase ase 15.7 supports embedded sql c cobol part software developer kit sybase sap sybase sql anywhere supports embedded sql c c++ part sql anywhere database management system sql anywhere sap sybase iq supports embedded sql c c++ part sybase iq database management system sybase iq | [
3712,
5896,
10511,
9360,
11030,
5399,
1952,
428,
5677,
9389,
6831,
10413,
6451,
8502,
7612,
8262,
9926,
3400,
8524,
6483,
2901,
8539,
736,
10340,
1780,
2804,
3960,
3323
] | Test |
8,189 | 1 | Database_Management_Library:database management library database management library dbl relational database management system rdbms contained c++ programming library dbl source code available terms gnu general public license dbl fully developed within two weeks holiday programming project aims easy simple use c++ programming dbl library becomes integral part application program unlike client–server model database management systems standalone process application program communicates application software uses dbl functionality function calls basic program creates simple database however task must done usually done dbl command-line interface int main database db mydatabase class stores database name tables main functions useful functions use class database class stores table name structure columns table main functions useful functions use class table class stores columns table data stored data file main functions useful functions use class row class stores column value column main functions useful functions use class storage class stores name structure column main functions class stores indexes table main functions useful functions use class index dbl command-line interface program one create database table add columns table besides operations printing | [
4423,
10921,
10286,
2222,
2804
] | Test |
8,190 | 3 | Motorola_Single_Board_Computers:motorola single board computers motorola single board computers motorola production line computer boards embedded systems three different lines mvme68k mvmeppc mvme88k first version board appeared 1988 motorola still makes boards last one mvme3100 netbsd supports module families mvme147 mvme162 mvme167 mvme172 mvme177 openbsd supports mvme141 mvme165 mvme188 mvme197 boards | [
10501,
7302,
7305,
6187,
8048,
5235,
7286
] | None |
8,191 | 7 | Cloud_(operating_system):cloud operating system cloud browser-based operating system created good os llc los angeles-based corporation company initially launched linux distribution called gos heavily based ubuntu third incarnation cloud simplified operating system ran web browser providing access variety web-based applications allowed user perform many simple tasks without booting full-scale operating system simplicity cloud could boot seconds operating system designed netbooks mobile internet devices pcs mainly used browse internet cloud user quickly boot main os cloud continues booting main os background combining browser basic operating system allows use cloud computing applications data live run internet instead hard drive cloud installed used together operating systems act standalone operating system used standalone operating system hardware requirements relatively low 2009 cloud officially available built gigabyte m912 touch screen netbook early reviews compared operating system user interface os x noted similarity browser google chrome although actually based modified mozilla firefox browser | [
4236,
10893,
911,
1935,
4623,
8592,
2965,
5397,
10646,
2328,
4377,
8986,
6307,
9766,
5159,
6444,
7983,
8495,
3121,
5681,
7352,
7483,
2496,
4289,
1224,
8520,
4429,
7248,
1362,
467,
9682,
6367,
4194,
11646,
5732,
10090,
3819,
7660,
5363,
21... | Test |
8,192 | 5 | Digital_Signal_1:digital signal 1 digital signal 1 ds1 sometimes ds-1 t-carrier signaling scheme devised bell labs ds1 primary digital telephone standard used united states canada japan able transmit 24 multiplexed voice data calls telephone lines e-carrier used place t-carrier outside united states canada japan south korea ds1 logical bit pattern used physical t1 line practice terms ds1 t1 often used interchangeably t1 refers primary digital telephone carrier system used north america t1 one line type pcm t-carrier hierarchy t1 describes cabling signal type signal regeneration requirements carrier system signal transmitted t1 line referred ds1 signal consists serial bits transmitted rate 1.544 mbps type line code used called alternate mark inversion ami digital signal designation classification digital bit rates digital multiplex hierarchy used transport telephone signals one location another ds-1 communications protocol multiplexing bitstreams 24 telephone calls along two special bits framing bit frame synchronization maintenance-signaling bit transmitted digital circuit called t1 t1 maximum data transmission rate 1.544 megabits per second ds1 telecommunication circuit multiplexes 24 ds0s twenty-four ds0s sampled 8,000 times per second one 8bit pcm sample dso per ds1 frame consume 1.536 mbit/s bandwidth one framing bit adds 8 kbit/s overhead total 1.544 mbit/s calculated follows ds1 full-duplex circuit concurrently transmitting receiving 1.544 mbit/s frame synchronization necessary identify timeslots within 24-channel frame synchronization takes place allocating framing 193rd bit results 8 kbit/s framing data ds1 8-kbit/s channel used transmitting equipment overhead 1.536 mbit/s actually passed user two types framing schemes superframe sf extended superframe esf superframe consists twelve consecutive 193-bit frames whereas extended superframe consists twenty-four consecutive 193-bit frames data due unique bit sequences exchanged framing schemes compatible two types framing sf esf use 8 kbit/s framing channel different ways connectivity refers ability digital carrier carry customer data either end cases connectivity may lost one direction maintained cases terminal equipment i.e. equipment marks endpoints ds1 defines connection quality received framing pattern alarms normally produced receiving terminal equipment framing compromised three defined alarm indication signal states identified legacy color scheme red yellow blue red alarm indicates alarming equipment unable recover framing reliably corruption loss signal produce red alarm connectivity lost toward alarming equipment knowledge connectivity toward far end yellow alarm also known remote alarm indication rai indicates reception data framing pattern reports far end red alarm alarm carried differently sf d4 esf d5 framing sf framed signals user bandwidth manipulated bit two every ds0 channel shall zero resulting loss payload data transmitting yellow alarm undesirable resolved esf framed signals using data link layer repeating 16-bit pattern consisting eight 'ones followed eight 'zeros shall transmitted continuously esf data link may interrupted period exceed 100-ms per interruption types alarms transmitted duration alarm condition least one second blue alarm also known alarm indication signal ais indicates disruption communication path terminal equipment line repeaters dcs signal received intermediary equipment produces unframed all-ones signal receiving equipment displays red alarm sends signal yellow alarm far end framing intermediary interfaces equipment report ais alarm indication signal ais also called ones data framing pattern alarm states also lumped term carrier group alarm cga meaning cga connectivity digital carrier failed result cga condition varies depending equipment function voice equipment typically coerces robbed bits signaling state result far end properly handling condition applying often different state customer equipment connected alarmed equipment simultaneously customer data often coerced 0x7f pattern signifying zero-voltage condition voice equipment data equipment usually passes whatever data may present leaving customer equipment deal condition additionally voice t1s two main types so-called plain inband t1s pri primary rate interface carry voice telephone calls similar fashion pris commonly used call centers provide 23 actual usable telephone lines known b channels bearer also 24th line known channel data carries line signaling information special channel carries caller id cid automatic number identification ani data required channel type usually b bearer channel call handle dialed number identification service dnis info requested channel number request response inband t1s also capable carrying cid ani information configured carrier sending dtmf *ani*dnis* however pris handle efficiently inband t1 seemingly slight advantage due 24 lines available make calls opposed pri 23 channel inband t1 must perform setup tear-down call pri uses 24th channel data channel perform overhead operations 23 channels including cid ani although inband t1 24 channels 23 channel pri set calls faster due dedicated 24th signalling channel channel name t1 came carrier letter assigned technology 1957 digital systems first proposed developed decided skip q r use time division naming system ended letter designated fiber networks destined successors t1 system networks called t1c t2 t3 t4 commercial success disappeared quickly signals would carried systems called ds1 ds2 ds3 ds4 carried t1 infrastructure ds-1 means digital service – level 1 signal sent—as opposed network delivers originally 24 digitized voice channels t1 since practice naming networks ended letter terms t1 ds1 become synonymous encompass plethora different services voice data clear-channel pipes line speed always consistent 1.544 mbit/s payload vary greatly dark fiber dark fiber refers unused fibers available use dark fiber still available sale wholesale market metro wide area links may available markets city pairs dark fiber capacity typically used network operators build sonet dense wavelength division multiplexing dwdm networks usually involving meshes self-healing rings also used end-user enterprises expand ethernet local area networks especially since adoption ieee standards gigabit ethernet 10 gigabit ethernet single-mode fiber running ethernet networks geographically separated buildings practice known wan elimination ds1c digital signal equivalent two digital signal 1 extra bits conform signaling standard 3.152 mbit/s circuit capacities still use today early days digital data transmission 3-mbit/s data rate used link mainframe computers together physical side circuit called t1c t1/e1 protocol implemented line interface unit silicon semiconductor chip contains decoder/encoder loop backs jitter attenuators receivers drivers additionally usually multiple interfaces labeled dual quad octal etc. depending upon number transceiver chip primary purpose retrieve information line i.e. conductive line transverses distance receiving pulses converting signal subjected noise jitter interference clean digital pulse interface chip | [
5505,
4227,
6290,
11286,
2968,
3742,
929,
11170,
2860,
2989,
2863,
2994,
7865,
5052,
6205,
4546,
7108,
2894,
1618,
3156,
4692,
3168,
2787,
4963,
1893,
2793,
10100,
7799
] | Train |
8,193 | 3 | The_Maze_of_Galious:maze galious sequel konami msx game knightmare majou densetsu original game overhead vertical scrolling shooter maze galious side-view flick-screen platform game player controls popolon aphrodite entering evil priest galious castle free yet-to-be-born son pampas priest evil clutches able control popolon aphrodite means player switch two characters slightly different abilities example popolon push stones open heavy doors hand aphrodite survives longer water shoot projectiles either character die visit shrine pay resurrection unlike typical platform games characters survive damage hit point bars game several types enemies strengths weaknesses monsters immune frontal attacks vulnerable fire ten different bosses fought defeating boss give player key used unlock doors boss areas in-game saving provided giving player encoded password | [
4357,
9006,
7283,
10931,
8027
] | Test |
8,194 | 7 | Stacki:stacki stacki computer cluster software product company stackiq released open-source software stackiq originally named clustercorp founded 2006 first product commercial version linux distribution called rocks cluster distribution originally based san jose california co-founders included mason katz chief executive tim mcintire 2011 company re-incorporated stackiq moved la jolla district san diego california round venture capital funding april october 2014 raised 6 million located solana beach california august 2016 pervez choudhry replaced mcintire chief executive product called stackiq cluster manager renamed stackiq boss february 2015 stacki works several servers time takes long provision number servers system allows installations via preboot execution environment pxe supports “ servers boot network ” “ servers spreadsheet ” method installations servers installed isolated network stacki tool called insert-ethers run grab machine boots network add stacki commencing installation needed servers installed shared network loading spreadsheet machines install tells stacki ones install stacki uses database manage variables use installation variables defined individual server installation type globally manipulated via spreadsheets command line networking example managed variables machine configured multiple network cards multiple networks varying routes open/closed ports stacki released june 2015 stackiq company acquired teradata june 30 2017 undisclosed amount | [
2834,
4149,
2901
] | Test |
8,195 | 7 | MySQL_Cluster:mysql cluster mysql cluster technology providing shared-nothing clustering auto-sharding mysql database management system designed provide high availability high throughput low latency allowing near linear scalability mysql cluster implemented ndb ndbcluster storage engine mysql ndb stands network database mysql cluster designed around distributed multi-master acid compliant architecture single point failure mysql cluster uses automatic sharding partitioning scale read write operations commodity hardware accessed via sql non-sql nosql apis internally mysql cluster uses synchronous replication two-phase commit mechanism order guarantee data written multiple nodes upon committing data contrast usually referred mysql replication two copies known replicas data required guarantee availability mysql cluster automatically creates “ node groups ” number replicas data nodes specified user updates synchronously replicated members node group protect data loss support fast failover nodes also possible replicate asynchronously clusters sometimes referred mysql cluster replication geographical replication typically used replicate clusters data centers disaster recovery reduce effects network latency locating data physically closer set users unlike standard mysql replication mysql cluster geographic replication uses optimistic concurrency control concept epochs provide mechanism conflict detection resolution enabling active/active clustering data centers starting mysql cluster 7.2 support synchronous replication data centers supported multi-site clustering feature mysql cluster implemented fully distributed multi-master database ensuring updates made application sql node instantly available nodes accessing cluster data node accept write operations data within mysql cluster ndb tables automatically partitioned across data nodes system done based hashing algorithm based primary key table transparent end application clients connect node cluster queries automatically access correct shards needed satisfy query commit transaction mysql cluster able support cross-shard queries transactions users define partitioning schemes allows developers add “ distribution awareness ” applications partitioning based sub-key common rows accessed high running transactions ensures data used complete transactions localized shard thereby reducing network hops mysql cluster allows datasets larger capacity single machine stored accessed across multiple machines mysql cluster maintains indexed columns distributed memory non-indexed columns also maintained distributed memory maintained disk in-memory page cache storing non-indexed columns disk allows mysql cluster store datasets larger aggregate memory clustered machines mysql cluster writes redo logs disk data changes well check pointing data disk regularly allows cluster consistently recover disk full cluster outage redo logs written asynchronously respect transaction commit small number transactions lost full cluster fails however mitigated using geographic replication multi-site cluster discussed current default asynchronous write delay 2 seconds configurable normal single point failure scenarios result data loss due synchronous data replication within cluster mysql cluster table maintained memory cluster access disk storage write redo records checkpoints writes sequential limited random access patterns involved mysql cluster achieve higher write throughput rates limited disk hardware compared traditional disk-based caching rdbms checkpointing disk in-memory table data disabled per-table basis disk-based persistence n't needed mysql cluster designed single point failure provided cluster set correctly single node system piece hardware fail without entire cluster failing shared disk san required interconnects nodes standard ethernet gigabit ethernet infiniband sci interconnects mysql cluster stores tables data nodes rather mysql server multiple interfaces available access database part commercial mysql cluster cge mysql cluster manager tool designed simplify creation administration mysql cluster cge database automating common management tasks including on-line scaling upgrades backup/restore reconfiguration mysql cluster manager also monitors automatically recovers mysql server application nodes management nodes well mysql cluster data nodes mysql cluster uses three different types nodes processes generally expected node run separate physical host vm cloud instance although common co-locate management nodes mysql servers best practice recommended co-locate nodes within node group single physical host would represent single point failure mysql cluster version numbers longer tied mysql server example recent version mysql cluster 7.5 even though based on/contains server component mysql 5.7 higher versions mysql cluster include features lower versions plus new features older versions longer development currently available versions evaluation purposes possible run mysql cluster single physical server production deployments minimum system requirements 3 x instances hosts configurations follows tips recommendations deploying highly performant production grade clusters found mysql cluster evaluation guide guide optimizing performance mysql cluster database mysql ab acquired technology behind mysql cluster alzato small venture company started ericsson ndb originally designed telecom market high availability high performance requirements mysql cluster based ndb storage engine since integrated mysql product first release mysql 4.1 mysql cluster licensed gplv2 license commercial support available part mysql cluster cge also includes non-open source addons mysql cluster manager mysql enterprise monitor addition mysql enterprise security mysql enterprise audit | [
11136,
11392,
10628,
3462,
10632,
10258,
2456,
7453,
1950,
9503,
7339,
7983,
9010,
823,
8379,
10048,
6721,
9285,
3784,
5964,
5198,
4817,
7506,
9687,
10459,
6245,
8295,
8683,
5612,
2413,
6124,
7022,
10737,
6514,
3188,
1142,
10873,
2810
] | Test |
8,196 | 2 | Alcatel_One_Touch_Fire:alcatel one touch fire alcatel one touch fire one first generation smartphones preinstalled firefox os open-source mobile operating system developed mozilla phone developed marketed alcatel mobile phones lower-cost entry-level smartphone specific latin american european countries brazil chile colombia mexico peru uruguay venezuela latin america germany greece hungary italy montenegro poland serbia europe mobile network operators carried phone include congstar germany cosmote greece movistar chile mexico peru uruguay venezuela t-mobile montenegro macedonia telcel mexico telenor serbia montenegro telecom italia mobile italy vivo brazil one touch fire variation earlier android-based smartphone alcatel one touch t'pop unlike one touch fire one touch t'pop uses arm cortex-a9 cpu powervr sgx531 gpu also incorporates home back push-buttons distinct cosmetics differences one touch fire sold three color schemes mozilla orange apple green pure white two model numbers one touch fire 4012a 4012x support different cellular network standards frequency bands different countries 4012a quadband gsm radio communicate 850 900 1800 1900 mhz umts radio capable 850 1900 2100 mhz communication 4012x umts radio communicates 900 2100 mhz consequently 4012x lower specific absorption rate 4012a 4012x succeeded one touch fire c one touch fire e one touch fire s. 2019 alcatel one touch fire still little resale value worldwide due discontinuation firefox os fared well hardly considered collector item | [
7745,
10658,
7492,
5963,
1776,
2259,
9913,
1083,
638
] | Test |
8,197 | 4 | Public_computer:public computer public computer public access computer various computers available public areas places public computers may available libraries schools facilities run government public computers share similar hardware software components personal computers however role function public access computer entirely different public access computer used many different untrusted individuals throughout course day computer must locked secure intentional unintentional abuse users typically n't authority install software change settings personal computer contrast typically used single responsible user customize machine behavior preferences public access computers often provided tools pc reservation system regulate access world first public access computer center marin computer center california co-founded david annie fox 1977 see also computer kiosk kiosk special type public computer using software hardware modifications provide services place kiosk example movie ticket kiosk found movie theater kiosks usually secure browser zero access desktop many kiosks may run linux however atms kiosk designed depositing money often run windows xp united states canada almost public libraries computers available use patrons though libraries keep users timed allow others get turns keep library less busy users often allowed print documents created using computers though sometimes small fee u.s. government given money many school boards purchase computers educational applications schools may multiple computer labs contain computers students use usually internet access machines schools put blocking service limit websites students able access include educational resources google addition controlling content students viewing putting blocks also help keep computers safe preventing students downloading malware threats however effectiveness content filtering systems questionable since easily circumvented using proxy websites virtual private networks weak security systems merely knowing ip address intended website enough go school computers often advanced operating system security prevent tech-savvy students inflicting damage i.e windows registry editor task manager etc disabled microsoft windows machines schools advanced tech services may also install locked bios/firmware make kernel-level changes operating system eradicating chances unauthorized activity | [
1515,
6797,
7515,
7380,
823,
10392,
5435,
1279
] | Validation |
8,198 | 3 | GR8BIT:gr8bit gr8bit educational 8-bit computer hardware software platform upon users experiment computer electronics simpler computer architecture compared modern mainstream electronics created eugeny brychkov licensed msx licensing corporation age labs announced 2011 launch msx kit called gr8bit do-it-yourself computer learning purposes licensed msx licensing corporation kit priced 499 includes necessary components assemble working msx2 compatible computer except atx chassis power supply floppy drive hard disk ps/2 keyboard monitor also comes assembly operational manuals supplement compiled vendor community support | [
9932,
3788,
11462,
9006
] | None |
8,199 | 3 | Pac-Mania:pac-mania pac-mania would gain highly-positive critical reception uniqueness gameplay nominated best coin-op conversion year golden joystick awards 1987 although would lose taito operation wolf game would go sell 1,412 arcade cabinets north america end 1987 grossing around 2.82 million 6.22 million adjusted inflation pac-mania would ported several home consoles computers including atari st msx2 sega genesis nintendo entertainment system last published tengen several pac-man namco video game collections would also include game ports wii virtual console ios mobile phones also produced pac-mania isometric maze game player controls pac-man yellow circular creature must eat pellets stage avoiding five colored ghosts blinky pinky inky clyde sue eating large power pellets cause ghosts turn blue flee allowing pac-man eat bonus points send house middle stage clearing stage pellets allow pac-man move next new game ability jump ghosts allowing pac-man evade capture ghosts later areas game introduce two new ghosts green ghost funky steel gray ghost spunky also ability jump pac-man still jump funky impossible jump spunky eating certain number pellets cause bonus items appear middle stage pac-man eat points items increase pac-man movement speed double point values blue ghosts pac-mania arrived 8-bit systems 1988 favourable home conversion appeared commodore 64 conversions designed ported teque software otherwise known peter harrap monty mole shaun hollingworth ex-gremlin games published grandslam entertainment full screen 32-colour commodore amiga version released 1988 highly rated x68000 version acorn archimedes 16-bit atari st conversion ran 55 screen area used 16 colours pac-mania later ported nintendo entertainment system 1990 sega genesis 1991 tengen version unlicensed neither port released japan genesis port outsourced sculptured software recently port atari ste based st version modified take advantage ste features developed entertainment weekly gave game b- game runner-up category best coin-op conversion year golden joystick awards behind operation wolf arcade version pac-mania appeared namco museum volume 5 2001 namco museum release namco museum 50th anniversary namco museum virtual arcade 2001 one games included pac-man collection game boy advance later 2002 arcade version re-released included unlockable bonus pac-man world 2 2007 pac-mania also released namco museum remix pac pal pac n roll super pac-man non-pac-man games re-released 2010 part follow-up compilation namco museum megamix along 17 namco arcade games six remix games five appeared namco museum remix 2010 design pac-man ghosts pac-mania appear pac-man championship edition dx game released app app store ios devices pac-mania also re-released part pac-man arcade party arcade machine 2010 pac-man 30th anniversary february 2014 included pac-man museum playstation 3 xbox 360 windows pc via steam 2018 included pac-man pixel bash arcade cabinet along pac-man different namco games music pac-man park later used pac-man ghostly adventures power theme pac show version pac-man theme along block town music would remixed used super smash bros. nintendo 3ds wii u | [
6797,
9006,
10862,
1776,
10931,
6390,
4311,
4856,
3039
] | Test |
8,200 | 4 | Cross-zone_scripting:cross-zone scripting cross-zone scripting browser exploit taking advantage vulnerability within zone-based security solution attack allows content scripts unprivileged zones executed permissions privileged zone i.e privilege escalation within client web browser executing script vulnerability could common attack scenario involves two steps first step use cross-zone scripting vulnerability get scripts executed within privileged zone complete attack perform malicious actions computer using insecure activex components type vulnerability exploited silently install various malware spyware remote control software worms onto computers browsing malicious web page four well known zones internet explorer zones explained detail use security zones internet explorer also additional hidden zone local intranet trusted sites local computer usually configured privileged zones cross-zone scripting attacks designed jump internet zone privileged zone type exploit attempts execute code security context local computer zone following html used illustrate naive non-working attempt exploitation explanation html code attempts get attack.gif loaded cache using img src reference script src tag used attempt executing script local computer zone addressing local file cache consider scenario computer considers intranet.example.com part local intranet zone successfully cross zone scripted well-known example 2f bug internet explorer 6 discovered following url executed trusted sites permission listed trusted site | [
8281,
450,
5636,
4198,
10026,
10392,
2041,
6938,
7515
] | Test |
8,201 | 1 | Object_database:object database object database database management system information represented form objects used object-oriented programming object databases different relational databases table-oriented object-relational databases hybrid approaches object databases considered since early 1980s object-oriented database management systems oodbmss also called odbms object database management system combine database capabilities object-oriented programming language capabilities oodbmss allow object-oriented programmers develop product store objects replicate modify existing objects make new objects within oodbms database integrated programming language programmer maintain consistency within one environment oodbms programming language use model representation relational dbms projects way contrast maintain clearer division database model application usage web-based technology increases implementation intranets extranets companies vested interest oodbmss display complex data using dbms specifically designed store data objects gives advantage companies geared towards multimedia presentation organizations utilize computer-aided design cad object-oriented databases designed work well object-oriented programming languages delphi ruby python javascript perl java c visual basic .net c++ objective-c smalltalk others jade programming languages oodbmss use exactly model object-oriented programming languages object database management systems grew research early mid-1970s intrinsic database management support graph-structured objects term object-oriented database system first appeared around 1985. notable research projects included encore-ob/server brown university exodus university wisconsin–madison iris hewlett-packard ode bell labs orion microelectronics computer technology corporation mcc vodak gmd-ipsi zeitgeist texas instruments orion project published papers efforts kim mcc compiled best papers book published mit press early commercial products included gemstone servio logic name changed gemstone systems gbase graphael vbase ontologic additional commercial products entered market late 1980s mid 1990s included itasca itasca systems jasmine fujitsu marketed computer associates matisse matisse software objectivity/db objectivity inc. objectstore progress software acquired excelon originally object design incorporated ontos ontos inc. name changed ontologic technology merged several companies acquired informix turn acquired ibm poet fastobjects versant acquired poet software versant object database versant corporation voss logic arts jade jade software corporation products remain market joined new open source commercial products intersystems caché object database management systems added concept persistence object programming languages early commercial products integrated various languages gemstone smalltalk gbase lisp vbase cop voss virtual object storage system smalltalk much 1990s c++ dominated commercial object database management market vendors added java late 1990s recently c starting 2004 object databases seen second growth period open source object databases emerged widely affordable easy use entirely written oop languages like smalltalk java c versant db4o db4objects dts/s1 obsidian dynamics perst mcobject available dual open source commercial licensing object databases based persistent programming acquired niche application areas engineering spatial databases telecommunications scientific areas high energy physics molecular biology another group object databases focuses embedded use devices packaged software real-time systems object databases also offer kind query language allowing objects found using declarative programming approach area object query languages integration query navigational interfaces biggest differences products found attempt standardization made odmg object query language oql access data faster object retrieved directly without search following pointers another area variation products way schema database defined general characteristic however programming language database schema use type definitions multimedia applications facilitated class methods associated data responsible correct interpretation many object databases example gemstone voss offer support versioning object viewed set versions also object versions treated objects right object databases also provide systematic support triggers constraints basis active databases efficiency database also greatly improved areas demand massive amounts data one item example banking institution could get user account information provide efficiently extensive information transactions account information entries etc object data management group consortium object database object-relational mapping vendors members academic community interested parties goal create set specifications would allow portable applications store objects database management systems published several versions specification last release odmg 3.0 2001 major object database object-relational mapping vendors claimed conformance odmg java language binding compliance components specification mixed 2001 odmg java language binding submitted java community process basis java data objects specification odmg member companies decided concentrate efforts java data objects specification result odmg disbanded 2001 many object database ideas also absorbed implemented varying degrees object-relational database products 2005 cook rai rosenberger proposed drop standardization efforts introduce additional object-oriented query apis rather use oo programming language i.e. java .net express queries result native queries emerged similarly microsoft announced language integrated query linq dlinq implementation linq september 2005 provide close language-integrated database query capabilities programming languages c vb.net 9 february 2006 object management group omg announced granted right develop new specifications based odmg 3.0 specification formation object database technology working group odbt wg odbt wg planned create set standards would incorporate advances object database technology e.g. replication data management e.g. spatial indexing data formats e.g. xml include new features standards support domains object databases adopted e.g. real-time systems work odbt wg suspended march 2009 subsequent economic turmoil late 2008 odb vendors involved effort decided focus resources elsewhere january 2007 world wide web consortium gave final recommendation status xquery language xquery uses xml data model ideas developed originally object databases found way xquery xquery intrinsically object-oriented popularity xml xquery engines compete object databases vehicle storage data complex variable hold conveniently relational database xquery also allows modules written provide encapsulation features provided object-oriented systems xquery v1 xpath v2 extremely complex foss software implementing standards 10 years publication compared xpath v1 xslt v1 xml fit community demands open format since early 2000s json gained community adoption popularity applications surpassing xml 2010s jsoniq query-analog xquery json sharing xquery core expressions operations demonstrated functional equivalence json xml formats context main strategy oodbms maintainers retrofit json databases using internal data type january 2016 postgresql 9.5 release first foss oodbms offer efficient json internal datatype jsonb complete set functions operations basic relational non-relational manipulations object database stores complex data relationships data directly without mapping relational rows columns makes suitable applications dealing complex data objects many-to-many relationship accessed use pointers pointers linked objects establish relationships another benefit oodbms programmed small procedural differences without affecting entire system | [
5632,
6153,
2068,
5658,
9245,
9248,
10793,
5677,
10286,
4155,
11324,
11327,
70,
9286,
2632,
9290,
8788,
10326,
7767,
8291,
9828,
10340,
8808,
2669,
1136,
6775,
1146,
3196,
2688,
10389,
6809,
4255,
1697,
4263,
10921,
10413,
9397,
7868,
11457... | None |
8,202 | 4 | Email_authentication:email authentication email authentication validation collection techniques aimed providing verifiable information origin email messages validating domain ownership message transfer agents mta participated transferring possibly modifying message original base internet email simple mail transfer protocol smtp feature forged sender addresses emails practice known email spoofing widely used phishing email spam various types fraud combat large number competing email authentication proposals developed fairly recently three widely adopted – spf dkim dmarc results validation used automated email filtering assist recipients selecting appropriate action article cover user authentication email submission retrieval early 1980s simple mail transfer protocol smtp designed provided real verification sending user system problem email systems run trusted corporations universities since commercialization internet early 1990s spam phishing crimes increasingly involve email email authentication necessary first step towards identifying origin messages thereby making policies laws enforceable hinging domain ownership stance emerged early 2000 implies coarse-grained authentication given domains appear right part email addresses sign fine-grain authentication user level achieved means pretty good privacy s/mime present digital identity needs managed individual smtp defines message transport message content thus defines mail envelope parameters envelope sender header except trace information body message std 10 define smtp envelope std 11 define message header body formally referred internet message format smtp defines trace information message saved header using following two fields mail user agent mua knows outgoing mail smtp server configuration mta relay server typically determines server connect looking mx mail exchange dns resource record recipient domain name path depicted left reconstructed ground trace header fields host adds top header receives message important realize first lines top header usually trusted recipient fact lines written machines recipient administrative management domain admd act upon explicit mandate contrast lines prove involvement b well purported author mua could counterfeit created c. codice_1 field shown epoch-making piece header codice_2 written e mail delivery agent mda based message envelope additional trace fields designed email authentication populate top header normally messages sent author admd go directly destination mx b → figures sender admd add authentication tokens message goes boxes common cases schematized follows spf allows receiver check email claimed come specific domain comes ip address authorized domain administrators usually domain administrator authorize ip addresses used outbound mtas including proxy smarthost ip address sending mta guaranteed valid transmission control protocol establishes connection checking remote host reachable receiving mail server receives codice_3 smtp command soon connection set codice_4 beginning message contain domain name spf verifier queries domain name system dns matching spf record exists specify ip addresses authorized domain administrator result pass fail intermediate result systems generally take account anti-spam filtering dkim checks message content deploying digital signatures rather using digital certificates keys signature-verification distributed via dns way message gets associated domain name dkim-compliant domain administrator generates one pairs asymmetric keys hands private keys signing mta publishes public keys dns dns labels structured codice_5 selector identifies key pair codice_6 fixed keyword followed signing domain name publication occurs authority domain admd injecting message smtp transport system signing mta creates digital signature covers selected fields header body beginning signature cover substantive header fields codice_7 codice_8 codice_9 codice_10 added message header trace field number relays receive forward message every hop signature verified retrieving public key dns long intermediate relays n't modify signed parts message dkim-signatures remain valid dmarc allows specification policy authenticated messages built top two existing mechanisms sender policy framework spf domainkeys identified mail dkim allows administrative owner domain publish policy dns records specify mechanism dkim spf employed sending email domain check codice_7 field presented end users receiver deal failures reporting mechanism actions performed policies range methods proposed either deprecated yet gained widespread support included sender id certified server validation domainkeys adsp allows specification policy messages signed author domain message go dkim authentication first adsp demand punishing treatment message signed author domain —as per codice_7 header field adsp record codice_13 published dns label codice_14 adsp designed domains heavily abused phishing similar fraud may want forgo mail facilities mailing lists non delivery reports happen remain unsigned exchange cut abuse adsp demoted historic november 2013 vbr adds vouch already authenticated identity method requires globally recognized authorities certify reputation domains sender apply reference vouching authority reference accepted published dns branch managed authority vouched sender add codice_15 header field messages sends also add dkim signature use authentication method spf receiver validating sender identity verify vouch claimed codice_15 looking reference applications avoid using method means authentication nevertheless often carried results written codice_1 header field besides tcp information required smtp specification ip reverse confirmed looking ip address name found indication ip set properly dns reverse resolution range ip addresses delegated admd uses remain managed network provider latter case useful identity related message obtained rfc 8601 defines trace header field codice_18 receiver record results email authentication checks carried multiple results multiple methods reported field separated semicolons wrapped appropriate example following field purportedly written codice_19 reports spf dkim results first token field name codice_19 id authentication server token known authserv-id receiver supporting rfc 8601 responsible remove rename false header claiming belong domain downstream filters get confused however filters still need configured know identities domain may use mail user agent mua slightly harder learn identities trust since users receive email multiple domains—e.g. multiple email addresses -— domains could let codice_18 fields pass looked neutral way malicious sender forge authserv-id user would trust message arrived different domain legitimate codice_18 typically appears codice_1 field domain message relayed additional codice_1 fields may appear top header message got transferred internally servers belonging trusted admd internet assigned numbers authority maintains registry email authentication parameters parameters need registered though example local policy values designed site internal use correspond local configuration need registration hand header field meant report results based data already present message data retrieved third parties global reputation systems compliant rfc 7601 example attempt register add dnswl results field rejected basis | [
1667,
7044,
8332,
7949,
1297,
914,
8337,
5012,
10263,
8093,
2848,
8224,
10275,
11046,
8747,
10924,
5421,
4272,
9909,
182,
10167,
4793,
5433,
9532,
1086,
8130,
4163,
2887,
10696,
3145,
4945,
1495,
3032,
8283,
9053,
2527,
1125,
4453,
6762,
... | Test |
8,203 | 8 | Web_Services_Discovery:web services discovery web services discovery provides access software systems internet using standard protocols basic scenario web service provider publishes service web service consumer uses service web service discovery process finding suitable web services given task publishing web service involves creating software artifact making accessible potential consumers web service providers augment service endpoint interface interface description using web services description language wsdl consumer use service universal description discovery integration uddi xml-based registry business internet services provider explicitly register service web services registry uddi publish additional documents intended facilitate discovery web services inspection language wsil documents service users consumers search web services manually automatically implementation uddi servers wsil engines provide simple search apis web-based gui help find web services web services may also discovered using multicast mechanisms like ws-discovery thus reducing need centralized registries smaller networks current uddi search mechanism focus single search criterion business name business location business category service type name business identifier discovery url fact business solution normal search multiple uddi registries wsil documents aggregate returned result using filtering ranking techniques ibm modularized federated web services discovery engine 2001 released technology ibm business explorer web services be4ws universal description discovery integration uddi pronounced platform-independent extensible markup language protocol includes xml-based registry businesses worldwide list internet mechanism register locate web service applications uddi open industry initiative sponsored organization advancement structured information standards oasis enabling businesses publish service listings discover define services software applications interact internet uddi originally proposed core web service standard designed interrogated soap messages provide access web services description language wsdl documents describing protocol bindings message formats required interact web services listed directory uddi written august 2000 time authors vision world consumers web services would linked providers public private dynamic brokerage system vision anyone needing service credit card authentication would go service broker select service supporting desired soap service interface meeting criteria world publicly operated uddi node broker would critical everyone consumer public open brokers would return services listed public discovery others service producer getting good placement brokerage—by relying metadata authoritative index categories—would critical effective placement uddi included web services interoperability ws-i standard central pillar web services infrastructure uddi specifications supported publicly accessible universal business registry naming system built around uddi-driven service broker uddi widely adopted designers hoped ibm microsoft sap announced closing public uddi nodes january 2006 group defining uddi oasis universal description discovery integration uddi specification technical committee voted complete work late 2007 closed september 2010 microsoft announced removing uddi services future versions windows server operating system instead capability would moved biztalk server 2013 microsoft announced deprecation uddi services biztalk server 2016 microsoft remove uddi services biztalk server uddi systems commonly found inside companies used dynamically bind client systems implementations however much search metadata permitted uddi used relatively simple role uddi business registration consists three components white pages give information business supplying service includes name business description business potentially multiple languages using information possible find service information already known example locating service based provider name contact information business also provided example businesses address phone number information dun bradstreet yellow pages provide classification service business based standard taxonomies include standard industrial classification sic north american industry classification system naics united nations standard products services code unspsc geographic taxonomies single business may provide number services may several yellow pages describing service associated one white page giving general information business green pages used describe access web service information service bindings information related web service address service parameters references specifications interfaces information related directly web service includes e-mail ftp corba telephone details service web service may multiple bindings defined wsdl description service may multiple green pages binding need accessed differently uddi nodes servers support uddi specification belong uddi registry uddi registries collections one nodes soap xml-based protocol exchange messages requester provider web service provider publishes wsdl uddi requester join using soap | [
7364,
2501,
8070,
10020,
425,
4107,
10829,
8208,
4979,
7320,
5433,
3323,
2013,
7198,
4959
] | None |
8,204 | 5 | WHOIS:whois whois pronounced phrase query response protocol widely used querying databases store registered users assignees internet resource domain name ip address block autonomous system also used wider range information protocol stores delivers database content human-readable format current iteration whois protocol drafted internet society documented elizabeth feinler team created resource directory arpanet responsible creating first whois directory early 1970s feinler set server stanford network information center nic acted directory could retrieve relevant information people entities team created domains feinler suggestion domains divided categories based physical address computer process registration established nowiki rfc 920 /nowiki whois standardized early 1980s look domains people resources related domain number registrations registration done one organization time one centralized server used whois queries made looking information easy time emergence internet arpanet organization handled domain registrations defense advanced research projects agency darpa united states government created 1958 responsibility domain registration remained darpa arpanet became internet 1980s uunet began offering domain registration service however simply handled paperwork forwarded darpa network information center nic national science foundation directed management internet domain registration would handled commercial third-party entities internic formed 1993 contract nsf consisting network solutions inc. general atomics general atomics contract canceled several years due performance issues 20th century whois servers highly permissive would allow wild-card searches whois query person last name would yield individuals name query given keyword returned registered domains containing keyword query given administrative contact returned domains administrator associated since advent commercialized internet multiple registrars unethical spammers permissive searching longer available december 1 1999 management top-level domains tlds com net org assigned icann time tlds converted thin whois model existing whois clients stopped working time month later self-detecting common gateway interface support program could operate web-based whois lookup external tld table support multiple whois servers based tld request eventually became model modern whois client 2005 many generic top-level domains early 1980s also many country-code top-level domains led complex network domain name registrars registrar associations especially management internet infrastructure become internationalized performing whois query domain requires knowing correct authoritative whois server use tools whois proxy searches become common 2003 ietf committee formed create new standard looking information domain names network numbers cross registry information service protocol crisp january 2005 july 2006 working name proposed new standard internet registry information service iris initial ietf proposed standards rfcs iris status rfcs group worked found ietf tools site march 2009 crisp ietf working group concluded final rfc 5144 published group note ietf crisp working group confused number resource organization nro team name consolidated rir iana stewardship proposal team crisp team 2013 ietf acknowledged iris successful replacement whois primary technical reason appeared complexity iris non-technical reasons deemed lie areas upon ietf pass judgment meanwhile arin ripe ncc managed serve whois data via restful web services charter drafted february 2012 provided separate specifications number registries first name registries follow working group produced five proposed standard documents informational document whois protocol origin arpanet nicname protocol based name/finger protocol described nowiki rfc 742 /nowiki 1977 nicname/whois protocol first described nowiki rfc 812 /nowiki 1982 ken harrenstien vic white network information center sri international whois originally implemented network control program ncp found major use tcp/ip suite standardized across arpanet later internet protocol specification following original quote command line server query normally single name specification i.e name resource however servers accept query consisting question mark return description acceptable command line formats substitution wild-card formats also exist e.g. appending full-stop period query name returns entries beginning query name modern internet whois services typically communicated using transmission control protocol tcp servers listen requests well-known port number 43 clients simple applications establish communications channel server transmit text record name resource queried await response form sequence text records found database simplicity protocol also permits application command line interface user query whois server using telnet protocol 2014 june icann published recommendation status codes extensible provisioning protocol epp domain status codes whois lookups traditionally performed command line interface application many alternative web-based tools exist whois sister protocol called referral whois rwhois whois database consists set text records resource text records consists various items information resource associated information assignees registrants administrative information creation expiration dates two data models exist storing resource information whois database thick thin model whois information stored looked according either thick thin data model thick model usually ensures consistent data slightly faster queries since one whois server needs contacted registrar goes business thick registry contains important information registrant entered correct data privacy features used obscure data registration information retained thin registry contact information might available could difficult rightful registrant retain control domain whois client understand deal situation would display full information registrar unfortunately whois protocol standard determining distinguish thin model thick model specific details records stored vary among domain name registries top-level domains including com net operate thin whois requiring domain registrars maintain customers data global top-level registries including org operate thick model country-code top-level registry national rules first applications written whois information system command-line interface tools unix unix-like operating systems i.e solaris linux etc. whois client server software distributed free open-source software binary distributions included unix-like systems various commercial unix implementations may use proprietary implementation example solaris 7 whois command line client passes phrase given argument directly whois server various free open source examples still found sites sourceforge.net however modern whois tools implement command line flags options -h option access specific server host default servers preconfigured additional options may allow control port number connect displaying additional debugging data changing recursion/referral behavior like tcp/ip client-server applications whois client takes user input opens internet socket destination server whois protocol manages transmission query reception results advent world wide web especially loosening network solutions monopoly looking whois information via web become quite common present popular web-based whois-queries may conducted arin ripe apnic early web-based whois clients merely front-ends command-line client resulting output gets displayed web page little clean-up formatting currently web based whois clients usually perform whois queries directly format results display many clients proprietary authored domain name registrars need web-based clients came fact command-line whois clients largely existed unix large computing worlds microsoft windows macintosh computers whois clients installed default registrars find way provide access whois data potential customers many end-users still rely clients even though command line graphical clients exist home pc platforms microsoft provides sysinternals suite includes whois client cost also many sites owned registrars internet-related companies support main tld remain free web-based whois sites incomplete support tld ip search cpan several perl modules available work whois servers many current fully function current 2005 whois server infrastructure however still much useful functionality derive including looking numbers registrant contacts whois servers operated regional internet registries rir queried directly determine internet service provider responsible particular resource records registries cross-referenced query arin record belongs ripe return placeholder pointing ripe whois server lets whois user making query know detailed information resides ripe server addition rirs servers commercial services exist routing assets database used large networks e.g. large internet providers acquired isps several rir areas currently standard determining responsible whois server dns domain though number methods common use top-level domains tlds whois lookups require searching procuring domain registrar display domain owner details normally contact information resources assignee returned however registrars offer private registration case contact information registrar shown instead registry operators wholesalers meaning typically provide domain name services large number retail registrars turn offer consumers private registration identity wholesale registrar may returned case identity individual well retail registrar may hidden example whois data returned individual resource holder result whois query example.com referral whois rwhois extension original whois protocol service rwhois extends concepts whois scalable hierarchical fashion potentially creating system tree-like architecture queries deterministically routed servers based hierarchical labels reducing query primary repository information lookups ip address allocations often limited larger classless inter-domain routing cidr blocks e.g. /24 /22 /16 usually regional internet registries rirs domain registrars run rwhois whois servers although rwhois intended run even smaller local internet registries provide granular information ip address assignment rwhois intended replace whois providing organized hierarchy referral services one could connect rwhois server request look-up automatically re-directed correct server however technical functionality place adoption rwhois standard weak rwhois services typically communicated using transmission control protocol tcp servers listen requests well-known port number 4321 rwhois first specified nowiki rfc 1714 /nowiki 1994 network solutions specification superseded 1997 rfc 2167 referral features rwhois different feature whois server refer responses another server rwhois also implements one criticism whois lack full access data parties realtime access complete databases others cite competing goal domain privacy criticism although problem strongly mitigated domain privacy services currently internet corporation assigned names numbers icann broadly requires mailing address phone number e-mail address owning administrating domain name made publicly available whois directories registrant domain owner contact details address telephone number easily accessible anyone queries whois server however policy enables spammers direct marketers identity thieves attackers loot directory personal information people although icann exploring changing whois enable greater privacy lack consensus among major stakeholders type change made domain registrars offer private registrations also known domain privacy contact information registrar shown instead customer offer private registration many registrars risk mitigated studies shown spammers harvest plain-text email addresses whois servers reason whois servers websites offering whois queries implemented rate-limiting systems web-based captcha limited amounts search queries per user ip address whois requirements conflict general data protection regulation gdpr effective european union 25 may 2018 places strict regulations processing publication personally identifiable information icann stated november 2017 would reprimand noncompliance contractual obligations related handling registration data registrars provide alternative solutions compliance rules whois requirements updated take gdpr account whois protocol written international audience mind whois server and/or client determine text encoding effect query database content many servers originally using us-ascii internationalization concerns n't taken consideration much later might impact usability usefulness whois protocol countries outside usa case internationalized domain names responsibility client application perform translation domain name native language script dns name punycode cases registrant domain owner identity public anyone easily confirm status domain via whois case private registrations ascertaining registration information may difficult registrant acquired domain name wants verify registrar completed registration process three steps may required provides confidence retailer actually registered name registrar goes business failure registerfly 2007 rightful domain holder privacy-protected registrations may difficulty regaining administration his/her domain name registrants using private registration attempt protect using registrar places customer data escrow third party icann requires every registrant domain name given opportunity correct inaccurate contact data associated his/her domain reason registrars required periodically send holder contact information record verification provide guarantee accuracy information registrant provided inaccurate information whois generated policy issues united states federal government noted whois creates privacy issue also tied free speech anonymity however whois important tool law enforcement officers investigating violations like spam phishing track holders domain names result law enforcement agencies sought make whois records open verified expert working group ewg internet corporation assigned names numbers icann recommended 24 june 2013 whois scrapped recommends whois replaced system keeps information secret internet users discloses information permissible purposes icann list permissible purposes includes domain-name research domain-name sale purchase regulatory enforcement personal data protection legal actions abuse mitigation although whois key tool journalists determining disseminating certain information internet use whois free press included icann ’ proposed list permissible purposes ewg collected public input initial report 13 september 2013 final report issued 6 june 2014 without meaningful changes recommendations icann process re-inventing whois working icann whois beta | [
7298,
1796,
517,
8582,
519,
6797,
10104,
5397,
10017,
2090,
10872,
9901,
10924,
7983,
4272,
2485,
6710,
5818,
8386,
2887,
11464,
3145,
1996,
7117,
10446,
6993,
2901,
6229,
6103,
7802,
11607,
5469,
11391,
10727,
11112,
1129,
106,
2281,
10609... | None |
8,205 | 4 | Hao123:hao123 hao123 online listings portal baidu.. portuguese thai version hao123 accused internet hijacking installing virus inserts hao123 onto desktop malicious browser hijacker often installs without user consent installed difficult remove hao123 uses windows service registry browser parameters modify browser default setting prevent removed uninstalled adding back windows service also sniffs user internet traffic illegally forces users visit website improve website traffic ranking reason hao123 considered malware many anti-virus programs | [
7515
] | None |
8,206 | 4 | BlackPOS_Malware:blackpos malware blackpos interprocess communication hook malware type point-of-sale malware spyware program specifically designed installed point sale pos system scrape data debit credit cards different normal memory-scraping malware scrapes data needs filters extract target data specifically hooks track information thus called interprocess communication hook malware gets installed looks pos.exe file system parses content track 1 track 2 financial card data scraped data encoded base64 algorithm stored magnetic strip back card encoded data moved second machine smb blackpos malware involved target corporation data breach 2013 blackpos program first surfaced early 2013 affected many australian american canadian companies target marcus neiman incorporated point-of-sale systems companies virus also known 'reedum 'kaptoxa originally created 23 year-old rinat shabayev later developed 17-year-old sergey taraspov better known online name 'ree4 original version blackpos sold online black market forums taraspov around 2000 became cheaper readily available source code malware leaked onto web blackpos infects computers running windows operating systems credit card readers connected part pos system pos system computers easily infected date operating systems antivirus programs prevent security breaches computer database systems weak administration login credentials blackpos standard memory-scraping malware exception virus limited pos.exe files infected pos system desired pos system infected malware pinpoints process corresponded card reader steals payment card track 1 track 2 data information stored magnetic strip payment cards system memory stolen information cloned onto blank credit cards sold black market use used personal reasons results consumer personal information compromised usable anyone access information unlike pos malware vskimmer blackpos offline data extraction method captured information uploaded remote server online makes easier hackers need proximity infected systems retrieve consumer information furthermore hackers may try hide virus detection programming blackpos send stolen information certain time frames mask traffic information creates normal work hours making seem nothing suspicious going blackpos used steal customer information businesses worldwide well-known attack occurred back 2013 mega-store chain target thanksgiving break november 2013 target pos system infected blackpos malware mid-december mega-store became aware breach security hackers able get target systems compromising company web server uploading blackpos software target pos systems result attack 40 million customer credit debit card information 70 million addresses phone numbers names personal information stolen mainframes end 1800 u.s. target stores affected malware attack target however business affected software neiman marcus another well-known retailer affected well computer database said infected early july 2013 fully contained january 2014 breach believed involve 1.1 million credit debit cards span several months although credit debit card information compromised neiman marcus issued statement saying social security numbers birthdates affected among things companies ups wendy home depot also claimed affected blackpos well although reports state breaches caused malware virus two ways detect blackpos activity pos systems based malware works first strategy detect blackpos uses fact first 15 characters stolen track data always consists digits result limited amount combinations produced means predictable pattern followed addition encoding outputs 000 999 result string always begin “ m1 ” “ mf ” “ mh ” “ ml ” “ t1 ” “ tf ” “ th ” “ tl ” “ sh ” “ sl ” second way identify blackpos network activity dropping file specific location using fixed filename format example given security intelligence checks file path name matches format written \windows\twain_32\*_*_*_*.txt strategy demonstrated following opensignature rule alert tcp 445 msg kaptoxa file write detected flow to_server established content smb|a2| content \\|00|w|00|i|00|n|00|d|00|o|00|w|00|s|00|\\|00|t|00|w|00|a|00|i|00|n|00|_|00|3|00|2|00|\\ pcre /.*_.*_.*_ *\.|00|t|00|x|00|t/ sid:1 prevention according pci security council businesses keep malware prevention software updated frequently lower chance infection addition system logs regularly checked irregular activity within servers well monitoring large data files sent unknown sources companies also require login credentials updated regularly provide instructions create safer secure passwords | [
10309,
6091,
6797,
6360,
9242,
7515,
10364,
10392
] | Validation |
8,207 | 2 | UniSoft:unisoft unisoft corporation american software developer established 1981 originally focused development unix ports various computer architectures based millbrae california builds standardization conformance testing applications digital television market unisoft founded october 5 1981 emeryville california original business unix development soon recognized one early implementers unix emerging 16-bit microcomputer market 1989 completed 225 unix implementations various hardware platforms estimated 65 ports unisoft port version 7 unix first operating system sun microsystems sun-1 workstations servers also developed apple inc. unix variant a/ux apple macintosh ii 1991 company moved current offices millbrae california unisoft shifted focus television industry 1997 order address standards compliant software market works solely development testing broadcast tools digital television | [
9665,
9444,
4741,
10436,
6760,
3241,
9932,
1809,
5492
] | None |
8,208 | 8 | Web_Services_Inspection_Language:web services inspection language ws-inspection web service specification discovery documents developed joint effort microsoft ibm ws-inspection lists groups web services endpoints xml format currently standards used purpose microsoft disco expected ws-inspection eventually replace standards become universally accepted discovery standard web services | [
10020,
8203,
119,
3323,
479
] | None |
8,209 | 2 | Kurumin:kurumin kurumin linux live cd operating system based debian main features advanced hardware auto-detection inherited knoppix portuguese user interface main goal ease use release 7.0 size disk image approximately 603 mb version ng 8.06 based ubuntu 8.04 released june 24 2008 discontinued january 29 2009 name comes tupi word kurumi means boy usage letter k instead usual portuguese spelling curumi curumim brings line kde kurumin default desktop environment well knoppix late 2007 morimoto said project would halted scope reduced november 2008 project officially discontinued distribution sports open-source control center named clicaaki roughly clickhere features series shell scripts kommander-based panels magic icons install software included live cd icons one configure wide range networking options control center also provides access synaptic package manager clicaaki control panel shortcuts scripts also perform tasks like downloading installing free games apps divided categories short description work differences control panel also includes scripts downloading automatically configuring drivers 3d video cards ati nvidia difficult task novice users another feature distro support many winmodems including official packages drivers debian repository also scripts automate tasks compiling configuring necessary modules features kurumin spread gnu/linux operating system brazil level never seen | [
8837,
7435,
10127,
2321,
5397,
4887,
10394,
673,
3745,
10530,
9253,
10149,
11305,
7854,
7983,
2738,
4790,
439,
56,
59,
7483,
3903,
3649,
4673,
2375,
4039,
5067,
8907,
1110,
9693,
2914,
485,
3685,
9064,
4841,
6890,
7913,
7020,
10860,
7534,... | Test |
8,210 | 4 | Graph-based_access_control:graph-based access control graph-based access control gbac declarative way define access rights task assignments recipients content information systems access rights granted objects like files documents also business objects like account also used assignment agents tasks workflow environments organizations modeled specific kind semantic graph comprising organizational units roles functions well human automatic agents i.a persons machines compared approaches like role-based access control attribute-based access control main difference gbac access rights defined using organizational query language instead total enumeration foundations gbac go back research project named cocosorg configurable cooperation system english language please see bamberg university cocosorg organization represented semantic graph formal language used specify agents access rights workflow environment within c-org-project hof university institute information systems iisys approach extended features like separation duty access control virtual organizations subject-oriented access control graph-based access control consists two building blocks organizational graph divided type instance level instance level node types organizational units functional units agents basic structure organization defined using called structural relations define part relations functional units organizational units well mapping agents functional units additionally specific relationship types like deputyship informed_by types extended modeler relationships context sensitive usage predicates type level organizational structures described general manner consists organizational unit types functional unit types relationship types instance level type definitions used create new instances reuse organizational knowledge case exceptions reading see gbac query language used define agents certain characteristics abilities following table shows usage query language context access control matrix first query means managers working company six months read financial report well managers classified flag readfinancialreport daily financial report written manager controlling department clerks department enabled writefinancialreport==true gbac first implemented cocos environment within organizational server cocosorg c-org-project extended sophisticated features like separation duty access control distributed environments also cloud-based implementation ibm bluemix platform implementations server takes query client system resolves set agents set sent back calling client response clients file systems database management systems workflow management systems physical security systems even telephone servers | [
1792,
5573,
8838,
9958,
4912,
2737,
210,
10580,
7260
] | Train |
8,211 | 5 | Point-to-Point_Tunneling_Protocol:point-to-point tunneling protocol point-to-point tunneling protocol pptp obsolete method implementing virtual private networks pptp many well known security issues pptp uses tcp control channel generic routing encapsulation tunnel encapsulate ppp packets many modern vpns use various forms udp functionality pptp specification describe encryption authentication features relies point-to-point protocol tunneled implement security functionalities pptp implementation ships microsoft windows product families implements various levels authentication encryption natively standard features windows pptp stack intended use protocol provide security levels remote access levels comparable typical vpn products specification pptp published july 1999 rfc 2637 developed vendor consortium formed microsoft ascend communications today part nokia 3com others pptp proposed ratified standard internet engineering task force pptp tunnel instantiated communication peer tcp port 1723 tcp connection used initiate manage gre tunnel peer pptp gre packet format non standard including new acknowledgement number field replacing typical routing field gre header however normal gre connection modified gre packets directly encapsulated ip packets seen ip protocol number 47 gre tunnel used carry encapsulated ppp packets allowing tunnelling protocols carried within ppp including ip netbeui ipx microsoft implementation tunneled ppp traffic authenticated pap chap ms-chap v1/v2 pptp subject many security analyses serious security vulnerabilities found protocol known vulnerabilities relate underlying ppp authentication protocols used design mppe protocol well integration mppe ppp authentication session key establishment summary vulnerabilities eap-tls seen superior authentication choice pptp however requires implementation public-key infrastructure client server certificates may viable authentication option remote access installations networks use pptp apply additional security measures deemed completely inappropriate modern internet environment time means negating aforementioned benefits protocol point matter slice using pptp lose-lose scenario | [
10242,
10271,
9764,
2085,
2087,
3629,
562,
3133,
5181,
11332,
8265,
4687,
1618,
1623,
2136,
5721,
10341,
9318,
10344,
5749,
9860,
5254,
649,
10889,
9868,
6797,
3218,
9365,
11413,
2206,
3742,
9380,
9381,
3751,
3752,
4268,
10924,
10417,
3250,... | None |
8,212 | 1 | TippingPoint:tippingpoint trend micro tippingpoint ’ intrusion prevention system ips deals threat protection combining new application-level security practical user awareness inbound/outbound messaging inspection capabilities scalable ngips protects user ’ applications network data new threats tippingpoint ngips protects user ’ network sophisticated attacks tippingpoint functions part trend micro security previously tippingpoint division hp part enterprise security group american software company roots traced back 1999 focused network security products particularly intrusion prevention systems networks tippingpoint acquired 3com corporation 2005 run autonomous security-focused division 2005 2010 april 12 2010 hp completed acquisition 3com september 2011 tippingpoint within hp networking networking division hp transferred hp software division september 2013 hp announced entered next-generation firewall market new line tippingpoint firewalls new line extends tippingpoint existing intrusion prevention system ips appliances traditional stateful packet filtering application control company founded january 1999 name shbang texas co-founders john f. mchale kent savage first chief executive kenneth a. kalinoski business develop sell internet appliances may 1999 company changed name netpliance november released i-opener low-cost computer intended used browsing world wide web 2000 las vegas engineer ken segler discovered method install alternative operating system device 2001 company fined federal trade commission 100,000 sales billing practices 2002 company discontinued operations internet appliance business focus network security products new name tippingpoint ceo savage replaced chairman board mchale mchale stepped 2004 however remained chairman board position filled kip mcclanahan former ceo broadjump january 2005 tippingpoint acquired network equipment company 3com 442 million operating division 3com led james hamilton tippingpoint president later replaced alan kessler 3com acquired computer manufacturer hewlett-packard april 2010 approximately 2.7 billion oct 21 2015 tippingpoint acquired trend micro approximately 300 million | [
3619,
5636,
8229,
1638,
11100,
3944,
5384,
6765,
3214,
9424,
2258,
119,
1304,
5756,
127
] | None |
8,213 | 2 | SMP/E:smp/e smp/e system modification program/extended tool designed manage installation software products z/os system track modifications products smp/e manages multiple software versions helps apply patches updates ptfs facilitates orderly testing necessary reversion previous state allows trial run pseudo-installation verify actual installation work keeps audit security records assure approved software updates occur otherwise provides highly evolved centralized control software installation z/os although possible design ship software products install z/os without smp/e mainframe administrators prefer smp/e-enabled products least non-trivial packages using smp/e typically requires working knowledge job control language jcl although products supply sample jcl rigorous software management discipline associated smp/e typically extends product documentation well ibm vendors supplying standardized program directory manual software product precisely aligns smp/e work processes program directory provides detailed information pre-requisites co-requisites example use smp/e manage system updates helps ensure system integrity making sure system consistent state changes state properly audited previously called smp system modification program smp/e evolved osmp os maintenance program os/360 smp version 4 major revision new syntax smp/e introduced mvs introduced use vsam datasets concept extended ibm operating systems dos/vs maintain system history program mshp vm/sp ses virtual machine serviceability enhancements staged vmses/e ibm non-ibm software assigned least one seven character fmid function module id identifies piece software release number first fmid called base fmid example db2 version 9 base fmid hdb9910 separately installable features also fmids called dependent fmids relate way base product db2 english language panels version 9 dependent fmid jdb9910 software package composed elements individual components object files mod macros mac sample programs samp etc csi consolidated software inventory dataset containing information smp/e needs track contents distribution target libraries csi contains metadata identifying installed fmids elements id recent update pointers associated libraries sysmod system modification modification system includes sysmod assigned seven character sysmod id uniquely identify sysmod installed id recorded csi entry element added replaced called rmid replacement module id simple declarative language called mcs modification control statements provides information smp/e identifying sysmod providing information install sysmod prefixed number mcs statements example identify apar fix ptf supply sysmod id identify applicable fmid etc prerequisites prereqs sysmods required installed second installed corequisites coreqs two sysmods must installed together none installed without others sysmod supersedes sups another functionally replaces first prereq coreq sup information provided mcs requisite chain sequence sysmods directly indirectly identified requisites given sysmod example prereq b b prereq c b requisite chain c need installed c although necessarily separate run smp/e requisite chains frequently become extremely involved comprise hundreds sysmods holddata set mcs statements indicate specific sysmods contain errors require manual processing outside scope smp/e installed user required take action fix problem possible installing held sysmods smp/e manages two types libraries target libraries tlibs contain executable code information used run system originally limited number target libraries sys1.linklib executable programs sys1.maclib standard macros etc. 2012 software product usually set target libraries distribution libraries dlibs contain master copy element system product fmid set distribution libraries normally used smp/e libraries os/360 successors unlike directories unix usually contain one type format data software package may object libraries mod ispf panels pnl macro libraries mac many smp/e single large program runs batch job series ispf panels used interactively build smp/e job stream based user input one common sequence steps called receive-apply-accept commands used step smp/e receive command processes sysmods source outside smp previously might put tape distributed ibm roughly monthly recently might collection sysmods downloaded internet receive process uses mcs create entry csi sysmod marking status received stores mcs information actual sysmod data reject command used delete sysmods received status apply command installs one received sysmods appropriate target libraries sysmods applied selected various criteria example single sysmod selected sysmod id sysmods received group selected sourceid un-applied sysmods received applied requisite chains specified sysmods checked sysmods without proper requisites hold status superseded flagged errors installed commonly smp/e instructed also automatically apply requisites receive status minimize errors sysmods installed status changed applied csi apply check used check sysmods installed without actually performing installation restore command used remove applied sysmod accepted accept command installs sysmods permanently distribution libraries marks status accepted csi normally accept done sysmods known performing correctly next apply service way smp/e undo accept operation except delete installation libraries including csis start installation smp/e large complex program features datasets added every release major smp/e datasets | [
10760,
6680,
9245,
5155,
5670,
7722,
5677,
7217,
10817,
3667,
6227,
9324,
1138,
2168,
7293,
6797,
10900,
10394,
4775,
6828,
6325,
5819,
190,
1219,
4302,
1235,
2259,
6361,
8413,
741,
231,
2281,
9977,
6393,
11525,
7435,
7947,
9487,
788,
181... | Test |
8,214 | 6 | SquashFS:squashfs squashfs compressed read-only file system linux squashfs compresses files inodes directories supports block sizes 4 kib 1 mib greater compression several compression algorithms supported squashfs also name free software licensed gpl accessing squashfs filesystems squashfs intended general read-only file-system use constrained block-device memory systems e.g embedded systems low overhead needed squashfs used live cd versions arch linux debian fedora gentoo linux linux mint salix ubuntu embedded distributions openwrt dd-wrt router firmware also used chromecast system partitions android nougat often combined union mount filesystem unionfs overlayfs aufs provide read-write environment live linux distributions takes advantage squashfs high-speed compression abilities ability alter distribution running live cd distributions debian live mandriva one puppy linux salix live slax use combination appimage project aims create portable linux applications uses squashfs creating appimages snappy package manager also uses squashfs .snap file format squashfs also used linux terminal server project splashtop tools unsquashfs mksquashfs ported windows nt – windows 8.1 7-zip also supports squashfs squashfs initially maintained out-of-tree linux patch initial version 1.0 released 23 october 2002 2009 squashfs merged linux mainline part linux 2.6.29 process backward-compatibility code older formats removed since squashfs kernel space code maintained linux mainline tree user space tools remain project sourceforge page original version squashfs used gzip compression although linux kernel 2.6.34 added support lzma lzo compression linux kernel 2.6.38 added support lzma2 compression used xz linux kernel 3.19 added support lz4 compression support zstandard added linux kernel 4.14 linux kernel 2.6.35 added support extended file attributes | [
5120,
2564,
6669,
3598,
2064,
10257,
9236,
6677,
5142,
10774,
3611,
9244,
9249,
9762,
5158,
7225,
11323,
8772,
1109,
4708,
8298,
9836,
7789,
9333,
6263,
9335,
1150,
9343,
8837,
7818,
654,
2193,
2194,
2197,
2199,
11419,
6309,
1190,
5286,
1... | None |
8,215 | 4 | Your_PC_Protector:pc protector pc protector rogue antivirus program part windows police pro windows antivirus pro family program tries block type microsoft program anti-virus anti-malware suite program says protect computer program protect use firewall data like malware pc protector tries steal privacy asking credit card data use money much says spend anti-malware like malwarebytes antimalware might able remove virus pc protector uses windows filenames hide program name way track extra svchost.exe running user profile task manager processes may find svchost.exe common files may open pc protector would hijack windows registry modify web browser loading feature hijack registry make web page load saying unsafe web page show virus alert alert claims must purchase pc protector program also install browser helper object would hijack search results feature modifies windows host file dns hijacker dns hijacking pc protector secure purchase pc protector many different actions pc protector many different blocked executable .exe files pc protector blocks computer user using | [
7515,
9287,
8959
] | Validation |
8,216 | 0 | Name_resolution_(semantics_and_text_extraction):name resolution semantics text extraction semantics text extraction name resolution refers ability text mining software determine actual person actor object particular use name refers also referred entity resolution example text mining field software frequently needs interpret following text john gave edward book stood called john come back room sentences software must determine whether pronoun refers john edward first sentence software must also determine whether john referred second sentence john first sentence third person whose name also happens john examples apply almost languages english frequently type name resolution also used across documents example determine whether george bush referenced old newspaper article president united states george h. w. bush person george bush mentioned separate news article years later man running president george w bush many people may name analysts software must take account substantially information name determine whether two identical references george bush actually refer specific entity person name/entity resolution text extraction semantics notoriously difficult problem part many cases sufficient information make accurate determination numerous partial solutions exist rely specific contextual clues found data currently known general solution problem sometimes referred name disambiguation digital libraries author disambiguation examples software might provide name resolution benefits see also | [
8440,
2059,
5571
] | None |
8,217 | 1 | Apache_Phoenix:apache phoenix apache phoenix open source massively parallel relational database engine supporting oltp hadoop using apache hbase backing store phoenix provides jdbc driver hides intricacies nosql store enabling users create delete alter sql tables views indexes sequences insert delete rows singly bulk query data sql phoenix compiles queries statements native nosql store apis rather using mapreduce enabling building low latency applications top nosql stores phoenix began internal project company salesforce.com need support higher level well understood sql language originally open-sourced github 28 jan 2014 became top-level apache project 22 may 2014 apache phoenix included hortonworks distribution hdp 2.1 available part cloudera labs part hadoop ecosystem | [
9344,
10377,
8460,
7567,
1296,
6161,
1047,
1816,
11161,
6555,
8860,
6943,
3877,
10661,
11303,
5677,
10413,
1327,
7983,
4919,
5047,
4538,
1851,
6074,
7485,
7742,
9789,
7233,
6338,
4419,
1222,
1991,
4294,
7750,
5066,
8139,
9286,
11343,
4944,
... | Test |
8,218 | 0 | Verbmobil:verbmobil verbmobil long-term interdisciplinary language technology esp machine translation research project aim develop system recognize translate produce natural utterances thus translate spontaneous speech robustly bidirectionally german/english german/japanese verbmobil research carried 1993 2000 funded germany federal ministry research technology bundesministerium für forschung und technologie total 116m deutschmarks roughly 60m euros industry partners daimlerchrysler siemens philips contributed additional 52 million dm 26m euros verbmobil ii project tübingen university created semi-automatically annotated treebanks german japanese english spontaneous speech tüba-d/s contains ca 38,000 sentences 360,000 words tüba-e/s contains ca 30,000 sentences 310,000 words tüba-j/s contains ca 18,000 sentences 160,000 words | [
10610
] | Test |
8,219 | 9 | Active_Oberon:active oberon active oberon general purpose programming language developed 1996-1998 group around niklaus wirth jürg gutknecht swiss federal institute technology eth zürich extension programming language oberon extensions aim implementing active objects expressions parallelism compared predecessors oberon oberon-2 active oberon adds objects object-centered access protection local activity control system-guarded assertions preemptive priority scheduling changed syntax methods aka type-bound procedures oberon terminology objects may active means may threads processes operating system a2 aka bluebottle especially kernel synchronizes coordinates different active objects unlike java c objects may synchronized signals directly conditions simplifies development concurrent programs fork active oberon zonnon | [
6979,
8262,
4423,
5677,
11102,
8082,
9107,
6558,
7775
] | Test |
8,220 | 3 | CHAIN_(industry_standard):chain industry standard ceced convergence working group defined new platform called chain ceced home appliances interoperating network defines protocol interconnecting different home appliances single multibrand system allows control automation basic appliance-related services home e.g. remote control appliance operation energy load management remote diagnostics automatic maintenance support appliances downloading updating data programs services possibly internet | [] | None |
8,221 | 9 | Name_resolution_(programming_languages):name resolution programming languages programming languages name resolution resolution tokens within program expressions intended program components expressions computer programs reference variables data types functions classes objects libraries packages entities name context name resolution refers association not-necessarily-unique names intended program entities algorithms determine identifiers refer specific contexts part language definition complexity algorithms influenced sophistication language example name resolution assembly language usually involves single simple table lookup name resolution c++ extremely complicated involves programming languages name resolution performed either compile time runtime former called static name resolution latter called dynamic name resolution somewhat common misconception dynamic typing implies dynamic name resolution however static typing imply static name resolution example erlang dynamically typed static name resolution static name resolution catches compile time use variables scope preventing programmer errors languages dynamic scope resolution sacrifice safety flexibility typically set get variables scope runtime example python interactive repl however relying dynamic name resolution code discouraged python community feature also may removed later version python examples languages use static name resolution include c c++ e erlang haskell java pascal scheme smalltalk examples languages use dynamic name resolution include lisp dialects perl php python rebol tcl masking occurs identifier used different entities overlapping lexical scopes level variables rather names known variable shadowing identifier variable x masks identifier variable x two conditions met outer variable x said shadowed inner variable x example parameter foo shadows local variable foo common pattern name masking cause complications function overloading due overloading happening across scopes languages notably c++ thus requiring overloaded functions redeclared explicitly imported given namespace programming languages lexical scoping reflect variable names α-conversion α-renaming used make name resolution easy finding substitution makes sure variable name masks another name containing scope alpha-renaming make static code analysis easier since alpha renamer needs understand language scoping rules example code within point constructor class variables x shadowed local variables name might alpha-renamed new version masking immediately obvious uses correspond declarations | [
256,
386,
8582,
10510,
655,
9871,
10011,
10013,
545,
3876,
7847,
5677,
692,
8644,
8262,
7627,
8524,
477,
3554,
10083,
6502,
8041,
8554,
9454,
2045
] | Test |
8,222 | 3 | Macintosh_Quadra_840AV:macintosh quadra 840av macintosh quadra 840av personal computer designed manufactured sold apple computer inc. july 1993 july 1994 introduced alongside centris 660av av model numbers signifying video input output capabilities well enhanced audio 840av mini tower form factor quadra 800 faster motorola 68040 processor quadra 840av discontinued shortly introduction powerpc-based power macintosh power macintosh 8100/80av provided functionality form factor albeit significantly higher price point 7100/66av priced comparably 840av iivx-style desktop case time introduction 40 mhz motorola 68040 cpu interleaved ram made fastest macintosh available topping nominally higher-end quadra 950 quadra 800 7 mhz remains fastest quadra fastest 68k macintosh time since later high-end macintoshes powerpc-based power macintoshes 840av also mac use 40 mhz-clocked 68040 also sports faster 66.7 mhz dsp 3210 digital signal processor chip compared 55 mhz variant 660av on-board dsp primarily intended speed audio/video processing although mac programs made use due complexity programming 840av relative centris/quadra 660av marked number firsts macintosh family first macintoshes include on-board 16-bit 48 khz stereo audio playback recording capability well s-video composite video input output improve video playback two separate frame buffers used one standard graphics one specifically video enabled live video input displayed scalable window within macintosh user interface also first personal computers supported speech recognition plaintalk out-of-the-box apple geoport telecom adapter kit introduced av macs added many dsp-based telecommunication functions modem fax telephony quadra 840av came similar case earlier macintosh quadra 800 housing chassis power supply internal storage assemblies front rear panels changed power button moved back internally 840av significantly different apart faster processor logic board lacks 800 processor direct slot second adb port dav slot line nubus slot new geoport also unlike 800 8 mib fixed ram 840av memory simms reason minimum amount memory lower way 840av deals memory dram different machines generation quadra 700 800 950 4 8 16 32 mb 72-pin 60ns simms may installed 128 mb sizes mixed however quadra 840av support 1 mb 2 mb 64 mb simms 840av 660av first macintosh computers operate 32-bit mode times toggled back 24-bit mode may useful using early nubus cards conform 24-bit addressing new av machines first ship standard internal cd-rom drive earlier quadra centris models available built-in cd-rom drive optional extras operating system installation package came cd-rom rather series floppy disks whenever cd-rom drive included hidden quicktime video included original quadra 840av/centris 660av install first cd-rom shows jubilant cyclone tempest design team midst celebrating accomplishment video cyclone 840av prototype logic board shown logic board fitted 25 mhz 68040 number rework wires conspicuously daughter card nicknamed karma audio video input/output ports located notably audio video ports card front-facing positioned though would protrude opening lower front case easily accessible user according member team av card feature omitted enough room case coinciding introduction av macs apple introduced apple audiovision 14 display featuring easily accessible audio input audio output video input ports could fed adc adapter cable connected rear av ports av macs later power macintosh 6100 7100 8100 returned av card concept later abandoned 7500/8500 series machines re-introduced wings av personality card power macintosh g3 gossamer artemis machines stored inside spare rom space two jpeg images quadra 840av development team early quadra 840av logic boards featured 2 mb rom simm slot located ram simm slots originally planned 840av rom would contain bootable image system 7 within larger 4 mb rom space code-named supermario apple dropped idea 840av shipped later revisions 840av logic board included 2 mb rom soldered onto logic board | [
7697,
4114,
6165,
11289,
7706,
1057,
6183,
1576,
4139,
7211,
8253,
1090,
4180,
10838,
10840,
3167,
9312,
8806,
6258,
10357,
4220,
10365,
10878,
6783,
4741,
7305,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
3241,
6314,
7869,
8893,
... | Train |
8,223 | 3 | The_Flintstones_(1988_video_game):flintstones 1988 video game flintstones 1988 video game based 1960s television series flintstones game developed teque software development published grandslam entertainments game released europe 1988 amiga amstrad cpc atari st commodore 64 msx2 zx spectrum version sega master system released 1991 version flintstones features identical gameplay game contains four levels story begins fred flintstone finishing work rock quarry exclaiming yabba dabba doo game spoken line dialogue achieved speech synthesis remainder game character interactions done speech balloons fred wants bowl barney rubble bowling alley fred wife wilma tells must paint living room first arrival mother playing fred player must paint room also preventing young daughter pebbles scribbling walls player paintbrush squirrel stopping pebbles squirrel sometimes runs away must captured second level fred must race bowling alley avoiding rocks road hitting rock results vehicle losing wheel requiring player search replacement get back road third level played bowling game fred barney two players taking turns final level fred returns home discovers pebbles missing house finds climbing construction site competes barney rescue avoiding nuts bolts practice mode allows player explore area rendition theme music television series created ben daglish present throughout game except zx spectrum version games machine criticized bowling level long-winded restacking pins bowl – taking realism far magazine praised music noted graphics could challenge tv cartoon concluded patience flintstones could provide amusing generally tough challenge magazine noted atari st version identical amiga version except slightly poorer sound reviewing amstrad cpc commodore 64 zx spectrum versions games machine wrote version retained impressive cartoon-like graphics difficult gameplay earlier versions magazine wrote commodore version moves fair rate spectrum amstrad cpc versions slow enough cause frustration chris jenkins computer video games praised graphics sound considered bowling level poorest portion game jenkins concluded game polished professional product deserves seen john butters atari st user praised music sound called graphics immaculate concluded game soon became frustrating rather addictive andy richards also atari st user praised music sound gameplay graphics one reviewer st action wrote painting level clever infuriating taxing bowling scene could thoughtfully designed another reviewer st action wrote sluggish controls slow speed make painting scene unbelievably tedious sadly bowling scene anything worse lot time wasted player resets pins whilst barney bowls means sitting waiting turn nothing program recommend paul glancey zzap 64 wrote commodore 64 version poor sprites feeble backgrounds coupled grating rendition flintstones theme tune create bad impression frustrating controls painting section enthrall sub-games dated – paint collect game '88 – basic tenth frame bowling n't encourage player reach final section tv licences work rarely flintstones certainly n't paul sumner also zzap 64 wrote neither fred barney resembled television counterparts praised sound music sumner wrote gameplay little difficult first due mainly slightly unresponsive control perseverance reap reward though personally found game difficult warrant extensive play | [
10931,
3533,
9006
] | None |
8,224 | 4 | DNSBL:dnsbl domain name system-based blackhole list dnsbl real-time blackhole list rbl effort stop email spamming blacklist locations internet reputed send email spam locations consist ip addresses often used publish addresses computers networks linked spamming mail server software configured reject flag messages sent site listed one lists term blackhole list sometimes interchanged term blacklist blocklist dnsbl software mechanism rather specific list policy dozens dnsbls existence use wide array criteria listing delisting addresses may include listing addresses zombie computers machines used send spam internet service providers isps willingly host spammers sent spam honeypot system since creation first dnsbl 1998 operation policies lists frequently controversial internet advocacy occasionally lawsuits many email systems operators users consider dnsbls valuable tool share information sources spam others including prominent internet activists objected form censorship addition small number dnsbl operators target lawsuits filed spammers seeking lists shut first dnsbl real-time blackhole list rbl created 1997 first border gateway protocol bgp feed paul vixie dnsbl eric ziegast part vixie mail abuse prevention system maps dave rand abovenet first subscriber first version rbl published dnsbl rather list networks transmitted via bgp routers owned subscribers network operators could drop tcp/ip traffic machines used send spam host spam supporting services website inventor technique later commonly called dnsbl eric ziegast employed vixie enterprises term blackhole refers networking black hole expression link network drops incoming traffic instead forwarding normally intent rbl sites using would refuse traffic sites supported spam — whether actively sending spam ways address would listed rbl volunteers maps staff would attempt repeatedly contact persons responsible get problems corrected effort considered important blackholing network traffic also meant spammers spam supporting isps could delay put rbl long periods discussions went later rbl also released dnsbl form paul vixie encouraged authors sendmail mail software implement rbl support clients allowed mail software query rbl reject mail listed sites per-mail-server basis instead blackholing traffic soon advent rbl others started developing lists different policies one first alan brown open relay behavior-modification system orbs used automated testing discover list mail servers running open mail relays—exploitable spammers carry spam orbs controversial time many people felt running open relay acceptable scanning internet open mail servers could abusive 2003 number dnsbls came denial-of-service attacks dos since party admitted attacks discovered responsible purpose matter speculation however many observers believe attacks perpetrated spammers order interfere dnsbls operation hound shutting august 2003 firm osirusoft operator several dnsbls including one based spews data set shut lists suffering weeks near-continuous attack technical specifications dnsbls came relatively late rfc5782 uniform resource identifier uri dnsbl dnsbl lists domain names sometimes also ip addresses found clickable links contained body spams generally found inside legitimate messages uri dnsbls created determined much spam made past spam filters short time frame first use spam-sending ip address point sending ip address first listed major sending-ip-based dnsbls many cases elusive spams contain links domain names ip addresses collectively referred uris uri already spotted previously caught spam uri found non-spam e-mail therefore spam filter extracts uris message checks uri dnsbl spam blocked even sending ip spam yet listed sending ip dnsbl three major uri dnsbls oldest popular surbl surbl created volunteers surbl started second major uri dnsbl uribl 2008 another long-time surbl volunteer started another uri dnsbl ivmuri spamhaus project provides spamhaus domain block list dbl describe domains found spam messages dbl intended uribl rhsbl checked domains message envelope headers domains urls message bodies unlike uribls dbl lists domain names ip addresses since spamhaus provides lists ip addresses uri dnsbls often confused rhsbls right hand side bls different uri dnsbl lists domain names ips found body message rhsbl lists domain names used reply-to e-mail address rhsbls debatable effectiveness since many spams either use forged addresses use addresses containing popular freemail domain names gmail.com yahoo.com hotmail.com uri dnsbls widely used rhsbls effective used majority spam filters operate dnsbl requires three things domain host nameserver domain list addresses publish possible serve dnsbl using general-purpose dns server software however typically inefficient zones containing large numbers addresses particularly dnsbls list entire classless inter-domain routing netblocks large resource consumption using software designed role domain name server role-specific software applications designed specifically servers role dns blacklist hard part operating dnsbl populating addresses dnsbls intended public use usually specific published policies listing means must operated accordingly attain sustain public confidence mail server receives connection client wishes check client dnsbl let say dnsbl.example.net less following looking address dnsbl thus similar looking reverse-dns differences dnsbl lookup uses rather ptr record type uses forward domain dnsbl.example.net rather special reverse domain in-addr.arpa informal protocol addresses returned dnsbl queries match dnsbls return address 127.0.0.0/8 ip loopback network address 127.0.0.2 indicates generic listing addresses block may indicate something specific listing—that indicates open relay proxy spammer-owned host etc details see rfc 5782 uri dnsbl query rhsbl query fairly straightforward domain name query prepended dns list host follows dnslist.example.com dns list host example.net queried domain generally record returned name listed different dnsbls different policies dnsbl policies differ one another three fronts addition different types listed entities ip addresses traditional dnsbls host domain names rhsbls uris uribls wide range semantic variations lists listing means list maintainers divided issues whether listings seen statements objective fact subjective opinion lists best used result definitive taxonomy dnsbls names defined e.g yellow nobl varieties widespread use names widespread use recognized many spam control specialists end-users organizations concerns regarding concept dnsbls specifics created used criticisms include despite criticisms people object principle mail-receiving sites able reject undesired mail systematically one person john gilmore deliberately operates open mail relay gilmore accuses dnsbl operators violating antitrust law number parties electronic frontier foundation peacefire raised concerns use dnsbls isps one joint statement issued group including eff peacefire addressed stealth blocking isps use dnsbls spam-blocking techniques without informing clients spammers pursued lawsuits dnsbl operators similar grounds | [
1667,
8202,
7949,
914,
3731,
5012,
8341,
10263,
8093,
5407,
5536,
10275,
2085,
9256,
8747,
4272,
8373,
182,
9909,
827,
3645,
1472,
10434,
11461,
4294,
4295,
10696,
3145,
3018,
5835,
5199,
10578,
7764,
1495,
3032,
5591,
9053,
2527,
9824,
6... | Test |
8,225 | 9 | LiveCode:livecode livecode formerly revolution metacard cross-platform rapid application development runtime environment inspired hypercard features transcript formerly metatalk programming language belongs family xtalk scripting languages like hypercard hypertalk environment introduced 2001 revolution development system based metacard engine technology runtime revolution later acquired metacard corporation 2003 platform macworld annual editor choice award best development software 2004 revolution renamed livecode fall 2010 livecode developed sold runtime revolution ltd. based edinburgh scotland march 2015 company renamed livecode ltd. unify company name product april 2013 free/open source version 'livecode community edition 6.0 published successful crowdfunding campaign kickstarter code base re-licensed made available free open source software version april 2013 livecode runs ios android os x windows 95 windows 10 raspberry pi several variations unix including linux solaris bsd used mobile desktop server/cgi applications ios iphone ipad version released december 2010 first version deploy web released 2009 widely used hypercard/hypertalk clone one runs major operating systems developer release v.8 announced new york march 12 2015 major enhancement product includes new separate development language known livecode builder capable creating new object classes called widgets earlier versions set object classes fixed could enhanced via use ordinary procedural languages c. new language runs ide departure transitional x-talk paradigm permits typing variables two environments fully integrated apart ability create new objects development livecode proceeds normal way within established ide second crowdfunding campaign bring html5 livecode reached funding goals nearly 400,000 usd july 31 2014 livecode developer release 8.0 dp4 august 31 2015 first include standalone deployment option html5 livecode software creates applications run many supported environments using compile-free workflow computer code livecode play across multiple devices platforms livecode uses high level english-like programming language called transcript dynamically typed transcript compile-free workflow generates code self-documenting easy casual programmers comprehend example following script executed system clock 9:00:00 ten lines loaded first text field denoted field 1 seen notes livecode natural english-like syntax easy beginners learn variables typeless typed compile time based purely context makes language simple read maintain relatively minimal loss speed language contains advanced features including associative arrays regular expressions multimedia support variety sql databases tcp/ip libraries livecode engine supports several common image formats including bmp png gif jpeg anti-aliased vector graphics html-style text hyperlinks chained behaviors embedded web browsers accessing higher-level functions designed straightforward livecode around 1,900 built-in language terms keywords may extended external libraries written c lower level languages livecode project files binary-compatible across platforms inherit platform look-and-feel behaviors buttons scroll bars progress bars menus behave expected target platform without intervention part one authoring livecode application compiling livecode standalone produces single executable file minimum size ~1.5mb platform targeted separate runtime necessary wikipedia article hypercard contains detailed discussion basics similar development environment scripting language modern livecode vast superset former hypercard yet retains simplicity livecode includes number features missing original hypercard program including multiple platform deployment communication external devices many fundamental language extensions livecode toolkit compared hypercard ability access internet-based text media resources allows creation internet-enabled desktop applications ios android targets available versions note complete linux requirements 4.5.x-6.x following | [
9185,
9345,
4486,
8262,
4042,
5546,
4844,
5612,
6797,
7983,
6160,
10413,
11219,
5492,
5588,
11221,
823,
1849
] | None |
8,226 | 9 | LFE_(programming_language):lfe programming language lisp flavored erlang lfe functional concurrent garbage collected general-purpose programming language lisp dialect built core erlang erlang virtual machine beam lfe builds erlang provide lisp syntax writing distributed fault-tolerant soft real-time non-stop applications lfe also extends erlang support metaprogramming lisp macros improved developer experience feature-rich read–eval–print loop repl lfe actively supported recent releases erlang oldest version erlang supported r14 initial work lfe began 2007 robert virding started creating prototype lisp running erlang work focused primarily parsing exploring implementation might look like version control system used time tracking exact initial dates somewhat problematic virding announced first release lfe erlang questions mail list march 2008 release lfe limited handle recursive codice_1s codice_2s codice_3 codice_4 also support lisp shell initial development lfe done version r12b-0 erlang dell xps laptop robert virding stated several reasons started lfe programming language like lisp lfe expression-oriented language unlike non-homoiconic programming languages lisps make little syntactic distinction expressions statements code data written expressions lfe brought homoiconicity erlang vm lfe list data type written elements separated whitespace surrounded parentheses example list whose elements integers atom values implicitly typed respectively two integers lisp-specific data type called symbolic atom need declared seen example lfe expressions written lists using prefix notation first element list name form i.e. function operator macro remainder list arguments lfe-erlang operators used way expression evaluates 42 unlike functions erlang lfe arithmetic operators lisp variadic n-ary able take number arguments lfe lambda like common lisp also however lambda-match account erlang pattern-matching abilities anonymous function calls section represent complete comparison erlang lfe give taste erlang lfe erlang lfe idiomatic functional style erlang lfe erlang lfe using cons literal instead constructor form erlang lfe erlang lfe calls erlang functions take form module function arg1 ... argn using recursion define ackermann function defun ackermann composing functions message-passing erlang light-weight processes defmodule messenger-back multiple simultaneous http requests | [
10752,
11269,
2056,
9224,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
5677,
3119,
9780,
2105,
3132,
6717,
8258,
8771,
8262,
1613,
9299,
10841,
3675,
7267,
2660,
8293,
2666,
5751,
7805,
9345,
1159,
9865,
9877,
5803,
2225,
6840,
7867,
4... | Test |
8,227 | 8 | Windows_CardSpace:windows cardspace windows cardspace codenamed infocard microsoft now-canceled client software identity metasystem cardspace instance class identity client software called identity selector cardspace stores references users digital identities presenting users visual information cards cardspace provides consistent ui designed help people easily securely use identities applications web sites accepted resistance phishing attacks adherence kim cameron 7 laws identity goals design information card-enabled application website wishes obtain information user application website requests particular set claims user cardspace ui appears switching display cardspace service displays user stored identities visual i-cards user selects infocard use cardspace software contacts issuer identity obtain digitally signed xml token contains requested information cardspace also allows users create personal also known self-issued information cards contain one 14 fields identity information full name address etc transactions may require managed infocard issued third party identity provider makes claims person behalf bank employer government agency windows cardspace built top web services protocol stack open set xml-based protocols including ws-security ws-trust ws-metadataexchange ws-securitypolicy means technology platform supports ws-* protocols integrate cardspace order accept information cards website developer simply needs declare html codice_1 tag specifies claims website demanding user implement code decrypt returned token extract claim values identity provider wants issue tokens must provide means user obtain managed card provide security token service sts handles ws-trust requests returns appropriate encrypted signed token identity provider wish build sts able obtain one variety vendors including pingidentity bmc sun microsystems microsoft siemens well companies organizations cardspace identity metasystem upon based token-format-agnostic cardspace compete directly internet identity architectures like openid saml ways three approaches identity seen complementary indeed information cards used today signing openid providers windows live id accounts saml identity providers kinds services ibm novell planned support higgins trust framework provide development framework includes support information cards web services protocol stack thus including cardspace within broader extensible framework also supporting identity-related technologies saml openid microsoft initially shipped windows cardspace .net framework 3.0 runs windows xp windows server 2003 windows vista installed default windows vista well windows 7 available free download xp server 2003 via windows update updated version cardspace shipped .net framework 3.5 windows 7 cardspace technology used new credential manager management storage saved user credentials february 15 2011 microsoft announced windows cardspace 2.0 would shipped microsoft currently working replacement called u-prove | [
10243,
11270,
5643,
4624,
10769,
9234,
1043,
537,
540,
3102,
1055,
9762,
2083,
8740,
1577,
10281,
4143,
9263,
11316,
1077,
2101,
6709,
8246,
10812,
3648,
4674,
10310,
1098,
7754,
10828,
4173,
4174,
9808,
4178,
83,
9813,
10839,
603,
9819,
... | None |
8,228 | 6 | Captive_NTFS:captive ntfs captive ntfs discontinued open-source project within linux programming community started jan kratochvíl driver wrapper around original microsoft windows ntfs file system driver using parts reactos code taking approach captive ntfs aimed provide safe write support ntfs partitions release ntfs-3g free ntfs driver full write support january 26 2006 jan kratochvíl released version 1.1.7 package version restores compatibility recent linux kernels replacing obsolete lufs linux userland file system module fuse file system userspace linux 2.6.14 included official linux kernel captive ntfs requires ntfs.sys distributed legal reasons either obtained installed windows system computers ntfs partitions likely extracted certain microsoft service packs | [
9762,
3975,
6797,
1617,
2193,
823
] | None |
8,229 | 3 | NonStop_(server_computers):nonstop server computers nonstop series server computers introduced market 1976 tandem computers inc. beginning nonstop product line followed hewlett-packard integrity nonstop product line extension nonstop systems based integrated hardware/software stack hp also developed nonstop os operating system nonstop systems extent self-healing circumvent single points failure equipped almost redundant components mainline component fails system automatically falls back backup systems often used banks stock exchanges telecommunication providers enterprises requiring extremely high uptime originally introduced 1976 tandem computers inc. line later owned compaq 1997 hewlett-packard since 2003 2005 current product line hp integrity nonstop tns/e servers based intel itanium microprocessors introduced 2014 first systems nonstop x tns/x running intel x86 chip introduced early nonstop applications specifically coded fault-tolerance requirement removed 1983 introduction transaction monitoring facility tmf handles various aspects fault tolerance system level nonstop os message-based operating system designed fault tolerance works process pairs ensures backup processes redundant cpus take case process cpu failure data integrity maintained takeovers transactions data lost corrupted operating system whole branded nonstop os includes guardian layer low-level component operating system so-called oss personality runs atop layer implements unix-like interface components os use operating system application designed support fault tolerant hardware operating system continually monitors status components switching control necessary maintain operations also features designed software allow programs written continuously available programs accomplished using pair processes one process performs primary processing serves hot backup receiving updates data whenever primary reaches critical point processing primary stop backup steps resume execution using current transaction systems support relational database management systems like nonstop sql hierarchical databases enscribe hp integrity nonstop computers line fault-tolerant server computers based intel itanium processor platform optimized transaction processing average availability levels 99.999 observed nonstop systems feature massively parallel processing mpp architecture provide linear scalability cpu systems expanded 4000 cpus runs copy os shared-nothing architecture — share nothing arrangement also known loosely coupled multiprocessing diminishing returns occur processors added see amdahl law due integrated hardware/software stack single system image even largest configurations system management requirements nonstop systems rather low deployments single production server complex server farm customers also backup server remote location disaster recovery standard products keep data production backup server sync hence fast takeover data loss also disaster situation production server disabled destroyed hp also developed data warehouse business intelligence server line hp neoview based nonstop line acted database server providing nonstop os nonstop sql lacked transaction processing functionality original nonstop systems line retired longer marketed january 24 2011 | [
11136,
2179,
5384,
6281,
3214,
785,
5523,
8212,
10518,
1304,
5658,
5029,
7983,
11184,
1722,
2623,
6722,
5571,
709,
1606,
9285,
7243,
9677,
3281,
1874,
2258,
4817,
8282,
11100,
1638,
6247,
6252,
6765,
5999,
11505,
5756
] | Validation |
8,230 | 1 | Identity_column:identity column identity column column also known field database table made values generated database much like autonumber field microsoft access sequence oracle concept important database science many rdbms systems implement type generated key although terminology identity column differs primary key values managed server usually modified many cases identity column used primary key however always case common misconception identity column enforce uniqueness however case want enforce uniqueness column must include appropriate constraint microsoft sql server options seed starting value increment default seed increment 1. often useful necessary know identity value generated insert command microsoft sql server provides several functions identity provides last value generated current connection current scope ident_current tablename provides last value generated regardless connection scope created example | [
7523,
10628,
2632,
10737,
2901,
11030
] | Test |
8,231 | 3 | Branch_predictor:branch predictor computer architecture branch predictor digital circuit tries guess way branch e.g if–then–else structure go known definitively purpose branch predictor improve flow instruction pipeline branch predictors play critical role achieving high effective performance many modern pipelined microprocessor architectures x86 two-way branching usually implemented conditional jump instruction conditional jump either taken continue execution first branch code follows immediately conditional jump taken jump different place program memory second branch code stored known certain whether conditional jump taken taken condition calculated conditional jump passed execution stage instruction pipeline see fig 1 without branch prediction processor would wait conditional jump instruction passed execute stage next instruction enter fetch stage pipeline branch predictor attempts avoid waste time trying guess whether conditional jump likely taken taken branch guessed likely fetched speculatively executed later detected guess wrong speculatively executed partially executed instructions discarded pipeline starts correct branch incurring delay time wasted case branch misprediction equal number stages pipeline fetch stage execute stage modern microprocessors tend quite long pipelines misprediction delay 10 20 clock cycles result making pipeline longer increases need advanced branch predictor first time conditional jump instruction encountered much information base prediction branch predictor keeps records whether branches taken taken encounters conditional jump seen several times base prediction history branch predictor may example recognize conditional jump taken often taken every second time branch prediction branch target prediction branch prediction attempts guess whether conditional jump taken branch target prediction attempts guess target taken conditional unconditional jump computed decoding executing instruction branch prediction branch target prediction often combined circuitry static prediction simplest branch prediction technique rely information dynamic history code executing instead predicts outcome branch based solely branch instruction early implementations sparc mips two first commercial risc architectures used single-direction static branch prediction always predict conditional jump taken always fetch next sequential instruction branch jump evaluated found taken instruction pointer get set non-sequential address cpus evaluate branches decode stage single cycle instruction fetch result branch target recurrence two cycles long machine always fetches instruction immediately taken branch architectures define branch delay slots order utilize fetched instructions advanced form static prediction presumes backward branches taken forward branches backward branch one target address lower address technique help prediction accuracy loops usually backward-pointing branches taken often taken processors allow branch prediction hints inserted code tell whether static prediction taken taken intel pentium 4 accepts branch prediction hints feature abandoned later intel processors static prediction used fall-back technique processors dynamic branch prediction dynamic predictors sufficient information use motorola mpc7450 g4e intel pentium 4 use technique fall-back static prediction decisions made compile time execution program dynamic branch prediction uses information taken taken branches gathered run-time predict outcome branch using random pseudorandom bit pure guess would guarantee every branch 50 correct prediction rate improved worsened reordering instructions simplest static prediction assume take compilers reorder instructions get better 50 correct prediction also would make timing much nondeterministic superscalar processors mips r8000 alpha 21264 alpha 21464 ev8 fetch line instructions pointer next line next-line predictor handles branch target prediction well branch direction prediction next-line predictor points aligned groups 2 4 8 instructions branch target usually first instruction fetched initial instructions fetched wasted assuming simplicity uniform distribution branch targets 0.5 1.5 3.5 instructions fetched discarded respectively since branch generally last instruction aligned group instructions taken branch delay slot discarded assuming uniform distribution branch instruction placements 0.5 1.5 3.5 instructions fetched discarded discarded instructions branch destination lines add nearly complete fetch cycle even single-cycle next-line predictor 1-bit saturating counter essentially flip-flop records last outcome branch simple version dynamic branch predictor possible although accurate 2-bit saturating counter state machine four states branch evaluated corresponding state machine updated branches evaluated taken change state toward strongly taken branches evaluated taken change state toward strongly taken advantage two-bit counter scheme one-bit scheme conditional jump deviate twice done past prediction changes example loop-closing conditional jump mispredicted rather twice original non-mmx intel pentium processor uses saturating counter though imperfect implementation spec'89 benchmarks large bimodal predictors saturate 93.5 correct every branch maps unique counter predictor table indexed instruction address bits processor fetch prediction every instruction instruction decoded two-level branch predictor also referred correlation-based branch predictor uses two-dimensional table counters also called pattern history table table entries two-bit counters codice_1 statement executed three times decision made third execution might depend upon whether previous two taken scenarios two-level adaptive predictor works efficiently saturation counter conditional jumps taken every second time regularly recurring pattern predicted well saturating counter two-level adaptive predictor remembers history last n occurrences branch uses one saturating counter possible 2 history patterns method illustrated figure 3 consider example n 2 means last two occurrences branch stored two-bit shift register branch history register four different binary values 00 01 10 11 zero means taken one means taken pattern history table contains four entries per branch one 2 4 possible branch histories entry table contains two-bit saturating counter type figure 2 branch branch history register used choosing four saturating counters use history 00 first counter used history 11 last four counters used assume example conditional jump taken every third time branch sequence 001001001 ... case entry number 00 pattern history table go state strongly taken indicating two zeroes comes one entry number 01 go state strongly taken indicating 01 comes zero case entry number 10 entry number 11 never used never two consecutive ones general rule two-level adaptive predictor n-bit history predict repetitive sequence period n-bit sub-sequences different advantage two-level adaptive predictor quickly learn predict arbitrary repetitive pattern method invented t.-y yeh yale patt university michigan since initial publication 1991 method become popular variants prediction method used modern microprocessors local branch predictor separate history buffer conditional jump instruction may use two-level adaptive predictor history buffer separate conditional jump instruction pattern history table may separate well may shared conditional jumps intel pentium mmx pentium ii pentium iii local branch predictors local 4-bit history local pattern history table 16 entries conditional jump spec'89 benchmarks large local predictors saturate 97.1 correct global branch predictor keep separate history record conditional jump instead keeps shared history conditional jumps advantage shared history correlation different conditional jumps part making predictions disadvantage history diluted irrelevant information different conditional jumps uncorrelated history buffer may include bits branch many branches may use two-level adaptive predictor scheme better saturating counter scheme large table sizes rarely good local prediction history buffer must longer order make good prediction size pattern history table grows exponentially size history buffer hence big pattern history table must shared among conditional jumps two-level adaptive predictor globally shared history buffer pattern history table called gshare predictor xors global history branch pc gselect concatenates global branch prediction used amd processors intel pentium core core 2 silvermont-based atom processors alloyed branch predictor combines local global prediction principles concatenating local global branch histories possibly bits program counter well tests indicate via nano processor may using technique agree predictor two-level adaptive predictor globally shared history buffer pattern history table additional local saturating counter outputs local global predictors xored give final prediction purpose reduce contentions pattern history table two branches opposite prediction happen share entry pattern history table agree predictor used first version intel pentium 4 later abandoned hybrid predictor also called combined predictor implements one prediction mechanism final prediction based either meta-predictor remembers predictors made best predictions past majority vote function based odd number different predictors scott mcfarling proposed combined branch prediction 1993 paper spec'89 benchmarks predictor good local predictor predictors like gshare use multiple table entries track behavior particular branch multiplication entries makes much likely two branches map table entry situation called aliasing turn makes much likely prediction accuracy suffer branches multiple predictors beneficial arrange predictor different aliasing patterns likely least one predictor aliasing combined predictors different indexing functions different predictors called gskew predictors analogous skewed associative caches used data instruction caching conditional jump controls loop best predicted special loop predictor conditional jump bottom loop repeats n times taken n-1 times taken conditional jump placed top loop taken n-1 times taken conditional jump goes many times one way way detected loop behavior conditional jump predicted easily simple counter loop predictor part hybrid predictor meta-predictor detects whether conditional jump loop behavior indirect jump instruction choose among two branches processors specialized indirect branch predictors newer processors intel amd predict indirect branches using two-level adaptive predictor kind instruction contributes one bit history buffer zec12 later z/architecture processors ibm support instruction preload branch predictor entry given instruction branch target address constructed adding contents general-purpose register immediate displacement value processors without mechanism simply predict indirect jump go target last time function normally return called return instruction indirect jump reads target address call stack many microprocessors separate prediction mechanism return instructions mechanism based so-called return stack buffer local mirror call stack size return stack buffer typically 4 16 entries trade-off fast branch prediction good branch prediction sometimes dealt two branch predictors first branch predictor fast simple second branch predictor slower complicated bigger tables override possibly wrong prediction made first predictor alpha 21264 alpha ev8 microprocessors used fast single-cycle next-line predictor handle branch target recurrence provide simple fast branch prediction next-line predictor inaccurate branch resolution recurrence takes long cores two-cycle secondary branch predictors override prediction next-line predictor cost single lost fetch cycle intel core i7 two branch target buffers possibly two branch predictors machine learning branch prediction using lvq multi-layer perceptrons called neural branch prediction proposed lucian vintan lucian blaga university sibiu one year later developed perceptron branch predictor neural branch predictor research developed much daniel jimenez 2001 first perceptron predictor presented feasible implement hardware first commercial implementation perceptron branch predictor amd piledriver microarchitecture main advantage neural predictor ability exploit long histories requiring linear resource growth classical predictors require exponential resource growth jimenez reports global improvement 5.7 mcfarling-style hybrid predictor also used gshare/perceptron overriding hybrid predictors main disadvantage perceptron predictor high latency even taking advantage high-speed arithmetic tricks computation latency relatively high compared clock period many modern microarchitectures order reduce prediction latency jimenez proposed 2003 fast-path neural predictor perceptron predictor chooses weights according current branch path rather according branch pc many researchers developed concept a. seznec m. monchiero d. tarjan k. skadron v. desmet akkary et al. k. aasaraai michael black etc state-of-the-art branch predictors using perceptron predictor see intel championship branch prediction competition intel already implements idea one ia-64 simulators 2003 amd ryzen multi-core processor infinity fabric samsung exynos processor include perceptron based neural branch predictor ibm 7030 stretch designed late 1950s pre-executes unconditional branches conditional branches depended index registers conditional branches first two production models implemented predict untaken subsequent models changed implement predictions based current values indicator bits corresponding today condition codes stretch designers considered static hint bits branch instructions early project decided misprediction recovery provided lookahead unit stretch part stretch reputation less-than-stellar performance blamed time required misprediction recovery subsequent ibm large computer designs use branch prediction speculative execution ibm 3090 1985 two-bit predictors introduced tom mcwilliams curt widdoes 1977 lawrence livermore national lab s-1 supercomputer independently jim smith 1979 cdc microprogrammed processors popular 1960s 1980s beyond took multiple cycles per instruction generally require branch prediction however addition ibm 3090 several examples microprogrammed designs incorporated branch prediction burroughs b4900 microprogrammed cobol machine released around 1982 pipelined used branch prediction b4900 branch prediction history state stored back in-memory instructions program execution b4900 implements 4-state branch prediction using 4 semantically equivalent branch opcodes represent branch operator type opcode used indicated history particular branch instruction hardware determines branch prediction state particular branch needs updated rewrites opcode semantically equivalent opcode hinted proper history scheme obtains 93 hit rate others granted scheme vax 9000 announced 1989 microprogrammed pipelined performs branch prediction first commercial risc processors mips r2000 r3000 earlier sparc processors trivial not-taken branch prediction use branch delay slots fetched one instruction per cycle execute in-order performance loss later r4000 uses trivial not-taken branch prediction loses two cycles taken branch branch resolution recurrence four cycles long branch prediction became important introduction pipelined superscalar processors like intel pentium dec alpha 21064 mips r8000 ibm power series processors rely one-bit simple bimodal predictors dec alpha 21264 ev6 uses next-line predictor overridden combined local predictor global predictor combining choice made bimodal predictor amd k8 combined bimodal global predictor combining choice another bimodal predictor processor caches base choice bimodal predictor counters bits l2 cache otherwise used ecc result effectively large base choice predictor tables parity rather ecc instructions l2 cache parity design sufficient since instruction suffering parity error invalidated refetched memory alpha 21464 ev8 cancelled late design minimum branch misprediction penalty 14 cycles use complex fast next-line predictor overridden combined bimodal majority-voting predictor majority vote bimodal two gskew predictors 2018 catastrophic security vulnerability called spectre made public google project zero researchers affecting virtually modern cpus vulnerability involves extracting private data leftover data caches branch mispredictions | [
5636,
7173,
9739,
8716,
2066,
7699,
2071,
5655,
27,
10779,
10781,
31,
6181,
10796,
2094,
3630,
4144,
6705,
7218,
4664,
5176,
2623,
2113,
7234,
3142,
2638,
10837,
1122,
3175,
6250,
6252,
6253,
8815,
6256,
1137,
3185,
5235,
630,
8822,
3194,... | Test |
8,232 | 3 | Snatcher_(video_game):snatcher video game snatcher cyberpunk graphic adventure game developed published konami written designed hideo kojima first released 1988 pc-8801 msx2 japan snatcher set future east asian metropolis humanoid robots dubbed snatchers discovered killing humans replacing society player takes role gillian seed amnesiac joins snatcher hunting agency hoping help remember past gameplay takes place primarily menu-based interface player choose examine items search rooms speak characters explore semi-open world perform actions kojima wanted snatcher cinematic feel setting story heavily influenced science fiction films especially blade runner cyberpunk works akira terminator development pc versions took twice long average game time even kojima asked trim half initial story game released positive reviews poor sales garnered cult following remade role-playing game called sd snatcher msx2 1990 followed remake original adventure game using cd-rom technology released pc engine super cd-rom² system 1992 looking provide interactive experience gamers west konami developed sega cd version snatcher specifically north america europe 1994 although released poor commercial reception sega cd version received mostly positive reviews cinematic presentation mature themes uncommon games time snatcher retrospectively acclaimed one best adventure cyberpunk games time identified foundation themes kojima explored later metal gear series game significant inspiration goichi suda worked kojima produce radio drama prequel sdatcher english version snatcher never rereleased despite desire fans snatcher graphic adventure game visual novel elements player takes role protagonist gillian seed investigates hunts snatchers dangerous humanoid robots disguised humans roaming neo kobe city game visuals static images animations display top screen point-and-click interface actions made text menu commands move look investigate game puzzles dialogue trees simple lending emphasis linear storytelling sometimes character panels shown main graphics window conversations convey facial expressions game allows exploration semi-open world handful action segments player shoots enemies dispersed across 3x3 grid sega cd version supports justifier light gun packaged lethal enforcers segments snatcher set mid-21st century fifty years biological weapon known lucifer-alpha killed much world population neo kobe city metropolis artificial island eastern asia humanoid robots dubbed snatchers recently discovered killing humans donning skin disguise replacing society neo kobe government closes city outside world establishes junker task force hunt snatchers player takes role gillian seed amnesiac remember past somehow related snatchers starts working junker hopes hunting snatchers bring past light gillian seed arrives junker headquarters introduced chief cunningham receives robot navigator named metal gear junker engineer harry benson metal gear receives distress call jean-jack gibson junker agent gillian travels metal gear find pair snatchers killed try pursue snatchers forced make quick escape factory explodes gillian begins searching identity snatchers murdered jean-jack searching house speaking informant gillian identifies pair suspects hunting snatchers nearly killed saved random hajile snatcher bounty hunter random joins gillian metal gear travel hospital jean-jack identified suspicious investigation learn abandoned several years harbors secret basement find skeletons snatcher victims among find chief cunningham meaning junker chief snatcher snatchers attack group random distracts allow gillian metal gear escape back junker headquarters gillian kills chief speaks harry briefly dies mortally wounded chief immediately gillian receives call estranged wife jamie telling held kremlin gillian metal gear travel abandoned church resembling kremlin find jamie held captive scientist named elijah modnar explains gillian past father jamie involved secret experiment taken soviet union 50 years prior cold war create snatchers designed kill replace world leaders giving soviets power gillian cia agent spying project married jamie child harry benson gillian jamie placed cryogenic sleep elijah released lucifer-alpha atmosphere pair saved army lost memories due extended period time frozen become corrupt power elijah reveals intends snatchers wipe replace humanity proof mankind follies also reveals random anti-snatcher created late father based elijah appearance memories presents deactivated body point random reactivates holds elijah bay allowing gillian jamie escape metal gear activates orbital weapon destroys snatcher base killing elijah random learned larger snatcher factory moscow gillian prepares embark mission hope finally destroying snatcher menace rekindling romance jamie snatcher created hideo kojima working konami heavily influenced blade runner 1982 works cinema wanted develop game similar style game pitched cyberpunk adventure kojima found difficult explain meaning cyberpunk konami trademark department phone game originally titled junker name sounded similar existing mahjong game title new order also considered kojima like final name previous game metal gear 1987 also named enemy game development began kojima character designer tomiharu kinoshita treated project like making film anime rather game expanded form small team konami half size needed typical famicom game allowed work closely quickly game filled science fiction culture references skirt copyright laws kojima told kinoshita make gillian similar katsuhiro otomo director science fiction film akira 1988 team never aimed game mature atmosphere naturally progressed direction addition fourth wall breaking dialogue game kojima wanted print secret message heat-activated scent floppy disks could noticed warming disk drive konami approve idea year half snatcher half completed originally kojima planned six chapters told trim two team wanted create third chapter already allowed development schedule forced end game cliffhanger development took two three times longer average game difficulties memory constraints prompted staff take break development time kojima began explore concepts later game policenauts 1994 originally snatcher going pc-8801 exclusive also developed msx2 request konami pc-8801 version supports fm stereo sounds via pc-8801 sound board ii expansion card msx2 version came special cartridge provided expanded soundscape beyond platform default capabilities extra ram featuring different music track arrangements expansion cartridge raised price msx2 version beyond pc-8801 version reverse platform typically cheaper retail game pricing quantity music sound greater games time required larger usual sound team neither platform capable accurately synthesizing speech sound effects used represent character dialogue snatcher released pc-8801 november 26 1988 msx2 december year players began asking home console version soon release game large required several floppy disks cd-rom systems considered opposed systems ran rom cartridges pc engine super cd-rom² system available chosen host snatcher console port port first time development team worked cd technology team added third act version decision criticized internally others believed game already long enough using cd technology enabled add recorded speech high quality background music artist satoshi yoshioka created graphics version kojima wanted visuals appear cinematic possible yoshioka pulled inspiration blade runner terminator 1984 alien 1979 replicate hollywood-style special effects used custom drawing application konami create character graphics including facial expressions conversations found gillian expressions difficult animate due complexities characterization trial version called pilot disk released august 7 1992 covers beginning first act also contains supplemental content character introductions preview trailer select music tracks full version released october 23 1992 reportedly sold well pc engine game releasing first game sega cd lethal enforcers 1992 konami wanted bring interactive experience system western players considered making game full motion video like night trap 1992 thought may difficult ultimately decided localize port snatcher also gave snatcher developers opportunity improve upon pc engine version still completely satisfied although sega cd could display 64 colors simultaneously compared pc engine 256 team used software techniques increase 112 modified palettes compromise several scenes censored otherwise altered sega cd release woman breasts covered 14-year-old girl shown standing naked shower obscured age changed 18 options allowed gillian engage behaviors related sexual harassment removed toned allowed sniff panties stare breasts audio robot becomes aroused watching pornographic film cut entirely violence altered except one scene partially dead dog twitching innards made completely dead twitching fearing copyright issues united states clientele bar changed kamen rider alien characters konami characters feeling third act movie-like konami added interactivity additional forks choices additionally player graded well solved mysteries dates events game also moved five years still occur near future compensate late release game translated scott hards supervision jeremy blaustein konami japan translation took two three months seven voice actors recorded two half hours dialogue 26 different characters large amount text included game translation expensive konami felt difficult part porting process according blaustein kojima involved sega cd port likely working policenauts time snatcher released december 1994 europe january 1995 north america according blaustein sold couple thousand copies united states ultimately commercial failure poor sales attributed late release sega cd lifespan snatcher released japan 1996 time 32-bit game consoles playstation version released january 26 followed sega saturn version march 29 pc-8801 msx2 versions received positive reviews japan attained cult following commercially successful pc engine version also attained following japan part gore famicom tsushin gave 33 40 commending cinematic quality game still listed reader best 20 list two years release sega saturn magazine found sega saturn version faithful port pc engine version snatcher arrived west sega cd received praise story cinematic presentation mature themes cinematic told mature story gamers familiar time mean machines sega felt snatcher substantial adventure games calling one involved storyboards backgrounds video game game writing generally lauded videogames game players felt juvenile humor sometimes conflicted otherwise serious tone reviewer gamefan called one longest involving games played long time wrote never played – nay experienced – game moving dramatic gore-riddled ma-17 adult magazine praised konami retaining mature content mean machines sega believed snatcher presentation heightened use cd-rom technology supported digitized voices high quality graphics critics praised english voice acting writing though next generation thought konami could contracted better actors graphics criticized computer video games dated videogames generic magazines discussed graphics positive light gamepro liked japanese anime style graphics felt combined writing drew players story however reviewer criticized music calling old-fashioned cyberpunk adventure mean machines sega compared positively john carpenter-style incidental themes critics felt game slow moving times rewarded patient players gamepro wrote rewards patience persistence plodding ultimate future games felt game linear leaned heavily illusion choice story could advanced completing tasks certain order mean machines sega felt puzzles challenging game considerably longer substantial rise dragon 1990 another cyberpunk adventure game computer video games felt gun shooting sections weak disappointing snatcher called one best adventure games best cyberpunk games time continued receive praise story presentation waypoint wrote narrative visuals hold contrast sega cd cyberpunk adventure games kotaku called science fiction cornucopia liked game explored topics human existence fear machines replacing humans felt game heavily influenced science fiction films including blade runner terminator akira invasion body snatchers 1956 publications also picked inspirations especially blade runner retro gamer felt ironic game cinematic games using full motion video destructoid enjoyed plot complained interface allgame wrote text-based menu driven games like snatcher become tedious felt storyline graphics made snatcher worth time critics discussed snatcher setting stage kojima later works 1up.com felt game demonstrated love film cerebral affair efforts ingenuity attention detail helped make game especially noteworthy game informer wrote snatcher foreshadowed kojima use science fiction explore philosophy sex human condition metal gear solid snatcher remains one kojima renowned games often overshadowed metal gear solid series snatcher obtained cult following influence science fiction works including project itoh novel genocidal organ 2015 adventure game kojima expressed interest reviving snatcher capacity explained time work project would welcome another director lead according project never feasible business perspective 2011 said sequel would need sell half million copies make sense financially kojima left konami 2015 game remains property company expressed interest reviving either rerelease sequel game lack availability modern platforms surprised critics believed would play well nintendo ds 3ds following footsteps successful graphic adventures platforms like sega cd version remains sole release western territories demand driven prices copies secondary market making emulation reasonable option players japanese copies far cheaper game text-based nature makes difficult non-japanese readers japanese pc engine version included turbografx-16 mini fans experimented porting game systems demo early part game made virtual boy 2015 complete stereoscopic 3d effects pcm music another fan experimented porting dreamcast remixed soundtrack retouched visuals snatcher first translation project jeremy blaustein went translate kojima metal gear solid 1998 blaustein launched crowdfunding campaign kickstarter steampunk adventure game titled blackmore 2014 game directed blaustein former snatcher staff making parts team meet funding goal snatcher remade role-playing game called sd snatcher msx2 released 1990 sd stands super deformed japanese media another way reference chibi character designs game plays top-down perspective player controls gillian ventures environment player encounters enemy field game shifts first-person battle mode player must shoot enemies using one many different guns different parts enemy targeted different weapons varying abilities ranges outside key plot points game significantly changes locations explored events transpired original game also concludes story similar manner cd-rom versions like msx2 version snatcher sd snatcher shipped expanded sound cartridge translated dutch-based group oasis 1993 making one earliest documented fan translations episodic radio drama prequel sdatcher released 2011 collaboration kojima game designer goichi suda suda credited snatcher along works yu suzuki igniting interest video games asked kojima wanted make new game together project lead radio drama announced 2007 script written suda music composed akira yamaoka worked suda grasshopper manufacture studio worked silent hill series original snatcher artist satoshi yoshioka promotional illustrations first act released september new acts released every week november year distributed free later sold cds later translated fans | [
7108,
2469,
9957,
9006,
2383,
2096,
10931,
4317
] | None |
8,233 | 3 | Reliability,_availability_and_serviceability:reliability availability serviceability reliability availability serviceability ras computer hardware engineering term involving reliability engineering high availability serviceability design phrase originally used international business machines ibm term describe robustness mainframe computers computers designed higher levels ras many features protect data integrity help stay available long periods time without failure data integrity uptime particular selling point mainframes fault-tolerant systems ras originated hardware-oriented term systems thinking extended concept reliability-availability-serviceability systems general including software note distinction reliability availability reliability measures ability system function correctly including avoiding data corruption whereas availability measures often system available use even though may functioning correctly example server may run forever ideal availability may unreliable frequent data corruption physical faults temporary permanent transient intermittent faults typically handled detection correction e.g. ecc codes instruction replay see permanent faults lead uncorrectable errors handled replacement duplicate hardware e.g. processor sparing passing uncorrectable error high level recovery mechanisms successfully corrected intermittent fault also reported operating system os provide information predictive failure analysis example hardware features improving ras include following listed subsystem fault-tolerant designs extended idea making ras defining feature computers applications like stock market exchanges air traffic control system crashes would catastrophic fault-tolerant computers e.g. see tandem computers stratus technologies tend duplicate components running lock-step reliability become less popular due high cost high availability systems using distributed computing techniques like computer clusters often used cheaper alternatives | [
7939,
1801,
6281,
11533,
5523,
1309,
2847,
4521,
7983,
5941,
1722,
9285,
1606,
3153,
3927,
9964,
3181,
10734,
1776,
9335,
3450,
3323,
2172,
10237
] | Test |
8,234 | 0 | William_J._Barry:william j. barry william john barry born 1943 ireland one leading phoneticians germany came germany early years mainly educated university kiel renowned german phonetician klaus j. kohler 1992 appointed chair phonetics saarland university principal research areas speech synthesis rhythm segmental structures application linguistics questions pronunciation learning speech-language pathology speech technology general william j. barry innovative productive research close cooperation institute computational linguistics saarland university well german research center artificial intelligence also saarbruecken made saarbruecken institute phonetics outstanding pillar science europe 2007 w. j. barry held chair 16th international congress phonetic sciences icphs became emeritus professor 2008 barry currently council member international phonetic association editor phonus journal publications resulted cooperation researchers | [
3533
] | Test |
8,235 | 6 | Fdformat:fdformat fdformat name two unrelated programs | [
3841,
1801,
8524,
823,
10967
] | None |
8,236 | 3 | Unlink_(Unix):unlink unix unix-like operating systems unlink system call command line utility delete files program directly interfaces system call removes file name gnu systems directories like rm rmdir file name last hard link file file deleted soon program open also appears php node.js perl standard libraries form unlink built-in function like unix utility also used delete files delete file named foo one could type php one could use following function perl syntax identical php syntax save parentheses node.js almost others | [
515,
9733,
8582,
9735,
3976,
1801,
4750,
5397,
2198,
6812,
7847,
4398,
1844,
1336,
7356,
8644,
965,
8522,
3659,
9946,
6120,
4850,
5492,
9204,
6138,
5759
] | None |
8,237 | 3 | MediaTek:mediatek mediatek inc. taiwanese fabless semiconductor company provides chips wireless communications high-definition television handheld mobile devices like smartphones tablet computers navigation systems consumer multimedia products digital subscriber line services well optical less disc drives headquartered hsinchu taiwan company 25 offices worldwide third largest fabless ic designer worldwide 2016 since founding 1997 mediatek creating chipsets global market mediatek also provides customers reference designs mediatek originally unit united microelectronics corporation umc tasked designing chipsets home entertainment products 28 may 1997 unit spun incorporated mediatek inc. listed taiwan stock exchange tsec 2454 code 23 july 2001 company started designing chipsets optical drives subsequently expanded chips dvd players digital tvs mobile phones smartphones tablets general mediatek strong record gaining market share displacing competitors entering new markets company launched division design products mobile devices 2004 seven years later taking orders 500 million mobile system-on-chip units per annum included products feature phones smart devices providing extensive system engineering assistance company allowed many smaller companies new entrants enter mobile phone market previously dominated large often vertically integrated corporations long broadly entrenched telecommunications industry mobile chip market quickly became main growth driver company mobile world congress 2014 mediatek unveiled new brand “ everyday genius ” dubbing term “ super-mid market ” vision aiming make smartphones accessible affordable wider market november 2014 1500 mobile models accounting 700 million units shipped globally 2014 using mediatek chips company posted revenues us 5.3 billion first half 2014 nearly much whole 2013 revenue growth however partly due revenue recognition acquisition mstar became effective beginning 2014 2005 mediatek acquired inprocomm wireless semiconductor design company producing 802.11a b a/g chips september 10 2007 mediatek announced intention buy analog devices cellular radio baseband chipset divisions us 350 million acquisition finalised january 11 2008 5 may 2011 mediatek acquired ralink technology corporation gaining products expertise wi-fi technology mobile non-mobile applications well wired dsl ethernet connectivity 11 april 2012 mediatek acquired coresonic global producer digital signal processing products based linköping sweden coresonic became wholly owned subsidiary mediatek europe 22 june 2012 mediatek announced would acquire rival taiwanese chipset designer mstar semiconductor inc. held strong market share position digital television chips initial phase deal saw mediatek taking 48 percent stake option purchase remaining stake later date following merger mediatek mstar delayed antitrust concerns china south korea finalized 1 february 2014 mediatek financial results subject variation financial success different product lines fluctuated mediatek relatively strong sales 2009/2010 based strong market position feature phone chipsets smartphone tablet products contributed mediatek sales income increase 2013 revenue recognition acquisition mstar semiconductor became effective february 2014 well continuing strong position smartphone tablet solutions main reasons sales growth seen 2014 2014 smartphone chips accounted approximately 50–55 revenue followed digital home products 25–30 includes digital television chips tablet chips 5–10 feature phone chips 5–10 wi-fi products 5–10 mediatek started shipping chips integrated 4g lte baseband volume second half 2014 later largest competitor qualcomm additional cost separate baseband chip required every 4g handset made mediatek offerings expensive prompted larger customers like alcatel one touch zte choose competing socs like qualcomm snapdragon 400 410 platforms negatively affecting mediatek revenue stream mediatek stock trading taiwan stock exchange symbol mediatek often followed industry-first strategy differentiate competition mt8135 system-on-chip soc tablets announced july 2013 industry first chip implement new arm big.little technology heterogeneous multi-processing variant mt8135 used amazon kindle fire hd tablet models also november 20 2013 mediatek launched mt6592 soc first system-on-chip soc eight cpu cores could used simultaneously contrast competing socs eight physical cores subset could active given time true octa-core trademark registered emphasize difference marketing materials 7 january 2014 mediatek announced development world first multimode receiver wireless charging contrast existing implementations compatible inductive resonant charging resulting mt3188 wireless charging chip certified power matters alliance wireless power consortium announced february 24 2014 25 february 2014 mediatek announced industry first five-in-one wireless chip soc mt6630 supports 802.11a/b/g/n/ac wifi bluetooth ant+ gps fm radio mediatek collaborated google first ultra hd tv platform android tv resulting development mt5595 digital television soc product first shipped lcd tv models made sony list devices using mediatek socs armv5 list devices using mediatek socs armv7 dual core list devices using mediatek socs armv7 quad core list devices using mediatek socs armv7 hexa core list devices using mediatek socs armv8 quad core list devices using mediatek socs armv8 octa core list devices using mediatek tablet processors consumer electronics show january 2015 mediatek announced mt2601 wearable devices based google ’ android wear software according mediatek small size allows fewer components lower current consumption compared chipsets market chip includes dual-core arm cortex-a7 cpu arm mali-400 mp gpu allows display resolutions qhd 960x540 combined mt6630 chip wireless connectivity mediatek mt2621 mt2625 two soc build lte nb-iot modems mt2625 launched 29 june 2017 mt2621 added 24 november mt6630 2014 five-in-one combo wireless soc integrating dual-band 802.11a/b/g/n/ac advanced wi-fi direct miracast support bluetooth 4.1 ant+ tri-band gps fm transceiver intended paired chips like mt6595 octa-core smartphone processor features integrated 4g modem built-in wi-fi/bluetooth/gps/fm functionality could also used tablets conjunction stand-alone application processor global navigation satellite system gnss modules result merger ralink mediatek added wireless network interface controllers ieee 802.11-standards socs mips cpus product portfolio consumer electronics show january 2015 mediatek announced mt5595 new digital television soc support google android tv platform adopted sony new lcd tv models | [
3585,
4098,
7170,
8711,
11282,
9235,
11289,
4124,
1057,
38,
9255,
4139,
2097,
1083,
8253,
10303,
7745,
7234,
7747,
2635,
3664,
10332,
99,
6247,
6250,
6252,
6253,
8812,
6256,
5237,
10361,
9851,
6268,
638,
11391,
644,
11396,
8327,
9863,
884... | Validation |
8,238 | 5 | Link-Local_Multicast_Name_Resolution:link-local multicast name resolution link-local multicast name resolution llmnr protocol based domain name system dns packet format allows ipv4 ipv6 hosts perform name resolution hosts local link included windows vista windows server 2008 windows 7 windows 8 windows 10 also implemented systemd-resolved linux llmnr defined rfc 4795 responding queries responders listen udp port 5355 following link-scope multicast address responders also listen tcp port 5355 unicast address host uses respond queries | [
514,
10242,
3847,
649,
9868,
3218,
9365,
10005,
11413,
5402,
5531,
3742,
10271,
9380,
2085,
9381,
3751,
3752,
425,
10924,
562,
2996,
9909,
10171,
3133,
3006,
4797,
5181,
5437,
7364,
2887,
8391,
8265,
2509,
4687,
5843,
2904,
5469,
5470,
54... | None |
8,239 | 4 | Real-time_recovery:real-time recovery information technology real-time recovery ability recover piece infrastructure server infrastructure failure human-induced error time frame minimal impact business operations real-time recovery focuses appropriate technology restores thus reducing recovery time objective rto minutes recovery point objectives rpo within 15 minutes ago minimizing test recovery objectives tro ability test validate backups occurred correctly without impacting production systems real-time recovery new market segment backup recovery disaster recovery market addresses challenges companies historically faced regards protecting importantly recovering data real-time recovery solution must contain minimum following attributes ability restore server minutes totally different virtual environment within 5 minutes ago require use additional agents options modules accomplish must able restore files seconds reason anyone backups able restore must perform sector level backups every 5 minutes ability self-heal broken incremental chain backups part image set get corrupted deleted must deliver improved recoverability data files databases data loss classified three broad categories data servers either physical hosts servers running guest servers within virtualization platform combination common customer environment mixture virtual physical servers attention detail must given approach protecting data servers regular intervals distinct advantages selecting technology virtual physical independent would limit number technologies organizations get trained skilled purchase deploy manage maintain ideal world reduce complexity managing multiple products protect physical virtual infrastructure reap rewards technology gets installed operating system level ensures consistency environment either physical virtual eliminates api compatibility disk volume structure limitations e.g raw mapped devices vmfs prior selecting realtime recovery strategy real-time recovery rtr solution disaster recovery planner refer organization business continuity plan indicate key metrics recovery point objective rpo recovery time objective recovery time objective various business processes process run payroll generate order e-mail etc. metrics specified business processes must mapped underlying systems infrastructure support processes recovery time objective recovery point objective metrics mapped infrastructure dr planner determine suitable recovery strategy system important note however business ultimately sets budget therefore rto rpo metrics need fit available budget business unit heads would like zero data loss zero time loss cost associated level protection historically made high availability solutions impractical unaffordable benefit implementing real-time recovery solution investment substantially reduced traditional tape based backup products | [
6514,
3366
] | Test |
8,240 | 8 | Dreamwidth:dreamwidth dreamwidth online journal service based livejournal codebase code fork original service set ex-livejournal staff denise paolucci mark smith born desire new community based open access transparency freedom respect dreamwidth announced 11 june 2008 went open beta 30 april 2009 part features similar livejournal users journals may post entries webpage users may comment dreamwidth also provides shared group journals called communities areas dreamwidth differs significantly livejournal include following initially dreamwidth accounts could created invite code december 2011 invite codes turned originally experimental temporary measure significant increase spam accounts servers adjusted handle load invite codes turned back start new year planned new users still create account without use invite code free accounts limited features paid accounts exist two levels paid premium paid additional features time open beta launch limited number seed accounts also available response criticisms livejournal friending system dreamwidth split user relationships two parts subscriptions access control users may subscribe users journals grant access users read locked entries separate actions dreamwidth terminology reflects split instance friends page renamed reading page custom friends groups split access filters reading filters dreamwidth provides greater interoperability livejournal-based sites including ability import journal another site crosspost multiple sites greater functionality users log via openid addition search facilities brought livejournal paid account users search journal introduced 24 july 2009 livejournal initially free advertisements gradually incorporated 2017 ads shown non-paid readers pages dreamwidth remains free advertisements following features available livejournal available dreamwidth despite lack features dreamwidth acclaimed strong community transparency dreamwidth based upon free open-source server software designed run livejournal written primarily perl majority dreamwidth code available gpl sites use unlike many social networking sites using livejournal codebase insanejournal deadjournal dreamwidth code fork removing unwanted features advertising adding new ones described founders site rejected advertising model intrusive instead implemented payment system users purchase add-on premium features 2009 oscon presentation saw dreamwidth identified highly unusual among open-source projects number women development team 75 developers female compared around 1.5 field whole paolucci smith also spoke linux.conf.au 2010 dreamwidth development model invited speak web 2.0 expo oscon techniques dreamwidth accepted gsoc mentoring organization summer 2010 allotted seven students worked variety projects athena also known afuna fu introduced site first paid employee 7 april 2010 7 september 2010 mark smith announced stepped back dreamwidth front line moved work stumbleupon still owner dreamwidth along denise however following positive reactions dreamwidth diversity statement model inclusiveness various projects followed suit including python diversity list dreamfish | [
8554,
4367,
8582,
735
] | Test |
8,241 | 3 | EMM386:emm386 name emm386 used expanded memory managers microsoft ms-dos ibm pc dos digital research dr-dos created expanded memory using extended memory intel 80386 cpus also emm386.exe available freedos emm386.exe map memory unused blocks upper memory area uma allowing device drivers tsrs loaded high preserving conventional memory technique probably first appeared development cemm included compaq ms-dos 3.31 1987 microsoft version first appeared built-in windows/386 2.1 1988 standalone emm386.sys ms-dos 4.01 1989 flexible emm386.exe version appeared ms-dos 5.0 1991 expanded memory managers emm386 uses processor virtual 8086 mode forces memory accesses made dos applications go processors mmu introduced 386 page table entries used mmu configured emm386 map certain regions upper memory areas extended memory obtained emm386 extended memory manager himem.sys technique enabled ems expanded memory well umbs appear dos applications memory upper area fact mapped physical memory locations beyond 1mb temporarily shuts windows session 386 enhanced mode windows protected mode kernel taking role windows uses gemmis api take memory management emm386.exe global emm import specification gemmis supported via document available select number memory-manager vendors windows/386 paging import specification memory managers implemented gemmis api ones include emm386.exe quarterdeck qemm386.sys dosbox builtin dos notably missing freedos memory managers freedos memory managers himemx.exe jemm386.exe jemmex.exe implement gemmis api windows fails start running conjunction jemmxxx since windows fails take memory management role windows windows 98 windows 95 windows workgroups 3.1x windows 3.xx fail jemmxxx displaying jemmxx possible run windows 3.x windows workgroups 3.1x limited capabilities forcing windows use standard mode i.e using 80286 protected mode 80386 enhanced mode three conditions required note windows standard mode limited functionality lacks virtual memory skips 386enh section system.ini device drivers 386enh loaded | [
5856,
292,
6148,
6730,
11562,
9166,
7983,
6321,
178,
1237,
9525,
4441,
4699,
3323,
1247
] | Test |
8,242 | 3 | Compute_Node_Linux:compute node linux compute node linux cnl runtime environment based linux kernel cray xt3 cray xt4 cray xt5 cray xt6 cray xe6 cray xk6 supercomputer systems based suse linux enterprise server cnl forms part cray linux environment systems running cnl ranked 3rd 6th 8th among fastest supercomputers world | [
4616,
3082,
5139,
10780,
10785,
6179,
6180,
9266,
4161,
8772,
6213,
8268,
589,
593,
6244,
5222,
10856,
4207,
5244,
4734,
11391,
7812,
7821,
4238,
10382,
1168,
2195,
2711,
6808,
9882,
1694,
2723,
10411,
8364,
10933,
5815,
5822,
5824,
1736,
... | Test |
8,243 | 4 | Mks_vir:mks vir mks_vir formerly mks_vir – polish antivirus program created marek sell 1987 original reason creation software solutions existing market times satisfy author needs first versions dos distributed floppy disks apexim company marek sell worked updates issued monthly sent mail initially software delivered users personalized – main screen contained serial number data license owner despite program often used without license popularity confirmed appearing trojan horses impersonating program updates issued yet later together full version software demo versions issued allowed use program week educational reasons program contained descriptions operation viruses including demonstrations graphical sound effects 3.99 version lexicon viruses popular poland 1996 became winner third edition teraz polska contest 1996 mks company created marek sell became program producer website program bbs created company continued development program death author 2004 versions microsoft windows unix created online scanner based activex technology became available software website bankruptcy mks company 2011 property receiver sold rights mks_vir trademark arcabit company created years earlier former mks employees reactivated mks_vir product free antivirus application officially arcabit company resigned distribution support software 2014 march 1 although released brand new version may 2018 program versions | [
10756,
2213,
10026,
5356,
6797,
9166,
7983,
499,
5492,
823,
9151
] | Test |
8,244 | 8 | Voat:voat voat inc open source news aggregator social networking service registered community members submit content text posts direct links registered users vote submissions content entries organized areas interest called subverses website described several media outlets including quartz new york times new york us uk editions wired hub alt-right voat site hosts aggregated content discussion forums according wired voat aesthetically functionally similar reddit like reddit voat collection entries submitted registered users themed categories called subverses voat similar bulletin board system unlike reddit voat emphasized looser content restrictions ad-revenue sharing program voat written c programming language reddit written python january 2017 new yorker article voat described descendant 2chan 4chan 8chan users compete shock value verge described site imzy dark twin indirect products gamergate culture war name voat play words 'goat 'vote site mascot goat website uses colombian top level domain .co registered november 2014 founded april 2014 whoaverse website hobby project atif colo known voat atko student pursuing bsc later joined justin chastain known puttitout website labelled alternative reddit focus freedom expression december 2014 whoaverse changed name voat ease use february 2015 following accusations censorship reddit voat claimed seen “ large influx ” new users reddit early june 2015 reddit banned five subreddits harassment—the largest around 150,000 subscribers—many users reddit began create accounts voat influx new participants temporarily overloaded site causing downtime voat germany-based web hosting service host europe precursor webfusion shut service june 2015 alleged voat publicizing incitement people well abusive insulting youth-endangering content well illegal right-wing extremist content voat founder attributed shutdown political correctness voat also payments frozen paypal due sexually oriented materials services voat shut four subverses response two hosted sexualized images minors jailbait website continued accept donations bitcoin able continue functioning moved different hosting provider website continued experience downtime due ongoing distributed denial service ddos attack rendering 700,000 unique visitors unable access site early july 2015 following dismissal popular administrator reddit another influx reddit members registered voat leading traffic caused voat experience downtime developers website subsequently approached venture capitalists interested investing project also july voat alongside wikileaks subject bitcoin dust attack ddos attacks bitcoin attack slowed payment processing websites ddos attack launched july 12 unsuccessful due cloudflare services although side effect rendering third-party voat apps incapable functioning august 2015 voat became incorporated united states colo explained post announcing incorporation u.s. law far beats every candidate country ’ researched november 2016 users relocated voat reddit banned pizzagate conspiracy theory subreddit citing doxing harassment concerns january 2017 colo resigned ceo voat citing lack time available devote site colo replaced ceo chastain may 2017 chastain ran fundraising campaign announcing voat might shut due lack money november 2017 reddit incel community moved voat incel community banned reddit september 12 2018 reddit banned several subreddits dedicated discussing qanon conspiracy theory stating violated rules prohibiting inciting violence harassment dissemination personal information caused many q anon posters migrate voat | [
8262,
2409,
8554,
82,
735,
10995,
441,
8956,
1087
] | Test |
8,245 | 0 | JAPE_(linguistics):jape linguistics computational linguistics jape java annotation patterns engine component open-source general architecture text engineering gate platform jape finite state transducer operates annotations based regular expressions thus useful pattern-matching semantic extraction many operations syntactic trees produced natural language parsers jape version cpsl – common pattern specification language jape grammar consists set phases consists set pattern/action rules phases run sequentially constitute cascade finite state transducers annotations left-hand-side lhs rules consist annotation pattern description right-hand-side rhs consists annotation manipulation statements annotations matched lhs rule may referred rhs means labels attached pattern elements dhaval thakker taha osman phil lakin jape grammar tutorial http //gate.ac.uk/sale/thakker-jape-tutorial/gate 20jape 20manual.pdf | [
1890
] | None |
8,246 | 2 | User-Mode_Driver_Framework:user-mode driver framework user-mode driver framework umdf device-driver development platform first introduced microsoft windows vista operating system also available windows xp facilitates creation drivers certain classes devices standard device drivers difficult write must handle wide range system device states particularly multithreaded software environment badly written device drivers cause severe damage system e.g. bsod data corruption since standard drivers high privileges accessing kernel directly user-mode driver framework insulates kernel problems direct driver access instead providing new class driver dedicated application programming interface user level interrupts memory management error occurs new framework allows immediate driver restart without impacting system particularly useful devices intermittently connected system support hot swapping via bus technology usb firewire according microsoft umdf drivers simpler write debug kernel-mode drivers however umdf would used performance-intensive highly stateful devices first version umdf shipped part windows media player version 10 2004-10-12 code-named crescent designed support media transfer protocol driver public interfaces documentation provided later microsoft decided turn umdf device driver development platform umdf driver dll based microsoft component object model com however umdf use com loading unloading controlling concurrency uses com programming pattern example exploiting com iunknown interface startup umdf calls dllgetclassobject get pointer iclassfactory interface driver uses createinstance method iclassfactory interface create instance driver callback object driver object instance framework-provided iwdfdriver interface driver provides set callbacks via idriverentry com interface main entry point driver customization | [
10243,
10769,
9234,
1043,
1055,
2083,
8227,
1577,
4143,
9263,
11316,
1077,
6709,
4174,
4178,
83,
9813,
603,
608,
2145,
2146,
1656,
5754,
9340,
5761,
9348,
5765,
10886,
2183,
5259,
653,
10900,
10902,
11414,
3224,
3235,
4771,
7846,
2221,
10... | Test |
8,247 | 4 | Auslogics_Antivirus:auslogics antivirus auslogics antivirus antivirus software application intended protect user computer viruses spyware keyloggers cyber threats program also check computer vulnerability status provide privacy controls real-time virus protection encryption instant messaging program made used computers run microsoft windows operating system application version 14 latest writing article february 2012 supporting windows xp vista 7 program published auslogics software pty ltd australian-based company specializes maintenance software computers run microsoft windows operating system started 2008 company gained recognition two highly rated products – auslogics boostspeed auslogics disk defrag 2009 company partnered sony vaio develop part sony vaio care software installed vaio laptops desktop pc ’ 2011 auslogics premier elite partner status intel software partner program december 2011 comparative test performed independent antivirus software certification authority virus bulletin auslogics antivirus received vb100 award placed among top 10 programs 54 antivirus packages included test reactive proactive rap detection rates near 100 chart published virus bulletin program also received editor pick award software informer rated 5 stars download3000.com reviewed freedownloadscenter.com among program advantages reviewers cite easy-to-use configuration wizard settings levels novice intermediate advanced users high detection rates gaming mode feature main drawback mentioned reviews lengthy installation process | [
2213,
6797,
8978,
10392,
7739
] | Validation |
8,248 | 2 | Tiny_Core_Linux:tiny core linux tiny core linux tcl minimal linux operating system focusing providing base system using busybox fltk developed robert shingledecker distribution notable small size 11 16 mb minimalism additional functions provided extensions tiny core linux free open source software licensed gnu general public license version 2 tiny core 16 mb recommended option new users wired network connection includes base core system dynamic fltk/flwm graphical user interface core 11 mb also known micro core linux smaller variant tiny core without graphical desktop though additional extensions added create system graphical desktop environment dcore 12 mb core made debian ubuntu compatible files uses import sce package format self-contained package format tiny core distribution since 5.x series corepure64 notable port core x86_64 architecture core plus 106 mb installation image distribution composed tiny core additional functionality notably wireless support non-us keyboard support picore raspberry pi port core minimal configuration tiny core needs least 46 mb ram order run core requires least 28 mb ram minimum cpu i486dx recommended configuration pentium 2 cpu 64 mb ram recommended tiny core developers describe tcl nomadic ultra small graphical desktop operating system capable booting cdrom pendrive frugally hard drive version 2.8.1 core designed run primarily ram three distinct modes operation | [
516,
8837,
7435,
10127,
2321,
5397,
4887,
10394,
4637,
10016,
673,
3745,
10530,
6436,
9253,
10149,
11305,
7854,
7983,
2738,
4790,
823,
439,
56,
1849,
59,
7483,
3903,
4673,
10817,
6979,
2375,
4039,
5067,
8907,
2383,
1110,
9689,
9693,
2914,... | None |
8,249 | 3 | Aura_Battler_Dunbine:aura battler dunbine dunbine set byston well parallel world resembles countryside medieval europe kingdoms ruled monarchs castles armies unicorn-riding cavalry armed swords crossbows little winged creatures called ferario flying offering help hindrance depending mood main draw series insect-like aura battlers used population byston well fight wars fighting suits powered powerful energy called aura life energy certain people strong enough aura-energy act power-supply mecha making aura warriors series aired nagoya tv february 5 1983 january 21 1984 totaling 49 episodes three-episode anime ova sequel new story aura battler dunbine also known tale neo byston well released 1988 series later dubbed adv films released dvd north america along original japanese version 2003 however quickly became print 2018 available digital purchase now-defunct daisuki site sentai filmworks licensed series series followed shō zama suddenly finds pulled world byston well vehicular incident one rivals byston well located another dimension located sea land populated dragons castles knights powerful robots known aura battlers shō discovered possess powerful aura drafted byston well conflict pilot lavender-colored dunbine tomino creations dunbine cast populated nordic-looking military types elaborate costumes one side young japanese hero caught middle freedom fighters side beautiful female warriors abound sides hero falls main female lead romances cut across battle lines non-stop battles elaborate fighting craft land air cast pilot aura battlers although lots standard airships smaller fighters large warships well also typical tomino style large number named characters die tragically throughout series dunbine characters mecha storyline elements make appearances quite games super robot wars series banpresto notably first series banpresto gone make spinoff series taking place different universes alpha series impact however dunbine made appearances latter titles recently making something comeback first returning ux followed almost immediately operation extend bx gives recent use story dunbine units also appeared another century episode series first sequel another century episode 2 many units dunbine series included compared amount first game large part plot shō marvel piloting bilbine dunbine respectively also acquire unique team attack another century episode 3 story plot involve dunbine player unit continues appear bilbine shares combination attack nanajin wings rean also world set byston well first three games produced family soft msx 2000 title released playstation bandai new story aura battler dunbine also known tale neo byston well three episode anime ova released 1988 sequel tv series dunbine set roughly 700 years events show also second show set fictional medieval land byston well followed garzey wing wings rean directed toshifumi takizawa samurai 7 700 years passed since great war involving aura machines ended attempt conquer byston well black knight rabaan kidnaps princess nation baran-baran – nation said hold legendary treasure rabaan also captures shion young hunter shion princess remul escape rabaan castle return homeland find baran-baran treasure actually powerful aura battler sirbine riding sirbine shion fights rabaan evil forces | [
2156,
9006
] | Train |
8,250 | 3 | WonderMedia:wondermedia wondermedia fabless soc company headquartered taipei taiwan subsidiary via technologies notable creating low cost processors used large number chinese android windows ce-based devices soc designs collectively called wondermedia prizm platform based reference implementations provided arm holdings | [
3585,
7170,
11282,
9235,
11289,
1057,
38,
4139,
2097,
6705,
8253,
7745,
7747,
2635,
99,
8812,
10361,
638,
644,
11396,
8842,
1677,
146,
659,
1682,
7833,
666,
5786,
4258,
4773,
9913,
8383,
10945,
4821,
2788,
9964,
1776,
6391,
3835,
2814,
... | Test |
8,251 | 9 | Intersection_type:intersection type type theory intersection type assigned values assigned two given types particular value assigned type formula_1 type formula_2 value assigned intersection type formula_3 intersection type system generally ranges values two types overlap value belonging intersection two ranges assigned intersection type two types value safely passed argument functions expecting either two types example java class implements interfaces therefore object type safely passed functions expecting argument type functions expecting argument type intersection types composite data types similarly product types used assign several types object however product types assigned tuples tuple element assigned particular product type component comparison underlying objects intersection types necessarily composite restricted form intersection types refinement types intersection types useful describing overloaded functions example type functions taking number argument returning number type functions taking string argument returning string intersection two types used describe overloaded functions one based type input given contemporary programming languages including ceylon flow java scala typesript whiley see comparison languages intersection types use intersection types combine interface specifications express ad hoc polymorphism complementing parametric polymorphism intersection types may used avoid class hierarchy pollution cross-cutting concerns reduce boilerplate code shown typescript example type theoretic study intersection types referred intersection type discipline remarkably program termination precisely characterized using intersection types microsoft typescript supports intersection types improving expressivity type system reducing potential class hierarchy size demonstrated follows following program code defines classes method returning object either type additionally function resp requires object type resp argument //produces eggs //produces milk //produces random number //requires egg function eategg egg egg //requires milk function drinkmilk milk milk following program code defines ad hoc polymorphic function invokes member function given object function two type annotations namely connected via intersection type constructor specifically applied argument type returns object type type applied argument type returns object type type ideally applicable object possibly chance method //given chicken produces egg given cow produces milk let animaltofood chicken egg cow milk finally following program code demonstrates type safe use definitions var chicken new chicken var cow new cow var randomnumbergenerator new randomnumbergenerator console.log randomnumbergenerator.produce //0.2626353555444987 //console.log animaltofood randomnumbergenerator //error argument type 'randomnumbergenerator assignable parameter type 'cow' console.log eategg animaltofood chicken //i ate egg //console.log eategg animaltofood cow //error argument type 'milk assignable parameter type 'egg' console.log drinkmilk animaltofood cow //i drank milk //console.log drinkmilk animaltofood chicken //error argument type 'egg assignable parameter type 'milk' program code following properties minimalistic example realized using inheritance instance deriving classes base class however larger setting could disadvantageous introducing new classes class hierarchy necessarily justified cross-cutting concerns may outright impossible example using external library imaginably example could extended following classes may require additional classes interfaces specifying whether produce method available whether produce method returns food whether produce method used repeatedly overall may pollute class hierarchy minimalistic example already shows duck typing less suited realize given scenario class contains method object valid argument example realized using duck typing instance introducing new field classes signifying objects corresponding type valid arguments however would increase size respective classes especially introduction methods similar also non-local approach respect example realized using function overloading instance implementing two methods typescript solution almost identical provided example programming languages java require distinct implementations overloaded method may lead either code duplication boilerplate code example realized using visitor pattern would require animal class implement method accepting object implementing interface adding non-local boilerplate code function would realized method implementation unfortunately connection input type result type would difficult represent one hand intersection types used locally annotate different types function without introducing new classes interfaces class hierarchy hand approach requires possible argument types result types specified explicitly behaviour function specified precisely either unified interface parametric polymorphism duck typing verbose nature intersection types unfavorable therefore intersection types considered complementary existing specification methods dependent intersection type denoted formula_4 dependent type type formula_2 may depend term variable formula_6 particular term formula_7 dependent intersection type formula_4 term formula_7 type formula_1 type formula_11 formula_11 type results replacing occurrences term variable formula_6 formula_2 term formula_7 scala supports type declarations object members allows type object member depend value another member called path-dependent type example following program text defines scala trait witness used implement singleton pattern trait witness trait witness declares member assigned type value member value assigned value type t. following programm text defines object booleanwitness instance trait witness object booleanwitness defines type boolean value value true example executing system.out.println booleanwitness.value prints true console object booleanwitness extends witness let formula_16 type specifically record type objects member formula_17 type formula_1 example object booleanwitness assigned dependent intersection type formula_19 reasoning follows object booleanwitness member assigned type boolean value since boolean type object booleanwitness type formula_20 additionally object booleanwitness member value assigned value true type boolean since value booleanwitness.t boolean object booleanwitness type formula_21 overall object booleanwitness intersection type formula_22 therefore presenting self-reference dependency object booleanwitness dependent intersection type formula_19 alternatively minimalistic example described using dependent record types comparison dependent intersection types dependent record types constitute strictly specialized type theoretic concept intersection type family denoted formula_24 dependent type type formula_2 may depend term variable formula_6 particular term formula_7 type formula_24 term formula_29 type formula_1 term formula_7 type formula_32 notion also called implicit pi type observing argument formula_29 kept term level | [
4101,
10246,
5783,
11674,
10145,
5796,
5677,
9780,
11574,
6087,
2011,
4572,
6239,
10729,
10991,
3702,
7671,
3705,
9466,
2556,
5885
] | Test |
8,252 | 7 | Distributed_data_flow:distributed data flow distributed data flow also abbreviated distributed flow refers set events distributed application protocol distributed data flows serve purpose analogous variables method parameters programming languages java represent state stored communicated layer software unlike variables parameters represent unit state resides single location distributed flows dynamic distributed simultaneously appear multiple locations within network time distributed flows natural way modeling semantics inner workings certain classes distributed systems particular distributed data flow abstraction used convenient way expressing high-level logical relationships parts distributed protocols distributed data flow satisfies following informal properties formally represent event distributed flow quadruple form x k v x location e.g. network address physical node event occurs time happens k version sequence number identifying particular event v value represents event payload e.g. arguments passed method call distributed flow possibly infinite set quadruples satisfies following three formal properties addition flows number additional properties | [
4417,
545,
6403,
8929,
5029,
8262,
5677,
1197,
7855
] | None |
8,253 | 3 | Apple_A5X:apple a5x apple a5x 32-bit system-on-a-chip soc designed apple inc. introduced launch third generation ipad march 7 2012 high performance variant apple a5 apple claims twice graphics performance a5 superseded iphone 5 5c a6 chip fourth generation ipad a6x chip software updates ipad 3rd generation ended 2016 thus ceasing support chip a5x features dual-core arm cortex-a9 cpu 1 ghz quad-core powervr sgx543mp4 gpu clocked 250 mhz apple doubled size a5x memory interface comparison a5 including memory interface subsystem four 32-bit wide lp-ddr2 memory controllers done provide sufficient bandwidth high pixel count third generation ipad retina display unlike a4 a5 a5x covered metal heat spreader package-on-package pop assembly earlier chips ram sat top soc however a5x ram bundled together soc instead a5x sits one side motherboard twin samsung lp ddr2 sdram soldered directly side motherboard a5x manufactured 45 nm process samsung silicon die size increased drastically compared a5 165 mm 3.1 times larger 53.3 mm die area original a4 | [
7170,
10755,
9732,
1549,
5647,
8720,
7697,
4114,
9235,
11282,
6165,
11289,
7706,
8222,
1057,
2551,
38,
6183,
1576,
6186,
4139,
6700,
7211,
8237,
9774,
2097,
1074,
8754,
9784,
8250,
576,
7745,
1090,
7235,
7747,
2635,
8783,
4180,
10838,
162... | Test |
8,254 | 4 | Partimage:partimage partimage disk cloning utility linux/unix environments partimage save partitions many formats disk image utilities partimage useful number situations commonly encountered network administrators well advanced computer users maintain systems last stable release 2010 since one partimage authors worked fsarchiver broader functionality partimage common uses partimage follows windows users partimage includes experimental support ntfs partimage supports common linux file systems found many linux distributions including debian live distros ping knoppix systemrescuecd notable features include compression disk image files support backup/restore network file server data encryption partimage uses newt gui partimage limited cloning partitions supported filesystem types includes ext2 ext3 reiserfs fat12 fat16 fat16b fat32 hpfs jfs xfs ufs hfs ntfs partimage support ext4 btrfs | [
7555,
1801,
6797,
3086,
2193,
2197,
2199,
8857,
9762,
3366,
3629,
7983,
8114,
823,
4154,
8772,
7244,
3420,
9693,
5612,
10476,
246,
1150
] | Test |
8,255 | 7 | Numecent:numecent numecent irvine california-based software technology company develops software used deliver native software applications premises server farm cloud patented technology called cloudpaging based virtualization allows delivery pre-virtualized software instructions user machine on-demand instructions executed soon received numecent roots started 1999 darpa project u.c irvine arthur hitomi one three scientists formed endeavors technology inc. irvine california-based software development company project connected computers mobile devices internet work groups developed application delivery technology support groups 2000 tadpole technology plc maker mobile computing devices software purchased endeavors 2004 tadpole also acquired stream theory california-based software company developed technology deploying application software internet across enterprise networks focus gaming market two companies constituted genesis technology later became known cloudpaging 2007 patenting application streaming technology tadpole decided focus solely developing business 2008 tadpole changed name endeavors technologies inc 2009 osman kent sold 3dlabs creative labs 2002 acquired endeavors formed numecent holdings company emerged end-user computing market technology two former employees started united kingdom boston ma-based spinoff called software2 help universities deploy microsoft windows applications physical machines cloud 2012 numecent publicly launched osman kent ceo 2013 numecent software2 announced partnership numecent flagship cloudpaging product application jukebox suite deployed 40 universities uk 2015 application jukebox suite dropped product name favor standalone trademarked name cloudpaging march 2015 numecent announced hiring former broadcom executive vice president tom lagatta ceo osman kent promoted role executive chairman january 2017 co-founder cto arthur hitomi became president ceo company ’ main product cloudpaging enables existing windows applications cloudpage pcs run perform act natively installed cloudpaging server conjunction cloudpaging player allows software delivered cloud pre-virtualizing software encrypted divided small fragments company calls pages pages delivered one time executed client computer software also employs statistical modeling dynamically predict pages sent first cloudpaging makes desktop applications fully available faster less disk space required applications also run computer disconnected internet network outage august 2013 company announced service presently branded cloudpaging cdn introduced launch native-as-a-service naas offered conjunction amazon web services multi-tenant cloud via self-hosting option applications virtualized licenses cloudified made available delivery end users without rewrite recompile underlying source code march 2017 company announced android offering named cloudpaging android utilities cloudpaging technology reduce impact application install sizes android devices numecent announced first spin technology approxy 2012 approxy offers white-label delivery service game developers publishers approxy ’ system reduces delay players allowing start playing seconds download additional code necessary play retrieved piece-by-piece october 2014 numecent announced bringing approxy group back numecent parent attempt attract game industry customers required access cloudpaging source code numecent named gartner cool vendor cloud computing 2013 february 2012 company closed series funding round 2m may 2013 numecent closed series b funding 13.6m t-venture deutsche telecom venture funding arm november 2015 company closed series c funding round 15.5m | [
7248,
4194,
8466,
6797
] | Test |
8,256 | 2 | Open_Network_Install_Environment:open network install environment open network install environment onie open source install environment acts enhanced boot loader utilizing facilities linux/busybox environment small linux operating system allows end-users channel partners install network operating system part data center provisioning similar way servers provisioned operating system choice onie enables network switch hardware suppliers distributors resellers manage operations based small number hardware stock keeping unit skus turn creates economies scale manufacturing distribution stocking return merchandise authorization rma enabling ecosystem network hardware operating system alternatives | [
516,
7983,
2802,
823,
3007
] | Test |
8,257 | 0 | David_Andreoff_Evans:david andreoff evans david andreoff evans born 1948 st. louis scientist field computational linguistics best known research indexing using natural language processing ontology learning especially medical informatics evans attended stanford university receiving ph.d. computational linguistics 1982 attended inter-university center japanese language studies 1979 faculty carnegie mellon university 1983 1996 founded computational linguistics program laboratory computational linguistics 1986 supported grant digital equipment corporation led research project computational-linguistic approaches indexing retrieval text clarit september 1992 clarit spun-out carnegie-mellon company called claritech technology used index papers politician h. john heinz iii claritech became research development subsidiary justsystems name changed clairvoyance corporation 1996 becoming justsystems evans research 2007 made many contributions field computational linguistics information retrieval authoring books many research papers holder 25 us patents evans elected fellow american college medical informatics 1999 | [
1890,
7780
] | Test |
8,258 | 9 | CLISP:clisp computing clisp implementation programming language common lisp originally developed bruno haible michael stoll atari st. today supports unix microsoft windows operating systems clisp includes interpreter bytecode compiler debugger socket interface high-level foreign language interface strong internationalization support two object systems common lisp object system clos metaobject protocol mop written c common lisp part gnu project free software available terms gnu general public license gpl haible originally intend distribute clisp gpl well-publicised email exchange richard stallman eventually agreed issue stake whether clisp derivative work gnu readline library clisp extremely portable running almost unix-based operating systems well microsoft windows although interpreting bytecode usually slower running compiled native binaries always major issue especially applications like web development i/o bottleneck clisp also easier set popular foss common lisps sbcl paul graham used clisp run software viaweb startup viaweb early web application portions still exist yahoo stores base yahoo shopping conrad barski land lisp uses clisp-specific functions textbook exercises | [
10752,
2050,
11269,
2062,
9231,
9749,
8728,
4633,
4122,
8735,
3618,
8226,
2105,
6201,
6717,
8771,
8262,
5703,
10822,
1613,
9299,
3674,
3675,
7267,
8293,
3176,
2666,
2667,
8304,
5751,
7805,
2180,
9865,
6797,
9877,
4779,
5803,
2225,
8883,
7... | Train |
8,259 | 4 | Separation_of_protection_and_security:separation protection security computer sciences separation protection security design choice wulf et al identified protection mechanism security policy therefore making protection-security distinction particular case separation mechanism policy principle adoption distinction computer architecture usually means protection provided fault tolerance mechanism hardware/firmware kernel whereas operating system applications implement security policies design security policies rely therefore protection mechanisms additional cryptography techniques major hardware approach security protection use hierarchical protection domains prominent example approach ring architecture supervisor mode user mode approach adopts policy already lower levels hardware/firmware/kernel restricting rest system rely therefore choice distinguish protection security overall architecture design implies rejection hierarchical approach favour another one capability-based addressing examples models protection security separation include access matrix ucla data secure unix take-grant filter separation found models like high-water mark bell–lapadula original revisited information flow strong dependency constraints | [
4423,
8551,
745,
4299,
9932,
9677,
7983,
6162,
5363,
1013,
8150,
11262,
10968,
2558
] | None |
8,260 | 2 | Unix_time:unix time unix time also known posix time unix epoch time system describing point time number seconds elapsed since 00:00:00 thursday 1 january 1970 coordinated universal time utc minus leap seconds every day treated contains exactly seconds leap seconds subtracted since epoch used widely unix-like many operating systems file formats however unix time true representation utc leap second utc unix time second came unix time may checked unix systems typing command line systems unix time stored signed 32-bit integer largest value recorded 2 − 1 03:14:07 tuesday 19 january 2038 utc following second clock wrap around negative −2 20:45:52 friday 13 december 1901 utc referred year 2038 problem two layers encoding make unix time first layer encodes point time scalar real number represents number seconds passed since 00:00:00utc thursday 1 january 1970 second layer encodes number sequence bits decimal digits standard utc article labels days using gregorian calendar counts times within day hours minutes seconds examples also show international atomic time tai another time scheme uses seconds displayed format utc every day exactly seconds long gradually losing synchronization earth rotation rate roughly one second per year unix time single signed number increments every second without requiring calculations determine year month day month hour minute required intelligibility humans unix epoch time 00:00:00utc 1 january 1970 problem definition utc exist current form 1972 issue discussed brevity remainder section uses iso 8601 date time format unix epoch 1970-01-01t00:00:00z unix time number zero unix epoch increases exactly per day since epoch thus 2004-09-16t00:00:00z days epoch represented unix time number × extended backwards epoch using negative numbers thus 1957-10-04t00:00:00z days epoch represented unix time number × within day unix time number calculated preceding paragraph midnight utc 00:00:00z increases exactly 1 per second since midnight thus 2004-09-16t17:55:43.54z seconds since midnight first day example represented unix time number dates epoch number still increases thus becoming less negative time moves forward unix time based epoch sometimes referred epoch time scheme means normal utc day duration seconds unix time number changes continuous manner across midnight example end day used examples time representations progress follows leap second occurs utc day exactly seconds long unix time number always increases exactly day experiences discontinuity end day negative leap second yet occurred unix time number would jump 1 start next day positive leap second end day occurs every year half average unix time number increases continuously next day leap second end leap second jumps back 1 returning start next day example happened strictly conforming posix.1 systems end 1998 unix time numbers repeated second immediately following positive leap second unix time number thus ambiguous refer either instant middle leap second instant one second later half second midnight utc theoretical case negative leap second occurs ambiguity caused instead range unix time numbers refer point time unix clock often implemented different type positive leap second handling associated network time protocol ntp yields system conform posix standard see section concerning ntp details dealing periods encompass utc leap second difference two unix time numbers equal duration seconds period corresponding points time common computational technique however leap seconds occur calculations give wrong answer applications level accuracy required necessary consult table leap seconds dealing unix times often preferable use different time encoding suffer problem unix time number easily converted back utc taking quotient modulus unix time number modulo quotient number days since epoch modulus number seconds since midnight utc day given unix time number ambiguous due positive leap second algorithm interprets time midnight never generates time leap second given unix time number invalid due negative leap second generates equally invalid utc time conditions significant necessary consult table leap seconds detect commonly mills-style unix clock implemented leap second handling synchronous change unix time number time number initially decreases leap occurred leaps correct time 1 second leap makes implementation easier described mills paper happens across positive leap second decoded properly paying attention leap second state variable unambiguously indicates whether leap performed yet state variable change synchronous leap similar situation arises negative leap second second skipped slightly late briefly system shows nominally impossible time number detected time_del state corrected type system unix time number violates posix around types leap second collecting leap second state variable along time number allows unambiguous decoding correct posix time number generated desired full utc time stored suitable format decoding logic required cope style unix clock would also correctly decode hypothetical posix-conforming clock using interface would achieved indicating time_ins state entirety inserted leap second indicating time_wait entirety following second repeating seconds count requires synchronous leap second handling probably best way express utc time unix clock form via unix interface underlying clock fundamentally untroubled leap seconds another much rarer non-conforming variant unix time keeping involves encoding tai rather utc linux systems configured way tai leap seconds every tai day exactly 86400 seconds long encoding actually pure linear count seconds elapsed since 1970-01-01t00:00:00tai makes time interval arithmetic much easier time values systems suffer ambiguity strictly conforming posix systems ntp-driven systems systems necessary consult table leap seconds correctly convert utc pseudo-unix-time representation resembles manner time zone tables must consulted convert civil time iana time zone database includes leap second information sample code available source uses information convert tai-based time stamps local time conversion also runs definitional problems prior 1972 commencement current form utc see section utc basis tai-based system despite superficial resemblance unix time encodes times values differ several seconds posix time values simple mathematical relationship utc mandated posix unix time number represented form capable representing numbers applications number simply represented textually string decimal digits raising trivial additional problems however certain binary representations unix times particularly significant unix codice_1 data type represents point time many platforms signed integer traditionally 32bits see directly encoding unix time number described preceding section 32 bits means covers range 136 years total minimum representable date friday 1901-12-13 maximum representable date tuesday 2038-01-19 one second 03:14:07utc 2038-01-19 representation overflow milestone anticipated mixture amusement dread—see year 2038 problem newer operating systems codice_1 widened 64 bits expands times representable approximately 293 billion years directions twenty times present age universe per direction originally controversy whether unix codice_1 signed unsigned unsigned range future would doubled postponing 32-bit overflow 68 years however would incapable representing times prior epoch consensus codice_1 signed usual practice software development platform version 6 qnx operating system unsigned 32-bit codice_1 though older releases used signed type posix open group unix specifications include c standard library includes time types functions defined codice_6 header file iso c standard states codice_1 must arithmetic type mandate specific type encoding posix requires codice_1 integer type mandate signed unsigned unix tradition directly representing non-integer unix time numbers binary fractions instead times sub-second precision represented using composite data types consist two integers first codice_1 integral part unix time second fractional part time number millionths codice_10 billionths codice_11 structures provide decimal-based fixed-point data format useful applications trivial convert others present form utc leap seconds defined 1 january 1972 onwards prior since 1 january 1961 older form utc occasional time steps non-integer numbers seconds also utc second slightly longer si second periodically changed continuously approximate earth rotation prior 1961 utc prior 1958 widespread atomic timekeeping eras approximation gmt based directly earth rotation used instead atomic timescale precise definition unix time encoding utc uncontroversial applied present form utc unix epoch predating start form utc affect use era number days 1 january 1970 unix epoch 1 january 1972 start utc question number days significant unix time meaning unix time values i.e. prior 1 january 1972 precisely defined basis unix times best understood unspecified approximation utc computers era rarely clocks set sufficiently accurately provide meaningful sub-second timestamps case unix time suitable way represent times prior 1972 applications requiring sub-second precision applications must least define form ut gmt use possibility ending use leap seconds civil time considered likely means execute change define new time scale called international time initially matches utc thereafter leap seconds thus remaining constant offset tai happens likely unix time prospectively defined terms new time scale instead utc uncertainty whether occur makes prospective unix time less predictable already utc simply leap seconds result would unix-like operating systems codice_12 command print set current time earliest versions unix time 32-bit integer incrementing rate 60 hz rate system clock hardware early unix systems value 60 hz still appears software interfaces result epoch also differed current value first edition unix programmer manual dated 3 november 1971 defines unix time time since 00:00:00 1 january 1971 measured sixtieths second user manual also commented chronologically-minded user note 2**32 sixtieths second 2.5 years limited range epoch redefined rate changed 1 hz epoch set present value 1 january 1970 00:00:00 utc yielded range 136 years though half range past see discussion signedness indicated definition quoted unix time scale originally intended simple linear representation time elapsed since epoch however consideration details time scales implicitly assumed simple linear time scale already available agreed upon first edition manual definition even specify time zone used several later problems including complexity present definition result unix time defined gradually usage rather fully defined outset posix.1 written question arose precisely define codice_1 face leap seconds posix committee considered whether unix time remain intended linear count seconds since epoch expense complexity conversions civil time representation civil time expense inconsistency around leap seconds computer clocks era sufficiently precisely set form precedent one way posix committee swayed arguments complexity library functions firmly defined unix time simple manner terms elements utc time definition simple even encompass entire leap year rule gregorian calendar would make 2100 leap year 2001 edition posix.1 rectified faulty leap year rule definition unix time retained essential definition unix time encoding utc rather linear time scale since mid-1990s computer clocks routinely set sufficient precision matter commonly set using utc-based definition unix time resulted considerable complexity unix implementations network time protocol execute steps unix time number whenever leap seconds occur unix enthusiasts history holding time_t parties pronounced time tea parties celebrate significant values unix time number directly analogous new year celebrations occur change year many calendars use unix time spread practice celebrating milestones usually time values round numbers decimal celebrated following unix convention viewing codice_1 values decimal among groups round binary numbers also celebrated +2 occurred 13:37:04 utc saturday 10 january 2004 events celebrate typically described n seconds since unix epoch inaccurate discussed due handling leap seconds unix time number seconds elapsed since unix epoch slightly greater unix time number times later epoch vernor vinge novel deepness sky describes spacefaring trading civilization thousands years future still uses unix epoch programmer-archaeologist responsible finding maintaining usable code mature computer systems first believes epoch refers time man first walked moon realizes 0-second one humankind first computer operating systems | [
5156,
8260,
10344,
4396,
3309,
823,
1775,
8975,
5492,
5397,
3350,
2199,
7734,
9557,
8186,
6492,
5759
] | None |
8,261 | 1 | No-force:no-force no-force policy used transaction control database theory term no-force refers disk pages related actual database object modified no-force policy transaction commits changes made actual objects required written disk in-place forced record changes must still preserved commit time ensure transaction durable record typically written sequential transaction log actual changes database objects changes written later time frequently changed objects no-force policy allows updates merged reduce number write operations actual database object no-force policy also reduces seek time required commit mostly sequential write operations transaction log rather requiring disk seek many distinct database objects commit | [
4376,
5953
] | Train |
8,262 | 9 | Programming_language:programming language programming language formal language comprises set instructions produce various kinds output programming languages used computer programming implement algorithms programming languages consist instructions computers programmable machines use set specific instructions rather general programming languages early ones preceded invention digital computer first probably automatic flute player described 9th century brothers musa baghdad islamic golden age since early 1800s programs used direct behavior machines jacquard looms music boxes player pianos programs machines player piano scrolls produce different behavior response different inputs conditions thousands different programming languages created created every year many programming languages written imperative form i.e. sequence operations perform languages use declarative form i.e desired result specified achieve description programming language usually split two components syntax form semantics meaning languages defined specification document example c programming language specified iso standard languages perl dominant implementation treated reference languages basic language defined standard extensions taken dominant implementation common programming language notation writing programs specifications computation algorithm authors restrict term programming language languages express possible algorithms traits often considered important constitutes programming language include markup languages like xml html troff define structured data usually considered programming languages programming languages may however share syntax markup languages computational semantics defined xslt example turing complete language entirely using xml syntax moreover latex mostly used structuring documents also contains turing complete subset term computer language sometimes used interchangeably programming language however usage terms varies among authors including exact scope one usage describes programming languages subset computer languages similarly languages used computing different goal expressing computer programs generically designated computer languages instance markup languages sometimes referred computer languages emphasize meant used programming another usage regards programming languages theoretical constructs programming abstract machines computer languages subset thereof runs physical computers finite hardware resources john c. reynolds emphasizes formal specification languages much programming languages languages intended execution also argues textual even graphical input formats affect behavior computer programming languages despite fact commonly turing-complete remarks ignorance programming language concepts reason many flaws input formats early computers colossus programmed without help stored program modifying circuitry setting banks physical controls slightly later programs could written machine language programmer writes instruction numeric form hardware execute directly example instruction add value two memory location might consist 3 numbers opcode selects add operation two memory locations programs decimal binary form read punched cards paper tape magnetic tape toggled switches front panel computer machine languages later termed first-generation programming languages 1gl next step development so-called second-generation programming languages 2gl assembly languages still closely tied instruction set architecture specific computer served make program much human-readable relieved programmer tedious error-prone address calculations first high-level programming languages third-generation programming languages 3gl written 1950s early high-level programming language designed computer plankalkül developed german z3 konrad zuse 1943 1945 however implemented 1998 2000 john mauchly short code proposed 1949 one first high-level languages ever developed electronic computer unlike machine code short code statements represented mathematical expressions understandable form however program translated machine code every time ran making process much slower running equivalent machine code university manchester alick glennie developed autocode early 1950s programming language used compiler automatically convert language machine code first code compiler developed 1952 mark 1 computer university manchester considered first compiled high-level programming language second autocode developed mark 1 r. a. brooker 1954 called mark 1 autocode brooker also developed autocode ferranti mercury 1950s conjunction university manchester version edsac 2 devised d. f. hartley university cambridge mathematical laboratory 1961 known edsac 2 autocode straight development mercury autocode adapted local circumstances noted object code optimisation source-language diagnostics advanced time contemporary separate thread development atlas autocode developed university manchester atlas 1 machine 1954 fortran invented ibm john backus first widely used high-level general purpose programming language functional implementation opposed design paper still popular language high-performance computing used programs benchmark rank world fastest supercomputers another early programming language devised grace hopper us called flow-matic developed univac remington rand period 1955 1959 hopper found business data processing customers uncomfortable mathematical notation early 1955 team wrote specification english programming language implemented prototype flow-matic compiler became publicly available early 1958 substantially complete 1959 flow-matic major influence design cobol since direct descendant aimaco actual use time increased use high-level languages introduced requirement low-level programming languages system programming languages languages varying degrees provide facilities assembly languages high-level languages used perform tasks require direct access hardware facilities still provide higher-level control structures error-checking period 1960s late 1970s brought development major language paradigms use languages spawned descendants modern programming languages count least one ancestry 1960s 1970s also saw considerable debate merits structured programming whether programming languages designed support edsger dijkstra famous 1968 letter published communications acm argued goto statements eliminated higher level programming languages 1980s years relative consolidation c++ combined object-oriented systems programming united states government standardized ada systems programming language derived pascal intended use defense contractors japan elsewhere vast sums spent investigating so-called fifth-generation languages incorporated logic programming constructs functional languages community moved standardize ml lisp rather inventing new paradigms movements elaborated upon ideas invented previous decades one important trend language design programming large-scale systems 1980s increased focus use modules large-scale organizational units code modula-2 ada ml developed notable module systems 1980s often wedded generic programming constructs rapid growth internet mid-1990s created opportunities new languages perl originally unix scripting tool first released 1987 became common dynamic websites java came used server-side programming bytecode virtual machines became popular commercial settings promise write run anywhere ucsd pascal popular time early 1980s developments fundamentally novel rather refinements many existing languages paradigms although syntax often based c family programming languages programming language evolution continues industry research current directions include security reliability verification new kinds modularity mixins delegates aspects database integration microsoft linq fourth-generation programming languages 4gl computer programming languages aim provide higher level abstraction internal computer hardware details 3gls fifth-generation programming languages 5gl programming languages based solving problems using constraints given program rather using algorithm written programmer programming languages primitive building blocks description data processes transformations applied like addition two numbers selection item collection primitives defined syntactic semantic rules describe structure meaning respectively programming language surface form known syntax programming languages purely textual use sequences text including words numbers punctuation much like written natural languages hand programming languages graphical nature using visual relationships symbols specify program syntax language describes possible combinations symbols form syntactically correct program meaning given combination symbols handled semantics either formal hard-coded reference implementation since languages textual article discusses textual syntax programming language syntax usually defined using combination regular expressions lexical structure backus–naur form grammatical structure simple grammar based lisp grammar specifies following following examples well-formed token sequences grammar codice_1 codice_2 codice_3 syntactically correct programs semantically correct many syntactically correct programs nonetheless ill-formed per language rules may depending language specification soundness implementation result error translation execution cases programs may exhibit undefined behavior even program well-defined within language may still meaning intended person wrote using natural language example may possible assign meaning grammatically correct sentence sentence may false following c language fragment syntactically correct performs operations semantically defined operation codice_4 meaning value complex type codice_5 defined value codice_6 null pointer type declaration first line omitted program would trigger error undefined variable p compilation however program would still syntactically correct since type declarations provide semantic information grammar needed specify programming language classified position chomsky hierarchy syntax programming languages specified using type-2 grammar i.e. context-free grammars languages including perl lisp contain constructs allow execution parsing phase languages constructs allow programmer alter behavior parser make syntax analysis undecidable problem generally blur distinction parsing execution contrast lisp macro system perl codice_7 blocks may contain general computations c macros merely string replacements require code execution term semantics refers meaning languages opposed form syntax static semantics defines restrictions structure valid texts hard impossible express standard syntactic formalisms compiled languages static semantics essentially include semantic rules checked compile time examples include checking every identifier declared used languages require declarations labels arms case statement distinct many important restrictions type like checking identifiers used appropriate context e.g adding integer function name subroutine calls appropriate number type arguments enforced defining rules logic called type system forms static analyses like data flow analysis may also part static semantics newer programming languages like java c definite assignment analysis form data flow analysis part static semantics data specified machine must instructed perform operations data example semantics may define strategy expressions evaluated values manner control structures conditionally execute statements dynamic semantics also known execution semantics language defines various constructs language produce program behavior many ways defining execution semantics natural language often used specify execution semantics languages commonly used practice significant amount academic research went formal semantics programming languages allow execution semantics specified formal manner results field research seen limited application programming language design implementation outside academia type system defines programming language classifies values expressions types manipulate types interact goal type system verify usually enforce certain level correctness programs written language detecting certain incorrect operations decidable type system involves trade-off rejects many incorrect programs also prohibit correct albeit unusual programs order bypass downside number languages type loopholes usually unchecked casts may used programmer explicitly allow normally disallowed operation different types typed languages type system used type check programs number languages usually functional ones infer types relieving programmer need write type annotations formal design study type systems known type theory language typed specification every operation defines types data operation applicable example data represented codice_8 string many programming languages dividing number string meaning executed invalid operation may detected program compiled static type checking rejected compiler compilation error message may detected program running dynamic type checking resulting run-time exception many languages allow function called exception handler handle exception example always return -1 result special case typed languages single-typed languages often scripting markup languages rexx sgml one data type–—most commonly character strings used symbolic numeric data contrast untyped language assembly languages allows operation performed data generally sequences bits various lengths high-level untyped languages include bcpl tcl varieties forth practice languages considered typed type theory verifying rejecting operations modern languages offer degree typing many production languages provide means bypass subvert type system trading type-safety finer control program execution see casting static typing expressions types determined prior program executed typically compile-time example 1 2+2 integer expressions passed function expects string stored variable defined hold dates statically typed languages either manifestly typed type-inferred first case programmer must explicitly write types certain textual positions example variable declarations second case compiler infers types expressions declarations based context mainstream statically typed languages c++ c java manifestly typed complete type inference traditionally associated less mainstream languages haskell ml however many manifestly typed languages support partial type inference example c++ java c infer types certain limited cases additionally programming languages allow types automatically converted types example int used program expects float dynamic typing also called latent typing determines type-safety operations run time words types associated run-time values rather textual expressions type-inferred languages dynamically typed languages require programmer write explicit type annotations expressions among things may permit single variable refer values different types different points program execution however type errors automatically detected piece code actually executed potentially making debugging difficult lisp smalltalk perl python javascript ruby examples dynamically typed languages weak typing allows value one type treated another example treating string number occasionally useful also allow kinds program faults go undetected compile time even run time strong typing prevents program faults attempt perform operation wrong type value raises error strongly typed languages often termed type-safe safe alternative definition weakly typed refers languages perl javascript permit large number implicit type conversions javascript example expression codice_9 implicitly converts codice_10 number conversion succeeds even codice_10 codice_12 codice_13 codice_14 string letters implicit conversions often useful mask programming errors strong static generally considered orthogonal concepts usage literature differs use term strongly typed mean strongly statically typed even confusingly mean simply statically typed thus c called strongly typed weakly statically typed may seem odd professional programmers c could weakly statically typed however notice use generic pointer void* pointer allow casting pointers pointers without needing explicit cast extremely similar somehow casting array bytes kind datatype c without using explicit cast codice_15 codice_16 programming languages associated core library sometimes known 'standard library especially included part published language standard conventionally made available implementations language core libraries typically include definitions commonly used algorithms data structures mechanisms input output line language core library differs language language cases language designers may treat library separate entity language however language core library often treated part language users language specifications even require library made available implementations indeed languages designed meanings certain syntactic constructs even described without referring core library example java string literal defined instance codice_17 class similarly smalltalk anonymous function expression block constructs instance library codice_18 class conversely scheme contains multiple coherent subsets suffice construct rest language library macros language designers even bother say portions language must implemented language constructs must implemented parts library programming languages share properties natural languages related purpose vehicles communication syntactic form separate semantics showing language families related languages branching one another artificial constructs also differ fundamental ways languages evolved usage significant difference programming language fully described studied entirety since precise finite definition contrast natural languages changing meanings given users different communities constructed languages also artificial languages designed ground specific purpose lack precise complete semantic definition programming language many programming languages designed scratch altered meet new needs combined languages many eventually fallen disuse although attempts design one universal programming language serves purposes failed generally accepted filling role need diverse programming languages arises diversity contexts languages used one common trend development programming languages add ability solve problems using higher level abstraction earliest programming languages tied closely underlying hardware computer new programming languages developed features added let programmers express ideas remote simple translation underlying hardware instructions programmers less tied complexity computer programs computing less effort programmer lets write functionality per time unit natural language programming proposed way eliminate need specialized language programming however goal remains distant benefits open debate edsger w. dijkstra took position use formal language essential prevent introduction meaningless constructs dismissed natural language programming foolish alan perlis similarly dismissive idea hybrid approaches taken structured english sql language designers users must construct number artifacts govern enable practice programming important artifacts language specification implementation specification programming language artifact language users implementors use agree upon whether piece source code valid program language behavior shall programming language specification take several forms including following implementation programming language provides way write programs language execute one configurations hardware software broadly two approaches programming language implementation compilation interpretation generally possible implement language using either technique output compiler may executed hardware program called interpreter implementations make use interpreter approach distinct boundary compiling interpreting instance implementations basic compile execute source line time programs executed directly hardware usually run much faster interpreted software one technique improving performance interpreted programs just-in-time compilation virtual machine execution translates blocks bytecode going used machine code direct execution hardware although commonly used programming languages fully open specifications implementations many programming languages exist proprietary programming languages implementation available single vendor may claim proprietary language intellectual property proprietary programming languages commonly domain specific languages internal scripting languages single product proprietary languages used internally within vendor others available external users programming languages exist border proprietary open example oracle corporation asserts proprietary rights aspects java programming language microsoft c programming language open implementations parts system also common language runtime clr closed environment many proprietary languages widely used spite proprietary nature examples include matlab vbscript wolfram language languages may make transition closed open example erlang originally ericsson internal programming language thousands different programming languages created mainly computing field software commonly built 5 programming languages programming languages differ forms human expression require greater degree precision completeness using natural language communicate people human authors speakers ambiguous make small errors still expect intent understood however figuratively speaking computers exactly told understand code programmer intended write combination language definition program program inputs must fully specify external behavior occurs program executed within domain control program hand ideas algorithm communicated humans without precision required execution using pseudocode interleaves natural language code written programming language programming language provides structured mechanism defining pieces data operations transformations may carried automatically data programmer uses abstractions present language represent concepts involved computation concepts represented collection simplest elements available called primitives programming process programmers combine primitives compose new programs adapt existing ones new uses changing environment programs computer might executed batch process without human interaction user might type commands interactive session interpreter case commands simply programs whose execution chained together language run commands interpreter unix shell command-line interface without compiling called scripting language determining widely used programming language difficult since definition usage varies context one language may occupy greater number programmer hours different one lines code third may consume cpu time languages popular particular kinds applications example cobol still strong corporate data center often large mainframes fortran scientific engineering applications ada aerospace transportation military real-time embedded applications c embedded applications operating systems languages regularly used write many different kinds applications various methods measuring language popularity subject different bias measured proposed combining averaging information various internet sites stackify.com reported ten popular programming languages descending order overall popularity java c c++ python c javascript vb .net r php matlab dialect programming language data exchange language relatively small variation extension language change intrinsic nature languages scheme forth standards may considered insufficient inadequate illegitimate implementors often deviate standard making new dialect cases dialect created use domain-specific language often subset lisp world languages use basic s-expression syntax lisp-like semantics considered lisp dialects although vary wildly say racket clojure common one language several dialects become quite difficult inexperienced programmer find right documentation basic programming language many dialects explosion forth dialects led saying 've seen one forth ... 've seen one forth overarching classification scheme programming languages given programming language usually single ancestor language languages commonly arise combining elements several predecessor languages new ideas circulation time ideas originate one language diffuse throughout family related languages leap suddenly across familial gaps appear entirely different family task complicated fact languages classified along multiple axes example java object-oriented language encourages object-oriented organization concurrent language contains built-in constructs running multiple threads parallel python object-oriented scripting language broad strokes programming languages divide programming paradigms classification intended domain use general-purpose programming languages distinguished domain-specific programming languages traditionally programming languages regarded describing computation terms imperative sentences i.e issuing commands generally called imperative programming languages great deal research programming languages aimed blurring distinction program set instructions program assertion desired answer main feature declarative programming refined paradigms include procedural programming object-oriented programming functional programming logic programming languages hybrids paradigms multi-paradigmatic assembly language much paradigm direct model underlying machine architecture purpose programming languages might considered general purpose system programming languages scripting languages domain-specific languages concurrent/distributed languages combination general purpose languages designed largely educational goals programming language may also classified factors unrelated programming paradigm instance programming languages use english language keywords minority languages may classified deliberately esoteric | [
6147,
6148,
10246,
10251,
2062,
15,
6160,
6161,
2066,
6163,
10261,
4121,
4122,
8219,
8221,
6176,
8225,
8226,
10273,
4134,
4136,
8244,
2102,
2103,
4151,
2105,
58,
60,
8252,
8258,
6212,
69,
2117,
2120,
6218,
2132,
6228,
8278,
10324,
8280,
... | None |
8,263 | 2 | Donna_Benjamin:donna benjamin donna benjamin australian open source community contributor commentator advocate served board positions community organisations including open source industry australia drupal association ada initiative lead organiser 2008 linux.conf.au conference melbourne regularly runs community leadership summit x lca clsxlca workshop focussing community development open source projects 2011 organised crowdfunding campaign called digitise dawn successfully raised funds digitise dawn early feminist journal published australia 1888 1905 2012 received rusty wrench award linux australia recognition contributions runs micro-business called creative contingencies specialises drupal content management platform | [
1026,
5644,
4367,
8848,
657,
10642,
1939,
2581,
3478,
6808,
7450,
6302,
7584,
802,
5410,
6691,
6947,
8354,
5931,
8364,
1717,
823,
2109,
11069,
10687,
10822,
843,
589,
6352,
4177,
11602,
8787,
4437,
6489,
3802,
4831,
9696,
11232,
7793,
139... | Test |
8,264 | 4 | KARMA_attack:karma attack information security karma attack exploits behaviour wi-fi devices combined lack access point authentication numerous wifi protocols variant evil twin attack details attack first published 2004 dino dai zovi shaun macaulay vulnerable client devices broadcast preferred network list pnl contains ssids access points previously connected willing automatically reconnect without user intervention broadcasts encrypted hence may received wifi access point range karma attack consists access point receiving list giving ssid pnl thus becoming evil twin access point already trusted client done client receives malicious access point signal strongly genuine access point example genuine access point nowhere nearby client attempt authenticate access point attack succeed attack succeeds malicious access point becomes man middle mitm positions deploy attacks victim device distinguishes karma plain evil twin attack use pnl allows attacker know rather simply guess ssids client automatically attempt connect | [
9640,
2734,
9968,
5373,
4863
] | None |
8,265 | 5 | Layer_2_Tunneling_Protocol:layer 2 tunneling protocol computer networking layer 2 tunneling protocol l2tp tunneling protocol used support virtual private networks vpns part delivery services isps provide encryption confidentiality rather relies encryption protocol passes within tunnel provide privacy published 2000 proposed standard rfc 2661 l2tp origins primarily two older tunneling protocols point-to-point communication cisco layer 2 forwarding protocol l2f microsoft's point-to-point tunneling protocol pptp new version protocol l2tpv3 appeared proposed standard rfc 3931 2005 l2tpv3 provides additional security features improved encapsulation ability carry data links simply point-to-point protocol ppp ip network example frame relay ethernet atm etc. entire l2tp packet including payload l2tp header sent within user datagram protocol udp datagram virtue transmission udp rather tcp c.f sstp avoids tcp meltdown problem common carry ppp sessions within l2tp tunnel l2tp provide confidentiality strong authentication ipsec often used secure l2tp packets providing confidentiality authentication integrity combination two protocols generally known l2tp/ipsec discussed two endpoints l2tp tunnel called lac l2tp access concentrator lns l2tp network server lns waits new tunnels tunnel established network traffic peers bidirectional useful networking higher-level protocols run l2tp tunnel facilitate l2tp session 'call established within tunnel higher-level protocol ppp either lac lns may initiate sessions traffic session isolated l2tp possible set multiple virtual networks across single tunnel mtu considered implementing l2tp packets exchanged within l2tp tunnel categorized either control packets data packets l2tp provides reliability features control packets reliability data packets reliability desired must provided nested protocols running within session l2tp tunnel l2tp allows creation virtual private dialup network vpdn connect remote client corporate network using shared infrastructure could internet service provider network l2tp tunnel extend across entire ppp session across one segment two-segment session represented four different tunneling models namely l2tp packet consists field meanings time setup l2tp connection many control packets exchanged server client establish tunnel session direction one peer requests peer assign specific tunnel session id control packets using tunnel session id data packets exchanged compressed ppp frames payload list l2tp control messages exchanged lac lns handshaking establishing tunnel session voluntary tunneling method lack confidentiality inherent l2tp protocol often implemented along ipsec referred l2tp/ipsec standardized ietf rfc 3193 process setting l2tp/ipsec vpn follows process complete l2tp packets endpoints encapsulated ipsec since l2tp packet wrapped hidden within ipsec packet original source destination ip address encrypted within packet also necessary open udp port 1701 firewalls endpoints since inner packets acted upon ipsec data decrypted stripped takes place endpoints potential point confusion l2tp/ipsec use terms tunnel secure channel term tunnel-mode refers channel allows untouched packets one network transported another network case l2tp/ppp allows l2tp/ppp packets transported ip secure channel refers connection within confidentiality data guaranteed l2tp/ipsec first ipsec provides secure channel l2tp provides tunnel windows native support configurable control panel l2tp since windows 2000 windows vista added 2 alternative tools mmc snap-in called windows firewall advanced security wfwas netsh advfirewall command-line tool one limitation wfwas netsh commands servers must specified ip address windows 10 added add-vpnconnection set-vpnconnectionipsecconfiguration powershell commands registry key must created client server server behind nat-t device l2tp often used isps internet service example adsl cable resold end user packets travel wholesale network service provider network server called broadband remote access server bras protocol converter router combined legacy networks path end user customer premises equipment bras may atm network ip network l2tp tunnel runs bras acting lac lns edge router boundary ultimate destination isp ip network see example reseller isps using l2tp | [
10242,
1030,
8211,
6681,
6682,
10271,
6689,
9251,
9764,
2085,
7208,
3629,
7214,
8238,
562,
1586,
9269,
11321,
3133,
5181,
6723,
11332,
4687,
1618,
2136,
10341,
9318,
10344,
3695,
4723,
5749,
2679,
4729,
6779,
5251,
9860,
5254,
649,
10889,
... | None |
8,266 | 2 | FreeBSD_version_history:freebsd version history released november 1993 1.1.5.1 released july 1994 2.0-release announced 22 november 1994 final release freebsd 2 2.2.8-release announced 29 november 1998 freebsd 2.0 first version freebsd claimed legally free unix code approval novell first version widely used beginnings spread internet servers 2.2.9-release released april 1 2006 fully functional april fools day prank seventy-seven months tireless work freebsd developers users children pets freebsd 3.0-release announced 16 october 1998 final release 3.5-release announced 24 june 2000 freebsd 3.0 first branch able support symmetric multiprocessing smp systems using giant lock marked transition a.out elf executables usb support first introduced freebsd 3.1 first gigabit network cards supported 3.2-release 4.0-release appeared march 2000 last 4-stable branch release 4.11 january 2005 supported 31 january 2007 freebsd 4 lauded stability favorite operating system isps web hosting providers first dot-com bubble widely regarded one stable high performance operating systems whole unix lineage among new features freebsd 4 codice_1 introduced part major bsd systems jails way running processes separate environments version 4.8 forked matt dillon create dragonfly bsd almost three years development first 5.0-release january 2003 widely anticipated featuring support advanced multiprocessor application threading ultrasparc ia-64 platforms first 5-stable release 5.3 5.0 5.2.1 cut -current last release 5-stable branch 5.5 may 2006 largest architectural development freebsd 5 major change low-level kernel locking mechanisms enable better symmetric multi-processor smp support released much kernel mp lock sometimes called giant lock one process could execute kernel mode time major changes included n native threading implementation called kernel scheduled entities kse principle similar scheduler activations starting freebsd 5.3 kse default threading implementation replaced 1:1 implementation freebsd 7.0 freebsd 5 also significantly changed block i/o layer implementing geom modular disk i/o request transformation framework contributed poul-henning kamp geom enables simple creation many kinds functionality mirroring gmirror encryption gbde geli work supported sponsorship darpa early versions 5.x much developer previews pronounced instability 5.4 5.5 releases freebsd confirmed technologies introduced freebsd 5.x branch future highly stable high-performing releases freebsd 6.0 released 4 november 2005 final freebsd 6 release 6.4 11 november 2008 versions extended work smp threading optimization along work advanced 802.11 functionality trustedbsd security event auditing significant network stack performance enhancements fully preemptive kernel support hardware performance counters hwpmc main accomplishments releases include removal giant lock vfs implementation better-performing optional libthr library 1:1 threading addition basic security module bsm audit implementation called openbsm created trustedbsd project based bsm implementation found apple open source darwin released bsd-style license freebsd 7.0 released 27 february 2008 final freebsd 7 release 7.4 24 february 2011 new features included sctp ufs journaling experimental port sun zfs file system gcc4 improved support arm architecture jemalloc memory allocator optimized parallel computation ported firefox 3 major updates optimizations relating network audio smp performance benchmarks showed significant performance improvements compared previous freebsd releases well linux new ule scheduler much improved decision made ship 7.0 release older 4bsd scheduler leaving ule kernel compile-time tunable freebsd 7.1 ule default i386 amd64 architectures dtrace support integrated version 7.1 netbsd freebsd 7.2 brought support multi-ipv4/ipv6 jails code supporting dec alpha architecture supported since freebsd 4.0 removed freebsd 7.0 freebsd 8.0 officially released 25 november 2009 freebsd 8 branched trunk august 2009 features superpages xen domu support network stack virtualization stack-smashing protection tty layer rewrite much updated improved zfs support new usb stack usb 3.0 xhci support added freebsd 8.2 multicast updates including igmpv3 rewritten nfs client/server introducing nfsv4 aes acceleration supported intel cpus added freebsd 8.2 inclusion improved device mmap extensions enables implementation 64-bit nvidia display driver x86-64 platform pluggable congestion control framework support ability use dtrace applications running linux emulation added freebsd 8.3 freebsd 8.4 released 7 june 2013 final release freebsd 8 series freebsd 9.0 released 12 january 2012 key features release include new installer bsdinstall ufs journaling zfs version 28 userland dtrace nfsv4-compatible nfs server client usb 3.0 support support running playstation 3 capsicum sandboxing llvm 3.0 base system kernel base system could built clang freebsd 9.0 still used gcc4.2 default playstation 4 video game console uses derived version freebsd 9.0 sony computer entertainment dubbed orbis os freebsd 9.1 released 31 december 2012 freebsd 9.2 released 30 september 2013 freebsd 9.3 released 16 july 2014 20 january 2014 freebsd release engineering team announced availability freebsd 10.0-release key features include deprecation gcc favor clang new iscsi implementation virtio drivers out-of-the-box kvm support fuse implementation freebsd 10.1-release announced 14 november 2014 supported extended term 31 december 2016 subsequent 10.2-release reached eol day october 2017 10.4-release final release branch announced support 10 series terminated october 2018 10 october 2016 freebsd release engineering team announced availability freebsd 11.0-release freebsd 12.0-release announced december 2018 following table presents version release history freebsd operating system timeline shows span single release generation freebsd lasts around 5 years since freebsd project makes effort binary backward limited forward compatibility within release generation allows users 5+ years support trivial-to-easy upgrading within release generation | [
10761,
533,
2584,
4636,
1071,
9784,
5177,
3142,
5710,
7249,
7252,
9306,
10332,
2143,
607,
7270,
9320,
8816,
9844,
9335,
633,
9343,
2180,
3218,
5270,
3742,
9374,
2212,
684,
10924,
3248,
1718,
7863,
5819,
11459,
9927,
8395,
8909,
6864,
1045... | Validation |
8,267 | 4 | AlgoSec:algosec algosec provider software network security policy management also known firewall policy management algosec products automate management enforcement security policies across firewalls routers virtual private networks vpns related security devices enterprises use algosec products manage configuration security systems identify vulnerabilities test systems security policies reduce administrative costs ensure compliance regulations pci-dss sarbanes-oxley algosec delivers products standalone modules well via integrated suite algosec security management suite includes integration products suite provides two-way link two processes products available software loaded appliance algosec ’ core technology developed 2001 prof. avishai wool team researchers bell laboratories prof wool teamed yuval baron found algosec 2004 time company headquartered reston virginia 2010 algosec moved headquarters north american sales office roswell georgia atlanta area 2012 algosec moved headquarters ridgefield park new jersey today addition boston office algosec sales offices london singapore research development center petah tikva israel london algosec customers include enterprises managed service providers auditors consultants throughout world | [
939,
8998,
4119
] | Validation |
8,268 | 3 | ΜClinux:μclinux μclinux variation linux kernel previously maintained fork targets microcontrollers without memory management unit mmu integrated mainline development 2.5.46 project continues develop patches tools microcontrollers homepage lists linux kernel releases 2.0 2.4 2.6 end-of-life mainline letters μc microcontroller name pronounced you-see-linux rather pronouncing letter mu greek μclinux originally created d. jeff dionne kenneth albanowski 1998 initially targeted motorola dragonball family embedded 68k processors specifically 68ez328 series used motorola palmpilot 2.0.33 linux kernel releasing initial work developer community quickly sprang extending work newer kernels microprocessor architectures early 1999 support added motorola freescale coldfire family embedded microprocessors arm processor support added later although originally targeting 2.0 series linux kernels ports based linux 2.4 linux 2.6 linux 2.4 ports forward ported 2.0.36 linux kernel michael leslie evan stawnyczy work rt-control never μclinux extensions applied 2.2 series kernels since version 2.5.46 linux kernel major parts μclinux integrated mainline kernel number processor architectures greg ungerer originally ported μclinux motorola coldfire family processors continues maintain actively push core μclinux support 2.6 series linux kernels regard μclinux essentially longer separate fork linux project continues develop patches supporting tools using linux microcontrollers μclinux support many architectures forms basis many products like network routers security cameras dvd mp3 players voip phone gateways scanners card readers current list includes | [
516,
4616,
3082,
5139,
10780,
10785,
3618,
6180,
10791,
8242,
9266,
4161,
8772,
6213,
8268,
589,
593,
6244,
5222,
10856,
4207,
5244,
4734,
11391,
7812,
7820,
7821,
4238,
10382,
1170,
2195,
2711,
6808,
9882,
1694,
2723,
8355,
4773,
8364,
1... | Test |
8,269 | 7 | Redis_Labs:redis labs redis labs originally garantia data private computer software company based mountain view california provides database management system marketed nosql open source software service using cloud computing company additional offices london tel aviv redis labs founded 2011 ofer bengal previously founder ceo rit technologies yiftach shoolman previously founder president crescendo networks acquired f5 networks july 15 2015 creator redis lead developer salvatore sanfilippo joined redis labs lead open source development redis labs became official sponsor open source project company secured 4 million seed funding angel investors august 2012 additional 9 million series funding led bain capital ventures carmel ventures additional 15m series b funding led existing investors silicon valley bank additional 14 million series c funding led investors august 2017 raised 44 million series funding february 2019 60 million series e funding led francisco partners participation existing investors company announced beta version cloud services gigaom ’ structure launchpad june 2012 according business edge redis enterprise cloud especially suitable “ web companies websites seasonal occasional fluctuations traffic performance needs january 2013 company 1,000 paying customers including electronic arts illumina scopely redis enterprise cloud memcached cloud products became generally available february 2013 late 2013 redis labs announced focus mainly cloud-based redis offering although continue support memcached product september 2013 amazon web services announced redis capabilities elasticache product thereby competing company offering according techcrunch redis labs advantage aws comes redis scalability high availability features elasticache provide october 2013 redis labs acquired myredis competing hosted redis provider december 2013 company least 10,000 users including 1,300 paying customers january 29 2014 company changed name garantia data redis labs september 2014 redis labs reported 3,000 paying customers including bleacher report hoteltonight docker early 2015 redis labs made available redis enterprise pack formerly known redis labs enterprise cluster rlec downloadable software installation enterprise-grade clusters acts container managing running multiple redis databases early 2016 redis labs made available connector package apache spark may 2016 company announced mechanism developers extend redis opened online marketplace offers modules certified work open source redis redis labs ’ enterprise products redis labs provides downloadable software known redis enterprise software redis enterprise vpc cloud computing service known redis enterprise cloud products address two primary challenges faced redis users redis scalable beyond single node limited reliability high availability capabilities redis enterprise software redis enterprise vpc redis enterprise cloud solve problems provide following additional functionalities regular redis installation redis modules expansion redis key-value store multi-model database using custom made data-types introduced salvatore sanfilippo order prevent scope creep core redis redis modules redis source available license current modules include redis enterprise achieve scalability high availability using proprietary dynamic clustering engine services virtualize multiple cloud servers large pool memory consumed users according actual size datasets dataset automatically distributed shards across multiple nodes enables fast transparent recovery node fails improves performance high-throughput use cases datasets also constantly replicated node fails auto-switchover mechanism guarantees data served without interruption provide additional reliability entire dataset constantly replicated nodes persistent storage also backed remote persistent storage disaster recovery redis labs offers pay-per-use pricing model allowing users pay per gb-hour storage used unlike providers price service based size machine instance even users consume machine ’ resources redis enterprise cloud memcached cloud available amazon web services us eu apac windows azure ibm softlayer heroku bluemix appfog appharbor cloud foundry openshift november 2013 company announced redis enterprise cloud memcached cloud plugins new relic ’ plugin central plugin enable developers use new relic monitor redis memcached usage characteristics directly new relic dashboard | [
4194,
5178,
9828,
8810,
4781,
8495,
7248,
7347,
2842,
5499,
9631
] | None |
8,270 | 4 | National_identity_cards_in_the_European_Economic_Area:national identity cards european economic area national identity cards issued citizens governments european union member states except denmark ireland united kingdom also liechtenstein citizens holding national identity card states eea swiss citizenship use identity document within home country also travel document exercise right free movement eea switzerland identity cards state eea swiss citizenship including national identity cards issued residents citizens valid travel document within eea switzerland national identity cards often accepted parts world unofficial identification purposes age verification commercial establishments serve sell alcohol checking hotels sometimes official purposes proof identity/nationality authorities especially machine-readable cards four eea member states issue cards defined eu national identity cards citizens denmark iceland norway united kingdom except residents gibraltar although norway expected start issuing cards 2020 present citizens four countries use passport travel document travelling eea member states switzerland however travelling within schengen area common travel area valid identity documentation driving licence ehic card often sufficient ireland issues passport card valid national identity card eu countries alternative presenting passport eea swiss citizens entitled use valid national identity card travel document exercise right free movement european economic area switzerland strictly speaking necessary eea swiss citizen possess valid national identity card passport enter eea switzerland theory eea swiss citizen outside eea switzerland prove nationality means e.g presenting expired national identity card passport citizenship certificate must permitted enter eea switzerland eea swiss citizen unable demonstrate nationality satisfactorily must nonetheless given 'every reasonable opportunity obtain necessary documents delivered within reasonable period time additionally eea swiss citizens enter number countries territories outside eea switzerland strength national identity cards alone without need present passport border authorities although swedish finnish law allow citizens travel outside eea/switzerland without passport practice meaning direct outbound travel sweden/finland countries id card possible probably including uk brexit deal since change relevant law included swedish law change brexit countries however following accept national id cards eea/swiss citizens short-term visits require passport take residency turkey allows citizens belgium france germany greece italy liechtenstein luxembourg malta netherlands portugal spain switzerland enter short-term visits using national identity card egypt allows citizens belgium france germany italy portugal enter using national identity card short-term visits tunisia allows nationals austria belgium france germany italy luxembourg netherlands portugal spain sweden switzerland enter using national identity card travelling organized tour anguilla dominica saint lucia allow nationals france enter using national id card dominica de facto also allows nationals least germany sweden enter national id card march 2016 gambia allows nationals belgium enter using national id card finally greenland allows nordic citizens enter national id card sweden finland whereas norway introduce 2020 practice eea swiss citizens use id cards passport control takes place arrival greenland airline check-in gate air greenland icelandair accept eea swiss id card although matter european law holders swedish national identity card entitled use travel document european union member state regardless whether belongs schengen area swedish national law recognise card valid travel document outside schengen area july 2015 direct violation european law meant practice leaving schengen directly sweden i.e. without making stopover another schengen country card possible partially changed july 2015 travel non-schengen countries eu others even accept id card permitted similarly finnish citizens leave finland directly non eu/efta country id cards uk border force officials known place extra scrutiny spend longer processing national identity cards issued certain member states deemed limited security features hence susceptible tampering/forgery unlike counterparts schengen area previous legal regime force 7 april 2017 obliged perform 'rapid 'straightforward visual check signs falsification tampering obliged use technical devices – document scanners uv light magnifiers – eea swiss citizens presented passports and/or national identity cards external border checkpoints matter policy ukbf officials required examine physically passports national identity cards presented eea swiss citizens signs forgery tampering addition unlike counterparts schengen area previous legal regime force 7 april 2017 presented passport national identity card eea swiss citizen legally obliged check database lost/stolen/invalidated travel documents – could perform 'rapid 'straightforward database check – could check see traveller database containing persons interest strictly 'non-systematic basis threat 'genuine 'present 'sufficiently serious matter policy ukbf officials required check every eea swiss citizen passport/national identity card warnings index wi database note however effect 7 april 2017 mandatory border officials schengen area check systematic basis travel documents eea swiss citizens crossing external borders relevant databases ref name= reg2017/458 regulation eu 2017/458 european parliament council 15 march 2017 amending regulation eu 2016/399 regards reinforcement checks relevant databases external borders oj l 74 18 march 2017 p.1 /ref reason presented non-machine readable identity card take four times longer ukbf official process card official enter biographical details holder manually computer check wi database large number possible matches returned different configuration entered reduce number possible matches example stansted airport ukbf officials known take longer process italian paper identity cards often need taken plastic wallets particularly susceptible forgery/tampering non-machine readable documents holders biographical details entered manually computer according statistics published frontex 2015 top 6 eu member states whose national identity cards falsified detected external border crossing points schengen area italy spain belgium greece france romania countries remained top 6 2016 varying rules domestic usage identity documents countries demand usage national identity card passport countries allow usage documents like driver licenses countries e.g austria finland sweden national identity cards fully voluntary needed everyone identity documents like driving licences accepted domestically countries minority national identity card since majority passport driving licence n't need identity documents also true ireland passport driving licence less need passport card eea swiss citizens exercising right free movement another eea member state switzerland entitled use national identity card identification document dealing government authorities also private sector service providers example supermarket uk refuses accept german national identity card proof age german citizen attempts purchase age-restricted product insists production uk-issued passport driving licence identity document supermarket would effect discriminating individual basis his/her nationality provision service thereby contravening prohibition art 20 2 directive 2006/123/ec discriminatory treatment relating nationality service recipient conditions access service made available public large service provider 11 june 2014 guardian published leaked internal documents hm passport office uk revealed government officials dealt british passport applications sent overseas treated eu citizen counter-signatories differently depending nationality leaked internal documents showed citizens austria belgium czech republic estonia finland germany hungary latvia lithuania luxembourg malta netherlands poland portugal slovakia slovenia sweden acted counter-signatory support application british passport made someone knew hm passport office would willing accept copy counter-signatory passport national identity card hm passport office considered national identity cards issued citizens member states acceptable taking account 'quality identity card design rigour issuing process relatively low level documented abuse documents uk/schengen borders ability access samples identity cards comparison purposes contrast citizens eu member states bulgaria croatia cyprus france greece italy romania spain acting counter-signatories could submit copy passport national identity card prove identity national identity cards issued member states deemed hm passport office less secure susceptible fraud/forgery day following revelations 12 june 2014 home office hm passport office withdrew leaked internal guidance relating eu citizen counter-signatories submitting copy national identity card instead passport proof identity eu citizen counter-signatories able submit copy passport national identity card 13 july 2005 justice home affairs council called european union member states adopt common designs security features national identity cards december 2005 detailed standards laid soon possible thereafter 4 december 2006 european union member states agreed adopt following common designs minimum security standards national identity cards draft resolution 15 november 2006 card made paper core laminated sides made entirely synthetic substrate data card shall contain least name birth date nationality photo signature card number end date validity cards contain information height eye colour start date validity sex issue place province birth place biographical data card machine readable follow icao specification machine-readable travel documents eu regulation revising schengen borders code entered force 7 april 2017 introduced systematic checks travel documents eu eea swiss citizens relevant databases entering leaving schengen area states member states phase travel documents including national identity cards machine-readable however 2017 greece continues issue solely non-machine readable identity cards italy process phasing issuing non-machine readable paper booklets favour biometric cards eea electronic identity cards comply iso/iec standard 14443 effectively means cards implement electromagnetic coupling card card reader specifications followed capable read proximities less 0.1 metres rfid tags often seen stores attached livestock neither work relatively large distances typically seen us toll booths automated border crossing channels icao specifications adopted nearly european passport booklets basic access control bac means miscreants able read cards unless also physical access card bac authentication keys derive three lines data printed mrz obverse td1 format identity card begins according iso 14443 standard wireless communication card reader start identity card chip transmitted unique identifier theoretically ingenious attacker managed secrete multiple reading devices distributed array eg arrival hall furniture could distinguish bearers mrotds without access relevant chip files concert information attacker might able produce profiles specific particular card consequently bearer defence trivial task electronic cards make new randomised uids every session nh08 preserve level privacy comparable contact cards commercial rfid tags electronic identity cards austria belgium estonia finland germany italy liechtenstein lithuania portugal spain digital signature application upon activation enables bearer authenticate card using confidential pin consequently least theoretically authenticate documents satisfy third party document altered digitally signed application uses registered certificate conjunction public/private key pairs enhanced cards necessarily participate online transactions unknown number national european identity cards issued different functionalities authentication online also additional contact chip containing electronic signature functionality swedish national identity card portugal card emv application removed newer versions 16 january 2016 member states issue variety national identity cards differing technical specifications according differing issuing procedures | [
3128,
5868,
3566,
10943
] | Test |
8,271 | 1 | TheOfficialBoard:theofficialboard official board online contact database database maintains up-to-date corporate organizational data charts world private public companies exceeding 100 million revenue includes 50,000 companies data updated industry experts members site verified company used research organizational structures find contact information corporate executives official board founded amazon apple inc. executive thomas lot 2009 based france june 12 2014 official board released iphone application august 26 2014 official board released 18-month-long survey study presence female executives board members world largest companies concluded women least represented chairman board chief executive officer functions | [
9732,
2901,
735
] | None |
8,272 | 2 | OS/VS2:os/vs2 operating system/virtual storage 2 os/vs2 successor operating system os/360 mvt os/360 family | [
8290,
6342,
6442,
1323,
7053,
8911,
10040,
2616,
9977,
2813
] | Train |
8,273 | 4 | Timing_attack:timing attack cryptography timing attack side-channel attack attacker attempts compromise cryptosystem analyzing time taken execute cryptographic algorithms every logical operation computer takes time execute time differ based input precise measurements time operation attacker work backwards input information leak system measurement time takes respond certain queries much information help attacker depends many variables cryptographic system design cpu running system algorithms used assorted implementation details timing attack countermeasures accuracy timing measurements etc timing attacks often overlooked design phase dependent implementation introduced inadvertently compiler optimizations avoidance timing attacks involves design constant-time functions careful testing final executable code timing attack example attack exploits data-dependent behavioral characteristics implementation algorithm rather mathematical properties algorithm many cryptographic algorithms implemented masked proxy way reduces eliminates data dependent timing information consider implementation every call subroutine always returns exactly x seconds x maximum time ever takes execute routine every possible authorized input implementation timing algorithm leaks information data supplied invocation downside approach time used executions becomes worst-case performance function timing attacks practical many cases execution time square-and-multiply algorithm used modular exponentiation depends linearly number 1 bits key number 1 bits alone nearly enough information make finding key easy repeated executions key different inputs used perform statistical correlation analysis timing information recover key completely even passive attacker observed timing measurements often include noise sources network latency disk drive access differences access access error correction techniques used recover transmission errors nevertheless timing attacks practical number encryption algorithms including rsa elgamal digital signature algorithm 2003 boneh brumley demonstrated practical network-based timing attack ssl-enabled web servers based different vulnerability use rsa chinese remainder theorem optimizations actual network distance small experiments attack successfully recovered server private key matter hours demonstration led widespread deployment use blinding techniques ssl implementations context blinding intended remove correlations key encryption time versions unix use relatively expensive implementation crypt library function hashing 8-character password 11-character string older hardware computation took deliberately measurably long time much two three seconds cases login program early versions unix executed crypt function login name recognized system leaked information timing validity login name even password incorrect attacker could exploit leaks first applying brute-force produce list login names known valid attempt gain access combining names large set passwords known frequently used without information validity login names time needed execute approach would increase orders magnitude effectively rendering useless later versions unix fixed leak always executing crypt function regardless login name validity two otherwise securely isolated processes running single system either cache memory virtual memory communicate deliberately causing page faults and/or cache misses one process monitoring resulting changes access times likewise application trusted paging/caching affected branching logic may possible second application determine values data compared branch condition monitoring access time changes extreme examples allow recovery cryptographic key bits 2017 meltdown spectre attacks forced cpu manufacturers including intel amd arm ibm redesign cpus rely timing attacks early 2018 almost every computer system world affected spectre making powerful example timing attack history following visual basic code demonstrates typical insecure string comparison stops testing soon character n't match example comparing abcde abxde return 3 loop iterations function insecurecompare stra string strb string length integer boolean end function comparison following version runs constant-time testing characters using bitwise operations test without conditional jumps function securecompare stra string strb string length integer boolean end function timing attacks easier mount adversary knows internals hardware implementation even cryptographic system use since cryptographic security never depend obscurity either see security obscurity specifically shannon maxim kerckhoffs principle resistance timing attacks either nothing else exemplar purchased reverse engineered timing attacks side-channel attacks may also useful identifying possibly reverse-engineering cryptographic algorithm used device | [
5636,
7556,
2567,
3084,
2957,
7056,
7313,
658,
11539,
660,
1173,
1941,
3615,
4128,
4389,
10662,
169,
7853,
11185,
2357,
10806,
1847,
6968,
9528,
2110,
8644,
9541,
10442,
10315,
847,
6863,
2514,
7635,
212,
9556,
86,
5590,
10963,
2265,
1134... | Test |
8,274 | 4 | Joint_Services_Publication_440:joint services publication 440 joint services publication 440 jsp 440 name british 2001 ministry defence 2,400-page restricted security manual detailing requirements units regards areas security physical electronic interpreted media instructions avoiding leaks due hackers journalists foreign spies however small part document publication posted wikileaks 3 october 2009 | [
11172,
4595,
4956
] | Test |
8,275 | 2 | Input/output_completion_port:input/output completion port input/output completion port iocp api performing multiple simultaneous asynchronous input/output operations windows nt versions 3.5 later aix solaris 10 later input/output completion port object created associated number sockets file handles i/o services requested object completion indicated message queued i/o completion port process requesting i/o services notified completion i/o services instead checks i/o completion port message queue determine status i/o requests i/o completion port manages multiple threads concurrency | [
5029,
9355,
11245,
8976,
8275,
692,
5815,
792,
636
] | None |
8,276 | 4 | Marshall_Carter:marshall carter marshall sylvester carter september 16 1909 – february 18 1993 lieutenant general united states army 1965 1969 served director national security agency carter born september 16 1909 fort monroe virginia son future brigadier general clifton c. carter graduated united states military academy 1931 took m.s degree massachusetts institute technology 1936 carter served aide general george c. marshall marshall time chief staff united states army secretary state secretary defense carter lieutenant general served deputy director central intelligence april 3 1962 april 28 1965 1965 1969 served director national security agency upon retirement military served president george c. marshall research foundation retiring position 1985 carter inducted military intelligence hall fame portrayed ed lauter film thirteen days 2000 based events occurring cuban missile crisis carter buried arlington national cemetery wife preot nichols carter 1912–1997 | [
6017,
8726,
1189,
9517,
1838,
5308,
1986,
6343,
6344,
4937,
11335,
7119,
7759,
7887,
3154,
7893,
991,
7137,
3305,
7145,
2419,
6005,
6136,
766
] | Test |
8,277 | 1 | Literatura_Latino-Americana_e_do_Caribe_em_Ciências_da_Saúde:literatura latino-americana e caribe em ciências da saúde literatura latino-americana e caribe em ciências da saúde literature health sciences latin america caribbean portuguese language acronym lilacs on-line bibliographic database medicine health sciences maintained latin american caribbean center health sciences information also known bireme located são paulo brazil similar medline developed united states national library medicine contains bibliographic references papers published set scientific medical journals region covered medline | [
2901
] | Test |
8,278 | 9 | RoboLogix:robologix robologix robotics simulator uses physics engine emulate robotics applications advantages using robotics simulation tools robologix save time design robotics applications also increase level safety associated robotic equipment since various scenarios tried tested system activated robologix provides platform teach test run debug programs written using five-axis industrial robot range applications functions applications include pick-and-place palletizing welding painting robologix developed colin simpson john bud skinner primarily intended educational resource used high schools colleges universities provide laboratory simulation industrial robots institutions george brown college use robologix part online robotics distance education program simulation software allows verification robot reaching ability travel ranges collisions type simulation software provides increased level reliability planning process program development well reducing overall completion/commissioning time ability preview behavior robotic system virtual world allows variety mechanisms devices configurations controllers tried tested applied real world system robologix capacity real-time simulation motion industrial robot using geometric modeling kinematics modeling robologix enables programmers write robot programs use sensors video cameras used obtaining desired position robot end effector addition teach pendant control panel included simulator allows user command robot pick tracked object return home location jogged commands pre-programmed positions robologix control panel consists robot control functions well environment control functions conveyor system controls on-off hard-wired control etc control panel allows user command robot pick tracked object return home location jogged commands pre-programmed positions robotic systems general angular position movements commonly used large course motion linear position movements often used smaller fine increments several command instructions control panel reset home setup zero used automatically set robot specific position calibration realignment robologix provides 12 viewpoints camera angles given robot work envelope viewpoints accessed twelve cam keys allow viewing variety angles perspectives using camera viewpoints user move around 3d animated environment much way would real-world one camera views robot end effector allows real-time visualization positioning end effector gripper approaches workpiece like robot programming languages robologix programs consist data objects program flow data objects reside registers program flow represents list instructions instruction set used program robot robologix program language type scripting language used control software application programming languages generally designed building data structures algorithms scratch scripting languages intended connecting gluing components instructions together consequently robologix instruction set streamlined list program commands used simplify programming process provide rapid application development robologix instruction set contains 16 commands usually written program line-by-line basis commands used instruct robot perform tasks moving specific location picking object executing subroutine waiting etc one popular commands instruction set instruction compares numerical values located two registers register value greater less greater than/equal less than/equal equal equal another register execute next line program condition true command often used jmp lbl instruction control program execution instruction set information stored registers data locations capable holding variable numeric values two main types registers used robologix position registers variable registers position registers contain linear angular data point coordinates include axis joint information a1 a2 a3 etc x z linear cartesian coordinates also 32 variable registers used holding instruction set data position comparisons time-delay information addition position registers variable registers robot software programs also palletizing registers used manage position stack point palletizing applications palletizing one popular applications robots accomplished combining series commands palletizing routine robologix palletizing routine consists five program instructions lines first instruction palletize instruction followed linear motion instruction move stack point stack point top-center workpiece group stack points forms stacking pattern shown adjacent image first stack point stacking pattern located 1,1,1 row column layer incremented time palletizing routine executed | [
8262,
6797,
7983,
9780,
4792
] | Test |
8,279 | 8 | Toonimo:toonimo toonimo web-based solution offers on-site user assistance via online walkthroughs toonimo cloud-based digital walkthrough platform helps guide users website funnels toonimo works overlaying human voice audio graphical coachmarks web pages guide orient web users features include analytics dashboard a/b testing functionality personalization suite company serves financial insurance healthcare telecommunication education travel hospitality industries b2b b2b2c situations toonimo founded 2013 dan kotlicki ceo headquarters 1216 broadway new york city ny additional office located tel aviv israel july 14 2014 toonimo announced raised 2.5 million funding continue r ramp marketing sales efforts additional 1 million raised venture investment december 20 2014 toonimo backed lightspeed venture partners real life innovations several private investors | [] | Test |
8,280 | 2 | Android_Runtime:android runtime android runtime art application runtime environment used android operating system replacing dalvik process virtual machine originally used android art performs translation application bytecode native instructions later executed device runtime environment android 2.2 froyo brought trace-based just-in-time jit compilation dalvik optimizing execution applications continually profiling applications time run dynamically compiling frequently executed short segments bytecode native machine code dalvik interprets rest application bytecode native execution short bytecode segments called traces provides significant performance improvements unlike dalvik art introduces use ahead-of-time aot compilation compiling entire applications native machine code upon installation eliminating dalvik interpretation trace-based jit compilation art improves overall execution efficiency reduces power consumption results improved battery autonomy mobile devices time art brings faster execution applications improved memory allocation garbage collection gc mechanisms new applications debugging features accurate high-level profiling applications maintain backward compatibility art uses input bytecode dalvik supplied standard .dex files part apk files .odex files replaced executable linkable format elf executables application compiled using art on-device utility run solely compiled elf executable result art eliminates various application execution overheads associated dalvik interpretation trace-based jit compilation downside art requires additional time compilation application installed applications take slightly larger amounts secondary storage usually flash memory store compiled code android 4.4 kitkat brought technology preview art including alternative runtime environment keeping dalvik default virtual machine subsequent major android release android 5.0 lollipop dalvik entirely replaced art android 7.0 nougat introduced jit compiler code profiling art lets constantly improve performance android apps run jit compiler complements art current ahead time compiler helps improve runtime performance | [
5637,
8719,
3600,
4112,
7700,
9244,
11294,
5154,
1578,
5677,
1083,
6212,
69,
8262,
4685,
3664,
8285,
2658,
11391,
2179,
1670,
5262,
10393,
7835,
673,
8870,
1191,
196,
8907,
9432,
8413,
9949,
1255,
8940,
2808,
7421,
2304,
5892,
7428,
2828,... | Test |
8,281 | 2 | Internet_Explorer_6:internet explorer 6 microsoft internet explorer 6 ie6 sixth major revision internet explorer web browser developed microsoft windows operating systems released august 27 2001 shortly completion windows xp default browser shipped windows xp windows server 2003 also made available windows nt 4.0 windows 98 windows 2000 windows ie6 sp1 last version internet explorer available latter four windows versions ie6 sp2+ ie7 included ie6 sp2+ available ie7 windows xp sp2+ despite dominating market share attaining peak 80 mid-2004 version internet explorer widely criticized security issues lack support modern web standards making frequent appearances worst tech products time lists pc world labeling least secure software planet 2004 mozilla finalised firefox rival ie6 became highly popular acclaimed security add-ons speed modern features tabbed browsing microsoft planned fix issues internet explorer 7 june–august 2005 delayed october 2006 release 5 years ie6 debuted substantial percentage web audience still used outdated browser especially china campaigns established late-2000s encourage users upgrade newer versions internet explorer switch different browsers websites dropped support ie6 entirely notable google dropping support services march 2010 according microsoft modern.ie website 3.1 users china less 1 countries using ie6 internet explorer 6 last version called microsoft internet explorer rebranded windows internet explorer internet explorer 7 onward ie6 released included number enhancements predecessor internet explorer 5 layout engine trident required many programs including microsoft encarta ie6 improved support cascading style sheets adding number properties previously implemented fixing bugs internet explorer box model bug windows xp ie6 introduced redesigned interface based operating system default theme luna addition ie6 added dhtml enhancements content restricted inline frames partial support dom level 1 smil 2.0 msxml engine also updated version 3.0 new features included new version internet explorer administration kit ieak introduced iexpress utility create self-extracting inf-based installation packages media bar windows messenger integration fault collection automatic image resizing p3p meanwhile 2002 gopher protocol disabled ie6 widely used web browser tenure surpassing internet explorer 5.x peak 2002 2003 ie6 attained total market share nearly 90 versions ie combined reaching 95 little change ie market share several years mozilla firefox released gradually began gain popularity microsoft subsequently resumed development internet explorer released internet explorer 7 reducing number ie6 users may 7 2003 microsoft online chat brian countryman internet explorer program manager declared internet explorer would cease distributed separately windows ie6 would last standalone version would however continued part evolution windows updates coming bundled windows upgrades thus internet explorer windows would kept sync however one release fashion ie6 sp2 windows xp sp2 august 2004 microsoft changed plan released internet explorer 7 windows xp sp2 windows server 2003 sp1 late 2006 microsoft internet explorer 6 last version internet explorer microsoft title later versions changed branding windows internet explorer reaction findings anti-competitive tying internet explorer windows raised united states v. microsoft european union microsoft competition case march 4 2011 microsoft urged web users stop using ie6 favor newer versions internet explorer launched website called ie6 countdown would show much percentage world uses ie6 aim get people upgrade security advisory site secunia reported 24 unpatched vulnerabilities internet explorer 6 february 9 2010 vulnerabilities include several moderately critical ratings amount 17 total 144 security risks listed website february 11 2010 june 23 2006 secunia counted 20 unpatched security flaws internet explorer 6 many older browser even individual criticality-level although flaws affect internet explorer running certain versions windows running conjunction certain applications june 23 2004 attacker used two previously undiscovered security holes internet explorer insert spam-sending software unknown number end-user computers malware became known download.ject caused users infect computers back door key logger merely viewing web page infected sites included several financial sites probably biggest generic security failing internet explorer web browsers fact runs level access logged user rather adopting principle least user access consequently malware executing internet explorer process via security vulnerability e.g download.ject example level access user something particular relevance user administrator tools dropmyrights able address issue restricting security token internet explorer process limited user however added level security installed available default offer simple way elevate privileges ad hoc required example access microsoft update art manion representative united states computer emergency readiness team us-cert noted vulnerability report design internet explorer 6 service pack 1 made difficult secure stated manion later clarified concerns addressed 2004 release windows xp service pack 2 browsers begun suffer vulnerabilities identified cert report response belief internet explorer frequency exploitation due part ubiquity since market dominance made obvious target david wheeler argues full story notes apache http server much larger market share microsoft iis yet apache traditionally fewer security vulnerabilities time result issues security experts including bruce schneier 2004 recommended users stop using internet explorer normal browsing switch different browser instead several notable technology columnists suggested idea including wall street journal walt mossberg eweek steven vaughan-nichols july 6 2004 us-cert released exploit report last seven workarounds use different browser especially visiting untrusted sites internet explorer 6 widely used web browser tenure surpassing internet explorer 5.x attaining peak percentage usage share 2002 2003 high 80s together versions 95 slowly declined 2007 lost half market share internet explorer 7 mozilla firefox late 2006 2008 ie6 remained popular successor business use year ie7 came 2008 dailytech article noted survey found 55.2 companies still use ie 6 december 2007 ie 7 23.4 percent adoption rate net applications estimated ie6 market share almost 39 september 2008 according source ie7 users migrate faster ie8 users predecessor ie6 leading ie6 becoming widely used browser summer fall 2009 eight years introduction february 2010 estimates ie6 global market share ranged 10-20 nonetheless ie6 continued maintain plurality even majority presence browser market certain countries notably china south korea google apps youtube dropped support ie6 march 2010 followed facebook chat september january 3 2012 microsoft announced usage ie6 united states dropped 1 august 2012 ie6 still popular ie web browser china also second used browser overall total market share 22.41 behind chinese-made 360 secure browser 26.96 july 2013 net applications reported global market share ie6 amongst internet explorer browsers 10.9 august 2015 ie6 used 1 users countries exception china 3.1 december 2015 ie6 used 1 users countries data available including china south korea common criticism internet explorer speed fixes released discovery security problems microsoft attributes perceived delays rigorous testing posting internet explorer team blog august 17 2004 explained minimum 234 distinct releases internet explorer microsoft supports covering two dozen languages several different revisions operating system browser level language every combination tested patch released may 2006 pc world rated internet explorer 6 eighth worst tech product time certain degree complacency alleged microsoft ie6 near 90 browser market motive innovation strongly present resulting 5 year time ie6 introduction replacement ie7 contributing factor rapid rise free software alternative mozilla firefox unlike modern browsers ie6 fully properly support css version 2 made difficult web developers ensure compatibility browser without degrading experience users advanced browsers developers often resorted strategies css hacks conditional comments forms browser sniffing make websites work ie6 additionally ie6 lacks support alpha transparency png images replacing transparent pixels solid colour background grey unless defined png bkgd chunk workaround way microsoft proprietary alphaimageloader complicated wholly comparable function internet explorer 6 also criticized due instability example following code website would cause program crash ie6 style position relative /style table input /table script x open /script user could crash browser single line code address bar causing pointer overflow ms-its f0 several campaigns later aimed ridding internet explorer 6 browser market increasing lack compatibility modern web standards popular websites began removing support ie6 2010 including youtube parent company google however large company support teams employers forcing staff use ie6 compatibility reasons slowed upgrades microsoft eventually began campaign encourage users stop using ie6 though stating would support ie6 windows xp sp3 including embedded versions support removed however january 12 2016 new microsoft lifecycle support policy internet explorer went effect ie6 support windows versions ended 14 years original release making january 2016 security update multiple versions xp embedded last microsoft publicly issued ie6 internet explorer uses zone-based security framework means sites grouped based upon certain conditions ie allows restriction broad areas functionality also allows specific functions restricted administration internet explorer accomplished internet properties control panel utility also administers internet explorer framework implemented applications patches updates browser released periodically made available windows update web site windows xp service pack 2 adds several important security features internet explorer including popup blocker additional security activex controls activex support remains internet explorer although access local machine zone denied default since service pack 2 however activex control runs authorized user gain privileges user instead granted limited privileges java javascript later solved windows vista version ie 7 supported running browser low-permission mode making malware unable run unless expressly granted permission user internet explorer 6 dropped compatibility mode allowed internet explorer 4 run side side 5.x instead ie6 introduced quirks mode causes emulate many behaviors ie 5.5 rather activated user quirks mode automatically silently activated viewing web pages contain old invalid doctype feature later added major browsers maximize compatibility old poorly-coded web pages internet explorer 6.0 supports windows nt 4.0 service pack 6a windows 98 windows windows 2000 windows xp windows server 2003 service pack 1 update supports versions security version 1 available part windows xp service pack 2 windows server 2003 service pack 1 later service packs versions versions windows xp include internet explorer 7 higher ie6 requires least | [
6657,
5636,
8200,
9736,
2579,
6171,
9757,
7713,
10791,
9768,
6697,
9770,
10282,
5677,
559,
4661,
3639,
10808,
9275,
64,
5707,
9808,
10834,
6231,
603,
2139,
6747,
1642,
107,
9834,
9328,
115,
9843,
4213,
119,
4728,
8315,
7804,
637,
1664,
... | None |
8,282 | 3 | HP_Neoview:hp neoview hp neoview data warehouse business intelligence computer server line based hewlett packard nonstop line acted database server providing nonstop os nonstop sql lacked transaction processing functionality original nonstop systems line retired longer marketed january 24 2011 | [
8229,
1606,
5999,
10518,
5658
] | Test |
8,283 | 4 | Pretty_Good_Privacy:pretty good privacy pretty good privacy pgp encryption program provides cryptographic privacy authentication data communication pgp used signing encrypting decrypting texts e-mails files directories whole disk partitions increase security e-mail communications phil zimmermann developed pgp 1991 pgp similar software follow openpgp standard nowiki rfc 4880 /nowiki encrypting decrypting data pgp encryption uses serial combination hashing data compression symmetric-key cryptography finally public-key cryptography step uses one several supported algorithms public key bound username e-mail address first version system generally known web trust contrast x.509 system uses hierarchical approach based certificate authority added pgp implementations later current versions pgp encryption include options automated key management server public key fingerprint shorter version public key fingerprint someone get right corresponding public key fingerprint like c3a6 5e46 7b54 77df 3c4c 9790 4d22 b3ca 5b32 ff66 printed business card pgp evolves versions support newer features algorithms able create encrypted messages older pgp systems decrypt even valid private key therefore essential partners pgp communication understand capabilities least agree pgp settings pgp used send messages confidentially pgp uses hybrid cryptosystem combining symmetric-key encryption public-key encryption message encrypted using symmetric encryption algorithm requires symmetric key generated sender symmetric key used also called session key message session key sent receiver session key must sent receiver know decrypt message protect transmission encrypted receiver public key private key belonging receiver decrypt session key use symmetrically decrypt message pgp supports message authentication integrity checking latter used detect whether message altered since completed message integrity property former determine whether actually sent person entity claimed sender digital signature content encrypted changes message result failure decryption appropriate key sender uses pgp create digital signature message either rsa dsa algorithms pgp computes hash also called message digest plaintext creates digital signature hash using sender private key encrypting messages verifying signatures critical public key used send messages someone entity actually 'belong intended recipient simply downloading public key somewhere reliable assurance association deliberate accidental impersonation possible first version pgp always included provisions distributing users public keys 'identity certification also constructed cryptographically tampering accidental garble readily detectable however merely making certificate impossible modify without detected insufficient prevent corruption certificate created users must also ensure means public key certificate actually belong person entity claiming given public key specifically information binding user name key may digitally signed third party user attest association someone actually user name key several levels confidence included signatures although many programs read write information include level certification calculating whether trust key web trust protocol first described phil zimmermann 1992 manual pgp version 2.0 web trust mechanism advantages centrally managed public key infrastructure scheme used s/mime universally used users willing accept certificates check validity manually simply accept satisfactory solution found underlying problem recent openpgp specification trust signatures used support creation certificate authorities trust signature indicates key belongs claimed owner owner key trustworthy sign keys one level level 0 signature comparable web trust signature since validity key certified level 1 signature similar trust one certificate authority key signed level 1 able issue unlimited number level 0 signatures level 2 signature highly analogous trust assumption users must rely whenever use default certificate authority list like included web browsers allows owner key make keys certificate authorities pgp versions always included way cancel 'revoke identity certificates lost compromised private key require communication security retained user less equivalent certificate revocation lists centralised pki schemes recent pgp versions also supported certificate expiration dates problem correctly identifying public key belonging particular user unique pgp public key/private key cryptosystems problem even slightly different guises fully satisfactory solution known pgp original scheme least leaves decision whether use endorsement/vetting system user pki schemes requiring instead every certificate attested central certificate authority accepted correct best publicly available information known method allow person group break pgp encryption cryptographic computational means indeed 1995 cryptographer bruce schneier characterized early version closest 're likely get military-grade encryption early versions pgp found theoretical vulnerabilities current versions recommended addition protecting data transit network pgp encryption also used protect data long-term data storage disk files long-term storage options also known data rest i.e data stored transit cryptographic security pgp encryption depends assumption algorithms used unbreakable direct cryptanalysis current equipment techniques original version rsa algorithm used encrypt session keys rsa security depends upon one-way function nature mathematical integer factoring similarly symmetric key algorithm used pgp version 2 idea might point future found previously undetected cryptanalytic flaws specific instances current pgp idea insecurities exist publicly known current versions pgp added additional encryption algorithms cryptographic vulnerability varies algorithm used however none algorithms current use publicly known cryptanalytic weaknesses new versions pgp released periodically vulnerabilities fixed developers come light agency wanting read pgp messages would probably use easier means standard cryptanalysis e.g rubber-hose cryptanalysis black-bag cryptanalysis e.g installing form trojan horse keystroke logging software/hardware target computer capture encrypted keyrings passwords fbi already used attack pgp investigations however vulnerabilities apply pgp conventional encryption software 2003 incident involving seized psion pdas belonging members red brigade indicated neither italian police fbi able decrypt pgp-encrypted files stored second incident december 2006 see boucher involving us customs agents seized laptop pc allegedly contained child pornography indicates us government agencies find nearly impossible access pgp-encrypted files additionally magistrate judge ruling case november 2007 stated forcing suspect reveal pgp passphrase would violate fifth amendment rights i.e suspect constitutional right incriminate fifth amendment issue opened government appealed case federal district judge ordered defendant provide key evidence suggests 2007 british police investigators unable break pgp instead resorted using ripa legislation demand passwords/keys november 2009 british citizen convicted ripa legislation jailed nine months refusing provide police investigators encryption keys pgp-encrypted files pgp cryptosystem criticized complexity standard implementation low usability user interface including recognized figures cryptography research standard developed 90 uses ineffective serialization format storage keys encrypted data resulted signature-spamming attacks public keys prominent developers gnu privacy guard backwards compatibility openpgp standard results usage relatively weak default choice cryptographic primitives cast5 cipher cfb mode s2k password hashing standard also criticized leaking metadata usage long-term keys lack forward secrecy popular end-user implementations suffered various signature-striping cipher downgrade metadata leakage vulnerabilities attributed complexity standard phil zimmermann created first version pgp encryption 1991 name pretty good privacy inspired name grocery store ralph pretty good grocery featured radio host garrison keillor fictional town lake wobegon first version included symmetric-key algorithm zimmermann designed named bassomatic saturday night live sketch zimmermann long-time anti-nuclear activist created pgp encryption similarly inclined people might securely use bbss securely store messages files license required non-commercial use even nominal charge complete source code included copies posting june 5 2001 entitled pgp marks 10th anniversary zimmermann describes circumstances surrounding release pgp pgp found way onto internet rapidly acquired considerable following around world users supporters included dissidents totalitarian countries affecting letters zimmermann published included testimony us congress civil libertarians parts world see zimmermann published testimony various hearings 'free communications activists called cypherpunks provided publicity distribution decades later cryptoparty activists much via twitter shortly release pgp encryption found way outside united states february 1993 zimmermann became formal target criminal investigation us government munitions export without license cryptosystems using keys larger 40 bits considered munitions within definition us export regulations pgp never used keys smaller 128 bits qualified time penalties violation found guilty substantial several years investigation zimmermann closed without filing criminal charges anyone else zimmermann challenged regulations imaginative way published entire source code pgp hardback book via mit press distributed sold widely anybody wishing build copy pgp could cut covers separate pages scan using ocr program conceivably enter type-in program ocr software available creating set source code text files one could build application using freely available gnu compiler collection pgp would thus available anywhere world claimed principle simple export munitions —guns bombs planes software—was remains restricted export books protected first amendment question never tested court respect pgp cases addressing encryption software however two federal appeals courts established rule cryptographic software source code speech protected first amendment ninth circuit court appeals bernstein case sixth circuit court appeals junger case us export regulations regarding cryptography remain force liberalized substantially throughout late 1990s since 2000 compliance regulations also much easier pgp encryption longer meets definition non-exportable weapon exported internationally except seven specific countries list named groups individuals substantially us trade prohibited various us export controls turmoil zimmermann team worked new version pgp encryption called pgp 3 new version considerable security improvements including new certificate structure fixed small security flaws pgp 2.x certificates well permitting certificate include separate keys signing encryption furthermore experience patent export problems led eschew patents entirely pgp 3 introduced use cast-128 a.k.a cast5 symmetric key algorithm dsa elgamal asymmetric key algorithms unencumbered patents federal criminal investigation ended 1996 zimmermann team started company produce new versions pgp encryption merged viacrypt zimmermann sold commercial rights licensed rsa directly rsadsi changed name pgp incorporated newly combined viacrypt/pgp team started work new versions pgp encryption based pgp 3 system unlike pgp 2 exclusively command line program pgp 3 designed start software library allowing users work command line inside gui environment original agreement viacrypt zimmermann team viacrypt would even-numbered versions zimmermann odd-numbered versions viacrypt thus created new version based pgp 2 called pgp 4 remove confusion could pgp 3 successor pgp 4 pgp 3 renamed released pgp 5 may 1997 december 1997 pgp inc. acquired network associates inc. nai zimmermann pgp team became nai employees nai first company legal export strategy publishing source code nai pgp team added disk encryption desktop firewalls intrusion detection ipsec vpns pgp family export regulation liberalizations 2000 longer required publishing source nai stopped releasing source code early 2001 zimmermann left nai served chief cryptographer hush communications provide openpgp-based e-mail service hushmail also worked veridis companies october 2001 nai announced pgp assets sale suspending development pgp encryption remaining asset kept pgp e-business server original pgp commandline version february 2002 nai canceled support pgp products exception renamed commandline product nai formerly mcafee intel security mcafee continued sell support product name mcafee e-business server 2013 august 2002 several ex-pgp team members formed new company pgp corporation bought pgp assets except command line version nai new company funded rob theis doll capital management dcm terry garnett venrock associates pgp corporation supports existing pgp users honors nai support contracts zimmermann serves special advisor consultant pgp corporation well continuing run consulting company 2003 pgp corporation created new server-based product called pgp universal mid-2004 pgp corporation shipped command line version called pgp command line integrates pgp encryption platform applications 2005 pgp corporation made first acquisition—the german software company glück kanja technology ag pgp deutschland ag 2010 pgp corporation acquired hamburg-based certificate authority tc trustcenter parent company chosensecurity form pgp trustcenter division since 2002 purchase nai pgp assets pgp corporation offered worldwide pgp technical support offices draper utah offenbach germany tokyo japan april 29 2010 symantec corp. announced would acquire pgp 300 million intent integrating enterprise security group acquisition finalized announced public june 7 2010 source code pgp desktop 10 available peer review also 2010 intel corporation acquired mcafee 2013 mcafee e-business server transferred software diversified services sells supports develops name sds e-business server enterprise townsend security currently offers commercial version pgp ibm ibm z mainframe platforms townsend security partnered network associates 2000 create compatible version pgp ibm platform townsend security ported pgp 2008 time ibm z mainframe version pgp relies free z/os encryption facility utilizes hardware acceleration software diversified services also offers commercial version pgp sds e-business server ibm z mainframe may 2018 bug named efail discovered certain implementations pgp could reveal plaintext contents emails encrypted 2003 originally used primarily encrypting contents e-mail messages attachments desktop client pgp products diversified since 2002 set encryption applications managed optional central policy server pgp encryption applications include e-mail attachments digital signatures laptop full disk encryption file folder security protection im sessions batch file transfer encryption protection files folders stored network servers recently encrypted signed http request/responses means client-side enigform server-side mod openpgp module also wordpress plugin available called wp-enigform-authentication takes advantage session management features enigform mod_openpgp pgp desktop 9.x family includes pgp desktop email pgp whole disk encryption pgp netshare additionally number desktop bundles also available depending application products feature desktop e-mail digital signatures im security whole disk encryption file folder security encrypted self-extracting archives secure shredding deleted files capabilities licensed different ways depending features required pgp universal server 2.x management console handles centralized deployment security policy policy enforcement key management reporting used automated e-mail encryption gateway manages pgp desktop 9.x clients addition local keyserver pgp universal server works pgp public keyserver—called pgp global directory—to find recipient keys capability delivering e-mail securely recipient key found via secure https browser session pgp desktop 9.x managed pgp universal server 2.x first released 2005 pgp encryption applications based new proxy-based architecture newer versions pgp software eliminate use e-mail plug-ins insulate user changes desktop applications desktop server operations based security policies operate automated fashion pgp universal server automates creation management expiration keys sharing keys among pgp encryption applications symantec pgp platform undergone rename pgp desktop known symantec encryption desktop pgp universal server known symantec encryption management server current shipping versions symantec encryption desktop 10.3.0 windows mac os platforms symantec encryption server 3.3.2 also available pgp command line enables command line-based encryption signing information storage transfer backup well pgp support package blackberry enables rim blackberry devices enjoy sender-to-recipient messaging encryption new versions pgp applications use openpgp s/mime allowing communications user nist specified standard inside pgp inc. still concern patent issues rsadsi challenging continuation viacrypt rsa license newly merged firm company adopted informal internal standard called unencumbered pgp would use algorithm licensing difficulties pgp encryption importance worldwide many wanted write software would interoperate pgp 5 zimmermann became convinced open standard pgp encryption critical cryptographic community whole july 1997 pgp inc. proposed ietf standard called openpgp gave ietf permission use name openpgp describe new standard well program supported standard ietf accepted proposal started openpgp working group openpgp internet standards track active development many e-mail clients provide openpgp-compliant email security described rfc 3156 current specification rfc 4880 november 2007 successor rfc 2440 rfc 4880 specifies suite required algorithms consisting elgamal encryption dsa triple des sha-1 addition algorithms standard recommends rsa described pkcs 1 v1.5 encryption signing well aes-128 cast-128 idea beyond many algorithms supported standard extended support camellia cipher rfc 5581 2009 signing key exchange based elliptic curve cryptography ecc i.e ecdsa ecdh rfc 6637 2012 support ecc encryption added proposed rfc 4880bis 2014 free software foundation developed openpgp-compliant program called gnu privacy guard abbreviated gnupg gpg gnupg freely available together source code gnu general public license gpl maintained separately several graphical user interfaces guis interact gnupg library encryption decryption signing functions see kgpg seahorse macgpg several vendors also developed openpgp-compliant software development open source openpgp-compliant library openpgp.js written javascript allowed web-based applications use pgp encryption web browser several ios android openpgp-compliant applications ipgmail ios openkeychain android enable key generation encryption/decryption email files apple ios google android operating systems openpgp encryption ensure secure delivery files messages well provide verification created sent message using process called digital signing open source office suite libreoffice implemented document signing openpgp version 5.4.0 linux using openpgp communication requires participation sender recipient openpgp also used secure sensitive files 're stored vulnerable places like mobile devices cloud advancement cryptography parts pgp criticized dated october 2017 roca vulnerability announced affects rsa keys generated buggy infineon firmware used yubikey 4 tokens often used pgp many published pgp keys found susceptible yubico offers free replacement affected tokens | [
513,
2050,
4100,
517,
10756,
8202,
9744,
7199,
10274,
2083,
4644,
9764,
3629,
5179,
2110,
1086,
9281,
7238,
10831,
3161,
1634,
10850,
10341,
9318,
11368,
7794,
5749,
2168,
10872,
5254,
8329,
4746,
2187,
8331,
5777,
11418,
9884,
3742,
10405,... | Validation |
8,284 | 0 | Interactive_Terminology_for_Europe:interactive terminology europe interactive terminology europe iate interinstitutional terminology database european union project launched 1999 objective creating web-based interface eu terminology resources make information easily available ensure standardisation throughout eu institutions used eu institutions agencies since summer 2004 public user interface released testing early 2007 officially opened 28 june 2007 new version released 7 november 2018 following full rebuild system state-of-the-art technologies latest software development standards best practices usability accessibility new look feel iate incorporated existing terminology databases eu ’ translation services one interinstitutional database containing approximately 1.4 million multilingual entries following legacy databases imported iate iate intended contain single entry per concept actually contains multiple entries many concepts entries consolidated number entries fallen approximately 1.4 million approximately 1.2 million despite addition many new entries new previously unrecorded concepts project partners european commission european parliament council european union european court justice european court auditors european economic social committee european committee regions european central bank european investment bank translation centre bodies european union iate web site administered eu translation centre luxembourg behalf project partners subject 'domains based eurovoc entire iate glossary database downloaded free zipped format multilanguage glossaries generated using free tool | [
5140
] | Test |
8,285 | 2 | Android_Gingerbread:android gingerbread android gingerbread seventh version android codename android mobile operating system developed google released december 2010 versions longer supported gingerbread release introduced support near field communication nfc —used mobile payment solutions—and session initiation protocol sip —used voip internet telephony gingerbread user interface refined many ways making easier master faster use power-efficient simplified color scheme black background gave vividness contrast notification bar menus user interface components improvements menus settings resulted easier navigation system control nexus smartphone released december 2010 first phone google nexus line ran gingerbread also first one line built-in nfc functionality statistics issued google indicate 0.3 android devices accessing google play run gingerbread new features introduced gingerbread include following | [
5637,
8719,
3600,
7700,
3100,
9244,
11294,
10271,
1578,
10284,
5677,
1083,
6212,
69,
8262,
4683,
4685,
11343,
3664,
8280,
8794,
2658,
8821,
6263,
11391,
1670,
7816,
5262,
10393,
8858,
7835,
673,
8870,
1191,
1203,
7359,
1728,
196,
3269,
37... | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.