node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
6,986 | 5 | OpenTG:opentg opentg open-source implementation bulletin board system bbs software program written linux and/or unix written scratch jruby goal reproduce look feel functionality similar legacy bbs systems tag telegard maximus renegade written dos os/2 pre-internet communication era original code bbs used referenced order focus innovation unique capabilities august 17 2008 project founded chris tusa work toward version 1 code year later development branch known opentg/1 ended back-end configuration tool taken shape using ncurses library database abstraction using ruby-dbi postgresql backend database engine developer deemed version code failure due problems maintaining ncurses screen layouts sql queries dbi lessons learned upfront design planning iteration two known simply opentg heavy development code moved mri ruby jruby running openjdk latest code introduces status goal information available project homepage following listing software components used telegard/2 following tested operating system platforms used developers project founded currently led chris tusa hosted bitbucket uses mercirual source code control snapshots cloned github downloadable tarballs made available various intervals testing.. developers find information contributing project website | [
1579,
7983,
5492,
823,
9245
] | None |
6,987 | 4 | 2009_Sidekick_data_loss:2009 sidekick data loss sidekick data outage 2009 resulted estimated 800,000 smartphone users united states temporarily losing personal data emails address books photos mobile handsets computer servers holding data run microsoft brand phone affected danger hiptop also known sidekick connected via t-mobile cellular network time described biggest disaster cloud computing history sidekick smartphones originally produced danger inc. company bought microsoft february 2007 acquisition former danger staff absorbed mobile communications business mcb entertainment devices division microsoft worked future microsoft mobile phone platform known project pink however ex-danger employees soon left microsoft pursue things microsoft took running data servers data centers hosting customers data time lost friday october 2 2009 t-mobile sidekick phone users started noticing data service outages occurring outages lasted approximately two weeks october 10 2009 t-mobile announced personal information stored sidekick phones would permanently lost turned incorrect according financial times microsoft said data center acquired danger 18 months previously updated run microsoft technology company statement said mishap due confluence errors server failure hurt main backup databases supporting sidekick users t-mobile blamed microsoft loss data incident caused public loss confidence concept cloud computing plagued series outages data losses 2009 also problematic microsoft time trying convince corporate clients use cloud computing services azure phone october 14 2009 class action lawsuit launched microsoft t-mobile lawsuit alleged t-mobile microsoft promised safeguard important data customers possess apparently failed follow even basic data protection principles unthinkable day age class action lawsuit settled 2011 affected users compensated 35 t-mobile gift card 17.50 check payment 12 free downloadable items october 15 microsoft said able recover data would begin restore microsoft ceo steve ballmer disputed whether data loss instead describing outage ballmer said “ clear data loss however said incident good microsoft even data loss danger marketed application windows computers would back sidekick data onto user computer also allow changes made re-downloaded sidekick real-time users backup storage option able save data united states t-mobile marketed application one-time charge 10 immediately data restored users t-mobile incorporated sidekick storage website regular t-mobile backup site application user personal computer danger backup site t-mobile backup site could synchronized together | [
4194,
1083,
2589
] | None |
6,988 | 2 | Ftrace:ftrace ftrace abbreviated function tracer tracing framework linux kernel although original name function tracer came ftrace ability record information related various function calls performed kernel running ftrace tracing capabilities cover much broader range kernel internal operations various tracer plugins ftrace targeted different static tracepoints scheduling events interrupts memory-mapped i/o cpu power state transitions operations related file systems virtualization also dynamic tracking kernel function calls available optionally restrictable subset functions using globs possibility generate call graphs provide stack usage reports time ftrace used measure various latencies within linux kernel long interrupts preemption disabled ftrace-enabled linux kernel built enabling kernel configuration option entire runtime interaction ftrace performed readable writable virtual files contained specifically mounted debugfs file system result ftrace requires specialized userspace utilities operate however additional userspace utilities provide advanced features data recording analysis visualization examples utilities trace-cmd kernelshark internally ftrace relies gcc profiling mechanism prepend machine instructions compiled versions source-level kernel functions redirect execution functions ftrace trampolines tracer plugins perform actual tracing entry point instructions created gcc altered ftrace kernel booted varied later runtime ftrace nops actual jumps tracing trampolines depending tracing types options configured runtime ftrace developed primarily steven rostedt merged linux kernel mainline kernel version 2.6.27 released october 9 2008 | [
4616,
3082,
5139,
6675,
7187,
10776,
25,
10780,
4637,
10785,
9762,
10786,
6180,
5158,
7217,
8242,
9266,
9784,
10809,
576,
4161,
8772,
6213,
8268,
589,
593,
10333,
97,
6244,
5222,
10856,
8298,
4207,
7285,
9335,
2168,
1147,
5244,
3197,
4734... | None |
6,989 | 4 | Robert_Škulj:robert škulj robert škulj born 1975 slovenian hacker discovered security hole banking e-commerce system called klik year 2002 offered nlb bank sell exploit trojan horse designed empty victim account countermeasures bank reacted denouncing pressing charges illegal breaking systems charges soon dropped court škulj announced intends sue bank state seizing software discovered dead august 2003 apartment city tržič apparently committing suicide shooting death cloud suspicion looms boris floricic death | [
3473
] | None |
6,990 | 4 | Logparser:logparser logparser flexible command line utility initially written gabriele giuseppini microsoft employee automate tests iis logging intended use windows operating system included iis 6.0 resource kit tools default behavior logparser works like data processing pipeline taking sql expression command line outputting lines containing matches sql expression microsoft describes logparser powerful versatile tool provides universal query access text-based data log files xml files csv files well key data sources windows operating system event log registry file system active directory results input query custom-formatted text based output persisted specialty targets like sql syslog chart common use example selecting date time client username accessing aspx-files taken .log-files current directory | [
929,
6273,
6797,
10413,
7983,
4439,
7838,
479
] | None |
6,991 | 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 | [
4229,
4490,
7181,
11029,
10522,
543,
3366,
6694,
8621,
7983,
3770,
8640,
3407,
3792,
7384,
3676,
5085,
3428,
3813,
5612,
6257,
7921,
3828,
5749,
6389
] | Test |
6,992 | 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 | [
5472,
8998,
7817,
842,
7855,
4689,
3473,
8692,
4725,
5402,
5531,
5469,
5245
] | Validation |
6,993 | 5 | List_of_TCP_and_UDP_port_numbers:list tcp udp port numbers list tcp udp port numbers used protocols internet protocol suite operation network applications transmission control protocol tcp user datagram protocol udp needed one port full-duplex bidirectional traffic stream control transmission protocol sctp datagram congestion control protocol dccp also use port numbers usually use port numbers match services corresponding tcp udp implementation exist internet assigned numbers authority iana responsible maintaining official assignments port numbers specific uses however many unofficial uses well-known registered port numbers occur practice similarly many official assignments refer protocols never longer common use article lists port numbers associated protocols experienced significant uptake port numbers range 0 1023 0 2 − 1 well-known ports system ports used system processes provide widely used types network services unix-like operating systems process must execute superuser privileges able bind network socket ip address using one well-known ports range port numbers 1024 49151 2 2 2 − 1 registered ports assigned iana specific service upon application requesting entity systems registered ports used without superuser privileges range 49152–65535 2 2 2 − 1 contains dynamic private ports registered iana range used private customized services temporary purposes automatic allocation ephemeral ports | [
514,
2563,
10756,
521,
6153,
8204,
5647,
10255,
8211,
5652,
2581,
3094,
3610,
10271,
6689,
10274,
2084,
2085,
9764,
7208,
2601,
1579,
6700,
3118,
7214,
6704,
562,
4660,
8763,
3133,
1087,
64,
10816,
581,
7750,
1607,
8265,
7248,
8796,
10334... | None |
6,994 | 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 | [
512,
4992,
10752,
11269,
3334,
6919,
7562,
2062,
9231,
1301,
9749,
9877,
8728,
4633,
6556,
3869,
10012,
2335,
6047,
8226,
4516,
5031,
9128,
5803,
2225,
10547,
11255,
311,
2105,
7867,
6717,
4799,
5569,
6594,
8771,
4550,
7880,
8908,
205,
16... | Test |
6,995 | 2 | CyberGraphX:cybergraphx cybergraphx pronounced cybergraphics standard retargetable graphics api available amiga compatible systems developed thomas sontowski frank mariak later adopted phase5 use graphics cards many graphics card manufacturers offered hardware amiga compatible systems used well latest version cybergraphx v5 used morphos features include original cybergraphx software amigaos longer actively maintained cybergraphx v4 last release platform far aros implements cybergraphx v4 compatible api alternative rtg apis picasso 96 enhanced graphics system first used amigaos4 implements cybergraphx v4 api v5 extensions 2560×1600 running dual-link dvi example radeon 9650 256 mb | [
8832,
9249,
9762,
4387,
4581,
10570,
9848,
5743,
8369,
8114,
8115,
9236,
2197,
4567,
8120,
8700,
11487
] | None |
6,996 | 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 | [
1537,
8577,
3205,
11655,
9359,
1424,
529,
2449,
8083,
10770,
5143,
2072,
7063,
5274,
5019,
5659,
669,
8472,
10271,
11545,
4003,
4132,
6310,
167,
40,
3626,
5290,
10410,
10802,
7220,
821,
9909,
5175,
7866,
1083,
1728,
7617,
4291,
7877,
1005... | Test |
6,997 | 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 | [
9440,
1064,
6345,
842,
8554,
1580,
10924,
11112,
7983,
10705,
9939,
2292,
5397,
9909,
823,
381,
10271
] | Test |
6,998 | 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 | [
2465,
2658,
9509,
11208,
4171,
823,
6797,
7983,
1687,
1689,
3583
] | Test |
6,999 | 7 | ElasticHosts:elastichosts elastichosts computer service provider based london england founded provides cloud computing service provided ten data centres united kingdom two sites netherlands united states four sites canada hong kong australia elastichosts privately held competes public cloud-infrastructure providers amazon elastic compute cloud rackspace cloud according ceo richard davies company aims provide servers set similar possible one would provision dedicated hosting exception customer self-serve time elastichosts eu hosting data centres uk ireland first public cloud service built linux kernel-based virtual machine rather xen api given good review rest perspective charges resources cpu memory disk network separate entities allowing customers build virtual machines widely different characteristics instead simply categorized ones small medium large instances elastichosts therefore licensees supported directly boxgrinder included fedora 15 may 2011 elastichosts cloud servers available ten data centres san jose los angeles dallas miami maidenhead uk portsmouth uk amsterdam toronto hong kong sydney elastichosts persistent storage based local host store however 2012 announced solid-state drives ssd instance sizes use storage area network instead directly attached raid arrays iscsi interconnects hosts 2011 ceo predicted greater demand storage elastichosts two types ipv4 addresses static dynamic allocated pools addresses static addresses kept account allocated account server time dynamic ones randomly allocated server specifically allocated static ip address guaranteed remain though remain lifespan instance shutdown virtual machine may may reallocate ip address elastichosts lock static ip server instance reallocated control panel reverse dns managed customer control panel elastichosts announced 14 april 2014 addition maintaining traditional cloud vm business releasing alternate type server based linux running within containers implementation similar chroot bsd jails uses advanced linux kernel control groups feature company deemed mature enough use basis new type cloud server launched name elastic containers claiming world first terms virtualization company currently offers versions debian ubuntu centos though nature containers run host linux kernel containers new technology cgroups features first begun added linux kernel 2007 companies docker inc. producing software uses virtualize applications claimed first time iaas provider used technology full operating system use various press articles focused newly released pay go billing option whereby container optionally billed actual usage opposed fixed instance size 15 minute increments common industry standard 1 hour time blocks cloud server rentals particular ceo claim customers could save 50 traditional costs using service analysts expressed confidence container based systems future cloud providers given fiercely competitive nature cloud pricing days ’ hard see containers ’ become dominant mechanism delivering cloud services though others wondered whether would actually pull customers dominating players market owen rogers senior analyst digital economics 451 research noted though “ interesting unique ” model give elastichosts advantage ... rest market ... still based virtual machines can¹t see changing overnight ” wondered whether ... consumers really care elastichosts ’ detailed – arguably fairer – method pricing bigger competitors slashing prices elastichosts acquired paragon internet group april 2016 paragon acquired host europe group late 2015 host europe group acquired godaddy december 2016 meaning elastichosts ultimately subsidiary godaddy | [
4194,
39,
7863,
4429,
6999,
823,
8439,
2910
] | None |
7,000 | 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 | [
7847,
6797,
3856,
8976,
3571,
532
] | Test |
7,001 | 3 | Iris_WorkSpace:iris workspace iris workspace graphically organized iconic desktop environment allowed access irix file system along simplified system administration via system manager iris workspace used silicon graphics 4d1-3.0 irix 5.0 succeeded 1993 indigo magic desktop introduced irix 5.1 indy workstation | [
7234,
6243,
5380,
10051,
11447,
5898,
6858,
5356,
9932,
7311,
5523,
5076,
3764,
1398,
5272,
221,
7001,
1149
] | None |
7,002 | 3 | Socket_478:socket 478 socket 478 also known mpga478 mpga478b 478-contact cpu socket used intel pentium 4 celeron series cpus socket 478 launched northwood core compete amd 462-pin socket athlon xp processors socket 478 intended replacement socket 423 willamette-based processor socket market short time socket 478 phased launch lga 775 2004 socket 478 used northwood pentium 4 celeron processors supported first prescott pentium 4 processors willamette celerons along several willamette-series pentium 4s socket 478 also supported newer prescott-based celeron processors early pentium 4 extreme edition processors 2 mib l3 cpu cache celeron processors also available socket 478 last cpus made socket intel mobile cpus available 478-pin packages fact operate range slightly differing sockets socket 479 socket socket p incompatible two socket 478 used combination ddr sdram socket pentium 4 celeron following mechanical maximum load limits exceeded heatsink assembly shipping conditions standard use load limits crack processor die make unusable see list intel chipsets pentium 4 chipsets | [
3588,
5901,
5523,
2455,
3992,
8855,
11417,
3995,
4252,
6175,
7714,
10019,
4523,
2604,
2350,
6192,
9649,
3892,
4537,
7105,
4805,
7110,
8394,
3403,
4427,
4179,
3798,
4185,
9945,
11484,
9570,
10468,
613,
8552,
7657,
1260,
4717,
10734,
1776,
... | None |
7,003 | 5 | QOTD:qotd quote day qotd service member internet protocol suite defined rfc 865 indicated qotd concept predated specification qotd used mainframe sysadmins broadcast daily quote request user formally codified prior purposes well testing measurement purposes host may connect server supports qotd protocol either tcp udp port 17 keep quotes reasonable length rfc 865 specifies maximum 512 octets quote although sources indicate qotd service rarely enabled case often firewalled avoid 'pingpong attacks interest continues pre-existing purpose serving quotes seen web engine searches current testing measurement ip networks commonly done ping traceroute robust adaptations echo protocol rfc 862 predated attempt qotd standardization | [
10242,
3847,
649,
9868,
3218,
9365,
10005,
11413,
5402,
5531,
3742,
10271,
9380,
933,
2085,
3751,
3752,
8998,
9381,
10924,
562,
2996,
9909,
10171,
3133,
3006,
4797,
5181,
5437,
7364,
2887,
8265,
2509,
4687,
849,
6993,
5843,
2904,
5469,
54... | None |
7,004 | 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 | [
9677
] | Validation |
7,005 | 6 | ObjectiveFS:objectivefs objectivefs distributed file system developed objective security corp posix-compliant file system built object store backend initially released aws s3 backend later implemented support google cloud storage object store devices released beta early 2013 first version officially released august 11 2013 objectivefs implements log structured file system top object stores amazon s3 google cloud storage object store devices posix compliant file system supports features dynamic file system size soft hard links unix attributes extended attributes unix timestamps users permissions limit file size atomic renames atomic file creation directory renames read write anywhere file named pipes sockets etc implements client-side encryption uses nacl crypto library algorithms like salsa20 poly1305 approach n't data-dependent branches data-dependency array indices protects cache timing attacks data encrypted leaving client stays encrypted rest motion one main difference objectivefs glusterfs/cephfs offloads storage cluster management cloud providers amazon/google objectivefs software runs server talks object store using s3 api software handles metadata multiple servers sharing files handles negotiation sharing servers also running objectivefs use cases scaling web servers mail servers content management services cms hybrid cloud. hybrid development environment laptop cloud | [
3328,
3909,
2314,
7983,
823,
346,
2395
] | None |
7,006 | 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 | [
6656,
2273,
5798,
5802,
3596,
78,
8367,
785,
1778,
6801,
153
] | Test |
7,007 | 8 | Nespos:nespos nespos open source information platform pleistocene humans providing detailed information important sites analytical results archaeological findings selection literary quotes moreover repository archaeologists paleoanthropologists exchange research results ideas protected wiki-based collaboration platform continuously growing sample 3d scanned human fossils artefacts nespos developed eu-funded project tnt designed interactive online database containing long run available anthropological archaeological data related neanderthals e.g computed tomography ct 3d surface scans neanderthal fossils artefacts well additional data like scanned literature images tables tnt specific targeted research innovation project eu “ digicult ” program facilitates research preservation work europe ’ artistic cultural treasures using modern technology involved project art+com company interactive media technology berlin pxp software austria gmbh e-business company austria hasso-plattner institute potsdam germany royal belgian institute natural sciences brussels university poitiers france natural history museum croatia neanderthal museum mettmann national geographic germany using wiki-functionality nespos users able upload data add comments colleagues ’ entries metadata search provides efficient tool content retrieval addition software 3d 2d visualisation digitised finds well geographic information excavation sites integrated part system since march 2006 nespos open scientific community 2008 nespos underwent updating open kinds data human evolution data homo erectus homo heidelbergensis australopithecus africanus already uploaded another huge updating process started april 2009 nespos open user important 3d-datasets stored spezialed space entered scientific members society visicore suite nespos 3d applications conjoint visual simulation collaborative rendering engine visicore suite provides archaeological visualisation annotation tools two main components artecore artefact exploration collaboration rendering engine provides toolset real-time 2d 3d visualisation routines examination remains ‘ virtual high resolution-representations geocore site mapping rendering engine provides mapbased geo information system presenting exploring editing archaeological excavation data real-time 3d perspective | [] | None |
7,008 | 3 | List_of_x86_manufacturers:list x86 manufacturers x86-compatible processors designed manufactured sold number companies including past past past past | [
5088,
2788,
2506,
3883,
11405,
9137,
499,
3323,
6716
] | Test |
7,009 | 9 | Abstract-Type_and_Scheme-Definition_Language:abstract-type scheme-definition language asdl also common misspelling adsl abstract-type scheme-definition language asdl computer language developed part esprit project graspin basis generating language-based editors environments combines object-oriented type system syntax-directed translation schemes target-language interface | [
2065,
8262
] | None |
7,010 | 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 | [
929,
6651,
10238
] | Validation |
7,011 | 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 | [
7364,
6797,
7983
] | Train |
7,012 | 4 | SaferSurf:safersurf safersurf software product anonymous internet surfing aside offering web anonymity several features geolocation proxy service bypassing country restrictions safersurf runs centrally server n't need local installation safersurf created developed team nutzwerk german software company headquartered leipzig developing internet technologies obtained tüv certification 2005 2006 2007 2008 2009 tested wide range viruses false alarms safersurf provides various features safersurf released 2003 media praised speed hamburger abendblatt wrote surf ten times faster virus-free service offered company nutzwerk ... even slow modem connection data reaches goal faster ... pocket pc magazine wrote indeed assistance safersurf speed web pages display three times faster ... safersurf speed works independently isp internet connection standard modem isdn dsl mobile communications lan etc use media gave weight anonymity protection bild computer magazine tested several web anonymity programs cited reliable anonymization among advantages safersurf year macworld praised spam-filtering service | [
8998,
5612,
7983,
4725,
3643,
5818,
7515,
7965
] | None |
7,013 | 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 | [
1890,
2059,
3127
] | Train |
7,014 | 3 | List_of_songs_in_SingStar_games_(PlayStation_2):list songs singstar games playstation 2 following list singstar games released playstation 2 video game console tables list songs available game country availability indicated two-letter country codes games localised multiple markets songs either indicated present yes absent track list region first game series singstar released europe oceania 2004. twenty games singstar series released english-speaking territories including small number north america singstar games loosely based upon musical genres rock pop music singstar rocks singstar pop respectively artist-specific singstar games released featuring artists abba queen take die toten hosen kent mecano non-english releases table tracklist uk non-english releases tracklist uk releases tracklist uk releases tracklist uk australian new zealand game singstar catalogues | [
10316
] | None |
7,015 | 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 | [
9166,
9006
] | Test |
7,016 | 1 | Biometrics_use_by_the_South_African_government:biometrics use south african government biometric part attempts reduce incidences fraud corruption well deliver efficient services citizens south african government embarking program employing biometric identification systems certain programs instances south african government started implementing biometrics program following departments department agriculture head office pretoria identified need implement stringent system control mechanisms including financial system logging onto secure applications logging onto staff members personal workstations department applied strict password management policy different systems finance persal government standard salary payment system leave performance management etc regulated constant changing passwords resulted forgotten passwords lock-outs employees sitting next access one another passwords resulted downtime administrative burden staff pressing concerns increased opportunity costs also noticed unauthorized individuals after-hours access facilities department implemented fingerprint biometric reader computers eliminated passwords altogether furthermore readers also installed key access control points meant staff could n't log machines n't first gain access control points also meant staff could regulated hours supposed working allowed work system automatically logged computer 'clocked work area meant less wastage stricter security thus implementation biometric system ensures superior security measures ease use centralized databank access control information fact staff n't need carry access control instruments work except fingers part strive increase security reduce corruption within facilities department correctional services launched biometric security system august 2006 system included fingerprint access closed circuit television systems turnstile gates department recognized system would effective staff members would fully committed well-trained operating system included proactive monitoring form risk well acting promptly breach security take place system grounded principle fail-over case power loss unforeseen circumstances would switch fully functioning secondary site future foreseen improvements system include closed circuit television monitoring individual cell amongst others south africa approximately 48 million citizens one requires government-issued official identification booklet proof identity document needed public services also everyday actions renting dvd opening bank store account document based secure form identification individual fingerprint need undeniable process time consuming paper based resulted government archives contain 45 million paper files home affairs national identification system project known hanis implemented move away paper system would hanis replace existing system world class digital database also ensure real time processing verification accessibility every new existing fingerprint nec automatic fingerprint identification system afis selected offer solution south african government needed fingerprint recognition technologies host accuracy rate 99.9 system works fast process many 70,000 searches one day allows hanis produce largest citizen identification database world department home affairs however faced quite number challenges ensure successful complete implementation project data integrity compromised duplicated and/or missing data elements data inconsistency lack security around data stores led fraud corruption furthers contaminated data integrity relational linkages formalised different data-stores npr hanis edms shows little relational integrity immigration data stores based expired light-weight pc based technologies immigration visitor data shows integrated cohesive structure segmented data stores refugees deportation asylum seekers visitors visas movement control department working address issues benefits sight however paperless environment shorter queues reduction bureaucratic delays accuracy system dramatically reduce possibility identity theft fraud south african police service saps implemented biometric system 2001 secure integrated justice system ijs finger- palm prints convicted criminals captured automated fingerprint identification system afis – database used identity management idm used monitor criminals well track wanted criminals portable readers powered sagem morphotouch rapid technology used roadblocks around country identify wanted criminals bring justice afis implemented ideco group also completed hanis system discussed additional uses biometrics police services fingerprint readers fake fingerprint detection functionality access control departments secure sensitive information e.g forensic laboratories stolen vehicle departments etc. fingerprints also used sole method criminal record background checks commercial purposes – use name surname identification number much potential abuse system failure led much fraud full set fingerprints required criminal record check done individual companies want make use service called afiswitch enrolled afis service significantly faster turnaround time 48 hours opposed weeks traditional system checking criminal records south africa social assistance program government largest poverty alleviation intervention budget allocation approximately r100 billion provides social grants 15,8 million beneficiaries reduce levels deprivation enable participate economy budget vote speech 2 may 2012 minister social development bathabile dlamini conceded south african social security agency sassa incomplete information beneficiary details social grant system prone fraud misappropriation funds country social assistance touches high proportion citizens incorporates dealing enormous monetary amounts fraud misappropriation funds slap face truly need tolerated part strategy address problem sassa announced social assistance beneficiaries re-registered biometric enrollment system following enrollment biometric system analyse physical behavioural traits fingerprints iris face voice hand geometry verify identity beneficiary system allow effective authentication beneficiaries drastically reduce opportunities fraud sassa process implementing system phase 1 already completed biometric identification systems however fool proof accurately functioning systems rely two fundamental premises – permanence uniqueness relevant biometric trait certain furthermore may problems extracting biometric traits – example system environmental problems recent years significant growth biometric research resulted advancements field accurate cost effective secure robust biometric systems developed – hoped allow effective implementation system sassa main reasons implementing biometrics system south african government seem eradication crime corruption enhancing service delivery citizens country problems faced expected poor infrastructure lack funds perseverance however government able succeed efforts becoming effective use biometrics | [
2737,
3450,
10165,
10207
] | None |
7,017 | 5 | TCP_congestion_control:tcp congestion control transmission control protocol tcp uses network congestion-avoidance algorithm includes various aspects additive increase/multiplicative decrease aimd scheme schemes slow start congestion window achieve congestion avoidance tcp congestion-avoidance algorithm primary basis congestion control internet per end-to-end principle congestion control largely function internet hosts network several variations versions algorithm implemented protocol stacks operating systems computers connect internet avoid congestive collapse tcp uses multi-faceted congestion-control strategy connection tcp maintains congestion window limiting total number unacknowledged packets may transit end-to-end somewhat analogous tcp sliding window used flow control tcp uses mechanism called slow start increase congestion window connection initialized timeout starts window small multiple maximum segment size mss size although initial rate low rate increase rapid every packet acknowledged congestion window increases 1 mss congestion window effectively doubles every round-trip time rtt congestion window exceeds slow-start threshold ssthresh algorithm enters new state called congestion avoidance congestion avoidance state long non-duplicate acks received congestion window additively increased one mss every round-trip time tcp congestion window one factors determines number bytes outstanding time congestion window maintained sender note confused sliding window size maintained receiver congestion window means stopping link sender receiver becoming overloaded much traffic calculated estimating much congestion link connection set congestion window value maintained independently host set small multiple mss allowed connection variance congestion window dictated aimd approach means segments received acknowledgments reach sender time constant added window size window reaches ssthresh congestion window increases linearly rate 1/ congestion window segment new acknowledgement received window keeps growing timeout occurs timeout system administrator may adjust maximum window size limit adjust constant added additive increase part tcp tuning flow data tcp connection also controlled use receive window advertised receiver comparing congestion window receive window sender determine much data may send given time slow start part congestion control strategy used tcp conjunction algorithms avoid sending data network capable forwarding avoid causing network congestion algorithm specified rfc 5681 although strategy referred slow start congestion window growth quite aggressive aggressive congestion avoidance phase slow start introduced tcp initial pre-congestion avoidance phase even faster slow start begins initially congestion window size cwnd 1 2 4 10 mss value congestion window size increased one acknowledgement ack received effectively doubling window size round-trip time transmission rate increased slow-start algorithm either loss detected receiver advertised window rwnd limiting factor ssthresh reached loss event occurs tcp assumes due network congestion takes steps reduce offered load network measurements depend exact tcp congestion avoidance algorithm used ssthresh reached tcp changes slow-start algorithm linear growth congestion avoidance algorithm point window increased 1 segment round-trip delay time rtt slow start assumes unacknowledged segments due network congestion acceptable assumption many networks segments may lost reasons poor data link layer transmission quality thus slow start perform poorly situations poor reception wireless networks slow start protocol also performs badly short-lived connections older web browsers would create many consecutive short-lived connections web server would open close connection file requested kept connections slow start mode resulted poor response time avoid problem modern browsers either open multiple connections simultaneously reuse one connection files requested particular web server connections however reused multiple third-party servers used web sites implement web advertising sharing features social networking services counter scripts web analytics additive increase/multiplicative decrease aimd algorithm closed-loop control algorithm aimd combines linear growth congestion window exponential reduction congestion takes place multiple flows using aimd congestion control eventually converge use equal amounts contended link fast retransmit enhancement tcp reduces time sender waits retransmitting lost segment tcp sender normally uses simple timer recognize lost segments acknowledgement received particular segment within specified time function estimated round-trip delay time sender assume segment lost network retransmit segment duplicate acknowledgement basis fast retransmit mechanism receiving packet e.g sequence number 1 receiver sends acknowledgement adding 1 sequence number i.e acknowledgement number 2 indicates sender receiver received packet number 1 expects packet number 2 suppose three subsequent packets lost next packets receiver sees packet numbers 5 6 receiving packet number 5 receiver sends acknowledgement still sequence number 2 receiver receives packet number 6 sends yet another acknowledgement value 2 duplicate acknowledgement occurs sender receives one acknowledgement sequence number 2 example sender receives several duplicate acknowledgements reasonably confident segment next higher sequence number dropped sender fast retransmit retransmit packet immediately without waiting timeout naming convention algorithms may originated 1996 paper kevin fall sally floyd following one possible classification according following properties well-known congestion avoidance mechanisms classified scheme follows tcp tahoe reno algorithms retrospectively named 4.3bsd operating system june 1986 first appeared named lake tahoe nearby city reno nevada tahoe algorithm first appeared 4.3bsd-tahoe made support cci power 6/32 tahoe minicomputer made available non-at licensees part 4.3bsd networking release 1 ensured wide distribution implementation improvements made 4.3bsd-reno subsequently released public networking release 2 later 4.4bsd-lite consider retransmission timeout rto duplicate acks packet loss events behavior tahoe reno differ primarily react duplicate acks tahoe reno ack times rto timeout slow start used algorithms reduce congestion window 1 mss mid-1990s tcp set timeouts measured round-trip delays based upon last transmitted packet transmit buffer university arizona researchers larry peterson lawrence brakmo introduced tcp vegas named largest nevada city timeouts set round-trip delays measured every packet transmit buffer addition tcp vegas uses additive increases congestion window comparison study various tcp congestion control algorithms tcp vegas appeared smoothest followed tcp cubic tcp vegas widely deployed outside peterson laboratory selected default congestion control method dd-wrt firmware v24 sp2 tcp new reno defined rfc 6582 obsoletes previous definitions rfc 3782 rfc 2582 improves retransmission fast-recovery phase tcp reno fast recovery every duplicate ack returned tcp new reno new unsent packet end congestion window sent keep transmit window full every ack makes partial progress sequence space sender assumes ack points new hole next packet beyond acked sequence number sent timeout timer reset whenever progress transmit buffer allows new reno fill large holes multiple holes sequence space much like tcp sack new reno send new packets end congestion window fast recovery high throughput maintained hole-filling process even multiple holes multiple packets tcp enters fast recovery records highest outstanding unacknowledged packet sequence number sequence number acknowledged tcp returns congestion avoidance state problem occurs new reno packet losses instead packets reordered 3 packet sequence numbers happens new reno mistakenly enters fast recovery reordered packet delivered ack sequence-number progress occurs end fast recovery every bit sequence-number progress produces duplicate needless retransmission immediately acked new reno performs well sack low packet error rates substantially outperforms reno high error rates tcp hybla aims eliminate penalization tcp connections incorporate high-latency terrestrial satellite radio link due longer round-trip times stems analytical evaluation congestion window dynamics suggests necessary modifications remove performance dependence rtt binary increase congestion control implementation tcp optimized congestion control algorithm high speed networks high latency called lfn long fat networks rfc 1072 bic used default linux kernels 2.6.8 2.6.18 cubic less aggressive systematic derivative bic window cubic function time since last congestion event inflection point set window prior event cubic used default linux kernels versions 2.6.19 3.2 agile-sd linux-based congestion control algorithm cca designed real linux kernel receiver-side algorithm employs loss-based approach using novel mechanism called agility factor af proposed mohamed a. alrshah et al increase bandwidth utilization high-speed short-distance networks low-bdp networks local area networks fiber-optic network especially applied buffer size small evaluated comparing performance compound-tcp default cca ms windows cubic default linux using ns-2 simulator improves total performance 55 term average throughput westwood+ sender-side modification tcp reno protocol stack optimizes performance tcp congestion control wireline wireless networks tcp westwood+ based end-to-end bandwidth estimation set congestion window slow start threshold congestion episode three duplicate acknowledgments timeout bandwidth estimated properly low-pass filtering rate returning acknowledgment packets rationale strategy simple contrast tcp reno blindly halves congestion window three duplicate acks tcp westwood+ adaptively sets slow start threshold congestion window takes account bandwidth used time congestion experienced tcp westwood+ significantly increases throughput wireless links fairness compared tcp reno/new reno wired networks compound tcp microsoft implementation tcp maintains two different congestion windows simultaneously goal achieving good performance lfns impairing fairness widely deployed windows versions since microsoft windows vista windows server 2008 ported older microsoft windows versions well linux tcp proportional rate reduction prr algorithm designed improve accuracy data sent recovery algorithm ensures window size recovery close possible slow start threshold tests performed google prr resulted 3–10 reduction average latency recovery timeouts reduced 5 prr available linux kernels since version 3.2 bottleneck bandwidth round-trip propagation time bbr tcp congestion control algorithm developed google 2016 congestion control algorithms loss-based rely packet loss signal lower rates transmission bbr like vegas model-based algorithm uses maximum bandwidth round-trip time network delivered recent flight outbound data packets build explicit model network cumulative selective acknowledgment packet delivery produces rate sample records amount data delivered time interval transmission data packet acknowledgment packet network interface controllers evolve megabit per second gigabit per second performance latency associated bufferbloat instead packet loss becomes reliable marker maximum throughput making latency/model-based congestion control algorithms provide higher throughput lower latency bbr reliable alternative popular loss-based algorithms like cubic implemented within youtube bbr yielded average 4 higher network throughput 14 countries bbr also available quic available linux tcp since linux 4.9 bbr efficient fast fairness non-bbr streams disputed google presentation shows bbr co-existing well cubic researchers like geoff huston hock bless zitterbart finds unfair streams scalable hock et al also found severe inherent issues increased queuing delays unfairness massive packet loss bbr implementation linux 4.9 soheil abbasloo et al authors c2tcp show bbr n't perform well dynamic environments cellular networks also shown bbr unfairness issue instance cubic flow default tcp implementation linux android macos coexists bbr flow network bbr flow dominate cubic flow get whole link bandwidth see figure 18 cellular controlled delay tcp c2tcp motivated lack flexible end-to-end tcp approach satisfy various qos requirements different applications without requiring changes network devices c2tcp aims satisfy ultra-low latency high bandwidth requirements applications virtual reality video conferencing online gaming vehicular communication systems etc highly dynamic environment current lte future 5g cellular networks c2tcp works add-on top loss-based tcp e.g reno newreno cubic bic ... makes average delay packets bounded desired delays set applications researchers nyu showed c2tcp outperforms delay/jitter performance various state-of-the-art tcp schemes instance showed compared bbr cubic westwood average c2tcp decreases average delay packets 250 900 700 respectively various cellular network environments c2tcp required installed server-side elastic-tcp proposed february 2019 mohamed a. alrshah et al increase bandwidth utilization high-bdp networks support recent applications cloud computing big data transfer iot etc linux-based congestion control algorithm cca designed linux kernel receiver-side algorithm employs loss-delay-based approach using novel mechanism called window-correlated weighting function wwf high level elasticity deal different network characteristics without need human tuning evaluated comparing performance compound-tcp default cca ms windows cubic default linux tcp-bbr default linux 4.9 google using ns-2 simulator testbed elastic-tcp significantly improves total performance term average throughput loss ratio delay recently soheil abbasloo et al proposed natcp network-assisted tcp controversial tcp design targeting mobile edge networks mec key idea natcp characteristics network known beforehand tcp would designed better way therefore natcp employs available features properties current mec-based cellular architectures push performance tcp close optimal performance natcp uses out-of-band feedback network servers located nearby feedback network includes capacity cellular access link minimum rtt network guides servers adjust sending rates preliminary results show natcp outperforms state-of-the-art tcp schemes least achieving 2x higher power defined gained throughput/delay natcp replaces traditional tcp scheme sender deal backward compatibility issue proposed another version called nacubic using nacubic sender use arbitrary tcp schemes however nacubic employs feedback received enforce cap final congestion window required tcp new reno commonly implemented algorithm sack support common extension reno/new reno others competing proposals still need evaluation starting 2.6.8 linux kernel switched default implementation new reno bic default implementation changed cubic 2.6.19 version freebsd uses new reno default algorithm however supports number choices per-flow product bandwidth latency increases regardless queuing scheme tcp becomes inefficient prone instability becomes increasingly important internet evolves incorporate high-bandwidth optical links tcp interactive itcp allows applications subscribe tcp events respond accordingly enabling various functional extensions tcp outside tcp layer tcp congestion schemes work internally itcp additionally enables advanced applications directly participate congestion control control source generation rate zeta-tcp detects congestions latency loss rate measures applies different congestion window backoff strategies based likelihood congestions maximize goodput also couple improvements accurately detect packet losses avoiding retransmission timeout retransmission accelerate/control inbound download traffic congestion control algorithms classified relation network awareness meaning extent algorithms aware state network consist three primary categories black box grey box green box black box algorithms offer blind methods congestion control operate binary feedback received upon congestion assume knowledge concerning state networks manage grey box algorithms use time-instances order obtain measurements estimations bandwidth flow contention knowledge network conditions green box algorithms offer bimodal methods congestion control measures fair-share total bandwidth allocated flow point system execution following algorithms require custom fields added tcp packet structure | [
10115,
5,
1541,
10124,
23,
10653,
2079,
10147,
1835,
10924,
941,
7983,
6576,
823,
7865,
5817,
5181,
3006,
9021,
718,
5071,
3551,
3813,
2934,
6524,
4095
] | None |
7,018 | 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 | [
9734,
10901,
2710,
6935,
1049,
9762,
5414,
5677,
10413,
8122,
5956,
1607,
2253,
2386,
3413,
9301,
11353,
9441,
10465,
11361,
10341,
8554,
5612,
2804,
7935
] | Test |
7,019 | 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 | [
8474,
1946,
4134,
11067,
3904,
577,
1349,
6982,
7237,
7622,
10953,
8524,
9166,
6993,
11604,
11228,
7646,
488,
7144,
11112,
4331,
10862,
9455,
5492,
5239,
2045
] | Train |
7,020 | 2 | Zorin_OS:zorin os zorin os personal computer operating system based ubuntu marketed operating system designed users new linux-based computer systems one operating system built-in features allows users change interface resemble microsoft windows mac os x also comes bundled wine playonlinux allowing users run windows software ease transition gaming zorin os creators distribute different versions operating system three versions ultimate education business version purchase current releases zorin os 15 ultimate zorin os 15 core new editions continue use debian-based linux kernel gnome interface zorin os fully graphical along graphical installer zorin os follows long-term releases main ubuntu system stability security zorin os comes repositories historically ubuntu repositories well zorin os ubuntu-based linux distribution distribution aims user-friendly fully compatible ubuntu base zorin os initially released 12.x series last version zorin os required users clean install 12.4 since able upgrade normal via systems update manager gnome lxde currently official desktop environments lxde tend used mainly lite editions desktop environments also available install repos due ubuntu-based zorin os like ubuntu-counterpart comes default uncomplicated firewall though enabled default zorin os praised intuitive familiar layouts functionality installation process | [
4611,
3079,
3089,
4113,
6675,
7187,
8209,
8727,
10776,
25,
10780,
4637,
543,
11297,
3618,
9762,
7204,
9253,
5158,
11305,
5165,
7217,
56,
3129,
4153,
59,
8248,
9276,
9784,
10809,
576,
4673,
10817,
3654,
5190,
8262,
3147,
2125,
1107,
1110,
... | None |
7,021 | 7 | Multi-simulation_coordinator:multi-simulation coordinator music multi-simulation coordinator software developed released incf royal institute technology kth school computer science communication stockholm sweden music designed interconnecting large scale neuronal network simulators either tools allows spike events continuous time series communicated applications cluster computer typical usage cases connecting models developed different simulators connecting parallel simulator post-processing tool music provides standardized software interface api top message-passing interface mpi communication among parallel applications large-scale computational neuroscience simulations enables transfer massive amounts event information continuous values one parallel application another including using different data allocation strategies design standard interface care taken allow easy adaptation existing simulators permit third-party development community-sharing reusable interoperable software tools parallel processing three simulators currently music interfaces moose neuron nest music software library documentation publicly available incf software center | [] | None |
7,022 | 1 | MySQL:mysql mysql s-q-l open-source relational database management system rdbms name combination name co-founder michael widenius daughter sql abbreviation structured query language mysql free open-source software terms gnu general public license also available variety proprietary licenses mysql owned sponsored swedish company mysql ab bought sun microsystems oracle corporation 2010 oracle acquired sun widenius forked open-source mysql project create mariadb mysql component lamp web application software stack others acronym linux apache mysql perl/php/python mysql used many database-driven web applications including drupal joomla phpbb wordpress mysql also used many popular websites including facebook flickr mediawiki twitter youtube mysql written c c++ sql parser written yacc uses home-brewed lexical analyzer mysql works many system platforms including aix bsdi freebsd hp-ux ecomstation i5/os irix linux macos microsoft windows netbsd novell netware openbsd opensolaris os/2 warp qnx oracle solaris symbian sunos sco openserver sco unixware sanos tru64 port mysql openvms also exists mysql server software client libraries use dual-licensing distribution offered gpl version 2 proprietary license support obtained official manual free support additionally available different irc channels forums oracle offers paid support via mysql enterprise products differ scope services price additionally number third party organisations exist provide support services including mariadb percona mysql received positive reviews reviewers noticed performs extremely well average case developer interfaces documentation mention feedback real world via web sites like good also tested fast stable true multi-user multi-threaded sql database server mysql created swedish company mysql ab founded david axmark allan larsson michael monty widenius original development mysql widenius axmark began 1994 first version mysql appeared 23 may 1995 initially created personal usage msql based low-level language isam creators considered slow inflexible created new sql interface keeping api msql keeping api consistent msql system many developers able use mysql instead proprietarily licensed msql antecedent additional milestones mysql development included work version 6 stopped sun microsystems acquisition mysql cluster product uses version 7 decision made jump version 8 next major version number 15 june 2001 nusphere sued mysql ab tcx datakonsult ab original authors michael monty widenius david axmark u.s district court boston breach contract tortious interference third party contracts relationships unfair competition 2002 mysql ab sued progress nusphere copyright trademark infringement united states district court nusphere allegedly violated mysql ab copyright linking mysql gpl'ed code nusphere gemini table without compliance license preliminary hearing judge patti saris 27 february 2002 parties entered settlement talks eventually settled hearing fsf commented judge saris made clear sees gnu gpl enforceable binding license october 2005 oracle corporation acquired innobase oy finnish company developed third-party innodb storage engine allows mysql provide functionality transactions foreign keys acquisition oracle press release mentioned contracts make company software available mysql ab would due renewal presumably renegotiation time 2006 mysql users conference april 2006 mysql ab issued press release confirmed mysql ab innobase oy agreed multi-year extension licensing agreement february 2006 oracle corporation acquired sleepycat software makers berkeley db database engine providing basis another mysql storage engine little effect berkeley db widely used dropped due lack use mysql 5.1.12 pre-ga release mysql 5.1 released october 2006 january 2008 sun microsystems bought mysql ab 1 billion april 2009 oracle corporation entered agreement purchase sun microsystems owners mysql copyright trademark sun board directors unanimously approved deal also approved sun shareholders u.s. government 20 august 2009 14 december 2009 oracle pledged continue enhance mysql done previous four years movement oracle acquisition mysql ab save mysql oracle started one mysql ab founders monty widenius petition 50,000+ developers users called upon european commission block approval acquisition time free software opinion leaders including pamela jones groklaw jan wildeboer carlo piana also acted co-counsel merger regulation procedure advocated unconditional approval merger part negotiations european commission oracle committed mysql server continue least 2015 use dual-licensing strategy long used mysql ab proprietary gpl versions available antitrust eu pressuring divest mysql condition approval merger revealed wikileaks us department justice request oracle pressured eu approve merger unconditionally european commission eventually unconditionally approved oracle acquisition mysql ab 21 january 2010 january 2010 oracle acquisition mysql ab monty widenius started gpl-only fork mariadb mariadb based code base mysql server 5.5 aims maintain compatibility oracle-provided versions mysql offered two different editions open source mysql community server proprietary enterprise server mysql enterprise server differentiated series proprietary extensions install server plugins otherwise shares version numbering system built code base major features available mysql 5.6 developers release minor updates mysql server approximately every two months sources obtained mysql website mysql github repository gpl license using storage engines default innodb mysql comply full sql standard implemented functionality including foreign key references check constraints parsed ignored storage engines mysql version 8.0.15 mysql 5.7 triggers limited one per action timing meaning one trigger defined executed insert operation one insert table triggers defined views mysql database inbuilt functions like unix_timestamp return 0 03:14:07 utc 19 january 2038 recently attempt solve problem assigned internal queue mysql built installed manually source code commonly installed binary package unless special customizations required linux distributions package management system download install mysql minimal effort though configuration often required adjust security optimization settings though mysql began low-end alternative powerful proprietary databases gradually evolved support higher-scale needs well still commonly used small medium scale single-server deployments either component lamp-based web application standalone database server much mysql appeal originates relative simplicity ease use enabled ecosystem open source tools phpmyadmin medium range mysql scaled deploying powerful hardware multi-processor server gigabytes memory however limits far performance scale single server 'scaling larger scales multi-server mysql 'scaling deployments required provide improved performance reliability typical high-end configuration include powerful master database handles data write operations replicated multiple slaves handle read operations master server continually pushes binlog events connected slaves event failure slave promoted become new master minimizing downtime improvements performance achieved caching results database queries memory using memcached breaking database smaller chunks called shards spread across number distributed server clusters logical backup tool included community enterprise editions mysql supports backing storage engines mysql enterprise backup hot backup utility included part mysql enterprise subscription oracle offering native innodb hot backup well backup storage engines oracle mysql offers high availability solution mix tools including mysql router mysql shell based group replication open source tools mariadb offers similar offer terms products mysql also run cloud computing platforms microsoft azure amazon ec2 oracle cloud infrastructure common deployment models mysql cloud graphical user interface gui type interface allows users interact electronic devices programs graphical icons visual indicators secondary notation opposed text-based interfaces typed command labels text navigation guis easier learn command-line interfaces clis require commands typed keyboard third-party proprietary free graphical administration applications front ends available integrate mysql enable users work database structure data visually well-known front ends command-line interface means interacting computer program user issues commands program typing successive lines text command lines mysql ships many command line tools main interface client mysql utilities set utilities designed perform common maintenance administrative tasks originally included part mysql workbench utilities stand-alone download available oracle percona toolkit cross-platform toolkit mysql developed perl percona toolkit used prove replication working correctly fix corrupted data automate repetitive tasks speed servers percona toolkit included several linux distributions centos debian packages available fedora ubuntu well percona toolkit originally developed maatkit late 2011 maatkit longer developed mysql shell tool interactive use administration mysql database supports javascript python sql modes used administration access purposes many programming languages language-specific apis include libraries accessing mysql databases include mysql connector/net integration microsoft visual studio languages c vb commonly used jdbc driver java addition odbc interface called mysql connector/odbc allows additional programming languages support odbc interface communicate mysql database asp coldfusion htsql url-based query method also ships mysql adapter allowing direct interaction mysql database web client via structured urls drivers exists languages like python node.js variety mysql forks exist including following | [
9729,
1539,
5635,
8195,
9731,
11268,
3080,
5640,
1546,
1035,
6153,
1549,
10254,
2064,
10258,
4116,
11284,
6166,
10262,
3096,
8217,
9243,
546,
10276,
5669,
10789,
10791,
1579,
4140,
5677,
10286,
11309,
3636,
1594,
3131,
5691,
6721,
8262,
928... | None |
7,023 | 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 | [
577,
4932,
2469,
2633,
1773,
9006,
2383,
4527,
6096,
3346,
5436
] | Test |
7,024 | 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 | [
5389,
9688,
7515,
4348,
10392
] | Test |
7,025 | 4 | Martin_Roesch:martin roesch martin roesch founded sourcefire 2001 served chief technology officer company acquired cisco systems october 7 2013 roesch serves vice president chief architect cisco ’ security business group respected authority intrusion prevention detection technology forensics responsible technical direction product development efforts martin industry experience network security embedded systems engineering also author lead developer snort intrusion prevention detection system forms foundation sourcefire 3d system martin developed various network security tools technologies including intrusion prevention detection systems honeypots network scanners policy enforcement systems organizations gte internetworking stanford telecommunications inc. united states department defense martin interviewed industry expert multiple technology publications well print online news services msnbc wall street journal cnet zdnet scientific american also interviewed several books network intrusion detection analysts handbook intrusion signatures analysis maximum security hacking exposed others 2006 martin named one informationweek 18 innovators influencers one tech council maryland influential ctos maryland martin also recipient 2004 infoworld heroes innovator award well winning 2004 40 40 award baltimore business journal martin holds b.s electrical computer engineering clarkson university also author daemonlogger | [
6834,
3486
] | None |
7,026 | 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 | [
9345,
1591,
1343,
8262,
9482,
5612,
5677,
7983,
5872,
3573,
5399,
5945,
9245,
5567
] | Test |
7,027 | 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 | [
10761,
10257,
7187,
8727,
4123,
4636,
3618,
1071,
9784,
5177,
8262,
8266,
5710,
593,
7249,
9306,
607,
3685,
9324,
8816,
9844,
9343,
2180,
11410,
2212,
684,
3248,
1718,
5819,
9407,
11459,
9927,
8395,
8909,
6864,
10455,
6361,
8410,
6371,
53... | Test |
7,028 | 8 | So-net:so-net | [
10368,
643,
9091,
3077,
10761,
6799,
9508,
6311,
9512,
684,
9137,
306,
1587,
1091,
9543,
6732,
10316,
6738,
6873,
859,
4060,
607,
359,
8937,
3824,
5746,
7801,
8316,
6781
] | Test |
7,029 | 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 | [
10080,
6940,
9063,
8937,
6539,
3948,
7029,
11254,
10330,
2492,
8413
] | Test |
7,030 | 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 | [
174,
10835,
8344,
7804,
2558
] | Test |
7,031 | 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 | [
774,
6548,
11413,
5402,
5405,
3486,
2084,
3750,
8998,
939,
10924,
10413,
7983,
1200,
2739,
9146,
1474,
7364,
10437,
11464,
6993,
979,
4956,
10332,
11486,
2409,
8692,
4725,
5113,
2041,
5245,
2430
] | Test |
7,032 | 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 | [
4614,
6664,
11539,
9881,
5677,
8494,
7983,
11059,
4151,
10040,
1864,
4553,
5840,
9300,
10590,
7776,
8037,
8301,
2804,
3062,
3960
] | Test |
7,033 | 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 | [
7173,
9739,
2066,
7699,
5655,
10779,
10781,
6181,
8231,
3630,
6705,
7218,
2623,
2113,
7234,
3142,
2638,
1122,
3175,
8815,
630,
8822,
6268,
3197,
7313,
6815,
8352,
5793,
6818,
6821,
7852,
9391,
2224,
2226,
7858,
9911,
8890,
4286,
2241,
224... | Test |
7,034 | 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 | [
7556,
2567,
3084,
2957,
7056,
3345,
658,
660,
1173,
1941,
4128,
4389,
10662,
169,
11185,
8627,
8628,
2357,
10806,
1847,
9528,
2110,
9541,
10315,
6863,
8273,
7635,
212,
9556,
10963,
11349,
2265,
7643,
9697,
8674,
229,
618,
1898,
881,
1654,... | Test |
7,035 | 4 | Sucuri:sucuri sucuri company started daniel cid 2010 founder ossec project early premise sucuri provide webmasters tool provides visibility state security websites 2010 sucuri became private llc delaware dre armeda invited co-founder 2011 tony perez joined team third co-founder sucuri acquired godaddy march 2017 sucuri globally distributed company 100 employees across 27 different countries | [
64,
899,
1994,
331,
11407,
186,
5407
] | None |
7,036 | 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 | [
1664,
9986,
3465,
9747,
11418,
9642,
7983,
1075,
2101,
9909,
576,
3015,
10956,
7255,
6231,
10470,
9451,
10861,
8303,
9459,
3578,
8443
] | Validation |
7,037 | 4 | Distributed_denial-of-service_attacks_on_root_nameservers:distributed denial-of-service attacks root nameservers distributed denial-of-service attacks root nameservers internet events distributed denial-of-service attacks target one thirteen domain name system root nameserver clusters root nameservers critical infrastructure components internet mapping domain names ip addresses resource record rr data attacks root nameservers could theory impact operation entire global domain name system thus internet services use global dns rather specific websites however practice root nameserver infrastructure highly resilient distributed using inherent features dns result caching retries multiple servers zone fallback one fail recent years combination anycast load balancer techniques used implement thirteen nominal individual root servers globally distributed clusters servers multiple data centers particular caching redundancy features dns mean would require sustained outage major root servers many days serious problems created internet users even still numerous ways isps could set systems period mitigate even total loss root servers extended period time example installing copies global dns root zone data nameservers within network redirecting traffic root server ip addresses servers nevertheless ddos attacks root zone taken seriously risk operators root nameservers continue upgrade capacity ddos mitigation capabilities infrastructure resist future attacks effective attack dns might involve targeting top-level domain servers servicing .com domain instead root name servers alternatively man-in-the-middle attack dns poisoning attack could used though would difficult carry october 21 2002 attack lasting approximately one hour targeted 13 dns root name servers attackers sent many icmp ping packets using botnet servers however servers protected packet filters configured block incoming icmp ping packets sustain much damage little impact internet users february 6 2007 attack began 10:00 utc lasted twenty-four hours least two root servers g-root l-root reportedly suffered badly two others f-root m-root experienced heavy traffic latter two servers largely contained damage distributing requests root server instances anycast addressing icann published formal analysis shortly event due lack detail speculation incident proliferated press details released two intervals november 30 2015 december 1 2015 several root name servers received 5 million queries per second receiving valid queries single undisclosed domain name different domain next day source addresses spread throughout ipv4 space however may spoofed root server networks became saturated resulting timeouts however redundancy among root servers prevented downstream issues occurring incident february 12 2012 statement posted pastebin cited anonymous threatening attack root servers march 31 2012 protest sopa wallstreet irresponsible leaders beloved bankers starving world selfish needs sheer sadistic fun march 31 anonymous shut internet reads statement remember protest trying ‘ kill internet temporarily shutting hurts most…it may last one hour maybe maybe even days matter global known | [
6080,
2887,
2409,
138,
4883,
5402,
9181,
4863
] | None |
7,038 | 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 |
7,039 | 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 | [
5120,
3603,
6675,
7187,
10776,
25,
541,
4637,
3615,
9762,
5158,
7728,
7217,
7218,
9784,
10809,
576,
2625,
6730,
6221,
1614,
86,
4695,
10333,
97,
2152,
8298,
7285,
3702,
9335,
2168,
634,
1147,
3197,
1150,
2179,
10883,
4747,
4237,
6797,
9... | Test |
7,040 | 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 | [
6602,
3629,
7794,
3572,
4022,
8283
] | Test |
7,041 | 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 | [
8898,
780,
3788,
9006,
7983,
1776,
1403,
6294,
2843
] | Test |
7,042 | 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 | [
6067,
5047
] | Test |
7,043 | 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 | [
7248,
6932,
8495,
1935
] | Test |
7,044 | 4 | Clickjacking:clickjacking clickjacking classified user interface redress attack ui redress attack ui redressing malicious technique tricking user clicking something different user perceives thus potentially revealing confidential information allowing others take control computer clicking seemingly innocuous objects including web pages web browsers clickjacking browser security issue vulnerability across variety browsers platforms clickjacking also take place outside web browsers including applications clickjack takes form embedded code script execute without user knowledge clicking button appears perform another function clickjacking instance confused deputy problem wherein computer innocently fooled misusing authority 2002 noted possible load transparent layer web page user input affect transparent layer without user noticing however mainly ignored major issue 2008 2008 jeremiah grossman robert hansen discovered adobe flash player able clickjacked allowing attacker gain access computer without user knowledge term clickjacking coined jeremiah grossman robert hansen portmanteau words click hijacking attacks similar nature discovered focus term ui redressing changed describe category attacks rather clickjacking clickjacking takes advantage vulnerabilities present applications web pages allow attacker manipulate user computer example clickjacked page tricks user performing undesired actions clicking concealed link clickjacked page attackers load another page transparent layer unsuspecting users think clicking visible buttons actually performing actions invisible page hidden page may authentic page therefore attackers trick users performing actions users never intended way tracing actions attackers later users would genuinely authenticated hidden page clickjacking limited type though present forms classic clickjacking refers attacker uses hidden layers web pages manipulate actions user cursor resulting user mislead truly clicked user might receive email link video news item another webpage say product page amazon hidden top underneath play button news video user tries play video actually buys product amazon hacker send single click rely fact visitor logged amazon.com 1-click ordering enabled technical implementation attacks may challenging due cross-browser incompatibilities number tools beef metasploit project offer almost fully automated exploitation clients vulnerable websites clickjacking may facilitated may facilitate web attacks xss likejacking malicious technique tricking users website liking facebook page intentionally mean like term likejacking came comment posted corey ballou article like anything web safely one first documented postings explaining possibility malicious activity regarding facebook like button according article ieee spectrum solution likejacking developed one facebook hackathons like bookmarklet available avoids possibility likejacking present facebook like button nested clickjacking compared classic clickjacking works embedding malicious web frame two frames original harmless web page framed page displayed top window works due vulnerability http header codice_1 element value codice_2 web browser checks two aforementioned layers fact additional frames added two remaining undetected means attackers use benefit past google+ faulty version codice_1 attackers able insert frames choice using vulnerability present google image search engine image display frames present google+ well attacker-controlled frames able load restricted allowing attackers mislead whoever came upon image display page cursorjacking ui redressing technique change cursor location user perceives discovered 2010 eddy bordi researcher vulnerability.fr marcus niemietz demonstrated custom cursor icon 2012 mario heiderich hiding cursor jordi chancel researcher alternativ-testing.fr discovered cursorjacking vulnerability using flash html javascript code mozilla firefox mac os x systems fixed firefox 30.0 lead arbitrary code execution webcam spying second cursorjacking vulnerability discovered jordi chancel mozilla firefox mac os x systems fixed firefox 37.0 using flash html javascript code lead also spying webcam execution malicious addon allowing execution malware computer trapped user browserless clickjacking attackers utilize vulnerabilities programs replicate classic clickjacking without required use presence web browser method clickjacking mainly prevalent among mobile devices usually android devices especially due way toast notifications work toast notifications small delay moment notification requested moment notification actually displays on-screen attackers capable using gap create dummy button lies hidden underneath notification still clicked cookiejacking form clickjacking cookies stolen web browsers done tricking user dragging object seemingly appears harmless fact making user select entire content cookie targeted attacker acquire cookie data within filejacking attackers use web browser capability navigate computer access computer files order acquire personal data tricking user establishing active file server file folder selection window browsers use attackers access take files victims computers 2014 paper researcher carnegie mellon university found browsers refuse autofill protocol current login page different protocol time password saved password managers would insecurely fill passwords http version https-saved passwords managers protect iframe- redirection-based attacks exposed additional passwords password synchronization used multiple devices protection clickjacking including likejacking added mozilla firefox desktop mobile versions installing noscript add-on clearclick feature released 8 october 2008 prevents users clicking invisible redressed page elements embedded documents applets according google browser security handbook year 2008 noscript clearclick freely available product offers reasonable degree protection clickjacking protection newer cursorjacking attack added noscript 2.2.8 rc1 noclickjack web browser add-on browser extension adds client-side clickjack protection users google chrome mozilla firefox opera microsoft edge without interfering operation legitimate iframes noclickjack based technology developed guardedid noclickjack add-on free guardedid commercial product includes client-side clickjack protection users internet explorer without interfering operation legitimate iframes guardedid clickjack protection forces frames become visible guardedid teams web browser add-on noclickjack add protection google chrome mozilla firefox opera microsoft edge gazelle microsoft research project secure web browser based ie uses os-like security model limited defenses clickjacking gazelle window different origin may draw dynamic content another window screen space content draws opaque web site owners protect users ui redressing frame based clickjacking server side including framekiller javascript snippet pages want included inside frames different sources javascript-based protection unfortunately always reliable especially true internet explorer kind countermeasure circumvented design including targeted page inside iframe security=restricted element introduced 2009 internet explorer 8 new http header codice_1 offered partial protection clickjacking shortly adopted browsers safari firefox chrome opera header set website owner declares preferred framing policy values codice_5 codice_2 codice_7 prevent framing framing external sites allow framing specified site respectively addition advertising sites return non-standard codice_8 value intention allow framing content page equivalent setting x-frame-options 2013 x-frame-options header officially published rfc 7034 internet standard document provided informational purposes w3c content security policy level 2 recommendation provides alternative security directive frame-ancestors intended obsolete x-frame-options header security header like x-frame-options protect users clickjacking attacks using frame codice_9 directive content security policy introduced version 1.1 allow disallow embedding content potentially hostile pages using iframe object etc directive obsoletes x-frame-options directive page served headers frame-ancestors policy preferred browser.—although popular browsers disobey requirement example frame-ancestors policies | [
3072,
5636,
10245,
10756,
8202,
9227,
9233,
9242,
7708,
9761,
9256,
9771,
10297,
3643,
7739,
9791,
1088,
4163,
4165,
9809,
4198,
107,
3700,
5245,
6786,
5764,
9356,
4245,
10392,
1690,
5281,
2213,
8387,
8921,
4314,
9949,
4326,
4344,
3320,
4... | None |
7,045 | 7 | High_Level_Architecture:high level architecture high-level architecture hla standard distributed simulation used building simulation larger purpose combining federating several simulations standard developed 90 ’ leadership us department defense later transitioned become open international ieee standard recommended standard within nato stanag 4603 today hla used number domains including defense security civilian applications architecture specifies following components together components form federation hla standard consists three parts hla initiated early 1990 ’ dr. anita k. jones director defense research engineering within us department defense gave defense modeling simulation office dmso task “ assuring interoperability reusability defense models simulations ” 1995 dmso formulated vision modeling simulation established modeling simulation masterplan included high-level architecture two protocols interoperability already existed distributed interactive simulation dis focusing real-time platform level simulation fixed object model aggregate level simulation protocol alsp focusing simulation aggregate time management ownership management flexible object models called confederation models purpose hla provide one unified standard would meet simulation interoperability requirements us dod components development hla based four prototypical federations platform prototype federation joint training protofederation analysis protofederation engineering prototype federation hla specification prototyped refined hla 1.3 finally released facilitate usage outside defense community hla transitioned ieee standard maintained simulation interoperability standards organization siso facilitate migration dis users federation object model corresponding fixed object model dis also developed real-time platform reference fom rpr fom following hla versions exist hla 1.3 published march 1998 dmso consists us dod also published interpretations hla 1.3 hla ieee 1516-2000 published 2000 ieee consists major improvements ieee 1516-2000 included xml-based fom detailed data type specifications well improved ddm design ieee 1516-2000 standard also complemented recommended development process well recommended vv process soon found 1516-2000 standard apis slightly different rti implementation siso produced standard alternate dynamic link compatible dlc c++ java apis dlc apis later merged main standard ieee 1516-2010 standard published august 2010 ieee commonly known hla evolved consists major improvements ieee 1516-2010 include modular foms incorporation dlc apis c++ java web services api fault tolerance machine-readable parts version hla xml schemas c++ java wsdl apis well fom/som samples downloaded ieee 1516 download area ieee web site full standards texts available extra cost siso members purchased ieee shop development new version hla started january 2016 siso currently ongoing hla standard consists three parts rti services defined hla interface specification grouped seven service groups addition services management object model mom provides services makes possible inspect adjust state federation programmatically rtis consist central rti component crc executable local rti components lrcs libraries used federates services provided c++ java api also using web services c++ java apis services invoked using calls instance rti ambassador class rti delivers information federate using callbacks delivered using calls instance federate ambassador class web services api defined using wsdl calls made callbacks fetched federate using web services requests responses service group descriptions focus key services exceptions advisories included purpose federation management services manage federation executions well federation-wide operations synchronization points save/restore one set federation management services manages connection rti federation execution set joined federates key services another set services relates synchronization points federation-wide events selected federates required complete operation initializing scenario execution continue key services yet another set service relates saving restoring federation execution save operation requires rti federate perform save internal state restore operation requires rti federate perform restore internal state key services save restore purpose declaration management services enable federates declare information wish publish send subscribe receive based object interaction classes fom rti uses information route updates interactions subscribing federates object class publishing subscribing performed specific set attributes interaction classes entire interaction including parameters published subscribed key services purpose object management services enable federates share information object instances exchange interactions object instance names reserved automatically generated federates register object instances specified object classes discovered subscribing federates attributes object instances updated updates reflected subscribing federates interactions sent interactions delivered subscribing federates key services objects attributes interactions purpose ownership management services dynamically manage federate simulates aspect object instance hla one federate allowed update given attribute given object instance federate considered owner attribute federate registers new object instance automatically owner attributes publishes cases attributes object instance may become unowned i.e owned federate ownership management provides services transferring ownership one several attributes runtime include federate divesting attribute another federate acquiring attribute two main patterns “ pull ” initiated acquiring federate “ push ” initiated divesting federate key services initiating “ pull ” ownership key services initiating “ push ” ownership object instances predefined attribute called hlaprivilegetodeleteobject owner attribute object instance allowed delete object instance ownership attribute transferred runtime using operations information exchange hla federation takes place real-time immediate receive order ro delivery messages unless hla time management enabled purpose hla time management guarantee causality correct consistent exchange time stamped messages updates interactions time stamp order tso matter federation executes real-time faster-than-real-time slower-than-real-time as-fast-as-possible important concepts hla time management logical time time axis hla starting zero logical time used time management timestamps operations logical time axis mapped scenario time federation example mapping let zero represent scenario time 8:00 1-jan-1066 let increment one represent one second scenario lookahead time interval specifying lowest time future federate produce messages federate fixed time step usually length time step granted federate granted allowed advance particular logical time rti time-stamped messages time delivered federate safely start calculating messages timestamp future timestamp may earlier granted time plus federates lookahead advancing federate finished producing data granted time plus lookahead may request advanced later time also means promises produce messages time stamp less requested time plus lookahead federate advancing state time regulating federate sends time stamped events considered time regulating since time advance federates may regulated time constrained federate receives time managed events considered time constrained since reception time stamped messages constrains time advance main principles hla time management example lookahead granted advancing least one federate federation performs pacing i.e correlates time advance requests real time clock federation may run real time scaled real time without pacing federation run fast possible used example monte carlo simulation key services include event driven simulation also possible federate request advanced next event using following service another important concept greatest available logical time galt greatest time federate granted depends time federates granted well lookahead galt federate specifies far federate granted without wait federates granted particularly interesting federate joins late time managed federation key services galt advanced services include order ensure proper interaction simulations way testing federate conformance defined involves ensuring every class interaction listed som particular federate used according usage described publishsubscribe publish subscribe none hla 1516-2010 instead single fdd describes entire fom specification describes fom modules merged form full fom default federation created merging hlastandardmim.xml fom module module provided federate creates federation standard mim mom initialization module contains mom classes basic default data types joining federate add one fom modules extend existing fom principle nothing changes federates call functions rti difference elements fom needed loaded managed addition federate joins late additional information exchange requirements added modular foms used hla rules describe responsibilities federations federates join ieee 1516 standard revised siso hla-evolved product development group approved 25-mar-2010 ieee standards activities board revised ieee 1516–2010 standard includes current dod standard interpretations edlc api extended version siso dlc api major improvements include hla current ieee 1516 version ancestor 1.3 version subject nato standardization agreement stanag 4603 modeling simulation modeling simulation architecture standards technical interoperability high level architecture hla base object model bom siso-std-003-2006 related standard siso provide better reuse composability hla simulations highly relevant hla developers provides way specify conceptual models map hla fom virtually means interconnecting distributed modeling simulation dm applications alternatives disadvantages hla exception regards distributed modeling simulation dm industry often used alternative hla distributed interactive simulation dis ieee 1278.1-2012 recently updated simulation protocol hla rti vendors also feature dis products middleware applications closely match hla features publish subscribe feature p see data distribution service dds shares many characteristics open on-the-wire protocol system interoperability hla message-oriented middleware defines set services provided c++ java api standardized on-the-wire protocol participants federation must use rti libraries provider usually also version order applications interoperate | [
1280,
2948,
7049,
11404,
5270,
5671,
2346,
6187,
4396,
5677,
434,
3762,
11321,
5439,
3780,
4557,
4581,
5863,
11125,
6904,
8828
] | None |
7,046 | 7 | Carry-I:carry-i carry-i model number ft-6200 intel 80286-based book-size diskless node produced flytech technology taiwan circa 1991 system bundled dr dos 5.0 australia system sold company hypec technology pty ltd | [
178,
10926
] | None |
7,047 | 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 | [
3912,
2945,
6576,
735
] | Validation |
7,048 | 9 | Marvin_Minsky:marvin minsky marvin lee minsky august 9 1927 – january 24 2016 american cognitive scientist concerned largely research artificial intelligence ai co-founder massachusetts institute technology ai laboratory author several texts concerning ai philosophy marvin lee minsky born new york city eye surgeon father henry mother fannie zionist activist family jewish attended ethical culture fieldston school bronx high school science later attended phillips academy andover massachusetts served us navy 1944 1945 received b.a mathematics harvard university 1950 ph.d. mathematics princeton university 1954 mit faculty 1958 death joined staff mit lincoln laboratory 1958 year later john mccarthy initiated named mit computer science artificial intelligence laboratory toshiba professor media arts sciences professor electrical engineering computer science minsky inventions include first head-mounted graphical display 1963 confocal microscope 1957 predecessor today widely used confocal laser scanning microscope developed seymour papert first logo turtle minsky also built 1951 first randomly wired neural network learning machine snarc 1962 minsky published 7,4 turing machine able prove universal time simplest known universal turing machine record stood 40 years stephen wolfram published 2,5 universal turing machine 2002 book new kind science minsky wrote book perceptrons seymour papert attacking work frank rosenblatt became foundational work analysis artificial neural networks book center controversy history ai claim great importance discouraging research neural networks 1970s contributing so-called ai winter also founded several famous ai models book framework representing knowledge created new paradigm programming perceptrons historical practical book theory frames wide use minsky also wrote possibility extraterrestrial life may think like humans permitting communication early 1970s mit artificial intelligence lab minsky papert started developing came known society mind theory theory attempts explain call intelligence could product interaction non-intelligent parts minsky says biggest source ideas theory came work trying create machine uses robotic arm video camera computer build children blocks 1986 minsky published society mind comprehensive book theory unlike previously published work written general public november 2006 minsky published emotion machine book critiques many popular theories human minds work suggests alternative theories often replacing simple ideas complex ones recent drafts book freely available webpage minsky adviser stanley kubrick movie one movie characters victor kaminski named minsky honor minsky mentioned explicitly arthur c. clarke derivative novel name portrayed achieving crucial break-through artificial intelligence then-future 1980s paving way hal 9000 early 21st century 1952 minsky married pediatrician gloria rudisch together three children minsky talented improvisational pianist published musings relations music psychology minsky atheist signatory scientists open letter cryonics critic loebner prize conversational robots argued fundamental difference humans machines humans machines machines intelligence emerges interplay many unintelligent semi-autonomous agents comprise brain argued somewhere line computers become intelligent people hard predict fast progress would cautioned artificial superintelligence designed solve innocuous mathematical problem might decide assume control earth resources build supercomputers help achieve goal believed negative scenarios hard take seriously felt confident ai would go lot testing deployed minsky died cerebral hemorrhage age 88 minsky member alcor scientific advisory board believed cryonically preserved alcor presumably patient 144 whose cooling procedures began january 27 2016 2019 virginia giuffre named minsky one jeffrey epstein child trafficking clients unsealed deposition federal court minsky turing award greatest distinction computer science 1969 japan prize 1990 ijcai award research excellence 1991 benjamin franklin medal franklin institute 2001 2006 inducted fellow computer history museum co-founding field artificial intelligence creating early neural networks robots developing theories human machine cognition 2011 minsky inducted ieee intelligent systems ai hall fame significant contributions field ai intelligent systems 2014 minsky dan david prize artificial intelligence digital mind also awarded 2013 bbva foundation frontiers knowledge award information communication technologies category minsky affiliated following organizations | [
9975,
11020,
3728,
2577,
4633,
7069,
4643,
10668,
2482,
1976,
3389,
3261,
4799,
4800,
10049,
4930,
11075,
70,
9288,
3529,
1883,
989,
7775,
9315,
10211,
10981,
11242,
2283,
5611,
2798,
9969,
1783,
504,
6906,
511
] | None |
7,049 | 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 | [
3328,
9603,
1284,
7045,
8708,
2184,
5384,
6797,
10005,
5270,
1303,
9625,
10906,
10016,
5671,
6187,
172,
4396,
7983,
434,
3762,
6834,
823,
9655,
1977,
7865,
11321,
5437,
4671,
5439,
3780,
9285,
330,
3156,
10332,
11363,
4581,
5093,
5863,
45... | Test |
7,050 | 3 | International_Symposium_on_Microarchitecture:international symposium microarchitecture international symposium microarchitecture micro generally viewed top-tier academic conference computer architecture confused micro-conference | [
995,
9932
] | Train |
7,051 | 3 | Pitfall!:pitfall pitfall video game designed david crane atari 2600 released activision 1982 player controls pitfall harry tasked collecting treasures jungle within 20 minutes avoiding obstacles hazards pitfall received positive reviews upon release one best-selling games atari 2600 four million copies sold top video game billboard charts year inspired numerous sequels ports across variety gaming consoles helped define side-scrolling platformer genre player controls character pitfall harry maze-like jungle attempt recover 32 treasures 20-minute time period along way players must maneuver numerous hazards including pits quicksand rolling logs fire rattlesnakes scorpions crocodiles harry may jump otherwise avoid obstacles climbing running swinging vines treasure includes bags money gold silver bars diamond rings range value 2000 5000 points 1000 point increments eight treasure type 32 total perfect score 114,000 achieved claiming 32 treasures without losing points points deducted either falling hole 100 points touching logs point loss depends long contact made log jungle tunnel harry access ladders found various points traveling though tunnel moves forward three screens time necessary order collect treasures within time limit however tunnels filled dead-ends blocked brick walls forcing player return surface one ladders try find way around thus wasting time tunnels also contain scorpions player loses life harry comes contact obstacle except logs falls tar pit quicksand waterhole mouth crocodile game ends either 32 treasures collected three lives lost time run pitfall created david crane programmer worked activision early 1980s november 2003 interview edge described 1979 developed technology display realistic running man 1982 searching suitable game use game technical achievements included non-flickering multicolored animated sprites system notoriously primitive graphics hardware innovative techniques used keep code space within 4k limit including polynomial counter create 256 screens within 50 bytes code swinging vines created repeatedly displaying atari one-pixel ball sprite different offsets several ports made computer systems msx commodore 64 atari 800 well home consoles colecovision intellivision versions pitfall ported home computers different names around 1983 one version 'trapfall ken kalish tom mix software tandy coco licensed sold part cuthbert series dragon 32 cuthbert jungle microdeal united kingdom version re-ported back computers like commodore 64 pitfall originally sold anyone scored 20,000 points could send activision picture television screen receive pitfall harry explorer club patch television commercial pitfall featured then-child actor jack black age 13 first tv role possibly great success raiders lost ark pitfall atari 2600 best-selling home video game 1982 first quarter 1983 mid-january 1983 top-selling game billboard chart seven weeks—much successful rival e.t atari paid 21 million license—and remained number one position 64 weeks row danny goodman creative computing video arcade games stated pitfall standout among dozens 2600 games announced summer 1982 consumer electronics show original cartridge vcs without arcade express reviewed atari 2600 version pitfall august 1982 stating may well best adventure game yet produced vcs giving score 8 10 electronic games june 1983 praised 2600 version superb graphics varied play-action goodman surprised intellivision version graphics greatly improved 2600 video games march 1983 criticized activision enhancing intellivision version graphics know graphics intellivision vcs improvements pitfall 2600 version pitfall awarded best adventure video game 4th annual arkie awards 2013 entertainment weekly listed one ten best atari 2600 games crane produced atari 2600 sequel 1983 pitfall series appeared nintendo entertainment system november 1987 form super pitfall reworking 1985 activision licensed pitfall sega made arcade version lost caverns game thoroughly remade first level resembling original pitfall second level resembling caverns pitfall ii later levels completely original version adapted sg-1000 pitfall produced commodore 64 apple ii home computers using garry kitchen gamemaker primarily demonstration game building software closer 16-bit platformers atari 2600 games made debut super nintendo entertainment system mega drive/genesis 1994 later appeared sega cd sega 32x consoles game ported windows 95 operating system atari jaguar 1995 recent re-release 2001 game boy advance mayan adventure includes original pitfall game easter egg 1998 featuring voice bruce campbell pitfall harry jr. released playstation game boy color without 3d designation 2004 fourth sequel released playstation 2 gamecube xbox game includes original pitfall pitfall ii games port lost expedition pitfall big adventure released wii september 23 2008 may 2010 pitfall released microsoft game room service xbox 360 console windows-based pcs also ported game room xbox live title windows phone february 2011 august 9 2012 activision released pitfall ios iphone ipad ipod touch december 21 activision released pitfall android free app version game departed 2d graphics seen original instead used 3d graphics gameplay also altered game endless runner style temple run month crane announced kickstarter jungleventure spiritual successor original games goal raise us 900,000 project failed reach target raising 31,207 crane said reason people thought asking much money everyone turned soon saw price pitfall generally viewed created side-scrolling platforming genre although scroll features games ability travel multiple levels play game also much longer atari 2600 games time typically lasted minutes due majority games ports arcade games short play time encouraged players spend money pitfall considered one influential games atari 2600 system introduced jungle setting video games many game mechanics used games like prince persia 1983 pitfall made animated television debut segment cbs saturday supercade cartoon lineup name pitfall harry basic plotline involved harry voiced robert ridgely niece rhonda voiced noelle north cowardly mountain lion quickclaw voiced kenneth mars exploring various locations hidden treasure one season pitfall harry frogger donkey kong jr. replaced kangaroo space ace | [
1346,
3075,
5091,
9732,
6539,
10316,
6797,
9006,
7983,
9998,
10093,
10576,
921
] | None |
7,052 | 2 | Weather_(Apple):weather apple weather preinstalled mobile app ipod touch iphone bundled ios since iphone os 1 app allows user see weather number selected cities locations added pressing list icon plus icon allows user type city name zip code postal code airport code locations removed tapping list icon swiping left location user wants delete weather app ios 8 updated use weather channel source information weather rather yahoo weather ios 10 later app removed home screen user wishes ios 12 information weather displayed ios device lock screen alarm set device ’ “ bedtime ” feature goes | [
10755,
9732,
5647,
7697,
11289,
6186,
4139,
6700,
1074,
8754,
9784,
8253,
8783,
4180,
10838,
1623,
3672,
3681,
9826,
8806,
3691,
2673,
7292,
2686,
6783,
10878,
5784,
1177,
3228,
2207,
11430,
2735,
3248,
4283,
3772,
7869,
3286,
9430,
3293,
... | None |
7,053 | 2 | MVS:mvs multiple virtual storage commonly called mvs commonly used operating system system/370 system/390 ibm mainframe computers developed ibm unrelated ibm mainframe operating systems e.g. vse vm tpf first released 1974 mvs extended program products new names multiple times first ibm described mvs simply new release os/vs2 fact major rewrite os/vs2 release 1 upgrade os/360 mvt retained original code like mvt mainly written assembly language mvs core almost entirely written assembler xf although modules written pl/s performance-sensitive ones particular input/output supervisor ios ibm use os/vs2 emphasized upwards compatibility application programs ran mvt even need recompiling run mvs job control language files could used unchanged utilities non-core facilities like tso ran unchanged ibm users almost unanimously called new system mvs start ibm continued use term mvs naming later major versions mvs/xa os/360 mft multitasking fixed number tasks provided multitasking several memory partitions fixed size set operating system installed operator redefined example could small partition two medium partitions large partition two large programs ready run one would wait finished vacated large partition os/360 mvt multitasking variable number tasks enhancement refined memory use instead using fixed-size memory partitions mvt allocated memory regions job steps needed provided enough contiguous physical memory available significant advance mft memory management weaknesses job allocated memory dynamically sort programs database management systems programmers estimate job maximum memory requirement pre-define mvt job step contained mix small large programs wasted memory small programs ran seriously memory could become fragmented i.e. memory used current jobs could divided uselessly small chunks areas used current jobs remedy wait current jobs finished starting new ones early 1970s ibm sought mitigate difficulties introducing virtual memory ibm called virtual storage allowed programs request address spaces larger physical memory original implementations single virtual address space shared jobs os/vs1 os/360 mft within single virtual address space os/vs2 svs os/360 mvt within single virtual address space os/vs1 svs principle disadvantages mft mvt impacts less severe jobs could request much larger address spaces requests came 16 mb pool even physical storage smaller mid-1970s ibm introduced mvs supported virtual storage larger available real storage svs also allowed indefinite number applications run different address spaces two concurrent programs might try access virtual memory address virtual memory system redirected requests different areas physical memory address spaces consisted three areas operating system one instance shared jobs application area unique application shared virtual area used various purposes including inter-job communication ibm promised application areas would always least 8 mb made mvs perfect solution business problems resulted need run applications mvs maximized processing potential providing multiprogramming multiprocessing capabilities like mvt os/vs2 svs predecessors mvs supported multiprogramming program instructions associated data scheduled control program given processing cycles unlike single-programming operating system systems maximize use processing potential dividing processing cycles among instructions associated several different concurrently running programs way control program wait i/o operation complete proceeding executing instructions multiple programs computer able switch back forth active inactive programs early editions mvs mid-1970s among first ibm os series support multiprocessor configurations though m65mp variant os/360 running 360 models 65 67 provided limited multiprocessor support 360 model 67 also hosted multiprocessor capable tss/360 mts cp-67 operating systems multiprocessing systems execute instructions simultaneously offer greater processing power single-processing system result mvs able address business problems brought need process large amounts data multiprocessing systems either loosely coupled means computer access common workload tightly coupled means computers share real storage controlled single copy operating system mvs retained loosely coupled multiprocessing attached support processor asp tightly coupled multiprocessing os/360 model 65 multiprocessing tightly coupled systems two cpus shared concurrent access memory copy operating system peripherals providing greater processing power degree graceful degradation one cpu failed loosely coupled configurations group processors single tightly coupled memory operating system shared peripherals operating system component jes3 allowed managing whole group one console provided greater resilience let operators decide processor run jobs central job queue mvs jes3 gave users opportunity network together two data processing systems via shared disks channel-to-channel adapters ctca capability eventually became available jes2 users multi-access spool mas mvs originally supported 24-bit addressing i.e. 16 mb underlying hardware progressed supported 31-bit xa esa 2048 mb z/os 64-bit addressing significant motives rapid upgrade 31-bit addressing growth large transaction-processing networks mostly controlled cics ran single address space—and db2 relational database management system needed 8 mb application address space run efficiently early versions configured two address spaces communicated via shared virtual area imposed significant overhead since communications transmit via operating system main user interfaces mvs job control language jcl originally designed batch processing 1970s onwards also used start allocate resources long-running interactive jobs cics tso time sharing option interactive time-sharing interface mainly used run development tools end-user information systems ispf tso application users 3270-family terminals later vm well allows user accomplish tasks tso command line menu form oriented manner full screen editor file browser tso basic interface command line although facilities added later form-driven interfaces mvs took major step forward fault-tolerance built earlier stae facility ibm called software recovery ibm decided years practical real-world experience mvt business world system failures major impacts customer businesses ibm decided take major design jump assume despite best software development testing techniques 'problems occur profound assumption pivotal adding great percentages fault-tolerance code system likely contributed system success tolerating software hardware failures statistical information hard come prove value design features measure 'prevented 'recovered problems ibm many dimensions enhanced fault-tolerant software recovery rapid problem resolution features time design specified hierarchy error-handling programs system kernel/'privileged mode called functional recovery routines user 'task 'problem program mode called estae extended specified task abnormal exit routines invoked case system detected error actually hardware processor storage error software error recovery routine made 'mainline function reinvokable captured error diagnostic data sufficient debug causing problem either 'retried reinvoke mainline 'percolated escalated error processing next recovery routine hierarchy thus error system captured diagnostic data attempted perform repair keep system worst thing possible take user address space 'job case unrepaired errors though initial design point recent mvs version z/os recovery program guaranteed recovery routine recovery routine recovery routine recovery structure embedded basic mvs control program programming facilities available used application program developers 3rd party developers practically mvs software recovery made problem debugging easier difficult software recovery requires programs leave 'tracks thus facilitating debugging—but fact processing progresses despite error overwrite tracks early data capture time error maximizes debugging facilities exist recovery routines task system mode ibm included additional criteria major software problem required ibm service mainline component failed initiate software recovery considered valid reportable failure also recovery routine failed collect significant diagnostic data original problem solvable data collected recovery routine ibm standards dictated fault reportable required repair thus ibm standards rigorously applied encouraged continuous improvement ibm introduced on-demand hypervisor major serviceability tool called dynamic support system dss first release mvs facility could invoked initiate session create diagnostic procedures invoke already-stored procedures procedures 'trapped special events loading program device i/o system procedure calls triggered activation previously defined procedures procedures could invoked recursively allowed reading writing data alteration instruction flow program event recording hardware used due overhead tool removed customer-available mvs systems program-event recording per exploitation performed enhancement diagnostic slip command introduction per support slip/per su 64/65 1978 multiple copies mvs ibm operating systems could share machine machine controlled vm/370 case vm/370 real operating system regarded guest operating systems applications unusually high privileges result later hardware enhancements one instance operating system either mvs vm guests could also occupy logical partition lpar instead entire physical system multiple mvs instances organized collectively administered structure called systems complex sysplex introduced september 1990 instances interoperate software component called cross-system coupling facility xcf hardware component called hardware coupling facility cf integrated coupling facility icf co-located mainframe hardware multiple sysplexes joined via standard network protocols ibm proprietary systems network architecture sna recently via tcp/ip z/os operating system mvs recent descendant also native support execute posix single unix specification applications support began mvs/sp v4r3 ibm obtained unix 95 certification z/os v1r2 later system typically used business banking applications often written cobol cobol programs traditionally used transaction processing systems like ims cics program running cics special exec cics statements inserted cobol source code preprocessor translator replaces exec cics statements appropriate cobol code call cics program compiled — altogether unlike sql used call db2 applications also written languages c c++ java assembly language fortran basic rpg rexx language support packaged common component called language environment le allow uniform debugging tracing profiling language independent functions mvs systems traditionally accessed 3270 terminals pcs running 3270 emulators however many mainframe applications days custom web gui interfaces z/os operating system built-in support tcp/ip system management done past 3270 terminal done hardware management console hmc increasingly web interfaces operator consoles provided 2074 emulators unlikely see s/390 zseries processor real 3270 connected native character encoding scheme mvs peripherals ebcdic tr instruction made easy translate 7- 8-bit codes time ibm added hardware-accelerated services perform translation larger codes hardware-specific service unicode transforms software support e.g. ascii iso/iec 8859 utf-8 utf-16 utf-32 software translation services take source destination code pages inputs files properly called data sets mvs names files organized catalogs vsam files data set names dsns mainframe term filenames organized hierarchy whose levels separated dots e.g dept01.system01.file01 level hierarchy eight characters long total filename length maximum 44 characters including dots convention components separated dots used organize files similarly directories operating systems example utility programs performed similar functions windows explorer without gui usually batch processing mode adding renaming deleting new elements reporting contents specified element however unlike many systems levels usually actual directories naming convention like original macintosh file system folder hierarchy illusion maintained finder tso supports default prefix files similar current directory concept racf supports setting access controls based filename patterns analogous access controls directories platforms members os family mvs data sets record-oriented mvs inherited three main types predecessors sequential isam datasets could store either fixed-length variable length records types could occupy one disk volume based vtoc disk structure early ibm database management systems used various combinations isam bdam datasets usually bdam actual data storage isam indexes early 1970s ibm virtual memory operating systems introduced new file management component vsam provided similar facilities vsam formats became basis ibm database management systems ims/vs db2 usually esds actual data storage ksds indexes vsam also included catalog component used mvs master catalog partitioned data sets pds sequential data sets subdivided members could processed sequential files right like folder hierarchical file system important use pdses program libraries system administrators used main pds way allocate disk space project project team created edited members uses pdss libraries frequently used job control procedures procs “ copy books ” programming language statements record definitions used several programs generation data groups gdgs groups like named data sets referenced absolute generation number offset recent generation originally designed support grandfather-father-son backup procedures file modified changed version became new son previous son became father previous father became grandfather previous grandfather deleted one could set gdgs 3 generations applications used gdgs collect data several sources feed information one program collecting program created new generation file final program read whole group single sequential file specifying generation jcl modern versions mvs e.g. z/os also support posix-compatible slash filesystems along facilities integrating two filesystems os make mvs dataset appear file posix program subsystem newer filesystems include hierarchical file system hfs confused apple hierarchical file system zfs confused sun zfs programs running network-connected computers as/400 use local data management interfaces transparently create manage access vsam record-oriented files using client-server products implemented according distributed data management architecture ddm ddm also base architecture mvs db2 server implements distributed relational database architecture drda mvs part z/os older mvs releases longer supported ibm since 2007 64-bit z/os releases supported z/os supports running older 24-bit 31-bit mvs applications alongside 64-bit applications mvs releases 3.8j 24-bit released 1981 freely available possible run mvs 3.8j release mainframe emulators free mvs/370 generic term versions mvs operating system prior mvs/xa system/370 architecture time mvs released supported 24-bit virtual addresses mvs/370 operating system architecture based 24-bit address 24-bit address length programs running mvs/370 given 16 megabytes contiguous virtual storage mvs/xa multiple virtual storage/extended architecture version mvs supported 370-xa architecture expanded addresses 24 bits 31 bits providing 2 gigabyte addressable memory area also supported 24-bit legacy addressing mode older 24-bit applications i.e stored 24-bit address lower 24 bits 32-bit word utilized upper 8 bits word purposes mvs/esa mvs enterprise system architecture version mvs first introduced mvs/sp version 3 february 1988 replaced by/renamed os/390 late 1995 subsequently z/os mvs/esa openedition upgrade version 4 release 3 mvs/esa announced february 1993 support posix standards initial release national institute standards technology nist certification federal information processing standard fips 151 compliance subsequent releases certified higher levels organizations e.g x/open successor open group included 1 million new lines code provide api shell utilities extended user interface works hierarchical file system provided dfsms data facility system managed storage shell utilities based mortice kerns interopen products independent specialists estimate 80 open systems-compliant—more unix systems dce2 support announced february 1994 many application development tools march 1995 mid 1995 open features became standard part vanilla mvs/esa sp version 5 release 1 ibm stopped distinguishing openedition operating system os/390 became unix system services kept name z/os late 1995 ibm bundled mvs several program products changed name mvs/esa os/390 current level mvs marketed z/os japanese mainframe manufacturers fujitsu hitachi repeatedly illegally obtained ibm mvs source code internal documentation one 20th century famous cases industrial espionage fujitsu relied heavily ibm code msp mainframe operating system likewise hitachi vos3 operating system msp vos3 heavily marketed japan still hold substantial share mainframe installed base also degree countries notably australia even ibm bugs documentation misspellings faithfully copied ibm cooperated u.s. federal bureau investigation sting operation reluctantly supplying fujitsu hitachi proprietary mvs mainframe hardware technologies course multi-year investigations culminating early 1980s—investigations implicated senior company managers even japanese government officials amdahl however involved fujitsu theft ibm intellectual property communications amdahl fujitsu amdahl specifications scrupulously cleansed ibm ip references ibm ip subsequent investigations ibm reached multimillion-dollar settlements fujitsu hitachi collecting substantial fractions companies profits many years reliable reports indicate settlements exceeded us 500,000,000 three companies long since amicably agreed many joint business ventures example 2000 ibm hitachi collaborated developing ibm z900 mainframe model historical copying msp vos3 properly classified forks mvs many third party software vendors mvs-compatible products able produce msp- vos3-compatible versions little modification ibm introduced 64-bit z/architecture mainframes year 2000 ibm also introduced 64-bit z/os operating system direct successor os/390 mvs fujitsu hitachi opted license ibm z/architecture quasi-mvs operating systems hardware systems msp vos3 still nominally supported vendors maintain mvs 1980s architectural limitations present day since z/os still supports mvs-era applications technologies—indeed z/os still contains mvs code albeit greatly enhanced improved decades evolution—applications operational procedures running msp vos3 move z/os much easily operating systems | [
6148,
7,
3598,
6675,
7188,
8213,
10273,
9762,
4645,
5160,
10280,
5677,
7217,
10803,
7733,
2616,
573,
2625,
9286,
8272,
9814,
8290,
5220,
9829,
6248,
119,
2168,
2172,
9343,
2179,
10883,
9361,
9370,
7836,
7848,
8872,
5293,
10413,
8879,
6325... | None |
7,054 | 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 | [
4194,
5223,
4236,
7248,
7537,
5660
] | Test |
7,055 | 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 | [
8262,
2216,
1610,
3323,
8502,
1976,
955
] | Test |
7,056 | 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 | [
7556,
2567,
3084,
2957,
658,
660,
1173,
1941,
4128,
1315,
4389,
10662,
169,
11185,
2357,
10806,
1847,
9528,
2110,
9541,
10315,
6863,
7887,
4561,
8273,
7635,
212,
9556,
10963,
11349,
2265,
7643,
9697,
8674,
229,
618,
1898,
881,
1654,
7161,... | Validation |
7,057 | 3 | Hybrid_kernel:hybrid kernel hybrid kernel operating system kernel architecture attempts combine aspects benefits microkernel monolithic kernel architectures used computer operating systems traditional kernel categories monolithic kernels microkernels nanokernels exokernels seen extreme versions microkernels hybrid category controversial due similarity hybrid kernels ordinary monolithic kernels term dismissed linus torvalds simple marketing idea behind hybrid kernel kernel structure similar microkernel implement structure manner monolithic kernel contrast microkernel nearly operating system services hybrid kernel still kernel space none reliability benefits services user space microkernel however ordinary monolithic kernel none performance overhead message passing context switching kernel user mode normally comes microkernel one prominent example hybrid kernel microsoft windows nt kernel powers operating systems windows nt family including windows 10 windows server 2019 powers windows phone 8 windows phone 8.1 xbox one nt-based windows classified hybrid kernel macrokernel rather monolithic kernel emulation subsystems run user-mode server processes rather kernel mode monolithic kernel large number design goals resemble design goals mach particular separation os personalities general kernel design conversely reason nt microkernel system system components run address space kernel would case monolithic design traditional monolithic design would microkernel per se kernel would implement broadly similar functionality nt microkernel kernel-mode subsystems windows nt design includes many objectives mach archetypal microkernel system one important structure collection modules communicate via well-known interfaces small microkernel limited core functions first-level interrupt handling thread scheduling synchronization primitives allows possibility using either direct procedure calls interprocess communication ipc communicate modules hence potential location modules different address spaces example either kernel space server processes design goals shared mach included support diverse architectures kernel abstractions general enough allow multiple operating system personalities implemented top object-oriented organisation primary operating system personality windows windows api always present emulation subsystem implements windows personality called client/server runtime subsystem csrss.exe versions nt prior 4.0 subsystem process also contained window manager graphics device interface graphics device drivers performance reasons however version 4.0 later modules often implemented user mode even monolithic systems especially designed without internal graphics support run kernel-mode subsystem applications run nt written one os personalities usually windows api native nt api documentation publicly available exception routines used device driver development os personality implemented via set user-mode dlls see dynamic-link library mapped application processes address spaces required together emulation subsystem server process described previously applications access system services calling os personality dlls mapped address spaces turn call nt run-time library ntdll.dll also mapped process address space nt run-time library services requests trapping kernel mode either call kernel-mode executive routines make local procedure calls lpcs appropriate user-mode subsystem server processes turn use nt api communicate application processes kernel-mode subsystems xnu kernel apple inc. acquired developed use macos ios watchos tvos operating systems released free open source software part darwin operating system xnu acronym x unix originally developed next nextstep operating system xnu hybrid kernel combining version 2.5 mach kernel developed carnegie mellon university components 4.3bsd object-oriented api writing drivers called driver kit apple acquired next mach component upgraded osfmk 7.3 microkernel apple uses heavily modified osfmk 7.3 functioning hybrid kernel parts freebsd included osfmk 7.3 includes applicable code university utah mach 4 kernel applicable code many mach 3.0 variants sprouted original carnegie mellon university mach 3.0 kernel bsd components upgraded code freebsd project driver kit replaced c++ api writing drivers called i/o kit like modern kernels xnu hybrid containing features monolithic microkernels attempting make best use technologies message passing capability microkernels enabling greater modularity larger portions os benefit protected memory well retaining speed monolithic kernels certain critical tasks xnu runs arm part ios ia-32 x86-64 based processors | [
2560,
10755,
6155,
6675,
7187,
8725,
11283,
10776,
25,
4637,
9762,
4643,
6180,
11301,
5158,
6186,
7217,
8754,
10803,
9784,
10809,
576,
2625,
6221,
1623,
3160,
10333,
97,
3681,
10851,
11363,
6760,
10856,
8298,
9835,
7285,
4727,
2168,
9335,
... | None |
7,058 | 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 | [
3586,
9475,
3588,
8452,
3464,
4872,
10260,
4767,
2463,
7712,
9122,
1322,
11183,
1329,
3892,
8629,
9400,
6978,
11331,
8004,
9157,
3783,
7247,
9551,
7122,
9427,
7132,
2525,
4451,
5859,
1260,
7788,
7151,
10225,
1651
] | Test |
7,059 | 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 | [
10437,
7337,
3941,
10190
] | Validation |
7,060 | 8 | Oneindia:oneindia oneindia.com indian online portal founded bg mahesh owned greynium information technologies pvt ltd website provides news updates sports events travel entertainment business lifestyle videos classifieds seven different indian languages english kannada hindi tamil telugu bengali gujarati malayalam | [
735
] | None |
7,061 | 9 | CorbaScript:corbascript corbascript object-oriented scripting language designed use corba | [
9780,
8262
] | Test |
7,062 | 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 |
7,063 | 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 | [
1537,
8577,
6276,
3205,
11271,
11655,
9359,
1424,
529,
2449,
659,
8083,
10770,
5143,
2072,
8472,
5274,
5019,
5659,
669,
11545,
4003,
4132,
6310,
167,
40,
1833,
3626,
5290,
10410,
9137,
10802,
7220,
821,
5175,
7866,
1083,
1216,
1728,
7617,... | Test |
7,064 | 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 | [
10900,
10902,
11030,
3224,
5401,
11414,
4384,
8227,
11683,
11559,
4010,
10157,
9263,
11570,
6709,
8246,
315,
7486,
4674,
1347,
1348,
5320,
4174,
847,
83,
1366,
9434,
603,
608,
2401,
8161,
7523,
3303,
11498,
3821,
10991,
3573,
9205,
5754,
... | Validation |
7,065 | 3 | PowerQUICC:powerquicc powerquicc name several powerpc- power isa-based microcontrollers freescale semiconductor built around one powerpc cores communications processor module quicc engine separate risc core specialized tasks i/o communications atm security acceleration networking usb many components system-on-a-chip designs tailor made embedded applications powerquicc processors used networking automotive industrial storage printing consumer applications freescale using powerquicc processors part mobilegt platform freescale also manufactures quicc microcontrollers based older 68k technology four distinct lines processors mainly based processing power. mpc8xx family motorola first powerpc based embedded processors suited network processors system-on-a-chip devices core original implementation powerpc specification single issue four stage pipelined core mmu branch prediction unit speeds 133 mhz mpc821 introduced 1995 together mpc860 complete quicc engine slimmed version mpc850 reduced caches io ports came 1997 quicc communication processor module cpm offloads networking tasks cpu thus branding family powerquicc processors family differ on-chip features like usb serial pcmcia atm ethernet controllers different amount l1 caches ranging 1 kib 16 kib mpc8xx – powerquicc processors share common naming scheme powerquicc ii introduced 1998 direct descendant powerpc 603e core also goes name 603e g2 processors still 16/16 kib instruction/data l1 caches reaching frequencies 450 mhz communications processors used applications like voip systems telecom switches cellular base stations dslams powerquicc ii family processors phased favour powerful powerquicc ii pro line plans development core mpc82xx – powerquicc ii processors share common naming scheme introduced 2004 based e300 core enhanced powerpc 603e core 32/32 kib instruction/data l1 caches powerquicc ii pro used networking processors routers switches printers network-attached storage wireless access points dslams powerquicc ii pro processors reaches 677 mhz include multitude embedded technologies like usb pci ethernet security devices also use newer quicc engine network offload engine instead cpm used original powerquicc powerquicc ii series memory controller provides support ddr ddr2 sdrams mpc83xx – powerquicc ii pro processors share common naming scheme trailing e signifies processors built encryption module devices 834x name lacks quicc engine devices number like 836x one powerquicc iii processors based 32-bit power isa v.2.03 core called e500 introduced 2003 dual issue seven-stage pipeline double precision fpus 32/32 kib data instruction l1 caches multiple gigabit ethernet pci pcie rapidio ddr/ddr2 memory controllers security accelerators speeds ranges 533 mhz 1.5 ghz processors target enterprise level networking telecom applications high end storage printing imaging processors use older cpm module handling network processing offload use newer quicc engine powerquicc ii pro cpm quicc engine freescale marketing department nevertheless brand devices 85xx series powerquicc iii mpc85xx – powerquicc iii processors share common naming scheme trailing e signifies processors built-in encryption module powerquicc cease development favor software-compatible qoriq platform featuring powerpc e500 based processors single core multi-core 32 cores freescale keep manufacturing powerquicc processors foreseeable future existing customers help facilitate transition qoriq | [
7809,
6914,
7299,
3844,
4868,
1158,
3846,
4743,
7302,
5642,
3467,
1548,
1933,
7305,
6415,
3472,
1170,
2073,
1563,
1309,
4897,
3493,
6949,
6311,
8102,
1321,
8231,
8998,
9391,
10543,
4017,
5297,
5809,
11314,
3255,
8120,
8761,
11447,
6715,
9... | None |
7,066 | 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 | [
10756,
11685,
467,
10392,
5373,
7739,
9053
] | Test |
7,067 | 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 | [
8582,
6797,
2062,
1304,
10012,
10924,
5677,
7983,
823,
4797,
3517,
10436,
8262,
5598,
5471,
9441,
10465,
8554,
9962,
2804,
4341,
2424,
124
] | Test |
7,068 | 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 | [
9863,
3215,
2963,
8355,
5028,
424,
10537,
8237,
2862,
2737,
9137,
10303,
196,
4548,
8900,
6993,
8048,
1400,
11391
] | Test |
7,069 | 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 | [
4483,
6408,
7048,
11538,
1443,
11555,
679,
1849,
5830,
5319,
8262,
10953,
5857,
5604,
7780,
8301,
8046,
3567,
1783,
8057
] | Test |
7,070 | 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 | [
5120,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
3611,
29,
9249,
9762,
5158,
3640,
7225,
11323,
8772,
1109,
10851,
4708,
9836,
7789,
9333,
6263,
9335,
5244,
2687,
9343,
7818,
654,
2193,
2194,
2197,
2199,
11419,
6309,
1190,
5286,
104... | Validation |
7,071 | 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 | [
1922,
8966,
6664,
2327,
6296,
5501,
3615,
1952,
799,
10786,
428,
5165,
5040,
8502,
11447,
1724,
8126,
4543,
10176,
833,
9921,
5830,
4424,
5065,
8524,
7889,
5844,
7421,
477,
7263,
7775,
8545,
8037,
5094,
9445,
9964,
10734,
1775,
1776,
9714... | Test |
7,072 | 3 | Ultra_30:ultra 30 ultra 30 family sun microsystems workstations based ultrasparc ii microprocessor code-named quark member sun ultra series launched may 1997 shipped solaris 2.6 ultra 30 reached end-of-life may 1999 ultra 30 ran single ultrasparc ii cpu however compatible two models 250 mhz module 501-4857 300 mhz module 501-4849 system supports two ultra scsi hard drives 16 dimm slots maximum 2gb memory capacity machine also featured four full-sized pci slots two upa slots two rs-232c/rs-423 serial ports 100base-t fastethernet | [
3328,
9731,
1801,
4235,
1809,
2710,
1316,
10789,
1707,
3247,
6322,
7104,
9665,
6338,
10436,
1480,
2895,
3919,
597,
10200,
4960,
9955,
11363,
11626,
7148,
7022,
8179,
9333,
1399,
9343
] | None |
7,073 | 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 | [
8283,
4435,
2580,
7887
] | Test |
7,074 | 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 | [
2688,
3080,
9481,
1034,
2348,
5612,
9614,
7983,
3763,
502,
9467
] | Test |
7,075 | 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 | [
517,
11660,
9744,
1297,
9884,
10918,
5674,
7979,
3629,
4793,
3264,
3671,
1496,
9690,
8674,
483,
612,
744,
9576,
9336,
5373,
4863
] | Test |
7,076 | 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 | [
8201,
7691,
7188,
8732,
9245,
9759,
5677,
8751,
5684,
6718,
576,
2625,
3650,
1606,
3142,
8262,
5711,
7775,
8291,
9828,
3705,
7292,
9345,
6797,
655,
10387,
6809,
7326,
4777,
8876,
10413,
6837,
6335,
5833,
8910,
7889,
1253,
10470,
10471,
10... | Test |
7,077 | 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 | [
11282,
9235,
11289,
1057,
38,
4139,
8237,
9774,
2097,
8250,
8253,
7745,
7747,
2635,
99,
8812,
10361,
638,
644,
8842,
146,
659,
7833,
666,
5786,
4258,
4773,
9913,
8383,
10945,
4821,
2788,
3301,
9964,
6391,
3835,
2814,
781,
2838,
5417,
28... | Test |
7,078 | 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 | [
225,
1410,
865,
7364,
8644,
8865,
10341,
2504,
7022,
7983,
1650,
119,
8310,
823,
11097,
10814
] | Test |
7,079 | 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 | [
4216,
9006,
599
] | Validation |
7,080 | 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 | [
3591,
8201,
2068,
1049,
5658,
9248,
10793,
10286,
11324,
9286,
2632,
9290,
8788,
10326,
4183,
7767,
8291,
9828,
10340,
8808,
2669,
1146,
3196,
6782,
9360,
10389,
4255,
5792,
4263,
10413,
6831,
9397,
7868,
6850,
2246,
2780,
734,
736,
10471,
... | Test |
7,081 | 4 | TotalRecovery:totalrecovery totalrecovery backup recovery software product developed farstone technology formerly known driveclone totalrecovery written c++ runs microsoft windows 32-bit 64-bit utility utilizes windows preinstallation environment allows users administer tasks loading operating system totalrecovery comes two editions express edition professional edition express edition requires installation fewer features compared professional edition | [
9025,
6797,
1358,
7983,
9910
] | None |
7,082 | 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 | [
4611,
516,
8837,
2825,
7435,
10127,
2321,
1814,
4887,
10394,
673,
3745,
10530,
9253,
8998,
10149,
11305,
7854,
2738,
4790,
439,
56,
59,
3903,
9279,
4673,
10433,
2375,
4039,
5959,
5322,
8907,
11086,
10451,
1110,
9048,
9693,
2914,
485,
3685... | Test |
7,083 | 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 | [
5492,
7983
] | Test |
7,084 | 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 | [
8752,
7156,
3741
] | Validation |
7,085 | 3 | Byzantine_fault:byzantine fault byzantine fault also interactive consistency source congruency error avalanche byzantine agreement problem byzantine generals problem byzantine failure condition computer system particularly distributed computing systems components may fail imperfect information whether component failed term takes name allegory byzantine generals problem developed describe condition actors must agree concerted strategy avoid catastrophic system failure actors unreliable byzantine fault component server inconsistently appear failed functioning failure-detection systems presenting different symptoms different observers difficult components declare failed shut network need first reach consensus regarding component failed first place byzantine fault tolerance bft dependability fault-tolerant computer system conditions byzantine fault fault presenting different symptoms different observers byzantine failure loss system service due byzantine fault systems require consensus objective byzantine fault tolerance able defend failures system components without symptoms prevent components system reaching agreement among agreement needed correct operation system remaining correctly operational components byzantine fault tolerant system able continue providing system service originally intended assuming sufficiently many accurately operating components maintain service byzantine failures considered general difficult class failures among failure modes so-called fail-stop failure mode occupies simplest end spectrum whereas fail-stop failure mode simply means way fail node crash detected nodes byzantine failures imply restrictions means failed node generate arbitrary data pretending correct one thus byzantine failures confuse failure detection systems makes fault tolerance difficult despite analogy byzantine failure necessarily security problem involving hostile human interference arise purely electrical faults terms fault failure used according standard definitions originally created joint committee fundamental concepts terminology formed ieee computer society technical committee dependable computing fault-tolerance ifip working group 10.4 dependable computing fault tolerance version definitions also described dependability wikipedia page problem obtaining byzantine consensus conceived formalized robert shostak dubbed interactive consistency problem work done 1978 context nasa-sponsored sift project computer science lab sri international sift software implemented fault tolerance brain child john wensley based idea using multiple general-purpose computers would communicate pairwise messaging order reach consensus even computers faulty beginning project clear many computers total needed guarantee conspiracy n faulty computers could thwart efforts correctly-operating ones reach consensus shostak showed minimum 3 n+ 1 needed devised two-round 3 n+1 messaging protocol would work n =1 colleague marshall pease generalized algorithm n 0 proving 3 n +1 necessary sufficient results together later proof leslie lamport sufficiency 3 n using digital signatures published seminal paper reaching agreement presence faults authors awarded 2005 edsger w. dijkstra prize paper make interactive consistency problem easier understand lamport devised colorful allegory group army generals formulate plan attacking city original version story cast generals commanders albanian army name changed eventually settling byzantine suggestion jack goldberg future-proof potential offense giving formulation problem together additional results presented authors 1982 paper byzantine generals problem simplest form generals must decide whether attack retreat generals may prefer attack others prefer retreat important thing every general agrees common decision halfhearted attack generals would become rout would worse either coordinated attack coordinated retreat problem complicated presence treacherous generals may cast vote suboptimal strategy may selectively instance nine generals voting four support attacking four others favor retreat ninth general may send vote retreat generals favor retreat vote attack rest received retreat vote ninth general retreat rest attack may go well attackers problem complicated generals physically separated send votes via messengers may fail deliver votes may forge false votes byzantine fault tolerance achieved loyal non-faulty generals majority agreement strategy default vote value given missing messages example missing messages given value null agreement null votes majority pre-assigned default strategy used e.g. retreat typical mapping story onto computer systems computers generals digital communication system links messengers although problem formulated analogy decision-making security problem electronics solved simply cryptographic digital signatures failures incorrect voltages propagate encryption process thus component may appear functioning one component faulty another prevents forming consensus whether component faulty several examples byzantine failures occurred given two equivalent journal papers examples described nasa dashlink web pages web pages also describe phenomenology cause byzantine faults byzantine errors observed infrequently irregular points endurance testing newly constructed virginia class submarines least 2005 issues publicly reported several solutions described lamport shostak pease 1982 began noting generals problem reduced solving commander lieutenants problem loyal lieutenants must act unison action must correspond commander ordered case commander loyal several system architectures designed c. 1980 implemented byzantine fault tolerance include draper ftmp honeywell mmfcs sri sift 1999 miguel castro barbara liskov introduced practical byzantine fault tolerance pbft algorithm provides high-performance byzantine state machine replication processing thousands requests per second sub-millisecond increases latency pbft several bft protocols introduced improve robustness performance instance q/u hq zyzzyva abstracts addressed performance cost issues whereas protocols like aardvark rbft addressed robustness issues furthermore adapt tried make use existing bft protocols switching adaptive way improve system robustness performance underlying conditions change furthermore bft protocols introduced leverage trusted components reduce number replicas e.g. a2m-pbft-ea minbft one example bft use bitcoin peer-to-peer digital cash system bitcoin network works parallel generate blockchain proof-of-work allowing system overcome byzantine failures reach coherent global view system state aircraft systems boeing 777 aircraft information management system via arinc 659 safebus network boeing 777 flight control system boeing 787 flight control systems use byzantine fault tolerance real-time systems byzantine fault tolerance solutions must low latency example safebus achieve byzantine fault tolerance within order microsecond added latency spacecraft flight systems spacex dragon consider byzantine fault tolerance design byzantine fault tolerance mechanisms use components repeat incoming message signature recipients incoming message mechanisms make assumption act repeating message blocks propagation byzantine symptoms systems high degree safety security criticality assumptions must proven true acceptable level fault coverage providing proof testing one difficulty creating sufficiently wide range signals byzantine symptoms testing likely require specialized fault injectors | [
9248,
8674,
70,
8671,
7499,
3982,
9753,
4817,
7315,
11379,
10102,
8025,
121,
11612,
1087
] | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.