node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
2,386 | 9 | Program_lifecycle_phase:program lifecycle phase program lifecycle phases stages computer program undergoes initial creation deployment execution phases edit time compile time link time distribution time installation time load time run time lifecycle phases necessarily happen linear order intertwined various ways example modifying program software developer may need repeatedly edit compile install execute computer ensure sufficient quality distributed users copies modified program downloaded installed executed users computers edit time source code program edited spans initial creation bug fix refactoring addition new features editing typically performed person automated design tools metaprogramming systems may also used compile time source code translated machine code compiler part involves language checking ensuring proper use type system result successful compilation executable link time connects necessary machine code components program including externals common programs use functions implemented external libraries must properly linked together two types linking static linking connection made compiler always prior execution dynamic linking however performed operating system os even execution distribution time process transferring copy program user distribution format typically executable may also source code especially program written interpreted language means distribution physical media usb flash drive remote download via internet installation time gets distributed program ready execution user computer often includes storing executable future loading os load time os takes program executable storage hard drive places active memory order begin execution run time execution phase central processing unit executes program machine code instructions programs may run indefinitely execution terminates either normal expected behavior abnormality crash | [
1952,
7018,
10013,
7983,
1776,
5395,
2804,
4309,
11160,
7421
] | Test |
2,387 | 4 | BNC_(software):bnc software bnc short bounced network connection piece software used relay traffic connections computer networks much like proxy using bnc allows user hide original source user connection providing privacy well ability route traffic specific location bnc also used hide true target user connects one common usage internet relay chat irc via bnc running remote servers environment easy ascertain user ip address bnc may help hide original connection source well providing opportunity vhosts virtual hosts use vhost conceal connection better merely adds statement hostname many bncs remain connected irc server event client disconnect internet often state changes tracked may relayed client upon reconnection implementations opt store messages sent across network client would normally received send upon clients reconnection often considered much resource dependent commercial hosting services provide logging features bot like functions may included various implementations standard list bouncer software bncs also often used file transfer protocol ftp hide user server route traffic specific location ftp bouncers divided two different categories entry traffic entry bouncer acts gateway server hide existence actual server entry bouncers like cubnc used multi-server setup easy access server load balancing removes need select ftp server log trying access server farm traffic bouncers relay traffic host installed used appears bouncer actually ftp server thus hiding real location server completely multiple traffic bouncers installed parallel order balance traffic load across different links elaborate bouncers even bounce secure ssl/tls connections | [
5760,
5251,
5316,
7364,
8582,
4490,
8554,
5677,
5199,
6993,
692,
4725,
3030,
5591,
7384,
7861,
5819,
8157
] | Test |
2,388 | 3 | Apple_A6:apple a6 apple a6 32-bit package package pop system chip soc designed apple inc. introduced september 12 2012 launch iphone 5 apple states twice fast twice graphics power compared predecessor apple a5 software updates devices using chip ceased 2017 release ios 11 apple a6 said use 1.3 ghz custom apple-designed armv7-a architecture based dual-core cpu called swift rather licensed cpu arm like previous designs integrated 266 mhz triple-core powervr sgx543mp3 graphics processing unit gpu swift core a6 uses new tweaked instruction set featuring elements arm cortex-a15 support advanced simd v2 vfpv4 analysis suggests swift core triple-wide frontend two fpus compared two-wide core single fpu cortex-a9 based predecessor a6 processor package also incorporates 1 gb lpddr2-1066 ram compared 512mb lpddr2-800 ram apple a5 providing double memory capacity increasing theoretical memory bandwidth 6.4 gb/s 8.5 gb/s a6 includes upgraded image signal processor isp compared isp a5 improves speed image capture low-light performance noise reduction video stabilization a6 manufactured samsung high-κ metal gate hkmg 32 nm process chip 96.71 mm large 22 smaller a5 a6 also consumes less energy predecessor version a6 higher frequency four graphic cores called apple a6x found fourth generation ipad apple a6 chip used iphones ipads generation ipod touch ipad minis apple tvs | [
9732,
1549,
7697,
4114,
9235,
11282,
6165,
11289,
7706,
8222,
1057,
2551,
38,
6183,
1576,
4139,
6700,
7211,
8237,
9774,
2097,
9784,
8250,
8253,
576,
7745,
1090,
7747,
2635,
8783,
4180,
10838,
10840,
9312,
9826,
99,
8806,
3691,
8812,
6258,... | None |
2,389 | 6 | Compact_Pro:compact pro compact pro software data compression utility archiving compressing files apple macintosh platform major competitor stuffit early 1990s producing smaller archives less time able create self-extracting archives without use external program well distributed via shareware greatly helped popularity pc version also available extractorpc neither program actively supported introduced early 1990s compact pro originally known compactor competed stuffit suffering neglect original developer moved projects compact pro sported clean interface variety new features quickly made favorite among digerati quickly drove stuffit leadership position became popular bbs systems stuffit 3.0 fought back even powerful compression algorithm shareware version called stuffit lite features freeware stuffit expander could decompress stuffit archives compact pro archives compact pro never really regained momentum release stuffit expander maintained niche among loyal users preparation tool cyclos smaller installer delivery package notably used ambrosia software disappeared market late 1990s compact pro also served inspiration zipit pkzip-compatible archiver expressly designed look work like compact pro like archiver systems compact pro primary purpose package compress files transmission extract side link unlike systems compact pro used non-modal mac-like ui widely lauded press notable features included ability extract everything archive double-clicking finder key held automatically recognizing converting binhex formatted files back native format without separate step compact pro also featured easy-to-use system splitting files parts fit floppy disks feature archivers implemented external program odd oft-used feature ability include images notes would display archive opened using basic mechanism teachtext compact pro also included ability produce self-extracting archives although becoming common archivers time particular implementation notable extractor stub code quite small 13 kb compared stuffit 38 kb era 14400 bit/s modems worthwhile savings many considered even large bother number small third-party utilities strip stub existing archive compact pro stub could also expand files split parts rare feature time time introduction compact pro offered far fastest best compression mac use compactor files never 1 larger stuffit deluxe better best guess modes anywhere 25 400 faster ironically compact pro even faster stuffit extracting stuffit files often least double performance also allowed background operation multifinder speed remained superior systems even major upgrades ended testing late 1990s show remaining significantly faster smaller versions stuffit years later normal archives created compact pro use .cpt file extension self-extracting versions used .sea file extensions normally needed mac commonly used archives would typically stored system would normally require pcs instance | [
2432,
6022,
3114,
9388,
2095,
7983,
4406,
576,
10817,
11076,
3659,
10317,
4174,
4561,
722,
3804,
1121,
5096,
10857,
237
] | Test |
2,390 | 3 | Northbound_interface:northbound interface computer networking computer architecture northbound interface component interface conceptualizes lower level details e.g. data functions used component northbound interface used interface higher level layers using southbound interface higher level component architectural overviews northbound interface normally drawn top component defined hence name northbound interface southbound interface decomposes concepts technical details mostly specific single component architecture southbound interfaces drawn bottom architectural overview northbound interfaces normally talk southbound interfaces higher level components vice versa northbound interface typically output-only interface opposed one accepts user input found carrier-grade network telecommunications network elements languages protocols commonly used include snmp tl1 example device capable sending syslog messages configurable user said implement northbound interface examples include smash ipmi wsman soap etc | [
6273,
6403,
8262,
9932,
10486,
3133
] | None |
2,391 | 3 | Windows_Embedded_CE_6.0:windows embedded ce 6.0 windows embedded ce 6.0 codenamed yamazaki sixth major release microsoft windows embedded operating system targeted enterprise specific tools industrial controllers consumer electronics devices like digital cameras ce 6.0 features kernel supports 32,768 processes 32 process limit prior versions process receives 2 gb virtual address space 32 mb windows embedded ce 6.0 released november 1 2006 includes partial source code os currently serves basis zune hd windows mobile 6.5 based windows ce 5.2 windows phone 7 first major release windows phone operating system based windows embedded ce 6.0 r3 although windows phone 7 also using windows embedded compact 7 features windows embedded ce 6.0 r3 finalized september 2009 oems serves base platform zune hd windows phone 7 ce 6.0 r3 includes following new features abilities note features listed specific windows phone 7 zune hd | [
8576,
641,
2179,
3463,
651,
6797,
8080,
3857,
7057,
8976,
2196,
10896,
11283,
11539,
4505,
3235,
4515,
11301,
3496,
6441,
6697,
1581,
5293,
6062,
3250,
3890,
9910,
6462,
1471,
7615,
321,
7106,
582,
4423,
1098,
10957,
9173,
11605,
3289,
43... | None |
2,392 | 9 | Steel_Bank_Common_Lisp:steel bank common lisp steel bank common lisp sbcl free common lisp implementation features high-performance native compiler unicode support threading name steel bank common lisp reference carnegie mellon university common lisp sbcl forked andrew carnegie made fortune steel industry andrew mellon successful banker sbcl descends cmucl descended spice lisp including early implementations mach operating system ibm rt pc three rivers computing corporation perq computer 1980s william newman originally announced sbcl variant cmucl december 1999 main point divergence time clean bootstrapping procedure cmucl requires already compiled executable binary compile cmucl source code whereas sbcl supported bootstrapping theoretically ansi-compliant common lisp implementation sbcl became sourceforge project september 2000 original rationale fork continue initial work done newman without destabilizing cmucl time already mature much-used implementation forking amicable since significant flows code cross-pollination two projects since sbcl attracted several developers ported multiple hardware architectures operating systems undergone many changes enhancements dropped support several cmucl extensions considers beyond scope project motif interface also developed many new ones including native threading unicode support version 1.0 released november 2006 active development continues william newman stepped project administrator sbcl april 2008 several developers taken interim management releases time tenth anniversary sbcl workshop organized | [
10752,
11269,
2062,
9231,
9749,
8728,
4633,
4122,
8226,
2105,
6201,
6717,
8258,
8771,
1613,
9299,
3675,
7267,
8293,
3176,
2666,
2667,
5751,
7805,
9865,
6797,
9875,
9877,
4779,
5803,
2225,
8883,
7867,
4799,
7880,
8908,
205,
7896,
10463,
73... | Validation |
2,393 | 1 | Inspec:inspec inspec major indexing database scientific technical literature published institution engineering technology iet formerly institution electrical engineers iee one iet forerunners inspec coverage extensive fields physics computing control engineering subject coverage includes astronomy electronics communications computers computing computer science control engineering electrical engineering information technology physics manufacturing production mechanical engineering due emerging concept technology business inspec also includes information technology business portfolio inspec indexed journals publishing high quality research integrating technology management economics social sciences domains sample journals include annual review financial economics aslib journal information management australian journal management international journal management economics social sciences inspec started 1967 outgrowth science abstracts service electronic records distributed magnetic tape 1980s available u.s. knowledge index low-priced dial-up version dialog service individual users made popular nearly 50 years iet employed scientists manually review items included inspec hand-indexing literature using expertise subject area make judgement call terms classification codes applied thanks work significant thesaurus developed enables content indexed far accurately context turn helps end-users discover relevant literature may otherwise remained hidden typical search queries making inspec essential tool prior art patentability searches patent drafting access inspec currently internet inspec direct various resellers inspec several print counterparts computer control abstracts frequency 12 per year covers computers computing information technology electrical electronics abstracts frequency 12 per year covers topics telecommunications electronics radio electrical power optoelectronics printed indexes subject author indexes subject guide produced twice per year physics abstracts frequency 24 per year abstracting indexing service first published institution electrical engineers first circulated science abstracts volume 1 volume 5 1898 1902 1903 1971 database different titles closely related names science abstracts section physics science abstracts section physics abstracts volume 6 volume 74 1972 societies associated authors service american institute physics 1975 1976 institute electrical electronics engineers also became author 1980 database also issued inspec-physics various formats also available part inspec database presently part inspec section physics database time physics abstracts title employed throughout 1990s science fiction writer arthur c. clarke b.s degree physics mathematics honors king college assistant editor physics abstracts 1949–1951 position allowed clarke access world ’ leading scientific journals first issue science abstracts published january 1898 first year total 1,423 abstracts published monthly intervals end year author subject index added first issue contained 110 abstracts divided 10 sections science abstracts result joint collaboration institution electrical engineers iee physical society london publication time provided without charge members societies cost publication mainly borne iee physical society financial contributions also received institution civil engineers royal society british association advancement science 1902 annual number abstracts published increased 2,362 may 1903 decided split publication two parts physics b electrical engineering decision allowed subject scope widen particularly physics result allowed larger quantity material covered since 1967 electronic access science abstracts provided inspec | [] | Test |
2,394 | 7 | Supercomputer_architecture:supercomputer architecture approaches supercomputer architecture taken dramatic turns since earliest systems introduced 1960s early supercomputer architectures pioneered seymour cray relied compact innovative designs local parallelism achieve superior computational peak performance however time demand increased computational power ushered age massively parallel systems supercomputers 1970s used processors 1990s machines thousands processors began appear end 20th century massively parallel supercomputers tens thousands off-the-shelf processors norm supercomputers 21st century use 100,000 processors graphic units connected fast connections throughout decades management heat density remained key issue centralized supercomputers large amount heat generated system may also effects reducing lifetime system components diverse approaches heat management pumping fluorinert system hybrid liquid-air cooling system air cooling normal air conditioning temperatures systems massive number processors generally take one two paths one approach e.g. grid computing processing power large number computers distributed diverse administrative domains opportunistically used whenever computer available another approach large number processors used close proximity e.g. computer cluster centralized massively parallel system speed flexibility interconnect becomes important modern supercomputers used various approaches ranging enhanced infiniband systems three-dimensional torus interconnects since late 1960s growth power proliferation supercomputers dramatic underlying architectural directions systems taken significant turns early supercomputers relied small number closely connected processors accessed shared memory supercomputers 21st century use 100,000 processors connected fast networks throughout decades management heat density remained key issue centralized supercomputers seymour cray get heat motto central design philosophy continued key issue supercomputer architectures e.g. large-scale experiments blue waters large amount heat generated system may also effects reducing lifetime system components diverse approaches heat management e.g cray 2 pumped fluorinert system system x used hybrid liquid-air cooling system blue gene/p air-cooled normal air conditioning temperatures heat aquasar supercomputer used warm university campus heat density generated supercomputer direct dependence processor type used system powerful processors typically generating heat given similar underlying semiconductor technologies early supercomputers used fast closely packed processors took advantage local parallelism e.g. pipelining vector processing time number processors grew computing nodes could placed away e.g. computer cluster could geographically dispersed grid computing number processors supercomputer grows component failure rate begins become serious issue supercomputer uses thousands nodes may fail per year average system experience several node failures day price/performance general purpose graphic processors gpgpus improved number petaflop supercomputers tianhe-i nebulae started rely however systems k computer continue use conventional processors sparc-based designs overall applicability gpgpus general purpose high performance computing applications subject debate gpgpu may tuned score well specific benchmarks overall applicability everyday algorithms may limited unless significant effort spent tune application towards however gpus gaining ground 2012 jaguar supercomputer transformed titan replacing cpus gpus number independent processors supercomputer increases way access data file system share access secondary storage resources becomes prominent years number systems distributed file management developed e.g ibm general parallel file system beegfs parallel virtual file system hadoop etc number supercomputers top100 list tianhe-i use linux lustre file system cdc 6600 series computers early attempts supercomputing gained advantage existing systems relegating work peripheral devices freeing cpu central processing unit process actual data minnesota fortran compiler 6600 could sustain 500 kiloflops standard mathematical operations early supercomputers cray 1 cray 2 appeared afterwards used small number fast processors worked harmony uniformly connected largest amount shared memory could managed time early architectures introduced parallel processing processor level innovations vector processing processor perform several operations one clock cycle rather wait successive cycles time number processors increased different architectural issues emerged two issues need addressed number processors increases distribution memory processing distributed memory approach processor physically packaged close local memory memory associated processors away based bandwidth latency parameters non-uniform memory access 1960s pipelining viewed innovation 1970s use vector processors well established 1980s many supercomputers used parallel vector processors relatively small number processors early systems allowed easily use shared memory architecture allows processors access common pool memory early days common approach use uniform memory access uma access time memory location similar processors use non-uniform memory access numa allowed processor access local memory faster memory locations cache-only memory architectures coma allowed local memory processor used cache thus requiring coordination memory values changed number processors increases efficient interprocessor communication synchronization supercomputer becomes challenge number approaches may used achieve goal instance early 1980s cray x-mp system shared registers used approach processors access shared registers move data back forth used interprocessor communication synchronization however inherent challenges managing large amount shared memory among many processors resulted move distributed architectures 1980s demand computing power increased trend much larger number processors began ushering age massively parallel systems distributed memory distributed file systems given shared memory architectures could scale large number processors hybrid approaches distributed shared memory also appeared early systems computer clustering approach connects number readily available computing nodes e.g personal computers used servers via fast private local area network activities computing nodes orchestrated clustering middleware software layer sits atop nodes allows users treat cluster large one cohesive computing unit e.g via single system image concept computer clustering relies centralized management approach makes nodes available orchestrated shared servers distinct approaches peer peer grid computing also use many nodes far distributed nature 21st century top500 organization semiannual list 500 fastest supercomputers often includes many clusters e.g world fastest 2011 k computer distributed memory cluster architecture large number local semi-independent computing nodes used e.g cluster architecture speed flexibility interconnect becomes important modern supercomputers taken different approaches address issue e.g tianhe-1 uses proprietary high-speed network based infiniband qdr enhanced feiteng-1000 cpus hand blue gene/l system uses three-dimensional torus interconnect auxiliary networks global communications approach node connected six nearest neighbors similar torus used cray t3e massive centralized systems times use special-purpose processors designed specific application may use field-programmable gate arrays fpga chips gain performance sacrificing generality examples special-purpose supercomputers include belle deep blue hydra playing chess gravity pipe astrophysics mdgrape-3 protein structure computation molecular dynamics deep crack breaking des cipher grid computing uses large number computers distributed diverse administrative domains opportunistic approach uses resources whenever available example boinc volunteer-based opportunistic grid system boinc applications reached multi-petaflop levels using close half million computers connected internet whenever volunteer resources become available however types results often appear top500 ratings run general purpose linpack benchmark although grid computing success parallel task execution demanding supercomputer applications weather simulations computational fluid dynamics remained reach partly due barriers reliable sub-assignment large number tasks well reliable availability resources given time quasi-opportunistic supercomputing large number geographically disperse computers orchestrated built-in safeguards quasi-opportunistic approach goes beyond volunteer computing highly distributed systems boinc general grid computing system globus allowing middleware provide almost seamless access many computing clusters existing programs languages fortran c distributed among multiple computing resources quasi-opportunistic supercomputing aims provide higher quality service opportunistic resource sharing quasi-opportunistic approach enables execution demanding applications within computer grids establishing grid-wise resource allocation agreements fault tolerant message passing abstractly shield failures underlying resources thus maintaining opportunism allowing higher level control air-cooled ibm blue gene supercomputer architecture trades processor speed low power consumption larger number processors used room temperature using normal air-conditioning second-generation blue gene/p system processors integrated node-to-node communication logic energy-efficient achieving 371 mflops/w k computer water-cooled homogeneous processor distributed memory system cluster architecture uses 80,000 sparc64 viiifx processors eight cores total 700,000 cores—almost twice many system comprises 800 cabinets 96 computing nodes 16 gb memory 6 i/o nodes although powerful next five systems top500 list combined 824.56 mflops/w lowest power performance ratio current major supercomputer system follow system k computer called primehpc fx10 uses six-dimensional torus interconnect still one processor per node unlike k computer tianhe-1a system uses hybrid architecture integrates cpus gpus uses 14,000 xeon general-purpose processors 7,000 nvidia tesla general-purpose graphics processing units gpgpus 3,500 blades 112 computer cabinets 262 terabytes distributed memory 2 petabytes disk storage implemented via lustre clustered files tianhe-1 uses proprietary high-speed communication network connect processors proprietary interconnect network based infiniband qdr enhanced chinese made feiteng-1000 cpus case interconnect system twice fast infiniband slower interconnects supercomputers limits specific approaches continue tested boundaries reached large scale experiments e.g. 2011 ibm ended participation blue waters petaflops project university illinois blue waters architecture based ibm power7 processor intended 200,000 cores petabyte globally addressable memory 10 petabytes disk space goal sustained petaflop led design choices optimized single-core performance hence lower number cores lower number cores expected help performance programs scale well large number processors large globally addressable memory architecture aimed solve memory address problems efficient manner type programs blue waters expected run sustained speeds least one petaflop relied specific water-cooling approach manage heat first four years operation national science foundation spent 200 million project ibm released power 775 computing node derived project technology soon thereafter effectively abandoned blue waters approach architectural experiments continuing number directions e.g cyclops64 system uses supercomputer chip approach direction away use massive distributed processors 64-bit cyclops64 chip contains 80 processors entire system uses globally addressable memory architecture processors connected non-internally blocking crossbar switch communicate via global interleaved memory data cache architecture half sram bank used scratchpad memory although type architecture allows unstructured parallelism dynamically non-contiguous memory system also produces challenges efficient mapping parallel algorithms many-core system | [
3328,
1933,
785,
7699,
11027,
6421,
6677,
7963,
6815,
9762,
5798,
9126,
6184,
2345,
4909,
1454,
3886,
4270,
4017,
7218,
10288,
10675,
8501,
823,
9911,
8122,
5948,
4286,
2113,
8514,
10051,
5956,
4423,
1480,
7497,
1866,
8523,
4308,
3197,
34... | Test |
2,395 | 6 | List_of_file_systems:list file systems following lists identify characterize link thorough information computer file systems many older operating systems support one native file system bear name apart name operating system disk file systems usually block-oriented files block-oriented file system sequences blocks often featuring fully random-access read write modify operations file systems built-in checksumming either mirroring parity extra redundancy one several block devices solid state media flash memory similar disks interfaces different problems low level require special handling wear leveling different error detection correction algorithms typically device solid-state drive handles operations internally therefore regular file system used however certain specialized installations embedded systems industrial applications file system optimized plain flash memory advantageous record-oriented file systems files stored collection records typically associated mainframe minicomputer operating systems programs read write whole records rather bytes arbitrary byte ranges seek record boundary within records sophisticated record-oriented file systems common simple databases file systems shared-disk file systems also called shared-storage file systems san file system clustered file system even cluster file systems primarily used storage area network nodes directly access block storage file system located makes possible nodes fail without affecting access file system nodes shared-disk file systems normally used high-availability cluster together storage hardware raid shared-disk file systems normally scale 64 128 nodes shared-disk file systems may symmetric metadata distributed among nodes asymmetric centralized metadata servers distributed file systems also called network file systems many implementations made location dependent access control lists acls unless otherwise stated distributed fault-tolerant replication data nodes servers servers/clients high availability offline disconnected operation distributed parallel file systems stripe data multiple servers high performance normally used high-performance computing hpc distributed parallel file systems use object storage device osd lustre called ost chunks data together centralized metadata servers distributed file systems also parallel fault tolerant stripe replicate data multiple servers high performance maintain data integrity even server fails data lost file systems used high-performance computing hpc high-availability clusters file systems listed focus high availability scalability high performance unless otherwise stated development may called cooperative storage cloud really file systems allow access file systems operating system standpoint | [
5120,
2564,
6153,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
1049,
3611,
5661,
9249,
9762,
5158,
3628,
5170,
6198,
2616,
7225,
11323,
9277,
576,
8772,
8774,
3656,
5709,
2129,
1109,
4193,
11363,
4708,
5220,
6248,
9835,
9836,
7789,
5231,
52... | None |
2,396 | 3 | Sun-Ni_law:sun-ni law sun-ni law sun ni law also known memory-bounded speedup memory-bounded speedup model states computing power increases corresponding increase problem size constrained system ’ memory capacity general system grows computational power problems run system increase size analogous amdahl law says problem size remains constant system sizes grow gustafson law proposes problem size scale bound fixed amount time sun-ni law states problem size scale bound memory capacity system sun-ni law initially proposed xian-he sun lionel ni proceedings ieee supercomputing conference 1990 increasing disparity cpu speed memory data access latency application execution time often depends memory speed system predicted sun ni data access become premier performance bottleneck high-end computing fact one see intuition behind sun-ni law system resources increase applications often bottlenecked memory speed bandwidth thus application achieve larger speedup utilizing memory capacity system sun-ni law applied different layers memory hierarchy system l1 cache main memory memory-bounded function w=g reveals trade-off computing memory algorithm system architecture design three speedup models sun-ni gustafson amdahl provide metric analyze speedup parallel computing amdahl ’ law focuses time reduction given fixed-size problem amdahl ’ law states sequential portion problem algorithm limits total speedup achieved system resources increase gustafson ’ law suggests beneficial build large-scale parallel system speedup grow linearly system size problem size scaled maintain fixed execution time yet memory access latency often becomes dominant factor application ’ execution time applications may scale meet time bound constraint sun-ni law instead constraining problem size time constrains problem memory capacity system words bounds based memory sun-ni law generalization amdahl law gustafson law memory-bounded function g =1 resolves amdahl law memory-bounded function g =m number processors resolves gustafson law let formula_1 scaled workload memory space constraint memory bounded speedup defined suppose formula_2 portion workload parallelized formula_3 sequential portion workload let formula_4 function reflects parallel workload increase factor memory capacity increases times let formula_5 formula_6 formula_7 memory capacity one node thus formula_8 memory bounded speedup formula_9 power function formula_10 rational numbers b formula_11 formula_12 power function coefficient 1 thus taking highest degree term determine complexity algorithm rewrite memory bounded speedup formula_13 equation formula_14 represents influence memory change change problem size suppose formula_15 memory-bounded speedup model reduces amdahl law since problem size fixed independent resource increase suppose formula_16 memory-bounded speedup model reduces gustafson law means memory capacity increases times workload also increases times data needed local every node system often simplicity matching notation amdahl law gustafson law letter g used represent memory bound function formula_14 n replaces using notation get formula_18 suppose one would like determine memory-bounded speedup matrix multiplication memory requirement matrix multiplication roughly formula_19 n dimension two n x n source matrices computation requirement formula_20 thus formula_21 formula_22 thus memory-bounded speedup matrix multiplication formula_23 following another matrix multiplication example illustrates rapid increase parallel execution time execution time n x n matrix uniprocessor formula_24 memory usage formula_25 suppose 10000 -by- 10000 matrix takes 800 mb memory factorized 1 hour uniprocessor scaled workload suppose possible factorize 320,000 -by- 320,000 matrix 32 hours time increase quite large increase problem size may valuable someones whose premier goal accuracy example astrophysicist may interested simulating n-body problem number particles large possible example shows computation intensive applications memory capacity need proportionally scale computing power memory-bounded speedup model first work reveal memory performance constraint high-end computing presents quantitative mathematical formulation trade-off memory computing based memory-bounded function w=g n w work thus also computation applications memory requirement terms capacity g reuse rate w=g gives simple effective description relation computation memory requirement architecture viewpoint memory-bounded model suggests size well speed cache match cpu performance today modern microprocessors pentium pro alpha 21164 strong arm sa110 longson-3a use 80 transistors on-chip cache rather computing components algorithm design viewpoint reduce number memory accesses reuse data possible function g gives reuse rate today term memory bound functions become general term refers functions involve extensive memory access memory complexity analysis become discipline computer algorithm analysis | [
5798,
9932,
108,
10734,
785,
2066,
10548
] | Validation |
2,397 | 6 | UnionFS:unionfs unionfs filesystem service linux freebsd netbsd implements union mount file systems allows files directories separate file systems known branches transparently overlaid forming single coherent file system contents directories path within merged branches seen together single merged directory filesystem mounting branches priority one branch specified branches contain file name different branches may either read-only read-write file systems writes virtual merged copy directed specific real file system allows file system appear writable without actually allowing writes change file system also known copy-on-write may desirable media physically read-only case live cds unionfs originally developed professor erez zadok team stony brook university knoppix union file system cd-rom dvd file system contained image file called knoppix.img knoppix-data.img knoppix 7 writable drive usb memory stick made writable drive priority read-only filesystem allows user change files system new file stored image transparently used instead one cd unionfs also used create single common template number file systems security reasons sometimes used ad hoc snapshotting system docker uses unionfs layer docker images actions done base image layers created documented layer fully describes recreate action strategy enables docker lightweight images layer updates need propagated compared full vms example ubuntultsp linux terminal server project implementation ubuntu uses unionfs pxe booting thin thick clients unionfs linux two versions version 1.x standalone one built module version 2.x newer redesigned reimplemented one aufs alternative version unionfs overlayfs written miklos szeredi used openwrt considered ubuntu merged mainline linux kernel 26 october 2014 many years development discussion version 3.18 kernel unionfs-fuse independent project implemented user space filesystem program instead kernel module patch like unionfs supports copy-on-write read-only read-write branches plan 9 bell labs operating system uses union mounts extensively build custom namespaces per user processes union mounts also available bsd since least 1995 gnu hurd implementation unionfs january 2008 works results read-only mount-point mhddfs works like unionfs permits balancing files drives free space available implemented user space filesystem mergerfs fuse based union filesystem offers multiple policies accessing writing files well advanced features xattrs managing mixed ro rw drives link cow etc. sun microsystems introduced first implementation stacked layered file system copy-on-write whiteouts hiding files lower layers higher layers etc translucent file service sunos 3 circa 1986 jailbreakme 3.0 tool jailbreaking ios devices released july 2011 uses unionfs techniques speed installation process operating system modification | [
5120,
2051,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
10774,
3611,
9249,
9762,
5158,
7225,
11323,
8772,
8266,
1109,
10851,
4708,
9836,
7789,
9333,
6263,
9335,
1150,
9343,
8837,
7818,
654,
2193,
2194,
2197,
2199,
11419,
6309,
1190,
... | Train |
2,398 | 9 | SheerPower4GL:sheerpower4gl sheerpower 4gl fourth-generation programming language developed touch technologies inc sheerpower 4gl result porting touch technologies intouch 4gl programming language runs openvms dec alpha vax computers windows launching 2000 downloads free official sheerpower 4gl website sheerpower 4gl similar basic programming language easy learn sheerpower 4gl several key features 1 free hobbyists non-profit organizations 2 extremely fast able compile millions lines per minute modern systems 3 web scripting features make fast easy develop dynamic web pages using sheerpower basic-like syntax version 5.0 official release containing syntax logic web scripting sheerpower 4 sheerpower utilizes perfect precision math package patent 7149765 apparatus method precision binary numbers numerical operations applied precision math eliminates rounding errors experienced using floating point data type 5 sheerpower comes bundled ars advanced record system database engine ars proprietary database engine also developed touch technologies inc. tti created ars engine performance critical many applications example ars 20 times faster mysql shared read/write operations 6 open database connectivity sheerpower supports database engines odbc interface ars engine accessed via odbc database applications 7 sheerpower internet services spins webserver also comes bundled sheerpower 4gl spins webserver comes bundled sheerpower developed simplicity use high-speed performance modern multi-core system spins web server perform 1,000 page hits per second—given enough bandwidth course 8 also common gateway interface cgi interface built sheerpower along many built-in functions designed high-performance increased programmer productivity sheerpower 4gl following built-in security features 1 run sheerpower program windows temporary folder stops computer viruses written sheerpower programs emailed run email opened 2 sheerpower mix data code database operation makes impervious sql injection attacks binary distribution available microsoft windows nt 2000 2003 xp vista virtual machine downloaded alone purpose running .spsrc .sprun programs sheerpower source code files deployed files code encrypted software free non-commercial use terms undefined besides levels support business customers non-profit organizations hobbyist programmers use free license comes download license fees outlined wanting develop applications commercial business use high-priority support packages available email web forum support available charge | [
899,
3142,
4042,
7022,
11604,
2485
] | Validation |
2,399 | 2 | Multi-user_software:multi-user software multi-user software software allows access multiple users computer time-sharing systems multi-user systems batch processing systems mainframe computers may also considered multi-user avoid leaving cpu idle waits i/o operations complete however term multitasking common context example unix server multiple remote users access via serial port secure shell unix shell prompt time another example uses multiple x window sessions spread across multiple terminals powered single machine example use thin client similar functions also available mp/m concurrent dos multiuser dos flexos multi-user operating systems windows versions windows nt family support simultaneous access multiple users example via remote desktop connection well ability user disconnect local session leaving processes running work behalf another user logs uses system operating system provides isolation user processes users enabling execute concurrently management systems implicitly designed used multiple users typically one system administrator end-user community complementary term single-user commonly used talking operating system usable one person time reference single-user software license agreement multi-user operating systems unix sometimes single user mode runlevel available emergency maintenance | [
9222,
5243,
6797,
8976,
276,
2201,
7325,
3873,
9633,
2852,
2345,
9643,
7983,
7857,
11442,
6837,
8504,
6329,
7999,
3395,
9540,
11075,
4298,
9162,
11596,
9166,
10318,
5840,
11219,
9438,
3167,
10590,
5985,
11489,
7523,
5220,
10341,
486,
3178,
... | Validation |
2,400 | 7 | MindTouch:mindtouch mindtouch american multinational technology company headquartered san diego california designs develops sells saas computer software online services company software products include mindtouch formerly called mindtouch responsive mindtouch 4 mindtouch tcs mindtouch core mindtouch allows team create publish edit content structure content within responsive user interface online services include touchpoints crm integrations success program custom software development team helps branding information architecture custom integrations new existing customers mindtouch founded aaron fulkerson steve bjorg 2005 january 2016 mindtouch announced series venture capital funding round totaling 12 million usd peakspan capital led round participation sk ventures sap se mindtouch started mediawiki 2005 first release name dekiwiki occurred july 2006 featuring xhtml place wikitext wysiwyg editor lucene-based search main functionality mindtouch wiki access php frontend provided wiki along wysiwyg editor multi-language support named polyglot allows switching interface content languages per page per section per user basis multilingual wikis engine prioritizes search results user ’ default language mindtouch cites 8.05 release deki first polyglot application web mindtouch core allowed user access edit pages stored xml rather wikitext mindtouch core open-source enterprise web-based wiki software mashup platform pages edited using gui editor could manipulated xml web service software supported authentication apache iis modules permissions could applied individual pages page hierarchies open source version mindtouch core distributed sourceforge terms gnu general public license parts gnu lesser general public license apache license dekiscript lightweight interpreted programming language allows users add dynamic content mindtouch pages mindtouch core allowed embedded directly web pages extended xml extensions mindtouch core used multiple connectors perform mashups mindtouch core shipped extensions allowing connection numerous online services including systems google maps windows live flickr yahoo unsupported commercial license enabled features connectors sugarcrm salesforce linkedin mysql microsoft sql server microsoft access april 9 2013 mindtouch inc. announced would longer support open source offering mindtouch core last open-source releases mindtouch core still available sourceforge mindtouch 4 developed open-source mindtouch core source code base mindtouch current version software service second iteration mindtouch 4 mindtouch allows team create publish edit content structure content within responsive user interface integration partnerships crm vendors sap salesforce.com provide support agents ability use mindtouch content customer support workflows amazon ’ aws also partnered mindtouch january 2016 mindtouch announced series venture capital funding round totaling 12 million usd peakspan capital led round participation sk ventures sap se mindtouch cloud infrastructure delivers weekly update bug fixes feature changes mindtouch forked mediawiki 2005 first release name dekiwiki occurred july 2006 featuring xhtml place wikitext wysiwyg editor lucene-based search consequently backend completely reimplemented c resulting api built web services top new dream distributed rest application manager server toolset mindtouch responsive latest version mindtouch saas offering replacing mindtouch 4 mindtouch 4 forked internally within mindtouch inc. open-source mindtouch core source code base early 2010 addition legacy php c components mindtouch core mindtouch responsive software infrastructure includes technologies nodejs elasticsearch f amazon sqs amazon lambda amazon redshift redis haproxy puppet | [
7450,
467,
8644
] | Test |
2,401 | 2 | NuGet:nuget nuget free open-source package manager designed microsoft development platform formerly known nupack since introduction 2010 nuget evolved larger ecosystem tools services nuget distributed visual studio extension starting visual studio 2012 nuget comes pre-installed default nuget also integrated sharpdevelop nuget also used command line automated scripts supports multiple programming languages including chocolatey machine-level package manager installer software packages built windows nt platform execution engine using nuget packaging infrastructure windows powershell provide automation tool installing software windows machines designed simplify process user perspective name extension pun nuget nougat everyone loves chocolatey nougat chocolatey invoked packagemanagement module formerly 'oneget powershell version 5.0 | [
10760,
8213,
6680,
9245,
1055,
5155,
8227,
5670,
7722,
5677,
9263,
6709,
8246,
10817,
4674,
8262,
2631,
4174,
83,
3667,
6227,
603,
608,
9324,
1138,
2168,
5754,
7293,
6797,
10900,
10902,
11414,
3224,
10394,
4775,
6828,
5819,
190,
5320,
430... | Validation |
2,402 | 2 | IFilter:ifilter ifilter plugin allows microsoft search engines index various file formats documents email attachments database records audio metadata etc become searchable without appropriate ifilter contents file parsed indexed search engine obtained standalone packages bundled certain software adobe reader libreoffice microsoft office openoffice also refers software interface needed implement plugins ifilter acts plug-in extracting full-text metadata search engines search engine usually works two steps step 1 search engine n't understand format document therefore looks windows registry appropriate ifilter extract data document format filtering embedded formatting non-textual data windows indexing service newer windows search windows desktop search msn desktop search internet information server sharepoint portal server windows sharepoint services wss site server exchange server sql server products based microsoft search technology support indexing technology also ifilters used sql server component sql server full text search service | [
11270,
5643,
4624,
537,
540,
3102,
9762,
8227,
8740,
1577,
10281,
2101,
10812,
3648,
10310,
1098,
7754,
10828,
4173,
4174,
9808,
4178,
10839,
603,
9819,
2146,
3170,
622,
9839,
4210,
7796,
1656,
6265,
7290,
4731,
10879,
8841,
651,
6797,
21... | Validation |
2,403 | 4 | Cryptek:cryptek cryptek company develops sells information security products services governments corporations cryptek headquartered dulles virginia united states cryptek founded 1986 cryptek secure communications inc. time company designed manufactured field-deployable secure fax machines military united states 1988 cryptek acquired general kinetics manufacturer secure enclosures products 1993 general kinetics also acquired verdix manufacturer secure computer networking equipment government united states 1996 private equity firm angelo gordon co. acquired fax secure networking businesses general kinetics company continued operate cryptek secure communications llc company simplified name cryptek inc. 2002 2005 cryptek went corporate restructuring bill anderson became president ceo 2007 cryptek acquired three companies secure systems group sterling virginia united states emcon emanation control ltd ottawa ontario canada secure systems technologies ltd sst gloucester united kingdom year cryptek also acquired assets ion networks south plainfield new jersey united states november 2008 company filed chapter 11 bankruptcy protection march 2009 cryptek petitioned move chapter 7 bankruptcy senior management purchase assets new company cryptek technologies inc. began operation march 11 2009 july 2009 cryptek acquired defense aerospace company api technologies corp | [
5373,
3629,
9745,
7527
] | None |
2,404 | 8 | AOLserver:aolserver aolserver aol open source web server aolserver multithreaded tcl-enabled used large scale dynamic web sites aolserver distributed mozilla public license aolserver originally developed navisoft name naviserver changed names aol bought company 1995 philip greenspun convinced america online open-source program 1999 aolserver first http server program combine multithreading built-in scripting language pooling persistent database connections database-backed web sites enabled performance improvements 100× compared standard practices time cgi scripts opened fresh database connections every page load eventually http server programs able achieve similar performance similar architecture aolserver key component open architecture community system openacs advanced open-source toolkit developing web applications sept 2007 port aolserver iphone made available later forked name joggame server fork described sourceforge project page spin-off aolserver devices naviserver also hosted sourceforge fork aolserver | [
1920,
9732,
4485,
7430,
9229,
7567,
7695,
1937,
7443,
8350,
7457,
3746,
8994,
2596,
3237,
9125,
11682,
7338,
9387,
44,
7983,
10800,
11439,
692,
6714,
10622,
1991,
11134,
595,
1363,
853,
4439,
3545,
225,
865,
1250,
4837,
488,
6379,
5612,
... | Test |
2,405 | 4 | Melissa_Hathaway:melissa hathaway melissa hathaway born november 10 1968 leading expert cyberspace policy cybersecurity served two u.s. presidential administrations 2007 2009 including 8 months white house spearheading cyberspace policy review president barack obama leading comprehensive national cybersecurity initiative cnci president george w. bush president hathaway global strategies llc senior fellow member board regents potomac institute policy studies distinguished fellow centre international governance innovation canada non-resident research fellow kosciuszko institute poland previously senior adviser harvard kennedy school ’ belfer center hathaway received b.a american university graduated us armed forces staff college special certificate information operations hathaway employed consulting firm evidence based research work included developing models detection cocaine movement united states june 1993 february 2007 hathaway worked consulting firm booz allen hamilton focusing information operations long-range strategy policy support business units work included evaluations new force options across electromagnetic spectrum design development novel techniques mapping social business process infrastructure relationships hathaway served senior advisor director national intelligence mike mcconnell cyber coordination executive chaired national cyber study group ncsg role ncsg contributed development comprehensive national cybersecurity initiative cnci hathaway appointed director joint interagency cyber task force january 2008 hathaway named acting senior director cyberspace national security homeland security councils february 9 2009 placed charge 60-day inter-agency review plan programs activities underway throughout government dedicated cyber security january 2009 request assistant president national security affairs ms. hathaway asked lead 60-day cyberspace policy review president obama assembled team experienced government cyber experts identified 250 recommendations may 2009 president obama presented blueprint cyberspace policy review announced cybersecurity would one administration priorities recognized ms. hathaway leadership noted president said “ opportunities everyone—academia industry governments—to work together build trusted resilient communications information infrastructure. ” august 3 2009 announced hathaway would return private sector resignation taking effect august 21 2009 departing cited frustration yet selected new position cyber coordinator n't willing continue wait longer 'm empowered right continue drive change october 1 2009 till project conclusion 2015 hathaway served senior adviser project minerva harvard kennedy school also one lead instructors executive program cybersecurity intersection policy technology hathaway president hathaway global strategies consulting firm also serves advisor companies including cisco one thirty commissioners global commission internet governance | [
6017,
6834
] | Test |
2,406 | 6 | Ultracopier:ultracopier ultracopier file-copying software windows macos linux supersedes supercopier main features include normal vs ultimate version difference supercopier ultracopier skin supercopier skin ultracopier css use little bit cpu talk supercopier implies refer v3 less talk ultracopier implies refer supercopier v4 later rename ultracopier v1.4 | [
5380,
2568,
7983,
10101,
823,
7672,
10489
] | Test |
2,407 | 6 | Transaction-Safe_FAT_File_System:transaction-safe fat file system transaction-safe fat file system tfat transaction-safe extended fat file system texfat refer two file systems used microsoft products provide transaction-safety data stored disk goal reduce risk data loss cases power loss unexpected removal drive latter problem become common spread usb drives transaction-safe fat file system tfat tfat12 tfat16 tfat32 file systems driver layer modification original fat file systems fat12 fat16 fat32 maintaining two copies fat 0 fat 1 file allocation table instead two identical ones performing drive operation changes would made fat 1 operation complete fat 1 table would copied fat 0 updating stable view file system transaction-safe extended fat file system texfat texfat provides similar functionality tfat using exfat file system base file system instead fat introduced windows embedded ce 6.0 sometimes referred tfat well lead confusion original tfat described use exfat underlying file system allows larger files larger partitions texfat requires hardware-specific driver designed type media texfat volume resides due lack support desktop operating systems neither tfat texfat recommended removable media desktop os could still read drive could use transaction-safe features unexpected removal power outage could lead data loss addition directories created desktop os may transaction-safe even drive later attached tfat/texfat aware operating system | [
5120,
6669,
3598,
10257,
6677,
5142,
8214,
9762,
5158,
11323,
8772,
4708,
9836,
7789,
9333,
6263,
9335,
9343,
7818,
654,
2193,
2194,
2197,
2199,
11419,
6309,
1190,
5286,
10405,
5293,
7344,
2230,
5816,
1212,
8380,
10951,
9420,
3795,
4819,
... | Test |
2,408 | 4 | Smurf_Amplifier_Registry:smurf amplifier registry smurf amplifier registry blacklist networks internet misconfigured way used smurf amplifiers smurf denial service attacks probe networks vulnerability smurf amplification either add database remove database depending result test | [
5407,
4495
] | Test |
2,409 | 4 | Denial-of-service_attack:denial-of-service attack computing denial-of-service attack dos attack cyber-attack perpetrator seeks make machine network resource unavailable intended users temporarily indefinitely disrupting services host connected internet denial service typically accomplished flooding targeted machine resource superfluous requests attempt overload systems prevent legitimate requests fulfilled distributed denial-of-service attack ddos attack incoming traffic flooding victim originates many different sources effectively makes impossible stop attack simply blocking single source dos ddos attack analogous group people crowding entry door shop making hard legitimate customers enter thus disrupting trade criminal perpetrators dos attacks often target sites services hosted high-profile web servers banks credit card payment gateways revenge blackmail activism motivate attacks court testimony shows first demonstration dos attack made khan c. smith 1997 def con event disrupting internet access las vegas strip hour release sample code event led online attack sprint earthlink e-trade major corporations year follow march 5 2018 unnamed customer us-based service provider arbor networks fell victim largest ddos history reaching peak 1.7 terabits per second previous record set days earlier march 1 2018 github hit attack 1.35 terabits per second hong kong anti-extradition protests june 2019 messaging app telegram subject ddos attack aimed preventing protesters using coordinate movements founders telegram stated attack appears state sized actor via ip addresses originating china denial-of-service attacks characterized explicit attempt attackers prevent legitimate use service two general forms dos attacks crash services flood services serious attacks distributed distributed denial-of-service ddos large-scale dos attack perpetrator uses one unique ip address often thousands hosts infected malware distributed denial service attack typically involves around 3–5 nodes different networks fewer nodes may qualify dos attack ddos attack since incoming traffic flooding victim originates different sources may impossible stop attack simply using ingress filtering also makes difficult distinguish legitimate user traffic attack traffic spread across multiple points origin alternative augmentation ddos attacks may involve forging ip sender addresses ip address spoofing complicating identifying defeating attack scale ddos attacks continued rise recent years 2016 exceeding terabit per second common examples ddos attacks fraggle smurf syn flooding application layer ddos attack sometimes referred layer 7 ddos attack form ddos attack attackers target application-layer processes attack over-exercises specific functions features website intention disable functions features application-layer attack different entire network attack often used financial institutions distract security personnel security breaches 2013 application-layer ddos attacks represented 20 ddos attacks according research akamai technologies 51 percent application layer attacks q4 2013 q4 2014 16 percent q3 2014 q4 2014 november 2017 junade ali computer scientist cloudflare noted whilst network-level attacks continue high capacity occurring less frequently ali notes although network-level attacks becoming less frequent data cloudflare demonstrates application-layer attacks still showing sign slowing osi model iso/iec 7498-1 conceptual model characterizes standardizes internal functions communication system partitioning abstraction layers model product open systems interconnection project international organization standardization iso model groups similar communication functions one seven logical layers layer serves layer served layer example layer provides error-free communications across network provides communications path needed applications calls next lower layer send receive packets traverse path osi model definition application layer narrower scope often implemented osi model defines application layer user interface osi application layer responsible displaying data images user human-recognizable format interface presentation layer implementation application presentation layers frequently combined application layer ddos attack done mainly specific targeted purposes including disrupting transactions access databases requires fewer resources network layer attacks often accompanies attack may disguised look like legitimate traffic except targets specific application packets functions attack application layer disrupt services retrieval information search functions website advanced persistent dos apdos associated advanced persistent threat requires specialised ddos mitigation attacks persist weeks longest continuous period noted far lasted 38 days attack involved approximately 50+ petabits 50,000+ terabits malicious traffic attackers scenario may tactically switch several targets create diversion evade defensive ddos countermeasures eventually concentrating main thrust attack onto single victim scenario attackers continuous access several powerful network resources capable sustaining prolonged campaign generating enormous levels un-amplified ddos traffic apdos attacks characterised vendors provide so-called booter stresser services simple web-based front ends accept payment web marketed promoted stress-testing tools used perform unauthorized denial-of-service attacks allow technically unsophisticated attackers access sophisticated attack tools without need attacker understand use usually powered botnet traffic produced consumer stresser range anywhere 5-50 gbit/s cases deny average home user internet access united states computer emergency readiness team us-cert identified symptoms denial-of-service attack include additional symptoms may include attack conducted sufficiently large scale entire geographical regions internet connectivity compromised without attacker knowledge intent incorrectly configured flimsy network infrastructure equipment wide array programs used launch dos-attacks cases mydoom slowloris tools embedded malware launch attacks without knowledge system owner stacheldraht classic example ddos tool uses layered structure attacker uses client program connect handlers compromised systems issue commands zombie agents turn facilitate ddos attack agents compromised via handlers attacker using automated routines exploit vulnerabilities programs accept remote connections running targeted remote hosts handler control thousand agents cases machine may become part ddos attack owner consent example operation payback organized group anonymous loic typically used way along hoic wide variety ddos tools available today including paid free versions different features available underground market hacker related forums irc channels various dos-causing exploits buffer overflow cause server-running software get confused fill disk space consume available memory cpu time kinds dos rely primarily brute force flooding target overwhelming flux packets oversaturating connection bandwidth depleting target system resources bandwidth-saturating floods rely attacker higher bandwidth available victim common way achieving today via distributed denial-of-service employing botnet another target ddos attacks may produce added costs application operator latter uses resources based cloud computing case normally application used resources tied needed quality service level e.g responses less 200 ms rule usually linked automated software e.g amazon cloudwatch raise virtual resources provider order meet defined qos levels increased requests.the main incentive behind attacks may drive application owner raise elasticity levels order handle increased application traffic order cause financial losses force become less competitive floods may use specific packet types connection requests saturate finite resources example occupying maximum number open connections filling victim disk space logs banana attack another particular type dos involves redirecting outgoing messages client back onto client preventing outside access well flooding client sent packets land attack type attacker shell-level access victim computer may slow unusable crash using fork bomb kind application-level dos attack xdos xml dos controlled modern web application firewalls wafs pulsing zombies compromised computers directed launch intermittent short-lived floodings victim websites intent merely slowing rather crashing type attack referred degradation-of-service rather denial-of-service difficult detect regular zombie invasions disrupt hamper connection websites prolonged periods time potentially causing disruption concentrated floods exposure degradation-of-service attacks complicated matter discerning whether server really attacked normal traffic loads goal dos l2 possibly ddos attack cause launching defense mechanism blocks network segment attack originated case distributed attack ip header modification depends kind security behavior fully block attacked network internet without system crash distributed denial-of-service ddos attack occurs multiple systems flood bandwidth resources targeted system usually one web servers attack often result multiple compromised systems example botnet flooding targeted system traffic botnet network zombie computers programmed receive commands without owners knowledge server overloaded connections new connections longer accepted major advantages attacker using distributed denial-of-service attack multiple machines generate attack traffic one machine multiple attack machines harder turn one attack machine behavior attack machine stealthier making harder track shut attacker advantages cause challenges defense mechanisms example merely purchasing incoming bandwidth current volume attack might help attacker might able simply add attack machines end completely crashing website periods time malware carry ddos attack mechanisms one better-known examples mydoom dos mechanism triggered specific date time type ddos involved hardcoding target ip address prior release malware interaction necessary launch attack system may also compromised trojan allowing attacker download zombie agent trojan may contain one attackers also break systems using automated tools exploit flaws programs listen connections remote hosts scenario primarily concerns systems acting servers web stacheldraht classic example ddos tool uses layered structure attacker uses client program connect handlers compromised systems issue commands zombie agents turn facilitate ddos attack agents compromised via handlers attacker using automated routines exploit vulnerabilities programs accept remote connections running targeted remote hosts handler control thousand agents cases machine may become part ddos attack owner consent example operation payback organized group anonymous attacks use different types internet packets tcp udp icmp etc collections systems compromisers known botnets rootservers ddos tools like stacheldraht still use classic dos attack methods centered ip spoofing amplification like smurf attacks fraggle attacks also known bandwidth consumption attacks syn floods also known resource starvation attacks may also used newer tools use dns servers dos purposes unlike mydoom ddos mechanism botnets turned ip address script kiddies use deny availability well known websites legitimate users sophisticated attackers use ddos tools purposes extortioneven business rivals simple attacks syn floods may appear wide range source ip addresses giving appearance well distributed dos flood attacks require completion tcp three way handshake attempt exhaust destination syn queue server bandwidth source ip addresses trivially spoofed attack could come limited set sources may even originate single host stack enhancements syn cookies may effective mitigation syn queue flooding however complete bandwidth exhaustion may require involvement attacker mounts attack single host would classified dos attack fact attack availability would classed denial-of-service attack hand attacker uses many systems simultaneously launch attacks remote host would classified ddos attack reported new attacks internet things iot devices involved denial service attacks one noted attack made peaked around 20,000 requests per second came around 900 cctv cameras uk gchq tools built ddos named predators face rolling thunder 2015 ddos botnets dd4bc grew prominence taking aim financial institutions cyber-extortionists typically begin low-level attack warning larger attack carried ransom paid bitcoin security experts recommend targeted websites pay ransom attackers tend get extended extortion scheme recognize target ready pay first discovered 2009 http post attack sends complete legitimate http post header includes 'content-length field specify size message body follow however attacker proceeds send actual message body extremely slow rate e.g 1 byte/110 seconds due entire message correct complete target server attempt obey 'content-length field header wait entire body message transmitted take long time attacker establishes hundreds even thousands connections resources incoming connections server victim used hence making including legitimate connections impossible data sent notable unlike many dos attacks try subdue server overloading network cpu http post attack targets logical resources victim means victim would still enough network bandwidth processing power operate combined fact apache default accept requests 2gb size attack particularly powerful http post attacks difficult differentiate legitimate connections therefore able bypass protection systems owasp open source web application security project released testing tool test security servers type attacks challenge collapsar cc attack attack standard http requests sent targeted web server frequently uniform resource identifiers uris require complicated time-consuming algorithms database operations order exhaust resources targeted web server 2004 chinese hacker nicknamed kiki invented hacking tool send kinds requests attack nsfocus firewall named collapsar thus hacking tool known challenge collapsar cc short consequently type attack got name cc attack smurf attack relies misconfigured network devices allow packets sent computer hosts particular network via broadcast address network rather specific machine attacker send large numbers ip packets source address faked appear address victim devices network default respond sending reply source ip address number machines network receive respond packets large victim computer flooded traffic overloads victim computer even make unusable attack ping flood based sending victim overwhelming number ping packets usually using ping command unix-like hosts -t flag windows systems much less capable overwhelming target also -l size flag allow sent packet size greater 65500 windows simple launch primary requirement access greater bandwidth victim ping death based sending victim malformed ping packet lead system crash vulnerable system blacknurse attack example attack taking advantage required destination port unreachable icmp packets nuke old denial-of-service attack computer networks consisting fragmented otherwise invalid icmp packets sent target achieved using modified ping utility repeatedly send corrupt data thus slowing affected computer comes complete stop specific example nuke attack gained prominence winnuke exploited vulnerability netbios handler windows 95 string out-of-band data sent tcp port 139 victim machine causing lock display blue screen death bsod attackers found way exploit number bugs peer-to-peer servers initiate ddos attacks aggressive peer-to-peer-ddos attacks exploits dc++ peer-to-peer botnet attacker communicate clients subverts instead attacker acts puppet master instructing clients large peer-to-peer file sharing hubs disconnect peer-to-peer network connect victim website instead permanent denial-of-service pdos also known loosely phlashing attack damages system badly requires replacement reinstallation hardware unlike distributed denial-of-service attack pdos attack exploits security flaws allow remote administration management interfaces victim hardware routers printers networking hardware attacker uses vulnerabilities replace device firmware modified corrupt defective firmware image—a process done legitimately known flashing therefore bricks device rendering unusable original purpose repaired replaced pdos pure hardware targeted attack much faster requires fewer resources using botnet root/vserver ddos attack features potential high probability security exploits network enabled embedded devices needs technique come attention numerous hacking communities brickerbot piece malware targeted iot devices used pdos attacks disable targets phlashdance tool created rich smith employee hewlett-packard systems security lab used detect demonstrate pdos vulnerabilities 2008 eusecwest applied security conference london distributed denial-of-service attack may involve sending forged requests type large number computers reply requests using internet protocol address spoofing source address set targeted victim means replies go flood target reflected attack form sometimes called drdos icmp echo request attacks smurf attack considered one form reflected attack flooding host send echo requests broadcast addresses mis-configured networks thereby enticing hosts send echo reply packets victim early ddos programs implemented distributed form attack amplification attacks used magnify bandwidth sent victim typically done publicly accessible dns servers used cause congestion target system using dns response traffic many services exploited act reflectors harder block others us-cert observed different services implies different amplification factors tabulated dns amplification attacks involve new mechanism increased amplification effect using much larger list dns servers seen earlier process typically involves attacker sending dns name look request public dns server spoofing source ip address targeted victim attacker tries request much information possible thus amplifying dns response sent targeted victim since size request significantly smaller response attacker easily able increase amount traffic directed target snmp ntp also exploited reflector amplification attack example amplified ddos attack network time protocol ntp command called monlist sends details last 600 hosts requested time ntp server back requester small request time server sent using spoofed source ip address victim results response 556.9 times size request sent victim becomes amplified using botnets send requests spoofed ip source result massive amount data sent back victim difficult defend types attacks response data coming legitimate servers attack requests also sent udp require connection server means source ip verified request received server order bring awareness vulnerabilities campaigns started dedicated finding amplification vectors led people fixing resolvers resolvers shut completely attack works using worm infect hundreds thousands iot devices across internet worm propagates networks systems taking control poorly protected iot devices thermostats wi-fi enabled clocks washing machines device becomes enslaved usually owner user immediate indication iot device direct target attack used part larger attack newly enslaved devices called slaves bots hacker acquired desired number bots instruct bots try contact isp october 2016 mirai botnet attacked dyn isp sites twitter netflix etc soon occurred websites unreachable several hours type attack physically damaging certainly costly large internet companies get attacked rudy attack targets web applications starvation available sessions web server much like slowloris rudy keeps sessions halt using never-ending post transmissions sending arbitrarily large content-length header value manipuling maximum segment size selective acknowledgement sack may used remote peer cause denial service integer overflow linux kernel causing even kernel panic jonathan looney discovered cve-2019-11477 cve-2019-11478 cve-2019-11479 june 17 2019 shrew attack denial-of-service attack transmission control protocol uses short synchronized bursts traffic disrupt tcp connections link exploiting weakness tcp re-transmission timeout mechanism slow read attack sends legitimate application layer requests reads responses slowly thus trying exhaust server connection pool achieved advertising small number tcp receive window size time emptying clients tcp receive buffer slowly causes low data flow rate sophisticated low-bandwidth ddos attack form dos uses less traffic increases effectiveness aiming weak point victim system design i.e. attacker sends traffic consisting complicated requests system essentially sophisticated ddos attack lower cost due use less traffic smaller size making difficult identify ability hurt systems protected flow control mechanisms syn flood occurs host sends flood tcp/syn packets often forged sender address packets handled like connection request causing server spawn half-open connection sending back tcp/syn-ack packet acknowledge waiting packet response sender address response ack packet however sender address forged response never comes half-open connections saturate number available connections server make keeping responding legitimate requests attack ends teardrop attack involves sending mangled ip fragments overlapping oversized payloads target machine crash various operating systems bug tcp/ip fragmentation re-assembly code windows 3.1x windows 95 windows nt operating systems well versions linux prior versions 2.0.32 2.1.63 vulnerable attack although september 2009 vulnerability windows vista referred teardrop attack targeted smb2 higher layer tcp packets teardrop used one fields ip header “ fragment offset ” field indicating starting position offset data contained fragmented packet relative data original packet sum offset size one fragmented packet differs next fragmented packet packets overlap happens server vulnerable teardrop attacks unable reassemble packets resulting denial-of-service condition voice ip made abusive origination large numbers telephone voice calls inexpensive readily automated permitting call origins misrepresented caller id spoofing according us federal bureau investigation telephony denial-of-service tdos appeared part various fraudulent schemes telephony denial-of-service exist even without internet telephony 2002 new hampshire senate election phone jamming scandal telemarketers used flood political opponents spurious calls jam phone banks election day widespread publication number also flood enough calls render unusable happened accident 1981 multiple +1-area code-867-5309 subscribers inundated hundreds misdialed calls daily response song 867-5309/jenny tdos differs telephone harassment prank calls obscene phone calls number calls originated occupying lines continuously repeated automated calls victim prevented making receiving routine emergency telephone calls related exploits include sms flooding attacks black fax fax loop transmission takes router resources drop packet ttl value 1 less forward packet higher ttl value packet dropped due ttl expiry router cpu must generate send icmp time exceeded response generating many responses overload router cpu attack uses existing vulnerability universal plug play upnp protocol get around considerable amount present defense methods flood target network servers attack based dns amplification technique attack mechanism upnp router forwards requests one outer source another disregarding upnp behavior rules using upnp router returns data unexpected udp port bogus ip address making harder take simple action shut traffic flood according imperva researchers effective way stop attack companies lock upnp routers defensive responses denial-of-service attacks typically involve use combination attack detection traffic classification response tools aiming block traffic identify illegitimate allow traffic identify legitimate list prevention response tools provided application front-end hardware intelligent hardware placed network traffic reaches servers used networks conjunction routers switches application front end hardware analyzes data packets enter system identifies priority regular dangerous 25 bandwidth management vendors approaches ddos attacks cloud-based applications may based application layer analysis indicating whether incoming bulk traffic legitimate thus triggering elasticity decisions without economical implications ddos attack approaches mainly rely identified path value inside application monitor progress requests path markers called key completion indicators essence technique statistical methods assessing behavior incoming requests detect something unusual abnormal going analogy bricks-and-mortar department store customers spend average known percentage time different activities picking items examining putting back filling basket waiting pay paying leaving high-level activities correspond key completion indicators service site normal behavior determined abnormal behavior identified mob customers arrived store spent time picking items putting back never made purchases could flagged unusual behavior department store attempt adjust periods high activity bringing reserve employees short notice routinely mob start showing never buying anything could ruin store extra employee costs soon store would identify mob activity scale back number employees recognising mob provides profit served may make difficult legitimate customers get served mob presence saves store total ruin case elastic cloud services huge abnormal additional workload may incur significant charges cloud service provider technique used scale back even stop expansion server availability protect economic loss blackhole routing traffic attacked dns ip address sent black hole null interface non-existent server efficient avoid affecting network connectivity managed isp dns sinkhole routes traffic valid ip address analyzes traffic rejects bad packets sinkholing efficient severe attacks intrusion prevention systems ips effective attacks signatures associated however trend among attacks legitimate content bad intent intrusion-prevention systems work content recognition block behavior-based dos attacks asic based ips may detect block denial-of-service attacks processing power granularity analyze attacks act like circuit breaker automated way rate-based ips rbips must analyze traffic granularly continuously monitor traffic pattern determine traffic anomaly must let legitimate traffic flow blocking dos attack traffic focused problem ips dos defense system dds block connection-based dos attacks legitimate content bad intent dds also address protocol attacks teardrop ping death rate-based attacks icmp floods syn floods case simple attack firewall could simple rule added deny incoming traffic attackers based protocols ports originating ip addresses complex attacks however hard block simple rules example ongoing attack port 80 web service possible drop incoming traffic port prevent server serving legitimate traffic additionally firewalls may deep network hierarchy routers adversely affected traffic gets firewall also many security tools still support ipv6 may configured properly firewalls often might get bypassed attacks similar switches routers rate-limiting acl capability manually set routers easily overwhelmed dos attack cisco ios optional features reduce impact flooding switches rate-limiting acl capability switches provide automatic and/or system-wide rate limiting traffic shaping delayed binding tcp splicing deep packet inspection bogon filtering bogus ip filtering detect remediate dos attacks automatic rate filtering wan link failover balancing schemes work long dos attacks prevented using example syn flood prevented using delayed binding tcp splicing similarly content based dos may prevented using deep packet inspection attacks originating dark addresses going dark addresses prevented using bogon filtering automatic rate filtering work long set rate-thresholds set correctly wan-link failover work long links dos/ddos prevention mechanism traffic passed cleaning center scrubbing center via various methods proxies tunnels digital cross connects even direct circuits separates bad traffic ddos also common internet attacks sends good traffic beyond server provider needs central connectivity internet manage kind service unless happen located within facility cleaning center scrubbing center ddos attacks overwhelm type hardware firewall passing malicious traffic large mature networks becomes effective economically sustainable ddos unintentional denial-of-service occur system ends denied due deliberate attack single individual group individuals simply due sudden enormous spike popularity happen extremely popular website posts prominent link second less well-prepared site example part news story result significant proportion primary site regular userspotentially hundreds thousands peopleclick link space hours effect target website ddos attack vipdos specifically link posted celebrity michael jackson died 2009 websites google twitter slowed even crashed many sites servers thought requests virus spyware trying cause denial-of-service attack warning users queries looked like automated requests computer virus spyware application news sites link sitessites whose primary function provide links interesting content elsewhere internetare likely cause phenomenon canonical example slashdot effect receiving traffic slashdot also known reddit hug death digg effect routers also known create unintentional dos attacks d-link netgear routers overloaded ntp servers flooding ntp servers without respecting restrictions client types geographical limitations similar unintentional denials-of-service also occur via media e.g url mentioned television server indexed google another search engine peak periods activity lot available bandwidth indexed also experience effects dos attack legal action taken least one case 2006 universal tube rollform equipment corporation sued youtube massive numbers would-be youtube.com users accidentally typed tube company url utube.com result tube company ended spend large amounts money upgrading bandwidth company appears taken advantage situation utube.com containing ads advertisement revenue march 2014 malaysia airlines flight 370 went missing digitalglobe launched crowdsourcing service users could help search missing jet satellite images response overwhelmed company servers unintentional denial-of-service may also result prescheduled event created website case census australia 2016 could caused server provides service specific time might university website setting grades available result many login requests time computer network security backscatter side-effect spoofed denial-of-service attack kind attack attacker spoofs forges source address ip packets sent victim general victim machine distinguish spoofed packets legitimate packets victim responds spoofed packets normally would response packets known backscatter attacker spoofing source addresses randomly backscatter response packets victim sent back random destinations effect used network telescopes indirect evidence attacks term backscatter analysis refers observing backscatter packets arriving statistically significant portion ip address space determine characteristics dos attacks victims many jurisdictions laws denial-of-service attacks illegal january 7 2013 anonymous posted petition whitehouse.gov site asking ddos recognized legal form protest similar occupy protests claim similarity purpose | [
513,
10756,
1541,
6667,
2060,
2076,
8224,
4133,
6184,
8244,
10807,
5178,
5179,
7739,
1087,
1088,
4672,
9282,
9791,
2118,
8266,
8779,
9293,
5199,
6735,
4689,
11351,
1625,
10332,
4194,
612,
2661,
4198,
10852,
3688,
10344,
11364,
9325,
7791,
... | Test |
2,410 | 9 | Vensim:vensim vensim simulation software developed ventana systems primarily supports continuous simulation system dynamics discrete event agent-based modelling capabilities available commercially free personal learning edition vensim provides graphical modeling interface stock flow causal loop diagrams top text-based system equations declarative programming language includes patented method interactive tracing behavior causal links model structure well language extension automating quality control experiments models called reality check modeling language supports arrays subscripts permits mapping among dimensions aggregation built-in allocation functions satisfy constraints sometimes met conventional approaches like logit supports discrete delays queues variety stochastic processes multiple paths cross sectional time-series data import export including text files spreadsheets odbc models may calibrated data using optimization kalman filtering markov chain monte carlo methods sensitivity analysis options provide variety ways test sample models including monte carlo simulation latin hypercube sampling vensim model files packaged published customizable read-only format executed freely available model reader allows sharing interactive models users program and/or model author wish access model code base vensim general-purpose software used wide variety problem domains common high-profile applications include | [
4792,
10102,
7983
] | Test |
2,411 | 8 | Service_Mapping_Description:service mapping description service mapping description smd proposed standard describing machine-readable json format web services available particular endpoint goal similar principle wsdl | [
119
] | Test |
2,412 | 2 | Operating_system_abstraction_layer:operating system abstraction layer operating system abstraction layer osal provides application programming interface api abstract operating system making easier quicker develop code multiple software hardware platforms os abstraction layers deal presenting abstraction common system functionality offered operating system means providing meaningful easy use wrapper functions turn encapsulate system functions offered os code needs porting well designed osal provides implementations api several real-time operating systems vxworks ecos rtlinux rtems implementations may also provided non real-time operating systems allowing abstracted software developed tested developer friendly desktop environment addition os apis os abstraction layer project may also provide hardware abstraction layer designed provide portable interface hardware devices memory i/o ports non-volatile memory facilitate use apis osals generally include directory structure build automation e.g. set makefiles facilitate building project particular os hardware platform implementing projects using osals allows development portable embedded system software independent particular real-time operating system also allows embedded system software developed tested desktop workstations providing shorter development debug time | [
9366,
7983
] | Test |
2,413 | 1 | DBeaver:dbeaver dbeaver sql client database administration tool relational databases uses jdbc api interact databases via jdbc driver databases nosql uses proprietary database drivers provides editor supports code completion syntax highlighting provides plugin architecture based eclipse plugins architecture allows users modify much application behavior provide database-specific functionality features database-independent desktop application written java based eclipse platform community edition ce dbeaver free open source software distributed apache license closed-source enterprise edition dbeaver distributed commercial license dbeaver started 2010 hobby project supposed free open-source good-looking convenient ui include frequently used features database developers first official release 2011 freecode quickly became popular tool open-source community year official web site founded community support forum moved github created 2012 eclipse plugin version released since dbeaver become one popular database extensions eclipse top 50-60 among eclipse extensions shortly various software vendors started integrate dbeaver mostly extensions proprietary eclipse rcp products zend studio nxtware deltadna etc. 2014 enterprise edition ee version released ee version based ce also provides support nosql/bigdata databases cassandra mongodb redis includes additional eclipse plugins 2015 dbeaver source code/community moved github 2017 dbeaver ce relicensed apache license starting version 4.x july 2017 dbeaver ee version became commercial order support ce version dbeaver cross-platform tool works platforms supported eclipse windows linux macos x solaris dbeaver available english chinese russian italian german full list released versions community edition ce initial version dbeaver released 2010 became open-source gpl 2011 ce version includes extended support following databases besides relational databases ce version supports wmi driver windows management instrumentation – works windows version year response multiple user requests eclipse plugin version released eclipse marketplace version used programmers use eclipse ide software development need database management tool right ide eclipse plugin includes features community edition also released gpl license dbeaver 3.x announced support nosql databases cassandra mongodb initial version since dbeaver divided community enterprise editions enterprise edition support nosql databases persistent query manager enterprise-level features ee version open-source requires purchase license trial license generated free charge list additional features dbeaver features include differences features available across different databases | [
11392,
8195,
9868,
10258,
11030,
8217,
7453,
1950,
9503,
2465,
4771,
5546,
1579,
7339,
9389,
10413,
7983,
9010,
7347,
5047,
823,
6721,
6850,
11457,
9286,
5964,
5198,
7506,
4183,
9687,
9177,
8539,
10459,
10340,
6245,
1383,
8295,
8683,
5612,
... | Validation |
2,414 | 0 | Lexical_database:lexical database lexical database lexical resource associated software environment database permits access contents database may custom-designed lexical information general-purpose database lexical information entered information typically stored lexical database includes lexical category synonyms words well semantic phonological relations different words sets words | [
416,
3811,
5639,
7892,
2901,
7839
] | Test |
2,415 | 2 | Envsys:envsys envsys framework kernel-level hardware monitoring sensors framework netbsd framework used close 85 device drivers export various environmental monitoring sensors evidenced references codice_1 symbol within codice_2 path netbsd temperature sensors codice_3 likely type exported given driver sensors registered kernel codice_4 api consumption monitoring sensors userland performed help codice_5 utility codice_6 codice_7 codice_8 pseudo-device file codice_9 power management daemon responds kernel events running scripts codice_10 well third-party tools like codice_11 gkrellm pkgsrc framework allows user amend monitoring limits specified driver driver perform monitoring sensors kernel space even programme hardware chip monitoring system automatically two levels limits defined critical warning additionally extend categorisation limit thresholds crossed kernel event may generated caught userland codice_9 execute pre-defined user script comparison openbsd hw.sensors monitoring user-defined values performed userspace codice_13 framework facilitate computer fan control although drivers could still implement interfacing fan-controlling capabilities chips means example driver-specific sysctl interface approach taken codice_14 driver however drivers popular super i/o chips like codice_15 codice_16 implement fan control fact historically openbsd netbsd dragonfly drivers n't even report duty cycle fans — actual rpm values reported framework undergone two major revisions first version codice_17 committed codice_18 man page following 2000 2007 manual page envsys 4 netbsd stated api experimental entire api replaced sysctl 8 one developed noted 2003 exact approach taken openbsd sysctl hw.sensors envsys 4 drivers ported openbsd second revision came serialisation userland reimplemented using property lists help netbsd new proplib 3 library underlying transport layer kernel userland still done ioctl envsys framework precursor openbsd sysctl hw.sensors framework 2003 many drivers well sensor types ported back forth netbsd openbsd support sensors codice_19 type added netbsd similar codice_19 type openbsd time bio 4 bioctl ported openbsd netbsd | [
1286,
1801,
10000,
274,
9762,
8998,
1071,
7983,
11698,
9671,
1993,
8909,
1361,
7383,
4571,
7907,
1637,
11623,
1515,
8816,
2545,
11506,
5363,
10102,
2045,
9343
] | Test |
2,416 | 4 | Trusted_Computing_Group:trusted computing group trusted computing group group formed amd hewlett-packard ibm intel microsoft implement trusted computing concepts across personal computers trusted computing group announced 2003 successor trusted computing platform alliance previously formed 1999 many companies since joined trusted computing group including wave systems corp digital management inc. cisco lenovo infineon juniper networks fujitsu october 11 1999 trusted computing platform alliance abbreviated tcpa consortium various technology companies including compaq hewlett-packard ibm intel microsoft formed effort promote trust security personal computing platform november 1999 tcpa held founding conference announced 70 leading hardware software companies joined alliance since inception previous month january 30 2001 tcpa announced release version 1.0 trusted computing platform specifications aiming provide industry clear direction facilitates trust computing platforms environments december tcpa released version 1.1a trusted computing platform specifications ibm first original equipment manufacturer incorporate hardware features based version 1.1 tcpa trusted computing platform specifications introduction thinkpad t30 mobile computer april 24 2002 2003 tcpa succeeded trusted computing group increased emphasis trust mobile devices cell phones pdas tcg original goal development trusted platform module tpm semiconductor intellectual property core integrated circuit conforms trusted platform module specification put forward trusted computing group included computers enable trusted computing features tcg-compliant functionality since integrated directly certain mass-market chipsets tcg also recently released first version trusted network connect tnc protocol specification based principles aaa adding ability authorize network clients basis hardware configuration bios kernel version updates applied os anti-virus software etc 2009 tcg released set specifications describe protocol communicate self encrypting disk drives tcg storage work group swg storage core architecture specification describes detail implement utilize trust security services storage devices security subsystem class ssc specifications describe requirements specific classes devices specifically enterprise ssc defines minimum requirements data center server class devices opal ssc defines minimum requirements client devices vendor tpm-enabled system complete control software run owner system cases vendor may choose grant permission owner configure hardware legally purchased conversely restrict owner fully using property include possibility operating system os whether chosen user preinstalled hardware purchase refuses load unsigned unlicensed software e.g. microsoft described detail restrictions would enforced operating system tcg technology tpm provide case capability os lock software specific machine configurations meaning hacked versions os designed get around restrictions would work legitimate concern os vendors could use capabilities restrict software would load os hurting small software companies open source/shareware/freeware providers causing vendor lock-in data formats microsoft already stated begin restricting software allow run windows starting windows 8 arm tpm used conjunction boot loader ensure vendor-approved operating systems running could restrict alternative operating systems running including free open source operating systems example microsoft requiring x86/x64 machines come windows 8 secure boot enabled default caused alternative os vendors make payments microsoft ensure os able installed user additionally arm machine shipped windows 8 banned allowing another os installed time several projects experimenting tpm support free operating systems examples projects include tpm device driver linux open source implementation tcg trusted software stack called trousers also ported windows vista windows 7 2010 java interface tpm capabilities called tpm/j tpm-supporting version grub bootloader called trustedgrub tpm 1.1 specification envisioned standard pc platform equipped tpm chip scenario tpm chip serve hardware key storage additionally keep track so-called measurements platform i.e hashes various software able produce signed statements running software chain particularly latter mode operation proved unfeasible practice since amount software measured trusted large includes addition system firmware operating system drivers application programs therefore numerous tpm-related projects progress purpose make possible launch measure trusted subenvironment within untrusted environment tpm specification 1.2 enhanced accommodate mode operation additionally hardware changes required cpu chipset note confused inclusion tpm functionality chipset even though possibility intel approach called trusted execution technology txt many intel core 2 duo cpus advertised support extensions however chipset support required extensions operational currently intel chipset q35 express supports txt addition chipset support mainboard must also feature tpm 1.2 chip intel currently advertises dq35mp dq35jo compliant technology first application technology set manageability enhancements brand name vpro amd platform called secure execution mode 2002-2003 microsoft announced initiative called next-generation secure computing base formerly palladium basically vision tpm 1.2 chip cpu chipset software could provide environment software ecosystem trusted applications launched within regular windows could developed intel txt amd sem seen realizations hardware side ngscb vision owing significant difficulties creating working implementation third-party developers interested using unavailability enhancements cpu chipset ngscb included microsoft windows vista instead vista ships technologies make use subset functions tpm chip intel txt amd sem bitlocker drive encryption new version microsoft cryptography api group faced widescale opposition free software community grounds technology developing negative impact users privacy create customer lock-in especially used create drm applications received criticism gnu/linux freebsd communities well software development community general significant backlash amongst trusted computing group present richard stallman speech hackers planet earth conference july 2006 new york richard stallman free software foundation also criticized group publicly speeches criticism calls trusted computing treacherous computing instead warns vendors lock software officially signed specific vendors rendering unusable privacy concerns tcg revolve around fact tpm unique keypair called endorsement key identifies platform initial versions tpm version 1.1 tcg addressed privacy concerns suggesting use privacy ca could certify pseudonymous machine credentials separate credentials interacting different parties actions could linked level privacy provided however requires trust privacy ca could still link pseudonyms common identifying machine credential since left unresolved privacy concerns version 1.2 tpm specification introduced direct anonymous attestation protocol based idea zero-knowledge proof allows tpm user receive certification way privacy ca would able link requests single user platform still able identify rogue tpms privacy concerns tpm heightened christopher tarnovsky presented methods access compromise infineon tpm non-volatile memory capacity contains user data black hat 2010 efforts tcg specifications standardized iso active first part october 2007 member states iso/dis jtc1 expected send opinion iso july 24 2008 may 18 2009 tcg managed achieve standardization tpm specifications august 2014 approximately 100 promoters contributors adopters tcg specifications membership fees vary level promoters pay annual membership fees 30,000 contributors pay 15,000 depending upon company size adopters pay annual membership fees either 2,500 7,500 | [
7936,
4353,
517,
5384,
6282,
3851,
2213,
9894,
3880,
5677,
9390,
7983,
9137,
7354,
9791,
851,
2525,
2275,
1515,
6509,
8302,
7794,
3323,
4221
] | Test |
2,417 | 2 | Dependency_hell:dependency hell dependency hell colloquial term frustration software users installed software packages dependencies specific versions software packages dependency issue arises around shared packages libraries several packages dependencies depend different incompatible versions shared packages shared package library installed single version user may need address problem obtaining newer older versions dependent packages turn may break dependencies push problem another set packages dependency hell takes several forms specific computing platforms dependency hell often goes local specific name generally name components | [
2310,
6797,
6680,
8476,
2853,
10149,
4775,
6828,
823,
576,
3522,
7364,
5067,
9806,
6871,
6361,
2010,
5096,
2666,
9455,
5872,
10096,
1522,
2804
] | Validation |
2,418 | 8 | Executable_choreography:executable choreography executable choreography represents decentralized form service composition involving cooperation several individual entities improved form service choreography executable choreographies intuitively seen arbitrary complex workflows get executed systems belonging multiple organisations authorities executable choreographies actual code created encode system behavior global point view behavior main entities system given single program choreographies enhance quality software behave like executable blueprints communicating systems behave offer concise view message flows enacted system almost applications business logic must separated different services orchestration represents way services organized composed resulting service integrated hierarchically another composition service choreography global description participating services defined exchange messages rules interaction agreements two endpoints choreography employs decentralized approach service composition industry concept choreography generally considered non-executable standards proposed web services choreography description language present choreography formal model describe contracts autonomous entities generally distinct organizations participating composition services analyzed globally perspective composition must implemented centrally different orchestration mechanisms made available companies naive code composition use specific orchestration languages engines bpel business process execution language rule engines etc area academic research concept executable choreography proposed method longer contractual part actual part code two different artifacts non-synchronized require subjective interpretations examples executable calculus service choreography executable choreography framework dynamic service-oriented architectures approaches also practical impact often level articles least research projects real breakthrough blockchain recent years brought even attention academic community industry concept smart contract seen particular form executable choreography executable choreographies general concept necessarily verifiable choreographies use idea site regarded security context code execution examples approaches programming using executable choreographies could list european project choreos chor programming language web service modeling choreographing web services aspects related composition web services using pi-calculus verifiable term introduced highlight possibility verifying swarm choreographies explicit presence execution location idea leads possibility developing verification algorithms seen article levels privacy e-health systems cloud era encrypted cryptography supposes addition verification offer higher-level solutions advanced cryptographic methods without need programmers become cryptography specialists distributed applications could built subsystems allow identification verification architectural points expose secret data example ideally programming system uses encrypted choreographs guarantees least helps minimize situations person legally licensed hacker holds encrypted private data encryption keys related resources way administrators programmers subsystems fewer possibilities perform internal attacks privacy level frequent attacks even applications use approach encrypted choreographies minimize security risks caused people inside administer program systems thus number points discreet access data ideally never formally ensured form choreography useful allow companies secure code application legislation security rules assumed implementation encrypted choreographies implies example existence storage systems using cryptographic techniques practical implementation homomorphic encryption cryptdb implementation mit method also called storage division anonymization method help encrypted choreographies lead ideal total sovereignty within limits law private data published article private data system enabling self-sovereign storage managed executable choregraphies paper presents choreographies anonymize divide data way ensures data copied single administrator hacker controls one participating nodes implemented mechanisms also include interfaces easy use programmers advanced cryptographic methods serverless computing cloud computing model cloud provider dynamically manages allocation computing resources serverless choreographies involve automating launching methods using virtualization automation techniques implementation advanced type choreography requires development new business models facilitate cloud-based application hosting without friction related payment installation etc example tor concept provides example serverless systems best known example amazon lambda great commercial success allowing programmers ignore installation details facilitate dynamic scalability systems blockchains considered examples serverless databases serverless choreographies assume cloud execution storage done using encrypted choreographies using form choreography hosting companies individuals managing physical logical hosting infrastructure able influence hosted installation applications serverless choreographies present opportunity develop distributed decentralized systems potential formally secure advanced privacy properties | [
9248,
7537,
9629,
10102
] | Test |
2,419 | 4 | Lew_Allen:lew allen lew allen jr. september 30 1925 – january 4 2010 united states air force four-star general served tenth chief staff united states air force chief staff allen served senior uniformed air force officer responsible organization training equipping 750,000 active duty air force air national guard air force reserve civilian personnel serving united states overseas member joint chiefs staff service chiefs function ed military advisers secretary defense national security council president born miami florida allen attended graduated high school gainesville texas 1942 entered united states military academy 1943 graduated 1946 bachelor science degree commission second lieutenant awarded pilot wings upon graduation flight training completing multi-engine flight training november 1946 allen assigned strategic air command 7th bombardment group carswell air force base texas flew b-29 superfortress bombers new long-range convair b-36 bomber allen also served various technical positions area nuclear weapons allen also attended air tactical course tyndall air force base florida next returned carswell air force base flight instructor assistant special weapons officer 7th bombardment wing september 1950 allen entered university illinois graduate study nuclear physics completed master science degree 1952 allen continued graduate study earned ph.d. physics 1954 completed experimental thesis high-energy photonuclear reactions allen assigned u.s. atomic energy commission los alamos scientific laboratory los alamos new mexico physicist test division became acquainted bomb designer ted taylor allen conducted experiments several different nuclear test series experiments concerned physics thermonuclear weapons design effects high altitude nuclear explosions conceivably used ballistic missile defense june 1957 december 1961 allen assigned kirtland air force base new mexico science adviser physics division air force special weapons center special weapons euphemism nuclear thermonuclear bombs allen specialized military effects high altitude nuclear explosions participated several nuclear weapons test series scientific director major experiment utilized large series high altitude rockets measure characteristics electrons trapped geomagnetic field exoatmospheric nuclear burst allen assigned december 1961 office secretary defense space technology office directorate research engineering washington d.c. june 1965 february 1973 assigned office secretary air force initially los angeles california deputy director advanced plans directorate special projects allen next moved pentagon june 1968 deputy director space systems june 1969 became director returned los angeles september 1970 assistant director special projects april 1971 became director special projects additional duty deputy commander satellite programs space missile systems organization serving briefly chief staff air force systems command andrews air force base maryland allen appointed march 1973 deputy director central intelligence intelligence community washington d.c august 1973 allen became director national security agency nsa chief central security service fort george g. meade maryland allen tenure nsa director noteworthy became first director ever testify publicly congress august 1977 named commander air force systems command allen served vice chief staff united states air force april 1978 became chief staff air force july 1978 nomination unusual never served overseas combat assignment positions specialized technical activities rather usual command structure air force also last chief staff bomber background subsequent chiefs staff except general norton schwartz fighter pilots trend reflected service weapon budgets devote funding fighters rather bombers following retirement air force 1982 allen became director jet propulsion laboratory jpl part voyager program space probes launched 1977 served director jpl 1990 allen member national academy engineering council foreign relations 1993 1995 allen served member president foreign intelligence advisory board pfiab intelligence oversight board allen awarded 1999 distinguished graduate award association graduates alumni association west point graduates allen died potomac falls virginia january 4 2010 complications rheumatoid arthritis buried arlington national cemetery march 22 2010 united states air force created general lew allen jr. trophy allen honor awarded annually officer senior nco aircraft maintenance munitions career fields directly involved setting aircraft sorties since 1986 jet propulsion laboratory awards honor lew allen award excellence 1990 called director research achievement award | [
6017,
8726,
1189,
9517,
1838,
5308,
1986,
6343,
6344,
11335,
7119,
7759,
7887,
3154,
8276,
7893,
6749,
991,
7137,
3305,
7145,
6005,
6136,
766
] | Test |
2,420 | 2 | HP_Pre_3:hp pre 3 hp pre 3 styled pre touchscreen slider smartphone manufactured hewlett-packard device uses webos powered qualcomm snapdragon processor 3.6-inch screen conceptually successor palm pre 2 earlier pre pre plus models hp pre 3 announced february 9 2011 hp webos think beyond event held fort mason center san francisco alongside veer touchpad commercially released united kingdom august 17 2011 device supports new touch-to-share proximity-based sharing feature allows compatible devices touchpad instantly exchange data media information via bluetooth pre 3 802.11 a/b/g/n wi-fi 512 mb ram 8 gb internal storage bluetooth v2.1 1230 mah battery 16 gb model manufactured verizon united states models never released general public pre 3 released august 17 2011 united kingdom next day august 18 hp announced would discontinuing webos devices including pre 3 phone never officially released united states although models eventually sold hp employee store california many phones ended ebay auctions hp pre 3 features 3.58-inch multi-touch capacitive touchscreen resolution 800-by-480 pixels pre 3 three physical buttons input including volume up/down buttons side power button top navigating os pre 3 gesture area swipe enter card like multitasking view swipe right left go back application swipe left right go forward optionally swipe completely right left switch applications modifier keys combined gestures enable text selection cursor positioning command shortcuts triggered holding tap gesture area pressing key keyboard pre 3 supports bluetooth 2.1 802.11a/b/g/n wifi hspa+ well gsm evdo cdma depending service provider along hp touchpad pre 3 supports new technology called touch share touch share lets share urls phone calls text messages data 3rd party apps touchpad hp pre 3 tapping phone touchpad sensor example web site browsed touchpad transferred pre browser tapping two devices together umts frequency bands supported pre 3 mono loudspeaker well dual mic noise cancellation pre 3 features 5 mega pixel camera auto focus led flash capable 720p video recording phone also front-facing vga camera video calling integrated skype application pre 3 sold carphone warehouse uk competitive pay monthly contract terms limited available stock us gsm models sold direct hp employees 75 12 per employee branded unsupported either hp/palm though received over-the-air ota update 2.2.0 2.2.3 addition update webos 2.2.4 released update webos doctor ota update | [
1537,
3585,
2308,
10500,
6790,
5384,
3340,
1682,
2962,
405,
3606,
8982,
10393,
5019,
6178,
10658,
5164,
9266,
9013,
694,
1849,
9913,
1083,
1728,
7492,
10820,
5318,
11337,
5963,
9163,
9037,
2258,
2259,
1621,
6618,
5339,
2784,
4449,
4832,
3... | Train |
2,421 | 2 | GEOM:geom geom main storage framework freebsd operating system available freebsd 5.0 higher provides standardized way access storage layers geom modular allows geom modules connect framework example geom_mirror module provide raid1 mirroring functionality system wide range modules already available new ones always active development various freebsd developers geom developed freebsd project poul-henning kamp nai labs security research division network associates inc. darpa/spawar contract n66001-01-c-8035 cboss part darpa chats research program name symbolizes impact disk geometry geom modular design modules 'stacked together form chain geom layers example top geom_mirror module encryption module added geom_eli provide mirrored encrypted volume module consumers providers provider 'source geom module often physical hard drive sometimes virtualized disk memory disk geom module turn provides 'output device geom modules called consumers use provider create chain modules connected source → geom module → output referred provider → geom module → consumer example geom_mirror module may use consumer following providers /dev/ada0 /dev/ada1 creates provider new device called /dev/mirror/gm0 end geom chain often filesystem applied actually use geom provider something useful provider created geom modules behaves like physical hard drive contain filesystems freebsd native unix file system ufs storage modules encryption compression modules filesystem modules virtualization | [
7425,
2180,
1927,
1801,
10761,
274,
9625,
1946,
4636,
2339,
2212,
6438,
10535,
684,
4908,
1071,
3248,
7983,
9009,
11698,
11573,
1718,
10422,
9784,
1465,
5177,
5819,
3006,
11459,
1990,
9927,
1993,
8266,
8395,
8909,
5710,
6864,
7249,
850,
1... | Test |
2,422 | 3 | C.mmp:c.mmp c.mmp early mimd multiprocessor system developed carnegie mellon university william wulf 1971 notation c.mmp came pms notation bell newell cpu designated c variant noted dot notation mmp stood multi-mini-processor sixteen pdp-11 minicomputers used processing elements named compute modules system cm local memory 8k local set peripheral devices one challenges device available unique connected processor i/o system designed roy levin hid connectivity devices routed requests hosting processor processor went devices connected unibus became unavailable became problem overall system reliability processor 0 boot processor disk drives attached compute modules shared communication pathways since pdp-11 address space 16-bits additional address translation unit added expand address space 25 bits shared memory space unibus architecture provided 18 bits address two high-order bits used select one four relocation registers selected bank memory proper management relocation registers one challenges programming operating system kernel original c.mmp design used magnetic core memory lifetime higher performance dynamic ram became available system upgraded original processors pdp-11/20 processors final system five used remaining 11 pdp-11/40 processors modified additional writeable microcode space modifications machines designed built cmu 11/20 modifications custom changes motherboard pdp-11/40 implemented microcode separate proc-mod board designed intercepted certain instructions implemented protected operating system requirements example necessary operating system integrity stack pointer register never odd 11/20 accomplished clipping lead low-order bit stack register 11/40 access stack intercepted proc-mod board generated illegal data access trap low-order bit 1 operating system called hydra capability-based object-oriented multi-user operating system system resources represented objects protected capabilities among programming languages available system subset algol 68 language fact superset subset features supporting parallelism vastly improved make good use c.mmp operating system applications written language bliss-11 required cross-compilation pdp-10 algol-68 compiler ran native hydra operating system little assembly code used operating system overall system reliability depended 16 cpus running serious problems overall hardware reliability mtbf one processor 24 hours overall system reliability 16/24 hours 40 minutes overall system usually ran two six hours many failures due timing glitches many custom circuits added processors considerable effort expended getting hardware reliability improved processor noticeably failing partitioned would run diagnostics several hours passed first set diagnostics partitioned back i/o processor would run application code peripheral devices available continued run diagnostics passed several hours reinstated full member processor set similarly block memory one page detected faulty removed pool available pages otherwise notified operating system would ignore page thus operating system became early example fault-tolerant system able deal hardware problems would inevitably arise machine display ninth floor wean hall carnegie mellon university | [
2179,
7303,
1611,
7983,
7480,
5598
] | None |
2,423 | 4 | Black_fax:black fax term black fax refers prank fax transmission consisting one pages entirely filled uniform black tone sender intention generally use much recipient fax ink toner thermal paper possible thus costing recipient money well denying recipient use machine similar computer-based denial service attacks made easier fax transmission protocols compress solid black image well short fax call produce many pages black faxes used harass large institutions government departments retaliate senders junk faxes merely simple pranks basic principle black fax extended form black fax attack case one sheets fed halfway sender fax machine taped end end forming endless loop cycles machine solid black used also images repeat endlessly receiver machine toner runs introduction computer-based facsimile systems combined integrated document imaging solutions major corporations means black faxes unlikely cause problems hand ability computer modems send faxes offers new avenues abuse program could used generate hundreds pages highly compressed pure black – huge volumes relevant-looking original non-repeating high-black-density junk effective far difficult counteract – send quickly target fax machine black faxes fax loops similar intention implementation lace cards | [
2409,
5979,
855
] | Test |
2,424 | 2 | OpenServer:openserver xinuos openserver previously sco unix sco open desktop sco odt closed source computer operating system developed santa cruz operation sco later acquired sco group owned xinuos early versions openserver based unix system v later openserver 10 based freebsd sco unix successor santa cruz operation variant microsoft xenix derived unix system v release 3.2 infusion xenix device drivers utilities sco unix system v/386 release 3.2.0 released 1989 commercial successor sco xenix base operating system include tcp/ip networking x window system graphics available optional extra-cost add-on packages shortly release bare os sco shipped integrated product name sco open desktop odt 1994 saw release sco mpx add-on smp package time completed merge xenix bsd sunos unix system v release 3 features unix system v release 4 sco unix remained based system v release 3 eventually added home-grown versions features release 4 1992 releases sco unix 3.2v4.0 open desktop 2.0 added support long file names symbolic links next major version openserver release 5.0.0 released 1995 added support elf executables dynamically linked shared objects made many kernel structures dynamic sco openserver 5 released 1995 would become sco primary product serve basis products like pizzanet first internet-based food delivery system done partnership pizza hut sco global access internet gateway server based open desktop lite due large installed base sco openserver 5 continues actively maintained sco major updates occurred recently april 2009 sco openserver 6 based merging unix system v release 4.2mp novell unixware 7 initially released sco group 2005 includes support large files increased memory multi-threaded kernel light-weight processes merged codebase referred unix system v release 5 svr5 used sco openserver 6 svr5 used major developer reseller sco openserver 6 contains unixware 7 svr5 kernel integrated sco openserver 5 application binary compatibility openserver 5 system administration openserver 5 user environments sco openserver primarily sold small medium business smb market widely used small offices point sale pos systems replicated sites backoffice database server deployments prominent larger sco openserver customers include mcdonald taco bell big tires pizza hut costco pharmacy nasdaq toronto stock exchange banco brasil many banks russia china railway system india sco purchased right distribute unixware system system v release 4 code base novell 1995 sco eventually able re-use code version unixware later releases openserver release 6 came primarily compilation system udi driver framework usb subsystem written end 1990s around 15,000 value-added resellers vars around world provided solutions customers sco unix systems sco announced august 2 2000 would sell server software services divisions well unixware openserver technologies caldera systems inc purchase completed may 2001 remaining part sco company tarantella division changed name tarantella inc. caldera systems became caldera international subsequently 2002 sco group sco group continued development maintenance openserver currently continue maintain obsoleted 5.0.x branch derived 3.2v5.0.x recent 5.0.7 june 22 2005 openserver 6.0 released codenamed legend first release new 6.0.x branch sco openserver 6 based unix system v release 5 svr5 kernel merged codebase unix system v release 4.2mp unixware 7 openserver 6.0 features multi-threading application support c c++ java applications posix interface openserver 6 features kernel-level threading found 5.0.x improvements openserver 5 include improved smp support support 32 processors support files terabyte partition larger network files supported nfsv3 better file system performance support 64 gb memory openserver 6.0 maintains backward-compatibility applications developed xenix 286 onwards sco group went bankrupt 2011 long series legal battles rights openserver well unixware acquired unxis 2011 later renamed xinuos june 2015 xinuos announced openserver 10 based freebsd operating system simultaneously xinuos introduced migration path existing customers using older os products december 2015 xinuos released definitive versions openserver 5 openserver 6 unixware 7 december 2017 xinuos released definitive 2018 versions openserver 6 unixware 7 october 2018 openserver 5 definitive 2018 released definitive 2018 releases commitment xinuos keep legacy os updated supported protecting applications customers need continue run definitive 2018 products contain major updates definitive releases soon announced updated development kit make easier compile current packages definitive 2018 products xinuos continued provide updates new flag ship os openserver 10 working version 12 release openserver 10 2019 | [
2560,
7682,
10761,
6675,
8725,
1561,
4636,
7204,
1071,
7224,
5177,
9784,
2120,
6218,
8266,
5710,
7249,
2132,
9306,
607,
11363,
6760,
1648,
8816,
9844,
633,
9343,
640,
2179,
132,
2180,
6787,
671,
2212,
7848,
3241,
684,
3248,
1718,
5819,
... | None |
2,425 | 4 | Industry_Connections_Security_Group:industry connections security group industry connections security group ieee icsg global group computer security entities past present members include anh labs avg avira eset f-secure k7 computing kaspersky labs marvell mcafee microsoft palo alto networks panda software safenet sophos symantec trend micro come together ieee pool experience resources combating systematic rapid rise computer security threats ieee icsg activities include | [
704,
7327,
7362,
131,
7809,
9537,
9569,
202,
5586,
9055,
11577,
1242,
127
] | Test |
2,426 | 4 | Unidirectional_network:unidirectional network unidirectional network also referred unidirectional gateway data diode network appliance device allows data travel one direction data diodes found commonly high security environments defense serve connections two networks differing security classifications given rise industrial iot digitization technology found industrial control level facilities nuclear power plants power generation safety critical systems like railway networks years development use data diodes increased creating two variations data diodes commonly found high security military government environments becoming widely spread sectors like oil gas water/wastewater airplanes flight control units in-flight entertainment systems manufacturing cloud connectivity industrial iot new regulations increased demand increased capacity major technology vendors lowered cost core technology first data diodes developed governmental organizations eighties nineties organizations work confidential information making sure network secure highest priority primary solutions used organizations air gaps amount transferable data increased continuous real-time data stream became important organizations look automated solution search standardization increasing number organizations started look solution better fit activities commercial solutions created stable organizations succeeded given level security long-term support us utilities oil gas companies used data diodes several years regulators encouraged use protect equipment processes siss nuclear regulatory commission nrc mandates use data diodes many sectors addition electrical nuclear also use data diodes effectively europe regulators operators several safety-critical systems started recommending implementing regulations use unidirectional gateways 2013 working industrial control system cybersecurity directed french network information security agency anssi stated forbidden use firewalls connect class 3 network railway switching systems lower class network corporate network unidirectional technology permitted unidirectional network devices typically used guarantee information security protection critical digital systems industrial control systems cyber attacks use devices common high security environments defense serve connections two networks differing security classifications technology also used enforce one-way communications outbound critical digital systems untrusted networks connected internet physical nature unidirectional networks allows data pass one side network connection another way around low side untrusted network high side trusted network vice versa first case data high side network kept confidential users retain access data low side functionality attractive sensitive data stored network requires connectivity internet high side receive internet data low side data high side accessible internet-based intrusion second case safety-critical physical system made accessible online monitoring yet insulated internet-based attacks might seek cause physical damage cases connection remains unidirectional even low high network compromised security guarantees physical nature two general models using unidirectional network connections classical model purpose data diode prevent export classified data secure machine allowing import data insecure machine alternative model diode used allow export data protected machine preventing attacks machine described detail involves systems must secured remote/external attacks public networks publishing information networks example election management system used electronic voting must make election results available public time must immune attack model applicable variety critical infrastructure protection problems protection data network less important reliable control correct operation network example public living downstream dam needs up-to-date information outflow information critical input control system floodgates situation critical flow information secure control system public vice versa majority unidirectional network applications category defense defense contractors organizations traditionally applied air gaps keep classified data physically separate internet connection introduction unidirectional networks environments degree connectivity safely exist network classified data network internet connection bell-lapadula security model users computer system create data security level applies contexts hierarchy information classifications users security level share machine dedicated level machines connected data diodes bell-lapadula constraints rigidly enforced traditionally network provides dmz server access authorized user data vulnerable intrusions network however unidirectional gateways separating critical side ot network sensitive data open side business internet connectivity normally network organizations achieve best worlds enabling connectivity required assuring security holds true even network compromised traffic flow control physical nature simplest form unidirectional network modified fiber-optic network link send receive transceivers removed disconnected one direction link failure protection mechanisms disabled commercial products rely basic design add software functionality provides applications interface helps pass data across link sophisticated commercial offerings enable simultaneous one-way data transfer multiple protocols usually require bidirectional links owl cyber defense offered specialized government defense data diode solutions since late 1990s well solutions critical infrastructure commercial applications recently low-cost iot security data diode 2018 siemens mobility released industrial grade unidirectional gateway solution data diode data capture unit uses electromagnetic induction new chip design achieve eba safety assessment guaranteeing secure connectivity new existing safety critical systems safety integrity level sil 4 enable secure iot provide data analytics cloud hosted digital services us naval research laboratory nrl developed unidirectional network called network pump many ways similar dsto work except allows limited backchannel going high side low side transmission acknowledgments technology allows protocols used network introduces potential covert channel high- low-side compromised artificially delaying timing acknowledgment different implementations also differing levels third party certification accreditation cross domain guard intended use military context may require extensive third party certification accreditation data diode intended industrial use however may require third party certification accreditation depending application | [
6337,
4194,
1350,
8998,
11470,
3827,
3924,
2901,
8694,
9206,
3930,
5245,
8574
] | Test |
2,427 | 3 | Chung_Laung_Liu:chung laung liu professor chung laung dave liu 劉炯朗 c. l. liu ethnic chinese computer scientist born guangzhou spent childhood macau received b.sc degree taiwan master degree doctorate united states liu received b.sc degree 1956 national cheng kung university taiwan s.m e.e degrees 1960 sc d. degree 1962 massachusetts institute technology faculty massachusetts institute technology 1962–1972 university illinois urbana-champaign 1972–1998 associate provost 1995 1998 retired uiuc served president professor computer science national tsing hua university nthu hsinchu taiwan february 1998 february 2002 currently william mong honorary chair professor national tsing hua university visiting professor city university hong kong waseda university tokyo japan li k. t. honorary chair professor national central university since 2007 li kuo-ting forum professor national cheng kung university author co-author seven books monographs 180 technical papers research interests include computer-aided design vlsi circuits real-time systems computer-aided instruction combinatorial optimization discrete mathematics received ieee millennium medal ieee circuits systems society golden jubilee medal 2000 also received ieee computer society real time systems technical committee 1999 technical achievement award inaugural winner contributions area real time scheduling ieee circuits systems society 1998 technical achievement award contributions area computer aided design vlsi circuits received outstanding talents foundation award 1998 recipient 1994 ieee education medal also received taylor l. booth education award ieee computer society 1992 inaugural winner karl v. karlstrom education award association computing machinery 1989 member academia sinica fellow institute electrical electronics engineers fellow association computing machinery 2004 university macau awarded honorary doctorate | [
1783,
679
] | Test |
2,428 | 3 | Tsinghua_University:tsinghua university tsinghua university abbreviated thu also romanized qinghua major research university beijing member elite c9 league chinese universities since establishment 1911 graduated numerous chinese leaders politics business academia culture reflecting motto self-discipline social commitment tsinghua university dedicated academic excellence advancing well-being chinese society global development along nearby peking university tsinghua perennially ranked one top academic institutions china asia worldwide recognized 14th best university 2017 times higher education world reputation rankings since 2015 tsinghua ranked best engineering computer science school world based factors including total research output performance tsinghua class institution double first class university plan tsinghua university established beijing tumultuous period national upheaval conflicts foreign powers culminated boxer rebellion anti-imperialist uprising foreign influence china suppression revolt foreign alliance including united states ruling qing dynasty required pay indemnities alliance members us secretary state john hay suggested us 30 million boxer indemnity allotted united states excessive much negotiation qing ambassador liang cheng us president theodore roosevelt obtained approval united states congress 1909 reduce indemnity payment us 10.8 million condition funds would used scholarships chinese students study united states using fund tsinghua college established beijing 29 april 1911 site former royal garden serve preparatory school students government planned send united states faculty members sciences recruited ymca united states graduates transferred directly american schools juniors upon graduation motto tsinghua self-discipline social commitment derived 1914 speech prominent scholar faculty member liang qichao quoted ching describe notion ideal gentleman 1925 school established four-year undergraduate program started research institute chinese studies 1928 tsinghua changed name national tsing hua university nthu second sino-japanese war many chinese universities forced evacuate campuses avoid japanese invasion 1937 tsinghua university along neighboring peking university nankai university merged form changsha temporary university changsha later became national southwestern associated university kunming yunnan province surrender occupying japanese forces end world war ii tsinghua university resumed operations beijing end chinese civil war 1949 china experienced communist revolution leading creation people republic china tsinghua university president mei yiqi along many professors fled taiwan retreating nationalist government established national tsing hua institute nuclear technology 1955 later became national tsing hua university taiwan institution independent distinct tsinghua university 1952 communist party china regrouped country higher education institutions attempt build soviet style system institution specialized certain field study social sciences natural sciences tsinghua university streamlined polytechnic institute focus engineering natural sciences 1966 1976 china experienced immense sociopolitical upheaval instability cultural revolution many university students walked classrooms tsinghua institutions went join red guards resulting complete shutdown university faculty persecuted otherwise unable teach 1978 cultural revolution ended university began take students re-emerge force chinese politics society 1980s tsinghua evolved beyond polytechnic model incorporated multidisciplinary system emphasizing collaboration distinct schools within broader university environment system several schools re-incorporated including tsinghua law school school economics management school sciences school life sciences school humanities social sciences school public policy management academy arts design 1996 school economics management established partnership sloan school management massachusetts institute technology one year later tsinghua mit began mba program known tsinghua-mit global mba 1997 tsinghua became first chinese university offer master laws llm program american law cooperative venture temple university beasley school law since resuming operations 1978 tsinghua university re-established among elite chinese universities affiliated c9 league selected participate double first class university plan national international university rankings consistently place tsinghua among best universities greater china asia worldwide tsinghua alumni include current general secretary chinese communist party paramount leader china xi jinping '79 graduated degree chemical engineering along cpc general secretary former paramount leader china hu jintao '64 graduated degree hydraulic engineering addition powerful alumni tsinghua reputation hosting globally prominent guest speakers international leaders bill clinton tony blair henry kissinger carlos ghosn park geun-hye henry paulson lectured university community 2018 tsinghua university consists 20 schools 58 university departments 41 research institutes 35 research centers 167 laboratories including 15 national key laboratories september 2006 peking union medical college renowned medical school renamed peking union medical college tsinghua university although tsinghua university technically separate institutions university operates tsinghua university press publishes academic journals textbooks scholarly works constituent colleges graduate professional schools institutes tsinghua university offers 51 bachelor degree programs 139 master degree programs 107 phd programs university consistently pursued innovation undergraduate graduate education partnerships foreign universities creation new colleges high-profile scholarship programs 2014 tsinghua established xinya college residential liberal arts college pilot project reform undergraduate education university modeled universities united states europe xinya combines general professional education liberal arts tradition featuring core curriculum chinese western literature civilization studies required courses physical education foreign languages furthermore tsinghua undergraduates must choose specific major upon entrance xinya students declare majors end freshman year enabling explore several different fields study tsinghua university also aggressively pursuing greater recognition global stage attracting funding talented international graduate students established 2013 us 300 million endowment modeled rhodes scholarship schwarzman scholars program annually selects funds 200 scholars enrolled one-year master degree programs public policy international relations engineering economics business scholars reside university campus schwarzman college residential college built specifically program 2016 tsinghua expenditures rmb 13.7 billion us 3.57 billion purchasing power parity largest budget university china tsinghua university engages extensive research offers 51 bachelor degree programs 139 master degree programs 107 doctoral programs 20 colleges 57 departments covering broad range subjects including science engineering arts literature social sciences law medicine along membership c9 league tsinghua university affiliations include association pacific rim universities group 50 leading asian american universities washington university st. louis ’ mcdonnell international scholars academy group 35 premier global universities association east asian research universities 17-member research collaboration network top regional institutions tsinghua associate member consortium linking universities science technology education research cluster admission tsinghua undergraduate graduate schools extremely competitive undergraduate admissions domestic students decided gaokao chinese national college entrance exam allows students list tsinghua university among preferred college choices selectivity varies province sheer number high school students applying college year resulted overall acceptance rates far lower 0.1 test takers tsinghua university commands high rate matriculation accepted undergraduates according report 2008 215 300 students placed within top 10 30 tested provinces regions chose tsinghua first choice school 21 30 top scorers province region chose university admission tsinghua graduate schools also competitive 16 mba applicants admitted year research tsinghua university mainly supported government funding national programs special projects areas science technology funding sources totals 20 billion yuan subsidizes 1,400 projects every year conducted university prospective increase state investment science technology research tsinghua projected receive financial support state year university hosts intellectual property summer institute cooperation franklin pierce law center concord new hampshire according domestic international rankings tsinghua university consistently recognized one top two universities mainland china along neighboring institution rival peking university example netbig chinese university rankings gave tsinghua 1st 2008 2009 2010 awarded 2nd china education center years internationally tsinghua regarded reputable chinese university 2017 times higher education world reputation rankings ranked 14th globally 2019 ranked 6th among universities around world scimago institutions rankings 2013 tsinghua also topped newly created regional qs brics university rankings 2015 us news world report best global university ranking ranked tsinghua 4th asia 59th globally sciences general 2018 cwts leiden ranking ranked tsinghua university 6th world time period 2013-2016 2014 ranked 23rd times higher education rankings subjects engineering technology historical strengths tsinghua since 2015 tsinghua university overtaken massachusetts institute technology top list best global universities engineering published u.s. news world report department electrical engineering tsinghua university plays pioneer role state power grid china research focus department include following areas department mathematical sciences dms established 1927 1952 tsinghua dms merged peking university department mathematical sciences 1979 renamed department applied mathematics renamed 1999 current title tsinghua dms three institutes present institute pure mathematics 27 faculty members institute applied mathematics probability statistics 27 faculty members institute computational mathematics operations research 20 faculty members currently 400 undergraduate students 200 graduate students department precision instrument called department precision instrument machine manufacturing 1960 separated department machine manufacturing independent department later 1971 renamed department precision instrument mission department precision instrument tsinghua university dean said supporting national development improving people ’ well-being research department precision instrument divided four main parts led four research institutes institute opto-electronic engineering institute instrument science technology engineering research center navigation technology center photonics electronics time department precision instrument three key laboratories state key laboratory tribology state key laboratory precision measurement technology instruments key laboratory high-accuracy inertial instrument system also two national engineering research centers national engineering research center optical disk cims national engineering research center institute opto-electronic engineering ioee established 1958 obtained chinese government authorization offer phd program 1981 approval build post-doctoral research site 1988 research ioee covers opto-electronic instruments precision metrology measurement modern optical information processing theory components binary optics birefringent frequency-splitting lasers several famous scientists work ioee including professor guofan jin academician chinese academy engineering professor kegong zhao formerly president chinese national institute metrology institute instrument science technology important institute state key laboratory precision measuring technology instrument science tsinghua university institute equipped advanced instruments facilities research included every major area modern instrument science technology 2012 institute produced 1500 publications 100 patents acquired many significant awards engineering research center navigation technology relatively young institute department precision instrument established 2000 intention pursue excellence research development field high-accuracy inertial instruments navigation technology well mems inertial sensor fields provide advanced training future scientists engineers field inertial technology research interests cover high-accuracy inertial instruments navigation technology mems inertial sensors systems precise electro-mechanical control systems application 2012 area center 2900 square meters including approximately 550 square meters clean rooms equipment instruments center worth 50 million rmb 7.56 million usd center photonics electronics works advanced laser photonic technology houses 200 square meters clean rooms modern laser instruments equipment research center covers solid-state laser technology fiber laser technology active optics technology laser detection technology center published lots papers also partnerships many domestic international companies research institutes authorization china state planning commission ministry education state key laboratory tribology sklt established november 1988 present director sklt professor yonggang meng present chair academic committee sklt professor jue zhong also member chinese academy engineering sklt one central laboratory 4 sub-laboratories awarded numerous awards including two national natural science awards two national invention awards one national award science technology progress two national excellent science book awards 25 awards ministries provinces china edmond e. bisson award 2003 stle 2008 pe publishing prize editor editorial board journal engineering tribology moreover china ministry education recognized sklt one creative groups 2005 national natural science foundation china recognized sklt one creative research groups 2007 established 1995 state key laboratory precision measurement technology instruments joint laboratory tsinghua university tianjin university national key laboratory two recognized national first-level key disciplines second-class disciplines research state key laboratory precision measurement technology instruments categorized four major parts laser optoelectric measurement technology sensing information measurement technology micro- nano- measurement fabrication technology quality control manufacturing technology key laboratory high-accuracy inertial instrument system established intention support research engineering research center navigation technology since establishment five prizes published large quantity papers currently two disciplines department precision instrument discipline instrumental science technology precision instrument mechanology discipline optical engineering six teaching laboratories centers serve significant roles undergraduate graduate education department precision instrument department provides 40 courses undergraduate level 25 courses graduate level 2012 284 undergraduates 152 postgraduates 219 doctoral students studying working department school life sciences first established 1926 name department biology botanist qian chongshu took first dean nationwide reorganization universities early 1950s department biology merged universities namely peking university etc. resulting vacancy field biological research tsinghua almost 30 years june 1984 decisions made reestablishment department biology department officially reopened september reestablishment department biology peking university institute biophysics chinese academy sciences many institutes well biologists provided valuable support help department changed name current name september 2009 2013 structural biologist foreign associate national academy sciences united states dr. yigong shi current dean school life sciences school currently 38 professors around 600 undergraduates including candidates tsinghua university peking union medical college joint md program 200 graduate students peking union medical college established 1917 rockefeller foundation modeled us medical education system tsinghua first established medical school 2001 2006 tsinghua medical school merged peking union medical college renaming peking union medical college tsinghua university school remains top ranked medical school general hospital china according cucas 2015 peking union medical college also medical school affiliated chinese academy medical sciences runs one competitive medical programs country accepting 90 students year 8-year md program students 8-year program spend 2.5 years tsinghua studying basic sciences moving onto peking union medical college complete last 5.5 years clinical medicine tsinghua school journalism communication tsjc established april 2002 predecessor communication studies department chinese language literature establishment coincides development media increasingly influencing world affairs time fast-growing globalization school research fields include international communication film television studies new media studies media operation management business journalism based comprehensive academic research journalism communication theories objective school bring full advantage tsinghua university comprehensive academic structure chinese international media construct first-rate discipline journalism communication studies cultivate talented professionals field explore advanced concepts journalism communication school also offers two-year graduate program international business journalism sponsored bloomberg l.p. international center journalists icfj trains talented students media professionals around globe financial media corporate communication school five research-oriented centers organize conduct academic research activities center international communications studies center new media studies center film television studies center media management studies center cultural industry studies legal studies tsinghua university dated back tsinghua college era 1911-1929 many students sent universities western countries legal studies graduating institutions columbia yale harvard tsinghua alumni played important role areas law diplomacy famous legal scholars tuan-sheng ch'ien yan shutang 燕树棠 wang huacheng 王化成 kung chuan hsiao 萧公权 pu xuefeng 浦薛凤 mei ju'ao 梅汝璈 xiang zhejun 向哲浚 diplomat tang yueliang 唐悦良 graduates tsinghua college went study abroad passing exams tsinghua college tsinghua university school law established 1929 tsinghua college renamed tsinghua university legal education tsinghua university time focused international affairs chinese legal studies courses political science economics could also found students curriculum japanese army invaded beijing 1937 school law developed greatly many chinese legal scholars graduated era including wang tieya 王铁崖 gong xiangrui 龚祥瑞 lou bangyan 楼邦彦 1952 response government policy turning tsinghua university engineering-focused university law school dismissed faculty appointed universities including peking university peking college political science law predecessor china university political science law 1995 formal school law tsinghua university yet courses law still taught tsinghua university september 8 1995 tsinghua university department law formally re-established april 25 1999 88th anniversary tsinghua university university formally changed department school law new law school inherited spirit old law school endeavored add international factors students curriculum due outstanding faculty members students tsinghua university school law risen become one leading law schools china since 2012 consistently ranked best second-best law school mainland china qs world university rankings graduate school shenzhen jointly founded tsinghua university shenzhen municipal government school directly affiliated tsinghua university beijing campus located university town shenzhen since 18 october 2003 graduate school shenzhen tsinghua university jointly founded tsinghua university shenzhen municipal government cultivating top level professionals carrying scientific technological innovations academic divisions tsinghua university 110 student associations covering five domains science technology physical training humanities arts public welfare name students association global affairs saga student association educational poverty alleviation saepa students performing arts club zijing volunteer service rural international student exchange rise students association science technology photography association foreign languages association association student international communication asic etc international students encouraged participate various extracurricular activities join student associations university fsao also organizes extracurricular activities international students including welcome party new students new year ’ party graduation party visits chinese cultural historical destinations sports competitions etc campus tsinghua university located northwest beijing haidian district designated universities academic institutes located former site qing dynasty royal gardens retains chinese-style landscaping well traditional buildings many buildings also western-style reflecting american influence history along rival neighbor peking university known throughout china wider world one beautiful campuses tsinghua university campus named one beautiful college campuses world panel architects campus designers forbes 2010 university asia list t. chuang 1914 graduate university illinois urbana–champaign helped design campus grounds tsinghua university influences american architectural style architectures university institute nuclear new energy technology separate campus northern suburb beijing tsinghua history museum covers construction area 5,060 m² collection old documents pictures artworks maps graphics videos music tells visitors history tsinghua university exhibition also pays tribute people contributed prestige development institution tsinghua university produced many notable graduates especially political sphere academic field industry tsinghua graduates political prominence disproportionately greater number graduates famous universities include former general secretary president hu jintao current party general secretary xi jinping former chairman national people congress wu bangguo former premier zhu rongji former first vice premier huang ju tsinghua also two nobel prize winners tsung-dao lee yang chen ning latter currently residing tsinghua campus term qinghua clique refers group communist chinese politicians graduated tsinghua university members fourth generation chinese leadership purported hold reformist hesitantly pro-democratic ideas number studied united states following graduation tsinghua said influenced reform ideals hu yaobang prc ascendance power began 2008 17th national congress cpc | [
9601,
3874,
132,
10116,
11365,
1930,
11340,
7893
] | None |
2,429 | 4 | Network_encryption_cracking:network encryption cracking network encryption cracking breaching network encryptions e.g. wep wpa ... usually use special encryption cracking software may done range attacks active passive including injecting traffic decrypting traffic dictionary-based attacks mentioned several types attacks possible precisely injecting traffic means inserting forged encrypted messages network may done either key known generate new messages key known encrypted message plaintext message gathered comparison two programs able latter aireplay wepwedgie decryption often requires 2 tools 1 gathering packets another analysing packet determining key gathering packets may done tools wireshark prismdump cracking may done tools wepcrack airsnort aircrack weplab gathering packets often great amount required perform cracking depending attack used 5-16 million frames may required attack command however surprisingly simple commands inputted wepcrack perl \progra~1\wepcrack\pcap-getiv.pl command generates log-file ivfile.log captured packet obtained wireshark prismdump packet least 5 million frames required perl \progra~1\wepcrack\wepcrack\.pl ivfile.log command asks wepcrack determine key log file aircrack another program even simpler use command need entered instead user asked type parameters click buttons first airodump started gather packets herefore channel mac-filter asked yet user need know per se instead 0 p may inputted respectively aircrack started file created airodump accessed 0 needs entered program determines key airsnort even simpler program completely interface-based attack simple brute-force attack however cracking encryption take several days weeks especially traffic low 4 users network cracking take least 2 weeks comparison tools noted may found security focus | [
9640,
7557
] | None |
2,430 | 4 | Cracking_of_wireless_networks:cracking wireless networks cracking wireless network defeating security wireless local-area network back-jack wireless lan commonly used wireless lan wi-fi network wireless lans inherent security weaknesses wired networks exempt wireless cracking information network attack similar direct intrusion two frequent types vulnerabilities wireless lans caused poor configuration caused weak flawed security protocols 802.11 networks use data frames management frames control frames data frames convey real data similar ethernet management frames maintain network configuration connectivity control frames manage access ether prevent access points clients interfering ether information management frames helpful better understand programs reconnaissance wardriving common method wireless network reconnaissance well-equipped wardriver uses laptop computer wireless card antenna mounted car power inverter connected gps receiver way connect internet wirelessly purpose wardriving locate wireless network collect information configuration associated clients laptop computer wireless card must support mode called monitor rfmon netstumbler network discovery program windows free netstumbler become one popular programs wardriving wireless reconnaissance although disadvantage detected easily wireless intrusion detection systems actively probes network collect information netstumbler integrated support gps unit support netstumbler displays gps coordinate information next information discovered network useful finding specific networks sorted collected data latest release netstumbler 1 april 2004 work well 64-bit windows xp windows vista inssider wi-fi network scanner 32-bit 64-bit versions windows xp vista 7 windows 8 android free open source software uses current wireless card wireless usb adapter supports gps devices namely use nmea 2.3 higher graphical user interface shows mac address ssid signal strength hardware brand security network type nearby wi-fi networks also track strength signals show time graph kismet wireless network traffic analyser os x linux openbsd netbsd freebsd wireshark packet sniffer network traffic analyser run popular operating systems support capture wireless traffic limited free open source decoding analysing wireless traffic foremost function wireshark give results obtained programs wireshark requires sufficient knowledge network protocols obtain full analysis traffic however airmagnet laptop analyser airmagnet handheld analyser wireless network analysis tools made airmagnet company started handheld analyser suitable surveying sites wireless networks deployed well finding rogue access points laptop analyser released hand-held product impractical reconnaissance wide areas commercial analysers probably offer best combination powerful analysis simple user interface however well adapted needs wardriver free programs androdumpper android apk used test hack wps wireless routers vulnerability using algorithms hack wifi network runs best android version 5.0+ airopeek packet sniffer network traffic analyser made wildpackets commercial program supports windows works wireless network interface cards become industrial standard capturing analysing wireless traffic however like wireshark airopeek requires thorough knowledge protocols use ability kismac program discovery wireless networks runs os x operating system functionality kismac includes gps support mapping ssid decloaking deauthentication attacks wep cracking two basic types vulnerabilities associated wlans caused poor configuration caused poor encryption poor configuration causes many vulnerabilities wireless networks often put use insufficient security settings security settings – default configuration – access obtained simply association without sufficient security settings networks easily defeated cloaking and/or mac address filtering poor encryption causes remaining vulnerabilities wired equivalent privacy wep defective defeated several ways wi-fi protected access wpa cisco lightweight extensible authentication protocol leap vulnerable dictionary attacks wep encryption standard firstly available wireless networks deployed 64 128 bit strength 64 bit wep secret key 40 bits initialisation vector 24 bits often called 40 bit wep 128 bit wep secret key 104 bits initialisation vector 24 bits called 104 bit wep association possible using password ascii key hexadr cracking wep fluhrer mantin shamir attack|fms attack chopping attack fms attack – named fluhrer mantin shamir – based weakness rc4 encryption algorithm researchers found 9000 possible 16 million initialisation vectors considered weak collecting enough allows determination encryption key crack wep key cases 5 million encrypted packets must captured collect 3000 weak initialisation vectors cases 1500 vectors cases 5000 needed success weak initialisation vectors supplied rc4 key-scheduling algorithm ksa |key scheduling algorithm ksa rc4 pseudo-random generation algorithm prga |pseudo random generator prng determine first byte wep key procedure repeated remaining bytes key chopping attack chops last byte captured encrypted packets breaks cyclic redundancy check checksum|integrity check value crc/icv 8 bits removed byte zero crc shortened packet made valid manipulation last four bytes manipulation result original xor certain value manipulated packet retransmitted method enables determination key collecting unique initialisation vectors main problem fms attack chopping attack capturing enough packets take weeks sometimes months fortunately speed capturing packets increased injecting packets network one address resolution protocol arp packets usually collected end transmitted access point repeatedly enough response packets captured arp packets good choice recognizable size 28 bytes waiting legitimate arp packet take awhile arp packets commonly transmitted authentication process rather waiting sending deauthentication frame pushes client network require client reauthenticate often creates arp packet wpa developed vulnerabilities wep wpa uses either pre-shared key wpa-psk used combination radius server wpa-radius encryption algorithm wpa uses either temporal key integrity protocol tkip advanced encryption standard aes wi-fi protected access wpa2|wpa2 developed vulnerabilities wpa-psk strengthen encryption wpa2 uses tkip aes requires encryption piece also authentication piece form extensible authentication protocol eap deployed piece wpa-psk attacked psk shorter 21 characters firstly four-way eap lan eapol handshaking|handshake must captured captured legitimate authentication reauthentication forced sending deauthentication packets clients secondly word word-list must cryptographic hash function|hashed hashed message authentication code – secure hash algorithm 1 two called nonce values along mac address client asked authentication mac address access point gave authentication word-lists found leap uses variation microsoft challenge handshake protocol version 2 ms-chapv2 handshake uses data encryption standard des key selection leap cracked dictionary attack attack involves capturing authentication sequence comparing last two bytes captured response generated word-list wpa-radius cracked however radius authentication server cracked whole network imperilled security authentication servers often neglected wpa2 attacked using wpa-psk attack largely ineffective aircrack-ng runs windows linux crack wep wpa-psk use pychkine-tews-weinmann korek attacks statistical methods efficient traditional fms attack aircrack-ng consists components airmon-ng configures wireless network card airodump-ng captures frames aireplay-ng generates traffic aircrack-ng cracking using data collected airodump-ng finally airdecap-ng decrypts packets captured thus aircrack-ng name suite also one components cowpatty automates dictionary attack wpa-psk runs linux program started using command-line interface specifying word-list contains passphrase dump file contains four-way eapol handshake ssid network void11 program deauthenticates clients runs linux mac address filtering used alone ineffective security measure combination encryption attack determining allowed mac address changing mac address attacker address etherchange one many programs available change mac address network adapters runs windows penetration test ing wireless network often stepping stone penetration testing internal network wireless network serves so-called entry vector wpa-radius use target site another entry vector must investigated 'wireless packet analyzer|sniffer find ip address es helpful network mapping access points usually connect nodes wireless network wired network bridge router bridge router use routing table forward packets finding relevant reachable ip addresses objective reconnaissance phase attacking organization internet relevant ip addresses determined collecting many domain name system|dns host names possible translating ip addresses ip address ranges called footprinting web search engine|search engine key finding much information possible target many cases organizations want protect resources internet access instance web server must accessible many organizations additionally message transfer agent|email servers file transfer protocol|ftp servers systems must accessible internet ip addresses organization often grouped together one ip address found rest probably found around name server store tables show domain names must translated ip addresses vice versa windows command nslookup|nslookup used query dns servers word help entered nslookup prompt list commands given linux command dig used query dns servers displays list options invoked option -h command host reverses ip addresses hostnames program nmap used reverse dns walker nmap -sl 1.1.1.1-30 gives reverse entries given range arin ripe apnic lacnic afrinic five regional internet registry|regional internet registries responsible assignment registration ip addresses website databases searched owner ip address registries respond search name organization list ip address ranges assigned name however records registries always correct cases useless probably computers access internet receive ip address dynamically dynamic host configuration protocol|dhcp protocol become popular last years decrease available ip addresses increase large networks dynamic dhcp particularly important many employees take portable computer one office another router/ firewall computing |firewall device people use home connect internet probably also functions dhcp server nowadays many router/dhcp devices perform network address translation nat nat device gateway telecommunications |gateway local network internet seen internet nat device seems single host nat local network use ip address space ip address ranges reserved private network s. ranges typically used local area network behind nat device 10.0.0.0 10.255.255.255 172.16.0.0 172.31.255.255 192.168.0.0 192.168.255.255 relevant ip addresses must narrowed reachable purpose process scanning enters scene access wireless network gained helpful determine network topology including names computers connected network nmap used available windows linux version however nmap provide user network diagram network scanner network view runs windows program asks one ip address ip address range program finished scanning displays map network using different pictures routers workstation server computing |servers laptop names added direct method finding hosts local area network|lan using program ping networking utility |ping using modern flavour unix shell computing |shell commands combined produce custom ping sweep|ping-sweeps using windows command-line also used create ping-sweep examples given reference ping-sweeps also known host scans nmap used host scan option -sp added nmap -n -sp 10.160.9.1-30 scans first 30 addresses subnet 10.160.9 -n option prevents reverse dns lookups ping packets could reliably determine whether computer line specified ip address nowadays internet control message protocol|icmp echo request packets sometimes blocked firewall operating system although nmap also probes tcp port 80 specifying tcp ports probe recommended pings blocked consequently nmap -sp -ps21,22,23,25,80,139,445,3389 10.160.9.1-30 achieve better results combining various options nmap -sp -ps21,22,23,25,80,135,139,445,1025,3389 -pu53,67,68,69,111,161,445,514 -pe -pp -pm 10.160.9.1-30 superb host scanning achieved nmap available windows unix operating systems offers graphical command-line interfaces purpose port scanning finding open ports computers found host scan port scan started network without making use results host scan much time wasted many ip addresses address range vacant programs communicate internet use either transmission control protocol|tcp user datagram protocol|udp protocol protocols support 65536 called port computer networking |ports programs choose bind allows programs run concurrently one ip address programs default ports often used example http servers commonly use tcp port 80 network scanners try connect tcp udp ports port accepts connection assumed commonly bound program running tcp connections begin syn packet sent client server server responds syn/ack packet finally client sends ack packet scanner sends syn packet gets syn/ack packet back port considered open rst packet received instead port considered closed response received port either considered filtered firewall running host ip address scanning udp ports difficult udp use handshakes programs tend discard udp packets process udp packet sent port program bound icmp error packet returned port considered closed answer received port considered either filtered firewall open many people abandoned udp scanning simple udp scanners distinguish filtered open ports although thorough scan 65536 ports would take time scanning common ports therefore nmap scans 1667 tcp ports default 2007 -p option instructs nmap scan specified ports nmap -p 21-25,80,100-160 10.150.9.46 specifying tcp udp ports also possible nmap -pt:21-25,80 u:5000-5500 10.150.9.46 nmap always requires specification host hosts scan single host specified ip address domain name multiple hosts specified ip address ranges examples 1.1.1.1 www.company.com 10.1.50.1-5,250-254 nmap performs tcp syn scan default scan packets syn flag set -ss option specifies default explicitly nmap started administrator privileges default scan takes effect nmap started user privileges connect scan performed -st option instructs nmap establish full connection scan inferior previous additional packet must sent logging target likely connect scan performed nmap executed user privileges ipv6 addresses scanned -sn option instructs nmap send packets none syn rst ack flags set tcp port closed rst packet sent return tcp port open filtered response null scan often bypass stateless firewall useful stateful firewall employed -su option instructs nmap send udp packets data icmp error returned port assumed closed response received port assumed open filtered differentiation open filtered ports severe limitation -su -sv options instruct nmap use application data application identification combination options lead slow scanning packets sent network faster cope dropped leads inaccurate scanning results intrusion detection system intrusion prevention system present target network detection becomes likely speed increases many intrusion prevention system|ips devices firewalls respond storm syn packets enabling syn cookies make appear every port open full speed scans even wreak havoc stateful firewall|stateful network devices nmap provides five templates adjusting speed also adapts -t0 option makes wait 5 minutes next packet sent -t1 option makes wait 15 seconds -t2 inserts 0.4 seconds -t3 default leaves timing settings unchanged -t4 reduces time-outs retransmissions speed things slightly -t5 reduces time-outs retransmissions even speed things significantly modern ids/ips devices detect scans use -t1 option user also define new template settings use instead provided one -sv option instructs nmap also determine version running application -o option instructs nmap try determine operating systems targets specially crafted packets sent open closed ports responses compared database -ox filename option instructs nmap save output file xml format vulnerability bug application program affects security made public places bugtraq|bugtraq full-disclosure mailing lists computer emergency response team|computer emergency response team cert brings statistical report every year 8064 vulnerabilities counted 2006 alone vulnerability scanning determining whether known vulnerabilities present target exploit computer security |exploit takes advantage software bug|bug application software|application take effect execution arbitrary commands inserting execution path program privilege escalation|escalation privileges bypass authentication infringement confidentiality result metasploit project|metasploit framework released 2003 framework provided first time basic procedure using metasploit choose exploit choose payload set ip address port target start exploit evaluate stop repeat procedure metasploit suited finding vulnerabilities host vulnerability scanner alternatively port scanner found open port exploits port may tried metasploit 3.0 provides following payloads vnc connections need relatively large bandwidth computing |bandwidth usable someone front compromised computer interaction seen quickly command-line interfaces linux os x powerful windows meterpreter payload remedies shortcomings reference gives list meterpreter commands ultimate gratification network intruder always obtain administrator privileges network intruder inside one first undertakings often install so-called rootkit target computer collection programs facilitate durable influence system programs used compromise new user computing user account|user accounts new computers network programs obscure presence intruder obscuring programs may include false versions standard network utilities netstat programs remove data log files computer relate intruder yet programs rootkit may used survey network overhear passwords travelling rootkits may also give means change operating system computer installed network intruder proceeds creating one called backdoor computing |back doors access provisions hard find system administrators serve prevent logging monitoring results normal use network back door may concealed account account privileges escalated may utility remote access telnet configured operate port number customary network intruder proceeds stealing files stealing credit card information preparing computer send spam emails another goal prepare next intrusion cautious intruder protective discovery location method choice use computer already attacked intermediary intruders use series intermediate computers making impracticable locate purpose back door maintain communication channel methods control host gained entry methods include file transfer execution programs often important make sure access communication remains secret access control desirable order prevent others using back door back orifice 2000 designed back door server runs windows client computing |clients windows linux operating systems server configured easily utility configuration server needs uploaded target started back orifice 2000 supports file transfer file execution keystroke logging|logging keystrokes control connections also aes plug-in computing |plug-in traffic encryption stcpio plug-in obfuscation traffic first plug-in adds security combination plug-ins makes much harder ids relate traffic back door information found http //www.bo2k.com rootkits specialize hiding programs hacker defender hxdef open source rootkit windows hide files process windows registry|registry entries port multiple dynamic-link library|dlls although simple command-line interface back door often better use ability hide appropriate tool unprotected wireless network extremely insecure anywhere within broadcast range someone eavesdrop start using network therefore ieee 802.11 standard wireless networks accompanied wired equivalent privacy wep security protocol takes care following wep criticized security experts experts regard ineffective 2004 draft better security protocol appeared included ieee 802.11 standard 2007 new protocol ieee 802.11i-2004|wpa2 uses aes block cipher instead rc4 algorithm better procedures authentication key distribution wpa2 much secure wep wep still wide use 2009 many wireless routers also support controlling mac addresses computers authorized use wireless network measure effectively stop neighbour using network experienced intruders stopped mac filtering attacked mac address faked easily past turning broadcasting ssid also thought give security wireless network case however freely available tools exist quickly discover ssid broadcast microsoft also determined switching broadcasting ssid leads less security details found non-broadcast wireless networks microsoft windows returning encryption wep specification encryption strength unable withstand determined hacking therefore wi-fi protected access wpa derived wep software upgrades often available latest devices conform ieee 802.11g-2003|802.11g ieee 802.11n-2009|802.11n standards also support wpa2 wpa uses tkip encryption wpa2 uses stronger aes method recommended use hardware supports wpa wpa2 installing updates regularly disabling wps setting custom ssid requiring wpa2 using strong password make wireless router difficult crack even unpatched security flaws router software firmware may still used attacker bypass encryption gain control device many router manufacturers always provide security updates timely manner especially inexpensive models wps currently severe vulnerability 8 pin numbered 0-9 passwords used easily split two halves means half brute-forced individually possible combinations greatly lessened 10^4 10^4 opposed 10^8 vulnerability addressed manufacturers days using lock mechanism router automatically lock wps number failed pin attempts take number hours router automatically unlock even rebooted make wps attacks completely obsolete without lock feature wpa2 router wps enabled easily cracked 5 hours using brute force wps attack ssid used routers identify within mass 2.4 3.6 5 60 ghz frequencies currently flying around cities also used seed router password hashes standard popular ssid netgear brute forced use rainbow table however use salt greatly improves security rainbow tables popular method wpa wpa2 cracking obtaining known 4 way handshake device connecting network 4-stage authorization process referred 4 way handshake wireless device undergoes process handshake sent air easily monitored saved external system handshake encrypted router password means opposed communicating router directly quite slow cracker attempt brute force handshake using dictionary attacks device connected directly router still undergo process however handshake sent connected wire opposed air intercepted 4 way handshake already intercepted mean cracker granted immediate access however password used contains least 12 characters consisting random upper lower case letters numbers spell word name pattern password essentially uncrackable give example let take minimum 8 characters wpa2 suppose take upper case lower case letters digits 0-9 small selection symbols avail hefty choice 64 characters 8 character length password grand total 64^8 possible combinations taking single machine could attempt 500 passwords per second gives us 17,900 years attempt every possible combination even mention amount space necessary store combination dictionary note use mac filtering protect network work macs using network easily detected spoofed network scanner sniffer application program makes use wireless network interface card repeatedly tunes wireless card successively number radio channels network detector passive scanning|passive scanner pertains receiver wireless card therefore scanning detected attacker obtain considerable amount information passive scanner information may obtained sending crafted frames provoke useful responses called active scanning probing active scanning also involves use transmitter wireless card activity therefore detected wireless card located detection possible intrusion detection system wireless networks locating possible suitable equipment wireless intrusion detection systems designed detect anomalous behaviour one sensors collect ssids radio channels beacon intervals encryption mac addresses transmission speeds signal-to-noise ratio s. wireless intrusion detection systems maintain registry mac addresses unknown clients detected making use someone else wireless access point wireless router connect internet – without owner consent way – punishable criminal law netherlands true even device uses form access protection penetrate someone else computer without owner consent punishable criminal law though consensus computer attackers divided following groups term hacker originally used someone could modify computer purposes hacking intrusion combined direct alteration security data structures breached system word hacking often confused cracking popular media discourse obfuscates fact hacking less eavesdropping related interference alteration however consistent abuse news media 2007 term hacker commonly used someone accesses network computer without authorization owner 2011 collins english dictionary|collins dictionary stated word hacker mean computer fanatic particular one means personal computer breaks computer system company government like also denoted sense word hacker slang slang words appropriate formal writing speech computer experts reserve word hacker clever programmer call someone breaks computers intruder attacker cracker category computer network security category computer security category cryptographic attacks category data security category dutch law category hacking computer security category local area networks category wi-fi category wireless networking | [
5636,
6916,
7556,
7557,
6153,
4490,
5387,
6797,
2446,
3984,
2961,
3473,
8978,
1429,
3094,
11413,
794,
5402,
7325,
2084,
8998,
9640,
939,
10924,
6013,
7983,
2739,
2996,
7222,
823,
8121,
5306,
1083,
7228,
5437,
9791,
8386,
4163,
7364,
2887,... | Train |
2,431 | 5 | Server_Routing_Protocol:server routing protocol server routing protocol srp proprietary network protocol used transfer data blackberry enterprise server research motion blackberry infrastructure srp communication takes place tcp port 3101 default srp work two different part 1 srp id 2 srp authorization key blackberry enterprise server installation unique server routing protocol identifier srp id srp authentication key must entered srp id srp authentication key register authenticate blackberry enterprise server network work flow like authentication process srp id thought login name authentication key password srp id uniquely identifies blackberry enterprise server network blackberry enterprise server connects blackberry infrastructure must provide two pieces information connect open session blackberry enterprise server connected blackberry infrastructure another server attempts connect using srp id authentication key blackberry infrastructure drops connection blackberry enterprise server creates session newly connecting server multiple concurrent connections made srp id blackberry device attempts send message must include srp id blackberry enterprise server note service book menu blackberry device open desktop cmime service book specified unique identifier uid value srp id blackberry enterprise server blackberry device attempts send messages blackberry device sends message arrives blackberry infrastructure message contains srp id pulled service book uid value blackberry infrastructure uses information send message corresponding blackberry enterprise server decryption processing ref blackberry server trial mentioning technology | [
6403,
9860,
9987,
1030,
3847,
9992,
6544,
3218,
8211,
11413,
5270,
6681,
5402,
5021,
3742,
2206,
2208,
5405,
10271,
1955,
10274,
9381,
10924,
562,
2996,
9909,
7478,
7865,
4797,
3006,
3133,
4543,
5437,
5439,
7360,
7364,
11332,
2887,
8265,
... | Train |
2,432 | 6 | Computer_file:computer file computer file computer resource recording data discretely computer storage device words written paper information written computer file files edited transferred internet particular computer system different types computer files designed different purposes file may designed store picture written message video computer program wide variety kinds data types files store several types information using computer programs person open read change save close computer file computer files may reopened modified copied arbitrary number times typically files organised file system keeps track files located disk enables user access word file derives latin filum thread file used context computer storage early january 1940 punched card methods scientific computation w.j eckert stated first extensive use early hollerith tabulator astronomy made comrie used building table successive differences adding large numbers harmonic terms tables functions constructed differences great efficiency either printed tables file punched cards february 1950 radio corporation america rca advertisement popular science magazine describing new memory vacuum tube developed rca stated results countless computations kept 'on file taken 'file exists 'memory tube developed rca laboratories electronically retains figures fed calculating machines holds storage memorizes new ones speeds intelligent solutions mazes mathematics 1952 file denoted inter alia information stored punched cards early use underlying hardware rather contents stored denominated file example ibm 350 disk drives denominated disk files introduction circa 1961 burroughs mcp mit compatible time-sharing system concept file system managed several virtual files one storage device origin contemporary denotation word although contemporary register file demonstrates early concept files use greatly decreased modern operating systems files organized one-dimensional arrays bytes format file defined content since file solely container data although platforms format usually indicated filename extension specifying rules bytes must organized interpreted meaningfully example bytes plain text file windows associated either ascii utf-8 characters bytes image video audio files interpreted otherwise file types also allocate bytes metadata allows file carry basic information file systems store arbitrary interpreted file system file-specific data outside file format linked file example extended attributes forks file systems done via sidecar files software-specific databases methods however susceptible loss metadata container archive file formats instant time file might size normally expressed number bytes indicates much storage associated file modern operating systems size non-negative whole number bytes system limit many older operating systems kept track number blocks tracks occupied file physical storage device systems software employed methods track exact byte count e.g. cp/m used special control character ctrl-z signal end text files general definition file require size real meaning however unless data within file happens correspond data within pool persistent storage special case zero byte file files newly created files yet data written may serve kind flag file system accidents results aborted disk operations example file link points typical unix-like system probably defined size seldom changes compare also file size may obscure information computer file consist smaller packets information often called records lines individually different share common traits example payroll file might contain information concerning employees company payroll details record payroll file concerns one employee records common trait related payroll—this similar placing payroll information specific filing cabinet office computer text file may contain lines text corresponding printed lines piece paper alternatively file may contain arbitrary binary image blob may contain executable way information grouped file entirely designed led plethora less standardized file structures imaginable purposes simplest complex computer files used computer programs create modify delete files use as-needed basis programmers create programs decide files needed used often names cases computer programs manipulate files made visible computer user example word-processing program user manipulates document files user personally names although content document file arranged format word-processing program understands user able choose name location file provide bulk information words text stored file many applications pack data files single file called archive file using internal markers discern different types information contained within benefits archive file lower number files easier transfer reduce storage usage organize outdated files archive file must often unpacked next using basic operations programs perform file files computer created moved modified grown shrunk deleted cases computer programs executed computer handle operations user computer also manipulate files necessary instance microsoft word files normally created modified microsoft word program response user commands user also move rename delete files directly using file manager program windows explorer windows computers command lines cli unix-like systems user space programs operate directly low level file kernel deals files handles user-space interaction files manner transparent user-space programs operating system provides level abstraction means interaction file user-space simply filename instead file descriptor example rm filename delete file link file many links file removed kernel considers file memory space free reallocated free space commonly considered security risk due existence file recovery software secure-deletion program uses kernel-space system functions wipe file data modern computer systems files typically accessed using names filenames operating systems name associated file others file anonymous pointed links names latter case user identify name link file false analogue especially exists one link file files links files located directories however generally directory contain either list files list links files within definition paramount importance term file includes directories permits existence directory hierarchies i.e. directories containing sub-directories name refers file within directory must typically unique words must identical names within directory however operating systems name may include specification type means directory contain identical name one type object directory file environments file named file name path file directory must uniquely identify among files computer system—no two files name path file anonymous named references exist within namespace cases name within namespace refer exactly zero one file however file may represented within namespace zero one names string characters may well-formed name file link depending upon context application whether name well-formed depends type computer system used early computers permitted letters digits name file modern computers allow long names 255 characters containing almost combination unicode letters unicode digits making easier understand purpose file glance computer systems allow file names contain spaces others case-sensitivity file names determined file system unix file systems usually case sensitive allow user-level applications create files whose names differ case characters microsoft windows supports multiple file systems different policies regarding case-sensitivity common fat file system multiple files whose names differ case user uses disk editor edit file names directory entries user applications however usually allow user create multiple files name differing case computers organize files hierarchies using folders directories catalogs concept irrespective terminology used folder contain arbitrary number files also contain folders folders referred subfolders subfolders contain still files folders thus building tree-like structure one master folder root folder — name varies one operating system another contain number levels folders files folders named files except root folder often name use folders makes easier organize files logical way computer allows use folders file folder name also path identifies folder folders file folder resides path sort special character—such slash—is used separate file folder names example illustration shown article path uniquely identifies file called folder called turn contained folder called folder file names separated slashes example topmost root folder name path begins slash root folder name would precede first slash many computer systems use extensions file names help identify contain also known file type windows computers extensions consist dot period end file name followed letters identify type file extension identifies text file extension identifies type document documentation commonly microsoft word file format even extensions used computer system degree computer system recognizes heeds vary systems required systems completely ignored presented many modern computer systems provide methods protecting files accidental deliberate damage computers allow multiple users implement file permissions control may may modify delete create files folders example given user may granted permission read file folder modify delete user may given permission read modify files folders execute permissions may also used allow certain users see contents file folder permissions protect unauthorized tampering destruction information files keep private information confidential unauthorized users another protection mechanism implemented many computers read-only flag flag turned file accomplished computer program human user file examined modified flag useful critical information must modified erased special files used internal parts computer system systems also include hidden flag make certain files invisible flag used computer system hide essential system files users alter file useful purpose must physical manifestation file abstract concept real computer system must real physical analogue exist physical terms computer files stored type data storage device example operating systems store files hard disk hard disks ubiquitous form non-volatile storage since early 1960s files contain temporary information may stored ram computer files also stored media cases magnetic tapes compact discs digital versatile discs zip drives usb flash drives etc use solid state drives also beginning rival hard disk drive unix-like operating systems many files associated physical storage device examples files directories virtual files exist objects within operating system kernel seen running user program files usually represented either file control block file handle file control block fcb area memory manipulated establish filename etc passed operating system parameter used older ibm operating systems early pc operating systems including cp/m early versions ms-dos file handle generally either opaque data type integer introduced around 1961 algol-based burroughs mcp running burroughs b5000 ubiquitous file said corrupted contents saved computer way ca n't properly read either human software depending extension damage original file sometimes recovered least partially understood file may created corrupt may corrupted later point overwriting many ways file become corrupted commonly issue happens process writing file disk example image-editing program unexpectedly crashes saving image file may corrupted program could n't save entirety program might warn user error allowing another attempt saving file examples reasons files become corrupted include although file corruption usually happens accidentally may also done purpose fool someone else thinking assignment ready earlier date potentially gaining time finish said assignment services provide demand file corruption essentially fill given file random data ca n't opened read yet still seems legitimate one effective countermeasures file corruption backing important files event important file becoming corrupted user simply replace backed version computer files contain information extremely important back-up process used protect disasters might destroy files backing files simply means making copies files separate location restored something happens computer deleted accidentally many ways back files computer systems provide utility programs assist back-up process become time-consuming many files safeguard files often copied removable media writable cds cartridge tapes copying files another hard disk computer protects failure one disk necessary protect failure destruction entire computer copies files must made media taken away computer stored safe distant location grandfather-father-son backup method automatically makes three back-ups grandfather file oldest copy file son current copy way computer organizes names stores manipulates files globally referred file system computers least one file system computers allow use several different file systems instance newer ms windows computers older fat-type file systems ms-dos old versions windows supported addition ntfs file system normal file system recent versions windows system advantages disadvantages standard fat allows eight-character file names plus three-character extension spaces example whereas ntfs allows much longer names contain spaces call file ntfs fat would restricted something like unless using vfat fat extension allowing long file names file manager programs utility programs allow users manipulate files directly allow move create delete rename files folders although actually allow read contents file store information every computer system provides least one file-manager program native file system example file explorer formerly windows explorer commonly used microsoft windows operating systems nautilus common several distributions linux | [
9216,
3081,
3598,
7189,
8214,
8729,
11293,
9762,
2597,
5158,
6694,
2095,
1073,
1586,
8754,
52,
1593,
7739,
3137,
8772,
1610,
5706,
10314,
10828,
4174,
5202,
5714,
1109,
2138,
2140,
1118,
1631,
10340,
3175,
8298,
8301,
9840,
4721,
6770,
67... | Test |
2,433 | 7 | AppFolio:appfolio appfolio founded 2006 offers software-as-a-service saas applications vertical markets appfolio initially focused property management software acquisition mycase 2012 expanded law practice management industry company ’ headquarters goleta california united states also offices san diego california dallas texas appfolio established 2006 co-founders klaus schauser jon walker schauser previously founded expertcity company ’ first focus property management small-to-medium businesses first product appfolio property manager launched 2007 november 2012 appfolio acquired mycase legal practice management software provider appfolio purchased real estate software firm rentlinx april 2015 acquisition included rights website showmetherent.com expanded sphere appfolio ’ clients provided greater listing presence may 2015 appfolio announced ipo unveiled june raised 74 million 2019 appfolio acquired dynasty marketplace inc. leading provider advanced artificial intelligence ai solutions real estate market 2019 2018 2017 2016 2015 2014 | [] | Test |
2,434 | 3 | Aliens:_The_Computer_Game_(1987_video_game):aliens computer game 1987 video game aliens computer game also known aliens video game developed software studios published electric dreams software 1987 initially amstrad cpc commodore 64 zx spectrum based film title ports commodore 16 msx developed mr. micro published 1987 aliens computer game played first-person perspective set inside atmosphere processing plant maze complex consisting 255 rooms player encounters alien enemies throughout game upon killing alien body leaves deadly pool acid blood must avoided player also faces threat bio-mechanical growth left uncontained results new alien eggs facehugger enemies player ultimate goal reach room houses queen alien nests must destroyed player directly control team marine soldiers issue orders team mobile tactical operations bay mtob playing mtob player view team surroundings via video cameras attached soldier helmet according retro gamer game praised computing press zzap amstrad action sinclair user awarded 81 90 5/5 respectively crash gave score 84 one reviewer declaring best game-of-the-film date review zzap 64 also opined best tie-in game date good game boot computer gamer gave excellent game superb film overall score 80 commodore user gave 8 10 sinclair gave 9 10 1993 commodore force ranked game number 59 list top 100 commodore 64 games retro gamer retrospective darren jones opined despite incredible basic look aliens dripped atmosphere quite unlike movie conversion time bloody good first-person view used game perfectly matched moment film pumped-up marines start exploring deserted base game progressed managed capture terror confusion movie way titles managed magazine also declared scariest 8-bit game ever made stephen kleckner gamesbeat wrote may lack audio/visual punch gameplay tightly defined forward-thinking time also recommended windows fan remake aliens titled lv-426 | [
2997,
9006
] | Test |
2,435 | 3 | Computer_architecture_simulator:computer architecture simulator computer architecture simulator program simulates execution computer architecture computer architecture simulators used following purposes computer architecture simulators classified many different categories depending context full-system simulator execution-driven architecture simulation level detail complete software stacks real systems run simulator without modification full system simulator provides virtual hardware independent nature host computer full-system model typically includes processor cores peripheral devices memories interconnection buses network connections emulators full system simulators imitate obsolete hardware instead development hardware defining property full-system simulation compared instruction set simulator model allows real device drivers operating systems run single programs thus full-system simulation makes possible simulate individual computers networked computer nodes software network device drivers operating systems network stacks middleware servers application programs full system simulation speed system development process making easier detect recreate repair flaws use multi-core processors driving need full system simulation extremely difficult time-consuming recreate debug errors without controlled environment provided virtual hardware also allows software development take place hardware ready thus helping validate design decisions cycle-accurate simulator computer program simulates microarchitecture cycle-by-cycle basis contrast instruction set simulator simulates instruction set architecture usually faster cycle-accurate specific implementation architecture often used emulating older hardware time precisions important legacy reasons often cycle-accurate simulator used designing new microprocessorsthey tested benchmarked accurately including running full operating system compilers without actually building physical chip easily change design many times meet expected plan cycle-accurate simulators must ensure operations executed proper virtual real possible timebranch prediction cache misses fetches pipeline stalls thread context switching many subtle aspects microprocessors | [
2435,
5381,
9932,
5358,
398,
7983,
10675,
8122,
3421
] | Test |
2,436 | 3 | Time_Gal:time gal time gal interactive movie video game developed published taito malone films originally released japan arcades 1985 action game uses full motion video fmv display on-screen action player must correctly choose on-screen character actions progress story pre-recorded animation game produced toei animation game set fictional future time travel possible protagonist reika travels different time periods search criminal luda time successfully tracking luda reika prevents plans alter past time gal inspired success earlier laserdisc video games notably 1983 title dragon lair also used pre-recorded animation game later ported sega cd worldwide release also laseractive japan home console versions received mixed reception time gal fmv-based game uses pre-recorded animation rather sprites display on-screen action gameplay divided levels referred time periods game begins 4001 ad theft time travel device thief luda steals device take world changing history reika protagonist also known time gal uses time travel device pursue travels different time periods 70,000,000 bc 44 bc 1588 ad 2010 ad search luda time period scenario presents series threats must avoided confronted successfully navigating sequences allows player progress another period player uses joystick button input commands though home versions use game controller directional pad game progresses visual cues—highlighted portions background foreground—will appear screen help survive dangers occur throughout stage difficult settings omit visual cues depending location cue player input one four directions left right attack shoot target laser gun inputting correct command either avoid neutralize threats progress game incorrect choices result character death reika dying many times results game specific moments game involve reika stopping time moments players presented list three options seven seconds choose one save character game uses laserdisc technology stream pre-recorded animation produced japanese studio toei animation game features raster graphics crt monitor amplified monaural sound reika physical appearance possibly derived either lum urusei yatsura yuri dirty pair several factors prevented overseas release decline popularity laserdisc arcade games mid-80s expensive price laserdisc technology difficulty translate original japanese release reika voiced yuriko yamamoto since original release arcades japan 1985 time gal ported different home formats first released exclusively japan nippon victor video high density format could played microsoft msx via sony laserdisc player release sega cd console 1991 spawned numerous games took advantage cd technology introduce interactive fmvs among new titles time gal one several older laserdisc-based games ported system renovation products acquired rights publish time gal sega cd wolf team handling development released along similar games part action-reaction series first released japan november 1992 north america europe next year macintosh version also released japan 1994 american press coverage japanese release prompted video game enthusiasts contact renovations western release number requests persuaded renovation president hide irie announce release usa addition dubbed english death scenes us version censored sega cd version uses smaller color palette original includes video gallery requires passwords view level animation sequences features new opening ending theme shinji tamura motoi sakuraba respectively time gal ported playstation 1996 compilation ninja hayate another laserdisc arcade game developed taito release lacks sega cd version additional content features accurate reproduction animation compilation also released sega saturn following year game also played pioneer laseractive via sega mega-ld module laseractive version rarest home release time gal well one expensive system among collectors april 1 2017 taito classics announced would release several older games onto mobile devices time gal first release game later released japan april 5 2017 ability use game navigational function ability see game original concept art acquired in-app purchases gamepro magazine noted japanese players ate first released japanese arcades however gamesetwatch todd ciolek believed released late life laserdisc games players getting tired genre gameplay commented despite gameplay unique charming gamepro reviewer referred arcade game lost laserdisc treasure enthusiastic sega cd release called death sequences hilarious felt reduced tediousness dying mega magazine rated sega cd version number five cd game commenting though lacked difficulty good showcase system prior sega cd release electronic gaming monthly praised use cd technology felt would followed titles similar gameplay critics praised time gal visuals gamefan magazine praising wolfteam port game complimented sega cd version graphics short load times gamepro said animation great bright vivid colors fast-paced exciting movement praised funny gameplay nonstop action chris bieniek videogames computer entertainment criticized story nonsensical said unlockable video gallery nice feature effectively eliminates replay value compounds easiness game give low longevity nonetheless recommended time gal based chiefly gameplay though never really feel like 're control time gal movements zany action undeniable appeal takes lot slack shawn sackenheim allgame complimented animation calling high quality criticized sega cd graphics calling downgraded commented though time gal offered good thrill lacked replay value ciolek echoed similar statements saying enjoyable watch play commented game frustrating rigid compared contemporary standards electronic gaming monthly group reviewers praised sega cd version graphics quality three four reviewers lauded gameplay specifically challenge format reviewer stated n't care type game referring gameplay nothing memorizing author masaru takeuchi attributes origin quick time event game mechanic laserdisc games like dragon lair time gal ign levi buchanan listed fmv games like time gal one reasons behind sega cd commercial failure citing waste system capabilities ciolek referred protagonist one first human heroines industry added reika appealing lead character taito could easily turned mascot featured games media character later included alfa system shooting game castle shikigami iii —taito published arcade version japan game reika features similar attacks personality character visual design updated reika recent appearance elevator action remake elevator action deluxe one free taito dlcs | [
9006,
1921,
4894,
2743
] | Validation |
2,437 | 4 | XRY_(software):xry software xry digital forensics mobile device forensics product swedish company micro systemation used analyze recover information mobile devices mobile phones smartphones gps navigation tools tablet computers consists hardware device connect phones pc software extract data xry designed recover contents device forensic manner contents data relied upon user typically used civil/criminal investigations intelligence operations data compliance electronic discovery cases software available law enforcement military intelligence agencies become well known digital forensics community one common tools type work many complex challenges examining mobile phones comparison forensic examination normal computers many mobile phones proprietary operating systems makes reverse engineering devices complex operation speed mobile device market also means many new devices manufactured regular basis mobile forensics tool must deal issues suitable task xry system allows logical examinations direct communication device operating system also physical examinations bypassing operating system dumping available memory whilst logical recovery data generally better supported devices physical examination offers ability recover deleted information sms text messages images call records etc complexities topic specialist training usually recommended operate software latest versions include support recover data smartphone apps android iphone blackberry devices data recovered xry used successfully various court systems around world xry tested number different government organizations suitable needs worldwide use | [
5010,
4500,
8469,
3099,
7968,
6177,
5284,
11182,
10290,
4789,
8635,
830,
2494,
7369,
6475,
10189,
4049,
5475,
7525,
9319,
2678,
7160,
11642
] | Test |
2,438 | 9 | The_Art_of_the_Metaobject_Protocol:art metaobject protocol art metaobject protocol amop 1991 book gregor kiczales jim des rivieres daniel g. bobrow three working xerox parc subject metaobject protocol book contains explanation metaobject protocol desirable de facto standard metaobject protocol supported many common lisp implementations extension common lisp object system clos complete portable implementation clos metaobject protocol defined book provided xerox parc portable common loops book presents simplified clos implementation common lisp called closette sake pedagogical brevity include complex exotic clos features forward-referencing superclasses full class method redefinitions advanced user-defined method combinations complete integration clos classes common lisp type system also lacks support compilation error checking since purpose closette actual use simply demonstrate fundamental power expressive flexibility metaobject protocols application principles metacircular evaluator 1997 talk oopsla alan kay called best book anybody written ten years contended contained profound insights practical insights oop dismayed written highly lisp-centric clos-specific fashion calling hard book people read n't know lisp culture hard read | [
4865,
9865,
2062,
9877,
4122,
1448,
9128,
4779,
5420,
8883,
6201,
6969,
7867,
8258,
8771,
4550,
11083,
8908,
1613,
5585,
9299,
1365,
2392,
7896,
6493,
7267,
6502,
3176,
2667,
9969,
2556,
4606,
511
] | Test |
2,439 | 2 | Clock_(software):clock software clock mobile app included iphone since iphone os 1 ipad since ios 6 app world clock alarms stopwatch timer tabs ios 10 bedtime tab added world clock section allows user access temperature time pressure major cities choice user add new cities tapping plus icon top screen typing name city user wants add user also remove cities swiping left clicking delete button alarms section allows user view alarms week view create new alarms turn existing alarms stopwatch section allows user ability time events see long take app also allows user pause reset use stopwatch lap feature timer section allows user set timer count specific time timer reaches zero alarm sounded ios 10 later versions bedtime feature allows user get better sleep done determining user would like wake many days alarm go many hours sleep user would like whether user would want bedtime notification feature also integrates health application track sleep data since ios 7 app icon shows user current time since ios 10 interface dark theme new stopwatch face accessed swiping left | [
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,
... | Test |
2,440 | 0 | Natural-language_generation:natural-language generation natural-language generation nlg software process transforms structured data natural language used produce long form content organizations automate custom reports well produce custom content web mobile application also used generate short blurbs text interactive conversations chatbot might even read loud text-to-speech system automated nlg compared process humans use turn ideas writing speech psycholinguists prefer term language production process also described mathematical terms modeled computer psychological research nlg systems also compared translators artificial computer languages decompilers transpilers also produce human-readable code generated intermediate representation human languages tend considerably complex allow much ambiguity variety expression programming languages makes nlg challenging nlg may viewed opposite natural-language understanding whereas natural-language understanding system needs disambiguate input sentence produce machine representation language nlg system needs make decisions put concept words practical considerations building nlu vs. nlg systems symmetrical nlu needs deal ambiguous erroneous user input whereas ideas system wants express nlg generally known precisely nlg needs choose specific self-consistent textual representation many potential representations whereas nlu generally tries produce single normalized representation idea expressed nlg existed long time commercial nlg technology recently become widely available nlg techniques range simple template-based systems like mail merge generates form letters systems complex understanding human grammar nlg also accomplished training statistical model using machine learning typically large corpus human-written texts pollen forecast scotland system simple example simple nlg system could essentially template system takes input six numbers give predicted pollen levels different parts scotland numbers system generates short textual summary pollen levels output example using historical data july 1 2005 software produces grass pollen levels friday increased moderate high levels yesterday values around 6 7 across parts country however northern areas pollen levels moderate values 4 contrast actual forecast written human meteorologist data pollen counts expected remain high level 6 scotland even level 7 south east relief northern isles far northeast mainland scotland medium levels pollen count comparing two illustrates choices nlg systems must make discussed process generate text simple keeping list canned text copied pasted possibly linked glue text results may satisfactory simple domains horoscope machines generators personalised business letters however sophisticated nlg system needs include stages planning merging information enable generation text looks natural become repetitive typical stages natural-language generation proposed dale reiter content determination deciding information mention text instance pollen example deciding whether explicitly mention pollen level 7 south east document structuring overall organisation information convey example deciding describe areas high pollen levels first instead areas low pollen levels aggregation merging similar sentences improve readability naturalness instance merging two following sentences following single sentence lexical choice putting words concepts example deciding whether medium moderate used describing pollen level 4 referring expression generation creating referring expressions identify objects regions example deciding use northern isles far northeast mainland scotland refer certain region scotland task also includes making decisions pronouns types anaphora realization creating actual text correct according rules syntax morphology orthography example using future tense alternative approach nlg use end-to-end machine learning build system without separate stages words build nlg system training machine learning algorithm often lstm large data set input data corresponding human-written output texts end-to-end approach perhaps successful image captioning automatically generating textual caption image popular media paid attention nlg systems generate jokes see computational humor commercial perspective successful nlg applications data-to-text systems generate textual summaries databases data sets systems usually perform data analysis well text generation research shown textual summaries effective graphs visuals decision support computer-generated texts superior reader perspective human-written texts first commercial data-to-text systems produced weather forecasts weather data earliest system deployed fog used environment canada generate weather forecasts french english early 1990s success fog triggered work research commercial recent applications include uk met office text-enhanced forecast currently considerable commercial interest using nlg summarise financial business data indeed gartner said nlg become standard feature 90 modern bi analytics platforms nlg also used commercially automated journalism chatbots generating product descriptions e-commerce sites summarising medical records enhancing accessibility example describing graphs data sets blind people example interactive use nlg wysiwym framework stands see meant allows users see manipulate continuously rendered view nlg output underlying formal language document nlg input thereby editing formal language without learning content generation systems assist human writers makes writing process efficient effective content generation tool based web mining using search engines apis built tool imitates cut-and-paste writing scenario writer forms content various search results relevance verification essential filter irrelevant search results based matching parse tree query parse trees candidate answers alternative approach high-level structure human-authored text used automatically build template new topic automatically written wikipedia article several companies started since 2009 build systems transform data narrative using nlg ai techniques include narrative science phrasetech arria nlg automated insights retresco visual nlg yseop united robots scientific fields nlg researchers need test well systems modules algorithms work called evaluation three basic techniques evaluating nlg systems ultimate goal useful nlg systems helping people first techniques however task-based evaluations time-consuming expensive difficult carry especially require subjects specialised expertise doctors hence areas nlp task-based evaluations exception norm recently researchers assessing well human-ratings metrics correlate predict task-based evaluations work conducted context generation challenges shared-task events initial results suggest human ratings much better metrics regard words human ratings usually predict task-effectiveness least degree although exceptions ratings produced metrics often predict task-effectiveness well results preliminary case human ratings popular evaluation technique nlg contrast machine translation metrics widely used | [
5122,
5508,
1287,
2440,
10634,
2059,
6798,
11538,
1044,
5399,
538,
2715,
3748,
7462,
6695,
7599,
4531,
4662,
3127,
2488,
9017,
9656,
10557,
6208,
3533,
5197,
3663,
6223,
10703,
11516,
8538,
10591,
8800,
5857,
1890,
10847,
7780,
5350,
4072,
... | Test |
2,441 | 2 | Accelerator_(software):accelerator software accelerator collection development solutions ibm windows platforms using .net framework and/or lansa technologies provided surround technologies accelerator development architecture tool building windows web apps within structured framework intent accelerator solutions provide rapid application development rad environment produces well-designed n-tier code run client/server web mobile deployment use microsoft ’ .net framework recommended surround zero-lock development optimal deployment flexibility including windows presentation foundation wpf responsive web mobile design asp.net mvc bootstrap clients accelerator uses customizable templates standards naming conventions generate code generated code human readable standardized minimize testing debugging customization future maintenance efforts generated code follows object-oriented programming design principles inversion control ioc pattern observer pattern model–view–viewmodel mvvm oo techniques avoid redundancy promote ease testing maintenance supports asp.net mvc3 framework patterns followed architecture adapted depending case flexibility promoted typical use abstraction patterns practical abstraction promoted though use windows presentation foundation windows communication foundation accelerator core system architecture provides base set functionality wizard-driven code generation implementation accelerator architecture supports service-oriented architecture includes built-in features like business objects frameworks bus interfaces plug-ins xml dashboards wizards simplify deployment accelerator business objects services implements framework consists server-side business objects presentation data service buses service adapters service-oriented architecture integrates adapters xml soap rest activex .net xaml/wpf etc soa bos functions ibm windows lansa – virtually server | [
1348,
4042,
4107,
10026,
3573,
10486,
479
] | Test |
2,442 | 9 | Renjin:renjin renjin implementation r programming language atop java virtual machine free software released gpl renjin tightly integrated java allow embedding interpreter java application full two-way access java r code renjin development primarily supported bedatadriven ultimately made possible several current past contributors including mehmet hakan satman hannes mühleisen ruslan shevchenko renjin roots lie abortive 2010 attempt compile gnu r interpreter jvm via nestedvm toolchain involves cross-compiling c fortran code static mips binary nestedvm translate jvm bytecode proved challenging gnu r grown rely heavily dynamic linking best c standard library implementation available time mips architecture newlib fully compatible gnu c library gnu r developed experience r4jvm project provided bedatadriven team depth look gnu r codebase convinced new implementation written java feasible undertaking development renjin began october 2010 rapidly resulted functional minimal interpreter r language | [
5833,
5612,
5677,
7983
] | Test |
2,443 | 4 | Windows_Live_OneCare_Safety_Scanner:windows live onecare safety scanner windows live onecare safety scanner formerly windows live safety center codenamed vegas online scanning pc cleanup diagnosis service help remove viruses spyware/adware malware free web service part windows live november 18 2008 microsoft announced discontinuation windows live onecare offering users new free anti-malware suite microsoft security essentials available since second half 2009 however windows live onecare safety scanner branding windows live onecare discontinued time service officially discontinued april 15 2011 replaced microsoft safety scanner windows live onecare safety scanner offered free online scanning protection threats windows live onecare safety scanner must downloaded installed computer scan computer full service scan looks common pc health issues viruses temporary files open network ports searches removes viruses improves computer performance removes unnecessary clutter pc hard disk user choose full scan customized quick scan full scan scans viruses comprehensive scan quick scan hard disk performance disk fragmentation scan and/or desk cleanup scan network safety open port scan quick scan scans viruses specific areas computer quick scan faster full scan hence appellation service also provides virus database information online threats general computer security documentation tools virus scanner windows live onecare safety scanner site runs scan user computer site visited run periodic scans system provide features prevent viruses infecting computer time thereafter simply resolves detected infections many users posted product feedback forum report script errors relating internet explorer 7 besides ie browser supported service onecare safety scanner team actively solving problems many registry-related | [
2309,
1417,
10392,
537,
3482,
5799,
5673,
7983,
7473,
2046,
5057,
10828,
8281,
5082,
7515,
9695,
4704,
3935,
4074,
10986,
877,
11248,
254
] | Validation |
2,444 | 3 | Young_Sherlock:_The_Legacy_of_Doyle:young sherlock legacy doyle young sherlock legacy doyle also referred young sherlock doyle isan japan-exclusive game msx developed pack-in-video released 1987 game based 1985 movie young sherlock holmes however plot completely different movie | [
9006
] | None |
2,445 | 2 | Smartisan_OS:smartisan os smartisan os android-based smartphone platform developed chinese company smartisan custom rom smartphones potentially tablet devices first smartphone utilize smartisan os smartisan t1 ceo smartisan co. ltd. luo yonghao said sina weibo smartisan portmanteau smart artisan smartisan os unveiled march 27 2013 china national convention center compete miui xiaomi flyme os meizu chinese cellphone market first public beta available june 15 2013 initially compatible samsung galaxy iii plus devices followed smartisan hardware following year third-party devices supported may 2014 smartisan co. introduced first smartphone smartisan t1 year later august 26 2015 smartisan u1 announced smartisan os 2.0 taking likes oneplus 2 meizu m2 note may 2018 smartisan co. announced smartphone model r1 comes equipped smartisan os | [
1083
] | None |
2,446 | 4 | Vulnerability_database:vulnerability database vulnerability database platform aimed collecting maintaining disseminating information discovered computer security vulnerabilities database customarily describe identified vulnerability assess potential impact affected systems workarounds updates mitigate issue hacker surmount system information assurance three elements must apply susceptibility within system access susceptibility ability exploit susceptibility major vulnerability databases iss x-force database symantec securityfocus bid database open source vulnerability database osvdb osvdb shut april 2016 paid service vulndb took place aggregate broad range publicly disclosed vulnerabilities including common vulnerabilities exposures cve primary purpose cve run mitre attempt aggregate public vulnerabilities give standardized format unique identifier many vulnerability databases develop received intelligence cve investigate providing vulnerability risk scores impact ratings requisite workaround past cve paramount linking vulnerability databases critical patches debugs shared inhibit hackers accessing sensitive information private systems national vulnerability database nvd run national institute standards technology nist operated separately mitre-run cve database includes vulnerability information cve nvd serves enhancement data providing common vulnerability scoring system cvss risk scoring common platform enumeration cpe data open source vulnerability database provides accurate technical unbiased index vulnerability security comprehensive database cataloged 121,000 vulnerabilities spanning 113-year period osvdb founded august 2002 launched march 2004 primitive beginning newly identified vulnerabilities investigated site members explanations detailed website however necessity service thrived need dedicated staff resulted inception open security foundation osf founded non-profit organisation 2005 provide funding security projects primarily osvdb u.s. national vulnerability database comprehensive cyber security vulnerability database formed 2005 reports cve nvd primary cyber security referral tool individuals industries alike providing informative resources current vulnerabilities nvd holds excess 50,000 records publishes 13 new entries daily average similar osvdb nvd publishes impact ratings categorises material index provide users intelligible search system variety commercial companies also maintain vulnerability databases offering customers services deliver new updated vulnerability data machine-readable format well web portals examples include symantec deepsight portal vulnerability datafeed secunia purchased flexera vulnerability manager accenture vulnerability intelligence service formerly idefense vulnerability databases advise organisations develop prioritize execute patches mitigations endeavour rectify critical vulnerabilities however often lead creation additional susceptibilities patches created hastily thwart system exploitations violations depending upon level user organisation warrant appropriate access vulnerability database provides user disclosure known vulnerabilities may affect justification limiting access individuals impede hackers versed corporation system vulnerabilities could potentially exploited vulnerability databases contain vast array identified vulnerabilities however organisations possess expertise staff time revise remedy potential system susceptibilities hence vulnerability scoring method quantitatively determining severity system violation multitude scoring methods exist across vulnerability databases us-cert sans institute critical vulnerability analysis scale common vulnerability scoring system cvss prevailing technique vulnerability databases including osvdb vfeed nvd cvss based upon three primary metrics base temporal environmental provide vulnerability rating metric covers immutable properties vulnerability potential impact exposure confidential information accessibility information aftermath irretrievable deletion information temporal metrics denote mutable nature vulnerability example credibility exploitability current state system violation development workarounds could applied aspect cvss rates potential loss individuals organisations vulnerability furthermore details primary target vulnerability ranging personal systems large organisations number potentially affected individuals complication utilising different scoring systems consensus severity vulnerability thus different organisations may overlook critical system exploitations key benefit standardised scoring system like cvss published vulnerability scores assessed pursued remedied rapidly organisations individuals alike determine personal impact vulnerability system benefits derived vulnerability databases consumers organisations exponential information systems become increasingly embedded dependency reliance grows opportunity data exploitation although functionality database may appear unblemished without rigorous testing exiguous flaws allow hackers infiltrate system cyber security frequently databases published without stringent security controls hence sensitive material easily accessible database attacks recurrent form cyber security breaches recorded vulnerability databases sql nosql injections penetrate traditional information systems big data platforms respectively interpolate malicious statements allowing hackers unregulated system access established databases ordinarily fail implement crucial patches suggested vulnerability databases due excessive workload necessity exhaustive trialling ensure patches update defective system vulnerability database operators concentrate efforts major system deficiencies offers hackers unmitigated system access neglected patches databases require audit tracks record data amended accessed systems created without necessary auditing system exploitation system vulnerabilities challenging identify resolve vulnerability databases promulgate significance audit tracking deterrent cyber attacks data protection essential business personal financial information key asset purloining sensitive material discredit reputation firm implementation data protection strategies imperative guard confidential information hold view initial apathy software designers turn necessitates existence vulnerability databases systems devised greater diligence may impenetrable sql nosql injections making vulnerability databases redundant | [
2369,
2430,
5636,
8548,
4626,
8050,
8563,
2709,
6043,
4062,
575
] | Validation |
2,447 | 4 | ATATool:atatool atatool freeware software used display modify ata disk information microsoft windows environment software typically used manage host protected area hpa device configuration overlay dco features broadly similar hdparm linux recent versions include support dco restore freeze operations hpa security password operations simulated bad sectors atatool must run administrator privileges windows vista later requires elevated-privileges command prompt see user account control display detected hard disks display information hard disk 1 set hpa 10gb hard disk 1 volatile – lost next power cycle set hpa 10gb hard disk 1 non-volatile remove hpa 10gb hard disk 1 non-volatile set dco 5gb hard disk 1 remove dco hard disk 1 use atatool permanently change disk configuration may result permanent data loss making sectors disk inaccessible tool therefore used extreme care | [
6797,
7983,
1873,
823,
4408,
537,
2045
] | None |
2,448 | 2 | Listaller:listaller listaller free computer software installation system similar package management system aimed making simple create package installed linux distributions well providing tools api make software management linux user-friendly listaller started december 2007 freedesktop.org developer matthias klumpp experimental project explore possibility writing universal user interface manage kinds linux software matter installed therefore listaller backends manage autopackage loki mojo native distribution packages original project provided one user interface manage kinds installed software interaction native distribution package management done via abstraction layer later replaced packagekit listaller also provided cross-distribution software installation format made easier create packages run multiple distributions installer part listaller also able assist installing autopackage packages first versions written object pascal although project started experiment soon evolved competitor autopackage mojo 2011 listaller never made stable release announcement appstream lot original listaller goals would achieved author decided change listaller away full software manager software installer joined forces appstream project pascal considered ideal language collaborate projects project already spent much time developing pascal bindings third-party libraries listaller rewritten vala subset original features main goal provide seamless integration appstream packagekit therefore universal software manager part removed project focuses creating cross-distro format distribution binary linux software nov 10 2014 matthias announced limba project limba supposed listaller next version listaller intended used installing binary pre-compiled versions non-core applications word processors web browsers personal computer games rather core libraries applications operating system shells listaller intended provide support installing system libraries security reasons listaller using package format so-called ipk packages short installation package lzma-compressed signed tarballs ipk packages contain small configuration files modify setup process provide logic scripts run install time parts setup process handled listaller built-in routines make possible distributors modify setup process 3rd-party applications comply policy necessary key value listaller integration desktop environments existing package management tools distributions therefore project provides several integration components default make possible manage listaller-installed 3rd-party applications software manager supports packagekit and/or appstream time discussed run installed 3rd-party tools sandbox default programs use listaller must also relocatable meaning must installable varying directories single binary makes possible listaller install software non-root users home directory although method enabled explicitly use encouraged listaller developer tools provide tools documentation application developers make software relocatable august 2010 projects announced merge consequence merge autopackage abandoned package binary package format user interfaces install autopackage packages autopackage tools like binreloc create relocatable applications apbuild developed part listaller project reason merging autopackage listaller mainly great lack developers projects decided join forces kde provides support listaller apper although distributors need explicitly enable using compile-time switch support gnome currently developed part gnome-packagekit suite theory distribution run packagekit 0.8.6 able provide listaller support ubuntu announced use listaller 3rd-party installer ubuntu phone develop ubuntu-specific solution instead | [
11525,
2310,
10760,
2955,
7435,
7181,
7947,
1813,
6680,
8476,
5670,
4775,
7847,
6828,
6446,
7983,
1842,
823,
2872,
6583,
3131,
10172,
3649,
10817,
9671,
5067,
6227,
4951,
2010,
9564,
7140,
5096,
4972,
9324,
7920,
6257,
1138,
1522,
2804,
1... | Test |
2,449 | 2 | Nokia_E50:nokia e50 nokia e50 business device bar-style monoblock quad-band smartphone nokia announced 18 may 2006 part eseries intended primarily corporate business market includes sophisticated e-mail support nokia ’ intellisync wireless email blackberry connect visto mobile activesync mail exchange altexia well imap4 also ability view microsoft word powerpoint excel attachments pdf documents used editing without additional apps application manager downloads removes installs nokia third-party applications device device synchronization possible data transfer application features include edge bluetooth 2.0 1,280 × 960 pixels 1.3-megapixel camera microsd memory-card slot digital music video player functionality realplayer flash player unit support umts wi-fi fm radio uses third edition series 60 user-interface s60v3 symbian operating system version 9.1 binary compatible software compiled earlier versions symbian operating system check firmware v 07.36.0.0 | [
1537,
8577,
3205,
11655,
4365,
9359,
1424,
529,
10770,
8083,
5143,
2072,
7063,
5274,
5019,
5659,
669,
8472,
11545,
2208,
4003,
4132,
6310,
167,
40,
3626,
5290,
10410,
10802,
7220,
821,
5175,
7866,
1083,
1728,
7617,
4291,
7877,
10053,
199,... | Test |
2,450 | 4 | SciEngines_GmbH:sciengines gmbh sciengines gmbh privately owned company founded 2007 spin-off copacobana project universities bochum kiel germany project intended create platform affordable custom hardware attack copacobana massively-parallel reconfigurable computer utilized perform so-called brute force attack recover des encrypted data consists 120 commercially available reconfigurable integrated circuits fpgas xilinx spartan3-1000 run parallel create massively parallel system since 2007 sciengines gmbh enhanced developed successors copacobana furthermore copacobana become well known reference platform cryptanalysis custom hardware based attacks symmetric asymmetric cyphers stream ciphers 2008 attacks a5/1 stream cipher encryption system used encrypt voice streams gsm published first known real world attack utilizing off-the-shelf custom hardware introduced 2008 rivyera s3-5000 enhancing performance computer dramatically via using 128 spartan-3 5000 currently sciengines rivyera holds record brute-force breaking des utilizing 128 spartan-3 5000 fpgas current systems provide unique density 256 spartan-6 fpgas per single system enabling scientific utilization beyond field cryptanalysis like bioinformatics providing standard off-the-shelf intel cpu mainboard integrated fpga computer rivyera systems allow execute standard code without modifications sciengines aims programmers focus porting time consuming 5 code fpga therefore bundle eclipse like development environment allows code implementation hardware based implementation languages e.g vhdl verilog well c based languages application programming interface c c++ java fortran allow scientists programmers adopt code benefit application-specific hardware architecture | [
4036,
5677,
3762,
11125,
3960,
2045
] | Test |
2,451 | 4 | Nuix:nuix nuix pty ltd australian technology company produces software platform indexing searching analyzing extracting knowledge unstructured data applications include digital investigation cybersecurity e-discovery information governance email migration privacy january 2017 software platform reportedly used least 1800 customers 65 countries company headquarters sydney australia offices conshohocken herndon san francisco new york united states cork ireland london united kingdom nuix founded 2000 goal make vast quantities unstructured data easily searchable 2006 company grew two developers 400 employees 2010 nuix awarded five-year contract securities exchange commission 2014 company appointed industry partner international multilateral partnership cyber threats 2017 nuix board directors appointed rod vawdrey position chief executive officer nuix markets ediscovery digital investigation security intelligence information governance solutions based nuix engine nuix engine combines load balancing fault tolerance processing technologies provide insights large volumes unstructured semi-structured structured data several features nuix engine granted patent 2011 november 2016 nuix announced new analysis platform called nuix insight analytics intelligence endpoint security product nuix insight adaptive security integrates cybersecurity threat prevention detection response remediation deception nuix donated software licences training international consortium investigative journalists icij used nuix investigate offshore leaks data süddeutsche zeitung icij also used analyze panama papers using nuix software panama papers investigation team made 2.6 terabytes scanned documents text-searchable extracted metadata helped journalists cross-reference people places business entities across documents october 2015 nuix reported raised 250,000 room read philanthropic product proof finder nuix largest shareholder macquarie group shareholding approximately 70 | [
2818,
10867,
11476
] | Validation |
2,452 | 3 | Advanced_Computing_Environment:advanced computing environment advanced computing environment ace defined industry consortium early 1990s next generation commodity computing platform successor personal computers based intel 32-bit instruction set architecture effort found little support market dissolved due lack sales infighting within group consortium announced 9th april 1991 compaq microsoft mips computer systems digital equipment corporation santa cruz operation time widely believed risc-based systems would maintain price/performance advantage ad hoc wintel systems however also widely believed windows nt would quickly displace many operating systems combined effects wide selection software ease building wintel machines supported ace formed provide alternative platform wintel providing viable alternative advantages terms software support greater advantages terms performance environment standardized mips architecture two operating systems sco unix open desktop would become windows nt originally named os/2 3.0 advanced risc computing arc document produced give hardware firmware specifications platform members consortium included acer control data corporation kubota nec corporation nkk olivetti prime computer pyramid technology siemens silicon graphics sony sumitomo tandem computers wang laboratories zenith data systems besides large companies several start-up companies built ace-compliant systems well companies involved reasons joining ace effort initiative used microprocessor companies attempt take market share away intel system companies used initiative attempt take market share away workstation leader sun microsystems soon initiative announced dissenting faction seven ace members declared decision support little-endian architectures short-sighted subgroup known apache group promoted big-endian alternative group whose name conceived pun big indian unrelated later apache software foundation later adopted name mips/open rift within ace consortium averted decided add support big-endian svr4 even ace initiative consortium began fall apart little year started became apparent mass market alternative wintel computing platform upstart platforms offer enough performance improvement incumbent pc major cost disadvantages systems due low volume production initiative started risc based systems running 100-200 mhz time substantial performance advantage intel 80486 original pentium chips running approximately 60 mhz time intel quickly migrated pentium design newer semiconductor process generations performance operating frequency advantage slipped away compaq first company leave consortium stating departure ceo rod canion one primary backers behind formation ace shifting priorities away higher-end systems followed short order sco announcing suspending work moving version unix mips platform potential conflicts earlier year mips purchased sgi may also contributed concerns neutrality target platform dec released alpha processor less interested promoting competing architecture finally significant improvements intel x86 performance made abandoning less attractive although ace supported x86 time intel never member main product ace group advanced risc computing specification arc initially based mips-based computer hardware firmware environment although ace went defunct computer ever manufactured fully complied arc standard arc system still exerts widespread legacy microsoft windows nt-based operating systems windows xp used arc conventions naming boot devices windows vista sgi used modified version arc firmware calls arcs systems sgi computers run irix 6.1 later indy octane etc boot arcs console uses drive naming conventions windows accordingly addition various risc-based computers designed run windows nt used versions arc boot console boot nt among computers also predicted intel ia-32-based computers would adopt arc console although sgi ever marketed ia-32-based machines arc firmware namely sgi visual workstation series went sale 1999 products complying degree arc standard include | [
4228,
5380,
9742,
7311,
8976,
2071,
408,
9723,
6942,
426,
7215,
7983,
11058,
7093,
2811,
9665,
7234,
10051,
1606,
3142,
6854,
5076,
6879,
3945,
3818,
6252,
5873,
499,
3323,
8700
] | Test |
2,453 | 1 | IFIS_Publishing:ifis publishing ifis academic publishing company not-for-profit organisation operating sciences regulations food health based reading ifis produces online bibliographic databases fsta resource company offered since 1969 along escalex launched 2017 fsta food science technology abstracts includes 1.4 million scientific non-predatory records trusted sources related disciplines surrounding food beverages ifis also produces association wiley blackwell dictionary food science technology second edition not-for-profit charitable organisation ifis offers access researchers developing countries research4life programmes hinari agora escalex created collaboration molecular connections launched april 2017 allows search retrieval food beverage food law information various geographies across globe originally known international food information service ifis established 1968 collaboration four organisations company originally based lane end house shinfield though recently moved granary bridge farm arborfield fsta bibliographic abstracting indexing database scientific technological information relating food beverages nutrition contains 1.3 million indexed records full-text links available covering 5,475 active historical journals books trade publications reviews conference proceedings reports patents standards database updated weekly records indexed ifis thesaurus containing 12,346 food science keywords curated structured hierarchies resource used researchers industry practitioners students contains information sources 29 languages sourced publishers 60 countries coverage includes major commodities food beverage industry related applied pure sciences pet foods food psychology food economics food safety fsta accessed ebscohost ovid proquest dialog stn web science | [] | Validation |
2,454 | 2 | Music_Kit:music kit music kit software package next computer system first developed david a. jaffe julius o. smith supported motorola 56001 dsp included next computer motherboard also first architecture unify music-n midi paradigms thus combined generality former interactivity performance capabilities latter music kit integrated sound kit first demonstrated 1988 davies symphony hall 1.0 release shipped 1989 next computer included objective-c library creating music sound applications score language included expression evaluation midi sound dsp drivers several command-line utilities simple score-playing application called scoreplayer music kit integrated variety music applications including finale creation station also used video games even document processors 2.0 release next computer included additional bundled applications including ensemble fractal-based improvisation tool developed michael mcnabb others involved next music kit project included douglas fulton documentation demos doug keislar third-party support greg kellogg drivers lee boynton drivers sound kit dana massie development addition consultants brought early included andy moorer dsp software architecture roger dannenberg data structures john strawn dsp software 1992 next 3.0 release music kit un-bundled next software released copyrighted open source package stanford center computer research music acoustics ccrma julius o. smith professor stanford university hired david a. jaffe consultant continue develop music kit among additions time support airel quintprocessor five-dsp board nextcube support audio directly via dsp56001 serial port brought back next cube support nextstep use dsp processing using turtle beach dsp56001 card set eight motorola evaluation boards combined chassis prototype frankenstein platform used sondius program stanford office technology licensing develop physical models musical instruments addition jaffe hired third party add midi time code support music kit sondius group later spun independent company staccato systems inc. funding yamaha stanford university staccato systems inc. acquired analog devices 2000 recent ports music kit done leigh smith stephen brandon | [
8761,
7820,
7806,
10470
] | None |
2,455 | 3 | Socket_479:socket 479 socket 479 mpga479m cpu socket intel pentium celeron mobile processors normally used laptops also used tualatin-m pentium iii processors official naming intel µfcpga µpga479m exist multiple electrically incompatible mechanically compatible processor families available pga packages using socket variants thereof even intel cpu specifications seem clear enough distinction instead use package/socket designations pga478 ppga478 1 sockets perhaps adding yet confusion pga-based cpus also available bga precisely µbga even µfcbga package 479 contacts balls populated cpu variants intel cpu specifications use designations bga479 pbga479 h-pbga479 however pointed designations denote rather cpu package socket bga variants use intended directly soldered mainboard e.g embedded system non-bga counterparts cpus use one mentioned sockets socket 479 socket 479 479 pin holes pentium processors pga package 479 pins plug zero insertion force socket 478 pins electrically connected b2 reserved depopulated micro-fcpga package although electrically mechanically similar socket 478 one pin less making impossible use pentium processor 478 board reason manufacturers like asus made drop-in boards e.g ct-479 allow use socket 479 processors chipsets employ socket pentium intel 855gm/gme/pm intel 915gm/gms/pm intel 855gme chipset supports pentium cpu intel 855gm chipset officially support 90 nm 2mb l2 cache dothan core models even though works works 400fsb 3rd party/user able overclock fsb 855gm/gme/pm support 533fsb dothan core difference 855gm chipset graphics core runs 200 mhz 855gme runs 250 mhz 2006 intel released successor socket 479 revised pinout core processor called socket m. socket placement one pin changed pentium version socket 479 socket processors physically fit socket 479 electrically incompatible versions socket479 except using ati north bridge rc415md socket supports 667 mt/s fsb intel 945pm/945gm chipsets | [
3588,
5901,
5523,
8855,
3992,
11417,
3995,
4252,
6175,
7714,
10019,
4523,
2604,
2350,
6192,
9649,
4537,
7105,
4805,
7110,
8394,
3403,
4427,
4179,
3798,
4185,
7002,
9945,
11484,
2525,
9570,
10468,
613,
8552,
1260,
4717,
10225,
371,
3317,
9... | Test |
2,456 | 1 | Database_index:database index database index data structure improves speed data retrieval operations database table cost additional writes storage space maintain index data structure indexes used quickly locate data without search every row database table every time database table accessed indexes created using one columns database table providing basis rapid random lookups efficient access ordered records index copy selected columns data table searched efficiently also includes low-level disk block address direct link complete row data copied databases extend power indexing letting developers create indexes functions expressions example index could created upper last_name would store upper-case versions codice_1 field index another option sometimes supported use partial indices index entries created records satisfy conditional expression aspect flexibility permit indexing user-defined functions well expressions formed assortment built-in functions database software includes indexing technology enables sub-linear time lookup improve performance linear search inefficient large databases suppose database contains n data items one must retrieved based value one fields simple implementation retrieves examines item according test one matching item stop finds single item multiple matches must test everything means number operations worst case n linear time since databases may contain many objects since lookup common operation often desirable improve performance index data structure improves performance lookup many different used purpose complex design trade-offs involving lookup performance index size index-update performance many index designs exhibit logarithmic log n lookup performance applications possible achieve flat 1 performance indexes used police database constraints unique exclusion primary key foreign key index may declared unique creates implicit constraint underlying table database systems usually implicitly create index set columns declared primary key capable using already-existing index police constraint many database systems require referencing referenced sets columns foreign key constraint indexed thus improving performance inserts updates deletes tables participating constraint database systems support exclusion constraint ensures newly inserted updated record certain predicate holds record used implement unique constraint equality predicate complex constraints like ensuring overlapping time ranges intersecting geometry objects would stored table index supporting fast searching records satisfying predicate required police constraint data present arbitrary order logical ordering specified index data rows may spread throughout table regardless value indexed column expression non-clustered index tree contains index keys sorted order leaf level index containing pointer record page row number data page page-organized engines row offset file-organized engines non-clustered index one non-clustered index database table clustering alters data block certain distinct order match index resulting row data stored order therefore one clustered index created given database table clustered indices greatly increase overall speed retrieval usually data accessed sequentially reverse order clustered index range items selected since physical records sort order disk next row item sequence immediately last one fewer data block reads required primary feature clustered index therefore ordering physical data rows accordance index blocks point databases separate data index blocks separate files others put two completely different data blocks within physical file multiple databases multiple tables joined referred cluster confused clustered index described records tables sharing value cluster key shall stored together nearby data blocks may improve joins tables cluster key since matching records stored together less i/o required locate cluster configuration defines data layout tables parts cluster cluster keyed b-tree index hash table data block table record stored defined value cluster key order index definition defines columns important possible retrieve set row identifiers using first indexed column however possible efficient databases retrieve set row identifiers using second greater indexed column example imagine phone book organized city first last name first name given city easily extract list phone numbers city however phone book would tedious find phone numbers given last name would look within city section entries last name databases others ’ use index phone book example composite index created columns codice_2 search giving exact values three fields search time minimal—but provide values codice_3 codice_4 search uses codice_3 field retrieve matched records sequential lookup checks matching codice_4 improve performance one must ensure index created order search columns indexes useful many applications come limitations consider following sql statement codice_7 process statement without index database software must look last_name column every row table known full table scan index database simply follows b-tree data structure smith entry found much less computationally expensive full table scan consider sql statement codice_8 query would yield email address every customer whose email address ends wikipedia.org even email_address column indexed database must perform full index scan index built assumption words go left right wildcard beginning search-term database software unable use underlying b-tree data structure words where-clause sargable problem solved addition another index created codice_9 sql query like codice_10 puts wild-card right-most part query gro.aidepikiw index reverse email_address satisfy wildcard characters used sides search word wikipedia.org index available field used rather sequential search performed takes n time bitmap index special kind indexing stores bulk data bit arrays bitmaps answers queries performing bitwise logical operations bitmaps commonly used indexes b+ trees efficient values index repeat repeat small number times contrast bitmap index designed cases values variable repeat frequently example sex field customer database usually contains three distinct values male female unknown recorded variables bitmap index significant performance advantage commonly used trees dense index databases file pairs keys pointers every record data file every key file associated particular pointer record sorted data file clustered indices duplicate keys dense index points first record key sparse index databases file pairs keys pointers every block data file every key file associated particular pointer block sorted data file clustered indices duplicate keys sparse index points lowest search key block reverse-key index reverses key value entering index e.g. value 24538 becomes 83542 index reversing key value particularly useful indexing data sequence numbers new key values monotonically increase primary index contains key fields table pointer non-key fields table primary index created automatically table created database create file must specify two things primary index 1 name primary index 2 primary index specification used index field neither ordering fields key fields assurance file organized key field primary key field one index entry every tuple data file dense index contains value indexed attribute pointer block/record indices implemented using variety data structures popular indices include balanced trees b+ trees hashes microsoft sql server leaf node clustered index corresponds actual data simply pointer data resides elsewhere case non-clustered index relation single clustered index many unclustered indices index typically accessed concurrently several transactions processes thus needs concurrency control principle indexes utilize common database concurrency control methods specialized concurrency control methods indexes exist applied conjunction common methods substantial performance gain cases index used quickly locate data record required data read words index used locate data records table return data covering index special case index contains required data field answer required data consider following table fields omitted find name id 13 index id useful record must still read get name however index id name contains required data field eliminates need look record covering indexes specific table queries join/ access across multiple tables may potentially consider covering indexes one tables covering index dramatically speed data retrieval may large due additional keys slow data insertion update reduce index size systems allow including non-key fields index non-key fields part index ordering included leaf level allowing covering index less overall index size standard defines create indexes iso sql standard cover physical aspects indexes one physical parts database conception among others like storage tablespace filegroups rdbms vendors give create index syntax specific options depend software capabilities | [
8195,
7175,
8201,
9225,
2068,
1049,
5658,
3103,
9248,
10793,
10286,
11324,
9286,
2632,
9290,
8788,
10326,
7767,
9828,
10340,
8808,
2669,
1136,
5745,
1142,
1146,
3196,
10367,
11402,
9360,
10389,
4255,
4263,
10413,
9397,
7868,
11457,
6850,
27... | Test |
2,457 | 9 | OpenBUGS:openbugs openbugs software application bayesian analysis complex statistical models using markov chain monte carlo mcmc methods openbugs open source variant winbugs bayesian inference using gibbs sampling runs microsoft windows linux well inside r statistical package versions v3.0.7 onwards designed least efficient reliable winbugs range test applications addition different licence greater range operating systems fundamental difference openbugs winbugs way expert system selects updating algorithm use class full conditional distribution node winbugs defines one algorithm possible class limit number algorithms openbugs use allowing greater flexibility extensibility user select updater used node compilation differences detailed openbugs website source code openbugs written component pascal programming language dependent component pascal libraries provided oberon microsystems part blackbox component framework development tools available open source binaries current version openbugs available microsoft windows previous version linux also run wine linux installation problems development usage questions discussed openbugs bulletin board attempts port openbugs java gardens point component pascal given favor new portable implementation called jags bugs language language specifies model code parsed openbugs creates executable compiled code generates sample posterior distribution run openbugs designed run together s-plus bugs language similar programming language openbugs works well together r r2openbugs brugs packages provides interoperability r modules help analyses | [
5380,
5129,
7945,
3980,
2317,
6797,
7950,
5399,
7580,
7326,
5677,
7983,
6962,
823,
6718,
5830,
5703,
4808,
5833,
5450,
8262,
2000,
9944,
2652,
1632,
10848,
872,
4840,
363,
5612,
2804,
5492,
7924
] | Train |
2,458 | 5 | Code-division_multiple_access:code-division multiple access code-division multiple access cdma channel access method used various radio communication technologies cdma example multiple access several transmitters send information simultaneously single communication channel allows several users share band frequencies see bandwidth permit without undue interference users cdma employs spread spectrum technology special coding scheme transmitter assigned code cdma used access method many mobile phone standards is-95 also called cdmaone 3g evolution cdma2000 often simply referred cdma umts 3g standard used gsm carriers also uses wideband cdma w-cdma well td-cdma td-scdma radio technologies technology code-division multiple access channels long known soviet union ussr first work devoted subject published 1935 dmitry ageev shown use linear methods three types signal separation frequency time compensatory technology cdma used 1957 young military radio engineer leonid kupriyanovich moscow made experimental model wearable automatic mobile phone called lk-1 base station lk-1 weight 3 kg 20–30 km operating distance 20–30 hours battery life base station described author could serve several customers 1958 kupriyanovich made new experimental pocket model mobile phone phone weighed 0.5 kg serve customers kupriyanovich proposed device called correlator 1958 ussr also started development altai national civil mobile phone service cars based soviet mrt-1327 standard phone system weighed placed trunk vehicles high-ranking officials used standard handset passenger compartment main developers altai system vniis voronezh science research institute communications gspi state specialized project institute 1963 service started moscow 1970 altai service used 30 ussr cities cdma spread-spectrum multiple-access technique spread-spectrum technique spreads bandwidth data uniformly transmitted power spreading code pseudo-random code narrow ambiguity function unlike narrow pulse codes cdma locally generated code runs much higher rate data transmitted data transmission combined bitwise xor exclusive faster code figure shows spread-spectrum signal generated data signal pulse duration formula_1 symbol period xored code signal pulse duration formula_2 chip period note bandwidth proportional formula_3 formula_4 bit time therefore bandwidth data signal formula_5 bandwidth spread spectrum signal formula_6 since formula_2 much smaller formula_1 bandwidth spread-spectrum signal much larger bandwidth original signal ratio formula_9 called spreading factor processing gain determines certain extent upper limit total number users supported simultaneously base station user cdma system uses different code modulate signal choosing codes used modulate signal important performance cdma systems best performance occurs good separation signal desired user signals users separation signals made correlating received signal locally generated code desired user signal matches desired user code correlation function high system extract signal desired user code nothing common signal correlation close zero possible thus eliminating signal referred cross-correlation code correlated signal time offset zero correlation close zero possible referred auto-correlation used reject multi-path interference analogy problem multiple access room channel people wish talk simultaneously avoid confusion people could take turns speaking time division speak different pitches frequency division speak different languages code division cdma analogous last example people speaking language understand languages perceived noise rejected similarly radio cdma group users given shared code many codes occupy channel users associated particular code communicate general cdma belongs two basic categories synchronous orthogonal codes asynchronous pseudorandom codes digital modulation method analogous used simple radio transceivers analog case low-frequency data signal time-multiplied high-frequency pure sine-wave carrier transmitted effectively frequency convolution wiener–khinchin theorem two signals resulting carrier narrow sidebands digital case sinusoidal carrier replaced walsh functions binary square waves form complete orthonormal set data signal also binary time multiplication achieved simple xor function usually gilbert cell mixer circuitry synchronous cdma exploits mathematical properties orthogonality vectors representing data strings example binary string 1011 represented vector 1 0 1 1 vectors multiplied taking dot product summing products respective components example u b v c dot product u·v ac bd dot product zero two vectors said orthogonal properties dot product aid understanding w-cdma works vectors b orthogonal formula_10 user synchronous cdma uses code orthogonal others codes modulate signal example 4 mutually orthogonal digital signals shown figure orthogonal codes cross-correlation equal zero words interfere case is-95 64-bit walsh codes used encode signal separate different users since 64 walsh codes orthogonal signals channelized 64 orthogonal signals following example demonstrates user signal encoded decoded start set vectors mutually orthogonal although mutual orthogonality condition vectors usually constructed ease decoding example columns rows walsh matrices example orthogonal functions shown adjacent picture vectors assigned individual users called code chip code chipping code interest brevity rest example uses codes v two bits user associated different code say v. 1 bit represented transmitting positive code v 0 bit represented negative code −v example v v v 1 −1 data user wishes transmit 1 0 1 1 transmitted symbols would purposes article call constructed vector transmitted vector sender different unique vector v chosen set construction method transmitted vector identical due physical properties interference two signals point phase add give twice amplitude signal phase subtract give signal difference amplitudes digitally behaviour modelled addition transmission vectors component component sender0 code 1 −1 data 1 0 1 1 sender1 code 1 1 data 0 0 1 1 senders transmit simultaneously table describes coding steps signal0 signal1 transmitted time air add produce raw signal raw signal called interference pattern receiver extracts intelligible signal known sender combining sender code interference pattern following table explains works shows signals interfere one another decoding values greater 0 interpreted 1 values less zero interpreted 0 example decoding data0 2 −2 2 2 receiver interprets 1 0 1 1 values exactly 0 means sender transmit data following example assume signal0 1 −1 −1 1 1 −1 1 −1 transmitted alone following table shows decode receiver receiver attempts decode signal using sender1 code data zeros therefore cross-correlation equal zero clear sender1 transmit data mobile-to-base links precisely coordinated particularly due mobility handsets different approach required since mathematically possible create signature sequences orthogonal arbitrarily random starting points make full use code space unique pseudo-random pseudo-noise pn sequences used asynchronous cdma systems pn code binary sequence appears random reproduced deterministic manner intended receivers pn codes used encode decode user signal asynchronous cdma manner orthogonal codes synchronous cdma shown example pn sequences statistically uncorrelated sum large number pn sequences results multiple access interference mai approximated gaussian noise process following central limit theorem statistics gold codes example pn suitable purpose low correlation codes users received power level variance e.g. noise power mai increases direct proportion number users words unlike synchronous cdma signals users appear noise signal interest interfere slightly desired signal proportion number users forms cdma use spread-spectrum process gain allow receivers partially discriminate unwanted signals signals encoded specified pn sequence code received signals different codes code different timing offset appear wideband noise reduced process gain since user generates mai controlling signal strength important issue cdma transmitters cdm synchronous cdma tdma fdma receiver theory completely reject arbitrarily strong signals using different codes time slots frequency channels due orthogonality systems true asynchronous cdma rejection unwanted signals partial unwanted signals much stronger desired signal overwhelm leads general requirement asynchronous cdma system approximately match various signal power levels seen receiver cdma cellular base station uses fast closed-loop power-control scheme tightly control mobile transmit power theory cdma tdma fdma exactly spectral efficiency practice challenges – power control case cdma timing case tdma frequency generation/filtering case fdma tdma systems must carefully synchronize transmission times users ensure received correct time slot cause interference since perfectly controlled mobile environment time slot must guard time reduces probability users interfere decreases spectral efficiency similarly fdma systems must use guard band adjacent channels due unpredictable doppler shift signal spectrum user mobility guard bands reduce probability adjacent channels interfere decrease utilization spectrum asynchronous cdma offers key advantage flexible allocation resources i.e allocation pn codes active users case cdm synchronous cdma tdma fdma number simultaneous orthogonal codes time slots frequency slots respectively fixed hence capacity terms number simultaneous users limited fixed number orthogonal codes time slots frequency bands allocated cdm tdma fdma systems remain underutilized due bursty nature telephony packetized data transmissions strict limit number users supported asynchronous cdma system practical limit governed desired bit error probability since sir signal-to-interference ratio varies inversely number users bursty traffic environment like mobile telephony advantage afforded asynchronous cdma performance bit error rate allowed fluctuate randomly average value determined number users times percentage utilization suppose 2 n users talk half time 2 n users accommodated average bit error probability n users talk time key difference bit error probability n users talking time constant whereas random quantity mean 2 n users talking half time words asynchronous cdma ideally suited mobile network large numbers transmitters generate relatively small amount traffic irregular intervals cdm synchronous cdma tdma fdma systems recover underutilized resources inherent bursty traffic due fixed number orthogonal codes time slots frequency channels assigned individual transmitters instance n time slots tdma system 2 n users talk half time half time n users needing use n time slots furthermore would require significant overhead continually allocate deallocate orthogonal-code time-slot frequency-channel resources comparison asynchronous cdma transmitters simply send something say go air n't keeping pn signature sequence long connected system modulation schemes try minimize bandwidth signal since bandwidth limited resource however spread-spectrum techniques use transmission bandwidth several orders magnitude greater minimum required signal bandwidth one initial reasons military applications including guidance communication systems systems designed using spread spectrum security resistance jamming asynchronous cdma level privacy built signal spread using pseudo-random code code makes spread-spectrum signals appear random noise-like properties receiver demodulate transmission without knowledge pseudo-random sequence used encode data cdma also resistant jamming jamming signal finite amount power available jam signal jammer either spread energy entire bandwidth signal jam part entire signal cdma also effectively reject narrow-band interference since narrow-band interference affects small portion spread-spectrum signal easily removed notch filtering without much loss information convolution encoding interleaving used assist recovering lost data cdma signals also resistant multipath fading since spread-spectrum signal occupies large bandwidth small portion undergo fading due multipath given time like narrow-band interference result small loss data overcome another reason cdma resistant multipath interference delayed versions transmitted pseudo-random codes poor correlation original pseudo-random code thus appear another user ignored receiver words long multipath channel induces least one chip delay multipath signals arrive receiver shifted time least one chip intended signal correlation properties pseudo-random codes slight delay causes multipath appear uncorrelated intended signal thus ignored cdma devices use rake receiver exploits multipath delay components improve performance system rake receiver combines information several correlators one tuned different path delay producing stronger version signal simple receiver single correlation tuned path delay strongest signal frequency reuse ability reuse radio channel frequency cell sites within cellular system fdma tdma systems frequency planning important consideration frequencies used different cells must planned carefully ensure signals different cells interfere cdma system frequency used every cell channelization done using pseudo-random codes reusing frequency every cell eliminates need frequency planning cdma system however planning different pseudo-random sequences must done ensure received signal one cell correlate signal nearby cell since adjacent cells use frequencies cdma systems ability perform soft hand-offs soft hand-offs allow mobile telephone communicate simultaneously two cells best signal quality selected hand-off complete different hard hand-offs utilized cellular systems hard-hand-off situation mobile telephone approaches hand-off signal strength may vary abruptly contrast cdma systems use soft hand-off undetectable provides reliable higher-quality signal recent study novel collaborative multi-user transmission detection scheme called collaborative cdma investigated uplink exploits differences users fading channel signatures increase user capacity well beyond spreading length mai-limited environment authors show possible achieve increase low complexity high bit error rate performance flat fading channels major research challenge overloaded cdma systems approach instead using one sequence per user conventional cdma authors group small number users share spreading sequence enable group spreading despreading operations new collaborative multi-user receiver consists two stages group multi-user detection mud stage suppress mai groups low-complexity maximum-likelihood detection stage recover jointly co-spread users data using minimal euclidean-distance measure users channel-gain coefficients note research area going 2004 prof. li ping introduced new concept enhanced cdma version known interleave division multiple access idma scheme uses orthogonal interleaved means user separation place signature sequence used cdma system many researchers introduced various orthogonal interleaving mechanisms including tree based interleaved suggested prof. manoj kumar shukla harcourt butler technical university | [
10112,
4609,
2306,
388,
8708,
3847,
9863,
2057,
1550,
11288,
5020,
4256,
5664,
1192,
11560,
7723,
11181,
1969,
2994,
1083,
448,
7490,
3140,
7108,
9284,
11591,
5321,
7498,
9038,
9296,
119,
2911,
3168,
1121,
2785,
4068,
5092,
5863,
7400,
16... | None |
2,459 | 8 | 80legs:80legs 80legs web crawling service allows users create run web crawls software service platform 80legs created computational crawling company houston tx company launched private beta 80legs april 2009 publicly launched service demofall 09 conference time public launch 80legs offered customized web crawling scraping services since added subscription plans product offerings 80legs built top distributed grid computing network grid consists approximately 50,000 individual computers distributed across world uses bandwidth monitoring technology prevent bandwidth cap overages 80legs criticised numerous site owners technology effectively acting distributed denial service attack obeying robots.txt average webmaster aware existence 80legs blocking access crawler done already late server ddosed guilty party detected time-consuming in-depth analysis logfiles rulesets modsecurity like one atomicorp block access webserver 80legs order prevent ddos webknight also blocks 80legs default distributed crawler impossible block crawler ip best way found block 80legs useragent 008 wrecksite blocks 80legs default | [
3744,
8769,
3875,
5956,
2566,
6374,
4473,
714,
2318,
944,
113,
467,
11284,
1240,
1913,
735
] | Validation |
2,460 | 3 | Theatre_Europe:theatre europe theatre europe turn-based strategy video game developed published personal software services first released united kingdom commodore 64 zx spectrum amstrad cpc atari 8-bit home computers 1985 later released france ere informatique 1986 released united states datasoft later year also ported tatung einstein home computer 1989 exclusively united kingdom fifth instalment strategic wargames series game set fictional war europe nato warsaw pact sides use nuclear chemical weapons main objective game fight conventional battles continental europe whilst trying avoid worldwide nuclear holocaust throughout game various capital cities civilian populations destroyed nuclear weapons game end either side forced surrender entire population europe perishes order request nuclear strike player required call dedicated telephone number led automated message announcing authorisation code development developers obtained extensive information statistics military strength ministry defence soviet embassy london theatre europe gained national controversy upon release receiving criticism campaign nuclear disarmament cnd sun newspaper high street retail chains refused sell game upon release despite controversy game received critical acclaim reviewers praise directed accuracy playability value money best strategy game award 1985 golden joystick awards nominated game year title game turn-based strategy revolves around fictional conflict powers nato allies warsaw pact player choice choosing either nato warsaw pact collectively referred soviet forces demo computer versus computer option game plays game takes place period 30 in-game days one day equal one round three types difficulty level one unless provoked enemy use nuclear weapons whilst levels two three enable enemy use nuclear chemical attacks prevent player winning game main feature game focused map europe western russia displays accurate terrain mountain ranges major cities borders military forces belonging side game also features arcade sequence involves shooting enemy units order secure combat bonuses gameplay mode however ignored changing game settings arcade sequences turned player notified choose battle map depending area chosen illustration battle commencing countryside city presented various forms military equipment including aeroplanes helicopters tanks player must shoot destroy enemy units using cursor similar style missile command outcome arcade sequence affect game performing poorly result severe losses throughout round combat resolved player must move assemble forces continental europe known movement phase two special units exclusively available warsaw pact 1st airborne army flown directly behind enemy lines 1st amphibious army move sea tactical attack point units moved cursor one may moved time units moved within round attack phase begin amount friendly units may attack opposing army however unit dispatched battle stopped current attack phase concludes attacking phase separate screen displaying combat information enemy numbers casualties displayed screen detailing attacking phase turned settings battle instead decided warrants air superiority armaments battle sequences player opportunity rebuild units allocating quantity armament supplies air support issued friendly unit map rebuilding ground units game move onto air phase consists commanding aircraft aeroplanes bombers limited number reserve air units several options allocating air forces include counter air strikes reconnaissance enemy movement interdiction assault breakers deep strikes counter air strikes involve attacks enemy air bases whereas interdiction involves aircraft sent behind enemy lines order attack supply movement networks interdiction aircraft discovered enemy territory chance side respond retaliatory nuclear strike remaining three aircraft options attack single unit strike enemy territory attack railways order disable enemy reinforcements respectively game allows player request chemical nuclear tactical strikes enemy chemical attack automatically targeted enemy capital city conclude readout announcing outcome attack civilian casualties order launch strategic nuclear attack player given 30 seconds call dedicated 1-800 telephone number obtain special authorisation code automated answerphone message authorisation code 'midnight sun authorisation code received player given three separate options proceed standby mode postpone nuclear launch whereas strategic launch involve one nuclear warhead targeting city third option known fire-plan issue full-scale nuclear strike across europe may result nuclear holocaust end game personal software services founded coventry west midlands gary mays richard cockayne 1981 company known creating games revolved around historic battles conflicts battle britain bismarck falklands '82 company partnership french video game developer ere informatique published localised versions products united kingdom 1986 cockayne took decision alter products release 16-bit consoles found smaller 8-bit consoles zx spectrum lacked processing power larger strategy games decision falsely interpreted pulling spectrum market video game journalist phillipa irving following years successful sales throughout mid-1980s personal software services experienced financial difficulties cockayne admitted retrospective interview took eye ball company acquired mirrorsoft february 1987 later dispossessed company due strains debt interview computer magazine richard cockayne stated theatre europe received heavy criticism campaign nuclear disarmament cnd sun newspaper respectively cnd accused developers bad taste despite cockayne claiming organisation never looked product development game cockayne mays obtained figures statistics various military strength ministry defence soviet embassy london cockayne asserted statistics developers gained realistically plausible stating would let horrifying results speak game game designer alan steel stated testing alarmed discover computer played warsaw pact always conventional war overwhelmingly forcing nato either surrender begin nuclear war steel adjusted game give nato chance win theatre europe first released united kingdom commodore 64 zx spectrum amstrad cpc atari 8-bit home computers 1985 re-released france united states consoles 1986 due lobbying cnd high street outlets boots john menzies refused sell game stores former finding morally offensive game received critical acclaim upon release gwyn hughes sinclair defended accuracy morality game stating bad taste game well researched program thought would give player insight nature modern war philippa irving crash similarly stated theatre europe offered usual run-of-the-mill war game heralded simplistic nature adding novice gamers would get ease john gilbert sinclair user added scepticism developer intention making something serious opposed titles however praised game brilliant chilling simulation reviewer writing zx computing similarly stated game superbly chilling extremely well-presented reviewer computer video games criticised inferior graphics zx spectrum stating bit flawed comparison commodore 64 version mark reed computer gamer noted game attracted media attention despite objective game discouraging use nuclear weapons reed praised presentation gameplay also stating use joystick keyboard excellent reviewer zzap 64 heralded presentation value money stating overall special indeed reviewer also gave praise sound suggesting game featured one best pieces micro music ever antic stated atari 8-bit version execution uneven magazine reported arcade portion quickly becomes nuisance nato could defeat warsaw pact lack balance flaws exist commodore 64 version peter connor advanced computer entertainment said theatre europe gift regards value money level playability 1994 survey wargames computer gaming world gave title two-plus stars five stating rendered obsolete history game play game best strategy game award 1985 golden joystick awards also nominated game year title | [
7536,
885,
9006
] | Test |
2,461 | 4 | Trustworthy_computing:trustworthy computing term trustworthy computing twc applied computing systems inherently secure available reliable particularly associated microsoft initiative name launched 2002 1995 restrictions commercial traffic internet may 26 1995 bill gates sent internet tidal wave memorandum microsoft executives assigning ... internet highest level importance ... microsoft windows 95 released without web browser microsoft yet developed one success web caught surprise mid 1995 testing web server august 24 1995 launched major online service msn national research council recognized rise internet simultaneously increased societal reliance computer systems increasing vulnerability systems failure produced important report 1999 trust cyberspace report reviews cost un-trustworthy systems identifies actions required improvement bill gates launched microsoft trustworthy computing initiative january 15 2002 memo referencing internal whitepaper microsoft cto senior vice president craig mundie move reportedly prompted fact ... fire larger customers–government agencies financial companies others–about security problems windows issues brought front center series self-replicating worms embarrassing attacks code red nimda klez four areas identified initiative ’ key areas security privacy reliability business integrity despite initial scepticism 10-year anniversary generally accepted ... made positive impact industry ... .. | [
6520,
2067,
3852,
2558
] | None |
2,462 | 3 | EComStation:ecomstation ecomstation ecs pc operating system based os/2 published serenity systems mensys bv currently owned developed xeu.com includes several additions accompanying software present ibm version system ecomstation 32-bit operating system runs exclusively x86 processor architecture real virtualized still used version 1 ecomstation released 2001 based around integrated os/2 version 4.5 client convenience package os/2 warp version 4 released ibm 2000 latter made available holders existing os/2 support contracts included following new features among others compared final retail version os/2 1996 os/2 warp version 4 ecomstation provided retail channel end users obtain updates addition beginning bundled number additional features enhancements including limited ibm began wind os/2 development serenity partners began take slack combination in-house contract community/open source development efforts terms keeping operating system usable current hardware results many efforts included version 2 ecomstation among others became clear ibm would release new retail version os/2 warp client operating system version 4 1996 users began consider alternatives ibm released final version server edition ibm os/2 warp server e-business wseb internally called version 4.5 ibm also continued updating client merged parts server proposed bob st. john serenity systems oem company could create client using existing os/2 client ibm enhancements adding improvements needed serenity ibm business partner done similar thing os/2-based vertical applications like serenity managed client rapid deployment os based workspace on-demand ecomstation server managed server based wseb os/2 software vendor stardock made proposal ibm 1999 followed company april 29 2000 serenity conjunction kim cheung touchvoice systems created discussion group purpose discussing os/2 community interest new managed client ebusiness using components wseb called ecomstation replace one based wod idea brought also create new non-remote boot client — effect oem version os/2 client although serenity initial response suggestion thick client negative response positive enough community ibm get things moving months later first ecs preview shipped notwithstanding cheung fairly simple initial concept community input actively solicited beginning feature requests quickly began coming final ga release ecomstation 1.0 us english released july 2001 significantly different original preview many respects obviously ibm os/2 install routine longer used instead rapid-deployment system based cheung wisemanager product utilized install operating system components addition number enhancements os/2 user interface integrated including revamped desktop layout entirely new icons customizable graphic effects number windowing components redesigned system dialogs enhanced user-extensible system shutdown ecomstation 1.0 built 2000 release ibm convenience package os/2 warp version 4 commonly referred mcp mcp1 additionally several commercial applications bundled operating system package notably lotus smartsuite os/2 ibm desktop on-call english edition released efforts turned making language editions called national language versions nlvs available however first non-english nlv targeted german released end 2001 due large part greater-than-anticipated effort localizing redesigned installer new materials ultimately non-english nlvs released ecomstation 1.0 languages would become available ecomstation 1.1 1.2. ecomstation 1.1 included several major new features compared version 1.0 largest change operating system installed package wide-ranging functional enhancements desktop environment workplace shell based open source xworkplace project netlabs.org included desktop folder enhancements status bars improved sorting options new virtual desktop feature customizable desktop toolbar support programmable widgets expanded configuration options various enhancements built-in support pppoe pptp internet connections also provided addition completely new install process designed bootable code installation cd rewritten improve compatibility modern bioses pre-boot menu introduced allowed user select various drivers kernel options use booting cd graphical installer ecomstation 1.0 replaced new streamlined interface ecomstation 1.1 based 2001 release ibm convenience package 2 os/2 warp version 4 also known mcp2 subsequent ibm service updates integrated version serenity systems separated base operating system product major commercial applications bundled ecomstation 1.0 base ecomstation 1.1 product sold title ecomstation entry applications including lotus smartsuite 1.7 hoblink x11 server packaged separately ecomstation application pack multi-processor support included ecomstation entry due additional license fees required ibm time instead smp package available ecomstation retailers paid extra release ecomstation 1.1 ecomstation server edition also made available based os/2 warp server e-business product besides english also german russian nlvs released ecomstation 1.1 principal new feature ecomstation 1.2 advertised revamped desktop multimedia support updated versions various bundled components ibm non-ibm also included ecomstation 1.2 released english german dutch nlvs serenity systems announced intention provide media refresh incorporating number fixes updates made available release ecomstation 1.2 released version 1.2r initially 12 november 2005 subsequently withdrawn re-released due last-minute bug fix 17 november 2005 principal new feature ecomstation 1.2r support installation athlon 64 systems previously possible awkward work-arounds ecomstation 1.2r released english german italian nlvs additionally beta release traditional chinese nlv made available via download registered customers ecomstation 2.0 longer-than-usual development cycle first beta released 21 december 2005 first self-styled release candidate announced 18 june 2007 final ga release available may 2010 biggest change ecomstation 2.0 addition acpi support represented first major update core operating system developed specifically ecomstation ibm benefits acpi included support modern hardware including advanced power-management features well support irqs 15 addition new acpi driver allowed access os/2 symmetric multi-processing support obviating need ibm proprietary smp-enablement driver consequently starting ecomstation 2.0 smp support included base product additional cost major feature introduced version 2.0 enhanced version journaled file system allowed operating system booted directly jfs-formatted partitions previous versions jfs usable non-bootable data partitions installing operating system onto jfs allowed significant performance improvement due much larger cache sizes supported jfs well reduced chkdsk times event non-clean shutdown ecomstation pricing model revamped significantly version 2.0 standard consumer version home student edition edition lower recommended retail price previous versions ecomstation however one customer limited five purchases business edition targeted commercial customers limit number purchases business edition also came telephone support whereas home student edition customers limited e-mail online assistance software-wise two products identical license terms differed noted editions ecomstation 2.0 included openoffice.org office suite provided separate cd application pack available previous versions discontinued ecomstation 2.0 available english release language versions deferred version 2.1 current version ecomstation 2.1 released year version 2.0 may 2011 version 2.1 two significant new features first support ahci disk controllers via newly developed device driver second replacement old ibm boot manager open-source air-boot software require primary partition therefore easier install disks pre-existing operating systems ecomstation 2.1 also updates included applications notably mozilla firefox minor improvements installer version 2.1 much former branding serenity systems removed released product replaced mensys bv ecomstation 2.1 currently available english german nlvs preview release japanese nlv also available certain customers nlvs including dutch italian reportedly development beta versions ecomstation 2.2 released 2013. ecomstation currently developed xeu.com various third party companies individuals although os/2 longer sold ibm ecomstation developed sold long remains profitable according serenity xeu.com important development ecomstation keeps adding value stakeholders involved recent major release version 2 released warpstock europe held 14–16 may 2010 updated version 2.1 followed year later may 2011 date last edition taken installation cds official release dates may different release dates refer us english editions unless otherwise noted ecomstation also complemented several open source applications included installer following open-source packages available ecomstation actively maintained see unix ports os/2 ecs netlabs ported packages also server edition based ibm os/2 warp server e-business minimum hardware requirements system running ecomstation 1.0 2.0 rc listed ecomstation number limitations relative operating systems currently available | [
6675,
6676,
7187,
10776,
25,
4637,
9757,
9762,
5158,
7217,
9784,
10809,
576,
6231,
10333,
97,
8298,
10352,
7285,
9335,
2168,
1147,
3197,
1150,
2179,
10883,
6797,
2193,
9366,
6296,
11418,
7325,
9887,
3248,
6837,
8388,
9932,
5840,
7382,
841... | Test |
2,463 | 3 | Socket_F+:socket f+ socket f+ also socket fr2 internally cpu socket amd server processors starting 45 nm generation k10 cpu family successor socket f. main difference two sockets supported hypertransport version socket f supports hypertransport 2.0 1.0 ghz speed socket f+ supports hypertransport 3.0 2.6 ghz speed backwards compatible version 1.0 2.0 | [
3586,
9475,
3588,
8452,
3464,
4872,
7058,
10260,
4767,
7712,
9122,
1322,
11183,
1329,
3892,
8629,
9400,
6978,
11331,
9157,
3783,
7247,
9551,
7122,
9427,
7132,
2525,
4451,
5859,
1260,
7788,
7151,
1776,
1651
] | Test |
2,464 | 4 | Information_Networking_Institute:information networking institute information networking institute ini established carnegie mellon 1989 nation ’ first research education center devoted information networking integral department college engineering collaboration school computer science tepper school business heinz college ini ’ professional graduate degree programs represent fusion technologies economics policies secure communication networks systems services ini also partners research outreach entities extend educational training programs broad audience people using information networking part daily lives ini educational partner carnegie mellon cylab university-wide multidisciplinary research center involving 50 faculty 100 graduate students work ini cylab carnegie mellon university designated national security agency department homeland security national center academic excellence information assurance/cyber defense education cae-ia/cd national center academic excellence information assurance/cyber defense research cae-r also designated nsa u.s. cyber command national center academic excellence cyber operations cae-cyber ops designations ini cylab participate ini teaching faculty drawn ini also ongoing partnership university hyogo graduate school applied informatics faculty involved teaching advising ini programs conducting research aspects information networking information security affiliated research centers ini graduated 1,400 alumni currently occupy positions variety sectors across industry government academia | [
10928,
1746,
5341,
7887
] | Test |
2,465 | 9 | Zend_Studio:zend studio zend studio commercial proprietary integrated development environment ide php developed zend technologies based php development tools pdt plugin eclipse platform pdt project led zend zend studio tightly integrated zend server zend pre-integrated tested php application stack integration enables developers quickly set complete php environment speed root cause analysis problems detected testing production environment zend studio also integrated zend framework example provides mvc view easy code navigation integration zend_tool automated code generation along zend server 2013 zend studio deployed 40,000 companies | [
1668,
1034,
6154,
9614,
3986,
11030,
1687,
2338,
10020,
9509,
5546,
2348,
11446,
4919,
190,
6338,
2372,
7364,
8644,
11208,
1353,
4171,
6998,
8539,
10587,
11357,
3553,
2658,
10340,
10341,
7785,
7147,
2413,
7022,
4853,
11259,
7293,
3583
] | Validation |
2,466 | 7 | Fast_automatic_restoration:fast automatic restoration fast automatic restoration fastar automated fast response system developed deployed american telephone telegraph 1992 centralized restoration digital transport network fastar automatically reroutes circuits spare protection capacity fiber-optic cable failure detected hence increasing service availability reducing impact outages network similar operation real-time restoration rtr developed deployed mci used mci network minimize effects fiber cut recovery technique used computer networks telecommunication networks mesh optical networks backup path alternate path affected traffic takes failure condition backup channel computed real time occurrence failure technique broadly classified two centralized restoration distributed restoration technique utilizes central controller access complete up-to-date accurate information network available resources resources utilized physical topology network service demands etc failure detected part network failure detection identification notification scheme central controller calculates new re-route path around failure based information database current state network new route backup path calculated central controller sends commands affected digital cross-connects make appropriate reconfigurations switching elements order implement new path fastar rtr restoration systems examples systems utilize restoration technique restoration technique central controller used hence up-to-date database state network needed scheme nodes network utilize local controllers local information particular node connected neighboring nodes available spare capacity links used connect neighbors state switching elements failure occurs part network local controllers handle computation re-routing affected traffic example approach technique utilized self-healing networks shn transport networks gradually developed digital cross connect system dcs -based mesh networks sonet ring networks optical mesh networks years recovery architecture used therein recovery architectures used different transport networks dcs-based mesh networks restoration ds3 facilities add-drop multiplexer adm -based ring protection sonet ring networks finally optical cross connect oxc -based mixed protection restoration optical mesh networks first restoration architecture used 1980s dcs-based mesh restoration ds3 facilities architecture utilized centralized restoration technique every restoration event coordinated network operation center noc restoration architecture path-based failure dependent utilized fault occurs fault detection isolation architecture capacity-efficient due use stub release slow failure recovery time time takes reestablish traffic continuity failure rerouting signals diverse facilities order minutes architecture implemented 1990s introduction sonet/sdh networks employed distributed protection technique utilizes either path-based upsr span-based blsr protection recovery path precomputed occurrence failure adm-based ring protection capacity-inefficient unlike dcs-based mesh restoration faster recovery time 50 ms recovery architecture used protection optical mesh networks introduced early 2000s protection architecture recovery time tens hundreds milliseconds significant improvement recovery time supported dcs-based mesh restoration unlike dcs-based mesh restoration recovery path predetermined pre-provisioned architecture also capacity efficiency seen preceding mesh restoration architecture dcs-based fastar uses dcs-based mesh restoration architecture architecture consists nodal equipment central control equipment data communication network interconnecting nodes central controller figure right explains architecture fastar different building blocks interact central processor called restoration provisioning integrated design rapid located noc responsible receiving analyzing alarm reports generated event fiber failure also handles alternate backup route computation re-routing affected traffic primary path already computed backup path path assurance tests enables roll-back traffic original path failure repaired rapid maintains up-to-date information state network available spare capacity central access display system cads provides craft interface rapid related restoration management systems traffic maintenance administration system tmas enables rapid perform control protection switch lock-out process protection channels used restoration sending commands line terminating equipment lte restoration network controllers rncs located central office co fiber optic network alarms generated affected digital access cross-connect system dacss lte sent rnc aged find alarm result transient correlated finally sent rapid via data communication network lte either ft series g digital transmission system add drop multiplexer adm reports fiber failure ltes rnc also provides rapid immediate access backup channels re-routing traffic path assurance tests restoration test equipment rte provides rapid means perform continuity tests used path assurance dacs responsible reporting fiber failures node failures occur within office rnc addition dacs enables automatic restoration providing central processor access remotely perform cross-connects ds-3 level data communication network used connect nodal equipments central controller achieve needed availability network full redundancy used form two totally diverse terrestrial satellite-based networks event major restoration process one networks support communication burden absence fastar operates ds-3 level restore individual smaller demands fastar restores 90 95 percent affected ds-3 demand within two three minutes fiber-optic cut occurs output dacs equipment input another rnc collects alarms affected ltes rnc ages alarms sends rapid rapid determines amount spare capacity available failure identifies ds-3 demands affected finds restoration route affected traffic sequential order priority sends command appropriate dacss implement re-route thus establishing restoration figure right route exists node node q via nodes c f k l. event fiber-optic cable failure nodes f k lte ft series g adm two offices detects sends alarm reports failure respective rncs rncs age alarm send reports rapid located noc rapid initiates time window ensure related alarms generated rncs affected nodes rnc office whose traffic utilizes f k failed fiber optic cable window times rapid performs route computation establish new backup path traffic node node q creates new route c f g j k l. route computation also done sequentially order priority traffic two nodes network utilize failed fiber-optic cable backup path traffic going nodes f k computed rapid ensures continuity connectivity along established back-up paths sending command rncs located q turn use test signal generated respective rte check continuity link connectivity backup path verified traffic nodes q transferred backup path commanding dacs iiis make appropriate cross connections rapid performs service verification test verify service transfer successful test returns positive result service transfer successful else service transfer unsuccessful needs repeated service traffic transfer process performed traffic going affected fiber optic cable f–k fastar restores much affected traffic demand available protection capacity allow shared risk link groups srlgs refer situations links connect two distinct nodes offices network share common conduit configuration links group shared risk one link fails links group may fail majority networks use today utilize srlgs times access building across bridge single conduit restore traffic link two offices nodes share srlg links event conduit cut least one two offices must fastar-ompliant cut srlg1 would restorable using fastar fastar implemented either office b b c yet fastar-compliant given failure srlg2 ds-3 traffic link 3 would restored fastar via newly re-computed backup path ds-3 traffic link 2 would restored fastar implemented either office b c. restore three links event failure srlgs fastar implemented offices c. failure srlg1 would cause fastar automatically re-route traffic link 1 3 via two re-computed backup paths also another time failure srlg2 detected reported rapid traffic link 2 3 re-routed new backup path fastar network management used integrate analyze different data alarms supplied various system elements make fastar architecture centralized display troubleshoot isolate problems fault management analysis corrective action taken fastar network management cuts across three tiers | [
9098,
6267,
2901
] | Test |
2,467 | 4 | Evasi0n:evasi0n evasi0n stylized evasi0n jailbreak program ios 6.0 6.1.2 ios 7.0 7.0.6 evasi0n7 known portable code base minimal use arbitrary code execution seven million copies evasi0n downloaded presumably installed first four days release released 4 february 2013 four six exploits used patched apple 18 march 2013 release ios 6.1.3 meant end original version evasi0n 22 december 2013 evad3rs released new version evasi0n supports ios 7.x known evasi0n7 one major exploit used jailbreak patched apple 4th beta ios 7.1 two beta 5 final release ios 7.1 fixed exploits used evasi0n7 evasi0n jailbreak specifically breaches modern security features address space layout randomization kernel space version launchd hard-coded list exclusive services serve device stability well vendor lock-in ios evasi0n reads fixed data vectors locate random address kernel space utilizes codice_1 file launchd processes regardless list exclusive services | [
6797,
8877,
7983,
5682,
3286,
823,
5176,
4957
] | Test |
2,468 | 2 | Mac_Box_Set:mac box set mac box set software package made apple inc. including latest version os x mac os x iwork ilife mac box set updated twice original release first release introduced shipped date ilife iwork '09 january 9 2009 included retail discs mac os x 10.5.6 leopard ilife '09 iwork '09 commonly called mac box set '09 next release started shipping shortly mac os x snow leopard introduced thing changed release mac os x version 10.6.3 snow leopard shipped ilife '11 introduced ilife version updated everything else stayed versions mac box set | [
3691
] | None |
2,469 | 3 | The_Portopia_Serial_Murder_Case:portopia serial murder case often translated portopia serial murder case english adventure game designed yuji horii published enix first released nec pc-6001 june 1983 since ported personal computers nintendo famicom mobile phone services game player must resolve murder mystery searching clues exploring different areas interacting characters solving item-based puzzles game features first-person graphics nonlinear gameplay open world conversations non-player characters branching dialogue choices suspect interrogations nonlinear storytelling plot twists famicom version also features command menu system point-and-click interface 3d dungeon maze upon release portopia serial murder case well received japan became influential title helped define visual novel genre portopia serial murder case follows first-person perspective narrative various events described still pictures text messages player interacts game using verb-noun parser requires typing precise commands keyboard finding exact words type considered part riddles must solved sound effects present game lacks music save function features conversation system branching dialogue choices story develops entering commands receiving answers player sidekick non-player characters game features nonlinear gameplay allowing multiple different ways achieve objectives includes travelling different areas open world making choices determine dialogues order events well alternative endings depending player identifies culprit however one characters true culprit others red herrings player closes case wrong culprit player face criticism police chief need re-open case game includes phone could used manually dial number needed contact several non-player characters game also features inventory system requiring examination collection items could used evidence later game keyboard famicom version replaces verb-noun parser menu list fourteen set commands selectable gamepad similar command selection menu system introduced yuji horii murder mystery adventure game released 1984 pc famicom releases portopia one commands menu allowed player use point-and-click interface using d-pad move cursor screen order look clues hotspots famicom version portopia also features branching menu selections includes using pointer magnifying glass investigate objects needed find hidden clues fist hammer hit anything anyone could used carry beatings suspect interrogations additional sequences also added notably underground dungeon maze style similar role-playing video games although story game fictional set real japanese cities mainly kobe addition sequences kyoto sumoto president successful bank company found dead secretary inside locked room mansion signs seem indicate kouzou stabbed however police sends detective investigate detective charge case unnamed unseen silent protagonist essentially embodies player simply referred works assistant named nicknamed one actually speaks executes player commands characters include among others daughter man named kouzou nephew heir stripper game conceived yuji horii around 1981 27 years old shortly bought first computer learned program modifying games time read pc magazine article computer game genre united states text adventures horii noticed lack games japanese market decided create adventure game horii also cited manga authors tetsuya chiba mitsuru adachi katsuhiro otomo influences game developed using basic programming language horii wanted expand adventure game genre ideas one concept create program story would develop entering command receiving answer idea game progresses conversations human computer started get ambitious thought could make computer converse enough data entered attempting create artificial intelligence language algorithm however realized n't possible computers time created dialogue computer beforehand player could type words computer would reply back reaction another concept contrast linear stories adventure games time idea branching non-linear storytelling main scenario take 20 game ’ content remaining 80 response various actions player however due pc memory limitations able create several short branching scenarios still found interesting one long linear scenario also conceived graphical format picture on-screen representing happening command menu system select action later became standard format japanese adventure games following 1983 release game ported various japanese personal computers famicom port released 1985 first adventure game released platform famicom version also first collaboration yuuji horii koichi nakamura chunsoft dragon quest famicom version programmed nakamura 19 years old time version portopia changed interface adopting command menu system horii created 1984 adventure game due frustration text-based entry admitting never able get far adventure games horii created command menu system hokkaido later used famicom version portopia horii also noted famicom versions portopia hokkaido wanted make appealing mature audience beyond famicom typical younger audience also playing wizardry time inspiring include 3d dungeon maze famicom version portopia game never released western world largely due mature content involving themes murder suicide fraud bankruptcy interrogation beatings drug dealings strip club lack western release prompted rom hacking group dvd translations develop unofficial translation famicom version first mobile phone version game branded part trilogy along mobile versions hokkaido rensa satsujin okhotsk ni kiyu karuizawa yūkai annai released 2003 ezweb yahoo keitai services features list set commands similar famicom version also improved graphics free-moving cursor save function games trilogy retitled re-released 2005 2006 services second portopia version possesses content first mobile one addition updated graphics background music bonus function obtained completing game hint option nullifies ending bonus used frequently famicom version game sold 700,000 copies game well received japan allowing multiple ways achieve objectives well-told storyline surprising twist ending japanese press described game without game technically way lose according square enix first real detective adventure game game along super mario bros. inspired hideo kojima creator metal gear series enter video game industry praised portopia mystery drama humor 3d dungeons providing proper background explanation behind murderer motives expanding potential video games kojima considers one three influential games played influence evident games including metal gear series snatcher pc-6001 version portopia serial murder case included hidden secret portopia also one first video games ever played nintendo eiji aonuma went become director legend zelda series starting ocarina time portopia influence also evident horii later work including seminal role-playing game dragon quest used storytelling techniques menu interface portopia john szczepaniak retro gamer considers one influential games responsible defining visual novel genre comparing role super mario bros. tetris street fighter defining respective genres platform game puzzle game fighting game respectively 2003 portopia serial murder case ranked 19th poll determine thirty best famicom games poll conducted tokyo metropolitan museum photography part level x exhibition english-language webzine retrogaming times monthly compared game later-released shadowgate player must examine collect objects find true purpose later recommended portopia fans slower paced games require players think puzzles john szczepaniak praised pacing quality writing considers gameplay plot sophisticated time noted contains elements found number later titles including déjà vu snatcher nine hours nine persons nine doors 1up also noted portopia similar icom simulations déjà vu released several years later nintendo successful series adventure games also inspired portopia usgamer compared later police quest adventure games csi television series well classic sherlock holmes novels according official xbox magazine portopia features point-and-click murder mystery plot open world suspect interrogations nonlinear gameplay dialogue choices alternate endings standard 2015 way ahead time 1983 comparing l.a. noire peter tieryas gave portopia positive retrospective review stating influence undeniable tragic back story strange vicissitudes characters face uncanny freedom investigate haunting uncovering killer makes special | [
7780,
8262,
10855,
8232,
9006,
7023,
6077,
8735
] | Test |
2,470 | 4 | Cross-site_request_forgery:cross-site request forgery cross-site request forgery also known one-click attack session riding abbreviated csrf sometimes pronounced sea-surf xsrf type malicious exploit website unauthorized commands transmitted user web application trusts many ways malicious website transmit commands specially-crafted image tags hidden forms javascript xmlhttprequests example work without user interaction even knowledge unlike cross-site scripting xss exploits trust user particular site csrf exploits trust site user browser csrf vulnerabilities known cases exploited since 2001 carried user ip address website logs might evidence csrf exploits under-reported least publicly 2007 well-documented examples new attacks web-enabled devices carried 2018 including attempts change dns settings routers router manufacturers hurriedly released firmware updates improve protection advised users change router settings reduce risk details released citing obvious security reasons attackers find reproducible link executes specific action target page victim logged embed link page control trick victim opening attack carrier link may placed location victim likely visit logged target site example discussion forum sent html email body attachment real csrf vulnerability utorrent cve-2008-6586 exploited fact web console accessible localhost:8080 allowed critical actions executed using simple get request attacks launched placing malicious automatic-action html image elements forums email spam browsers visiting pages would open automatically without much user action people running vulnerable utorrent version time opening pages susceptible attack csrf attacks using image tags often made internet forums users allowed post images javascript example using bbcode accessing attack link local utorrent application localhost:8080 browser would also always automatically send existing cookies domain general property web browsers enables csrf attacks exploit targeted vulnerabilities execute hostile actions long user logged target website example local utorrent web interface time attack cross-site request forgery confused deputy attack web browser csrf commonly following characteristics risk web applications perform actions based input trusted authenticated users without requiring user authorize specific action user authenticated cookie saved user web browser could unknowingly send http request site trusts user thereby causes unwanted action utorrent example described attack facilitated fact utorrent web interface used get request critical state-changing operations change credentials download file etc explicitly discourages assumption many existing csrf prevention mechanisms web frameworks cover get requests rather apply protection http methods intended state-changing attacker may forge request log victim target website using attacker credentials known login csrf login csrf makes various novel attacks possible instance attacker later log site legitimate credentials view private information like activity history saved account attack demonstrated google yahoo depending type http request methods vary susceptibility csrf attacks due differences handling web browsers therefore protective measures attack depend method http request additionally typically described static type attack csrf also dynamically constructed part payload cross-site scripting attack demonstrated samy worm constructed fly session information leaked via offsite content sent target malicious url csrf tokens could also sent client attacker due session fixation vulnerabilities guessed via brute-force attack rendered malicious page generates thousands failed requests attack class dynamic csrf using per-client payload session-specific forgery described 2009 nathan hamiel shawn moyer blackhat briefings though taxonomy yet gain wider adoption new vector composing dynamic csrf attacks presented oren ofer local owasp chapter meeting january 2012 – ajax hammer – dynamic csrf severity metrics issued csrf vulnerabilities result remote code execution root privileges well vulnerability compromise root certificate completely undermine public key infrastructure several things happen cross-site request forgery succeed attack blind attacker see target website sends back victim response forged requests unless exploit cross-site scripting bug target website similarly attacker target links submit forms come initial forged request subsequent links forms similarly predictable multiple targets simulated including multiple images page using javascript introduce delay clicks given constraints attacker might difficulty finding logged-in victims attackable form submissions hand attack attempts easy mount invisible victims application designers less familiar prepared csrf attacks say password cracking dictionary attacks csrf prevention techniques work embedding additional authentication data requests allows web application detect requests unauthorized locations synchronizer token pattern stp technique token secret unique value request embedded web application html forms verified server side token may generated method ensures unpredictability uniqueness e.g using hash chain random seed attacker thus unable place correct token requests authenticate example stp set django html form stp compatible relies html introduces complexity server side due burden associated checking validity token request token unique unpredictable also enforces proper sequence events e.g screen 1 2 3 raises usability problem e.g user opens multiple tabs relaxed using per session csrf token instead per request csrf token web applications use javascript majority operations may use anti-csrf technique relies same-origin policy security technique based assumption javascript running within origin able read cookie value javascript running rogue file email able read copy custom header even though csrf-token cookie automatically sent rogue request server still expecting valid x-csrf-token header csrf token unique unpredictable may generated randomly may derived session token using hmac csrf token cookie must httponly flag intended read javascript design technique implemented many modern frameworks django angularjs token remains constant whole user session works well ajax applications enforce sequence events web application protection provided technique thwarted target website disables same-origin policy using one following techniques similarly cookie-to-header approach without involving javascript site set csrf token cookie also insert hidden field html form sent client form submitted site check cookie token matches form token same-origin policy prevents attacker reading setting cookies target domain put valid token crafted form advantage technique synchronizer pattern token need stored server browser extensions requestpolicy mozilla firefox umatrix firefox google chrome/chromium prevent csrf providing default-deny policy cross-site requests however significantly interfere normal operation many websites csfire extension also firefox mitigate impact csrf less impact normal browsing removing authentication information cross-site requests noscript extension firefox mitigates csrf threats distinguishing trusted untrusted sites removing authentication payloads post requests sent untrusted sites trusted ones application boundary enforcer module noscript also blocks requests sent internet pages local sites e.g localhost preventing csrf attacks local services utorrent routers self destructing cookies extension firefox directly protect csrf reduce attack window deleting cookies soon longer associated open tab various techniques used proposed csrf prevention historically cross-site scripting xss vulnerabilities even applications running domain allow attackers bypass essentially csrf preventions | [
5636,
774,
3462,
3473,
11537,
1812,
7965,
10398,
9125,
5543,
10412,
5934,
5682,
5433,
700,
4797,
1597,
3391,
575,
450,
7368,
10571,
10831,
10579,
87,
4956,
5724,
7644,
479,
10466,
4453,
4198,
7530,
6636,
8045,
113,
5107,
3700,
8694,
119,
... | None |
2,471 | 3 | Semantic_Interoperability_Community_of_Practice:semantic interoperability community practice semantic interoperability community practice sicop group people seek make semantic web operational respective settings achieving semantic interoperability semantic data integration sicop seeks enable semantic interoperability specifically operationalizing relevant technologies approaches online conversation meetings tutorials conferences pilot projects activities aimed developing disseminating best practices individuals making community practice various settings however sicop claims neither formal implied endorsement organization | [
10452
] | None |
2,472 | 4 | Domain_Assurance_Council:domain assurance council domain assurance council dac trade association started summer 2006 paul hoffman john levine members dac divided categories include | [
182,
127
] | None |
2,473 | 2 | Bélády's_anomaly:bélády anomaly computer storage bélády anomaly phenomenon increasing number page frames results increase number page faults certain memory access patterns phenomenon commonly experienced using first-in first-out fifo page replacement algorithm fifo page fault may may increase page frames increase optimal stack-based algorithms like lru page frames increase page fault decreases lászló bélády demonstrated 1969 common computer memory management information loaded specific-sized chunks chunk referred page main memory hold limited number pages time requires frame page load page fault occurs page found might need loaded disk memory page fault occurs frames use one must cleared make room new page simple algorithm fifo whichever page frames longest one cleared bélády anomaly demonstrated believed increase number page frames would always result number fewer page faults bélády nelson shedler constructed reference strings fifo page replacement algorithm produced nearly twice many page faults larger memory smaller one formulated conjecture 2 general bound 2010 fornai iványi showed anomaly fact unbounded one construct reference string arbitrary page fault ratio | [
5840,
1801,
2250,
3615
] | Test |
2,474 | 2 | SignalR:signalr signalr software library microsoft asp.net allows server code send asynchronous notifications client-side web applications library includes server-side client-side javascript components asp.net signalr library asp.net developers add real-time web functionality applications real-time web functionality ability server-side code push content connected clients happens real-time signalr takes advantage several transports automatically selecting best available transport given client server best available transport signalr takes advantage websocket html5 api enables bi-directional communication browser server signalr use websockets covers available gracefully fall back techniques technologies n't application code remains signalr also provides simple high-level api server-to-client rpc call javascript functions client browser server-side .net code asp.net application well adding useful hooks connection management connect/disconnect events grouping connections authorization | [
9441,
9834,
6797,
7983,
10353,
2804,
11221
] | None |
2,475 | 7 | Manaba:manaba manaba cloud-based collaborative learning system developed internet service provider asahi net inc. manaba developed 2007 collaboration two private universities japan initially designed connect students teachers enable students accumulate learning evidence elevate learning outcomes mutual review known intuitive interface meaningful design focused learning outcomes flexibility scalability cloud application manaba adopted approximately 200 educational institutions globally december 31 2013 manaba provides spaces teachers conduct surveys tests collect assignments enable group projects facilitate online discussions students also review work develop debates course materials manaba provides individual space student accumulate learning evidence time share others reflect back previous work instructors assess learning outcomes looking students ’ portfolios collectively manaba creates spaces groups engage community discussions various topics name “ manaba ” comes two japanese words manabu 学 ba 場 manabu means learning ba activity place events occur | [
5612,
7983
] | Train |
2,476 | 2 | RTX_(operating_system):rtx operating system rtx line real-time operating system rtos extensions firm intervalzero software extension abstraction layer converts microsoft windows operating system rtos first windows real-time solution market rtx real-time software extensions windows combines familiar user experience microsoft windows rich gui extant drivers software ... direct control embedded hardware providing hard real-time determinism symmetric multiprocessing smp abilities rtx extensions followed windows architecture since windows nt 3.5 generally rtx supports 32-bit windows rtx64 supports 64-bit windows 2015 rtx2016 supports 32-bits rtx64 3.0 supports 64-bits systems used different markets industrial automation testbed simulation digital audio digital video aerospace military medical devices electrical grid electricity generation uses | [
6403,
6797,
11413,
9366,
5531,
10924,
7983,
6207,
3272,
2379,
2383,
5457,
5469,
5470,
5472,
10085,
5356,
4589,
1776,
6128,
499,
636,
2045
] | None |
2,477 | 2 | OS_2200:os 2200 os 2200 operating system unisys clearpath dorado family mainframe systems operating system kernel os 2200 lineal descendant exec 8 univac 1108 documentation information current past unisys systems found unisys public support website see unisys 2200 series system architecture description machine architecture relationship os 2200 operating system earlier 1100 systems going back 1101 1951 1108 first 1100 series computer designed efficient support multiprogramming multiprocessing along new hardware came operating system exec 8 executive system 1108 univac 1108 computer announced 1964 delivered late 1965 first 1108 computers used exec exec ii developed univac 1107 however univac planned offer symmetric multiprocessor versions 1108 4 processors earlier operating systems really basic monitor programs n't designed even though supported limited multiprogramming univac 1110 introduced 1972 operating system name changed os 1100 reflect support wider range systems name os 1100 retained 1988 introduction sperry 2200 series follow 1100 series name changed os 2200 since time 2200 series became unisys clearpath ix series unisys clearpath dorado series operating system retained os 2200 name company name product names also changed time engineering research associates era saint paul acquired remington rand corporation remington rand also acquired eckert–mauchly computer corporation philadelphia building univac computer two combined univac division remington rand direction william norris william norris one founders era later left remington rand start control data corporation univac division remington rand corporation became univac division sperry rand corporation remington rand merged sperry corporation 1970s sperry rand began corporate identity program changed name sperry corporation division names begin sperry computer systems division became sperry univac later division names dropped everything simply became sperry operating system kernel still referred exec unisys customer personnel however unisys began releasing suites products tested together system base releases later called clearpath os 2200 release n term os 2200 changed refer entire suite products system release others bis released asynchronously dorado hardware platforms 1986 burroughs sperry corporations merged become unisys long time 2200 series clients say stands univac still supplier major mainframe product lines companies continued development including mcp operating system burroughs os 2200 sperry 2016 unisys made virtual microsoft windows version os2200 available cost educational leisure purposes exec 8 sometimes referred exec viii univac operating system developed univac 1108 1964 combined best features earlier operating systems exec exec ii used univac 1107 exec 8 one first commercially successful multiprocessing operating systems supported simultaneous mixed workloads comprising batch time-sharing real-time one file system flat naming structure across many drums spindles also supported well-received transaction processing system previous systems real-mode systems hardware support protection separation programs operating system support multiprogramming previous systems limited running one user job concurrently multiple supporting functions known well-behaved card reader printer card punch spoolers exec 8 operating system designed beginning multiprogramming multiprocessing operating system 1108 designed four cpus memory mass storage primary system constraints 1100 series envisioned targeting general market extreme real time processing primary requirement specifications exec 8 drawn december 1964 preliminary programmers reference manual user guide work began may 1965 exec 8 began real time operating system early use mostly general scientific engineering work also used message switching process control simulation missile firing control designed run systems often 128k words 576 k bytes—less maximum memory size ibm pc xt focused real time batch processing earliest release levels work 128kw increasing functionality later releases made untenable since n't leave enough space programs useful size maximum memory capacity 1108 256kw 1,148 kb efficient use memory important constraint since core memory expensive part system mass storage consisted 6-foot long rotating drums held 256kw fh-432 2mw fh-1782 highest capacity mass storage fastrand drum held 22 mw 99 mb file fragmentation dealt process called file save generally done per day night involved rolling files tape reinitializing drum file system reading files back severe memory constraints real time use keeping single copy code loaded core requirement since 1108 designed multitasking system fully reentrant thread safe reentrant module accessed program data single memory base address different instance run data switching execution contexts could done single instruction merely setting different base address single register system used fine-grained locking protect shared data structures executive compilers utilities even sophisticated user applications might multiple copies running concurrently written code could shared required loading one copy memory saving space time took load code another reason separate code data different load entities memory implemented two independent banks separate physical cabinets called ibank dbank instruction data access path cpu could read banks simultaneously loading executable code one memory bank data run time many programs could almost halved reentrant code thread safe execute self-modifying code allowed programs modifying executable code runtime still acceptable programming technique time 1100-series computers users encouraged performance hit security benefits touted highly valued hacking 1100-series applications would provide benefit anyone hackers malevolent exec 8 primarily batch processing system gave applications called tasks fine control cpu scheduling priority threads called activities processor switching preemptive higher priority threads gaining control processor currently running lowest priority thread program except realtime systems even lowest priority tasks got processor time multiprogramming multiprocessing operating system fully symmetric processor management test-and-set instruction built hardware allowed efficient fine-grained locking within os within multi-threaded applications exec 8 work organized jobs called runs scheduled based priority need lockable resources uniservo tape drives fastrand drum files control language syntax uses symbol univac called master space control statement recognition symbol immediately followed command program name comma option switches space character remainder statement differed particular commands command compile fortran program would look like options sourcefile objectfile input data application could read file generally card images immediately follow command run stream lines sentinel command end assumed input data forgetting insert led compiler interpreting subsequent commands program data reason preferable process data files rather inputting run stream 1968 work began adding time-sharing capability exec 8 delivered level 23 executive 1969 time sharing called demand mode capabilities batch real time processes everything could done batch could done ascii terminal demand mode job stream i/o attached terminal handler rather card image input spool output files run control language used years later specific time sharing commands added control statements could issued asynchronously immediate processing even neither executive running program expecting data commands could entered terminal began could performed without stopping work progress terminal called transparent commands first statements kill current program redirect terminal output file eventually almost control statements allowed immediate batch demand runs terminate fin statement demand user terminates session run active exec automatically terminates run without requiring fin transaction processing capability developed late 1960s joint project united airlines later refined another joint project air canada capability fully integrated operating system 1972 became basis much future growth 1100 series early users controlled communication lines directly within real time programs part development transaction processing included communication message system managed communication lines presented messages exec 8 scheduled transactions moved low level communication physical line management protocols applications cms 1100 application cms 1100 ran real time multi-threaded program privilege acquiring control communication lines submitting transaction messages scheduling led notions exec 8 applications nature needed carefully controlled ensure could cause integrity issues security certainly concern early days system reliability integrity much larger issues system still primarily batch transaction processing little chance anyone could install unauthorized code system cms 1100 later added capability interface demand terminals well transaction terminals terminals could used early terminal drivers could removed exec cms 1100 later replaced combination cpcomm clearpath enterprise servers communications platform silas system interface legacy application systems intel-based dorado server models lower level communications moved firmware upper levels handled silas cpcommos clearpath enterprise servers communications platform open systems exec contains code system allowed run highest privilege levels mechanisms code promoted privilege levels exec responsible managing system hardware scheduling managing work communicating operators administrators release 16.0 exec level 49r2 49.70.5 internal system levels use three-part number 21.92.42 first widely used production system although earlier releases used production number sites first number part major level indicates new version exec previous updates integrated new base version infrequent process occurs intervals years second number part indicates versions updates major level often occurs several times per week decision made freeze feature content prepare release third part comes play indicates versions pre-release level fixes minor feature updates applied concurrently preparing level release updates mainline continue engineers integrate changes preparation future release many years official release level full three-part number later releases named simply 44r1 44r2 49r2 although three-part number still used internally exec heart real time multi-threaded batch processing system everything built around model exec largely structured real time program functions performed services windows daemons linux unix implemented either activities within exec batch programs always running background time-sharing known demand mode transaction processing implemented special cases batch one result restrictions time-sharing user transaction program lots warnings writers transaction programs happy performance example call tape mount permitted largest unit work run taken factory production run terminology generally equates job session systems run defined run stream run stream sequence control statements represent steps taken may include file handling program execution branches control batch run typically stored file scheduled start command within another run operator time sharing run initiated logging time-sharing terminal inputting run command often run statement second control statement often add program execution generated automatically based user profile security authorizations validated based authenticated user-id information supplied run control statement transactions special case ’ actually control statements internal data structures run created enables exec associate security accounting debugging etc mechanisms transaction programs generally security profile cached memory time transaction user authenticated copied user session data transaction run state transaction scheduled transaction instance essentially run accounting logging error handling encapsulated run mechanism batch jobs runs characterized runstream job control language statements stored file batch job always contains run statement first record file statement gives run name runid defines priorities defines maximum number sups standard units processing job expected use job started job start control statement operator via st keyin system may configured automatically issue start statements number jobs boots jobs serve purpose performing initialization recovery background functions fields run statement may overridden corresponding fields start statement except start executed privileged user userid security state always taken run start two priority fields run statement one used specify backlog priority 26 backlog priority levels – z exec configured maximum number open batch runs level reached jobs selected backlog queues priority order within priority selection usually fifo however exec pre-scans job control statements first program execution looking file names reel numbers job would immediately stall resources needs available may bypassed start jobs priority level second priority level defines execution processor resource group general higher execution group priorities typically get processor time os 2200 job control language support full programmability allow dynamic additions sequences control language add control statement file added may created job immediately preceding adding add control statements may also submitted within running program via api additional programmability available indirectly use symbolic stream generator ssg ssg programming language manipulating creating text files input parameters system information used heavily configuration management make processing functions text images need created programmatically resulting output add ed run thus providing indirectly programmable runstream operator commands available change backlog execution priorities runs operator commands available api suitably privileged users automated controlled remote administrator deadline special case batch deadline run looks like batch run except deadline time specified run start control statement deadline time used conjunction maximum sups time estimate control statement deadline job runs normal batch priorities unless appears could miss deadline time mismatch time deadline remaining sups higher priority deadline ’ totally shut transactions effect real time effectively shut processing system necessary achieve goal os 2200 time-sharing sessions called demand demand runs use control language batch runs additions known immediate control statements immediate control statements use sentinel indicates executed immediately even program running used create assign files important ones allow demand user error terminate running program even send signal transactions execute runs without stored submitted control statements instead message received session defined transaction session scanned determine transaction queue placed normally determined first characters message user-written scanners may added communication manager capable handling 250,000 active sessions takes incoming transaction messages passes message queuing software handle unlimited number queued messages using message queuing architecture call made transaction interface package tip apis operating system queue transaction appropriate queuing point queuing point identifies priority concurrency level work associated transaction program executed transaction program scheduling tree allows client establish relative usage groups transaction programs concurrency limits avoid one type work dominating system exclusion work avoid creating commitment resources 4094 nodes may created tree priority 0 63 concurrency level 1 2047 specified transaction program highest priority transaction selected scheduling except limited concurrency policies effect node higher nodes real time another type run rather set priority levels activity may request real time typically used long running batch programs like os 2200 communications manager cpcomm restricted 36 real time priority levels available api applications use user account must privilege use real time priorities site control applications use priority levels real time priorities totally dominate lower priorities quite possible misbehaved real time program tie one processors real time priority applies individual activity thread program may real time non-real time threads executing time run started getting access processor controls rate progress heart exec dispatcher manages processors exec supports 4095 dispatching priorities although sites define small subset two highest priorities ’ switchable recognition certain types processing must allowed continue processor started voluntarily give control interrupt lockout occurs interrupt arrives special cases exec code prevents interrupts order change data interrupt handler may also access interlock used interrupt post processing routines either need run physical processor simply interrupted dispatcher i/o completions i/o initiation examples locks used priorities spin locks way set someone else another processor design requires set short instruction sequences high exec priority used operator command handler functions may run even real time program control expected use short amounts time need time queue work processed low exec activity real time activities unlimited processor quantum run without switching unless interrupted higher priority real time activity high exec activity real time activities given control available processor running something lower priority interrupts sent processors necessary ensure immediate availability real time used customers fly missiles run simulators functions require immediate response transaction priorities may handled two ways defined site may sort lower priority real time priority matters quantum size essentially infinite appropriate short-lived transactions airline reservations one loops due programming error exec terminate reaches small configured maximum time form allows exec vary priority within range optimize system resource usage approach gives higher priority shorter time slices programs i/o limited progressively lower priorities longer time slices computing exec dynamically adjusts priorities based behavior programs often behave ways different times approach appropriate longer running transactions like database queries airline fare quotes batch demand always use dynamically adjusted priorities programs i/o limited conversation time-sharing user get higher priorities short time slices compute-oriented programs get lower priorities longer time slices exec two additional mechanisms optimizing dispatching one affinity-based dispatching possible exec run activity processor last time get greatest advantage residual cache contents n't possible tries keep activity nearest processor standpoint cache memory access times second fairness policy mechanism site define relative percentage resources allocated transactions demand batch within transactions batch priority groupings indicate percentage group time allocated priority ensures transactions dominate system batch work gets done within various priority groupings ensures progress assured group unless group percentage zero fairness algorithms come play processors busy os 2200 systems often run processors near 100 utilized os 2200 supports several models system performance management customers may purchase certain fixed performance level exec monitor processor usage ensure performance exceed level customers also purchase additional performance either temporarily permanently full capacity system workload increases emergency requires recently system added metered usage capability mode full power system always available customer although may administratively limit usage accumulated month reported usage submitted unisys billing depending specific contract terms client may receive bill excess usage contracted baseline month statement showing total contracted usage decremented first form like cell phone bill potential charging excess minutes latter like buying pre-paid phone card os 2200 hierarchical file system operating systems rather structured naming convention notion container files called program files files os 2200 simply containers may addressed either word offset file sector 28-word unit offset file 28 words historical unit early mass storage device fastrand drum could hold 64 units per physical track nonetheless fortunate historical accident four 28-word units 112 words occupy 504 bytes today mass storage devices using 512-byte physical records os 2200 clients almost adopted multiple 112 words physical record size database page size i/o processors automatically adjust 504 512 byte mapping adding 8 bytes zeros writes stripping reads physical record os 2200 handles applications use sizes multiples 112 words indivisibly reading containing physical records writing back unchanged changed portions data chaining special locking functions guarantee indivisibility even device errors across multiple systems cluster file formats internal data structures described data structures programming reference manual ever since exec-8 file names taken form qualifier*filename f-cycle e.g. personnel*employees +1 qualifier filename simply twelve-character strings used create whatever naming structure client desires f-cycle number 0 999 allows multiple generations file may referenced relative numbers +1 next new cycle -1 previous cycle +0 current cycle leaving cycle defaults current cycle batch production runs create new generations files use approach numbers wrap around 999 32 consecutive relative cycle numbers may exist one time creating +1 deletes -31 file may used program file program file contains elements generally act files element naming qualifier*filename f-cycle .element/version e-cycle e.g. personnel*programs.taxcalc/2008 element version twelve-character names used way user desires e-cycle similar f-cycle represents generation number without restriction 32 concurrent cycles limit 256k cycles however e-cycle applies text elements line text element marked cycle numbers inserted deleted elements also type sub-type commonly used types text object default type suitable options select appropriate type text elements also sub-types typically represent programming language e.g. asm c cob default element name object file text file created object element may executed main program linked object elements including main program linking may static dynamic main program may executed without pre-linking provided required sub-programs program file system libraries otherwise known rules may included program file direct dynamic linker search unfulfilled references linker may also used statically link multiple object modules together form new object module containing instructions data information original object modules omnibus elements may used data applications may serve hold structured information applications system utilities assumed structure omnibus element compatibility earlier basic mode programming models relocatable absolute element types relocatable elements output basic mode compilers may combined basic mode static linker map – collector form absolute element executable os 2200 implements fully virtual file system files may allocated anywhere across mass storage devices mass storage treated large space pool similar way virtual memory managed contiguous space allocated possible mass storage treated set pages 8kb size file placed many areas different devices required dynamic expansion files attempts allocate space adjacent previous allocation find space wherever available fact files need even present mass storage used exec file backup system fully integrated file backups made tape reel number recorded file directory space gets short mass storage files simply marked unloaded current backup copy space available use enough space ca n't found way backup started reference unloaded file queued file copied back mass storage whole system automatic generally transparent users general exec provide access methods files simply containers access methods provided language run time systems database manager one exception fixed-block access method provided high-volume transaction processing much less overhead database manager participate locking clustering recovery mechanisms clients want explicit control location files use removable pack concept one time truly represented physically removable disk packs operating system would automatically generate pack mount requests operators needed today still used place files usually database files transaction files one disk volumes files may still span multiple disk volumes list volume names given file created files volume groups still backed subject automatic virtual space management os 2200 also provides full implementation common internet file system cifs cifs implements smb protocol used microsoft servers unix/linux samba software cifs clearpath os 2200 file server file client cifs-compliant systems includes desktop pcs running windows cifs supports smb message signing maintain os 2200 security cifs clearpath os 2200 provides two levels protection first os 2200 files visible network declared shares cifs command specific privilege exists control may declare share second level control access still protected os 2200 security clients accessing os 2200 via cifs either automatically identified via ntlm kerberos presented query os 2200 user id password cifs allows os 2200 files presented hierarchical view typically qualifier appear highest level tree followed filename element name version addition files may stored os 2200 servers using full windows filename format windows applications see os 2200 another file server os 2200 applications apis available read write files existing cifs-compliant servers windows file servers network text files automatically converted os 2200 internal formats binary files must understood application program cifsut utility running os 2200 exchange encrypted compressed files software winzip concept subsystems protected subsystems central design os 2200 subsystem analogous .dll windows code data may shared among programs running system os 2200 subsystem set banks reside separate part address space directly accessed user program instead hardware os provide gate may target call instruction see unisys 2200 series system architecture information database managers run time libraries messaging system many system functions implemented subsystems subsystems usually consisting pure code run time libraries may direct target call instruction without requiring gate subsystems run user program protection environment subsystems database managers consist code data privileged code may called via gate subsystems may also access control lists associated control may call importantly gate controls specific entry points visible protection environment subsystem run often user-specific parameter provides additional secure information caller os 2200 security system designed protect data unauthorized access modification exposure includes implementation dod orange book b1 level specification os 2200 first obtained successful b1 evaluation september 1989 evaluation maintained 1994 point os 2200 developers continued follow development documentation practices required b1 evaluation central b1 system concepts users objects users identities clearance levels compartments privileges objects require certain combinations various types access objects os 2200 consist files protected subsystems devices tape reels security profile user session includes user identity clearance level 0-63 compartment set set allowed privileges os 2200 implements mandatory access control mac discretionary access control dac based bell-la padula model confidentiality read write biba integrity model read write run read execute file run executing clearance level must greater equal clearance level file file clearance level must 0 within clearance level range run addition run executing compartment set must contain file compartment set os 2200 combines bell-la padula biba model requirements run executing clearance level compartment set must exactly match file permit writing file deleting dac associates access control list object list identifies users user groups access defines type access user group allowed read write execute delete full set b1 controls restrictive environments system administrators configure servers choosing controls apply set security levels fundamental security security level 3 serves starting point every os 2200 system one user designated security officer systems configured fundamental security security officer allowed perform certain tasks systems configured higher levels security trusted users may allowed perform tasks os 2200 provides fine-grained security mechanism based principle least privilege principle demands minimum privilege granted necessary perform task required thus os 2200 concept super user role assumed user rather uses large set specific privileges may granted separately user privilege associated specific authority systems configured security level 1 higher levels user creates object object owner default object private creating user may also public controlled access control list owner security officer may create access control list object system configured fundamental security files owners instead created private account project public access controlled read write keys users log system identify optionally select clearance level compartment set use session os 2200 offers flexible authentication system multiple authentication mechanisms supported concurrently client- third party-written authentication software may also used standard authentication capabilities include last two permit use biometrics smart cards authentication mechanism supported technologies os 2200 provides encryption data rest cipher api software subsystem encrypts decrypts caller data cipher api also supports use hardware accelerator card bulk data encryption cmos-based dorado servers cpcomm provides ssl/tls encryption data transit intel-based dorado servers ssl tls provided openssl included dorado firmware dorado servers support tls levels 1.0 1.2 well sslv3 ssl disabled default vulnerabilities protocol cpcomm cipher api use encryption services cryptolib fips-certified software encryption module aes triple des algorithms among algorithms implemented cryptolib os 2200 also supports encrypting tape drives provide encryption archive data os 2200 systems may clustered achieve greater performance availability single system 4 systems may combined cluster sharing databases files via shared disks hardware device xpc-l provides coordination among systems providing high-speed lock manager database file access clustered environment allows system local files databases application groups along shared files one shared application groups local files databases accessed single system shared files databases must disks simultaneously accessible systems cluster xpc-l provides communication path among systems coordination actions also provides fast lock engine connection xpc-l via special i/o processor operates extremely low latencies lock manager xpc-l provides functions required file database locks includes deadlock detection ability free locks failed applications xpc-l implemented two physical servers create fully redundant configuration maintenance including loading new versions xpc-l firmware may performed one servers continues run failures including physical damage one server stop cluster information kept servers os 2200 operations built around active operators one consoles console terminal window part reserved fixed display frequently updated summary information activity system rest console used scrolling display events message issued requires operator response given number 0 9 remains display answered tape mount messages scroll messages repeated every two minutes tape mounted operations sentinel used os 2200 operations os 2200 consoles simply windows within operations sentinel display may many display pcs desired remote operation typical operations sentinel supports number clearpath windows linux unix systems auto-action message database released product database allows operations sentinel recognize messages scripts may written automatically respond messages require response hide unwanted messages translate languages create events etc full dark room operation used clients operations sentinel displays remote locations monitoring system creating alerts certain events occur administration os 2200 systems performed using wide variety tools specialized particular area system example tool used administering transaction environment allows new transaction programs installed specifies necessary information changes queuing structure priorities concurrency levels tools specific security officer allow creation users changing allowed privileges changing system security settings etc tools graphical interface although provide batch stored file interface actions specified control stream allows scripting administrative interfaces either local sites maybe based time day events remote sites unique privileges required administrative area application groups logical construct consisting instance universal data system uds instance message queue subsystem set transactions application group audit trail os 2200 supports maximum 16 application groups system notion application group corresponds often called application set programs data represent larger unit connected processing example application group might represent airline system another application group might represent corporate finance system application groups might represent instances application data models bank branches important thing application group environment sessions recovery etc application groups may started stopped recovered independently application groups accounting scheduling rules transactions multiple application groups may share priorities interleaved priorities permits site control relative priorities transactions across entire system unisys history newsletter contains articles unisys history computers addition unisys history newsletters links sites historical archives unisys charles babbage institute university minnesota hagley museum library delaware charles babbage institute holds archives era early remington rand archives saint paul mn burroughs archives hagley museum library holds bulk sperry archives | [
2432,
6529,
2179,
3716,
6797,
5658,
9762,
1702,
11432,
4398,
7983,
11184,
11059,
7483,
8001,
11075,
8136,
5067,
1869,
2002,
5714,
6098,
10580,
10835,
4067,
2533,
8556,
5363
] | Test |
2,478 | 8 | MacHTTP:machttp machttp webserver designed run classic mac os versions 7.x 9.x written software developer chuck shotton originally shareware dates 1993 available source code form sourceforge.net perl artistic license current version 2.6.1 still used older macintosh hardware later commercialized webstar sold originally starnine later bought quarterdeck software program runs mac os x classic environment ported run natively mac os x though attempt apparently underway 2003 functionally replaced apache web server machttp supports common gateway interface standard generating dynamic content well apple events scriptability | [
576,
2485,
670
] | Validation |
2,479 | 6 | Unix_file_types:unix file types standard unix file types regular directory symbolic link fifo special block special character special socket defined posix different os-specific implementations allow types posix requires e.g solaris doors file type identified codice_1 command displays type first character file system permissions field regular files unix impose provide internal file structure therefore structure interpretation entirely dependent software using however codice_2 command used determine type data contain take example one line codice_1 output posix specifies format output long format codice_4 option particular first field first space dubbed file mode string first character describes file type rest string indicates file permissions therefore example mode string codice_5 file type codice_6 directory permissions codice_7 internally codice_8 obtains codice_9 structure associated file transforms codice_10 field human-readable format note codice_10 actually bit field two parts file type stored within codice_12 mask tested macros like codice_13 codice_14 value mask codice_12 get file type flags gnu coreutils version codice_8 uses call codice_17 glibc function exposed gnulib library get mode string freebsd uses simpler approach allows smaller number file types regular files show codice_1 hyphen-minus codice_19 mode field common special file directory layout directory file defined filesystem used several filesystems available unix native non-native one directory file layout directory marked codice_6 first letter mode field output codice_21 codice_9 e.g symbolic link reference another file special file stored textual representation referenced file path means destination may relative path may exist symbolic link marked codice_23 lower case codice_24 first letter mode string e.g one strengths unix always inter-process communication among facilities provided os pipes connect output one process input another fine processes exist parent process space started user circumstances communicating processes must use fifos referred named pipes one circumstance occurs processes must executed different user names permissions named pipes special files exist anywhere file system created command codice_25 codice_26 named pipe marked codice_27 first letter mode string e.g socket special file used inter-process communication enables communication two processes addition sending data processes send file descriptors across unix domain socket connection using codice_28 codice_29 system calls unlike named pipes allow unidirectional data flow sockets fully duplex-capable socket marked codice_30 first letter mode string e.g unix almost things handled files location file system even hardware devices like hard drives great exception network devices turn file system handled separately device files used apply access rights devices direct operations files appropriate device drivers unix makes distinction character devices block devices distinction roughly follows although example disk partitions may character devices provide un-buffered random access blocks partition block devices provide buffered random access blocks partition character device marked codice_31 first letter mode string likewise block device marked codice_32 e.g door special file inter-process communication client server currently implemented solaris door marked codice_33 upper case first letter mode string e.g | [
2432,
3522,
5698,
1509,
4423,
7975,
5969,
5492,
10774,
8631,
6813
] | Test |
2,480 | 3 | Zero_instruction_set_computer:zero instruction set computer computer science zero instruction set computer zisc refers computer architecture based solely pattern matching absence micro- instructions classical sense chips known thought comparable neural networks marketed number synapses neurons acronym zisc alludes reduced instruction set computer risc zisc hardware implementation kohonen networks artificial neural networks allowing massively parallel processing simple data 0 1 hardware implementation invented guy paillet developed cooperation ibm chip factory essonnes france commercialized ibm zisc architecture alleviates memory bottleneck blending pattern memory pattern learning recognition logic massively parallel computing solves allotting neuron memory allowing simultaneous problem-solving results settled disputing according techcrunch software emulations types chips currently used image recognition many large tech companies facebook google applied miscellaneous pattern detection tasks text results said produced microseconds even chips released 2007 junko yoshida ee times compared neuromem chip machine machine capable able predict crimes scanning people faces person interest tv series describing heart big data foreshadow ing real-life escalation era massive data collection | [
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... | None |
2,481 | 9 | SWIG:swig simplified wrapper interface generator swig open-source software tool used connect computer programs libraries written c c++ scripting languages lua perl php python r ruby tcl languages like c java javascript go modula-3 ocaml octave scilab scheme output also form xml lisp s-expressions aim allow calling native functions written c c++ programming languages passing complex data types functions keeping memory inappropriately freed inheriting object classes across languages etc programmer writes interface file containing list c/c++ functions made visible interpreter swig compile interface file generate code regular c/c++ target programming language swig generate conversion code functions simple arguments conversion code complex types arguments must written programmer swig tool creates source code provides glue c/c++ target language depending language glue comes two forms swig used calling interpreted functions native code must done programmer manually swig wraps simple c declarations creating interface closely matches way declarations would used c program example consider following interface file file two functions global variable two constants swig creates extension module declarations accessible scripting language functions variables constants respectively python two main reasons embed scripting engine existing c/c++ program several reasons create dynamic libraries loaded extant interpreters including swig written c c++ publicly available since february 1996 initial author main developer david m. beazley developed swig working graduate student los alamos national laboratory university utah faculty university chicago development currently supported active group volunteers led william fulton swig released gnu general public license swig successful participant google summer code 2008 2009 2012 2008 swig got four slots haoyu bai spent summers swig python 3.0 backend jan jezabek worked support generating com wrappers cheryl foil spent time comment 'translator swig maciej drwal worked c backend 2009 swig participated google summer code time four students participated baozeng ding worked scilab module matevz jekovec spent time c++0x features ashish sharma spent summer objective-c module miklos vajna spent time php directors 2012 swig participated google summer code time four five students successfully completed project leif middelschulte worked c target language module swati sharma enhanced objective-c module neha narang added new module javascript dmitry kabak worked source code documentation doxygen comments python similar functionality offered sip boost boost.python library | [
5634,
3462,
8582,
11661,
8079,
1435,
9245,
4777,
5677,
2045,
692,
9780,
1724,
9921,
8644,
5703,
5833,
8396,
479,
10083,
10470,
8554,
2804,
4341,
1401,
7805,
8702
] | None |
2,482 | 9 | Kristen_Nygaard:kristen nygaard kristen nygaard 27 august 1926 – 10 august 2002 norwegian computer scientist programming language pioneer politician internationally nygaard acknowledged co-inventor object-oriented programming programming language simula ole-johan dahl 1960s nygaard dahl received 2001 a. m. turing award contribution computer science nygaard born oslo received master degree mathematics university oslo 1956 thesis abstract probability theory entitled theoretical aspects monte carlo methods nygaard worked full-time norwegian defense research establishment 1948 1960 computing programming 1948–1954 operational research 1952–1960 1957 1960 head first operations research groups norwegian defense establishment cofounder first chairman norwegian operational research society 1959–1964 1960 hired norwegian computing center ncc responsible building ncc research institute 1960s becoming director research 1962 together ole-johan dahl developed simula 1961–1965 simula-67 first object-oriented programming languages introducing core concepts object-oriented programming languages objects classes inheritance virtual quantities multi-threaded quasi-parallel program execution 2004 aito established annual prize name ole-johan dahl kristen nygaard honor pioneering work object-orientation aito dahl-nygaard prize awarded annually two individuals made significant technical contributions field object-orientation work spirit pioneer conceptual and/or implementation work dahl nygaard shaped present view object-oriented programming prize presented year ecoop conference prize consists two awards given senior junior professional conducted research norwegian trade unions planning control data processing evaluated light objectives organised labour 1971–1973 working together olav terje bergo research development work included social impact computer technology general system description language delta 1973–1975 working erik holbaek-hanssen petter haandlykken nygaard professor aarhus denmark 1975–1976 became professor emeritus oslo part-time 1977 full-time 1984–1996 work aarhus oslo included research education system development social impact computer technology became foundation scandinavian school system development closely linked field participatory design beginning 1976 engaged development since 1986 implementation general object-oriented programming language beta together bent bruun kristensen ole lehrmann madsen birger moeller-pedersen language available wide range computers nygaard first half 1980s chairman steering committee scandinavian research program sydpol system development profession oriented languages coordinating research supporting working groups system development language research artificial intelligence also 1980s chairman steering committee cost-13 european common market commission -financed research project extensions profession-oriented languages necessary artificial intelligence information technology becoming part professional work nygaard research 1995-1999 related distributed systems leader general object-oriented distributed systems goods three-year norwegian research council-supported project starting 1997 aiming enriching object-oriented languages system development methods new basic concepts make possible describe relation layered and/or distributed programs computer hardware people carrying programs goods team also included haakon bryhni dag sjøberg ole smørdal nygaard final research interests studies introductory teaching programming creation process-oriented conceptual platform informatics subjects developed new research project called cool comprehensive object-oriented learning together number international test sites giving lectures courses subjects norway elsewhere november 1999 became chair advisory committee broadband communication norwegian department municipal regional affairs held part-time position simula research laboratory 2001 research institute opened june 1990 received honorary doctorate lund university sweden june 1991 became first individual given honorary doctorate aalborg university denmark became member norwegian academy sciences october 1990 computer professionals social responsibility awarded norbert wiener award social professional responsibility 1999 became together dahl first receive rosing prize new prize awarded norwegian data association exceptional professional achievements june 2000 awarded honorary fellowship originating object technology concepts object management group international organization standardization within object-orientation november 2001 dahl awarded ieee john von neumann medal institute electrical electronics engineers introduction concepts underlying object-oriented programming design implementation simula 67 february 2002 given together ole-johan dahl 2001 a. m. turing award association computing machinery acm citation ideas fundamental emergence object oriented programming design programming languages simula simula 67 august 2000 made commander royal norwegian order st. olav king norway 1984 1985 nygaard chairman informatics committee university oslo active design university plan developing research education computing communication facilities faculties university first chairman environment protection committee norwegian association protection nature 10 years 1970s norwegian representative oecd activities information technology member research committee norwegian federation trade unions cooperated unions number countries several years engaged running experimental social institution trying new ways creating humane living conditions socially outcast alcoholics nygaard active norwegian politics mid late 1960s member national executive committee norwegian liberal party chair party strategy committee minor ballot candidate 1949 parliamentary election intense political fight 1972 referendum whether norway become member european common market later european union worked coordinator many youth organisations worked membership 1971 2001 nygaard member labour party member committees research policies party november 1988 became chair information committee norway eec august 1990 reorganized nei til ef organization disseminating information norway relation common market coordinating efforts keep norway outside european union membership norway literally eu 1993 eec ratified maastricht treaty became european union organization changed name reflect nei til ef became largest political organization norway 145,000 members 1994 population 4 million nygaard worked anne enger lahnstein leader anti-eu centre party campaign referendum november 28 1994 nei til eu succeeded 52.2 electorate voted voter participation highest ever norway history 88.8 strategy campaign insisted nygaard something well i.e scandinavian welfare state nygaard considered threatened maastricht agreement resigned chair 1995 later chair organization strategy committee member council 1996 1997 nygaard coordinator efforts establish european anti-maastricht movement team cooperative network national organizations opposing economic monetary union european union emu maastricht treaty european countries within outside eu team successfully started march 3 1997 kristen nygaard married johanna nygaard 1951 johanna nygaard worked norwegian agency aid developing countries specialized number years recruiting giving administrative support specialists working east africa johanna kristen nygaard three children seven grandchildren nygaard died heart attack 2002 | [
512,
7048,
11020,
10668,
1976,
4799,
4800,
10049,
4930,
70,
8262,
10568,
3529,
5585,
1883,
7775,
9315,
4201,
11242,
2283,
2798,
8057,
2556,
511
] | Validation |
2,483 | 8 | SiteKey:sitekey sitekey web-based security system provides one type mutual authentication end-users websites primary purpose deter phishing sitekey deployed several large financial institutions 2006 including bank america vanguard group bank america vanguard group discontinued use 2015 product owned rsa data security 2006 acquired original maker passmark security sitekey uses following challenge-response technique user phishing site different web site domain legitimate domain user browser refuse send state token step 2 phishing site owner either need skip displaying correct security image prompt user security question obtained legitimate domain pass answers theory could cause user become suspicious since user might surprised re-prompted security questions even used legitimate domain browser recently however practice evidence users generally fail notice anomalies harvard study found sitekey 97 ineffective practice real people n't notice n't care sitekey missing according results also requires users keep track authentication information someone associated n different websites use sitekey must remember n different 4-tuples information site username phrase password may 2015 bank america announced sitekey would discontinued users end year would allow users log username password one step july 2015 vanguard also discontinued use sitekey website | [
6064,
1557
] | Test |
2,484 | 4 | Anthony_Zboralski:anthony zboralski anthony zboralski french hacker artist internet entrepreneur anthony zboralski born martigues france attended parmiter school 1989 1990. 1994 zboralski social engineered fbi connect internet set teleconferences hackers period four months zboralski posed legal attaché paris thomas baker costing fbi 250,000 dollars zboralski part group hackers called w00w00 2011 2013 zboralski worked managing consultant ioactive 2014 zboralski co-founded belua systems limited surfez couvert tv show co-written antoine rivière zboralski zboralski offered practical recommendations protect life 2.0 began airing game one 2013 co-produced flair production mtv networks france | [
8935,
4212,
4956
] | Test |
2,485 | 8 | Common_Gateway_Interface:common gateway interface computing common gateway interface cgi offers standard protocol web servers execute programs execute like console applications also called command-line interface programs running server generates web pages dynamically programs known cgi scripts simply cgis specifics script executed server determined server common case cgi script executes time request made generates html brief http post request client send html form data cgi program via standard input data url paths http header data presented process environment variables 1993 national center supercomputing applications ncsa team wrote specification calling command line executables www-talk mailing list web server developers adopted standard web servers ever since work group chaired ken coar started november 1997 get ncsa definition cgi formally defined work resulted rfc 3875 specified cgi version 1.1 specifically mentioned rfc following contributors historically cgi scripts often written using c language rfc 3875 common gateway interface cgi partially defines cgi using c saying environment variables accessed c library routine getenv variable environ name cgi comes early days web users wanted connect databases web servers cgi program executed server provided common gateway web server database web server runs http server software responds requests web browsers generally http server directory folder designated document collection — files sent web browsers connected server example web server domain name codice_1 document collection stored codice_2 local file system web server respond request codice_3 sending browser pre-written file codice_4 pages constructed fly server software may defer requests separate programs relay results requesting client usually web browser displays page end user early days web programs usually small written scripting language hence known scripts programs usually require additional information specified request instance wikipedia implemented script one thing script would need know whether user logged logged name content top wikipedia page depends information http provides ways browsers pass information web server e.g part url server software must pass information script somehow conversely upon returning script must provide information required http response request http status request document content available document type e.g html pdf plain text et cetera initially different server software would use different ways exchange information scripts result n't possible write scripts would work unmodified different server software even though information exchanged therefore decided establish standard way exchanging information cgi common gateway interface defines common way server software interface scripts webpage generating programs invoked server software operate according cgi standard known cgi scripts standard quickly adopted still supported well-known server software apache iis extension node.js-based servers early use cgi scripts process forms beginning html html forms typically action attribute button designated submit button submit button pushed uri specified action attribute would sent server data form sent query string action specifies cgi script cgi script would executed produces html page web server allows owner configure urls shall handled cgi scripts usually done marking new directory within document collection containing cgi scripts — name often codice_5 example codice_6 could designated cgi directory web server web browser requests url points file within cgi directory e.g. codice_7 instead simply sending file codice_8 web browser http server runs specified script passes output script web browser anything script sends standard output passed web client instead shown on-screen terminal window remarked cgi standard defines additional information passed request passed script instance slash additional directory name appended url immediately name script example codice_9 path stored codice_10 environment variable script called parameters sent script via http get request question mark appended url followed param=value pairs example codice_11 parameters stored codice_12 environment variable script called parameters sent script via http post request passed script standard input script read environment variables data standard input adapt web browser request following perl program shows environment variables passed web server web browser issues request environment variables codice_13 64-bit windows 7 web server running cygwin returns following information variables defined cgi standard codice_10 codice_12 ones starting codice_16 pass information along http request environment seen web browser firefox running windows 7 pc web server apache running system emulates unix cgi script named codice_17 program could generate content write standard output web server transmit browser following environment variables passed cgi programs program returns result web server form standard output beginning header blank line header encoded way http header must include mime type document returned headers supplemented web server generally forwarded response back user simple cgi program written python 3 along html handles simple addition problem doctype html html /html import cgi import cgitb cgitb.enable input_data cgi.fieldstorage print 'content-type text/html html following print leave blank line print h1 addition results /h1 try except print p 0 1 2 /p '.format num1 num2 num1 num2 python 3 cgi gets inputs html adds two numbers together web server supports cgi configured interpret url serves reference cgi script common convention codice_42 directory base directory tree treat executable files within directory security cgi scripts another popular convention use filename extensions instance cgi scripts consistently given extension codice_43 web server configured interpret files cgi scripts convenient required many prepackaged scripts opens server attack remote user upload executable code proper extension case http put posts user-submitted data provided program via standard input web server creates subset environment variables passed adds details pertinent http environment cgi often used process inputs information user produce appropriate output example cgi program one implementing wiki user agent requests name entry web server executes cgi cgi program retrieves source entry page one exists transforms html prints result web server receives input cgi transmits user agent edit page link clicked cgi populates html codice_44 editing control page contents saves back server user submits form calling command generally means invocation newly created process server starting process consume much time memory actual work generating output especially program still needs interpreted compiled command called often resulting workload quickly overwhelm server overhead involved process creation reduced techniques fastcgi prefork interpreter processes running application code entirely within web server using extension modules mod_perl mod_php another way reduce overhead use precompiled cgi programs e.g writing languages c c++ rather interpreted compiled-on-the-fly languages perl php implementing page generating software custom webserver module alternative approaches include optimal configuration web application depends application-specific details amount traffic complexity transaction tradeoffs need analyzed determine best implementation given task time budget web frameworks offer alternative using cgi scripts interact user agents | [
11269,
8204,
9229,
7695,
1556,
7188,
9245,
5663,
7212,
10284,
4658,
10815,
5196,
6229,
7784,
9834,
9841,
4725,
124,
10387,
1692,
2717,
8350,
3744,
8354,
679,
7847,
7338,
3245,
1211,
4797,
11466,
5849,
6366,
8414,
225,
4837,
8941,
1802,
10... | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.