node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
4,885 | 2 | Oberon_(operating_system):oberon operating system oberon system modular single-user single-process multitasking operating system written programming language name originally developed late 1980s eth zürich oberon system unconventional visual text user interface instead conventional cli gui tui innovative time influenced design acme text editor plan 9 bell labs operating system oberon system still maintained also subsequently developed multi-process smp-capable bluebottle operating system zooming user interface oberon operating system originally developed part ns32032-based ceres workstation project written almost entirely since 2013 edition described entirely oberon programming language basic system designed implemented niklaus wirth jürg gutknecht design implementation fully documented book project oberon user interface programmers reference found martin reiser book oberon system later extended ported hardware team eth-zürich recognition popular magazines wirth gutknecht although active computer science professors referred 'part-time programmers book 'project oberon late 2013 couple months 80th birthday niklaus wirth published second edition project oberon details implementation oberon system using risc cpu design realized xilinx fpga board presented symposium organized 80th birthday ethz meantime several emulators version implemented according josef templ former member developer group eidgenössische technische hochschule zürich later member institut für systemsoftware johannes kepler university linz one versions v4 maintained genealogy different versions oberon system following oberon text user interface tui differentiated terminal user interface combines point-and-click convenience graphical user interface gui linguistic strength command line interface cli closely tied naming conventions oberon language text appearing almost anywhere screen edited therefore used command input commands activated middle-mouse click text fragment form module.command optionally followed parameters terminated command defined procedure empty argument list parameters command defined executing middle click must explicitly scanned retrieved procedure checks questions asked command execution sometimes called non-modal user interface ui nothing like command prompt required although radically different command line tui efficient powerful steep ascent early learning curve makes little bit difficult beginning questions asked deliberate design decision needs getting used editors ask user closing modified text case oberon system usage tui programming interface fully documented martin reiser book oberon system short introduction user interface found niklaus wirth home page later versions system oberon oberon v4 v4 short sometimes also referred linz-oberon oberon system 3 s3 sometimes also called eth-oberon spirit oberon enhanced basic interface different incompatible implementations buttons drop menus active elements v4 used purpose dedicated control character embedded normal text contrast system 3 extended kernel introducing persistent objects extensions include large set user interface elements mastering oberon user interface purely textual also called gadgets system s3 absolutely non-trivial therefore recommended proceed successful installation oberon system 3 andré fischers oberon system 3 tutorial expanded version tutorial published book print whole book available electronic form single user license every installed version system 3 windows linux native i.e also gadgets toolkit olr information get copy oberon companion may found section oberon wikibook similar user interfaces yet appear commonplace operating systems rob pike acme system plan 9 bell labs strongly inspired oberon tui whether worksheet interface macintosh programmer workshop influenced oberon tui vice versa difficult decide oberon system based wirth previous computer design lilith apple macintosh precursor lisa oberon system ceres precursor lilith roots inspired alto developed xerox parc v1 first usable version time oberon trilogy published major change text model together editor called write yielded v2 foreshadowed table section history major fork beginning 1990s v4 vs. system 3 group around jürg gutknecht introduced persistent objects object-libraries thereby extending kernel group around realized similar features introducing active elements mapped special character thereby extending fonts without changing kernel system 3 sometimes also called spirit oberon later renamed eth oberon whereas v4 sometimes also called linz oberon version oberon system 3 integrated microsoft windows os called plugin oberon version called oberon v4 see also history closer original operating system developed n. wirth j. gutknecht originally developed ethz h.p mössenböck went institut für systemsoftware johannes-kepler university linz jku development v4 moved also therefore v4 sometimes also called linz-oberon contrast eth-oberon recent version v4 extensions available jku oberon v4 appears orphaned almost changes since 2000 another repository v4 claudio nieder oberon v4 also shows difference different v4 implementations since 2013 page moved to/is mirrored sourceforge v4 closer would called integrated development environment operating system many extensions written v4 still available ftp server ssw jku documentation found web-pages information normally included packages given oberon special rich text format computer science department eth zurich recent years begun exploring active objects concurrency operating systems released early version new language active oberon new operating system first called aos — due copyright issues — called a2 and/or bluebottle available eth zurich source via internet native versions a2 i.e running bare hardware currently possible intel ia-32 x86-64 single- multi-processor systems strongarm cpu family versions running top another operating system available windows winaos unix unixaos linux linuxaos os-x darwinaos part industrial research project native systems group eth zurich developed application-specific operating system called stailaos based latest version oberon os targeted towards applications like real-time analytics high performance trading systems main memory based erp etc native oberon stands oberon system running bare hardware pc-native oberon version oberon operating system runs ia-32 x86-32 pc hardware never v4 native oberon every information section implicitly assumes system 3 native oberon minimal hardware requirements 133 mhz pentium 100mb hard disk vesa 2 graphics card resolution least 1024x768 pixel optionally 3com network card basic system runs single hd-floppy additional software installed network full installation includes gadgets gui written completely oberon programming language confusion caused fact exists version called lno acronym linux native oberon uses linux hardware abstraction layer hal goal compatible possible pc-native oberon versions oberon system i.e without native name partially modified interfaces low level modules 2015 peter matthias revitalized lno name olr oberon linux revival multi-platform distribution running seamlessly intel x86 risc-v mips arm runs nicely raspberry pi inexpensive chip computer tweaking adjusting group membership or/and permissions devices runs nicely tiny core linux olr interfaces linux kernel direct system calls olr currently mid 2017 misses network layer 2013 niklaus wirth paul reed completed re-implementation original oberon system digilent xilinx spartan 3 fpga starter board work included revision project oberon identified project oberon new edition 2013 system since ported xilinx spartan 6 fpga development board saanlima electronics 2015 paul reed collaborated victor yurkovsky creation oberonstation xilinx spartan 3-based computer designed specifically run oberon peter de wachter implemented emulator also ported java javascript michael schierl running modern browsers ported free pascal/ultibo markus greim andreas pirklbauer maintains experimental version extensions project oberon 2013 github a2 yet another name active object system 2003. br alo arm linux oberon lno family arm cpu. br aos active object system 2002. br bb blackbox component builder component pascal ide oberon microsystems. br bluebottle os another name active object system 2003. br cp component pascal dialect oberon family similar oberon-2. br etho oberon developed eidgenössische technische hochschule eth zürich. br fox compiler active oberon appearing aos a2 bluebottle br leo linux eth oberon etho 2.4.3 linux x86. br lno linux native oberon. br native oberon oberon running bare hardware rather atop another operating system. br olr oberon linux revival version uses linux hal runs x86 arm mips. br op2 portable oberon-2 compiler op2 developed port oberon onto commercially available platforms. br paco scope parallel compiler appears a2 compiles scope independent thread br risc5 cpu project oberon 2013 based upon wirth risc architecture confused risc-v. br unixaos unix-based aos. br winaos windows-based aos. br | [
1522,
2540,
4670,
5639,
6340,
5730,
3955,
1361,
7535,
5571,
1556,
7364,
578,
1284,
4703,
5936,
4885,
149,
7848,
5424,
6489,
1237,
352,
2443
] | Test |
4,886 | 4 | Impermium:impermium impermium cyber-security startup company based redwood city california provided anti-spam account protection services internet web sites 2014 company acquired google company founded 2010 mark risher vishwanath ramarao naveen jamal met managing anti-spam systems yahoo mail company protected 1.5 million sites worldwide including disqus livefyre pinterest squarespace tumblr attacks including fraudulent registrations login account hijacking malicious user-generated content forms social spam impermium received venture capital financing funds including accel partners greylock partners highland capital partners morado ventures social+capital partnership january 2014 google announced acquisition company merging team technology anti-spam group | [
1805
] | Validation |
4,887 | 5 | Internet_Citizen's_Band:internet citizen band internet citizen band better known icb early internet chat program associated protocol released 1989 icb typically served port 7326 first version icb program called forumnet fn written university kentucky staffer sean carrick casey widely used university kentucky georgia tech mit university new mexico stanford university mills college uc santa cruz uc berkeley fn based mud software program casey established protocol clients fn used realtime communications channel 1989 loma prieta earthquake internet access hard-hit santa cruz returned service reliable phone service march 1991 university kentucky changed policy shut fn server within 2 months new server created client software another fn user john atwood devries put online renamed icb new server code unrelated original server except common client software source used basis many icb servers follow 1995 2000 server code heavily rewritten stability additional features jon luini michel hoche-mong remains available icb.net web site icb still operation dedicated user base variety clients exist major operating systems icb features many standard chat program functions including channels private messages nickname registration common clients support tcl scripting commands functions clients principally icbm support scripting perl instead icb never supported multi-server shared groups number simultaneous users always somewhat limited comparison popular chat programs icb support transferring files multimedia via chat program however restrictive protocol small remote attack surface icb protocol 8-bit clean | [
7148,
3762,
5983,
3350,
7967,
2284,
7170,
2201,
6624,
1369,
6629,
486,
1014,
4337,
5847,
1958,
2048,
3050,
2880,
4634,
4906,
5535
] | Test |
4,888 | 1 | Elementary_key_normal_form:elementary key normal form elementary key normal form eknf subtle enhancement third normal form thus eknf tables 3nf definition happens one unique compound key overlap cases cause redundant information overlapping column table eknf elementary functional dependencies begin whole keys end elementary key attributes every full non-trivial functional dependency form x→y either x key part elementary key definition elementary functional dependency functional dependency x→a functional dependency x'→a also holds x strict subset x elementary key key x x→a elementary functional dependency attribute a. eknf defined carlo zaniolo 1982 example table whose highest normal form eknf see boyce–codd normal form achievability bcnf | [
4046,
4048,
1414,
1415,
1416,
1417,
2124
] | Test |
4,889 | 2 | Win32s:win32s win32s 32-bit application runtime environment microsoft windows 3.1 3.11 operating systems allowed 32-bit applications run 16-bit operating system using call thunks beta version win32s available october 1992 version 1.10 released july 1993 simultaneously windows nt 3.1 win32s intended partial implementation win32 windows api existed early versions windows nt win32s signifies subset win32s lacked number windows nt functions including multi-threading asynchronous i/o newer serial port functions many gdi extensions generally limited win32s applications specifically designed win32s platform although standard win32 programs would work correctly including microsoft 3d pinball space cadet windows 95 included applets office 95 early versions internet explorer version 5 also win32s compatible although also existed 16-bit format generally 32-bit application compatible win32s use 16mb memory extended features directx win32s inherits many limitations win16 environment true win32 applications execute within private virtual address space whereas windows 3.x used address space shared among running applications application running win32s shared address space cooperative multitasking characteristics windows 3.1 consequently win32 application run win32s must contain relocation information technique named thunking fundamental implementation win32s well chicago-kernel operating systems windows 95 windows 98 windows however allowing user-level thunking greatly complicates attempts provide stable memory management memory protection system-wide basis well core kernel security—this allows poorly written applications undermine system stability win32s well chicago-kernel systems stability security windows nt offer partially based thunking illegal except thunks win16 win32—the cpu must remain protected mode times windows xp later 32-bit versions windows transparently provide virtual machine running win16 applications although feature removed 64-bit versions windows win32s-compatible applications could built using microsoft development tools well least borland c++ 4.x however several program compilation options dlls implicit windows nt 3.1 included application win32s microsoft ceased support win32s visual c++ version 4.2 released late 1996 win32s included implementation card game freecell example application couple years game became famous inclusion windows 95 dos game included level editor required win32s run editor used windows gui displaying large maps high-resolution graphic modes already handled windows ncsa mosaic web browser version 2 also required win32s win32s still found using web search engines pw1118.exe generally installation file used developers ensure installing ole require consistent clipboard handling many applications need made ole aware i.e setting ole server must reinstalled win32s also included early win32 programs | [
1339,
3407,
6000,
4759,
447,
5571,
6256,
6634,
2085,
4017,
858
] | Test |
4,890 | 2 | ScreenOS:screenos screenos real-time embedded operating system netscreen range hardware firewall devices juniper networks beside transport level security screenos also integrates flow management applications december 2015 juniper networks announced found unauthorized code screenos since august 2012 two backdoors created would allow sophisticated hackers control firewall un-patched juniper netscreen products decrypt network traffic least one backdoors appeared likely effort governmental interest speculation security field whether nsa many security industry praised juniper transparent breach wired speculated lack details disclosed intentional use random number generator known security flaws could suggest planted intentionally 2011 leaked nsa document says gchq current exploit capability following screenos devices ns5gt n25 ns50 ns500 ns204 ns208 ns5200 ns5000 ssg5 ssg20 ssg140 isg 1000 isg 2000 exploit capabilities seem consistent program codenamed feedtrough | [
7605,
5110,
3855,
2746,
6994,
4336,
224,
6918,
4528,
238,
7396,
4631,
3664,
861,
771,
74,
7312,
3241,
4556,
7950
] | Test |
4,891 | 5 | KMLDonkey:kmldonkey kmldonkey graphical frontend mldonkey powerful p2p file sharing tool designed kde desktop key features kmldonkey 2.0.7 released together kde software compilation 4 within extragear-tarball | [
2984,
3172,
5017,
7714,
7343,
2390,
4685,
6011,
5571,
2664,
6025,
2415,
2681,
5162,
3573,
2430,
2696,
3915,
5531,
2706,
4014,
4461
] | Test |
4,892 | 4 | IP_fragmentation_attack:ip fragmentation attack ip fragmentation attacks kind computer security attack based internet protocol ip requires data transmitted processed specifically invokes ip fragmentation process used partition messages service data unit sdu typically packet one layer network multiple smaller payloads fit within lower layer protocol data unit pdu every network link maximum size messages may transmitted called maximum transmission unit mtu sdu plus metadata added link layer exceeds mtu sdu must fragmented ip fragmentation attacks exploit process attack vector part tcp/ip suite internet protocol ip resides internet layer model ip responsible transmission packets network end points ip includes features provide basic measures fault-tolerance time live checksum traffic prioritization type service support fragmentation larger packets multiple smaller packets id field fragment offset support fragmentation larger packets provides protocol allowing routers fragment packet smaller packets original packet large supporting datalink frames ip fragmentation exploits attacks use fragmentation protocol within ip attack vector according kurose 2013 one type ip fragmentation attack attacker sends stream small fragments target host none offset zero target collapse attempts rebuild datagrams degenerate packets another attack involves sending overlapping fragments non-aligned offsets render vulnerable operating systems knowing causing crash ip packets encapsulated datalink frames therefore link mtu affects larger ip packets forces split pieces equal smaller mtu size accomplished several approaches three fields ip header used implement fragmentation reassembly identification flags fragment offset fields flags fragment offset specifies fragment position within original packet measured 8-byte units accordingly every fragment except last must contain multiple 8 bytes data obvious fragment offset hold 8192 2^13 units packet ca n't 8192 8 65,536 bytes data total length field ip header records total size including header data ip header least 20 bytes long maximum value fragment offset restricted 8189 leaves room 3 bytes last fragment ip internet connectionless fragments one packet may interleaved another destination identification field uniquely identifies fragments particular packet source system sets identification field packet unique value packets use source ip address destination ip address protocol values lifetime packet internet way destination distinguish incoming fragments belong unique packet buffer last fragment received last fragment sets fragment bit 0 tells receiving station start reassembling data fragments received following real-life fragmentation example following obtained using ethereal protocol analyzer capture icmp echo request packets simulate open terminal type ping ip_dest -n 1 -l 65000 results follows codice_1 note first fragment contains icmp header remaining fragments generated without icmp header two important points network infrastructure equipment routers load-balancers firewalls ids inconsistent visibility fragmented packets example device may subject initial fragment rigorous inspection auditing might allow additional fragments pass unchecked attacks may use fact evade detection placing incriminating payload data fragments devices operating full proxy mode generally susceptible subterfuge | [
3821,
5456,
588,
5485,
6062,
3338,
3775,
3855,
3819,
3680
] | Validation |
4,893 | 9 | PC-LISP:pc-lisp pc-lisp implementation franz lisp dialect peter ashwood-smith version 2.11 released may 15 1986 current version may downloaded external link currently pc-lisp ported 32 64 bit linux mac windows note franz lisp dialect immediate portable successor version maclisp perhaps closest thing lisp steven levy book practical operate pc-lisp runs well dos emulators modern windows versions pc-lisp implements franz lisp dynamically scoped predecessor modern common lisp therefore historically important implementation session running following code demonstrates dynamic scoping franz lisp note pc-lisp implement codice_1 special form emacs lisp provides local variables instead variables algol-based language would call global first dialect lisp incorporate algol scoping rules called lexical scoping scheme although common lisp language also added feature another example showing use backquote power lisp differentiation example | [
7878,
1445,
897,
6796,
6888,
6087,
4588,
2734,
6981,
5734,
3188,
6352,
1557,
218,
1478,
5494,
4704,
3880,
4609,
6116,
3212,
5501,
6210,
144,
1116,
6471,
7481,
2144,
2600,
7298,
5515,
8025,
5077,
7032,
4543,
1889,
2156,
3749,
5883,
2439,
... | Test |
4,894 | 2 | Nokia_E51:nokia e51 nokia e51 symbian os smartphone nokia announced 18 september 2007 replacement nokia e50 business-focused eseries line second nokia umts hsdpa dual band device phone available black silver bronze-coloured border backplate slim body made stainless steel 12 mm thick 100 g weight smallest nokia smartphone time yet still technologically capable like s60 devices time version without integrated camera also existed e51 highly acclaimed succeeded nokia e52 br | [
1066,
5979,
2271,
6517,
372,
1724,
7521,
3615,
1453,
4935,
3694,
3524,
3952,
472,
5909,
7170,
8072,
2922,
4407,
118,
23,
2564,
3703,
7261,
7545,
5044,
6908,
5493,
740,
1202,
5315,
3029,
5499,
7012,
139,
6378,
6465,
5062,
3039,
3653,
158... | Test |
4,895 | 4 | Justniffer:justniffer justniffer tcp packet sniffer log network traffic 'standard web server-like customized way also log response times useful tracking network services performances e.g web server application server etc. output format traffic easily customized example written python delivered official package stores transferred contents output directory separated domains means transferred files like html css javascript images sounds etc saved directory justniffer born help troubleshooting performance network tcp-based services http rtsp sip smtp imap pop ldap telnet etc collect low high level protocol performance information reconstructing tcp flow reliable way using portions linux kernel code uses slightly modified version libnids libraries already include modified version linux kernel code reusable way extended external scripts bash python executable generate logs customizable way man page justniffer explains options | [
6574,
726,
588,
5965,
7637,
7765,
5571,
7476,
6929,
6908,
578,
7170
] | Test |
4,896 | 8 | Parasoft_Virtualize:parasoft virtualize parasoft virtualize service virtualization product create deploy manage simulated test environments software development software testing purposes environments simulate behavior dependent resources unavailable difficult access difficult configure development testing simulates behavior dependent resources mainframes erp systems databases web services third-party information systems systems direct developer/tester control product used conjunction hardware/os virtualization provide developers testers resources need execute development testing tasks earlier faster completely technologies automating continuous testing used part continuous delivery continuous integration continuous release 2002 parasoft released technology create service implementation stubs emulate critical functionality made available testing. technology introduced parasoft soatest since 2002 technology extended intelligent stubs emulate behaviour running system allowing developer test services context application actual behaviour live running system. 2009 technology extended application behavior virtualization create copies applications back-end systems developer reference applications systems developing software technology extended released separate product 2011 parasoft created free community edition 2017 allows individual users small projects use service virtualization cost parasoft virtualize awarded 2012 jolt awards grand prize panel dr. dobb journal-appointed judges annual award showcases products jolted industry significance made task creating software faster easier efficient recent awards/recognitions received named leader functional test automation tools forrester functional test automation tools evaluation innovation technology leader voke service virtualization market mover array | [
1737,
6622,
578,
4759,
5571,
1172,
1174
] | Test |
4,897 | 2 | COMSPEC:comspec comspec comspec one environment variables used dos os/2 windows normally points command line interpreter default command.com dos cmd.exe os/2 windows nt variable name written all-uppercase dos os/2 windows also supports lowercase environment variable names variable name comspec inside dos emulator ntvdm dos programs comspec cmd.exe variable contents displayed typing set comspec echo comspec command prompt environment variable default points full path command line interpreter also made different company different version | [
5480,
4759,
6256,
2528
] | Test |
4,898 | 4 | Elegant_degradation:elegant degradation elegant degradation term used engineering describe occurs machines subject constant repetitive stress externally machine maintains appearance user appearing function properly internally machine slowly weakens time eventually unable withstand stress eventually breaks compared graceful degradation operational quality decrease breakdown may sudden term meaning varies depending context field may strictly considered exclusive engineering instance used mechanism food industry applied degradation lignin cellulose pentosan polymers among others concept also used extract chemicals elegant degradation paederus fuscipes obtain pederin hemiacetal pseuodopederin process degradation induced heat play name also used metaphor current state world | [
6748
] | Validation |
4,899 | 3 | Koomey's_law:koomey law koomey law describes trend history computing hardware half-century number computations per joule energy dissipated doubled every 1.57 years professor jonathan koomey described trend 2010 paper wrote fixed computing load amount battery need fall factor two every year half trend remarkably stable since 1950s r 98 2011 koomey re-examined data found 2000 doubling slowed every 2.6 years related slowing moore law ability build smaller transistors end around 2005 dennard scaling ability build smaller transistors constant power density difference two growth rates substantial doubling every year half results 100-fold increase efficiency every decade doubling every two half years yields 16-fold increase koomey wrote implications koomey law amount battery needed fixed computing load fall factor 100 every decade computing devices become smaller mobile trend may even important improvements raw processing power many applications furthermore energy costs becoming increasing factor economics data centers increasing importance koomey law slowing koomey law implications energy use information communications technology however computers run peak output continuously effect slowing may seen decade koomey writes exponential trend one eventually end ... decade energy use dominated power consumed computer active active power still hostage physics behind slowdown moore ’ law. koomey lead author article ieee annals history computing first documented trend time koomey published short piece ieee spectrum discussed mit technology review post erik brynjolfsson “ economics information ” blog economist online trend previously known digital signal processors named gene law name came gene frantz electrical engineer texas instruments frantz documented power dissipation dsps reduced half every 18 months 25 year period latest studies indicate koomey law slowed doubling every 2.6 years second law thermodynamics landauer principle irreversible computing continue made energy efficient forever 2011 computers computing efficiency 0.00001 assuming energy efficiency computing continue double every 1.57 years landauer bound reached 2048 thus 2048 koomey law longer hold landauer principle however applicable reversible computing 'beyond cmos future computing technologies as-yet undeveloped would represent entirely new efficiencies beyond koomey law | [
4654,
1592,
4049,
4051,
48,
5832,
553,
1238,
107
] | Test |
4,900 | 3 | List_of_x86_manufacturers:list x86 manufacturers x86-compatible processors designed manufactured sold number companies including past past past past | [
3576,
1977,
1764,
2744,
352,
4703
] | Test |
4,901 | 5 | XML_Enabled_Directory:xml enabled directory xml enabled directory xed framework managing objects represented using extensible markup language xml xed builds x.500 ldap directory services technologies xed originally designed 2003 steven legg enitiatives formerly eb2bcom adacel technologies daniel prager formerly deakin university xml enabled directory xed framework leverages existing lightweight directory access protocol ldap x.500 directory technology create directory service stores manages transmits extensible markup language xml format data maintaining interoperability ldap clients x.500 directory user agents duas x.500 directory system agents dsas main features xed xml enabled directory allows directory entries contain xml formatted data attribute values furthermore attribute syntax specified one variety xml schema languages directory understands directory server able perform data validation semantically meaningful matching xml documents parts behalf client applications making implementation xml-based applications easier faster xml applications also exploit directory traditional capabilities cross-application data sharing data distribution data replication user authentication user access control lowering cost building new xml applications xed implementations enitiatives viewds discovery server provides organisations fast scalable flexible directory system developed strictly adhering open standards features support x.500 ldap xed acp133 standards standards compliant viewds interface variety applications future | [
644,
7144
] | Validation |
4,902 | 5 | Cerberus_FTP_Server:cerberus ftp server cerberus ftp server windows-based ftp server support encrypted ftp sessions via ftps sftp well web client support via http https server exposes files using virtual file system supports user authentication via built-in users groups active directory ldap public key authentication server currently developed supported cerberus llc | [
4759,
5571
] | Train |
4,903 | 0 | Inside–outside–beginning_(tagging):inside–outside–beginning tagging iob format short inside outside beginning common tagging format tagging tokens chunking task computational linguistics ex named-entity recognition presented ramshaw marcus paper text chunking using transformation-based learning 1995 b- prefix tag indicates tag beginning chunk i- prefix tag indicates tag inside chunk b- tag used tag followed tag type without tokens tag indicates token belongs chunk another similar format widely used iob2 format iob format except b- tag used beginning every chunk i.e chunks start b- tag readable introduction entity tagging given bob carpenter blog post coding chunkers taggers 'bio plausibly synonym 'iob example iob format example iob2 format related tagging schemes sometimes include start/end consists tags b e used represent chunk containing single token chunks length greater equal two always start b tag end e tag tagging scheme include bioes/bilou e l denotes last ending character sequence denotes single element example bioes format | [
1314,
1444,
2215
] | Train |
4,904 | 3 | Trantor:_The_Last_Stormtrooper:trantor last stormtrooper trantor last stormtrooper video game zx spectrum commodore 64 msx amstrad cpc atari st released go label u.s. gold 1987 version ms-dos released keypunch software produced probe software team consisted david quinn nick bruty david perry released spain trantor erbe software game mix shoot 'em platform game mostly known large well-animated sprites bruty previously produced graphics within tight limits projects decided instead focus artwork keep aspects game simple fit constraints platforms player controls titular stormtrooper survivor destruction spaceship hence title gameplay revolves around exploring play-area collecting code-letters play-area consists several different floors explored freely via connecting lifts however trantor strict time limit levels infested various aliens small flying robots sap trantor strength touches fortunately trantor armed flamethrower destroy pests unfortunately fuel limited although re-fill fuel-points located many floors whenever trantor finds code-letter timer countdown reset counts finds another letter reason much gameplay race-against-time also lockers scattered around floors contain pick-ups assist trantor include hamburgers restore strength clocks reseting time finding code letter would game ends trantor energy runs timer reaches zero player performance shown percentage game completed along short comment comment nine percent fergus referring probe co-founder fergus mcgovern history trantor widely known short backstory included manual amstrad version game manual explains trantor served stormtrooper front lines interstellar war war trantor mistakenly killed infant flamethrower game action takes place trantor troubled mind fights fictional base attempting collect remnants soul enemies represent varying aspects psychosis player eventual death dooms trantor life despondency trantor unusual time featuring animated opening-sequence loading shown main options screen shows trantor ship animated radars slowly dropping shaft landing title character emerges seen beckon others join ship suddenly disintegrates leaving alone trantor generally received positive reviews sinclair giving 9/10 calling wonderful entertainment worth much asking price sinclair user tom dillon described main character animation realistic seen 8-bit computer gave game 10/10 crash hand said excellent presentation graphics conceal shallow gameplay gave overall 68 | [
6380
] | Test |
4,905 | 7 | Simple_API_for_Grid_Applications:simple api grid applications simple api grid applications saga family related standards specified open grid forum define application programming interface api common distributed computing functionality saga specification distributed computing originally consisted single document gfd.90 released 2009 saga api strive replace globus similar grid computing middleware systems target middleware developers application developers background grid computing developers typically wish devote time goals minimize time spent coding infrastructure functionality api insulates application developers middleware specification services protocols interact scope saga rather api seeks hide detail service infrastructures may may used implement functionality application developer needs api aligns however middleware standards within open grid forum ogf saga api defined mechanism specify additional api packages expand scope saga core api defines number packages job management file management replica management remote procedure calls streams saga covers important frequently used distributed functionality supported available every major grid systems extreme science engineering discovery environment xsede egi futuregrid saga supports wide range distributed programming coordination models also easily extensible support new emerging middleware saga api standardised saga working group open grid forum based set use cases saga core api specification defines set general api principles 'saga look feel set api packages render commonly used grid programming patterns job management file management access replica management etc saga core specification also defines additional api packages defined relate core api 'look feel based number api extensions defined various states standardisation process saga specifications defined flavor idl thus object oriented language neutral different language bindings exist java c++ python point standardised nevertheless different implementations language bindings relatively coherent api definition particular different java implementations share abstract api classes 'look feel part saga core api specification covers following areas saga designed object oriented interface encapsulates related functionality set objects grouped functional namespaces called packages saga saga core implementation defines following packages overall architecture saga follows adaptor pattern software design pattern used translating one interface another saga translates calls api packages interfaces underlying middleware saga run-time system uses late binding decide run-time plug-in middleware adaptor load bind following table lists distributed middleware systems currently supported saga column labeled adaptor suite names collection release package set middleware adaptors provides support middleware system since saga interface definitions bound specific programming language several implementations saga standards exist different programming languages apart implementation language differ completeness terms standard coverage well support distributed middleware saga c++ first complete implementation saga core specification written c++ currently c++ implementation active development radical-saga light-weight python package implements parts ogf gfd.90 interface specification provides plug-ins different distributed middleware systems services radical-saga implements commonly used features gfd.90 based upon extensive use-case analysis focuses usability simple deployment real-world heterogeneous distributed computing environments application scenarios radical-saga currently implements job file management core apis well resource management api extension radical-saga provides plug-ins different distributed middleware systems services including support pbs sun grid engine ssh sftp others radical-saga used develop distributed applications frameworks run distributed cyber-infrastructure including xsede loni futuregrid clouds local clusters javasaga java implementation saga status javasaga remains uncertain import java.util.io int main int argc char** argv jsaga another java implementation saga core specification jsaga currently active development deshl deisa services heterogeneous management layer provides functionality submission management computational jobs within deisa deshl implemented set command-line tools on-top saga-inspired api implemented java back-end interfaces hila generic grid access client library part unicore system typical task distributed application submit job local remote distributed resource manager saga provides high-level api called job package following two simple examples show saga job package api used submit message passing interface mpi job remote globus gram resource manager c++ python work related saga project funded following grants nsf-che 1125332 cdi nsf-eps 1003897 lasigma nsf-oci 1007115 extenci previous grants include nsf-oci 0710874 hpcops nih grant number p20rr016456 uk epsrc grant number gr/d0766171/1 via omii-uk | [
7620,
1923,
4855,
3783,
5666,
4159,
1673,
2420,
6473,
7930,
7299,
7936,
7214,
5965,
3915,
1989,
5539
] | Test |
4,906 | 9 | MUD:mud mud originally multi-user dungeon later variants multi-user dimension multi-user domain multiplayer real-time virtual world usually text-based muds combine elements role-playing games hack slash player versus player interactive fiction online chat players read view descriptions rooms objects players non-player characters actions performed virtual world players typically interact world typing commands resemble natural language traditional muds implement role-playing video game set fantasy world populated fictional races monsters players choosing classes order gain specific skills powers objective sort game slay monsters explore fantasy world complete quests go adventures create story roleplaying advance created character many muds fashioned around dice-rolling rules dungeons dragons series games fantasy settings muds common many others science fiction settings based popular books movies animations periods history worlds populated anthropomorphic animals muds games designed educational purposes others purely chat environments flexible nature many mud servers leads occasional use areas ranging computer science research geoinformatics medical informatics analytical chemistry muds attracted interest academic scholars many fields including communications sociology law economics one time interest united states military using teleconferencing muds run hobbies free players may accept donations allow players purchase virtual items others charge monthly subscription fee muds accessed via standard telnet clients specialized mud clients designed improve user experience numerous games listed various web portals mud connector history modern massively multiplayer online role-playing games mmorpgs like everquest ultima online related virtual world genres social virtual worlds exemplified second life traced directly back mud genre indeed invention term mmorpg games style simply called graphical muds number influential mmorpg designers began and/or players raph koster brad mcquaid matt firor brian green involved early muds like mark jacobs j. todd coleman colossal cave adventure created 1975 crowther dec pdp-10 computer first widely used adventure game game significantly expanded 1976 woods also called adventure contained many features references including computer controlled dungeon master numerous dungeon crawlers created plato system university illinois american universities used plato beginning 1975 among pedit5 oubliette moria avathar krozair dungeon dnd crypt drygulch 1978-79 games heavily use various plato systems exhibited marked increase sophistication terms 3d graphics storytelling user involvement team play depth objects monsters dungeons inspired adventure group students mit summer 1977 wrote game pdp-10 minicomputer called zork became quite popular arpanet zork ported filename dungen dungeon fortran programmer working dec 1978 1978 roy trubshaw student university essex uk started working multi-user adventure game macro-10 assembly language dec pdp-10 named game mud multi-user dungeon tribute dungeon variant zork trubshaw greatly enjoyed playing trubshaw converted mud bcpl predecessor c handing development richard bartle fellow student university essex 1980 game revolved around gaining points till one achieved wizard rank giving character immortality special powers mortals mud better known essex mud mud1 later years ran university essex network became widely accessible guest account set allowed users janet british academic x.25 computer network connect weekends hours 2 8 weekdays became first internet multiplayer online role-playing game 1980 university connected internal network arpanet original mud game closed late 1987 reportedly pressure compuserve richard bartle licensed game left mist derivative mud1 similar gameplay remaining mud running university essex network becoming one first kind attain broad popularity mist ran machine hosted pdp-10 superseded early 1991 1985 saw origin number projects inspired original mud included gods ben laurie mud1 clone included online creation endgame became commercial mud 1988 mirrorworld tolkienesque mud started pip cordrey gathered people bbs ran create mud1 clone would run home computer neil newell avid mud1 player started programming mud called shades christmas 1985 mud1 closed holidays starting hobby shades became accessible uk commercial mud via british telecom prestel micronet networks scandal shades led closure micronet described indra sinha net-memoir cybergypsies time compunet started project named multi-user galaxy game science fiction alternative mud1 copy running system time one two programmers left compunet remaining programmer alan lenton decided rewrite game scratch named federation ii time federation existed mud officially launched 1989 federation ii later picked aol became known simply federation adult space fantasy federation later left aol run aol began offering unlimited service 1978 around time roy trubshaw wrote mud alan e. klietz wrote game called milieu using multi-pascal cdc cyber 6600 series mainframe operated minnesota educational computing consortium klietz ported milieu ibm xt 1983 naming new port scepter goth scepter supported 10 16 simultaneous users typically connecting modem first commercial mud franchises sold number locations scepter first owned run gambit minneapolis minnesota founded bob alberti gambit assets later sold interplay productions interplay eventually went bankrupt 1984 mark peterson wrote realm angmar beginning clone scepter goth 1994 peterson rewrote realm angmar adapting ms-dos basis many dial-in bbs systems renamed swords chaos years popular form mud hosted number bbs systems widespread internet access eliminated bbses 1984 mark jacobs created deployed commercial gaming site gamers world site featured two games coded designed jacobs mud called aradath later renamed upgraded ported genie dragon gate 4x science-fiction game called galaxy also ported genie peak site 100 monthly subscribers aradath galaxy genie shut late 1990s although dragon gate later brought america online finally released dragon gate closed february 10 2007 summer 1980 university virginia classmates john taylor kelton flinn wrote dungeons kesmai six player game inspired dungeons dragons used roguelike ascii graphics founded kesmai company 1982 1985 enhanced version dungeons kesmai island kesmai launched compuserve later 2-d graphical descendant legends kesmai launched aol 1996 games retired commercially 2000 popularity muds university essex tradition escalated usa late 1980s affordable personal computers 300 2400 bit/s modems enabled role-players log multi-line bulletin board systems online service providers compuserve time sometimes said mud stands multi undergraduate destroyer due popularity among college students amount time devoted them. published yehuda simmons 1989 first persistent game world kind without traditional hourly resets points-based puzzle solving progression systems avalon introduced equilibrium balance cooldowns skill-based player vs player combat concepts player-run governments player housing first popular mud codebase abermud written 1987 alan cox named university wales aberystwyth alan cox played original university essex mud gameplay heavily influenced abermud initially written b honeywell l66 mainframe gcos3/tss late 1988 ported c enabled spread rapidly many unix platforms upon release 1989 abermud popularity resulted several inspired works notable tinymud lpmud dikumud monster multi-user adventure game created richard skrenta vax written vms pascal publicly released november 1988 monster disk-based modifications game immediate monster pioneered approach allowing players build game world setting new puzzles creating dungeons players explore monster comprised 60,000 lines code lot features appeared designed allow colossal cave adventure work though never many network-accessible monster servers inspired james aspnes create stripped version monster called tinymud tinymud written c released late 1989 spawned number descendants including tinymuck tinymush tinymuck version 2 contained full programming language named muf multi-user forth mush greatly expanded command interface distance combat-oriented traditional muds said tinymud stood multi-user domain dimension along eventual popularity acronyms mud muck mush muse kind server led eventual adoption term mu* refer tinymud family ubermud untermud moo inspired tinymud direct descendants first version hourglass written yehuda simmons later daniel james debuted 1989 last london mud mega meets aptly named 'adventure '89 initially hosted iowa system initially written arm assembler acorn archimedes 440 1994 made leap venerable archimedes debian linux pc later red hat shifting ubuntu operating system remained ever since early version hourglass also ported pc named vortex ben maizels 1992 although written specifically avalon legend lives went spawn number games including avalon first age ran 1999-2014 defunct 1996 age thrones notably achaea dreams divine lands started life vortex prior moving rapture engine hourglass continues developed 2016 avalon legend lives currently 2901325 written words 2248374 lines game-code 2417900 instructions original game coming 1k 1989 compared 102gb january 2016 1989 lpmud developed lars pensjö hence lp lpmud pensjö avid player tinymud abermud wanted create world flexibility tinymud gameplay abermud order accomplish wrote nowadays known virtual machine called lpmud driver ran c-like lpc programming language used create game world pensjö interest lpmud eventually waned development carried others jörn amylaar rennecke felix dworkin croes tim beek hollebeek lars düning early 1990s lpmud one popular mud codebases descendants original lpmud include mudos dgd swlpc fluffos pike programming language latter work long-time lpmud developer fredrik profezzorn hübinette 1990 release dikumud inspired abermud led virtual explosion hack slash muds based upon code dikumud inspired numerous derivative codebases including circlemud merc rom smaug godwars original diku team comprised sebastian hammer tom madsen katja nyboe michael seifert hans henrik staerfeldt dikumud key influence early evolution mmorpg genre everquest created avid dikumud player brad mcquaid displaying diku-like gameplay verant developers made issue sworn statement actual dikumud code incorporated 1987 david whatley previously played scepter goth island kesmai founded simutronics tom susan zelinski year demonstrated prototype gemstone genie short-lived instance gemstone ii gemstone iii officially launched february 1990 gemstone iii became available aol september 1995 followed release dragonrealms february 1996 end 1997 gemstone iii dragonrealms become first second played games aol typical mud describe room area standing listing objects players non-player characters npcs area well exits carry task player would enter text command take apple attack dragon movement around game environment generally accomplished entering direction abbreviation player wishes move example typing north n would cause player exit current area via path north mud clients often contain functions make certain tasks within mud easier carry example commands buttons click order move particular direction pick item also tools available add hotkey-activated macros telnet mud clients giving player ability move around mud using arrow keys keyboard example many variations overall focus gameplay features muds distinct sub-groups formed used help categorize different game mechanics game genres non-game uses perhaps common approach game design muds loosely emulate structure dungeons dragons campaign focused fighting advancement role-playing muds restrict player-killing favor player versus environment conflict questing labeled hack slash muds may considered particularly appropriate since due room-based nature traditional muds ranged combat typically difficult implement resulting muds equipping characters mainly close-combat weapons style game also historically referred within mud genre adventure games video gaming whole developed meaning adventure game greatly odds usage muds restrict player versus player combat often abbreviated pk player killing accomplished hard coded restrictions various forms social intervention muds without restrictions commonly known pk muds taking step muds devoted solely sort conflict called pure pk muds first genocide 1992 genocide ideas influential evolution player versus player online gaming roleplaying muds generally abbreviated rp muds encourage enforce players act role playing characters times rp muds provide immersive gaming environment others provide virtual world game elements muds roleplay enforced game world heavily computer-modeled sometimes known roleplay intensive muds rpimuds many cases role-playing muds attempt differentiate hack slash types dropping mud name entirely instead using mux multi user experience mush multi user shared hallucination social muds de-emphasize game elements favor environment designed primarily socializing differentiated talkers retaining elements beyond online chat typically online creation community activity element role-playing often muds broadly defined contingents socializers roleplayers server software tinymud family mu* traditionally used implement social muds less-known mud variant talker variety online chat environment typically based server software like ew-too nuts early internet talkers lpmuds majority complex game machinery stripped away leaving communication commands first internet talker cat chat 1990 taking advantage flexibility mud server software muds designed educational purposes rather gaming chat micromuse considered first educational mud argued evolution role complete 1994 would make first many educational moos diversity university 1993 also first educational mud mud medium lends naturally constructionist learning pedagogical approaches mud institute tmi lpmud opened february 1992 gathering place people interested developing lpmud teaching lpc became clear lars pensjö lost interest project tmi focussed lpmud driver library driver evolving mudos tmi mudlib never officially released influential development libraries graphical mud mud uses computer graphics represent parts virtual world visitors prominent early graphical mud habitat written randy farmer chip morningstar lucasfilm 1985 graphical muds require players download special client game artwork range simply enhancing user interface simulating 3d worlds visual spatial relationships customized avatar appearances games meridian 59 everquest ultima online dark age camelot routinely called graphical muds earlier years runescape actually originally intended text-based mud graphics added early development however increase computing power internet connectivity late nineties shift online gaming mass market term graphical mud fell favor replaced mmorpg massively multiplayer online role-playing game term coined richard garriott 1997 within mud technical infrastructure mudlib concatenation mud library defines rules in-game world examples mudlibs include soph mudlib cdlib discworld mudlib lima mudlib lpuniversity mudlib morgengrauen mudlib nightmare mudlib tmi mudlib mud history preserved primarily community sites blogs mainstream sources journalistic repute late 1990s website called mud connector served central curated repository active muds 1995 independent reported 60,000 people regularly played 600 muds 170 muds three years prior independent also noted distinct patterns socialization within mud communities seraphina brennan massively wrote mud community decline 2009 sherry turkle developed theory constant use many cases overuse muds allows users develop different personalities environments uses examples dating back text-based muds mid-1990s showing college students simultaneously live different lives characters separate muds three time schoolwork students claimed way shut lives become part another reality turkle claims could present psychological problem identity today youths story tree short essay written raph koster regarding death legendmud player named karyn raising subject inter-human relationships virtual worlds observations mud-play show styles play roughly categorized achievers focus concrete measurements success experience points levels wealth explorers investigate every nook cranny game evaluate different game mechanical options socializers devote energy interacting players killers focus interacting negatively players permitted killing characters otherwise thwarting play players play one way play one way time exhibit diverse style according richard bartle people go part hero journey—a means self-discovery research suggested various factors combine muds provide users sense presence rather simply communication noun word mud variously written mud mud mud depending speaker context also used verb mud meaning play interact mud mudding referring act mudder naturally one muds compound words portmanteaux mudlist mudsex mudflation also regularly coined puns wet dirt meaning mud endemic example names rom rivers mud muck mush coffeemud codebases mud muddy waters | [
5911,
1356,
7739,
931,
4887,
5056,
7658,
5948,
6380,
8117,
4995,
7765,
3060,
7588,
6586,
3677,
1435
] | Train |
4,907 | 3 | Dragon_Quest_(video_game):dragon quest video game dragon quest created yuji horii took inspiration previous role-playing games wizardry ultima 1983 game portopia serial murder case horii wanted create rpg would appeal wide audience people unfamiliar genre video games general tried place greater emphasis storytelling emotional involvement well simplify interface expose mostly western computer genre japanese console market manga artist dragon ball creator akira toriyama produced game artwork koichi sugiyama composed music north american version features numerous changes including battery-backed ram save games rather using password save system modified character sprites pseudo-elizabethan english style dialog dragon quest commercially successful japan 2 million copies sold release dragon warrior north america western countries less favorably received later western critics noted game shortcomings acknowledged importance genre fan-made rom hacks released substantial changes game game synthesized soundtrack orchestrated music performed numerous concerts whole dragon warrior credited establishing basic template japanese console rpgs followed dragon warrior role-playing video game gameplay mechanics described years release simplistic spartan players control young hero sets defeat known dragonlord starting game players presented menu allows begin new quest game continue previous quest change speed messages appear screen japanese version continuing quest requires players enter password north american nintendo entertainment system nes english version quest saved onto game cartridge battery-backup known game adventure log imperial scrolls honor english version also options delete duplicate saved quest players choose start new quest may give hero name wish either japanese kana english letters depending version hero name effect initial ability scores statistical growth course game stat falls one two categories one faster growth game determines path stat uses formula based kana letters character name. ref name= guide 6/105 /ref dragon warrior presents players clear objective start uses series smaller scenarios increase hero strength order achieve objective game begins king lorik chamber tantegel castle hero receives information dragonlord must defeat stolen balls light must retrieve receiving items gold hero sets quest much dragon warrior spent talking townspeople gathering information leads additional places events secrets players advised take notes hints future reference towns contain shops sell improved weapons armor general stores player may buy goods inns allow hero recover health magic shops offer keys purchase players may sell items half price shops provide weapons armor general goods hero status window shown whenever stops moving displaying current experience level lv number hit points hp magic points mp gold g experience points e safely progress next areas game players need accumulate experience points gold defeating enemies outside towns – overworld dungeons apart dragonlord castle physical restrictions players roam instead monsters increase difficulty players venture tantegel castle hero level increases players explore afield less risk enemies appear random encounters hero fights one opponent time encounter rate lowest fields increases forests hills battles turn-based fought first-person perspective hero remains off-screen combat players must defeat enemy reducing hp zero combat players four commands fight run spell item fight command causes hero attack enemy weapon bare fists weapon available attempt inflict damage run command hero attempts escape battle recommended hp low spell command casts magic example heal hero damage enemy item command uses herbs replenish hero hp combat hero loses hp takes damage display turns red hp low hp falls zero dies taken back king lorik resurrected loses half gold punishment hero succeeds defeating enemy gains experience points gold gains enough experience points experience level increases giving greater strength agility speed ability use magic spells every time spell used hero mp decreases different spells costing different amounts mp hp mp restored resting inn additionally non-player character replenish hero mp tantegel castle hero earns gold purchase better weapons armor items however players limited inventory space hold items must manage item collection conservatively caves hero explores dark require use torch radiant spell display temporary field vision around character english version players return king lorik point save quest japanese version battery backup players receive password return quest later time control pad may used move hero direction move flashing cursor menu displays additional buttons confirm cancel commands english version players use menu commands talk people check status search beneath feet use items take treasure chests open doors go stairs however game later remakes certain commands assigned buttons navigating stairs became automatic hero speed increased japanese version characters always face forward players must choose command direction perform action north american version hero turns face direction moving making direction selection unnecessary dragon warrior plot twist saving princess dragon n't even meet speak complete game dragon warrior sequel dragon quest ii prequel dragon quest iii comprise trilogy shared timeline story background begins kingdom alefgard shrouded permanent darkness brave warrior erdrick known loto game boy color gbc remake game defeated evil creature restored light land erdrick possession ball light used drive away enemies threatened kingdom erdrick handed ball light king lorik alefgard remained peaceful long time ball light kept winters short alefgard helped maintain peace prosperity region however one man shunned ball light radiance secluded mountain cave one day exploring cave extensive network tunnels man encountered sleeping dragon awoke upon entrance feared dragon would incinerate fiery breath dragon instead knelt obeyed commands man later discovered dragon became known dragonlord one day soul became corrupted learning magic dragonlord attacked tantegel castle nearby town breconnary fleet dragons set town fire riding large red dragon dragonlord descended upon tantegel castle stole ball light soon monsters began appear throughout entire land destroying everything paths much land became poisonous marshes least one destroyed town hauksness whose name erroneously transposed rimuldar adventurer handbook walkthrough never recovered remains ruins even time gameplay following day erdrick arrived tantegel castle speak king lorik offered help defeat dragonlord searching land clues dragonlord whereabouts erdrick found dragonlord lived island could accessed via magical bridge rainbow drop could generate venturing island erdrick never heard many years later king lorik xvi reign dragonlord attacked kingdom captured princess gwaelin many heroes tried rescue princess recover ball light dragonlord castle called charlock none succeeded prophet mahetta predicted one day descendant valiant erdrick shall come forth defeat dragonlord however descendant game hero arrives many people alefgard forgotten story erdrick remember consider myth believe mahetta prophecy king lorik starts mourn decline kingdom game begins player assumes role stranger arrives tantegel castle castle guard tells dragon captured princess holding captive distant cave determined rescue princess defeat dragonlord discovers ancient tablet hidden inside desert cave carved tablet message erdrick outlines hero needs follow erdrick footsteps defeat dragonlord hero eventually rescues princess gwaelin realizes order restore light alefgard must defeat dragonlord charlock castle hero collects series relics creates bridge reach charlock fights way castle finally confronting dragonlord point hero given dialogue choice – side dragonlord challenge players choose former game ends hero put sleep game freezes however gbc remake hero instead wakes bad dream players choose fight final battle hero dragonlord commences hero defeats dragonlord reclaims ball light eradicating monsters alefgard triumphantly returns tantegel castle king lorik offers kingdom reward hero turns offer instead wishes find kingdom accompanied princess gwaelin hero sets search new land sets stage events dragon warrior ii take place many years later tells story three hero descendants dragon warrior hero dragonlord two main characters major supporting characters king lorik king lars gbc remake daughter princess gwaelin lady lora two sages hero meets journey hero comes land beyond alefgard descendant legendary erdrick hero arrives appear warrior – arrives without weapons armor – ignorant situation populace thinks claim ability defeat dragonlord preposterous however king lorik sees ability give hope aids hero quest dragonlord dragon rules charlock castle visible tantegel castle game starting point soul became evil learning magic rumors say spy network knows everything happens alefgard seeks unlimited power destruction results rising tide evil throughout alefgard dragonlord wants enslave world army monsters controls yuji horii team chunsoft began developing dragon quest 1985 released japan 1986 famicom msx pc-9801 dragon quest released multiple platforms since initial release including mobile phones 2004 updated graphics similar eidansha boshu service center founded 1975 published tabloid magazines advertised real estate 1982 failing establish chain stores company founder yasuhiro fukushima transformed software company devoted gaming renamed enix find talent company fukushima held enix game hobby program contest competition styled manga competitions advertised computer manga magazines million prize winners winners koichi nakamura manga magazine shōnen jump editor yuji horii top winner horii designed tennis game love match tennis became enix first release believe would win motivated editor enjoyed games published horii articles later enix began creating games nes fukushima held another contest time nakamura cartoonish creative contest entry door door became enix first release nes horii earliest inspiration dragon quest 1983 pc visual novel portopia serial murder case – murder mystery adventure game bears similarities games mystery house zork particularly déjà vu horii wanted advance game storyline using dialogue portopia originally released japan nec pc-6001 later ported nes 1985 port enix second release system first game horii nakamura worked together horii redesigned interface port accommodate console limited controls added dungeon-crawling area detective explores portopia directly result dragon quest creation according 1up.com proving ground rpg menu-based command system portopia would later used dragon quest original idea dragon quest came development nes port portopia horii nakamura came across rpg wizardry macworld conference expo influence nes portopia dungeon crawl segments horii liked game depth visuals wanted create game similar wizardry expose mainly western-exclusive rpg genre japan expand genre past computer enthusiasts horii also cited ultima inspiration dragon quest gameplay specifically first-person random battles wizardry overhead perspective ultima rpg genre predominantly western limited pcs japanese gamers enjoyed home-grown games black onyx dragon slayer series alongside western rpg ports however horii nakamura enjoyed dungeon crawling statistical nature wizardry realized people would originally concern success super mario bros. greatly increased potential audience new famicom/nes game create dragon quest gameplay needed simplified according horii keyboard system much simpler using game controller still thought would really exciting player play alter ego game personally playing wizardry ultima time really enjoyed seeing self game order create rpg would appeal wide audience unfamiliar genre video games general horii wanted create new kind rpg rely previous experience dungeons dragons tabletop rpg require hundreds hours rote fighting could appeal kind gamer accomplish needed simplify system players associate hero thus game progressed hero would become stronger contrast games like super mario bros. character mario become progressively powerful game wanted build portopia place greater emphasis storytelling emotional involvement developed coming-of-age tale audiences could relate made use rpg level-building gameplay way represent horii believed famicom ideal platform dragon quest unlike arcade games players would worry spending money got game could continue playing left whenever player loses battle would immediately restored previous save point rather game ending returned main menu making game accessible also wanted include multiple player characters forced use one due memory constraints horii knew rpgs steeper learning curve video games time compensate implemented quick level-ups start game gave players clear final goal visible world map starting point dragonlord castle also provided series smaller scenarios order build player strength achieve final objective created open world blocked physically way except monsters easily kill unprepared players gamasutra described one earliest examples nonlinear gameplay horii used bridges signify changes difficulty implemented level progression high starting growth rate decelerates time contrasted random initial stats constant growth rates early editions dungeons dragons make game appeal larger audience manga artist creator dragon ball akira toriyama hired produce artwork dragon ball toriyama artwork features characters whose strength cunning transcend generations also includes humorous elements chibi style koichi sugiyama game music composer sought enix sugiyama sent pc game feedback questionnaire enix already well-known television composer upon seeing sugiyama feedback fukushima contacted confirm sugiyama television upon confirmation fukushima asked sugiyama compose score dragon quest game classical score sugiyama second video game composition wingman 2 sugiyama said took five minutes compose original opening theme noted difficulty adding personal touch short jingles past experience creating music television commercials helped according sugiyama composer three five seconds catch audience attention music theme jingles dragon quest remained relatively intact sequels coverage dragon quest north american localization first appeared nintendo fun club news winter 1988 issue – title changed dragon warrior title changed avoid infringing trademark wargame publisher simulations publications pen-and-paper rpg dragonquest article game featured images game japanese version erdrick original name roto dragonlord original name dragon king original name game starting location radatome castle briefly explained backstory basic gameplay elements comparing game legend zelda game later mentioned nintendo power pak watch preview section march 1989 mentioning dragon quest iii japanese release magazine premiere july 1988 issue mentioned change name dragon quest dragon warrior inspiration two japanese sequels release still distant time dragon warrior released north america nintendo america direction satoru iwata help horii august 1989 – months japanese release game released north america nearly three years original release japan graphics improved instead lengthy passwords kana characters north american version features battery-backed ram savegame akira toriyama artwork instruction booklets also changed reflect traditional tone found popular american based rpgs ultima series game character sprites changed face direction travel japanese versions sprites smaller face forwards requiring players choose direction actions menu spells given self-explanatory one-word titles instead made-up words japanese version locations renamed dialogue rewritten whimsical style comparable dragon ball style inspired elizabethan english sentences thy hit points decreased 1 nintendo also removed salacious humor religious connotations english-language version example japanese version town hero first buys keys woman offers sell puff-puff – japanese onomatopoeia girl rubbing breasts someone face juggling breasts north american version woman sells tomatoes term included game sequels well toriyama dragon ball series katsuya terada created artwork early dragon warrior articles nintendo power neither terada editing artwork instruction booklet followed toriyama work instead used settings character poses create alternate artwork american style japanese hero drawn super deformed manga style english version appearance based west template medieval hero june 1989 electronic gaming monthly quartermann speculated dragon warrior would nintendo big release north america christmas based series immense popularity japan especially dragon quest iii sales nintendo power provided three feature articles dragon warrior issues may october 1989 november–december 1989 issue includes strategy guide march–april 1990 issue nintendo power map game world poster super contra side also features dragon warrior text adventure late 1990 nintendo power gave free copies dragon warrior subscribers including 64-page explorer handbook full walkthrough game additional backstory mentioned original instruction booklet nintendo reportedly interested getting rid unsold copies game gave away subscribers time game cost approximately retail magazine subscription fee respectively adjusted inflation giveaway attracted nearly 500,000 new magazine subscribers many renewed subscription get game ultimately led success series western market enix remade dragon quest dragon quest ii one-cartridge compilation known dragon quest ii super famicom december 18 1993 remake sold 1.2 million copies japan 1998 enix released bs dragon quest super famicom satellaview extension exclusively japan latter consisted four one-hour scenarios players would download weekly schedule players tasked leveling character collecting medals completing scenario-specific conditions special events designed occur specific conditions real-time dragon warrior dragon warrior ii re-released part similar compilation gbc titled dragon warrior ii developed tose released enix september 23 1999 japan september 27 2000 north america uses entirely new translation discards pseudo-elizabethan english style uses names closer japanese version remake dragonlord changed dracolord erdrick changed loto several additional features added example players quicksave game anytime outside battle quicksave deleted standard saved game loaded players store gold future use bank case die menu streamlined monsters yield experience gold reduce amount time needed increase levels make saving in-game purchases faster 2004 game along sequel remade mobile phones japan version graphically based super famicom remake dragon quest iii famicom super famicom versions game together dragon quest ii dragon quest iii re-released dragon quest 25th anniversary collection compilation wii japan september 15 2011 compilation includes original copies games strategy guides original artwork material games development october 2013 square enix announced re-releasing dragon quest i–viii android ios november 2013 game released ios android mobile platforms japan release based 2004 mobile remake game united states europe mobile versions released september 11 2014 dragon warrior inspired related media form manga series adapted anime symphonic video game soundtrack manga series written chiaki kawamata junji koyanagi artwork kamui fujiwara published 1991 1997 monthly shōnen gangan enix compiled series 21 volumes later released compact disc 1994 released december 11 2009 playstation store part initial launch sony digital comic distribution 1996 anime movie based manga released videocassette square enix started publishing sequel series 2005. wrote first four volumes takashi umemura wrote last five yuji horii supervised manga kamui fujiwara contributed artwork dragon quest saga emblem roto takes place dragon warrior iii dragon warrior monsters possessed carmen king seven years kingdom fell hordes evil survivors prince arus army general daughter lunafrea meanwhile kingdom loran child born named jagan accordance demon lord imagine orders arus lunafrea set defeat monsters restore peace world sequel children inherit emblem takes place five years events dragon quest saga emblem roto world chaos young boy sets gather companions help save world evil koichi sugiyama composed directed music dragon warrior soundtrack included eight tracks rpgfan said foundation sugiyama career pieces arranged incorporated later dragon warrior games soundtracks music released variety formats first drama cd released enix july 19 1991 incorporated narrated story super famicom edition symphonic suite dragon quest published sony records january 12 1994 followed soundtrack featured orchestral versions tracks played london philharmonic orchestra original versions tunes game classical score considered revolutionary console game music soundtrack eight melodies approach set template rpg soundtracks released since hundreds organized similar manner orchestral albums dragon warrior ii combined symphonic suite dragon quest i•ii released sme visual works august 23 2000 king records reprinted october 7 2009 orchestral tracks released symphonic suite dragon quest album including orchestral versions game sound effects numerous live concerts featured performances game music many performances later released albums dragon quest concert suite dragon quest i•ii initial sales game low enix going lose money several shonen jump articles horii helped increase sales substantially people liked toriyama artwork sugiyama music book said richer exciting game music ever sounded game extremely popular japan became first series 2016 includes eleven games several spin-off series stand-alone titles 2 million copies sold japanese version dragon quest ii remake snes yielded 1.2 million copies sold japan 1989 soft catalog issue famicom tsūshin famitsu included dragon quest list best games time receiving best rpg best character design awards losing dragon quest iii overall grand prize best game time several years japanese release first english-language version dragon warrior garnered average reviews overall nintendo power ranked third five upon original release debuted 7 magazine bimonthly top 30 top nes games list november 1989 climbed 5 january 1990 remained 4 months dropped 11 may 14 july 16 september 1990 dropped list nintendo power awards 1989 game nominated best theme fun best overall failed win either category response japanese youths arrests waiting dragon quest iii release electronic gaming monthly quartermann said game special compared nes version recommended others play game instead english version seen commercial failure according chris kohler nintendo power subscription success allowed enix bring next three games said nintendo profited immensely dragon warrior subscription giveaway nintendo power essentially hundred-page monthly ad nintendo products thousands households game release regarded important history console rpg kohler noted toriyama sugiyama contributions game made dragon quest visually aurally exciting game play unique sophisticated gamespot named one fifteen influential titles video game history ign listed eighth best all-time nes game 2005 listed 92nd-best all-time video game 2007 listed game 29th best nintendo power rated dragon warrior 140th-best game made nintendo system top 200 games list 2006 ign reviewed game years later gave 7.8 10 rpgamer bill johnson gave 4 5 overall score nes localization received considerable praise adding extra characters depth story removal stylized dialogue gbc remake similarly lamented allgame declared despite enormous influence ... dragon warrior flawed game decent design ideas terribly enjoyable noting simplistic graphics slow pace poor sound seemingly primitive today standards dragon warrior features one-on-one combat limited item equipment array ten spells five towns five dungeons noting importance development rpg genre allgame reviewer kyle knight states taken merits enjoyable game play 1up.com explained series immensely popular first north america american console gamers used idea rpgs said would take decade genre flashy enough distract words made read gamecritics chi kong lui wrote game added realism video games added player perished dragon warrior suffer dire consequences losing progress precious gold element death evoked sense instinctive fear tension survival said allowed players identify main character much larger scale ign writer mark nix compared game seemingly archaic plot modern rpgs said noble blood means nothing society capitalist aristocratic militaristic damsels n't need rescuing – need battle axe magic tutoring field reviewing gamespy staff wrote many gamers dragon warrior first exposure console rpg recalling past staff member commented bill johnson compared dragon warrior modern rpgs noted game complete lack replay value due much requirement almost everything game must done beat difficulty johnson noted game historical importance said playing dragon warrior tough road walk reaching end instill new appreciation today rpg 2009 book vintage games contrasted dragon warrior 1986 nes title legend zelda said titles share common rpg elements zelda features fantasy setting magic level turn-based combat system dragon warrior features nintendo power said game historical significance greatest aspect noted playing dragon warrior days bit chore gamepro wrote favorite aspect game elizabethan-english dialogue disappointed removal gbc remake famitsu gave snes compilation remake dragon quest ii rating 35 40 satellaview remake given mixed overall positive review microgroup touches real-time event voicing appreciated implementation left much desired however medal collection nice way compete friends reviewer enjoyed game dragon warrior english remake part dual gbc cartridge dragon warrior ii received better reviews original garnering praise ign nintendo power gave 8 10 ign marc nix noted one interesting rpgs game boy color actually make american shores players feel frustrated played original lament changes new players feel game linear simple gamespot gave 9.6 10 citing great improvements sound quality appeal playing games succession gamerankings reports 82 overall score received rpgamer game boy color award year 2000 comparing nes counterpart rpgamer derek cavin awarded 3 5 wrote game average aspects particularly praised visual elements criticized game repetitiveness said short enough players finish game repetition becomes issue combined snes gbc remakes saw 1.94 million copies sold worldwide remakes good sales performances enix released dragon warrior iii gbc 2001 based previously unreleased snes update dragon quest iii english version square enix music online juan2darien reviewed game symphonic scores dragon quest suite dragon quest remix symphonic suite london philharmonic orchestra dragon quest ii symphonic suite london philharmonic orchestra remastered dragon quest symphonic suite tokyo metropolitan symphony orchestra comparing suites gave ratings ranging 7 9 10 found tokyo strings ensemble recording superior aforementioned symphonic suites music somewhat flat juan2darien acknowledged due source material praised koichi sugiyama orchestras efforts compose above-average piece despite limitation gamasutra kurt kalata also praised symphonies melody commenting overworld theme ... pretty simplistic grating actually sounds pretty beautiful played live orchestra dragon quest retsuden roto monshō – children inherit emblem sold well japan week august 26 september 1 2008 volume 7 ranked 9th japan selling 59,540 copies week february 24 march 2 2009 volume 8 ranked 19th japan selling 76,801 copies week october 26 november 1 2009 volume 9 ranked 16th japan selling 40,492 copies total 60,467 dragon warrior release noted notable turning point video game history game listed genre builder rpgs popularity japan synonymous rpgs game elements present previous rpg titles dragon warrior set template others almost elements became foundation nearly every later game genre gameplay narrative according shigeru miyamoto success dragon warrior changed nature video game development making scenario writers far important dragon warrior released many development techniques used intended compensate hardware limitations contemporary rpg developers continue use techniques despite technological advances made unnecessary dragon warrior introduced damsel-in-distress storyline many rpgs follow fresh plot twist saving princess formula game true objective revealed princess rescued game also introduced element romance player character given dialogue choice respond princess question whether loves romance since become commonplace feature genre game 2d graphic style used rpgs advent 3d graphics dragon warrior top-down perspective become dead giveaway rpg game featured elements still found rpgs ability obtain better equipment major quests intertwine minor subquests incremental spell system use hit points experience points medieval theme reviewers said final fantasy considered important due popularity attention north america dragon warrior laid fundamentals final fantasy based nintendo power november 2010 issue celebration nes 25th anniversary north america horii recalled making dragon warrior horiii fan basic rpg mechanics wanted simplify interfaces said many rpgs interfaces time complicated intimidated new users said dragon warrior simplified gameplay made game appealing people made franchise successful told nes lacked sufficient capacity rpgs motivated make one dragon quest became national phenomenon japan inspiring spinoff media figurines video game industry called japan national game horii linked shonen jump articles increased celebrity status become household name japan well known japan steven spielberg us contrast miyamoto creator super mario bros. legend zelda nearly well-known famitsu poll japanese public voted dragon quest seventh favorite game nes several clones glory heracles legend ghost lion mother inspired japanese version success mother shigesato itoi fan dragon warrior miyamoto detractor rpgs created rpg would subvert dragon warrior rpg template changing setting themes middle ages us dragon warrior along nes titles spawned many rom hacks recent years one notable hack includes super mario remix ii features new plot revised character sprites reflect mario series gameplay layout remain dragon warrior became popular japan asked draw 'slime japanese person likely draw shape similar game interpretation slime many aspects pop culture still reference dragon warrior video game music band descendants erdrick based austin texas named game main character april fools day 2012 google added dragon warrior -inspired 8-bit option google maps 2016 spin-off title dragon quest builders released alternate sequel first game story set 100 years consequences erdrick instead accepts dragonlord offer rule half world | [
3472,
1740,
1862,
1670,
3196,
4260,
2375,
3796
] | Test |
4,908 | 4 | Security_switch:security switch security switch hardware device protect computers laptops smartphones similar devices unauthorized access operation distinct virtual security switch offers software protection security switches operated authorized user reason isolated devices order prevent unauthorized access possible bypass order prevent malicious manipulation primary purpose security switch provide protection cellphone surveillance eavesdropping malware spyware cyberwarfare laptop theft theft smartphones similar devices unlike protections techniques security switch provide protection even computer phone security already broken since access components accessible device software disconnect block peripheral device perform man middle operations like isolated encryption similar operations security switch s.s. used human presence detection since signals sent initiated human operator manipulated bypassed s.s. also used internet security hardware firewall concept security switch patented 2007 presented 35th ieee symposium security privacy | [
3767,
6756
] | Test |
4,909 | 9 | Mirah_(programming_language):mirah programming language mirah formerly duby programming language based ruby language syntax local type inference hybrid static–dynamic type system pluggable compiler toolchain mirah created charles oliver nutter 'ruby-like language probably subset ruby syntax could compile solid fast idiomatic jvm bytecode word refers gemstone ruby javanese language play concept ruby java foster participation jruby project ruby community members nutter began explore possibility presenting ruby syntax static type model direct-to-native compiling context native meant mainly java virtual machine jvm mirah designed around possibility alternative backends object-oriented runtimes like common language runtime clr .net framework language needed look feel like ruby introduce new library dependencies jruby precludes jvm languages suffer performance penalty precludes writing ruby early versions mirah duby focused mostly mathematical performance dynamic programming languages often pay highest cost since evolved full jvm language several users real-world applications using core components mirah mostly pluggable compiler toolchain main elements chain phases last two need specific knowledge eventual target platform makes mirah suitable many backends also makes possible write language plug-ins mirah transformation phase apply supported backends equally simple pieces code jvm bytecode backend mirah compiler emits nearly instructions standard javac compilers mirah compiler ships standard library intent mirah users choose libraries want use perhaps write plugins mirah compiler support compiler rest explicit design goal avoid introducing requirement new external library standard library mirah whatever standard library current backend emphasis placed writing compiler plugins rather libraries extend enhance language mirah impose specific type system users instead relying whatever target backend provides jvm type system largely java type system type declarations refer jvm classes primitives interfaces mirah primarily statically-typed language support development allow dynamic typing also mechanism similar provided c 4 special dynamic type indicating dispatches variable value done dynamically dynamic type support currently planned java 7 higher using new codice_1 bytecode syntax mirah largely syntax ruby modifications support static typing outside differences mirah code generally looks like ruby code mirah development developers using mirah production applications limited scope dubious project running mirah google app engine provides way build apps mirah conventions familiar developers using ruby rails sinatra since everything compiled ahead-of-time mirah applications none initializing costs associated jruby dubious supports eruby erb simple datastore adapter uses syntax similar datamapper | [
6507,
1102,
6605,
3915,
5571,
2530,
4151,
6428,
3879
] | Test |
4,910 | 2 | Debian_GNU/kFreeBSD:debian gnu/kfreebsd debian gnu/kfreebsd discontinued operating system released debian project used freebsd kernel gnu userland majority software debian gnu/kfreebsd built sources debian kernel packages freebsd k kfreebsd abbreviation kernel refers freebsd kernel discontinuing project debian maintained i386 amd64 ports last version debian kfreebsd debian 8 jessie rc3 debian gnu/kfreebsd created 2002 included debian 6.0 squeeze technology preview debian 7.0 wheezy official port debian gnu/kfreebsd discontinued officially supported platform debian 8.0 failed attract enough users justify burden rest project debian developers cited oss pf jails ndis zfs reasons interested freebsd kernel updated since debian 8 july 2019 however operating system continues maintained unofficially | [
7514,
7161,
5021,
6086,
2916,
2559,
732,
3636,
5760,
3986,
415,
5065,
6477,
424,
6149,
6860,
6505,
1523,
7969,
1547,
481,
2300,
1193,
4059,
6549,
8001,
6918,
6211,
4806,
4441,
5865,
8037,
3751,
875,
1254,
191,
1260,
5912,
6984,
4498,
73... | Test |
4,911 | 8 | So-net:so-net | [
7232,
450,
6330,
2177,
7514,
4761,
6621,
4408,
481,
746,
4718,
602,
2873,
424,
253,
4011,
5446,
4748
] | Test |
4,912 | 2 | N.O.V.A._Near_Orbit_Vanguard_Alliance:n.o.v.a near orbit vanguard alliance near orbit vanguard alliance better known n.o.v.a short action-adventure video game ipod apple products made apple gameloft released december 17 2009 ios webos one games containing gameloft live online gaming service later released playstation network playstation portable playstation 3 december 21 2010 five days release n.o.v.a 2 n.o.v.a legacy free download pay2progress game marketed remaster original n.o.v.a developed gameloft madrid actually locations original story completely removed released android google play store 2017 app store ios 2018 game hostiles known xenos similar metroid series well halo series n.o.v.a primarily first-person shooter one on-rails driving segment throughout game twelve levels players fight alien enemies known xenos game takes major cues sci-fi console shooters halo metroid series player use eight weapons resemble futuristic versions weapons found one gameloft previous works players use multiplayer n.o.v.a following ways indeterminate point future earth rendered uninhabitable humans animals unknown means therefore humans built satellites space order protect xenos created alliance called n.o.v.a near orbit vanguard alliance kal wardin n.o.v.a commander enjoying drink 2 soldiers come knock kal wakes training area tries head ship attacked xenos goes colonial frigate gone quiet time unknown reasons kal crashes ship inside air lock attacked raiders kal told self-destruct frigate explodes lands back earth meets later possible survivors frigate goes planet xenos yelena deleted pushes finds judger kal kills whole planet possibly explodes game well received critics metacritic score 94/100 based 9 reviews levi buchanan ign awarded game 9.0/10 calling best first-person shooter iphone right pocket gamer gave game 9/10 gold award slide play gave perfect 4/4 saying fans fpses n't let one slip halo ripoff packs lot great content tiny modestly-priced package high-definition version game released app store april 1 2010 however compatible apple ipad tablet pc july 21 2010 n.o.v.a along heavily updated iphone 4 includes gyroscope control hd 3d graphics compatible multitasking ios 4 august 31 2010 free version n.o.v.a hd released ipad remaster game called n.o.v.a legacy updated graphics weapon upgrade system power meter features released march 27 2017 sequel n.o.v.a developed published gameloft released itunes app store december 16 2010 titled game innovated many designs created first n.o.v.a added many new features 10-player online multiplayer matches retina display gyroscope support iphone 4 later may 10 2012 n.o.v.a 3 released app store also developed published gameloft added new features 2-man cars multiplayer updated graphics working in-house editor | [
7030,
6312,
4575,
2794,
4912,
7871
] | Test |
4,913 | 4 | Privilege_bracketing:privilege bracketing computer security privilege bracketing temporary increase software privilege within process perform specific function assuming necessary privileges last possible moment dismissing soon longer strictly necessary therefore ostensibly avoiding fallout erroneous code unintentionally exploits privilege merited example use principle least privilege defensive programming distinguished privilege separation much effective security measure separates privileged parts system unprivileged parts putting different processes opposed switching within single process | [
123,
7570,
5814,
5449,
1805
] | Test |
4,914 | 4 | Port_scanner:port scanner port scanner application designed probe server host open ports application may used administrators verify security policies networks attackers identify network services running host exploit vulnerabilities port scan portscan process sends client requests range server port addresses host goal finding active port nefarious process majority uses port scan attacks rather simple probes determine services available remote machine portsweep scan multiple hosts specific listening port latter typically used search specific service example sql-based computer worm may portsweep looking hosts listening tcp port 1433 design operation internet based internet protocol suite commonly also called tcp/ip system network services referenced using two components host address port number 65536 distinct usable port numbers services use limited range port numbers port scanners scan common port numbers ports commonly associated vulnerable services given host result scan port usually generalized one three categories open ports present two vulnerabilities administrators must wary filtered ports tend present vulnerabilities forms port scanning rely assumption targeted host compliant rfc 793 transmission control protocol although case time still chance host might send back strange packets even generate false positives tcp/ip stack host non-rfc-compliant altered especially true less common scan techniques os-dependent fin scanning example tcp/ip stack fingerprinting method also relies types different network responses specific stimulus guess type operating system host running simplest port scanners use operating system network functions generally next option go syn feasible option described next nmap calls mode connect scan named unix connect system call port open operating system completes tcp three-way handshake port scanner immediately closes connection avoid performing denial-of-service attack otherwise error code returned scan mode advantage user require special privileges however using os network functions prevents low-level control scan type less common method noisy particularly portsweep services log sender ip address intrusion detection systems raise alarm syn scan another form tcp scanning rather using operating system network functions port scanner generates raw ip packets monitors responses scan type also known half-open scanning never actually opens full tcp connection port scanner generates syn packet target port open respond syn-ack packet scanner host responds rst packet closing connection handshake completed port closed unfiltered target instantly respond rst packet use raw networking several advantages giving scanner full control packets sent timeout responses allowing detailed reporting responses debate scan less intrusive target host syn scan advantage individual services never actually receive connection however rst handshake cause problems network stacks particular simple devices like printers conclusive arguments either way udp scanning also possible although technical challenges udp connectionless protocol equivalent tcp syn packet however udp packet sent port open system respond icmp port unreachable message udp port scanners use scanning method use absence response infer port open however port blocked firewall method falsely report port open port unreachable message blocked ports appear open method also affected icmp rate limiting alternative approach send application-specific udp packets hoping generate application layer response example sending dns query port 53 result response dns server present method much reliable identifying open ports however limited scanning ports application specific probe packet available tools e.g. nmap generally probes less 20 udp services commercial tools many 70 cases service may listening port configured respond particular probe packet ack scanning one unusual scan types exactly determine whether port open closed whether port filtered unfiltered especially good attempting probe existence firewall rulesets simple packet filtering allow established connections packets ack bit set whereas sophisticated stateful firewall might rarely used outdated nature window scanning fairly untrustworthy determining whether port opened closed generates packet ack scan checks whether window field packet modified packet reaches destination design flaw attempts create window size packet port open flagging window field packet 1 returns sender using scanning technique systems longer support implementation returns 0 window field labeling open ports closed since syn scans surreptitious enough firewalls general scanning blocking packets form syn packets fin packets bypass firewalls without modification closed ports reply fin packet appropriate rst packet whereas open ports ignore packet hand typical behavior due nature tcp ways inescapable downfall unusual scan types exist various limitations widely used nmap supports many internet service providers restrict customers ability perform port scans destinations outside home networks usually covered terms service acceptable use policy customer must agree isps implement packet filters transparent proxies prevent outgoing service requests certain ports example isp provides transparent http proxy port 80 port scans address appear port 80 open regardless target host actual configuration information gathered port scan many legitimate uses including network inventory verification security network port scanning however also used compromise security many exploits rely upon port scans find open ports send specific data patterns attempt trigger condition known buffer overflow behavior compromise security network computers therein resulting loss exposure sensitive information ability work threat level caused port scan vary greatly according method used scan kind port scanned number value targeted host administrator monitors host port scan often viewed first step attack therefore taken seriously disclose much sensitive information host despite probability port scan alone followed real attack small probability attack much higher port scan associated vulnerability scan inherently open decentralized architecture internet lawmakers struggled since creation define legal boundaries permit effective prosecution cybercriminals cases involving port scanning activities example difficulties encountered judging violations although cases rare time legal process involves proving intent commit break-in unauthorized access existed rather performance port scan 2006 uk parliament voted amendment computer misuse act 1990 person guilty offence makes adapts supplies offers supply article knowing designed adapted use course connection offence section 1 3 cma nevertheless area effect amendment blurred widely criticized security experts germany strafgesetzbuch § 202a b c also similar law council european union issued press release stating plan pass similar one albeit precise | [
545,
4583,
3775,
3777,
2466,
1461,
2649,
651,
7637,
5571,
1942,
6363,
1019,
676,
3486,
7209,
8023,
1691,
6062,
3338,
3594,
3680,
1708
] | Test |
4,915 | 2 | Overlay_(programming):overlay programming general computing sense overlaying means process transferring block program code data main memory replacing already stored overlaying programming method allows programs larger computer main memory embedded system would normally use overlays limitation physical memory internal memory system-on-chip lack virtual memory facilities constructing overlay program involves manually dividing program self-contained object code blocks called overlays laid tree structure sibling segments depth level share memory called overlay region destination region overlay manager either part operating system part overlay program loads required overlay external memory destination region needed often linkers provide support overlays following example shows control statements instruct os/360 linkage editor link overlay program indented show structure segment names arbitrary statements define tree consisting permanently resident segment called root two overlays b loaded following end mod2 overlay consists two overlay segments aa ab execution time overlays b utilize memory locations aa ab utilize locations following end mod3 segments root given overlay segment called path business applications intended run platforms virtual memory developer platform design program memory constraint exist unless program working set exceeds available physical memory importantly architect focus problem solved without added design difficulty forcing processing steps constrained overlay size thus designer use higher-level programming languages allow programmer much control size e.g java c++ smalltalk still overlays remain useful embedded systems low-cost processors used embedded systems provide memory management unit mmu addition many embedded systems real-time systems overlays provide determinate response-time paging example space shuttle primary avionics system software pass uses programmed overlays even platforms virtual memory software components codecs may decoupled point loaded needed home computer era overlays popular operating system many computer systems ran lacked virtual memory little ram current standards — original ibm pc 16k 64k depending configuration overlays popular technique commodore basic load graphics screens order detect overlay already loaded flag variable could used several dos linkers 1980s supported overlays form nearly identical used 25 years earlier mainframe computers binary files containing memory overlays de facto standard extension .ovl file type used among others wordstar dbase enable dos office automation software package enable software inc.. gfa basic compiler able produce .ovl files | [
3255,
4662,
8066,
6891,
5926,
5571,
7733,
2933,
7003,
3214,
6472,
7396,
5425,
5606,
5784,
1989,
2164,
2803
] | Test |
4,916 | 3 | TRIPS_architecture:trips architecture trips microprocessor architecture designed team university texas austin conjunction ibm intel sun microsystems trips uses instruction set architecture designed easily broken large groups instructions graphs run independent processing elements design collects related data graphs attempting avoid expensive data reads writes keeping data high speed memory close processing elements prototype trips processor contains 16 elements trips hoped reach 1 tflop single processor papers published 2003 2006 computer programs consist series instructions stored memory processor runs program fetching instructions memory examining performing actions instruction calls early machines speed main memory generally order time basic operation within processor instance instruction adds two numbers might take three four instruction cycles fetching numbers memory might take one two cycles machines penalty data main memory instruction set architectures generally designed allow direct access instance add instruction might take value one location memory add value another store result third location introduction increasingly fast microprocessors cheap-but-slower dynamic ram changed equation dramatically modern machines fetching value main memory might take equivalent thousands cycles one key advances risc concept include processor registers earlier designs typically several dozen rather two three instructions formerly provided memory locations eliminated replaced ones worked registers loading data register explicit separate load action performed results explicitly saved back one could improve performance eliminating many memory instructions possible technique quickly reached limits since 1990s modern cpus added increasing amounts cpu cache increase local storage although cache slower registers since late 1990s performance gains mostly made use additional functional units allow instructions run parallel instance two addition instructions working different data run time effectively doubling speed program modern cpus generally dozens units integer math boolean logic floating point math long-data words others dealing memory housekeeping chores however programs work independent data instead use outputs one calculation input another limits set instructions run parallel factor based many instructions processor able examine on-the-fly level instruction parallelism quickly plateaued mid-2000s one attempt break limit long instruction word vliw concept vliw hands task looking instruction parallelism compiler removing processor theory allows entire program examined independent instructions sent processor order make maximal use functional units however proven difficult practice vliw processors become widely popular even case vliw another problem grown become issue traditional designs data instructions handled different parts cpu processing speeds low cause problems performance increased communication times one side chip registers functional units grows become significant fraction overall processing time gains performance registers distributed closer functional units trips processor based explicit data graph execution edge concept edge attempts bypass certain performance bottlenecks come dominate modern systems edge based processor able better understand instruction stream sent seeing linear stream individual instructions rather blocks instructions related single task using isolated data edge attempts run instructions block distributing internally along data need process compilers examine code find blocks code share information specific way assembled compiled hyperblocks fed cpu since compiler guaranteeing blocks specific interdependencies processor isolate code single functional unit local memory consider simple example adds two numbers memory adds result another value memory case traditional processor would notice dependency schedule instructions run one storing intermediate results registers edge processor interdependencies data code would noticed compiler would compile instructions single block block would fed along data needed complete single functional unit private set registers ensures additional memory fetching required well keeping registers physically close functional unit needs values code rely intermediate data would compiled separate hyperblocks course possible entire program would use data compilers also look instances data handed code effectively abandoned original block common access pattern case compiler still produce two separate hyperblocks explicitly encode handoff data rather simply leaving stored shared memory location processor see communications events schedule run proper order blocks considerable interdependencies re-arranged compiler spread communications order avoid bottlenecking transport effect change greatly increase isolation individual functional units edge processors limited parallelism capabilities compiler on-chip systems whereas modern processors reaching plateau four-wide parallelism edge designs scale much wider also scale deeper well handing blocks one unit another chain scheduled reduce contention due shared values university texas austin implementation edge concept trips processor tera-op reliable intelligently adaptive processing system trips cpu built repeating single basic functional unit many times needed trips design use hyperblocks loaded en-masse allows dramatic gains speculative execution whereas traditional design might hundred instructions examine possible scheduling functional units trips design thousands hundreds instructions per hyperblock hundreds hyperblocks examined leads greatly improved functional unit utilization scaling performance typical 4-issue superscalar design trips process three times many instructions per cycle traditional designs variety different types units integer floating point etc. allowing parallelism four-wide schedulers would otherwise allow however order keep units active instruction stream include different types instruction often case practice traditional cpus often lots idle functional units trips individual units general purpose allowing instruction run core avoid need carefully balance number different kinds cores also means trips design built number cores needed reach particular performance requirement single-core trips cpu simplified eliminated scheduler run set hyperblocks exactly like one hundreds cores slower better yet performance dependent types data fed meaning trips cpu run much wider variety tasks level performance instance traditional cpu fed math-heavy workload bog soon floating point units busy integer units lying idle fed data intensive program like database job floating point units lie idle integer units bog trips cpu every functional unit add performance every task every task run every unit designers refer polymorphic processor trips flexible regard developers suggested would even replace custom high-speed designs like dsps like trips dsps gain additional performance limiting data inter-dependencies unlike trips allowing limited workflow run trips would fast custom dsp workloads equally able run workloads time designers noted unlikely trips processor could used replace highly customized designs like gpus modern graphics cards may able replace outperform many lower-performance chips like used media processing reduction global register file also results non-obvious gains addition new circuitry modern processors meant overall size remained even move smaller process sizes result relative distance register file grown limits possible cycle speed due communications delays edge data generally local isolated well defined inter-core links eliminating large cross-chip delays means individual cores run higher speeds limited signaling time much shorter data paths combination two design changes effects greatly improves system performance goal produce single-processor system 1 tflops performance 2012 however 2008 gpus ati nvidia already exceeded 1 teraflop barrier albeit specialized applications traditional cpus contemporary 2007 mac pro using 2-core intel xeon perform 5 gflops single applications 2003 trips team started implementing prototype chip chip two complete cores one 16 functional units 4-wide 4-deep arrangement current implementation compiler constructs hyperblocks 128 instructions allows system keep 8 blocks flight time total 1,024 instructions per core basic design include 32 chips interconnected approaching 500 gflops | [
5012,
1447,
5371,
3948,
7527,
7529,
5737,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
441,
2266,
4047,
5483,
1556,
5487,
6198,
1568,
1570,
6922,
7666,
515,
8024,
5521,
3747,
1237,
6236,
534,
7314,
1252,
1254,
4847,
4479,
895,
... | Test |
4,917 | 4 | Higher-order_differential_cryptanalysis:higher-order differential cryptanalysis cryptography higher-order differential cryptanalysis generalization differential cryptanalysis attack used block ciphers standard differential cryptanalysis difference two texts used higher-order differential cryptanalysis studies propagation set differences larger set texts xuejia lai 1994 laid groundwork showing differentials special case general case higher order derivates lars knudsen year able show concept higher order derivatives used mount attacks block ciphers attacks superior standard differential cryptanalysis higher-order differential cryptanalysis notably used break kn-cipher cipher previously proved immune standard differential cryptanalysis block cipher maps formula_1-bit strings formula_1-bit strings fixed key thought function formula_3 standard differential cryptanalysis one interested finding pair input difference formula_4 output difference formula_5 two input texts difference formula_4 likely result output texts difference formula_5 i.e. formula_8 true many formula_9 note difference used xor usual case though definitions difference possible motivates defining derivative function formula_3 point formula_4 formula_12 using definition formula_13-th derivative formula_14 recursively defined formula_15 thus example formula_16 higher order derivatives defined many properties common ordinary derivative sum rule product rule importantly also taking derivative reduces algebraic degree function implement attack using higher order derivatives knowledge probability distribution derivative cipher needed calculating estimating distribution generally hard problem cipher question known low algebraic degree fact derivatives reduce degree used example cipher s-box function analysis known algebraic degree 8 9th order derivative must 0 therefore important cipher s-box function specific maximal close maximal degree defy attack cube attacks considered variant higher-order differential attacks works small low algebraic degree s-boxes small s-boxes addition xor operations | [
1811,
4930,
2374,
464,
807,
1353,
2918,
3100,
119,
6015,
6016,
7548,
1283,
6637,
1480,
6647,
7200,
4805,
5765,
5327,
6657,
7928,
1587,
5333,
6763,
6049,
161,
433,
1320,
613,
1146
] | Test |
4,918 | 5 | GyazMail:gyazmail gyazmail email client macos developed maintained japanese programmer goichi hirakawa supports pop3 imap smtp protocols handling multiple email accounts includes local mailboxes gyazmail based native macos cocoa written objective-c. gyazmail uses search function oniguruma regular expression library supports variety character encodings especially relevant asian languages version 1.0.1 released 2003 | [
1152,
6965,
2453,
7975,
6721,
5571,
735,
1475,
6908,
405,
2131,
5070,
4352,
6582,
5786,
6588,
5887
] | Validation |
4,919 | 4 | Federation_Against_Software_Theft:federation software theft federation software theft fast not-for-profit organisation formed 1984 aim eliminating copyright infringement software uk fast world first anti-piracy organisation work protecting copyrights software publishers initially concentrating lobbying parliament revise copyright law fast also prosecutes organisations individuals copyright infringement behalf members publicises legal penalties security risks prior agreement fast investors software not-for-profit organisation limited guarantee mission support advance professionalism software asset management related asset management enable individuals organisations improve effectiveness efficiency direct result work iso sam iso 19770 standard successfully launched may 2006 september 2008 fast investors software signed exclusive agreement operate federation name strengthen clarify advice given end user community relating best practice software asset management sam achieving cost efficient licence compliance new organisation operate name fast iis may 2008 fast iis launched initiative aim making easier end users manage software licensing requirements contain costs ensure effective software asset management software licence management encompassing compliance software industry research board sirb formed consultation five tier one software vendors fast iis remains not-for-profit organisation limited guarantee wholly owned members include software publishers resellers distributors sam practitioners law firms fast iis works champion professional management software protect members ’ rights since inception fast successfully lobbied changes software ip system uk eu dealings uk intellectual property office fast lobbying efforts brought amendments copyright act 1956 culminating software recognised literary work 2007 fast alliance ip theft successful pushing implementation section 107a copyright designs patents act 1988 ip crime measurement national policing safety plan | [] | Test |
4,920 | 2 | Page_table:page table page table data structure used virtual memory system computer operating system store mapping virtual addresses physical addresses virtual addresses used program executed accessing process physical addresses used hardware specifically ram subsystem page table key component virtual address translation necessary access data memory operating systems use virtual memory every process given impression working large contiguous sections memory physically memory process may dispersed across different areas physical memory may moved paged another storage typically hard disk drive process requests access data memory responsibility operating system map virtual address provided process physical address actual memory data stored page table operating system stores mappings virtual addresses physical addresses mapping also known page table entry pte cpu memory management unit mmu stores cache recently used mappings operating system page table called translation lookaside buffer tlb associative cache virtual address needs translated physical address tlb searched first match found tlb hit physical address returned memory access continue however match called tlb miss memory management unit operating system tlb miss handler typically look address mapping page table see whether mapping exists page walk one exists written back tlb must done hardware accesses memory tlb virtual memory system faulting instruction restarted may happen parallel well subsequent translation find tlb hit memory access continue page table lookup may fail two reasons physical memory full simple operation page written back physical memory page table tlb updated instruction restarted however physical memory full one pages physical memory need paged make room requested page page table needs updated mark pages previously physical memory longer mark page disk physical memory tlb also needs updated including removal paged-out page instruction restarted page page subject page replacement algorithms simplest page table systems often maintain frame table page table frame table holds information frames mapped advanced systems frame table also hold information address space page belongs statistics information background information page table holds mapping virtual address page address physical frame also auxiliary information page present bit dirty modified bit address space process id information amongst others secondary storage hard disk used augment physical memory pages paged physical memory disk present bit indicate pages currently present physical memory disk indicate treat different pages i.e whether load page disk page another page physical memory dirty bit allows performance optimization page disk paged physical memory read subsequently paged need written back disk since page changed however page written paged dirty bit set indicating page must written back backing store strategy requires backing store retain copy page paged memory dirty bit used backing store need large instantaneous total size paged-out pages moment dirty bit used times pages exist physical memory backing store operating systems single address space operating systems address space process id information necessary virtual memory management system knows pages associate process two processes may use two identical virtual addresses different purposes page table must supply different virtual memory mappings two processes done assigning two processes distinct address map identifiers using process ids associating process ids virtual memory pages also aid selection pages page pages associated inactive processes particularly processes whose main code page paged less likely needed immediately pages belonging active processes alternative tagging page table entries process-unique identifiers page table may occupy different virtual-memory page process page table becomes part process context implementation process page table paged whenever process longer resident memory several types page tables best suited different requirements essentially bare-bones page table must store virtual address physical address virtual address possibly address space information inverted page table ipt best thought off-chip extension tlb uses normal system ram unlike true page table necessarily able hold current mappings os must prepared handle misses would mips-style software-filled tlb ipt combines page table frame table one data structure core fixed-size table number rows equal number frames memory 4000 frames inverted page table 4000 rows row entry virtual page number vpn physical page number physical address data means creating collision chain see later search entries core ipt structure inefficient hash table may used map virtual addresses address space/pid information need index ipt collision chain used hash table known hash anchor table hashing function generally optimized coverage raw speed desirable course hash tables experience collisions due chosen hashing function may experience lot collisions usage entry table vpn provided check searched entry collision searching mapping hash anchor table used entry exists page fault occurs otherwise entry found depending architecture entry may placed tlb memory reference restarted collision chain may followed exhausted page fault occurs virtual address schema could split two first half virtual page number second half offset page major problem design poor cache locality caused hash function tree-based designs avoid placing page table entries adjacent pages adjacent locations inverted page table destroys spatial locality reference scattering entries operating system may minimize size hash table reduce problem trade-off increased miss rate normally one hash table contiguous physical memory shared processes per-process identifier used disambiguate pages different processes somewhat slow remove page table entries given process os may avoid reusing per-process identifier values delay facing alternatively per-process hash tables may used impractical memory fragmentation requires tables pre-allocated inverted page tables used example powerpc ultrasparc ia-64 architecture inverted page table keeps listing mappings installed frames physical memory however could quite wasteful instead could create page table structure contains mappings virtual pages done keeping several page tables cover certain block virtual memory example create smaller 1024-entry 4k pages cover 4m virtual memory useful since often top-most parts bottom-most parts virtual memory used running process top often used text data segments bottom stack free memory multilevel page table may keep smaller page tables cover top bottom parts memory create new ones strictly necessary smaller page tables linked together master page table effectively creating tree data structure need two levels possibly multiple ones virtual address schema could split three parts index root page table index sub-page table offset page multilevel page tables also referred hierarchical page tables mentioned creating page table structure contained mappings every virtual page virtual address space could end wasteful get around excessive space concerns putting page table virtual memory letting virtual memory system manage memory page table however part linear page table structure must always stay resident physical memory order prevent circular page faults look key part page table present page table present page table etc nested page tables implemented increase performance hardware virtualization providing hardware support page-table virtualization need emulate greatly reduced x86 virtualization current choices intel extended page table feature amd rapid virtualization indexing feature | [
3599,
2549,
4670,
5021,
13,
379,
3271,
3626,
5041,
5042,
7550,
405,
1855,
4347,
1117,
56,
65,
5783,
5088,
2617,
6500,
785,
2266,
788,
1522,
7605,
3351,
2989,
4759,
4397,
5116,
2300,
4786,
839,
1208,
1575,
6922,
4810,
5161,
5865,
858,
... | Test |
4,921 | 6 | In_re_Boucher:boucher boucher case citation 2:06-mj-91 2009 wl 424718 federal criminal case vermont first directly address question whether investigators compel suspect reveal encryption passphrase password despite u.s. constitution fifth amendment protection self-incrimination magistrate judge held producing passphrase would constitute self-incrimination submission appeal district court government stated seek password encrypted hard drive sought force boucher produce contents encrypted hard drive unencrypted format opening drive grand jury district court judge agreed government holding given boucher initial cooperation showing content computer border agents producing complete contents would constitute self-incrimination late 2009 boucher finally gave password investigators found numerous images videos depicting sexual abuse children january 2010 boucher sentenced 3 years prison deported 17 december 2006 laptop computer defendant sebastien d. boucher born 1977 inspected crossed border canada united states derby line vermont laptop powered-up border crossed allowed contents browsed images containing child pornography allegedly seen immigration customs enforcement ice border agents seized laptop questioned boucher arrested complaint charging transportation child pornography violation 18 u.s.c 2252a 1 laptop subsequently powered-down laptop switched booted 29 december 2006 possible access entire storage capability laptop protected pgp disk encryption result investigators working us government unable view contents drive z allegedly contained illegal content grand jury subpoenaed defendant provide password encryption key protecting data november 29 2007 u.s. magistrate judge jerome niedermeier united states district court district vermont stated compelling boucher enter password forces produce evidence could used incriminate accordingly niedermeier quashed subpoena january 2 2008 united states appealed magistrate opinion district court sealed motion court docket case 2:06-mj-00091-wks-jjn-1 appeal heard u.s. district judge william k. sessions oral arguments scheduled april 30 2008 february 19 2009 judge sessions reversed magistrate ruling directed boucher provide unencrypted version z drive viewed ice agent | [
4616,
2566,
5440,
2529,
2849,
5773
] | Test |
4,922 | 3 | Canon_V-20:canon v-20 canon v-20 msx microcomputer made japanese corporation canon innovative digital camera interface t-90/dmb-90 use canon t90 v-10 quite identical v-20 except less ram memory 16 kb white case | [
6203,
5571,
1237,
974,
4395,
2012
] | Test |
4,923 | 9 | JConsole:jconsole jconsole graphical monitoring tool monitor java virtual machine jvm java applications local remote machine jconsole uses underlying features java virtual machine provide information performance resource consumption applications running java platform using java management extensions jmx technology jconsole comes part java development kit jdk graphical console started using jconsole command | [
3542
] | Test |
4,924 | 7 | MLab:mlab mlab fully managed cloud database service hosts mongodb databases mlab runs cloud providers amazon google microsoft azure partnered platform-as-a-service providers may 2011 mlab secured 3 million first-round funding foundry group baseline ventures upfront ventures freestyle capital david cohen october 2012 mlab received follow-on investment 5 million shortly thereafter mlab named network world one 10 useful cloud databases along amazon web services google cloud sql microsoft azure rackspace others june 2014 mongodb inc. announced fully managed highly available mongodb-as-a-service add-on offering microsoft azure store offering delivered collaboration microsoft mlab february 2016 mlab changed name mongolab mlab expand new areas products october 2018 mlab announced acquired mongodb inc. citing reasons shared vision engineering culture engineers mlab invited join mongodb inc. mlab customers transitioned mongodb atlas instances acquisition expected close fourth quarter mongodb ’ fiscal year ending jan. 31 2019 | [
5064,
4852,
5927
] | Test |
4,925 | 8 | Bounce_rate:bounce rate bounce rate internet marketing term used web traffic analysis represents percentage visitors enter site leave bounce rather continuing view pages within site bounce rate calculated counting number single page visits dividing total visits represented percentage total visits bounce rate measure stickiness thinking effective website engage visitors deeper website encouraging visitors continue visit expressed percentage represents proportion single page visits total visits bounce rate visits access single page ÷ total visits website bounce rates used help determine effectiveness performance entry page generating interest visitors entry page low bounce rate means page effectively causes visitors view pages continue deeper web site high bounce rates typically indicate website good job attracting continued interest visitors means visitors view single pages without looking others taking form action within site specified time period interpretation bounce rate measure relevant website business objectives definitions conversion high bounce rate always sign poor performance sites objective met without viewing one page example websites sharing specific knowledge subject dictionary entry specific recipe bounce rate would meaningful determining conversion success contrast bounce rate e-commerce site could interpreted correlation purchase conversion rate providing bounces considered representative visits purchase made typically bounce rate e-commerce websites range 20 45 top performers operating 36 average bounce rate bounce occurs web site visitor views single page website visitor leaves site without visiting pages specified session-timeout occurs industry standard minimum maximum time visitor must leave order bounce occur rather determined session timeout analytics tracking software formula_1 visitor may bounce two exceptions 1 one-page website 2 offline value proposition compelling people would see one single webpage get information need leave commonly used session timeout value 30 minutes case visitor views page look another page leaves browser idle longer 30 minutes register bounce visitor continues navigate delay new session occur bounce rate single page number visitors enter site page leave within specified timeout period without viewing another page divided total number visitors entered site page contrast bounce rate web site number web site visitors visit single page web site per session divided total number web site visits site-wide bounce rate useful metric sites well-defined conversion steps requiring multiple page views may questionable value sites visitors likely find looking entry page type behavior common web portals referential content sites example visitor looking definition particular word may enter online dictionary site word definition page similarly visitor wants read specific news story may enter news site article written story example entry pages could bounce rate 80 thereby increasing site-wide average however may still considered successful | [
2766,
2086,
4600,
518
] | Validation |
4,926 | 5 | Link_aggregation:link aggregation computer networking term link aggregation applies various methods combining aggregating multiple network connections parallel order increase throughput beyond single connection could sustain provide redundancy case one links fail link aggregation group lag combines number physical ports together make single high-bandwidth data path implement traffic load sharing among member ports group enhance connection reliability umbrella terms used describe method include port trunking link bundling ethernet/network/nic bonding channel bonding nic teaming umbrella terms encompass vendor-independent standards link aggregation control protocol lacp ethernet defined ieee 802.1ax previous ieee 802.3ad also various proprietary solutions link aggregation addresses two problems ethernet connections bandwidth limitations lack resilience regard first issue bandwidth requirements scale linearly ethernet bandwidths historically increased tenfold generation 10 megabit/s 100 mbit/s 1000 mbit/s 10,000 mbit/s one started bump bandwidth ceilings option move next generation could cost prohibitive alternative solution introduced many network manufacturers early 1990s combine two physical ethernet links one logical link via channel bonding solutions required manual configuration identical equipment sides aggregation second problem involves three single points failure typical port-cable-port connection either usual computer-to-switch switch-to-switch configuration cable either ports cable plugged fail multiple physical connections made many higher level protocols designed fail completely seamlessly network architects implement aggregation lowest three layers osi model regardless layer aggregation occurs possible balance network load across links however implementations take advantage methods provide failover well combining either occur multiple interfaces share one logical address i.e ip one physical address i.e mac address allows interface address former requires ends link use aggregation method performance advantages latter channel bonding differentiated load balancing load balancing divides traffic network interfaces per network socket layer 4 basis channel bonding implies division traffic physical interfaces lower level either per packet layer 3 data link layer 2 basis mid 1990s network switch manufacturers included aggregation capability proprietary extension increase bandwidth switches manufacturer developed method led compatibility problems ieee 802.3 group took study group create inter-operable link layer standard november 1997 meeting group quickly agreed include automatic configuration feature would add redundancy well became known link aggregation control protocol gigabit channel-bonding schemes use ieee standard link aggregation formerly clause 43 ieee 802.3 standard added march 2000 ieee 802.3ad task force nearly every network equipment manufacturer quickly adopted joint standard proprietary standards 802.3 maintenance task force report 9th revision project november 2006 noted certain 802.1 layers 802.1x security positioned protocol stack link aggregation defined 802.3 sublayer resolve discrepancy 802.3ax 802.1ax task force formed resulting formal transfer protocol 802.1 group publication ieee 802.1ax-2008 3 november 2008 within ieee specification link aggregation control protocol lacp provides method control bundling several physical ports together form single logical channel lacp allows network device negotiate automatic bundling links sending lacp packets peer directly connected device also implements lacp lacp features practical examples lacp works sending frames lacpdus links protocol enabled finds device end link also lacp enabled also independently send frames along links enabling two units detect multiple links combine single logical link lacp configured one two modes active passive active mode always send frames along configured links passive mode however acts speak spoken therefore used way controlling accidental loops long device active mode addition ieee link aggregation substandards number proprietary aggregation schemes including cisco etherchannel port aggregation protocol juniper aggregated ethernet avaya multi-link trunking split multi-link trunking routed split multi-link trunking distributed split multi-link trunking zte smartgroup huawei eth-trunk connectify speedify high-end network devices support kind link aggregation software-based implementations – *bsd lagg package linux bonding driver solaris dladm aggr etc – also exist many operating systems linux bonding driver provides method aggregating multiple network interface controllers nics single logical bonded interface two so-called nic slaves majority modern linux distributions come linux kernel linux bonding driver integrated loadable kernel module ifenslave network interface user-level control program pre-installed donald becker programmed original linux bonding driver came use beowulf cluster patches linux kernel 2.0 modes linux bonding driver network interface aggregation modes supplied parameters kernel bonding module load time may given command line arguments insmod modprobe command usually specified linux distribution-specific configuration file behavior single logical bonded interface depends upon specified bonding driver mode default parameter balance-rr linux team driver provides alternative bonding driver main difference team driver kernel part contains essential code rest code link validation lacp implementation decision making etc run userspace part teamd daemon link aggregation offers inexpensive way set high-speed backbone network transfers much data one single port device deliver link aggregation also allows network backbone speed grow incrementally demand network increases without replace everything deploy new hardware backbone installations install cabling fiber optic pairs initially necessary even immediate need additional cabling done labor costs higher cost cable running extra cable reduces future labor costs networking needs change link aggregation allow use extra cables increase backbone speeds little extra cost ports available balancing traffic network administrators often wish avoid reordering ethernet frames example tcp suffers additional overhead dealing out-of-order packets goal approximated sending frames associated particular session across link common implementations use l2 l3 hashes i.e based mac ip addresses ensuring flow always sent via physical link however may provide even distribution across links trunk single pairs hosts communicate i.e hashes provide little variation effectively limits client bandwidth aggregate single member maximum bandwidth per communication partner extreme one link fully loaded others completely idle reason even load balancing full utilization trunked links almost never reached real-life implementations advanced switches employ l4 hash i.e using tcp/udp port numbers may increase traffic variation across links – depending whether ports vary – bring balance closer even distribution multiple switches may utilized optimize maximum throughput multiple network switch topology switches configured parallel part isolated network two systems configuration switches isolated one another one reason employ topology isolated network many hosts cluster configured high performance example using multiple smaller switches cost effective single larger switch access beyond network required individual host equipped additional network device connected external network host additionally acts gateway network interfaces 1 3 computer cluster node example connected via separate network switches 1 3 network interfaces 1 3 computer cluster node b inter-connections network switches 1 3 linux bonding driver mode typically employed configurations type balance-rr balance-rr mode allows individual connections two hosts effectively utilize greater one interface bandwidth nics trunked together also provide network links beyond throughput one single nic example allows central file server establish aggregate 2-gigabit connection using two 1-gigabit nics teamed together note data signaling rate still 1gbit/s misleading depending methodologies used test throughput link aggregation employed microsoft windows server 2012 supports link aggregation natively previous windows server versions relied manufacturer support feature within device driver software intel example released advanced networking services ans bond intel fast ethernet gigabit cards.nvidia also supports teaming nvidia network access manager/firewall tool hp also teaming tool hp branded nics allow non-etherchanneled nic teaming support several modes etherchannel port aggregation including 802.3ad lacp addition basic layer-3 aggregation available least windows xp sp3 allows servers multiple ip interfaces network perform load balancing home users one internet connection increase connection speed sharing load interfaces broadcom offers advanced functions via broadcom advanced control suite bacs via teaming functionality basp broadcom advanced server program available offering 802.3ad static lags lacp smart teaming n't require configuration switches work possible configure teaming bacs mix nics different vendors long least one broadcom nics required capabilities create teaming linux freebsd netbsd openbsd macos opensolaris commercial unix distributions aix implement ethernet bonding trunking higher level hence deal nics different manufacturers drivers long nic supported kernel citrix xenserver vmware esx native support link-aggregation xenserver offers static lags well lacp vsphere 5.1 esxi supports static lags lacp natively virtual distributed switch microsoft hyper-v bonding teaming n't offered hyper-visor os-level above-mentioned methods teaming windows applies hyper-v well modes balance-rr balance-xor broadcast 802.3ad physical ports link aggregation group must reside logical switch scenarios leave single point failure physical switch links connected goes offline modes active-backup balance-tlb balance-alb also set two switches failover like modes cases active sessions may fail due arp problems restarted however almost vendors proprietary extensions resolve issue aggregate multiple physical switches one logical switch split multi-link trunking smlt protocol allows multiple ethernet links split across multiple switches stack preventing single point failure additionally allowing switches load balanced across multiple aggregation switches single access stack devices synchronize state across inter-switch trunk ist appear connecting access device single device switch block prevent packet duplication smlt provides enhanced resiliency sub-second failover sub-second recovery speed trunks 10 mbit/s 100 mbit/s 1,000 mbit/s 10 gbit/s operating transparently end-devices implementations ports used aggregation consist physical type copper ports 10/100/1000base‑t multi-mode fiber ports single-mode fiber ports however ieee standard requires link full duplex identical speed 10 100 1,000 10,000 mbit/s many switches phy independent meaning switch could mixture copper sx lx lx10 gbics maintaining phy usual approach possible aggregate 1000base-sx fiber one link 1000base-lx longer diverse path second link important thing speed 1 gbit/s full duplex links one path may slightly longer propagation time standard engineered cause issue aggregation mismatch refers matching aggregation type ends link switches implement 802.1ax standard support static configuration link aggregation therefore link aggregation similarly statically configured switches work fail statically configured switch device configured lacp ethernet interfaces channel bonding requires assistance ethernet switch host computer operating system must stripe delivery frames across network interfaces manner i/o striped across disks raid 0 array reason discussions channel bonding also refer redundant array inexpensive nodes rain redundant array independent network interfaces analog modems multiple dial-up links pots may bonded throughput bonded connections come closer aggregate bandwidth bonded links throughput routing schemes simply load-balance outgoing network connections links similarly multiple dsl lines bonded give higher bandwidth united kingdom adsl sometimes bonded give example 512kbit/s upload bandwidth 4 megabit/s download bandwidth areas access 2 megabit/s bandwidth docsis 3.0 3.1 specifications data cable tv catv systems multiple channels may bonded docsis 3.0 32 downstream 8 upstream channels may bonded typically 6 8mhz wide docsis 3.1 defines complicated arrangements involving aggregation level subcarriers larger notional channels broadband bonding type channel bonding refers aggregation multiple channels osi layers level four channels bonded wired links t-1 dsl line additionally possible bond multiple cellular links aggregated wireless bonded link previous bonding methodologies resided lower osi layers requiring coordination telecommunications companies implementation broadband bonding implemented higher layers done without coordination commercial implementations broadband channel bonding include see also mimo | [
6691,
883,
6071,
1527,
3764,
4759,
6976,
899,
6711,
7624,
6984,
4321,
121,
3105,
5571,
309,
2659,
4783,
578,
6731,
5492,
3797,
3301,
3799,
2672,
6461,
2236,
7209,
3230,
4093,
3236,
5880,
967,
5181,
7777,
4836,
2442,
2714
] | Test |
4,927 | 3 | International_Symposium_on_Microarchitecture:international symposium microarchitecture international symposium microarchitecture micro generally viewed top-tier academic conference computer architecture confused micro-conference | [
687,
6922
] | Train |
4,928 | 7 | Autoscaling:autoscaling autoscaling also spelled auto scaling auto-scaling sometimes also called automatic scaling method used cloud computing whereby amount computational resources server farm typically measured terms number active servers scales automatically based load farm closely related builds upon idea load balancing autoscaling offers following advantages autoscaling differs fixed daily weekly yearly cycle server use responsive actual usage patterns thus reduces potential downside many servers traffic load instance traffic usually lower midnight static scaling solution might schedule servers sleep night might result downtime night people happen use internet instance due viral news event autoscaling hand handle unexpected traffic spikes better list use terminology used amazon web services aws however alternative names noted terminology specific names amazon services used names amazon web services launched amazon elastic compute cloud ec2 service august 2006 allowed developers programmatically create terminate instances machines time initial launch aws offer autoscaling ability programmatically create terminate instances gave developers flexibility write code autoscaling third-party autoscaling software aws began appearing around april 2008 included tools scalr rightscale rightscale used animoto able handle facebook traffic adopting autoscaling may 18 2009 amazon launched autoscaling feature along elastic load balancing part amazon elastic compute cloud autoscaling integral component amazon ec2 offering autoscaling amazon web services done web browser command line tool.. may 2016 autoscaling also offered aws ecs service on-demand video provider netflix documented use autoscaling amazon web services meet highly variable consumer needs found aggressive scaling delayed cautious scaling served goals uptime responsiveness best article techcrunch zev laderman co-founder ceo newvem service helps optimize aws cloud infrastructure recommended startups use autoscaling order keep amazon web services costs low various best practice guides aws use suggest using autoscaling feature even cases load variable autoscaling offers two advantages automatic replacement instances become unhealthy reason hardware failure network failure application error automatic replacement spot instances get interrupted price capacity reasons making feasible use spot instances production purposes netflix internal best practices require every instance autoscaling group conformity monkey terminates instance autoscaling group order enforce best practice june 27 2013 microsoft announced adding autoscaling support windows azure cloud computing platform documentation feature available microsoft developer network oracle cloud platform allows server instances automatically scale cluster defining auto-scaling rule rules based cpu and/or memory utilization determine add remove nodes november 17 2014 google compute engine announced public beta autoscaling feature use google cloud platform applications march 2015 autoscaling tool still beta blog post august 2014 facebook engineer disclosed company started using autoscaling bring energy costs blog post reported 27 decline energy use low traffic hours around midnight 10-15 decline energy use typical 24-hour cycle kubernetes horizontal pod autoscaler automatically scales number pods replication controller deployment replicaset based observed cpu utilization beta support application-provided metrics autoscaling default uses reactive decision approach dealing traffic scaling scaling happens response real-time changes metrics cases particularly changes occur quickly reactive approach scaling insufficient two kinds autoscaling decision approaches described approach autoscaling changes made minimum size maximum size desired capacity autoscaling group specific times day scheduled scaling useful instance known traffic load increase decrease specific times day change sudden reactive approach based autoscaling respond fast enough aws autoscaling groups support scheduled scaling approach autoscaling uses predictive analytics idea combine recent usage trends historical usage data well kinds data predict usage future autoscale based predictions parts infrastructure specific workloads netflix found scryer predictive analytics engine gave better results amazon reactive autoscaling approach particular better november 20 2018 aws announced predictive scaling would available part autoscaling offering | [
2961,
3667,
2988,
5064,
3953
] | Test |
4,929 | 9 | Peter_Lucas_(computer_scientist):peter lucas computer scientist peter lucas born 13 january 1935 vienna austria – 2 february 2015 california united states austrian computer scientist university professor peter lucas graduated 1953 studied telecommunications vienna university technology completed studies 1959 diploma thesis topic programming electronic calculating machines member heinz zemanek group responsible system programming mailüfterl first fully transistorized computer continental europe 1961 moved mailüfterl group technical university ibm company working ibm laboratory vienna worked formal description programming languages together hans bekić kurt walk heinz zemanek responsible formal definition ibm programming language pl/i using vienna definition language vdl important part formal method vdm addition worked together hans bekić compiler algol 60 time gave lectures lectures vienna university technology johannes kepler university linz covering theoretical foundations programming formal definition programming languages 1978 joined thomas j. watson research center yorktown heights new york united states worked experimental compiler projects 1979 moved ibm san josé california later ibm almaden research center 1988 worked john backus group definition implementation functional programming language fl october 1993 appointed full professor software technology graz university technology retiring emeritus position july 2001 1994 chairman formal methods europe fme corresponding member austrian academy sciences peter lucas died 2 february 2015 age 80 | [
1549,
1114,
5932,
1381
] | Test |
4,930 | 4 | Impossible_differential_cryptanalysis:impossible differential cryptanalysis cryptography impossible differential cryptanalysis form differential cryptanalysis block ciphers ordinary differential cryptanalysis tracks differences propagate cipher greater expected probability impossible differential cryptanalysis exploits differences impossible probability 0 intermediate state cipher algorithm lars knudsen appears first use form attack 1998 paper introduced aes candidate deal first presentation attract attention cryptographic community later year rump session crypto '98 eli biham alex biryukov adi shamir introduced name impossible differential used technique break 4.5 8.5 rounds idea 31 32 rounds nsa-designed cipher skipjack development led cryptographer bruce schneier speculate nsa previous knowledge impossible differential cryptanalysis technique since applied many ciphers khufu khafre e2 variants serpent mars twofish rijndael crypton zodiac hierocrypt-3 tea xtea mini-aes aria camellia shacal-2 biham biryukov shamir also presented relatively efficient specialized method finding impossible differentials called miss-in-the-middle attack consists finding two events probability one whose conditions met together | [
1811,
464,
807,
1353,
2918,
907,
3100,
119,
7548,
1283,
6637,
1480,
6647,
7200,
4805,
3219,
5765,
5327,
6657,
7928,
1587,
5333,
6763,
6049,
161,
433,
1320,
613,
1146,
4917
] | Validation |
4,931 | 3 | AMD_Socket_G3:amd socket g3 socket g3 originally part codenamed piranha server platform supposed intermediate successor socket f socket f+ used amd opteron processor dual-processor 2p server platforms scheduled launched 2009 socket g3 would accompanied socket g3 memory extender socket g3mx connecting large amounts memory single microprocessor g3mx chip placed motherboard amd planned socket g3 arrive advent previously planned 8-core mcm chip code named montreal since q1 2008 plan 8-core mcm server chip based 45 nm k10.5 design scrapped favor 6-core fully integrated mpu design code named istanbul use existing socket f/f+ platform produced nvidia broadcom well fiorano introduced amd 2009 however socket g3 officially discontinued march 2008 socket successor socket f lga 1974-pin socket g34 | [
2539,
6599,
2541,
5895,
7163,
3362,
1735,
5377,
6351,
913,
7826,
2751,
6545,
6373,
5063,
6655,
6562,
3145,
4090,
866,
5436,
7134,
1143
] | Test |
4,932 | 4 | Q-CERT:q-cert qatar computer emergency response team created december 2006 cert/cc ictqatar qatar coordination center dealing internet security problems q-cert first-ever cert established middle east plans q-cert first announced december 2006 ictqatar cert coordination center entered partnership signed cooperation agreement sans institute provide training courses cyber security specialists qatar government november 2016 first gcc cyber drill held auspices q-cert engaged internet security specialists four gcc countries goals q-cert | [
5125,
2789,
7106
] | Validation |
4,933 | 9 | CorbaScript:corbascript corbascript object-oriented scripting language designed use corba | [] | Test |
4,934 | 2 | Damien_Sandras:damien sandras damien sandras known free software community due work gnome specifically ekiga leading open source softphone linux desktop one founders fosdem event dedicated free software developers europe fosdem initially created raphaël bauduin name osdem sandras joined bauduin helped setting event sandras one driving forces behind organization 7 years ekiga supported free software foundation specifically richard stallman alternative proprietary skype stallman e-mail signature contained mention softphone years sandras graduate university louvain uclouvain mentioned university portal university success stories leading ip startup dealing enterprise open source voip software | [] | Test |
4,935 | 2 | Nokia_5230:nokia 5230 nokia 5230 also known nokia 5230 nuron smartphone manufactured nokia running symbian os v9.4 s60 5th edition released november 2009 announced august year features 3.2 inch resistive touchscreen 3g internet support support microsd memory cards also supports a-gps bluetooth fm radio full html internet browsing however lacks support wi-fi due status entry-level smartphone released nokia 5530 nokia 5800 xpressmusic featured wi-fi support 3g 3g wi-fi respectively lifespan 5230 sold around 150 million units making one best selling phones date particular success developing countries nuron version released north america wcdma band iv aws enabled comes preloaded maps united states canada mexico january 2010 nokia announced ovi maps available free certain smartphones includes nokia 5230 thus enabling free offline voice guided navigation 180 countries 51.0.002 latest firmware version available | [
1066,
5979,
2271,
6517,
372,
1724,
463,
7521,
3615,
1453,
5909,
3694,
3524,
3952,
472,
8072,
2922,
4407,
118,
23,
2564,
3703,
7261,
7545,
5044,
5493,
740,
1202,
5315,
3029,
5499,
7012,
139,
6465,
5062,
3039,
3653,
1582,
4894,
5068,
597,... | Test |
4,936 | 1 | Business_Intelligence_Development_Studio:business intelligence development studio business intelligence development studio bids former ide microsoft used develop data analysis business intelligence solutions utilizing microsoft sql server analysis services reporting services integration services based microsoft visual studio development environment customized sql server services-specific extensions project types including tools controls projects reports etl dataflows olap cubes data mining structure bids functionality augmented bids helper visual studio add-in features extended enhance business intelligence development functionality sql server 2005 2008 2008 r2 bi development studio bids sql server 2012 sql server data tools ssdt bids helper hosted microsoft open source project hosting website codeplex business intelligence markup language biml used bids create end-to-end bi solutions translating biml metadata sql server integration services ssis sql server analysis services ssas assets microsoft sql server platform bids supported visual studio 2010 later replaced sql server data tools business intelligence | [
7619,
7621,
7715,
2283,
7971,
8183,
8085,
2840,
7080,
8094,
4697,
5747,
5234,
3303,
930,
53,
941,
422,
425,
1684,
5694,
5252,
2341,
2702,
7687,
2530,
4017,
2085
] | Validation |
4,937 | 4 | CronLab:cronlab cronlab limited privately held limited company provides information security web filtering software solutions businesses consumers either directly via integration third party products cronlab offices london united kingdom gothenburg sweden cronlab founded gothenburg sweden introduced first anti-spam hardware appliances 2009 appliances received positive reviews industry media pc pro crn magazine sc magazine cited systems ease use quick set tested email filtering technology 99 accurate 2010 company moved headquarters london united kingdom also released software service hosted models spam filtering technology awarded recommendation techworld hosted email archiving solutions cide group toy manufacturer partnered cronlab development children tablet computer tablet called kurio features cronlab hosted web-filtering parental controls technology cronlab agreements distribution france belgium switzerland germany norway bulgaria moldova romania ireland united kingdom company security products aim protect email web threats spam spyware trojans viruses also provide email archiving solution cronlab products support multi-tenancy marketed isps msps consultants products also white labelled | [
330,
5401
] | Test |
4,938 | 7 | Inter-Language_Unification:inter-language unification inter-language unification ilu method computer systems exchange data bridging differences way systems represent various kinds data even two systems run computer identical computer hardware many differences arise use different computer languages build systems object interfaces provided ilu hide implementation distinctions different languages different address spaces operating system types ilu used build multi-lingual object-oriented libraries class libraries well-specified language-independent interfaces also used implement distributed systems also used define document interfaces modules non-distributed programs ilu interfaces specified either object management group corba interface definition language omg idl ilu interface specification language isl ilu developed open source project xerox palo alto research center xerox parc 1991 2000 last release 2.0beta1 1997 2000 ilu used foundation experimental work next generation http protocol world wide web consortium http-ng activity result work particularly efficient experimental rpc protocol called w3ng developed along way efficiently multiplexing single tcp connection multiple channels directions called w3mux results http-ng experiment presented 2000 world wide web conference last release supported programming languages c++ corba2 mapping ansi c python java common lisp contributed support also available modula-3 guile scheme perl 5 ilu installed flavors unix sunos solaris hp-ux aix osf irix freebsd linux lynxos sco unix etc ms-windows 3.1 95 nt supported threaded posix solaris nt franz acl ppcr modula-3 event-loop xt tk xview operation one implementation goals maximize compatibility existing open standards result ilu provided support use omg corba idl interface description language thought corba orb system though omissions extensions corba spec ilu also included self-contained implementation onc rpc possible describe use existing rpc services ilu objects ilu also included self-contained implementation world wide web hypertext transfer protocol http could thus used implement object-oriented web browsers servers communication security provided gss-based context negotiation on-the-wire encryption | [
5983,
4759,
1445,
900,
6981,
7637,
5571,
578,
3383,
3905,
3820,
7299,
5965,
6947,
1989,
3069,
87
] | Test |
4,939 | 4 | Omron:omron styled omron electronics company based kyoto japan omron established 1933 tateishi electric manufacturing company incorporated 1948 company originated area kyoto called name omron derived prior 1990 corporation known omron tateishi electronics 1980s early 1990s company motto machine work machines man thrill creation omron primary business manufacture sale automation components equipment systems generally known medical equipment digital thermometers blood pressure monitors nebulizers omron developed world first electronic ticket gate named ieee milestone 2007 one first manufacturers automated teller machines atm magnetic stripe card readers omron oilfield marine provider ac dc drive systems custom control systems oil gas related industries omron named one thomson reuters top 100 global innovators 2013 september 30 2015 | [
6874,
2279,
2096,
5822,
7357,
5740,
2024,
7189,
136,
3210,
5614,
972,
7956
] | Test |
4,940 | 9 | Stephen_Wolfram:stephen wolfram stephen wolfram born 29 august 1959 british-american computer scientist physicist businessman known work computer science mathematics theoretical physics 2012 named inaugural fellow american mathematical society businessman founder ceo software company wolfram research worked chief designer mathematica wolfram alpha answer engine recent work knowledge-based programming expanding refining programming language mathematica called wolfram language stephen wolfram born london 1959 hugo sybil wolfram german jewish refugees united kingdom wolfram father hugo wolfram 1925–2015 textile manufacturer born bochum germany served managing director lurex company makers fabric lurex also author three novels emigrated england 1933 world war ii broke left school 15 subsequently found hard get job since regarded enemy alien adult took correspondence courses philosophy psychology wolfram mother sybil wolfram 1931–1993 born sybille misch originally berlin germany fellow tutor philosophy lady margaret hall university oxford 1964 1993 published two books philosophical logic introduction 1989 in-laws outlaws kinship marriage england 1987 translator claude lévi-strauss la pensée sauvage savage mind later disavowed translation daughter criminologist psychoanalyst kate friedlander 1902–1949 expert subject juvenile delinquency physician walter misch 1889–1943 together wrote die vegetative genese der neurotischen angst und ihre medikamentöse beseitigung reichstag fire 1933 emigrated berlin germany england parents jewish psychoanalyst paula heimann 1899–1982 stephen wolfram married mathematician four children together stephen son christopher began degree course mathematics computer science 2018 co-inventor patented method computing device optically recognizing mathematical expressions christopher presented led workshops several highly-regarded conferences events including south southwest interactive university oxford summer school mit independent activities period 2016 awarded best technical advisor raw science film festival work movie arrival among many personal achievements serves programmer wolfram research wolfram educated eton college left prematurely 1976 entered st. john college oxford age 17 found lectures awful left 1978 without graduating attend california institute technology following year received phd particle physics 19 november 1979 age 20 wolfram thesis committee composed richard feynman peter goldreich frank j. sciulli steven frautschi chaired richard d. field young child wolfram difficulties learning arithmetic age 12 wrote directory physics age 14 written three books particle physics wolfram age 15 began research applied quantum field theory particle physics published scientific papers topics included matter creation annihilation fundamental interactions elementary particles currents hadronic leptonic physics parton model published professional peer-reviewed scientific journals including nuclear physics b australian journal physics nuovo cimento physical review working independently wolfram published widely cited paper heavy quark production age 18 nine papers continued research publish particle physics early twenties wolfram work geoffrey c. fox theory strong interaction still used experimental particle physics 1981 letter feynman gerald freund giving reference wolfram macarthur grant appears feynman collected letters perfectly reasonable deviations beaten track following phd wolfram joined faculty caltech became youngest recipient macarthur fellowships 1981 age 21 1983 wolfram left school natural sciences institute advanced study princeton conducted research cellular automata mainly computer simulations produced series papers systematically investigating class elementary cellular automata conceiving wolfram code naming system one-dimensional cellular automata classification scheme complexity behaviour conjectured rule 110 cellular automaton might turing complete later proved correct 1985 letter feynman wolfram also appears feynman letters response wolfram writing thinking creating kind institute might study complex systems feynman tells wolfram understand ordinary people advises find way research little contact non-technical people possible mid-1980s wolfram worked simulations physical processes turbulent fluid flow cellular automata connection machine alongside feynman helped initiate field complex systems 1984 participant founding workshops santa fe institute along nobel laureates murray gell-mann manfred eigen philip warren anderson future laureate frank wilczek 1986 founded center complex systems research ccsr university illinois urbana–champaign 1987 journal complex systems first journal field complex systems published many papers course three decades complex systems developed broad base readers contributors academia industry government general public 50 countries around world wolfram led development computer algebra system smp symbolic manipulation program caltech physics department 1979–1981 dispute administration intellectual property rights regarding smp—patents copyright faculty involvement commercial ventures—eventually caused resign caltech smp developed marketed commercially inference corp. los angeles 1983–1988 1983 wolfram joined institute advanced study princeton new jersey-based former home albert einstein time longer interested particle physics instead began pursuing viewed creative areas — specifically cellular automata wolfram methodically analyzed sets rules developing classification system rated complexity various cellular automata — intention clarifying way view complexity real world wolfram mind studying results cellular-automata runs computer could unlock deep truths universe wolfram cellular-automata work came cited 10,000 papers 1986 wolfram left institute advanced study university illinois urbana–champaign founded center complex systems research started develop computer algebra system mathematica first released 23 june 1988 left academia 1987 founded wolfram research continues develop market program near end sybil wolfram life part research in-laws outlaws used son program mathematica analyze data wolfram younger brother conrad wolfram serves ceo wolfram research europe ltd. 1992 2002 worked controversial book new kind science presents empirical study simple computational systems additionally argues fundamental reasons types systems rather traditional mathematics needed model understand complexity nature wolfram conclusion universe digital nature runs fundamental laws described simple programs predicts realization within scientific communities major revolutionary influence physics chemistry biology majority scientific areas general reason book title since release book 2002 wolfram split time developing mathematica encouraging people get involved subject matter new kind science giving talks holding conferences starting summer school devoted topic beginning may 2017 15th anniversary hardcover publication free electronic version new kind science launched includes complete access high-resolution images wolfram axiom result computer exploration new kind science looking shortest single axiom equivalent axioms boolean algebra propositional calculus result search axiom six nand operations three variables equivalent boolean algebra vertical bar represents nand logical operation also known sheffer stroke 25 candidates precisely set sheffer identities length less equal 15 elements excluding mirror images noncommutative models size less equal 4 variables 2003 wolfram hosted first wolfram summer school brown university — program designed provide educational career opportunities learning conducting projects frontiers science technology innovation 2007 summer school began hosted university vermont burlington exception year 2009 held istituto di scienza e tecnologie dell'informazione cnr pisa italy 2012 program held curry college milton massachusetts since 2013 wolfram summer school held annually bentley university waltham massachusetts new kind science idea exploring new abstract universe computational universe simple programs new kind science wolfram shows simple programs computational universe capture essence complexity – beauty – many systems nature led creation wolfram tones works taking simple programs wolfram computational universe applying music theory wolfram language algorithms render music program effect defines virtual world special story — wolfram tones captures musical composition new kind science wolfram found simplest known universal turing machine — 2 states 5 colors however also extensive search simpler turing machines found much simpler candidate universality 2,3 turing machine 14 may 2007 fifth anniversary publication new kind science wolfram announced 25,000 prize first person determine whether 2,3 turing machine actually universal could provide proof five months contest announcement undergraduate student birmingham uk successfully found 2,3 turing machine universal provided 40-page paper prove findings march 2009 wolfram announced wolfram|alpha answer engine wolfram|alpha later launched may 2009 paid-for version extra features launched february 2012 engine based natural language processing large library algorithms answers queries using approach described new kind science application programming interface allows applications extend enhance alpha wolfram believes wolfram alpha comes common use raise level scientific things average person wolfram alpha one answer engines behind microsoft bing apple siri answering factual questions 2010 wolfram co-founded touchpress along theodore gray max whitby john cromie company specialised creating in-depth premium apps games covering wide range educational subjects designed children parents students educators since launch touchpress published 100 apps march 2014 annual south southwest sxsw event wolfram officially announced wolfram language new general multi-paradigm programming language currently better known multi-paradigm computational communication language documentation language pre-released october 2013 coincide bundling mathematica wolfram language every raspberry pi computer wolfram language existed 25 years primary programming language used mathematica officially named 2014 wolfram son christopher wolfram appeared program sxsw giving live-coding demonstration using wolfram language blogged wolfram language wolfram research 8 december 2015 wolfram published book elementary introduction wolfram language introduce people knowledge programming wolfram language kind computation allows release second edition book coincided ceo hire competition 2017 collision tech conference beginning 2017 wolfram began live stream internal wolfram language development meetings meetings viewers encouraged submit questions comments related development programming language viewers known suggest new functions would like see developed name new functions help solve complex issues faced stephen wolfram research development team live streamed meetings viewed twitch.tv youtube live facebook live archived live streams also accessed personal website significance data products wolfram creates transfers life extensive log personal analytics including emails received sent keystrokes made meetings events attended phone calls even physical movement dating back 1980s preface new kind science noted recorded one-hundred million keystrokes one-hundred mouse miles stated personal analytics give us whole new dimension experiencing lives stephen wolfram christopher wolfram involved helping create alien language film arrival used wolfram language since 2018 wolfram producing podcast podcast stephen discusses topics ranging history science future civilization ethics ai | [
3166,
4474,
8065,
8082,
479,
1284,
4067,
3723,
7658,
4089,
3910,
5429,
5784,
5612,
2524,
1243,
5621
] | Test |
4,941 | 6 | Reiser4:reiser4 reiser4 computer file system successor reiserfs file system developed scratch namesys sponsored darpa well linspire reiser4 named former lead developer hans reiser reiser4 patch set still maintained according phoronix unlikely merged mainline linux without corporate backing goals reiser4 file system advanced reiser4 features user-defined transactions also available lack vfs api present reiser4 lacks standard file system features online repacker similar defragmentation utilities provided file systems creators reiser4 say implement later sooner someone pays reiser4 uses b*-trees conjunction dancing tree balancing approach underpopulated nodes merged flush disk except memory pressure transaction completes system also allows reiser4 create files directories without waste time space fixed blocks synthetic benchmarks performed namesys 2003 show reiser4 10 15 times faster serious competitor ext3 working files smaller 1 kib namesys benchmarks suggest typically twice performance ext3 general-purpose filesystem usage patterns benchmarks 2006 show results reiser4 slower many operations benchmarks conducted 2013 linux kernel version 3.10 show reiser4 considerably faster various tests compared in-kernel filesystems ext4 btrfs xfs reiser4 patches linux 2.6 3.x 4.x 5.x. reiser4 merged mainline linux kernel consequently still supported many linux distributions however predecessor reiserfs v3 widely adopted reiser4 also available andrew morton -mm kernel sources zen patch set linux kernel developers claim reiser4 follow linux coding standards hans reiser suggested political reasons latest released reiser4 kernel patches tools downloaded reiser4 project page sourceforge.net hans reiser convicted murder april 28 2008 leaving future reiser4 uncertain arrest employees namesys assured would continue work events would slow software development immediate future order afford increasing legal fees hans reiser announced december 21 2006 going sell namesys march 26 2008 sold although website unavailable january 2008 edward shishkin employee programmer namesys quoted cnet interview saying commercial activity namesys stopped shishkin others continued development reiser4 making source code available shishkin web site later relocated kernel.org since 2008 namesys employees received 100 sponsored funding darpa 2010 phoronix wrote edward shishkin exploring options get reiser4 merged linux kernel mainline file system still updated new kernel releases submitted merging 2015 michael larabel metioned unlikely happen without corporate backing suggested april 2019 main obstacle could renaming reiser4 refers initial author involved murder case | [
3599,
2547,
7161,
4672,
6431,
3626,
5049,
6117,
759,
7581,
6854,
5437,
4375,
6500,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
847,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
174,
2710,
162... | Validation |
4,942 | 9 | Data_structure_alignment:data structure alignment data structure alignment refers way data arranged accessed computer memory consists three separate related issues data alignment data structure padding packing cpu modern computer hardware performs reads writes memory efficiently data naturally aligned generally means data address multiple data size data alignment refers aligning elements according natural alignment ensure natural alignment may necessary insert padding structure elements last element structure although data structure alignment fundamental issue modern computers many computer languages computer language implementations handle data alignment automatically ada pl/i pascal certain c c++ implementations rust c assembly language allow least partial control data structure padding may useful certain special circumstances memory address said n-byte aligned multiple n bytes n power 2 context byte smallest unit memory access i.e memory address specifies different byte n -byte aligned address would minimum log n least-significant zeros expressed binary alternate wording b-bit aligned designates b/8 byte aligned address ex 64-bit aligned 8 bytes aligned memory access said aligned data accessed n bytes long datum address n -byte aligned memory access aligned said misaligned note definition byte memory accesses always aligned memory pointer refers primitive data n bytes long said aligned allowed contain addresses n -byte aligned otherwise said unaligned memory pointer refers data aggregate data structure array aligned primitive datum aggregate aligned note definitions assume primitive datum power two bytes long case 80-bit floating-point x86 context influences conditions datum considered aligned data structures stored memory stack static size known bounded heap dynamic size known unbounded computer accesses memory single memory word time long memory word size least large largest primitive data type supported computer aligned accesses always access single memory word may true misaligned data accesses highest lowest bytes datum within memory word computer must split datum access multiple memory accesses requires lot complex circuitry generate memory accesses coordinate handle case memory words different memory pages processor must either verify pages present executing instruction able handle tlb miss page fault memory access instruction execution processor designs deliberately avoid introducing complexity instead yield alternative behavior event misaligned memory access example implementations arm architecture prior armv6 isa require mandatory aligned memory access multi-byte load store instructions depending specific instruction issued result attempted misaligned access might round least significant bits offending address turning aligned access sometimes additional caveats throw mmu exception mmu hardware present silently yield potentially unpredictable results starting armv6 architecture support added handle unaligned access many necessarily circumstances single memory word accessed operation atomic i.e whole memory word read written devices must wait read write operation completes access may true unaligned accesses multiple memory words e.g first word might read one device words written another device second word read first device value read neither original value updated value although failures rare difficult identify although compiler interpreter normally allocates individual data items aligned boundaries data structures often members different alignment requirements maintain proper alignment translator normally inserts additional unnamed data members member properly aligned addition data structure whole may padded final unnamed member allows member array structures properly aligned padding inserted structure member followed member larger alignment requirement end structure changing ordering members structure possible change amount padding required maintain alignment example members sorted descending alignment requirements minimal amount padding required minimal amount padding required always less largest alignment structure computing maximum amount padding required complicated always less sum alignment requirements members minus twice sum alignment requirements least aligned half structure members although c c++ allow compiler reorder structure members save space languages might also possible tell c c++ compilers pack members structure certain level alignment e.g pack 2 means align data members larger byte two-byte boundary padding members one byte long one use packed structures conserve memory example structure containing single byte four-byte integer would require three additional bytes padding large array structures would use 37.5 less memory packed although accessing structure might take longer compromise may considered form space–time tradeoff although use packed structures frequently used conserve memory space may also used format data structure transmission using standard protocol however usage care must also taken ensure values struct members stored endianness required protocol often network byte order may different endianness used natively host machine following formulas provide number padding bytes required align start data structure mod modulo operator example padding add offset 0x59d 4-byte aligned structure 3 structure start 0x5a0 multiple 4 however alignment offset already equal align second modulo align offset mod align mod align return zero therefore original value left unchanged since alignment definition power two modulo operation reduced bitwise boolean operation following formulas produce aligned offset bitwise bitwise data structure members stored sequentially memory structure member data1 always precede data2 data2 always precede data3 type short stored two bytes memory member data structure depicted would 2-byte aligned data1 would offset 0 data2 offset 2 data3 offset 4 size structure would 6 bytes type member structure usually default alignment meaning unless otherwise requested programmer aligned pre-determined boundary following typical alignments valid compilers microsoft visual c++ borland/codegear c++builder digital mars dmc gnu gcc compiling 32-bit x86 notable differences alignment lp64 64-bit system compared 32-bit system data types dependent implementation structure members various types totaling 8 bytes compilation compilation data structure supplemented padding bytes ensure proper alignment members compiled size structure 12 bytes important note last member padded number bytes required total size structure multiple largest alignment structure member alignment int case 4 linux-32bit/gcc case 3 bytes added last member pad structure size 12 bytes alignment int × 3 example total size structure 5 size multiple 4 alignment float example total size structure 5 8 either size multiple 2 alignment short 2 linux-32bit/gcc possible change alignment structures reduce memory require conform existing format reordering structure members changing compiler ’ alignment “ packing ” structure members compiled size structure matches pre-compiled size 8 bytes note replaced thus eliminated longer necessary structure already aligned size long word alternative method enforcing structure aligned one byte boundary cause pre-processor discard pre-determined alignment structure members thus padding bytes would inserted standard way defining alignment structure members compilers use directives specify packing inside source files example structure would compiled size 6 bytes 32-bit system directives available compilers microsoft borland gnu many others another example microsoft compilers particularly risc processor unexpected relationship project default packing /zp directive directive directive used reduce packing size structure project default packing leads interoperability problems library headers use example project packing smaller reason setting project packing value default 8 bytes would break directives used library headers result binary incompatibilities structures limitation present compiling x86 would beneficial allocate memory aligned cache lines array partitioned one thread operate sub-array boundaries unaligned cache lines could lead performance degradation example allocate memory double array size 10 aligned cache 64 bytes alignment concerns affect areas much larger c structure purpose efficient mapping area hardware address translation mechanism pci remapping operation mmu instance 32-bit operating system 4 kib 4096 bytes page arbitrary 4 kib chunk data instead usually region memory aligned 4 kib boundary aligning page page-sized boundary lets hardware map virtual address physical address substituting higher bits address rather complex arithmetic example assume tlb mapping virtual address 0x2cfc7000 physical address 0x12345000 note addresses aligned 4 kib boundaries accessing data located virtual address va=0x2cfc7abc causes tlb resolution 0x2cfc7 0x12345 issue physical access pa=0x12345abc 20/12-bit split luckily matches hexadecimal representation split 5/3 digits hardware implement translation simply combining first 20 bits physical address 0x12345 last 12 bits virtual address 0xabc also referred virtually indexed abc physically tagged 12345 block data size 2 1 always one sub-block size 2 aligned 2 bytes dynamic allocator knowledge alignment used provide aligned buffers price factor two space loss aligntonext p r works adding aligned increment clearing r least significant bits p possible implementation | [
1339,
6249,
4662,
4397,
3836,
1361,
7533,
304,
5932,
7990,
1198,
5670,
3207,
7096,
584,
4067,
3557,
5948,
5506,
4077,
5190,
336,
5424,
5606,
3579,
7499,
1236,
1237,
6778,
352,
1989,
3679,
1435
] | Test |
4,943 | 4 | Crypto_(book):crypto book crypto code rebels beat government saving privacy digital age book cryptography written steven levy published 2001 levy details emergence public key cryptography digital signatures struggle national security agency nsa cypherpunks book details creation data encryption standard des rsa clipper chip | [
5773,
1821
] | Test |
4,944 | 1 | Skipper_(computer_software):skipper computer software skipper visualization tool code/schema generator php orm frameworks like doctrine2 doctrine propel cakephp used create database abstraction layer skipper developed czech company inventic s.r.o based brno known orm designer prior rebranding 2014 skipper built qt framework import/export schema definitions uses xsl transformations powered libxslt library imported source files first converted xml format conversion xml simple conversion yml creating abstract syntax tree subsequent conversion xml php annotations import/export scripts configured javascript freely customized frameworks supported visual model schema files generation skipper created internal tool web applications developed inventic first published commercial tool name orm designer 2009 application reworked optimized january 2013 released orm designer 2 may 2013 orm designer became part south moravian innovation center incubator program support program innovative technological startups june 2014 orm designer version 3 released rebranded name skipper | [
1905,
2180,
6604,
1643,
3915,
6701,
5571,
2660,
6594
] | Test |
4,945 | 4 | Non-repudiation:non-repudiation non-repudiation refers situation statement author successfully dispute authorship validity associated contract term often seen legal setting authenticity signature challenged instance authenticity repudiated example mallory buys cell phone 100 writes paper cheque check payment signs cheque pen later finds ca n't afford claims cheque forgery unfortunately signature guarantees mallory could signed cheque mallory bank must pay cheque non-repudiation mallory repudiate cheque practice pen-and-paper signatures n't hard forge digital signatures hard break general non-repudiation involves associating actions changes unique individual example secure area may use key card access system non-repudiation would violated key cards shared lost stolen cards immediately reported similarly owner computer account must allow others use giving away password policy implemented enforce prevents owner account denying actions performed account digital security non-repudiation means proof data integrity typically easiest requirements accomplish data hash sha2 usually ensures data changed undetectably even safeguard possible tamper data transit either man-in-the-middle attack phishing data integrity best asserted recipient already possesses necessary verification information common methods provide non-repudiation context digital communications storage message authentication codes mac useful communicating parties arranged use shared secret possess digital signatures powerful tool provides non-repudiation publicly verifiable manner note goal achieve confidentiality cases mac digital signature one simply appends tag otherwise plaintext visible message confidentiality also required encryption scheme combined digital signature form authenticated encryption could used verifying digital origin means certified/signed data likely came someone possesses private key corresponding signing certificate key used digitally sign message properly safeguarded original owner digital forgery occur mitigate risk people repudiating signatures standard approach involve trusted third party two common ttps forensic analysts notaries forensic analyst specializing handwriting compare signature known valid signature assess legitimacy notary witness verifies individual identity checking credentials affixing certification person signing claim notary provides extra benefit maintaining independent logs transactions complete types credentials checked another signature verified forensic analyst double security makes notaries preferred form verification digital information commonly employed ttp certificate authority issues public key certificates public key certificate used anyone verify digital signatures without shared secret signer verifier role certificate authority authoritatively state certificate belongs meaning person entity possesses corresponding private key however digital signature forensically identical legitimate forged uses someone possesses private key create valid digital signature protecting private key idea behind united states department defense common access card cac never lets key leave card means use card encryption digital signatures person needs personal identification number pin code necessary unlock | [
363,
8162,
6795,
6894,
7633,
3963,
5568,
2566,
3379,
2312,
2598,
1037,
6758,
6049,
341,
429,
525,
6672,
6501,
3426
] | Test |
4,946 | 9 | MUMPS:mumps mumps massachusetts general hospital utility multi-programming system general-purpose computer programming language originally designed 1966 healthcare industry differentiating feature built-in database enabling high-level access disk storage using simple symbolic program variables subscripted arrays similar variables used languages access main memory continues used today many large hospitals banks provide high-throughput transaction data processing mumps developed neil pappalardo robert greenes curt marble dr. octo barnett animal lab massachusetts general hospital mgh boston 1966 1967 original mumps system like unix years later built spare dec pdp-7 octo barnett neil pappalardo also involved mgh planning hospital information system obtained backward compatible pdp-9 began using mumps admissions cycle laboratory test reporting mumps interpreted language yet even incorporated hierarchical database file system standardize interaction data aspects mumps traced rand corporation joss bbn telcomp stringcomp mumps team deliberately chose include portability machines design goal another feature widely supported machines era operating systems computer hardware multitasking also built language portability soon useful mumps shortly adapted dec pdp-15 lived time mumps developed support government research grant mumps released public domain longer requirement grants soon ported number systems including popular dec pdp-8 data general nova dec pdp-11 artronix pc12 minicomputer word mumps spread mostly medical community early 1970s widespread use often locally modified needs early 1970s many varied implementations mumps range hardware platforms widespread dec mumps-11 pdp-11 meditech miis 1972 many mumps users attended conference standardized then-fractured language created mumps users group mumps development committee mdc efforts proved successful standard complete 1974 approved september 15 1977 ansi standard x11.1-1977 time dec launched dsm-11 digital standard mumps pdp-11 quickly dominated market became reference implementation time also intersystems sold ism-11 pdp-11 identical dsm-11 early 1980s several vendors brought mumps-based platforms met ansi standard market significant companies developed important mumps implementations period also saw considerable mdc activity second revision ansi standard mumps x11.1-1984 approved november 15 1984 us department veterans affairs formerly veterans administration one earliest major adopters mumps language development work subsequent contributions free mumps application codebase influence many medical users worldwide 1995 veterans affairs patient admission/tracking/discharge system decentralized hospital computer program dhcp recipient computerworld smithsonian award best use information technology medicine july 2006 department veterans affairs va veterans health administration vha recipient innovations american government award presented ash institute john f. kennedy school government harvard university extension dhcp veterans health information systems technology architecture vista nearly entire va hospital system united states indian health service major parts department defense chcs hospital system use mumps databases clinical data tracking 2015 department defense awarded 10 year contract leidos cerner accenture replace chcs 2017 veterans health administration vha announced would replace vista cerner 2024 2025 2019 vha announced would also replace epic systems online appointment scheduling system one cerner 2024 healthcare companies using mumps include epic meditech ge healthcare formerly idx systems centricity ameripath part quest diagnostics care centric allscripts coventry healthcare emis sunquest information systems formerly misys healthcare many reference laboratories dasa quest diagnostics dynacare use mumps software written based antrim corporation code antrim purchased misys healthcare sunquest information systems 2001 mumps also widely used financial applications mumps gained early following financial sector use many banks credit unions used ameritrade largest online trading service us 12 billion transactions per day well bank england barclays bank among others since 2005 use mumps either form gt.m intersystems caché latter aggressively marketed intersystems success penetrating new markets telecommunications addition existing markets european space agency announced may 13 2010 use intersystems caché database support gaia mission mission aims map milky way unprecedented precision mumps language intended designed build database applications secondary language features included help programmers make applications using minimal computing resources original implementations interpreted though modern implementations may fully partially compiled individual programs run memory partitions early mumps memory partitions limited 2048 bytes aggressive abbreviation greatly aided multi-programming severely resource limited hardware one mumps job could fit small memories extant hardware time ability provide multi-user systems another language design feature word multi-programming acronym points even earliest machines running mumps supported multiple jobs running time change mini-computers micro-computers years later even single user pc single 8-bit cpu 16k 64k memory could support multiple users could connect non-graphical video display terminals since memory tight originally language design mumps valued terse code thus every mumps command function name could abbreviated one three letters length e.g quit exit program q p piece function r read command tr translate function spaces end-of-line markers significant mumps line scope promoted terse language design thus single line program code could express characters idea programming languages could require 5 10 times many characters abbreviation common feature languages designed period e.g. focal-69 early basics tiny basic etc. unfortunate side effect coupled early need write minimalist code mumps programmers routinely comment code used extensive abbreviations meant even expert mumps programmer could skim page code see function would analyze line line database interaction transparently built language mumps language provides hierarchical database made persistent sparse arrays implicitly opened every mumps application variable names prefixed caret character use permanent instead ram storage maintain values application exits visible modifiable running applications variables using shared permanent storage called globals mumps scoping variables globally available jobs system recent common use name global variables languages limited scoping names coming fact unscoped variables globally available programs running process shared among multiple processes mumps storage mode i.e globals stored persistent sparse arrays gives mumps database characteristics document-oriented database variable names prefixed caret character temporary private like global variables also hierarchical storage model locally available single job thus called locals globals locals child nodes called subscripts mumps terminology subscripts limited numerals—any ascii character group characters subscript identifier uncommon modern languages perl javascript highly unusual feature late 1970s capability universally implemented mumps systems 1984 ansi standard canonically numeric subscripts required standard allowed thus variable named 'car subscripts door steering wheel engine contain value subscripts variable ^car door could nested variable subscript color example thus could say modify nested child node ^car mumps terms color 2nd subscript variable ^car names child-nodes child-nodes likewise called subscripts hierarchical variables similar objects properties many object oriented languages additionally mumps language design requires subscripts variables automatically kept sorted order numeric subscripts including floating-point numbers stored lowest highest non-numeric subscripts stored alphabetical order following numbers mumps terminology canonical order using non-negative integer subscripts mumps programmer emulate arrays data type languages although mumps natively offer full set dbms features mandatory schemas several dbms systems built top provide application developers flat-file relational network database features additionally built-in operators treat delimited string e.g. comma-separated values array early mumps programmers would often store structure related information delimited string parsing read saved disk access time offered considerable speed advantages hardware mumps data types numbers treated strings digits strings treated numbers numeric operators coerced mumps terminology coercion odd side effects however example string coerced parser turns much string starting left number discards rest thus statement codice_1 evaluated codice_2 mumps features language intended help mumps applications interact multi-user environment database locks process identifiers atomicity database update transactions required standard mumps implementations contrast languages c wirth traditions space characters mumps statements significant single space separates command argument space newline separates argument next mumps token commands take arguments e.g. codice_3 require two following spaces concept one space separates command nonexistent argument next separates argument next command newlines also significant codice_4 codice_3 codice_6 command processes skips everything else till end-of-line make statements control multiple lines must use codice_7 command create code block simple hello world program mumps might would run mumps command line command codice_8 since mumps allows commands strung together line since commands abbreviated single letter routine could made compact 'codice_9 text generates newline ansi x11.1-1995 gives complete formal description language annotated version standard available online data types one universal datatype implicitly coerced string integer floating-point datatypes context requires booleans called truthvalues mumps commands syntax expressions evaluated conditions string value evaluated numeric value nonzero value interpreted true codice_10 yields 1 less b 0 otherwise declarations none variables dynamically created first time value assigned lines important syntactic entities unlike status languages patterned c pascal multiple statements per line allowed common scope else command remainder current line case sensitivity commands intrinsic functions case-insensitive contrast variable names labels case-sensitive special meaning upper vs. lower-case widely followed conventions percent sign legal first character variables labels postconditionals execution almost command controlled following colon truthvalue expression codice_11 sets foo n less 10 codice_12 performs printerr n greater 100 construct provides conditional whose scope less full line abbreviation abbreviate nearly commands native functions one two three characters reserved words none since mumps interprets source code context need reserved words may use names language commands variables following perfectly legal mumps code mumps made obfuscated using contracted operator syntax shown terse example derived example arrays created dynamically stored b-trees sparse i.e use almost space missing nodes use number subscripts subscripts strings numeric including floating point arrays always automatically stored sorted order never occasion sort pack reorder otherwise reorganize database built functions data order next deprecated query functions provide efficient examination traversal fundamental array structure disk memory local arrays variable names beginning caret i.e stored memory process private creating process expire creating process terminates available storage depends implementation implementations using partitions limited partition size small partition might 32k implementations may several megabytes global arrays codice_13 stored disk available processes persistent creating process terminates large globals example hundreds gigabytes practical efficient implementations mumps main database mechanism used instead calling operating system create write read files indirection many contexts codice_14 used effectively substitutes contents vbl another mumps statement codice_15 sets variable abc 123. codice_16 performs subroutine named report substitution allows lazy evaluation late binding well effectively operational equivalent pointers languages piece function breaks variables segmented pieces guided user specified separator string sometimes called delimiter know awk find familiar codice_17 means third caret-separated piece stringvar piece function also appear assignment set command target codice_18 yields std codice_19 causes x become office world.std.com note p equivalent piece could written order function function treats input structure finds next index exists structure except last subscript returns sorted value ordered one given input treats array reference content-addressable data rather address value codice_20 yields 6 codice_21 yields 10 codice_22 yields 10 codice_23 yields 15 codice_24 yields argument-less repeats stopped terminating quit line prints table stuff successively 6 10 15 iterating database order function returns next key use multi-user/multi-tasking/multi-processor mumps supports multiple simultaneous users processes even underlying operating system e.g. ms-dos additionally ability specify environment variable specifying machine name variable codice_25 allow access data remote machines aspects mumps syntax differ strongly modern languages cause confusion whitespace allowed within expressions ends statement codice_26 error must written codice_27 operators precedence left-associative codice_28 evaluates 50 operators less equal greater equal codice_29 codice_30 boolean negation operator codice_31 plus strict comparison operator periods codice_32 used indent lines block whitespace else command need corresponding operates inspecting value builtin system variable codice_33 mumps scoping rules permissive modern languages declared local variables scoped using stack routine normally see declared locals routines call stack routines prevent routines call modifying declared locals contrast undeclared variables variables created using rather declaration scope routines running process remain scope program exits following positions supported knowledgeable people various times contention arose response strong advocacy part one commercial interest intersystems whose chief executive disliked name mumps felt represented serious marketing obstacle thus favoring extent became identified alignment intersystems dispute also reflected rivalry organizations technology association mumps development committee ansi iso standards committees determines official name language writers attempted defuse issue referring language umps square brackets customary notation optional syntax elements leading authority author open source mumps implementation professor kevin o'kane uses 'mumps recent standard iso/iec 11756:1999 re-affirmed 25 june 2010 still mentions mumps officially accepted names massachusetts general hospital registered mumps trademark uspto november 28 1971 renewed november 16 1992 let expire august 30 2003 mumps invites comparison pick operating system similarities include | [
5367,
6428,
6804,
6105,
3968,
4705,
405,
1855,
2582,
1112,
2226,
3987,
5424,
5778,
2619,
5091,
6507,
4759,
7246,
4769,
5117,
3368,
4786,
4425,
4070,
6212,
5506,
861,
7303,
7687,
171,
4463,
7333,
190,
3772,
2740,
4142,
5571,
578,
5948,
6... | Test |
4,947 | 3 | Allwinner_A1X:allwinner a1x allwinner a1x family single-core soc devices designed allwinner technology zhuhai china currently family consists a10 a13 a10s a12 socs incorporate arm cortex-a8 main processor mali 400 gpu allwinner a1x known ability boot linux distributions debian ubuntu fedora arm architecture-capable distributions sd card addition android os usually installed flash memory device video acceleration display controller memory connectivity storage boot devices many manufacturers adopted allwinner a1x use devices running android operating system linux operating system allwinner a1x used tablet computers set-top boxes pc-on-a-stick mini-pcs single-board computers allwinner a1x architecture referred 'sunxi linux kernel source tree source code available github moment stable full hardware support limited 3.0.x 3.4.x kernels recent mainline versions kernel run offer nand access limited 3d-acceleration work progress support efika freebsd moment on-board peripherals working may 2015 openbsd armv7 port supports cubieboard pcduino boards based allwinner a1x netbsd contains support allwinner a10 factory sourced programmers manual publicly available a10s cpu moment apart single-core a1x a10/a13/a10s/a12 two new powerful cortex-a7 allwinner socs released allwinner a10-pin-compatible dual-core allwinner a20 quad-core allwinner a31 | [
6421,
7890,
722,
2926,
5740,
1473,
5750,
5752,
5405,
5406,
1864,
67,
446,
451,
6165,
463,
5472,
469,
4041,
3008,
3365,
6910,
5845,
7654,
3397,
1977,
2339,
2711,
1995,
550,
3786,
2024,
5576,
578,
1284,
4879,
7376,
5585,
4166,
4537,
950,
... | Test |
4,948 | 5 | Domain_Technologie_Control:domain technologie control domain technologie control dtc web hosting control panel aimed providing graphics-oriented layout managing commercial hosting web servers intended shared web hosting servers virtual private servers vpses dedicated servers domain technologie control free software released gnu lgpl v2.1 license fully skinnable translated several languages domain technologie control allows administrator create web hosting plans provide e-mail ftp accounts domain purchasing subdomains ssh mysql databases end users controllable quota web sites users dtc also maintains automation billing generates backup scripts monitors traffic per user per service using single system uid gid also integrated dtc support ticket system customizable http error pages dtc manages mysql database store setup configuration web hosting plans users support many free software mysql apache php qmail postfix courier dovecot proftpd webalizer mod-log-sql also connects dtc-xen manage monitor usage virtual private servers vps dtc fully open source lgpl dtc also first web hosting control panel reached inclusion major distributions like debian since lenny 2009 ubuntu since 2008 freebsd | [
978,
6029,
6179,
7214,
1762,
5571,
1142,
84,
578,
7756
] | Test |
4,949 | 3 | Star_Soldier_(video_game):star soldier video game mobile versions released january 26 2001 japan star soldier special+ 2004 star soldier sp arcade 2005 2008 're also released palm os november 2001 japan ios january 4 2012 united states star soldier spawned numerous sequels starting super star soldier pc engine ported game boy advance 2004 japan part famicom mini series wii virtual console japanese north american regions july 2007 enhanced remake game released playstation portable japan 2005 3ds virtual console re-released konami november 14 2012 japan august 15 2013 pal version september 24 2013 north america ios version titled june 20 2013 japan | [
2976
] | Validation |
4,950 | 1 | Referential_integrity:referential integrity referential integrity property data stating references valid context relational databases requires value one attribute column relation table references value another attribute either different relation referenced value must exist referential integrity hold relational database column base table declared foreign key contain either null values values parent table primary key candidate key words foreign key value used must reference valid existing primary key parent table instance deleting record contains value referred foreign key another table would break referential integrity relational database management systems rdbms enforce referential integrity normally either deleting foreign key rows well maintain integrity returning error performing delete method used may determined referential integrity constraint defined data dictionary adjective 'referential describes action foreign key performs 'referring linked column another table simple terms 'referential integrity guarantees target 'referred found lack referential integrity database lead relational databases return incomplete data usually indication error inclusion dependency two possibly identical predicates formula_1 formula_2 schema written formula_3 formula_4 formula_5 distinct attributes column names formula_1 formula_2 implies tuples values appearing columns formula_8 facts formula_1 must also appear tuple values columns formula_10 fact formula_2 logical implication inclusion dependencies axiomatized inference rules decided pspace algorithm problem shown pspace-complete reduction acceptance problem linear bounded automaton however logical implication dependencies inclusion dependencies functional dependencies undecidable reduction word problem monoids declarative referential integrity dri one techniques sql database programming language ensure data integrity table called referencing table refer column group columns another table referenced table using foreign key referenced column referenced table must unique constraint primary key also self-references possible fully implemented ms sql server though inserting new row referencing table relational database management system rdbms checks entered key value exists referenced table insert possible also possible specify dri actions update delete cascade forwards change/delete referenced table referencing tables action specific row referenced changing key allowed set null set default changed/deleted key referenced table results setting referencing values null default value one specified ansi/iso/iec 9075-1:2003 information technology—database languages—sql—part 1 framework sql/framework ansi/iso/iec 9075-2:2003 information technology—database languages—sql—part 2 foundation sql/foundation microsoft sql server term dri also applies assigning permissions users database object giving dri permission database user allows add foreign key constraints table | [
1449,
3951,
6430,
6462,
1861,
6128,
7205,
2956,
5419,
5778,
7213,
6144,
1891,
784,
2265,
7248,
3005,
4046,
3011,
4781,
6543,
4798,
517,
519,
7303,
4457,
5209,
7715,
3776,
200,
927,
2054,
7022,
243,
5956,
5252,
1730,
6345,
7067,
1363,
10... | Test |
4,951 | 2 | Floppyfw:floppyfw floppyfw linux distribution running busybox provide firewall/gateway/router single bootable floppy disk later available cd format reviews concluded simple reliable gateway/firewall could established small medium-sized networks low cost ease.. one independent study concluded best possible security provided floppy-based firewall repurposing old redundant hardware linux-based firewalls routers floppyfw features include | [
362,
2001,
5200,
1629,
1261,
3444,
7251,
474,
7075,
1941,
314,
2758,
6456,
7275,
1663,
2864,
4162,
6209,
7752,
7289,
6761,
2063,
343,
4824,
5523,
7587,
5259,
1893,
5530,
5704,
6317,
352,
3751,
7954,
6244
] | Test |
4,952 | 2 | Internal_field_separator:internal field separator many command line interpreters “ shell ” unix operating systems internal field separator abbreviated ifs refers variable defines character characters used separate pattern tokens operations ifs typically includes space tab newline bash man page shell treats character ifs delimiter splits results expansions words characters ifs unset value exactly space tab newline default sequences space tab newline beginning end results previous expansions ignored sequence ifs characters beginning end serves delimit words ifs value default sequences whitespace characters space tab ignored beginning end word long whitespace character value ifs ifs whitespace character character ifs ifs whitespace along adjacent ifs whitespace characters delimits field sequence ifs whitespace characters also treated delimiter value ifs null word splitting occurs ifs usable exploit versions unix program root permissions could fooled executing user-supplied code ran instance codice_1 called ifs set case would run program bin current directory thus writable user root permissions fixed making shells inherit ifs variable examples apply use ifs bash scripts | [
5571
] | Test |
4,953 | 4 | National_Cyber_Security_Awareness_Month:national cyber security awareness month national cyber security awareness month ncsam observed october united states america started national cyber security division within department homeland security nonprofit national cyber security alliance month raises awareness importance cybersecurity 2004 department homeland security national cyber security alliance launched national cyber security awareness month broad effort help americans stay safe secure online initial efforts included advice like keeping antivirus programs date since 2009 month included overall theme shared responsibility weekly themes throughout month introduced 2011 | [
6106,
5004
] | Validation |
4,954 | 3 | Kepler_(microarchitecture):kepler microarchitecture kepler codename gpu microarchitecture developed nvidia first introduced retail april 2012 successor fermi microarchitecture kepler nvidia first microarchitecture focus energy efficiency geforce 600 series geforce 700 series geforce 800m series gpus based kepler manufactured 28 nm kepler also found use gk20a gpu component tegra k1 soc well quadro kxxx series quadro nvs 510 nvidia tesla computing modules kepler followed maxwell microarchitecture used alongside maxwell geforce 700 series geforce 800m series architecture named johannes kepler german mathematician key figure 17th century scientific revolution goal nvidia previous architecture design focused increasing performance compute tessellation kepler architecture nvidia targeted focus efficiency programmability performance efficiency aim achieved use unified gpu clock simplified static scheduling instruction higher emphasis performance per watt abandoning shader clock found previous gpu designs efficiency increased even though requires additional cores achieve higher levels performance cores power-friendly two kepler cores using 90 power one fermi core according nvidia numbers also change unified gpu clock scheme delivers 50 reduction power consumption area programmability aim achieved kepler hyper-q dynamic parallelism multiple new compute capabilities 3.x functionality higher gpu utilization simplified code management achievable gk gpus thus enabling flexibility programming kepler gpus finally performance aim additional execution resource cuda core register cache kepler ability achieve memory clock speed 6 ghz increases kepler performance compare previous nvidia gpus gk series gpu contains features older fermi newer kepler generations kepler based members add following standard features kepler architecture employs new streaming multiprocessor architecture called smx smxs reason kepler power efficiency whole gpu uses single unified clock speed although smxs usage single unified clock increases power efficiency due fact multiple lower clock kepler cuda cores consume 90 less power multiple higher clock fermi cuda core additional processing units needed execute whole warp per cycle doubling 16 32 per cuda array solve warp execution problem smx front-end also double warp schedulers dispatch unit register file doubled 64k entries feed additional execution units risk inflating die area smx polymorph engines enhanced 2.0 rather double alongside execution units enabling spurr polygon shorter cycles dedicated fp64 cuda cores also used kepler cuda cores fp64 capable save die space improvement nvidia made smx results include increase gpu performance efficiency gk110 48kb texture cache unlocked compute workloads compute workload texture cache becomes read-only data cache specializing unaligned memory access workloads furthermore error detection capabilities added make safer workloads rely ecc register per thread count also doubled gk110 255 registers per thread additional die spaces acquired replacing complex hardware scheduler simple software scheduler software scheduling warps scheduling moved nvidia compiler gpu math pipeline fixed latency introduced instruction-level parallelism addition thread level parallelism instructions statically scheduled consistency introduced moving fixed latency instructions static scheduled compiler removed level complexity gpu boost new feature roughly analogous turbo boosting cpu gpu always guaranteed run minimum clock speed referred base clock clock speed set level ensure gpu stays within tdp specifications even maximum loads loads lower however room clock speed increased without exceeding tdp scenarios gpu boost gradually increase clock speed steps gpu reaches predefined power target 170 w default taking approach gpu ramp clock dynamically providing maximum amount speed possible remaining within tdp specifications power target well size clock increase steps gpu take adjustable via third-party utilities provide means overclocking kepler-based cards nvidia fermi kepler gpus geforce 600 series support direct3d 11.0 specification nvidia originally stated kepler architecture full directx 11.1 support includes direct3d 11.1 path following modern ui direct3d 11.1 features however supported ref name= nvidia/d3d11.1 /ref according definition microsoft direct3d feature level 11_1 must complete otherwise direct3d 11.1 path executed integrated direct3d features kepler architecture geforce 400 series fermi architecture nvidia kepler gpus geforce 600/700 series support direct3d 12 feature level 11_0 exclusive kepler gpus txaa new anti-aliasing method nvidia designed direct implementation game engines txaa based msaa technique custom resolve filters designed address key problem games known shimmering temporal aliasing txaa resolves smoothing scene motion making sure in-game scene cleared aliasing shimmering low level gk110 sees additional instructions operations improve performance new shuffle instructions allow threads within warp share data without going back memory making process much quicker previous load/share/store method atomic operations also overhauled speeding execution speed atomic operations adding fp64 operations previously available fp32 data hyper-q expands gk110 hardware work queues 1 32 significance single work queue meant fermi could occupied times n't enough work queue fill every sm 32 work queues gk110 many scenarios achieve higher utilization able put different task streams would otherwise idle smx simple nature hyper-q reinforced fact easily mapped mpi common message passing interface frequently used hpc legacy mpi-based algorithms originally designed multi-cpu systems became bottlenecked false dependencies solution increasing number mpi jobs possible utilize hyper-q algorithms improve efficiency without changing code dynamic parallelism ability kernels able dispatch kernels fermi cpu could dispatch kernel incurs certain amount overhead communicate back cpu giving kernels ability dispatch child kernels gk110 save time go back cpu process free cpu work tasks enabling dynamic parallelism requires new grid management dispatch control system new grid management unit gmu manages prioritizes grids executed gmu pause dispatch new grids queue pending suspended grids ready execute providing flexibility enable powerful runtimes dynamic parallelism cuda work distributor kepler holds grids ready dispatch able dispatch 32 active grids double capacity fermi cwd kepler cwd communicates gmu via bidirectional link allows gmu pause dispatch new grids hold pending suspended grids needed gmu also direct connection kepler smx units permit grids launch additional work gpu via dynamic parallelism send new work back gmu prioritized dispatched kernel dispatched additional workload pauses gmu hold inactive dependent work completed nvidia gpudirect capability enables gpus within single computer gpus different servers located across network directly exchange data without needing go cpu/system memory rdma feature gpudirect allows third party devices ssds nics ib adapters directly access memory multiple gpus within system significantly decreasing latency mpi send receive messages to/from gpu memory also reduces demands system memory bandwidth frees gpu dma engines use cuda tasks kepler gk110 also supports gpudirect features including peer‐to‐peer gpudirect video nvenc nvidia power efficient fixed-function encode able take codecs decode preprocess encode h.264-based content nvenc specification input formats limited h.264 output still nvenc limited format support 4096x4096 encode like intel quick sync nvenc currently exposed proprietary api though nvidia plans provide nvenc usage cuda theoretical single-precision processing power kepler gpu gflops computed 2 operations per fma instruction per cuda core per cycle × number cuda cores × core clock speed ghz note like previous generation fermi kepler able benefit increased processing power dual-issuing mad+mul like tesla capable theoretical double-precision processing power kepler gk110/210 gpu 1/3 single precision performance double-precision processing power however available professional quadro tesla high-end titan-branded geforce cards drivers consumer geforce cards limit performance 1/24 single precision performance lower performance gk10x chips similarly capped 1/24 single precision performance | [
2538,
2270,
7335,
6610,
5472,
7442,
1640,
7912,
4154,
5939,
1864,
7669,
6307,
1595,
8141,
1237,
4833,
2080,
2085
] | Test |
4,955 | 6 | XCOPY:xcopy computing codice_1 command used ibm pc dos ms-dos ibm os/2 microsoft windows freedos reactos related operating systems copying multiple files entire directory trees one directory another copying files across network codice_1 stands extended copy created functional file copying utility codice_3 command found earlier operating systems codice_1 first appeared dos 3.2 still included windows 10 codice_1 deprecated favor codice_6 powerful copy tool built microsoft windows server desktop operating systems dr dos 6.0 includes implementation command freedos version developed rene ableidinger licensed gpl j. edmeades developed wine-compatible version included reactos licensed lgpl create new directory copying contents existing directory including files subdirectories hidden system attributes empty directories directory names include blank signs spaces names put quotation marks copy entire drive mapped network drive ignoring errors network restartable mode copy single file without prompt file directory codice_1 fails insufficient memory error path plus filename longer 254 characters moving large files without /j option available server 2008r2 consume available ram system codice_1 copy open files process may open files exclusive read access withholding file_share_read https //msdn.microsoft.com/en-us/library/aa363858.aspx windows volume shadow copy service used situations codice_1 use therefore codice_1 useful backing live operating system volumes | [
1710,
2811,
4291,
1812,
4387,
4759,
2999,
6088,
2834,
204,
5480,
5571,
6997,
126,
1382,
5138,
3797,
5234,
7272,
5942,
1213,
6380,
1128,
7494,
4547,
6773,
1140,
1793,
3417,
5181,
6062,
7046,
7868,
4464
] | Validation |
4,956 | 4 | Credant_Technologies:credant technologies credant technologies company located addison texas offering products services data security company founded 2001 bob heard chris burchett andrew kahl company offers range products protect data leaking several different versions main technology used different locations network via policy proxy border lan internet dmz central enterprise server within network also editions exchange servers domain controllers available products self-encrypting drivers encrypt data drive without additional requirements client user bitlocker management systems policy reporting tools company claims products protect two million end-points several industries universities health-care aeronautical financial government/defense 18 december 2012 dell announced reached agreement credant would acquire company prior acquisition dell already technology partner credant dell bought 16 companies past 4 years several directly indirectly field data-security major step field security services made dell start 2011 acquired secureworks 2012 acquisition sonicwall best known firewalls intrusion detection prevention appliances also companies dell bought past years offer products services security including perot systems quest software acquisition credant dell gambles continuation strong growth security services | [
7795,
5599,
972,
3680
] | Test |
4,957 | 4 | National_Industrial_Security_Program:national industrial security program national industrial security program nisp nominal authority united states managing needs private industry access classified information nisp established 1993 executive order 12829 national security council nominally sets policy nisp director information security oversight office nominally authority implementation isoo secretary defense nominally executive agent nisp recognizes four different cognizant security agencies equal authority department defense department energy central intelligence agency nuclear regulatory commission major component nisp nisp operating manual also called nispom dod 5220.22-m nispom establishes standard procedures requirements government contractors regards classified information current nispom edition dated 28 feb 2006 chapters selected sections edition dod 5220.22-m sometimes cited standard sanitization counter data remanence nispom actually covers entire field government–industrial security data sanitization small part two paragraphs 141-page document furthermore nispom actually specify particular method standards sanitization left cognizant security authority defense security service provides clearing sanitization matrix c sm specify methods june 2007 edition dss c sm overwriting longer acceptable sanitization magnetic media degaussing physical destruction acceptable | [
1020,
2813,
6272,
5150,
8191,
4957,
6327,
7110,
4536
] | Validation |
4,958 | 4 | Resource_exhaustion_attack:resource exhaustion attack resource exhaustion attacks computer security exploits crash hang otherwise interfere targeted program system form denial-of-service attack different distributed denial-of-service attacks involve overwhelming network host web server requests many locations resource exhaustion attacks generally exploit software bug design deficiency software manual memory management commonly written c c++ memory leaks common bug exploited resource exhaustion even garbage collected programming language used resource exhaustion attacks possible program uses memory inefficiently impose limits amount state used necessary file descriptor leaks another common vector general-purpose programming languages require programmer explicitly close file descriptors even particularly high-level languages allow programmer make mistakes | [
1616,
1954,
6225,
1691,
4716,
4771,
1805,
2736
] | Test |
4,959 | 3 | ARCS_(computing):arcs computing arcs firmware bootloader also known prom console used computers produced sgi since beginning 1990s arcs system loosely compliant advanced risc computing arc standard promulgated advanced computing environment consortium early 1990s another sense arc standard based sgi arcs used basis generating arc standard although arc calls little-endian system arcs system big-endian mips-based systems despite various inconsistencies two sgi arcs implementations arc standard share many commonalities device naming calling conventions etc. computers use arcs firmware based mips line microprocessors sgi visual workstation series based intel pentium iii also uses arcs visual workstation series commercially produced x86-compatible system used arcs firmware rather traditional pc bios used intel 386-lineage machines list product lines use arcs console includes | [
5055,
7010,
4365,
1052,
4370,
5104,
4372,
5571,
352,
3567,
1727,
156,
4859
] | Test |
4,960 | 5 | Metro_Ring_Protocol:metro ring protocol metro ring protocol mrp layer 2 resilience protocol developed foundry networks currently delivered products manufactured brocade communications systems hewlett packard protocol quite tightly specifies topology layer 2 devices usually core larger network configured able achieve much faster failover times layer 2 protocols spanning tree | [] | Train |
4,961 | 4 | Lookout_(IT_security):lookout security lookout private security company headquartered san francisco california develops markets cloud-based security software mobile devices company founded 2007 three security researchers previously consulting name flexilis years raised 300 million venture capital funding lookout also expanded consumer android app mobile devices operating systems business version lookout founded three security researchers met university southern california los angeles students formed consulting firm focused cybersecurity called flexilis 2003 2004 discovered vulnerability nokia phones allowed take control phones remotely bluetooth founders could n't get nokia patch vulnerability scanned data nokia phones 2005 academy awards using high-powered bluetooth device publicity stunt exposing security vulnerabilities private phones celebrities led widespread media attention nokia soon fixed problem 2007 flexilis began developing mobile security app raised 5.5 million venture capital 2009 flexilis changed name lookout 11 million venture capital funding raised 2010 followed 40 million 2011 75 million 2012 55 million 2013 series f funding round 2014 raised another 150 million funding 2014 co-founder john hering stepped ceo former juniper networks executive jim dolce appointed position 2017 lookout citizen lab discovered malicious app called pegasus made israeli-firm nso group iphone android versions posed ordinary apps took control phone downloaded following year lookout electronic frontier foundation published report exposing series similar hacking campaigns lebanese government called dark caracal lookout develops markets security app mobile phones also called lookout free version includes antivirus antimalware scans locator features free version comes pre-installed android devices sold t-mobile sprint paid versions add ability remotely lock wipe phone backup photos features enterprise version adds analytics admin console tools detect malicious software corporate networks first free version lookout introduced december 2009 first paid version introduced following year safe browsing browser add-on added 2011 2012 version 3 lookout overhauled user interface added signal flare documents phone location runs battery following year lookout added feature secretly takes photo someone tries unlock phone unsuccessfully order catch thieves first business version added features administrators introduced 2013 followed first enterprise version june 2015 | [
4320,
5700,
1790
] | Test |
4,962 | 2 | Intel_Advisor:intel advisor intel advisor also known advisor xe vectorization advisor threading advisor simd vectorization optimization shared memory threading assistance tool c c++ c fortran software developers architects product available windows linux operating systems form standalone gui tool microsoft visual studio plug-in command line interface also supporting usage mpi intel advisor incorporates two workflows two feature-sets vectorization advisor threading advisor vectorization advisor supports analysis scalar sse avx avx2 avx-512-enabled codes generated intel gnu microsoft compilers auto-vectorization also supports analysis explicitly vectorized codes use openmp 4.x intel cilk plus well codes written using c vector intrinsics assembly language intel advisor includes following main features vectorization advisor capability introduced 2016 release intel advisor works compilers gcc microsoft provide additional information used intel compilers version 15.x newer examples include vectorize vector efficiency metrics intel advisor available part intel parallel studio xe vectorization advisor part intel advisor 2016 supports native analysis 2nd generation intel® xeon phi™ codenamed knights landing processor starting intel advisor 2016 update 3 version advisor survey map analysis several avx-512-specific tuning capabilities advisor also separate capability analysis non-executed code paths analyze avx-512 code characteristics running analysis platforms n't support avx-512 intel advisor automates roofline performance model first proposed berkeley extended university lisbon advisor roofline analysis helps identify given loop/function memory cpu bound also identifies optimized loops high impact performance optimized public sources known used schlumberger sandia national lab well leading design company classified great timesaver incredibly useful tool supporting parallel algorithm research advisor also aims simplify speed-up parallel design implementation providing step-by-step workflow claimed useful academia educational purposes public sources new vectorization advisor capabilities introduced august 2015 known used lrz ichec daresbury lab pexip prototype threading designs software architects add code annotations describe threading understood advisor ignored compiler advisor projects scalability threading checks synchronization errors threading suitability projections intel xeon phi beginning 2015 release suitability analysis supported first generation intel xeon phi™ coprocessor knights corner threading performance scalability parallel runtimes overheads modeling suitability estimates intel® xeon phi™ processor peak performance given loop/workload automatically compares appropriate double-socket 16-core intel® xeon® reference performance baseline | [
584,
2000,
6332,
4318,
6053,
549,
5571,
5670,
578,
2240,
336,
2805
] | Test |
4,963 | 3 | INT_16H:int 16h int 16h int 16h int 22 shorthand bios interrupt call 16hex 22nd interrupt vector x86-based computer system bios typically sets real mode interrupt handler vector provides keyboard services interruption responsible control pc keyboard interruption responsible obtaining basic keyboard functionality i.e responsible collecting keystrokes obtain status buffer keyboard etc standard encoding keyboard offers int 16 h us keyboard adapt coding int 16h another type keyboard example hebrew keyboard must attend scan-code key pressed perform suitable interpreting key want 101 letters keyboard keys int 16h interprets expanded keys scan-code different normal keys e.g. key pause | [] | Test |
4,964 | 1 | JDBC_driver:jdbc driver jdbc driver software component enabling java application interact database jdbc drivers analogous odbc drivers ado.net data providers ole db providers connect individual databases jdbc java database connectivity api requires drivers database jdbc driver gives connection database implements protocol transferring query result client database jdbc technology drivers fit one four categories jdbc type 1 driver also known jdbc-odbc bridge database driver implementation employs odbc driver connect database driver converts jdbc method calls odbc function calls driver platform-dependent makes use odbc turn depends native libraries underlying operating system jvm running upon also use driver leads installation dependencies example odbc must installed computer driver database must support odbc driver use driver discouraged alternative pure-java driver available implication application using type 1 driver non-portable given binding driver platform technology n't suitable high-transaction environment type 1 drivers also n't support complete java command set limited functionality odbc driver sun oracle provided jdbc-odbc bridge driver codice_1 driver native code java closed source sun's/oracle jdbc-odbc bridge removed java 8 vendors available driver written loading causes instance created also calls codice_2 instance parameter drivermanager list drivers available creating connection may sometimes case one jdbc driver capable connecting given url example connecting given remote database might possible use jdbc-odbc bridge driver jdbc-to-generic-network-protocol driver driver supplied database vendor cases order drivers tested significant drivermanager use first driver finds successfully connect given url first drivermanager tries use driver order registered drivers listed jdbc.drivers always registered first skip drivers untrusted code unless loaded source code trying open connection tests drivers calling method driver.connect one turn passing url user originally passed method codice_3 first driver recognizes url makes connection jdbc type 2 driver also known native-api driver database driver implementation uses client-side libraries database driver converts jdbc method calls native calls database api example oracle oci driver type 2 driver jdbc type 3 driver also known pure java driver database middleware database driver implementation makes use middle tier calling program database middle-tier application server converts jdbc calls directly indirectly vendor-specific database protocol differs type 4 driver protocol conversion logic resides client middle-tier like type 4 drivers type 3 driver written entirely java client-side jdbc driver may used multiple databases depends number databases middleware configured support type 3 driver platform-independent platform-related differences taken care middleware also making use middleware provides additional advantages security firewall access jdbc type 4 driver also known direct database pure java driver database driver implementation converts jdbc calls directly vendor-specific database protocol written completely java type 4 drivers thus platform independent install inside java virtual machine client provides better performance type 1 type 2 drivers overhead conversion calls odbc database api calls unlike type 3 drivers need associated software work database protocol vendor specific jdbc client requires separate drivers usually vendor supplied connect different types databases | [
5014,
3172,
5571,
6420,
2054,
6362,
5666,
4209
] | Validation |
4,965 | 2 | Crash_reporter:crash reporter crash reporter usually system software whose function identify reporting crash details alert crashes production development testing environments crash reports often include data stack traces type crash trends version software reports help software developers- web saas mobile apps diagnose fix underlying problem causing crashes crash reports may contain sensitive information passwords email addresses contact information become objects interest researchers field computer security implementing crash reporting tools part development cycle become standard crash reporting tools become commodity many offered free like crashlytics many giant industry players part software development eco-system entered game companies twitter google others putting lot efforts encouraging software developers use apis knowing increase revenues road advertisements mechanisms realize must offer elegant solutions many possible development issues otherwise competitors take actions keep adding advanced features crash reporting tools make important development functionality giant companies include portfolio solutions many crash reporting tools specialized mobile app many sdks macos standard crash reporter /system/library/coreservices/crash reporter.app crash reporter.app sends unix crash logs apple engineers look top text field window crash log bottom field user comments users may also copy paste log email client send application vendor use crash reporter.app 3 main modes display nothing crash display application crashed dialog box display crash report window microsoft windows includes crash reporting service called windows error reporting prompts users send crash reports microsoft online analysis information goes central database run microsoft consists diagnostic information helps company development team responsible crash debug resolve issue choose crash reports third party software available third party developers granted access microsoft system considers parts debug release process targeted bug fixes applied windows update words people experiencing particular type crash offered bug fix thus limiting exposure issue according der spiegel microsoft crash reporter exploited nsa tailored access operations tao unit hack computers mexico secretariat public security according source microsoft crash reports automatically harvested nsa xkeyscore database order facilitate operations another error reporting library windows crashrpt crashrpt library light-weight open source error handling framework applications created microsoft visual c++ running windows library distributed new bsd license crashrpt intercepts unhandled exceptions creates crash minidump file builds crash descriptor xml format presents interface allow user review crash report finally compresses sends crash report software support team crashrpt also provides server-side command line tool crash report analysis named crprober tool able read received crash reports directory generate summary file text format crash report also groups similar crash reports making easier determine popular problems crprober tool provide graphical interface rather cryptic difficult use also open-source server software named crashfix server store organize analyze crash reports sent crashrpt library group similar crash reports built-in bug tracker generate statistical reports crashfix server provides web-based user interface making possible several project members collaborate upload debugging symbols browse crash reports associate bugs crash reports abrt automated bug reporting tool claimed distro-independent deployed fedora red hat enterprise linux distributions abrt intercepts core dumps applications user-confirmation sends bug reports various bug-tracking systems fedora bugzilla ubuntu hosts public error tracker errors.ubuntu.com collects hundreds thousands error reports daily millions machines program crashes ubuntu crash handler apport notify user offer report crash user chooses report crash details possibly including core dump uploaded ubuntu server daisy.ubuntu.com analysis core dump automatically processed create stack trace crash signature crash signature used classify subsequent crash reports caused error bug buddy crash reporting tool used gnome platform application using gnome libraries crashes bug buddy generates stack trace using gdb invites user submit report gnome bugzilla user add comments view details crash report crash reporting tool used kde called dr. konqi user also get backtrace using gdb talkback also known quality feedback agent crash reporter used mozilla software version 1.8.1 report crashes products centralized server aggregation case-by-case analysis talkback proprietary software licensed mozilla corporation supportsoft mozilla product e.g mozilla firefox mozilla thunderbird crash talkback enabled talkback agent would appear prompting user provide optional information regarding crash talkback replace native os crash reporter enabled appear along talkback agent talkback replaced breakpad firefox since version 3 breakpad previously called airbag open-source replacement talkback developed google mozilla used current mozilla products firefox thunderbird significance first open source multi-platform crash reporting system since 2007 breakpad included firefox windows mac os x linux breakpad typically paired socorro receives classifies crashes users breakpad part crash reporting system includes reporting mechanism crashpad open-source crash reporter used google chromium developed replacement breakpad due update macos 10.10 removed api used breakpad crashpad currently consists crash-reporting client related tools macos windows considered substantially complete platforms crashpad became crash reporter client chromium macos march 2015 windows november 2015 world warcraft another program use crash reporter error reporter error reporter may detect crashes time sometimes os crash reporter invoked instead error reporter even known crash reporting errors android ios operating systems also built crash reporting functionality | [
4759,
1584,
7975,
445
] | Test |
4,966 | 4 | UDP_flood_attack:udp flood attack udp flood attack denial-of-service dos attack using user datagram protocol udp sessionless/connectionless computer networking protocol using udp denial-of-service attacks straightforward transmission control protocol tcp however udp flood attack initiated sending large number udp packets random ports remote host result distant host thus large number udp packets victimized system forced sending many icmp packets eventually leading unreachable clients attacker may also spoof ip address udp packets ensuring excessive icmp return packets reach anonymizing network location operating systems mitigate part attack limiting rate icmp responses sent udp flood attack tools attack managed deploying firewalls key points network filter unwanted network traffic potential victim never receives never responds malicious udp packets firewall stops however firewalls 'stateful i.e hold number sessions firewalls also susceptible flood attacks | [
4247,
1412,
2944,
2430,
7637,
3775,
1612
] | Train |
4,967 | 3 | Sun-3:sun-3 sun-3 series unix computer workstations servers produced sun microsystems launched september 9 1985 sun-3 series vmebus-based systems similar earlier sun-2 series using motorola 68020 microprocessor combination motorola 68881 floating-point co-processor optional sun 3/50 proprietary sun mmu sun-3 systems supported sunos versions 3.0 4.1.1_u1 also current support netbsd linux models listed approximately chronological order max ram sizes may greater third-party memory board used 1989 coincident launch sparcstation 1 sun launched three new sun-3 models 3/80 3/470 3/480 unlike previous sun-3s use motorola 68030 processor 68882 floating-point unit 68030 integral mmu 68030-based architecture called sun-3x sun 3/260s upgraded sun 3400 cpu boards known sun 3/460s | [
6329,
5097,
1254,
1258,
2992,
1923,
1263,
6505,
6270,
908,
7535,
1185,
1937,
4321,
2299,
4418,
2033,
578,
3294,
3026,
4515,
5587,
1023,
418,
7114,
1590,
3820,
8138,
4999,
6583,
3673,
7133,
5705,
8145,
7781,
971
] | Test |
4,968 | 3 | LGA_775:lga 775 lga 775 also known socket intel desktop cpu socket lga stands land grid array unlike earlier common cpu sockets predecessor socket 478 lga 775 socket holes instead 775 protruding pins touch contact points underside processor cpu socket unusually long life span lasting 7 years last processors supporting ceased production 2011 socket superseded lga 1156 socket h lga 1366 socket b sockets lga 775 distance four screw holes heatsink 72 mm thus interchangeable ones sockets lga 1156 1155 1150 1151 distance 75 mm prescott cedar mill pentium 4 cores well smithfield presler pentium cores used lga 775 socket july 2006 intel released desktop processor core 2 duo codenamed conroe also uses socket subsequent core 2 quad intel changed socket 478 lga 775 new pin type offers better power distribution processor allowing front-side bus raised 1600 mt/s 't socket derived cancelled tejas core replace prescott core another advantage intel newer architecture motherboard pins rather cpu transferring risk pins bent cpu motherboard cpu pressed place load plate rather human fingers directly installer lifts hinged load plate inserts processor closes load plate top processor pushes locking lever pressure locking lever load plate clamps processor 775 copper contact points firmly onto socket 775 pins ensuring good connection load plate covers edges top surface cpu integrated heat spreader center free make contact cooling device placed top cpu spacing cpu cooler mounting holes 72mm x 72mm examination relevant intel data sheets shows lga 775 used consumer level desktops lga 771 used xeon based intel workstation server class computers appear differ placement indexing notches swap two address pins many pins devoted functions interfacing multiple cpus clearly defined lga 775 specifications information available appear consistent lga 771 considering lga 775 predated lga 771 nearly year half would seem lga 771 adapted lga 775 rather way around fact using adapter allow lga 771 processors used lga 775 motherboards i845gv/ge/i848p/i865g/gv/p/pe/i910gl/i915g/gl/gv/p/pl/i925x/xe/ lakeport 945pl /945p 945g 945gc 945gz 955x 946pl 946gz p broadwater i955x i946 946gz pl 965 i975 q965 p965 g965 q963 i975x bearlake x35 p35 q35 g35 p33 g33 q33 p31 g31 x38 eaglelake x48 p45 p43 g45 g43 g41 b43 q43 q45 sis 649/649fx/655/656/656fx/662/671/671fx/671dx/672 pt800/pm800/pt880/pm880/p4m800/p4m800 pro/pt880 pro/pt880 ultra/pt894/pt894 pro/p4m890/pt890/p4m900 ati radeon xpress 200 ati radeon xpress 1250 ati crossfire xpress 3200 nforce4 ultra nforce4 sli xe nforce4 sli nforce4 sli x16 nforce 570 sli nforce 590 sli nforce 610i nforce 630i nforce 650i ultra nforce 650i sli nforce 680i lt sli nforce 680i sli nforce 730i nforce 740i sli nforce 750i sli nforce 760i sli nforce 780i sli nforce 790i sli geforce 9300 geforce 9400 sources force load plate ensures processor completely level giving cpu upper surface optimal contact heat sink cold-water block fixed onto top cpu carry away heat generated cpu socket also introduces new method connecting heat dissipation interface chip surface motherboard lga 775 heat dissipation interface connected directly motherboard four points compared two connections socket 370 clamshell four-point connection socket 478 done avoid reputed danger heat sinks/fans pre-built computers falling transit lga 775 announced better heat dissipation properties socket 478 designed replace prescott core cpus early incarnations ran much hotter previous northwood-core pentium 4 cpus initially neutralized benefits better heat transfer however modern core 2 processors run much lower temperatures prescott cpus replace lga 775 processors following mechanical maximum load limits exceeded heat sink assembly shipping conditions standard use load limits could crack processor die make unusable transition lga packaging lowered load limits smaller load limits socket 478 processors bigger socket 370 socket 423 socket processors fragile large enough ensure processors crack compatibility quite variable earlier chipsets intel 915 tend support single core netburst pentium 4 celeron cpus fsb 533/800 mt/s intermediate chipsets e.g intel 945 commonly support single core pentium 4-based cpus well dual core pentium processors 945 chipset-based motherboards could given bios upgrade support 65nm core-based cpus chipsets also varies lga 775 cpu support complicated mixture chipset capability voltage regulator limitations bios support example g41 chipset n't support netburst cpus pentium pentium extreme edition pentium 4 celeron | [
2541,
6698,
4123,
3849,
1729,
2828,
6173,
2830,
3002,
7974,
4314,
5379,
3193,
1841,
1645,
2751,
3203,
3385,
4972,
5853,
2685,
6935,
7484,
8021,
7302,
5963,
5343,
866,
3333,
1237,
7134,
262,
6683,
5886
] | Validation |
4,969 | 4 | National_Cyber_Security_Hall_of_Fame:national cyber security hall fame national cyber security hall fame founded larry letow rick geritz established 2012 recognize contributions key individuals field cyber security mission statement respect past protect future according website designed honor innovative individuals organizations vision leadership create fundamental building blocks cyber security industry organization also highlights major milestones industry 40-year history timeline representation includes inductees corresponding accomplishments nominations cyber security hall fame submitted following categories reviewed advisory committee chaired 2013 mike jacobs 2019 members cyber security hall fame advisory board | [
904,
2385,
6179,
5773,
4201,
5688,
1805
] | Test |
4,970 | 5 | Pulse-code_modulation:pulse-code modulation pulse-code modulation pcm method used digitally represent sampled analog signals standard form digital audio computers compact discs digital telephony digital audio applications pcm stream amplitude analog signal sampled regularly uniform intervals sample quantized nearest value within range digital steps linear pulse-code modulation lpcm specific type pcm quantization levels linearly uniform contrast pcm encodings quantization levels vary function amplitude a-law algorithm μ-law algorithm though pcm general term often used describe data encoded lpcm pcm stream two basic properties determine stream fidelity original analog signal sampling rate number times per second samples taken bit depth determines number possible digital values used represent sample early electrical communications started sample signals order multiplex samples multiple telegraphy sources convey single telegraph cable american inventor moses g. farmer conveyed telegraph time-division multiplexing tdm early 1853 electrical engineer w. m. miner 1903 used electro-mechanical commutator time-division multiplexing multiple telegraph signals also applied technology telephony obtained intelligible speech channels sampled rate 3500–4300 hz lower rates proved unsatisfactory 1920 bartlane cable picture transmission system used telegraph signaling characters punched paper tape send samples images quantized 5 levels 1926 paul m. rainey western electric patented facsimile machine transmitted signal using 5-bit pcm encoded opto-mechanical analog-to-digital converter machine go production british engineer alec reeves unaware previous work conceived use pcm voice communication 1937 working international telephone telegraph france described theory advantages practical application resulted reeves filed french patent 1938 us patent granted 1943 time reeves started working telecommunications research establishment first transmission speech digital techniques sigsaly encryption equipment conveyed high-level allied communications world war ii 1943 bell labs researchers designed sigsaly system became aware use pcm binary coding already proposed reeves 1949 canadian navy datar system ferranti canada built working pcm radio system able transmit digitized radar data long distances pcm late 1940s early 1950s used cathode-ray plate electrode encoding perforations oscilloscope beam swept horizontally sample rate vertical deflection controlled input analog signal causing beam pass higher lower portions perforated plate plate collected passed beam producing current variations binary code one bit time rather natural binary grid goodall later tube perforated produce glitch-free gray code produced bits simultaneously using fan beam instead scanning beam united states national inventors hall fame honored bernard m. oliver claude shannon inventors pcm described communication system employing pulse code modulation filed 1946 1952 granted 1956 another patent title filed john r. pierce 1945 issued 1948 three published philosophy pcm 1948 t-carrier system introduced 1961 uses two twisted-pair transmission lines carry 24 pcm telephone calls sampled 8 khz 8-bit resolution development improved capacity call quality compared previous frequency-division multiplexing schemes 1967 first pcm recorder developed nhk research facilities japan 30 khz 12-bit device used compander similar dbx noise reduction extend dynamic range stored signals video tape recorder 1969 nhk expanded system capabilities 2-channel stereo 32 khz 13-bit resolution january 1971 using nhk pcm recording system engineers denon recorded first commercial digital recordings 1972 denon unveiled first 8-channel digital recorder dn-023r used 4-head open reel broadcast video tape recorder record 47.25 khz 13-bit pcm audio 1977 denon developed portable pcm recording system dn-034r like dn-023r recorded 8 channels 47.25 khz used 14-bits emphasis making equivalent 15.5 bits 1973 adaptive differential pulse-code modulation adpcm developed p. cummiskey nikil jayant james l. flanagan compact disc cd brought pcm consumer audio applications introduction 1982 cd uses 44,100 hz sampling frequency 16-bit resolution stores 80 minutes stereo audio per disc pcm method encoding typically used uncompressed digital audio diagram sine wave red curve sampled quantized pcm sine wave sampled regular intervals shown vertical lines sample one available values y-axis chosen pcm process commonly implemented single integrated circuit called analog-to-digital converter adc produces fully discrete representation input signal blue points easily encoded digital data storage manipulation several pcm streams could also multiplexed larger aggregate data stream generally transmission multiple streams single physical link one technique called time-division multiplexing tdm widely used notably modern public telephone system electronics involved producing accurate analog signal discrete data similar used generating digital signal devices digital-to-analog converters dacs produce voltage current depending type represents value presented digital inputs output would generally filtered amplified use recover original signal sampled data demodulator apply procedure modulation reverse sampling period demodulator reads next value transitions output signal new value result transitions signal gains significant amount high-frequency energy due aliasing effects remove undesirable frequencies demodulator passes signal reconstruction filter suppress energy outside expected frequency range greater nyquist frequency formula_1 common sample depths lpcm 8 16 20 24 bits per sample lpcm encodes single sound channel support multichannel audio depends file format relies synchronization multiple lpcm streams two channels stereo common format systems support 8 audio channels 7.1 surround common sampling frequencies 48 khz used dvd format videos 44.1 khz used compact discs sampling frequencies 96 khz 192 khz used equipment benefits debated nyquist–shannon sampling theorem shows pcm devices operate without introducing distortions within designed frequency bands provide sampling frequency least twice highest frequency contained input signal example telephony usable voice frequency band ranges approximately 300 hz 3400 hz effective reconstruction voice signal telephony applications therefore typically uses 8000 hz sampling frequency twice highest usable voice frequency regardless potential sources impairment implicit pcm system forms pcm combine signal processing coding older versions systems applied processing analog domain part analog-to-digital process newer implementations digital domain simple techniques largely rendered obsolete modern transform-based audio compression techniques telephony standard audio signal single phone call encoded 8,000 samples per second 8 bits giving 64 kbit/s digital signal known ds0 default signal compression encoding ds0 either μ-law mu-law pcm north america japan a-law pcm europe rest world logarithmic compression systems 12- 13-bit linear pcm sample number mapped 8-bit value system described international standard g.711 circuit costs high loss voice quality acceptable sometimes makes sense compress voice signal even adpcm algorithm used map series 8-bit µ-law a-law pcm samples series 4-bit adpcm samples way capacity line doubled technique detailed g.726 standard later found even compression possible additional standards published international standards describe systems ideas covered privately owned patents thus use standards requires payments patent holders adpcm techniques used voice ip communications pcm either return-to-zero rz non-return-to-zero nrz nrz system synchronized using in-band information must long sequences identical symbols ones zeroes binary pcm systems density 1-symbols called ones-density ones-density often controlled using precoding techniques run length limited encoding pcm code expanded slightly longer code guaranteed bound ones-density modulation channel cases extra framing bits added stream guarantee least occasional symbol transitions another technique used control ones-density use scrambler polynomial raw data tend turn raw data stream stream looks pseudo-random raw stream recovered exactly reversing effect polynomial case long runs zeroes ones still possible output considered unlikely enough within normal engineering tolerance cases long term dc value modulated signal important building dc offset tend bias detector circuits operating range case special measures taken keep count cumulative dc offset modify codes necessary make dc offset always tend back zero many codes bipolar codes pulses positive negative absent typical alternate mark inversion code non-zero pulses alternate positive negative rules may violated generate special symbols used framing special purposes word pulse term pulse-code modulation refers pulses found transmission line perhaps natural consequence technique evolved alongside two analog methods pulse width modulation pulse position modulation information encoded represented discrete signal pulses varying width position respectively respect pcm bears little resemblance forms signal encoding except used time division multiplexing numbers pcm codes represented electrical pulses device performs coding decoding function telephone circuit called codec | [
5714,
453,
1443,
7241,
2099,
7169,
3956,
8184,
2472,
3704,
5387,
2114,
1375,
2117,
1284,
2217,
740,
1659,
4970,
2047,
7569,
2236,
2422,
5512,
2149,
768,
5693,
6307,
4006,
5175,
6237,
1988,
84,
5266
] | Validation |
4,971 | 3 | ETen_Chinese_System:eten chinese system eten chinese system 倚天中文系統 popular dos-compatible traditional chinese operating system chinese windows 95 dos support chinese characters extended ascii many companies taiwan developed ibm pc compatible traditional chinese operating system running dos mutually incompatible os kuo chia 國喬 acer developer eten os e-ten earned early profits sales hardware based plug-in card based chinese system products software chinese systems widely copied many traditional chinese users software pirates difficult e-ten control traditional chinese products compatible eten os time microsoft developed chinese windows 3.1 windows 95 traditional chinese software developer users shifted windows dos last version eten os chinese windows-compatible version eten traditional chinese os used dos based pos systems | [
4277
] | Test |
4,972 | 3 | Socket_423:socket 423 socket 423 423 pin cpu socket used first generation pentium 4 processors based willamette core replaced socket 478 2001 socket houses processor designed socket 423 package socket short-lived became apparent electrical design proved inadequate raising clock speed beyond 2.0 ghz intel produced chips using socket less year november 2000 august 2001 replaced socket 478 processors used socket also locked multiplier means overclockable unless front side bus frequency increased however raising fsb frequency could push buses spec thus cause system instability powerleap pl-p4/n device developed form socket adapter allowing use socket 478 processors socket 423 | [
2541,
4123,
3849,
1729,
2828,
6173,
7974,
2830,
3002,
4314,
5379,
3193,
1841,
1645,
3203,
4968,
3385,
5853,
2685,
6935,
8021,
7302,
5963,
5343,
866,
3333,
1237,
7134,
262,
6683,
5886
] | Train |
4,973 | 2 | AQuoSA:aquosa aquosa adaptive quality service architecture open architecture provisioning adaptive quality service functionality linux kernel project features flexible portable lightweight open architecture supporting qos related services top general-purpose operating system linux architecture well founded formal scheduling analysis control theoretical results key feature aquosa resource reservation layer capable dynamically adapting cpu allocation qos aware applications based run-time requirements order provide functionality aquosa embeds kernel-level cpu scheduler implementing resource reservation mechanism cpu based earliest deadline first edf gives ability linux kernel realize partially temporal isolation among tasks running within system aquosa one projects provides real-time scheduling capabilities unprivileged users multi-user system controlled way means properly designed access-control model architecture project may summarized follows lowest level patch linux kernel adds ability notify dynamically loaded modules relevant scheduling event identified creation death tasks well block unblock events patch minimally invasive consists lines code properly inserted mainly within linux scheduler code sched.c called generic scheduler patch potentially allows implement scheduling policy resource reservations layer composed three components core component dynamically loadable kernel module implements resource reservations scheduling paradigm cpu exploiting functionality introduced linux kernel generic scheduler patch second user-level library qres library allows application use new scheduling policy complete well-designed set api calls essentially calls allow application ask system reserve certain percentage cpu process es third kernel-level component supervisor mediates requests made applications qres library total sum requested cpu shares violate schedulability condition scheduler less one slightly less one due overhead supervisor behaviour completely configurable system administrator possible specify per-user/per-group basis minimum guaranteed maximum allowed values reservations made cpu aquosa applications may use directly resource reservation layer allows reserve fraction cpu run required scheduling guarantees example multimedia application may ask operating system run application guarantee scheduled least q milliseconds every p milliseconds q p depend nature application registering application resource reservation layer possible specify minimum guaranteed reservation system always guarantee application based requests minimum guaranteed reservations layer performs admission control i.e allows new application addition new set running applications overcome cpu saturation limit typical multimedia application making use high compression technologies may quite difficult impractical inconvenient run applications fixed reservation cpu fact efficient reservation used may vary time due varying compression level results varying decompression time traditional real-time systems make use wcet worst case execution time analysis techniques order compute maximum time instance example periodic task may execute cpu blocking waiting next instance analysis difficult today complex multimedia applications especially running general-purpose hardware like standard pcs technologies like multi-level caches cpu execution pipelines on-bus buffers multi-master buses introduce many unpredictable variables determining time required memory accesses systems much convenient tune system design based average expected load application otherwise system may significantly under-utilized runtime already mentioned certain classes multimedia applications video player quite impossible find appropriate fixed value fraction cpu required application run-time due heavy fluctuations load depending actual data processed application fixed reservation based average requirements slightly greater results transient periods poor quality runtime e.g movie playback hand fixed reservation based maximum expected load results unneeded over-reservation cpu time except periods load really approaches maximum expected value classes applications much convenient use adaptive reservation techniques like ones provided adaptive reservation layer aquosa performs continuous on-line monitoring computational requirements application process es may dynamically adapt reservation made cpu depending monitored data adaptive reservation layer exposes applications api using set controllers quite general use within wide set multimedia applications real-time variations linux require users real-time capabilities modified os root privileges system perfectly acceptable embedded system context however excessive multi-user systems real-time scheduling features needed multimedia applications similar therefore aquosa embeds dedicated access-control model system administrators details found paper topic published rtas 2008 | [
1237,
4482,
5571,
578
] | Test |
4,974 | 3 | Nano-ITX:nano-itx nano-itx computer motherboard form factor first proposed via technologies cebit march 2003 implemented late 2005 nano-itx boards measure fully integrated low power consumption motherboards many uses targeted smart digital entertainment devices pvrs set-top boxes media centers car pcs thin devices four nano-itx motherboard product lines far via epia n epia nl epia nx via epia nr boards available wide variety manufacturers supporting numerous different cpu platforms udoo released least 1 nano-itx board udoo bolt | [
7212,
1759,
2744,
7041,
6089,
7484,
469,
6478,
2147
] | Validation |
4,975 | 2 | Notification_Center:notification center notification center feature ios macos provides overview alerts applications displays notifications user completes associated action rather requiring instant resolution users may choose applications appear notification center handled initially released ios 5 october 2011 notification center made available macs part os x mountain lion july 2012 notification center released ios 5 replace previous system dealing push local notifications instead interrupting user alert notification center instead displays banner top screen allows user continue using device disappears set period time previous notifications collated notification center panel displayed ios dragging status bar os x clicking notification center button using track-pad gestures swiping right left notifications may selected user redirects user application notification initially created marking alert read notification read removed panel users may also remove notifications without reading deleting individual alerts dismissing application alerts within application generating ios device locked new notifications appear lock screen users may access application generating alert swiping application icon finger left right along notification notification center iphone ipod touch also includes weather stocks widgets displaying information weather user current location stocks user selected stocks application feature available ipad os x release ios 7 added weather widget ipad notification center users also select option display twitter facebook buttons allowing send tweets update status directly notification center ios 7 however option send tweets update facebook statuses removed application uses push notifications system provided apple local notifications may use notification center users may customise want appear notification center may opt stop certain applications appearing center sending alerts screen os x users may also disable alerts banners day stopping notifications appearing screen however notifications sent time still visible notification center panel similar service included ios 6 part disturb feature | [
6788,
3940,
713,
7890,
4320,
2926,
4690,
734,
5752,
405,
6832,
6125,
3989,
2954,
2597,
1123,
3322,
6847,
1502,
6142,
2609,
5786,
1895,
4740,
1897,
5091,
4749,
6505,
7601,
2627,
7609,
1171,
5109,
2284,
1178,
6188,
1187,
1940,
2300,
5486,
... | Test |
4,976 | 5 | CAMEL_Application_Part:camel application part camel application part cap signalling protocol used intelligent network architecture cap remote operations service element rose user protocol layered top transaction capabilities application part tcap ss 7 protocol suite cap based subset etsi core allows implementation carrier-grade value added services unified messaging prepaid fraud control freephone gsm voice gprs data networks camel means adding intelligent applications mobile rather fixed networks builds upon established practices fixed line telephony business generally classed heading intelligent network application part inap cs-2 protocol camel application part cap portable software provides mechanisms support operator services beyond standard gsm services subscribers roaming within outside home plmn hplmn cap product extends framework gsm/3g networks implementing in-based services within gsm/3g networks camel used subscriber roaming networks allowing home network monitor control calls made subscriber camel provides services prepaid roaming services fraud control special numbers e.g. 123 voicemail works everywhere closed user groups e.g. office extension numbers work everywhere camel cap defined four phases accompanying specification builds upon previous phase cap phase provides message set procedures needed support corresponding camel phase requirements defined 3gpp ts 22.078 service aspects 3gpp ts 23.078 technical realization definition protocol may considered split three sections | [
498,
3982,
7590,
5492,
995
] | Test |
4,977 | 4 | Firestarter_(firewall):firestarter firewall firestarter personal firewall tool uses netfilter iptables/ipchains system built linux kernel ability control inbound outbound connections firestarter provides graphical interface configuring firewall rules settings provides real-time monitoring network traffic system firestarter also provides facilities port forwarding internet connection sharing dhcp service firestarter free open-source software uses gui widgets gtk+ | [
1249,
3165,
1809,
4759,
806,
994,
3185,
4492,
7351,
4138,
385,
7536,
2296,
2746,
5571,
6107,
2119,
578,
3637,
8100,
6456,
3551,
1291,
7275,
7744,
3394,
6560,
7289,
7478,
3223,
3484,
4091,
2790,
7683,
6235,
6149,
6951,
7597,
875,
6962
] | Test |
4,978 | 6 | Temp_File_Cleaner:temp file cleaner temp file cleaner tfc utility program microsoft windows designed quickly remove temporary unnecessary files might otherwise prove difficult find dynamic paths multiple locations tfc minimilist design single purpose allow compact installation version 3.1.1 full installation occupies 3.7mb supports removal unnecessary temporary files created google chrome mozilla firefox internet explorer opera browsers well created course normal system operation windows updates cache windows logs windows root user temp files created variety programs addition tfc includes ability customize operations include deeper search subdirectories brute force deletion root path specification addition advanced cleaning protocols windows debug files hibernation files system restore data tfc allows test run operation offering users ability preview files would deleted upon normal execution well amount space would freed | [
5984,
4759,
5571,
2528
] | Test |
4,979 | 6 | Dell_Fluid_File_System:dell fluid file system dell fluid file system fluidfs shared-disk filesystem made dell provides distributed file systems clients customers buy appliance combination purpose-built network-attached storage nas controllers integrated primary backup power supplies i.e. appliance attached block level storage via iscsi fiber channel protocol single dell fluidfs appliance consists two controllers operating concert i.e. active/active connecting back-end storage area network san depending storage capacity requirements user preference fluidfs version 4 nas appliances used compellent equallogic san arrays equallogic fs7600 fs7610 connect client network dell equallogic arrays either 1 gbit/s fs7600 10 gbit/s fs7610 iscsi protocol compellent fluidfs available either 1 gbit/s 10 gbit/s iscsi connectivity client network connection backend compellent san either 8 gbit/s fibre channel 10 gbit/s iscsi fluidfs software layer running nas appliance creates single name-space users offering access via server message block smb network file system nfs also includes features prevent data-loss corruption uses caching increase performance fluidfs result dell acquisition intellectual property exanet firm whose assets included hardware-independent scalable nas storage product previously known dell scalable file system dsfs dell changed name fluidfs acquisition compellent successfully used fluid data tag-line startup company dell developed exanet file system support ndmp backup integrated ip obtained acquisition ocarina networks included deduplication data compression technology dell initially adapted fluidfs work compellent equallogic powervault storage platforms underlying software architecture fluidfs employs linux-based symmetric clustering model distributed metadata native load balancing flexible caching capabilities features scalability limited volume size traditional file systems supports scaling adding capacity system scaling adding nodes performance system fluidfs operates across symmetric cluster purpose-built nas controllers housed pairs within 2u appliance interface fabric shared back-end storage via iscsi fibre channel storage area networks fluidfs architecture layered presents traditional file system network clients performing special functions back end designed utilize available resources network server disk levels improve response times based back-end storage product maximum number nas appliances storage capacity varies number nas appliances varies 1 4 entire capacity system managed single global namespace fluidfs v6 supports multitenancy total storage capacity tens pb maximum size single file 128 tb number files name-space limited 64 billion per appliance 256 billion 4 appliances making one largest industry | [
3599,
4295,
2547,
7161,
4672,
6431,
3626,
32,
5049,
6117,
759,
6854,
5437,
4375,
6500,
5447,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
174,
2710... | Test |
4,980 | 4 | Air-gap_malware:air-gap malware air-gap malware malware designed defeat air-gap isolation secure computer systems using various air-gap covert channels one techniques successfully demonstrated scientists fraunhofer society november 2013 modern computers especially laptops built-in microphones speakers air-gap malware designed communicate secure information acoustically frequencies near beyond limit human hearing technique limited computers close physical proximity also limited requirement transmitting receiving machines infected proper malware form communication link physical proximity limit overcome creating acoustically linked mesh network effective mesh network ultimately traditional ethernet connection outside world secure information removed secure facility 2014 researchers introduced ″airhopper″ bifurcated attack pattern showing feasibility data exfiltration isolated computer nearby mobile phone using fm frequency signals 2015 bitwhisper covert signaling channel air-gapped computers using thermal manipulations introduced bitwhisper supports bidirectional communication requires additional dedicated peripheral hardware later 2015 researchers introduced gsmem method exfiltrating data air-gapped computers cellular frequencies transmission generated standard internal bus renders computer small cellular transmitter antenna 2016 researchers categorized various out-of-band covert channels oob-ccs malware communication channels require specialized hardware transmitter receiver oob-ccs high-bandwidth conventional radio-frequency channels however capable leaking sensitive information require low data rates communicate e.g. text recorded audio cryptographic key material general researchers demonstrated air-gap covert channels realized number different mediums including | [] | Test |
4,981 | 9 | Impromptu_(programming_environment):impromptu programming environment impromptu mac os x programming environment live coding impromptu built around scheme language member lisp family languages source code core opened extempore project environment allows make changes program runtime variables functions may redefined changes take effect immediately programmer also create schedule code future execution well data events notes graphics objects event scheduled execution continues looping performed using idiom called temporal recursion works function asynchronously schedule future call final action library allows communicating audio units audio synthesis graphics layers quicktime quartz core image opengl video composition code written objective-c called editor also objective-c frameworks perform calls scheme interpreter impromptu scheme interpreter initially built tinyscheme 1.35 baseline substantially modified since better suit live coding context real-time garbage collector objective-c integration added also new statically typed language called extempore language integrated system language syntactically scheme-like semantically closer c designed real-time sound synthesis computationally heavy tasks provides type inference compiled machine language llvm study keith live coding performance impromptu andrew sorensen first two minutes 1:56 silent performer writes program produce introduction piece modifies code fly evolve composition core impromptu released extempore bsd style licence runs linux mac os x includes scheme interpreter extempore language compiler scheduler bindings apple libraries absent environment interface dynamic libraries | [
1616,
6507,
7032,
4543,
962,
5571,
5019,
5282,
1897,
4853,
578,
5420,
6408
] | Test |
4,982 | 7 | Quip_(software):quip software quip collaborative productivity software suite mobile web allows groups people create edit documents spreadsheets group typically business purposes quip founded bret taylor co-creator google maps ceo friendfeed former facebook cto along kevin gibbs founded google app engine taylor founded company 2012 leaving position facebook roughly year later quip launched public mobile-centric tool creating shared notes lists documents app well-received winning accolades one best apps year time next web guardian 2015 quip announced received 30 million funding round led greylock partners july 2016 salesforce announced acquisition quip estimated total 750 million january 2017 quip acquired designer studio unity variety core quip provides word processing spreadsheet functionality accessible via web ios app android app alongside documents quip live updating history edits made well ability highlight portions document add comments facilitates collaboration 2015 quip also added standalone chat rooms | [
7037
] | Validation |
4,983 | 4 | Alec_Yasinsac:alec yasinsac alec yasinsac dean school computing university south alabama united states retired u.s. marine yasinsac awarded doctoral degree 1996 university virginia doctoral advisor william wulf received master science computer science naval postgraduate school bachelor science mathematics appalachian state university yasinsac co-founder co-director security assurance information security sait laboratory visiting scholar national academy engineering nae 2006 served advisory board nae 2007 national meeting symposium electronic voting led team conducted source code review support florida department state audit florida 13th congressional district 2006 election | [] | Test |
4,984 | 2 | XOS_(mobile_operating_system):xos mobile operating system xos pronounced eks-oh-es customized version android mobile operating system developed mobile phone company infinix mobile ltd succeeding infinix previous operating system xui xos designed evolving creative smartphone operating system shipped infinix smart phones three distinctive features ai intelligence lightning speed customization option 50 million smartphone devices powered xos currently improved 1000 times attain 21 faster performance compared original android os xos also provides 20 apps redesigned satisfy users needs | [] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.