node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
7,486 | 9 | QBasic:qbasic qbasic short form quick beginners purpose symbolic instruction code integrated development environment interpreter variety basic programming languages based quickbasic code entered ide integrated development environment compiled intermediate representation ir ir immediately interpreted demand within ide run nearly versions dos 32-bit versions windows emulation via dosbox/dosemu linux freebsd 64-bit versions windows qbasic dos program requires dos dos emulator windows xp comes emulator called dos virtual machine subsequent versions windows require emulator dosbox time qbasic provided state-of-the-art ide including debugger features on-the-fly expression evaluation code modification supports various inbuilt functions like quickbasic unlike earlier versions microsoft basic qbasic structured programming language supporting constructs subroutines line numbers concept often associated basic supported compatibility considered good form replaced descriptive line labels qbasic limited support user-defined data types structures several primitive types used contain strings text numeric data qbasic intended replacement gw-basic based earlier quickbasic 4.5 compiler without quickbasic compiler linker elements version 1.0 shipped together ms-dos 5.0 higher well windows 95 windows nt 3.x windows nt 4.0 ibm recompiled qbasic included pc dos 5.x well os/2 2.0 onwards ecomstation descended os/2 code includes qbasic 1.0 qbasic 1.1 included ms-dos 6.x without codice_1 windows 95 windows 98 windows starting windows 2000 microsoft longer includes qbasic operating systems still obtained use newer versions windows qbasic well built-in ms-dos editor backwards-compatible dos releases prior 5.0 least dos 3.20 however used 8088/8086 computers 80286 computers qbasic program may run slowly perhaps due dos memory size limits ms-dos 7 ms-dos editor help required qbasic codice_2 codice_3 programs simply started qbasic editor help mode also entered running codice_4 codice_5 codice_6 switches i.e. command lines codice_7 codice_8 qbasic came complete four pre-written example programs nibbles variant snake game gorillas artillery game money manager personal finance manager remline q-basic code line-number-removing program qbasic easter egg see press hold screenprint seen easter egg archive qbasic page | [
6148,
2568,
6154,
7691,
6674,
22,
8729,
8227,
4136,
11315,
6709,
4160,
4674,
4174,
9808,
83,
92,
608,
5733,
8301,
1647,
5747,
6778,
639,
9345,
3718,
6281,
6797,
10387,
10900,
11412,
10902,
11414,
3224,
3736,
4248,
9881,
3233,
7847,
7343,
... | Test |
7,487 | 9 | The_Computer_Language_Benchmarks_Game:computer language benchmarks game computer language benchmarks game formerly called great computer language shootout free software project comparing given subset simple algorithms implemented various popular programming languages project consists due resource constraints small subset common programming languages supported discretion game operator following aspects given implementation measured common see multiple solutions programming language problem highlights within bounds given language solution given either high abstraction memory efficiency fast parallelizes better design choice start include simple toy problems providing different kind programming challenge provides users benchmark game opportunity scrutinize various implementations project known great computer language shootout 2007 port windows maintained separately 2002 2003 sources archived gitlab also older forks github project continuously evolving list supported programming languages updated approximately per annum following market trends users also submit improved solutions problems suggest testing methodology refinement developers highlight fact research exercise caution using microbenchmarks benchmark results uncovered various compiler issues sometimes given compiler failed process unusual otherwise grammatically valid constructs times runtime performance shown expectations prompted compiler developers revise optimization capabilities various research articles based benchmarks results methodology | [
3876,
8582,
2062,
4561,
11219,
5365,
11221,
5567
] | Test |
7,488 | 8 | The_Old_Reader:old reader old reader web-based news aggregator delivers website blog internet content web-based inbox service sprung google removed social features google reader site supports social media sharing including ability like content find friends via social media networks old reader started hobby project elena bulygina dmitry krasnoukhov anton tolchanov march 2013 10,000 users started gaining popularity quickly google announced would retire google reader end april 2013 project already 200,000 users anton quit leaving elena dmitry august 2013 month google reader shut two remaining co-founders struggling keep website running face large influx new users july 29 old reader team stated 420,000 registered users many 60,000 registrations single day team announced intention close public version reader leaving private website limited number people however days later another announcement stated website remain public support unnamed corporate entity united states november 2013 team mentioned new owner levee labs new team invested hardware upgrade changed hosting provider implemented number new features including long-awaited browser bookmarklet founders site publicly rejected ad-based tactics support service new team shares vision order finance operations otherwise free application introduced premium service february 2014 old reader free 100 feeds offers premium version full-text search 500 subscriptions 6 months post storage former users google reader rss readers import feeds via opml export browser bookmarklet lets users send web pages directly old reader account service integrated facebook google help users find friends also using site also support readability instapaper spritz service help read content faster old reader made mobile api freely available facilitate support mobile applications service supported number mobile applications major platforms including reeder feeddler ios greader android longer available 2018 old reader windows phone thor symbian old reader reception generally positive pc magazine praised simple design social aspects noted lacked features competitors.dave winer one creators rss technology pundits praised old reader team commitment open web standards delivering ad-free services although 17 march 2015 service includes sponsored posts inline aggregated content | [
1664,
3971,
8584,
4490,
11274,
10126,
3350,
11418,
11674,
2076,
10270,
1834,
4013,
559,
9908,
10057,
5205,
4310,
5078,
6231,
6237,
735,
10722,
3428,
5605,
8169,
9451,
8557,
9325,
7921,
119,
11000,
5114
] | None |
7,489 | 7 | FinancialForce.com:financialforce.com financialforce cloud-based applications company headquartered san francisco california provides cloud erp solution force.com cloud computing platform salesforce.com financialforce supplies accounting billing professional services automation psa revenue recognition human capital management hcm supply chain management scm applications financialforce founded jeremy roche 2009 investment unit4 salesforce.com resulting cloud accounting system single-ledger design enables real-time financial management built salesforce.com technology platform force.com company started specializing accounting billing solutions built force.com platform therefore making closely coupled salesforce crm applications december 2010 financialforce purchased appirio professional services enterprise pse product later renamed financialforce professional services automation november 2013 financialforce annual customer day company announced acquisitions supply chain management vendor less software human capital management vendor vana workforce intention round back office applications portfolio february 2014 company unveils financialforce erp built salesforce platform financialforce erp connects customers employees partners products single system april 2014 financialforce received 50 million funding advent international march 2015 company receives 110 million funding technology crossover ventures salesforce ventures january 2017 financialforce appointed former salesforce heroku executive tod nielsen ceo president financialforce headquartered san francisco california emea headquarters harrogate england sydney australia covers apac region offices located chicago il manchester nh granada spain portland burlington ontario financialforce supports mobile usage financialforce mobile along force.com mobile application platform supporting iphone ipad well blackberry android november 2013 company introduced financialforce 360° back office mobile app salesforce1 app exchange community live annual conference customers media business strategy product announcements thinkstrategies inc. leading strategic consulting company focused business implications on-demand services market awarded financialforce.com best saas showplace boss award financialforce named 2011 red herring magazine top 100 north america group 100 companies judged publication innovative across north america company since listed 2011 red herring global top 100 identifies 100 innovative companies worldwide financialforce accounting product financialforce accounting named software product year 2013 business finance awards business finance awards 2013 designed recognise excellence business finance alwayson networks named financialforce.com 2013 ondemand 100 winner financialforce.com selected alwayson editorial team industry experts spanning globe based set five criteria innovation market potential commercialization stakeholder value media buzz financialforce ceo jeremy roche chosen forbes best cloud computing companies ceos work 2014 led chro charles ashworth financialforce named eighth annual glassdoor employees ’ choice award best places work 2016 u.s. smb category | [
2208,
1539,
9732,
5224,
11113,
10090,
6539,
1612,
4621,
7532,
10509,
1008,
1680
] | None |
7,490 | 5 | Frequency-division_multiplexing:frequency-division multiplexing telecommunications frequency-division multiplexing fdm technique total bandwidth available communication medium divided series non-overlapping frequency bands used carry separate signal allows single transmission medium cable optical fiber shared multiple independent signals another use carry separate serial bits segments higher rate signal parallel natural example frequency-division multiplexing radio television broadcasting multiple radio signals different frequencies pass air time another example cable television many television channels carried simultaneously single cable fdm also used telephone systems transmit multiple telephone calls high capacity trunklines communications satellites transmit multiple channels data uplink downlink radio beams broadband dsl modems transmit large amounts computer data twisted pair telephone lines among many uses analogous technique called wavelength division multiplexing used fiber-optic communication multiple channels data transmitted single optical fiber using different wavelengths frequencies light multiple separate information modulation signals sent fdm system video signals television channels sent cable tv system called baseband signals source end frequency channel electronic oscillator generates carrier signal steady oscillating waveform single frequency serves carry information carrier much higher frequency baseband signal carrier signal baseband signal combined modulator circuit modulator alters aspect carrier signal amplitude frequency phase baseband signal piggybacking data onto carrier result modulating mixing carrier baseband signal generate sub-frequencies near carrier frequency sum f f difference f − f frequencies information modulated signal carried sidebands side carrier frequency therefore information carried channel narrow band frequencies clustered around carrier frequency called passband channel similarly additional baseband signals used modulate carriers frequencies creating channels information carriers spaced far enough apart frequency band frequencies occupied channel passbands separate channels overlap channels sent transmission medium coaxial cable optical fiber air using radio transmitter long channel frequencies spaced far enough apart none passbands overlap separate channels interfere thus available bandwidth divided slots channels carry separate modulated signal example coaxial cable used cable television systems bandwidth 1000 mhz passband television channel 6 mhz wide room many channels cable modern digital cable systems channel turn subdivided subchannels carry 10 digital television channels destination end cable fiber radio receiver channel local oscillator produces signal carrier frequency channel mixed incoming modulated signal frequencies subtract producing baseband signal channel called demodulation resulting baseband signal filtered frequencies output user long distance telephone connections 20th century telephone companies used l-carrier similar coaxial cable systems carrying thousands voice circuits multiplexed multiple stages channel banks shorter distances cheaper balanced pair cables used various systems including bell system k- n-carrier cables n't allow large bandwidths 12 voice channels double sideband later 24 single sideband multiplexed four wires one pair direction repeaters every several miles approximately 10 km see 12-channel carrier system end 20th century fdm voice circuits become rare modern telephone systems employ digital transmission time-division multiplexing tdm used instead fdm since late 20th century digital subscriber lines dsl used discrete multitone dmt system divide spectrum frequency channels concept corresponding frequency-division multiplexing optical domain known wavelength-division multiplexing commonplace fdm system used example l-carrier uses crystal filters operate 8 mhz range form channel group 12 channels 48 khz bandwidth range 8140 8188 khz selecting carriers range 8140 8184 khz selecting upper sideband group translated standard range 60 108 khz carrier 8248 khz systems used dtl direct line dfsg directly formed super group 132 voice channels 2sg 1g formed using dtl plane modulation frequency plan given fig1 fig2 use dtl technique allows formation maximum 132 voice channels placed direct line dtl eliminates group super group equipment dfsg take similar steps direct formation number super groups obtained 8 khz dfsg also eliminates group equipment offer dtl dfsg fit requirement low density system using dtl higher density system using dfsg dfsg terminal similar dtl terminal except instead two super groups many super groups combined mastergroup 600 channels 10 super-groups example based dfsg fdm also used combine signals final modulation onto carrier wave case carrier signals referred subcarriers example stereo fm transmission 38 khz subcarrier used separate left-right difference signal central left-right sum channel prior frequency modulation composite signal analog ntsc television channel divided subcarrier frequencies video color audio dsl uses different frequencies voice upstream downstream data transmission conductors also example frequency duplex frequency-division multiplexing used allow multiple users share physical communications channel called frequency-division multiple access fdma fdma traditional way separating radio signals different transmitters 1860s 70s several inventors attempted fdm names acoustic telegraphy harmonic telegraphy practical fdm achieved electronic age meanwhile efforts led elementary understanding electroacoustic technology resulting invention telephone | [
10112,
2306,
388,
8708,
3847,
2057,
10381,
1550,
6290,
11288,
2458,
5020,
5664,
11686,
1192,
5162,
3115,
7723,
11181,
1967,
2992,
1969,
2994,
5304,
1083,
448,
3140,
7108,
9284,
11591,
5321,
6857,
2891,
7498,
3959,
9296,
3156,
2911,
3040,
... | None |
7,491 | 4 | Hack.lu:hack.lu hack.lu also written hacklu yearly computer security conference held luxembourg brings together variety people interested information security organized computer incident response center luxembourg circl country cert private sector communes non-governmental entities first conference organized 2005 held 10th edition 2014 scope european information security conferences hack.lu one oldest conferences running conferences often provide day-long training sessions hack.lu chooses different model filling first days workshops enforcing strong focus practical things aim convention make bridge various actors computer security world discussing presenting topics like computer security privacy information technology cultural/technical implication society since first conference capture flag event organized recent years fluxfingers ruhr-university bochum event organizers 5th time 2014 event usually lasts 48h possibility participate remotely teams one person physically present able claim prize 400 people participated 2013 | [
7449,
10190,
10894,
1017,
5373,
2558
] | None |
7,492 | 2 | List_of_open-source_mobile_phones:list open-source mobile phones list mobile phones open-source operating systems available mobile phones proprietary baseband chip gsm module open-source baseband project osmocombb project based illicit leaked source code calypso modem called freecalypso android-based devices appear list heavy use proprietary components particularly drivers applications numerous versions android lineageos successor now-defunct cyanogenmod freedom-respecting replicant installed large number phones after-market webos initially available proprietary license source code later released free license hp still open webos run webos devices sailfish os proprietary user interface atop mer software distribution main components make open mobile phone postmarketos ubports kde neon open-source distributions running existing smartphones originally running android maemo leste available nokia n900 motorola droid 4 possible home-build phone partially open hardware software arduinophone touchscreen mit diy cellphone segmented display use arduino open-hardware single-board computer added components piphone zerophone similar based raspberry pi | [
1537,
3585,
2308,
5637,
6,
6276,
8196,
9732,
10884,
11271,
4364,
9356,
3089,
1682,
405,
10393,
5019,
7579,
6301,
5406,
4383,
673,
6178,
3626,
10109,
7727,
3248,
7857,
9266,
7991,
9784,
1849,
1083,
2111,
1728,
5824,
1602,
10820,
2759,
1107... | Validation |
7,493 | 8 | Optimizely:optimizely optimizely american company makes customer experience optimization software companies optimizely platform technology provides a/b testing tools two versions web page compared performance multivariate testing optimizely also enables personalization may used making data-driven decisions personalization capability used serving online advertising company headquarters san francisco california offices amsterdam netherlands cologne germany london united kingdom sydney australia optimizely founded 2010 dan siroker pete koomen formerly google optimizely completed combinator program winter 2010 november 2010 optimizely closed us 1.2 million funding round angel investors company became cash flow positive 2011 may 2012 optimizely announced raised new funding battery ventures google ventures interwest partners april 2013 optimizely raised 28 million series round funding round led benchmark participation bain capital ventures optimizely existing investors battery ventures interwest partners google ventures benchmark peter fenton joined optimizely board directors part larger international expansion plan optimizely announced april 2013 launch platform nine additional languages danish dutch french german italian japanese portuguese spanish swedish april 17 optimizely held first opticon user conference announced launch new mobile app a/b testing software may 2014 optimizely raised 57 million series b funding round led andreessen horowitz participation benchmark bain capital ventures part round scott weiss general partner andreessen horowitz joined optimizely board directors october 2015 company released second product mobile website personalization month optimizely raised 58 million series c funding led index ventures participation firms andreessen horowitz bain capital ventures battery ventures benchmark capital citi ventures danhua capital salesforce ventures tenaya capital part round ilya fushman index joined optimizely board directors march 10 2016 optimizely laid 40 employees 10 workforce september 2016 company released optimizely x expanded solutions web experimentation personalization recommendations mobile full stack ott july 2017 jay larson replaced dan siroker company ceo pete koomen company cto 2012 co-founder dan joseph siroker became company executive chairman july 2017 optimizely experimentation platform called optimizely x tools web experimentation personalization recommendations mobile full stack over-the-top content optimization delivered software service saas model opticon user conference organized optimizely focused web experience optimization first opticon conference held april 17 2014 san francisco optimizely announced mobile a/b testing product second opticon conference held june 17 18 2015 also san francisco announced new personalization product marc andreessen keynote speaker | [
10090,
467,
7493,
679
] | Validation |
7,494 | 9 | James_G._Mitchell:james g. mitchell james george jim mitchell born 25 april 1943 canadian computer scientist worked programming language design implementation fortran watfor mesa euclid c++ java interactive programming systems dynamic interpretation compilation document preparation systems user interface design distributed transactional file systems distributed object-oriented operating systems also worked design hardware computer graphics high-level language execution audio input/output mitchell born kitchener ontario canada april 25 1943 grew cambridge ontario graduated degree mathematics university waterloo 1966 mitchell began working computers 1962 student university waterloo three undergraduates developed fast compiler fortran programming language known watfor waterloo fortran ibm 7040 computer project initiated professor j. wesley graham established waterloo early reputation centre software computer science research helping first generation computer science majors learn program graduated phd computer science carnegie-mellon university 1970 dissertation titled conversational programming lcc 1971-84 mitchell xerox palo alto research center eventually became xerox fellow 1980–81 senior visiting fellow university cambridge computer laboratory head research development acorn computers u.k. managed development first arm risc chip president acorn research centre palo alto california mitchell joined sun microsystems 1988 charge spring distributed object-oriented operating system research sun microsystems laboratories sunsoft subsidiary became vice president technology architecture javasoft division chief technology officer java consumer embedded products later vice president charge sun microsystems laboratories subsequently became principal investigator darpa/sun hpcs high productivity computing systems program oracle corporation acquired sun microsystems 2010 appointed vice president photonics interconnects packaging oracle labs march 1 2014 mitchell retired oracle labs board directors curci foundation funds research life sciences 1997 awarded j.w graham medal computing innovation university waterloo 2008 awarded fr norm choate cr distinguished alumni award st. jerome university | [
1952,
9665,
8262,
9964,
5677,
2830,
242,
7158,
3960
] | None |
7,495 | 3 | Eagle_Computer:eagle computer eagle computer los gatos california early microcomputer manufacturing company spun audio-visual laboratories avl first sold line popular cp/m computers highly praised computer magazines day ibm pc launched eagle produced eagle 1600 series ran ms-dos true clones became evident buying public wanted actual clones ibm pc even non-clone better features eagle responded line clones including portable eagle pcs always rated highly computer magazines avl eagle ii audio-visual connectors back separate company eagle sold eagle ii iii iv v computer models external scsi/sasi hard-disk boxes called file 10 file 40 first eagle computers produced audio visual labs avl company founded chuck kappenman new jersey early 1970s produce proprietary large-format multi-image equipment kappenman introduced world first microprocessor-controlled multi-image programming computers showpro iii v dedicated controllers 1980 avl introduced first non-dedicated controller eagle first eagle computer used 16 khz processor 5-inch disk drive online storage eagle ran procall pro grammable c omputer udio-visual l anguage l ibrary software writing cues control 30 ektagraphic projectors five 16 mm film projectors 20 auxiliary control points digital control data sourced via rca xlr-type audio connector rear unit avl proprietary clocktrak biphase digital timecode similar incompatible smpte timecode sourced control channel multitrack analog audio tape deck timed list events eagle synchronized clocktrak later versions procall included option using smpte timecode programmers abandoned clocktrak smpte multi-image programs began incorporate video two separate digital data streams output eagle also via rca xlr-type audio connectors telemetry streams called positrak controlled five external slide projector control devices also manufactured avl known doves dove units received biphase data eagle via audio cables interpreted eagle data streams control many three kodak ektagraphic projectors large screens compatible xenon-lamped projectors two dry-closure contacts per dove unit avl also made raven device similar dove comprehensive control single 16 mm film projector well numerous external control devices lighting sound video projectors sources etc avl eagles associated products properly set powered extremely reliable 1970s early 1990s products competitors reliable readily available avl became industry standard multi-image control equipment however development large-screen electronic media hdtv ushered era film-based multi-image productions cp/m eagles basic design except storage devices exception portable model keyboard formed removable lid could snapped main unit traveling attractive off-white case held entire computer top section held green monochrome monitor left one two full-height storage devices stacked one right anti-glare screen held place front monitor front top section shut black plastic bezel bezel snapped place back section held fan right behind drive enclosure silver label behind monitor company logo address model number serial number voltage frequency current bottom section projected forward keyboard top system logo inside clamshell main circuit board connected monitor drives keyboard ports cables underneath main board connected cables xebec hard-disk controller card back clamshell reset button two rs-232 serial ports labeled serial serial b centronics parallel port labeled parallel sasi port labeled parallel b brightness knob monitor on/off switch keyboard well-designed keys black white lettering besides full typewriter keyboard complete ten-key number pad right uncommon time labels front number keys typewriter keyboard keys number pad denoted function keys performed command mode bundled spellbinder software cpu whole line 4-mhz zilog z80a standard microprocessor day memory 64k ram standard cp/m 2.2 operating system could address 8-bit chip also available external hard-disk units called file 10 file 40 metal corvus boxes fan power switch back inside file 10 hard disk eagle iv eagle sasi card power supply file 40 32 mb hard disk eagle v. upgrade eagle iii instance user could buy file 40 connect parallel b port back eagle ribbon cable came turn file 40 turn eagle file 10 file 40 attached turned eagle ii iii turned computer booted hard disk external box even bootable floppy disk floppy-disk drive eagle iii file 10 attached hard-disk storage eagle iv two floppy-disk drives instead one similarly file 40 attached functionally eagle v extra floppy-disk drive original avl eagle s-100 8080 computer separate boards avl multi-image interface intel 8080 cpu floppy drive interface 16kb memory cards standard machines one extra 16kb memory boards available could afford one boot floppy offer run anything procall unless paid one run electric pencil word processor eagles easy open easy upgrade difference eagle eagle ii instance number floppy-disk drives adding right drives hard disk sasi card extra power supply could upgraded ii iii iv v iii could become iv v iv could become v. half-height floppy-disk drives hard disks became available eagle drives worn could replaced ones took less space drew less power eagle bios supported two double-sided floppy-disk drives four 8 mb hard-disk partitions systems could built two half-height floppies 10 20 32 mb hard disk system two floppies 10 mb hard disk jokingly called iv plus one 20 mb hard disk called 4 half however many floppies see whether would work eagle computer users group members mounted two half-height 10-mb hard disks eagle attached sasi card cards connected xebec controller iv two worked perfectly waste resources eagle sasi card rarest hardest-to-find part computer since eagle made eagles begin computer hobbyists continued improve cp/m various ways even digital research longer business computer said running z-system rather cp/m cp/m ccp replaced zcpr similar command processor bdos replaced zrdos z3dos could done manually source code bios available automatically various packages one long-term concern eagles loud hard disks seemed hunt whenever reading writing data nz-com alpha systems corporation allowed hard disk eagle iv run quickly quietly observation confirmed whenever eagle z-system installed software cp/m eagles came 5.25 floppy disks customers bought eagle iv eagle v file 10 file 40 software already installed bios cp/m consisted three parts two never changed copyrighted digital research third part bios interface operating system hardware varied systems different computer manufacturers sometimes different models company bios written manufacturer copyrighted company three eagle bioses disk formats format floppy disks hard disks defined bios every manufacturer cp/m computer eagle kept simple single-sided floppy-disk format double-sided one furthermore identical one side double-sided format filled whole first side like single-sided format continued second side efficient first writing one track one side disk one track moving drive head next track done deliberately make two formats alike possible customer upgraded ii iii iv v need copy old disks format new machine one hard-disk format format program required hard disk right number heads platters cylinders numerous makes models 10 20 32 mb hard disks met requirement program formatted hard disk 8 megabytes time cp/m limit logical disk drive successfully finished four partitions quit suddenly ran hard disk thus 10 mb hard disk 8 mb partition 2 mb partition 20 mb hard disk two 8 mb partitions one 4 mb partition 32 mb hard disk four 8 mb partitions iv 2 mentioned four partitions 8 mb 2 mb 8 mb 2 mb drive letters cp/m drive booted drive whether floppy disk hard disk addition double-sided eagles addressed single-sided floppies drive j drive letter applied device change given system modifying systems could confusing eagle booted file 10 file 40 file 20 file 10 file 40 box 20-mb hard disk inside drive-letter assignments hard-disk bios prevailed external hard disk partitions would b file 10 b c file 20 b c file 40 top floppy would e bottom one f j unless single-sided floppies could j since hard-disk bios addressed four hard-disk partitions eagle iv file 10 attached would address two partitions file 10 b two eagle c d. file 20 attached external partitions would b c 8 mb internal partition would internal partition could n't used similarly file 40 attached partitions hard disk eagle could read written available hard-disk partitions assigned file 40 utilities standard cp/m utilities included pip copy files etc dri sophisticated compiled basic programming language cbasic also included every cp/m computer manufacturer supplied additional software utilities much way linux distributions add installer etc standard kernel libraries eagles spellbinder lexisoft powerful word processor highly configurable even built-in programming language automating tasks eagle computers came version spellbinder already configured many functions already assigned keys keys labels fronts show spellbinder functions configuration needed set given printer printers meant choosing printer list combination spellbinder software eagle keyboard large storage capacity eagle floppies made word-processing machine powerful day many eagle owners never realized much computers capable eagles marketed business machines financial software part package originally accounting plus professional bookkeeping system large took six eagle double-sided 784 kb floppy disks hold required constant disk swapping eagle without hard disk constant protests questions requests customer support led eagle stop bundling accounting plus computers users simply n't need ultracalc spreadsheet program sorcim substituted later machines eagles early enough come accounting plus whether made avl eagle two black binders documentation one labeled accounting accounting plus manual binder labeled users guide contained everything else br procall programmable computer audio-visual language library see description software earlier article later eagles single white binder eagle logo across top spine eagle software manual along manual written eagle told use computer including spellbinder ultracalc without distinguishing eagle software lexisoft sorcim mentors eagle computer user group meetings would often explain fact separate programs computer written separate companies manual menu system looked like one big program new computer user thing documentation binder thin spiral-bound book called cp/m primer gave superficial idea operating system format disks using forth vendors would often throw digital research cp/m 2.2 user guide cbasic user guide good book cp/m mastering cp/m cp/m handbook mp/m n't part standard eagle documentation confusing marketing move eagle renamed 8-bit cp/m line time introduced first 16-bit computers prior change logo keyboard announced computer model eagle ii iii iv v. however eagle consolidated entire line eagle iie series resulted labels indicating differentiation five 8-bit models silver label back machine specified individual model iie-1 iie-2 iie-3 iie-4 iie-5 corresponding previously-named eagle ii iii iv v. causes failure may expected computer built way chips attached boards sockets rather soldered may loose expanded heat whenever computer long time contracted whenever computer turned computer used great deal long time may require new owner open gently press chips run another problem sometimes found old eagles hard disks stiction hard disk read/write heads era rested platter turned may adhere sitting greater force drive motor exert starting experienced technician may able coax head free without destroying hard disk losing data common problem peculiar cp/m eagles involves character generator chip main board tends fail age line text dots letters scattered unreadably screen problem became apparent chip longer made still available parts warehouses eagle 1600 series computers runs ms-dos fully pc compatible first pcs based fully 16-bit intel 8086 processor rather intel 8088 uses 16 bits internally 8-bit external interface eagle attempted create niche brand-new 16-bit market building machines easy use cp/m models intel cpu 640 kb ram memory almost pc time offer computers came ms-dos pc version spellbinder pc spreadsheet program documentation.they run many pc programs including lotus 1-2-3 concurrent cp/m-86 time pc programs recent ports cp/m little agreement standards fact 1600s ibm clones means games expect exactly video hardware ibm pc call pc hardware pc rom bios directly sake speed run ran poorly 1600 line also first computers ms-dos hard disks eagle achieved using hard-disk subsystem xebec hard-disk controller card eagle sasi card hard disk cp/m models subdirectories supported ms-dos version eagles used cp/m ms-dos offer cp/m 16 numbered user zones either limits usefulness hard disks eagle also one first manufacturers clones ibm pc eagle pc introduced 1982 enhanced 752 × 352 graphics compared ibm pc 640 × 200 resolution quieter need cooling fan pc 2 followed screen resolution downgraded match ibm pc later eagle spirit portable came eagle turbo spellbinder renamed eaglewriter eagle pcs spreadsheet program called eaglecalc actual changes made either program june 8 1983 day eagle initial public offering made multimillionaire president ceo dennis barnhart died crash ferrari test driving ronald mickwee became president ceo death underwriters reversed ipo refunding money investors paid stock held another ipo months later unprecedented pc industry dramatic timing led people suppose event caused end eagle company continued lead pc sales ibm launched lawsuit pc clone manufactures like eagle corona data systems handwell corporation claiming copyright infringement bios code companies named settled court agreeing re-implement bios way violate ibm copyrights led companies like phoenix technologies offer pc clone manufacturers bioses written following clean room design concomitantly lawsuits ibm slashed prices products discussing perspectives smaller pc firms like eagle one morgan stanley analyst quoted june 9 1984 issue new york times saying operating 5 percent pretax margins room price cuts eagle rewrote bios never regained lost sales pioneering effort time initiative launched create new market selling eagle systems china effort eventually fell company like many others affected bios copyright restrictions ultimately unable recover business 1986 eagle computer user group san jose california primary eagle user group drew attendees san francisco bay area monthly meetings eagle users united states paid dues got newsletter meetings generally consisted experienced eagle owners showing others use advanced features bundled software configuring printers actual presentations rare welcome another user group called screaming eagles two groups sent newsletters every month | [
3522,
10692,
1515,
1324,
8301,
9166,
1776,
3056,
4337,
6129,
823,
4409,
6778,
3323
] | None |
7,496 | 2 | Outline_of_iOS:outline ios following outline provided overview topical guide ios ios – mobile operating system developed distributed apple inc originally released 2007 iphone ipod touch since extended support apple devices ipad apple tv unlike windows ce mobile phone android apple license ios installation non-apple hardware history iphone | [
10755,
9732,
5647,
7697,
11289,
6186,
4139,
6700,
1074,
8754,
9784,
8253,
8783,
4180,
10838,
1623,
3672,
3681,
9826,
8806,
2673,
2686,
6783,
10878,
3228,
2207,
11430,
2735,
3248,
4283,
3772,
7869,
2259,
3286,
9430,
3293,
4318,
6884,
2282,
... | Test |
7,497 | 2 | Supercomputer_operating_systems:supercomputer operating systems since end 20th century supercomputer operating systems undergone major transformations fundamental changes occurred supercomputer architecture early operating systems custom tailored supercomputer gain speed trend moving away in-house operating systems toward form linux running supercomputers top500 list november 2017 given modern massively parallel supercomputers typically separate computations services using multiple types nodes usually run different operating systems different nodes e.g. using small efficient lightweight kernel compute node kernel cnk compute node linux cnl compute nodes larger system linux-derivative server input/output i/o nodes traditional multi-user computer system job scheduling effect tasking problem processing peripheral resources massively parallel system job management system needs manage allocation computational communication resources well gracefully dealing inevitable hardware failures tens thousands processors present although modern supercomputers use linux operating system manufacturer made specific changes linux-derivative use industry standard exists partly differences hardware architectures require changes optimize operating system hardware design early days supercomputing basic architectural concepts evolving rapidly system software follow hardware innovations usually took rapid turns early systems operating systems custom tailored supercomputer gain speed yet rush develop serious software quality challenges surfaced many cases cost complexity system software development became much issue hardware 1980s cost software development cray came equal spent hardware trend partly responsible move away in-house operating systems adaptation generic software first wave operating system changes came mid 1980s vendor specific operating systems abandoned favor unix despite early skepticism transition proved successful early 1990s major changes occurring supercomputing system software time growing use unix begun change way system software viewed use high level language c implement operating system reliance standardized interfaces contrast assembly language oriented approaches past hardware vendors adapted unix systems new useful features added unix e.g. fast file systems tunable process schedulers however companies adapted unix made unique changes rather collaborating industry standard create unix supercomputers partly differences architectures required changes optimize unix architecture thus general purpose operating systems became stable supercomputers began borrow adapt critical system code relied rich set secondary functions came reinvent wheel however time size code general purpose operating systems growing rapidly time unix-based code reached 500,000 lines long maintenance use challenge resulted move use microkernels used minimal set operating system functions systems mach carnegie mellon university chorusos inria examples early microkernels separation operating system separate components became necessary supercomputers developed different types nodes e.g. compute nodes versus i/o nodes thus modern supercomputers usually run different operating systems different nodes e.g. using small efficient lightweight kernel cnk cnl compute nodes larger system linux-derivative server i/o nodes cdc 6600 generally considered first supercomputer world ran chippewa operating system deployed various cdc 6000 series computers chippewa rather simple job control oriented system derived earlier cdc 3000 influenced later kronos scope systems first cray 1 delivered los alamos lab operating system software los alamos developed application software operating system main timesharing system cray 1 cray time sharing system ctss developed livermore labs direct descendant livermore time sharing system ltss cdc 6600 operating system twenty years earlier developing supercomputers rising software costs soon became dominant evidenced 1980s cost software development cray growing equal cost hardware trend partly responsible move away in-house cray operating system unicos system based unix 1985 cray 2 first system ship unicos operating system around time eos operating system developed eta systems use eta10 supercomputers written cybil pascal-like language control data corporation eos highlighted stability problems developing stable operating systems supercomputers eventually unix-like system offered machine lessons learned developing eta system software included high level risk associated developing new supercomputer operating system advantages using unix large extant base system software libraries middle 1990s despite extant investment older operating systems trend toward use unix-based systems also facilitated use interactive graphical user interfaces guis scientific computing across multiple platforms move toward commodity os opponents cited fast pace focus linux development major obstacle adoption one author wrote linux likely catch large-scale systems nevertheless trend continued gain momentum 2005 virtually supercomputers used unix-like os variants unix included ibm aix open source linux system adaptations unicos cray end 20th century linux estimated command highest share supercomputing pie ibm blue gene supercomputer uses cnk operating system compute nodes uses modified linux-based kernel called i/o node kernel ink i/o nodes cnk lightweight kernel runs node supports single application running single user node sake efficient operation design cnk kept simple minimal physical memory statically mapped cnk neither needing providing scheduling context switching cnk even implement file i/o compute node delegates dedicated i/o nodes however given blue gene multiple compute nodes share single i/o node i/o node operating system require multi-tasking hence selection linux-based operating system traditional multi-user computer systems early supercomputers job scheduling effect task scheduling problem processing peripheral resources massively parallel system job management system needs manage allocation computational communication resources essential tune task scheduling operating system different configurations supercomputer typical parallel job scheduler master scheduler instructs number slave schedulers launch monitor control parallel jobs periodically receives reports status job progress supercomputer schedulers attempt maintain locality job execution pbs pro scheduler used cray xt3 cray xt4 systems attempt optimize locality three-dimensional torus interconnect simply uses first available processor hand ibm scheduler blue gene supercomputers aims exploit locality minimize network contention assigning tasks application one midplanes 8x8x8 node group slurm workload manager scheduler uses best fit algorithm performs hilbert curve scheduling optimize locality task assignments several modern supercomputers tianhe-2 use slurm arbitrates contention resources across system slurm open source linux-based scalable manage thousands nodes computer cluster sustained throughput 100,000 jobs per hour | [
8447,
7812,
1031,
7432,
7561,
3978,
9991,
1933,
1168,
785,
10641,
7187,
7699,
5397,
11027,
7963,
6815,
5798,
9126,
6184,
2345,
10411,
4909,
7983,
7218,
8242,
8501,
823,
5948,
4286,
2113,
8514,
5956,
11205,
4423,
1480,
1866,
8523,
5452,
43... | None |
7,498 | 5 | Channel_access_method:channel access method telecommunications computer networks channel access method multiple access method allows two terminals connected transmission medium transmit share capacity examples shared physical media wireless networks bus networks ring networks point-to-point links operating half-duplex mode channel access method based multiplexing allows several data streams signals share communication channel transmission medium context multiplexing provided physical layer channel access method also based multiple access protocol control mechanism also known medium access control mac medium access control deals issues addressing assigning multiplex channels different users avoiding collisions media access control sub-layer data link layer osi model component link layer tcp/ip model channel access schemes generally fall following categories frequency-division multiple access fdma channel-access scheme based frequency-division multiplexing fdm scheme provides different frequency bands different data streams fdma case frequency bands allocated different nodes devices example fdma systems first-generation 1g cell-phone systems phone call assigned specific uplink frequency channel another downlink frequency channel message signal phone call modulated specific carrier frequency related technique wavelength division multiple access wdma based wavelength-division multiplexing wdm different data streams get different colors fiber-optical communications wdma case different network nodes bus hub network get different color advanced form fdma orthogonal frequency-division multiple access ofdma scheme example used 4g cellular communication systems ofdma node may use several sub-carriers making possible provide different quality service different data rates different users assignment sub-carriers users may changed dynamically based current radio channel conditions traffic load single-carrier fdma sc-fdma a.k.a linearly-precoded ofdma lp-ofdma based single-carrier frequency-domain-equalization sc-fde time-division multiple access tdma channel access scheme based time-division multiplexing tdm scheme tdma provides different time slots different transmitters cyclically repetitive frame structure example node 1 may use time slot 1 node 2 time slot 2 etc last transmitter starts advanced form dynamic tdma dtdma assignment transmitters time slots vary one frame multi-frequency time-division multiple access mf-tdma combines time frequency multiple access example 2g cellular systems based combination tdma fdma frequency channel divided eight time slots seven used seven phone calls one signalling data statistical time division multiplexing multiple access typically also based time-domain multiplexing cyclically repetitive frame structure due random character categorised statistical multiplexing methods capable dynamic bandwidth allocation requires media access control mac protocol i.e principle nodes take turns channel avoid collisions common examples csma/cd used ethernet bus networks hub networks csma/ca used wireless networks ieee 802.11 code division multiple access cdma scheme based spread spectrum meaning wider radio channel bandwidth used data rate individual bit streams requires several message signals transferred simultaneously carrier frequency utilizing different spreading codes per shannon–hartley theorem wide bandwidth makes possible send signal-to-noise ratio much less 1 less 0 db meaning transmission power reduced level level noise co-channel interference message signals sharing frequency range one form direct-sequence cdma ds-cdma based direct-sequence spread spectrum dsss used example 3g cell phone systems information bit symbol represented long code sequence several pulses called chips sequence spreading code message signal example phone call uses different spreading code another form frequency-hopping cdma fh-cdma based frequency-hopping spread spectrum fhss channel frequency changed rapidly according sequence constitutes spreading code example bluetooth communication system based combination frequency-hopping either csma/ca statistical time division multiplexing communication data communication applications tdma audio transmission nodes belonging user piconet use frequency hopping sequence synchronously meaning send frequency channel cdma/ca tdma used avoid collisions within vpan frequency-hopping used bluetooth reduce cross-talk collision probability nodes different vpans techniques include orthogonal frequency-hopping multiple access ofhma multi-carrier code division multiple access mc-cdma space-division multiple access sdma transmits different information different physical areas examples include simple cellular radio systems advanced cellular systems use directional antennas power modulation refine spatial transmission patterns power-division multiple access pdma scheme based using variable transmission power users order share available power channel examples include multiple scpc modems satellite transponder users get demand larger share power budget transmit higher data rates following examples packet mode channel access methods methods used dividing forward reverse communication channels known duplexing methods examples common statistical time-division multiplexing multiple access protocols wired multi-drop networks examples common multiple access protocols may used packet radio wireless networks note hybrids techniques frequently used examples local area networks lans metropolitan area networks mans multiple access methods enable bus networks ring networks hubbed networks wireless networks half duplex point-to-point communication required full duplex point-to-point serial lines network switches routers switched networks logical star topology common multiple access method csma/cd used ethernet although today ethernet installations typically switched csma/cd utilized anyway achieve compatibility hubs satellite communications multiple access capability communications satellite function portion communications link one pair satellite terminals concurrently three types multiple access presently used communications satellites code-division frequency-division time-division multiple access telecommunication switching centers multiple access connection user two switching centers separate access lines using single message routing indicator telephone number several ways categorizing multiple-access schemes protocols used literature example daniel minoli 2009 identifies five principal types multiple-access schemes fdma tdma cdma sdma random access r. rom m. sidi 1990 categorize protocols conflict-free access protocols aloha protocols carrier sensing protocols telecommunications handbook terplan morreale 2000 identifies following mac categories | [
10112,
4609,
2306,
388,
8708,
3847,
2057,
1550,
10005,
5270,
11288,
2458,
5020,
5664,
1192,
11560,
7723,
11181,
1969,
2994,
7865,
1083,
7490,
3140,
9284,
11591,
5321,
6857,
5581,
9038,
4691,
2911,
3168,
2785,
8160,
2787,
5092,
5863,
7400,
... | None |
7,499 | 3 | Paxos_(computer_science):paxos computer science paxos family protocols solving consensus network unreliable processors processors may fail consensus process agreeing one result among group participants problem becomes difficult participants communication medium may experience failures consensus protocols basis state machine replication approach distributed computing suggested leslie lamport surveyed fred schneider state machine replication technique converting algorithm fault-tolerant distributed implementation ad-hoc techniques may leave important cases failures unresolved principled approach proposed lamport et al ensures cases handled safely paxos protocol first published 1989 named fictional legislative consensus system used paxos island greece later published journal article 1998 paxos family protocols includes spectrum trade-offs number processors number message delays learning agreed value activity level individual participants number messages sent types failures although deterministic fault-tolerant consensus protocol guarantee progress asynchronous network result proved paper fischer lynch paterson paxos guarantees safety consistency conditions could prevent making progress difficult provoke paxos usually used durability required example replicate file database amount durable state could large protocol attempts make progress even periods bounded number replicas unresponsive also mechanism drop permanently failed replica add new replica topic predates protocol 1988 lynch dwork stockmeyer demonstrated solvability consensus broad family partially synchronous systems paxos strong similarities protocol used agreement viewstamped replication first published oki liskov 1988 context distributed transactions notwithstanding prior work paxos offered particularly elegant formalism included one earliest proofs safety fault-tolerant distributed consensus protocol reconfigurable state machines strong ties prior work reliable group multicast protocols support dynamic group membership example birman work 1985 1987 virtually synchronous gbcast protocol however noted gbcast unusual supporting durability addressing partitioning failures reliable multicast protocols lack properties required implementations state machine replication model point elaborated paper lamport malkhi zhou paxos protocols members theoretical class solutions problem formalized uniform agreement crash failures lower bounds problem proved keidar shraer derecho c++ software library cloud-scale state machine replication offers paxos protocol integrated self-managed virtually synchronous membership protocol matches keidar shraer optimality bounds maps efficiently modern remote dma rdma datacenter hardware uses tcp rdma available order simplify presentation paxos following assumptions definitions made explicit techniques broaden applicability known literature covered article general consensus algorithm make progress using formula_1 processors despite simultaneous failure formula_2 processors words number non-faulty processes must strictly greater number faulty processes however using reconfiguration protocol may employed survives number total failures long f fail simultaneously paxos describes actions processors roles protocol client acceptor proposer learner leader typical implementations single processor may play one roles time affect correctness protocol—it usual coalesce roles improve latency and/or number messages protocol quorums express safety consistency properties paxos ensuring least surviving processor retains knowledge results quorums defined subsets set acceptors two subsets two quorums share least one member typically quorum majority participating acceptors example given set acceptors b c majority quorum would three acceptors b c c b b c generally arbitrary positive weights assigned acceptors case quorum defined subset acceptors summary weight greater half total weight acceptors attempt define agreed value v performed proposals may may accepted acceptors proposal uniquely numbered given proposer e.g. proposal may form n v n unique identifier proposal v actual proposed value value corresponding numbered proposal computed part running paxos protocol need order guarantee safety also called consistency paxos defines three properties ensures always held regardless pattern failures deployments paxos participating process acts three roles proposer acceptor learner reduces message complexity significantly without sacrificing correctness merging roles protocol collapses efficient client-master-replica style deployment typical database community benefit paxos protocols including implementations merged roles guarantee safety properties typical implementation message flow covered section multi-paxos protocol basic paxos family instance execution basic paxos protocol decides single output value protocol proceeds several rounds successful round 2 phases phase 1 divided parts b phase 2 divided parts b see description phases remember assume asynchronous model e.g processor may one phase another processor may another accept message interpreted request accept proposal please note acceptor accept multiple proposals happen another proposer unaware new value decided starts new round higher identification number n case acceptor promise later accept new proposed value even though accepted another one earlier proposals may even different values presence certain failures however paxos protocol guarantee acceptors ultimately agree single value following diagrams represent several cases/situations application basic paxos protocol cases show basic paxos protocol copes failure certain redundant components distributed system note values returned promise message null first time proposal made since acceptor accepted value round diagram 1 client 1 proposer 3 acceptors i.e quorum size 3 2 learners represented 2 vertical lines diagram represents case first round successful i.e process network fails v last va vb vc simplest error cases failure acceptor quorum acceptors remains alive failure redundant learner cases protocol requires recovery i.e still succeeds additional rounds messages required shown next two diagrams/cases following diagram one acceptors quorum fails quorum size becomes 2 case basic paxos protocol still succeeds following case one redundant learners fails basic paxos protocol still succeeds case proposer fails proposing value agreement reached specifically fails middle accept message one acceptor quorum receives value meanwhile new leader proposer elected shown detail note 2 rounds case rounds proceed vertically top bottom complex case multiple proposers believe leaders instance current leader may fail later recover proposers already re-selected new leader recovered leader learned yet attempts begin one round conflict current leader diagram 4 unsuccessful rounds shown could suggested bottom diagram typical deployment paxos requires continuous stream agreed values acting commands distributed state machine command result single instance basic paxos protocol significant amount overhead would result leader relatively stable phase 1 becomes unnecessary thus possible skip phase 1 future instances protocol leader achieve round number included along value incremented round leader multi-paxos reduces failure-free message delay proposal learning 4 delays 2 delays following diagram one instance execution basic paxos protocol initial leader proposer shown note multi-paxos consists several instances basic paxos protocol v last va vb vc case subsequence instances basic paxos protocol represented i+1 use leader phase 1 subsequent instances basic paxos protocol consist prepare promise sub-phases skipped note leader stable i.e crash change common deployment multi-paxos consists collapsing role proposers acceptors learners servers end clients servers following diagram represents first instance basic paxos protocol roles proposer acceptor learner collapsed single role called server subsequent instances basic paxos protocol leader previous instances basic paxos protocol phase 1 skipped number optimisations performed reduce number exchanged messages improve performance protocol etc optimisations reported cheap paxos extends basic paxos tolerate f failures f+1 main processors f auxiliary processors dynamically reconfiguring failure reduction processor requirements comes expense liveness many main processors fail short time system must halt auxiliary processors reconfigure system stable periods auxiliary processors take part protocol two processors p q one processor distinguish failure processor failure communication medium third processor needed however third processor participate choosing sequence commands must take action case p q fails nothing either p q continues operate system third processor therefore small/slow/cheap one processor primarily devoted tasks example involving three main acceptors one auxiliary acceptor quorum size three showing failure one main processor subsequent reconfiguration fast paxos generalizes basic paxos reduce end-to-end message delays basic paxos message delay client request learning 3 message delays fast paxos allows 2 message delays requires 1 system comprised 3f+ 1 acceptors tolerate f faults instead classic 2f+1 2 client send request multiple destinations intuitively leader value propose client could send accept message acceptors directly acceptors would respond basic paxos sending accepted messages leader every learner achieving two message delays client learner leader detects collision resolves collision sending accept messages new round accepted usual coordinated recovery technique requires four message delays client learner final optimization occurs leader specifies recovery technique advance allowing acceptors perform collision recovery thus uncoordinated collision recovery occur three message delays two message delays learners also acceptors generalized consensus explores relationship operations replicated state machine consensus protocol implements main discovery involves optimizations paxos conflicting proposals could applied order i.e. proposed operations commutative operations state machine cases conflicting operations accepted avoiding delays required resolving conflicts re-proposing rejected operations concept generalized ever-growing sequences commutative operations known stable thus may executed protocol tracks sequences ensuring proposed operations one sequence stabilized allowing operation non-commuting become stable order illustrate generalized paxos example shows message flow two concurrently executing clients replicated state machine implementing read/write operations two distinct registers b note table indicates operations non-commutative possible sequence operations since codice_1 commutes codice_2 codice_3 one possible permutation equivalent previous order following practice commute occurs operations proposed concurrently message flow shows us generalized paxos leverage operation semantics avoid collisions spontaneous ordering network fails allows protocol practice quicker fast paxos however collision occurs generalized paxos needs two additional round trips recover situation illustrated operations writeb readb schema general case round trips unavoidable come fact multiple commands accepted round makes protocol expensive paxos conflicts frequent hopefully two possible refinements generalized paxos possible improve recovery time paxos may also extended support arbitrary failures participants including lying fabrication messages collusion participants selective non-participation etc types failures called byzantine failures solution popularized lamport byzantine paxos introduced castro liskov adds extra message verify acts distribute knowledge verify actions processors fast byzantine paxos introduced martin alvisi removes extra delay since client sends commands directly acceptors note accepted message fast byzantine paxos sent acceptors learners fast paxos sends accepted messages learners failure scenario protocols learner waits receive f+1 identical messages different acceptors occur acceptors also aware since exchanged messages broadcast round correct acceptors re-broadcast agreed value emergence high speed reliable datacenter networks support remote dma rdma substantial interest optimizing paxos leverage hardware offloading network interface card network routers provide reliability network-layer congestion control freeing host cpu tasks derecho c++ paxos library open-source paxos implementation explores option derecho offers classic paxos data durability across full shutdown/restart sequences vertical paxos atomic multicast in-memory replication state-machine synchronization paxos protocols employed derecho needed adapted maximize asynchronous data streaming remove sources delay leader critical path enables derecho sustain full bidirectional rdma data rate contrast although traditional paxos protocols migrated rdma network simply mapping message send operations native rdma operations leaves round-trip delays critical path high-speed rdma networks even small delays large enough prevent utilization full potential bandwidth | [
2689,
1669,
7816,
7315,
1049,
6433,
7841,
4390,
2217,
7085,
5047,
70,
7750,
4696,
8025,
11612,
3326,
3820,
7409,
1142,
121,
3582
] | Train |
7,500 | 5 | LysKOM:lyskom lyskom kom-based conferencing system developed lysator academic computer society linköping university linköping institute technology seen cross news e-mail presence speed irc im-networks common client lyskom emacs lisp client among others www-based client also exists server clients released terms gnu general public license thus free software lyskom protocol uses port 4894 protocol implementations exist python perl pike based frameworks number programs bridging lyskom systems written notable among python software importing exporting e-mail used whole enables lyskom system act primitive list manager configuring exporter reexport imported e-mail also possible use lyskom like multi-user e-mail client posting mailing lists lyskom also refers specific installation hosted lysator kom.lysator.liu.se | [
8582,
8554,
6993,
3218,
3675,
7646
] | Test |
7,501 | 3 | INT_(x86_instruction):int x86 instruction int assembly language instruction x86 processors generates software interrupt takes interrupt number formatted byte value written assembly language instruction written like codice_2 software interrupt generated 0-255 depending context compiler assembler software interrupt number often given hexadecimal value sometimes prefix 0x suffix h example codice_3 generate software interrupt 0x13 19 decimal causing function pointed 20th vector interrupt table executed typically dos api call generating software interrupt processor calls one 256 functions pointed interrupt address table located first 1024 bytes memory real mode see interrupt vector therefore entirely possible use far-call instruction start interrupt-function manually pushing flag register one useful dos software interrupts interrupt 0x21 calling different parameters registers mostly ah al could access various io operations string output unix systems derivatives use software interrupts exception interrupt 0x80 used make system calls accomplished entering 32-bit value corresponding kernel function eax register processor executing int 0x80 int3 instruction one-byte-instruction defined use debuggers temporarily replace instruction running program order set code breakpoint general int xxh instructions encoded using two bytes makes unsuitable use patching instructions one byte long see sigtrap opcode int3 codice_4 opposed opcode int immediate8 codice_5 since dedicated codice_4 opcode desired special properties debugging shared normal two-byte opcode int3 assemblers normally generate generic codice_7 opcode mnemonics | [
389,
5000,
1952,
9533,
2811,
5312,
6082,
6596,
5457,
6868,
5080,
4441,
602,
477,
6118,
1776,
499,
5492,
1915
] | None |
7,502 | 3 | XLink_Kai:xlink kai xlink kai method developed team-xlink online play video games support lan multiplayer modes enables players nintendo gamecube nintendo switch playstation 2 playstation 3 playstation 4 playstation portable playstation vita xbox xbox 360 xbox one play games across internet using network configuration simulates local area network lan notably also allows original xbox games played online following xbox live shutdown april 21 2010 similar save nintendo wi-fi wii certain gamespy titles saints row 2 played online gamespy network shutdown may 31 2014 purpose software allow consoles network internet via consoles local network play capabilities xlink kai acts tunneling software installed compatible microsoft windows macos linux computer network console upon console initiating game network play feature console requests routed computer xlink listening requests allows consoles found internet search making appear player console consoles simply connected local network modified modded xbox consoles much functionality provided directly within xbox media center xbmc xbox gui kai client still required running computer user network players control connections directly console also possible run kai client linux-based devices wireless routers nas devices running third party firmware replacements dd-wrt slugos users log onto xlink servers using xtag username similar gamertag xbox live xlink arenas compatible system link game popular games halo 2 sub-arenas based regions within attempt minimize lag players arenas automatically synced simulating lan connection thus able play games normally using system link functions addition game arenas kai general chat room quarantine arena moderators isolate abusive players xlink also lets players create self-moderated private arenas xlink kai supports nintendo gamecube playstation 2 nintendo switch playstation 3 playstation 4 playstation portable playstation vita xbox xbox 360 xbox one lan enabled games features integrated chat lobbies players meet converse prior starting game session clan tournament ladder lobbies also integrated games list compatible games found team-xlink website special considerations made xbox 360 designed microsoft incompatible kind software console automatically drop connections ping 30 milliseconds system link connection however patch released bypass limit modified consoles one point support nintendo ds planned never completed xbmc microsoft xbox console control client xlink kai allows control xlink kai software program user xbox via xbmc gui mc360 skin xbmc blackbolt gives xlink kai client xbmc-live familiar interface resembling xbox 360 factory dashboard xbox live connectivity friends arenas etc xlink kai removed xbmc builds 14099 later | [
10788,
6345,
8937,
8428,
6797,
9868,
7983,
10316,
7859,
823,
6873,
10109
] | Test |
7,503 | 4 | Data_Security_Council_of_India:data security council india data security council india dsci premier industry body data protection india setup nasscom® committed making cyberspace safe secure trusted establishing best practices standards initiatives cyber security privacy dsci brings together national governments agencies industry sectors including it-bpm bfsi telecom industry associations data protection authorities think tanks public advocacy thought leadership capacity building outreach initiatives dsci engages governments regulators industry associations think tanks policy matters strengthen thought leadership cyber security privacy dsci develops best practices frameworks publishes studies surveys papers builds capacity security privacy cyber forensics training certification program professionals law enforcement agencies engages stakeholders various outreach initiatives including events awards chapters consultations membership programs dsci also endeavors increase india ’ share global security product services market global trade development initiatives aim strengthen security privacy culture india dsci certified privacy professional dcpp© | [
2300,
2558
] | Test |
7,504 | 2 | DEC_Radix-50:dec radix-50 radix-50 commonly called rad-50 rad50 dec squoze uppercase character encoding created digital equipment corporation use decsystem pdp vax computers radix-50 40-character repertoire 050 octal encode six characters plus four additional bits one 36-bit word pdp-6 pdp-10/decsystem-10 decsystem-20 three characters plus two additional bits one 18-bit word pdp-9 pdp-15 three characters one 16-bit word pdp-11 vax actual encoding differed 36-bit 16-bit systems name squoze borrowed scheme used share 709 operating system representing object code symbols packed six characters 50-character alphabet plus two additional flag bits one 36-bit word radix-50 36-bit systems commonly used symbol tables assemblers compilers supported six-character symbol names left four bits encode properties symbol radix-50 normally used 36-bit systems encoding ordinary character strings file names normally encoded six 6-bit characters full ascii strings five 7-bit characters one unused bit per 36-bit word radix-50 called radix 50 format used digital 18-bit pdp-9 pdp-15 computers store symbols symbol tables leaving two extra bits per word symbol classification bits strings dec 16-bit systems encoded 8-bit bytes others used radix-50 radix-50 strings encoded successive words needed first character within word located significant position example using pdp-11 encoding string abcdef character values 1 2 3 4 5 6 would encoded word containing value 1×40 2×40 3×40 1,683 followed second word containing value 4×40 5×40 6×40 6,606 thus 16-bit words encoded values ranging 0 three spaces 63,999 999 fewer three characters word last word string padded trailing spaces several minor variations encoding families example rt-11 operating system considered character corresponding value undefined utility programs used value represent character instead use rad-50 source filename size conventions used digital equipment corporation pdp-11 operating systems using rad-50 encoding six characters filename could stored two 16-bit words three extension file type characters could stored third 16-bit word period separated filename extension implied i.e. stored always assumed present rad-50 also commonly used symbol tables various pdp-11 programming languages | [
10590,
1253,
8262,
5384,
3563,
11151,
9361,
3443,
11604,
6837,
8474,
2078
] | None |
7,505 | 3 | Pipeline_stall:pipeline stall design pipelined computer processors pipeline stall delay execution instruction order resolve hazard decoding stage control unit determine decoded instruction reads register instruction currently execution stage writes condition holds control unit stall instruction one clock cycle also stalls instruction fetch stage prevent instruction stage overwritten next instruction program prevent new instructions fetched instruction decoding stage stalled value pc register instruction fetch stage preserved prevent changes values preserved instruction causing conflict passed execution stage event often called bubble analogy air bubble fluid pipe architectures execution stage pipeline must always performing action every cycle case bubble implemented feeding nop operation instructions execution stage bubble flushed past following two executions four instructions 4-stage pipeline whatever reason delay fetching purple instruction cycle 2 leads bubble created delaying instructions well example shows bubble inserted classic risc pipeline five stages instruction fetch id instruction decode ex execute mem memory access wb register write back example data available mem stage 4th stage first instruction required input ex stage 3rd stage second instruction without bubble ex stage 3rd stage access output previous ex stage thus adding bubble resolves time dependence without needing propagate data backwards time impossible | [
7173,
9739,
2066,
7699,
5655,
10779,
10781,
10786,
6181,
8231,
3630,
6705,
7218,
2620,
2623,
2113,
7234,
3142,
2638,
1122,
3175,
8815,
630,
8822,
6268,
3197,
7313,
6815,
8352,
5793,
6818,
6821,
7852,
9391,
2224,
2226,
7858,
9911,
2745,
88... | Validation |
7,506 | 1 | MyISAM:myisam myisam default storage engine mysql relational database management system versions prior 5.5 released december 2009 based older isam code many useful extensions myisam table stored disk three files partitioned files names begin table name extension indicate file type mysql uses .frm file store definition table file part myisam engine instead part server data file .myd mydata extension index file .myi myindex extension myisam optimized environments heavy read operations writes none typical area one could prefer myisam data warehouse involves queries big tables update tables done database use usually night reason myisam allows fast reads structure indexes entry points record data file pointer offset beginning file way records quickly read especially format fixed thus rows constant length inserts easy new rows appended end data file however delete update operations problematic deletes must leave empty space rows offsets would change goes updates length rows becomes shorter update makes row longer row fragmented defragment rows claim empty space optimize table command must executed simple mechanism myisam index statistics usually quite accurate however simplicity myisam several drawbacks major deficiency myisam absence transactions support also foreign keys supported normal use cases innodb seems faster myisam versions mysql 5.5 greater switched innodb engine ensure referential integrity constraints higher concurrency myisam supports fulltext indexing opengis data types mariadb storage engine called aria described crash-safe alternative myisam however mariadb developers still work myisam code major improvement segmented key cache enabled myisam indices cache divided segments improves concurrency threads rarely need lock entire cache mariadb myisam also supports virtual columns drizzle include myisam | [
11392,
8195,
10632,
10258,
10389,
7453,
1950,
9503,
7080,
7339,
7983,
9010,
6721,
8393,
5964,
5198,
9687,
10459,
6245,
7654,
8295,
8683,
5612,
2413,
7022,
3188,
4598,
10873,
2810,
2045
] | None |
7,507 | 2 | CP/CMS:cp/cms cp/cms control program/cambridge monitor system discontinued time-sharing operating system late 60s early 70s known excellent performance advanced features three distinct versions implementation substantial redesign predecessor evolutionary step forward cp-67/cms first widely available virtual machine architecture ibm pioneered idea research systems m44/44x used partial virtualization cp-40 used full virtualization addition role predecessor vm family cp/cms played important role development operating system os theory design ibm system/370 time-sharing industry creation self-supporting user community anticipated today free software movement cp/cms built ibm cambridge scientific center csc research development lab ties mit leadership robert creasy system goals development process release legacy breakthrough technology set system apart oses day large ibm projects open-source system made available source code form ibm customers charge – part unsupported ibm type-iii library cp/cms users supported unusual circumstances described history section led situation cp/cms consisted two main components cp/cms virtual machine concept important step forward operating system design ibm reimplemented cp/cms vm/370 product line released 1972 virtual memory added s/370 series vm/370 successors z/vm remain wide use today important note ibm reimplemented cp-67 cp-40 simply rename repackage vm coexisted cp/cms successors many years thus appropriate view cp/cms independent os distinct vm family cp/cms distributed source code form many cp/cms users actively involved studying modifying source code direct user involvement vendor-supplied operating system unusual cp/cms era many vendors distributed operating systems machine-readable source code possible os/360 dos/360 number later mainstream ibm operating systems distributed way systems awareness system source code also involved sysgen process comparable kernel build modern systems also installing starter set forty years later hercules emulator used run fossilized versions systems based source code treated part public domain importance operating system source code changed time 1969 os software included cost hardware vendor complete responsibility entire system hardware software made distribution medium relatively unimportant ibm unbundling os software delivered ibm system control program scp software eventually object code form still additional charge complicated reasons cp/cms released normal way supported ibm made part unsupported ibm type-iii library collection software contributed ibm personnel similarly software contributed customers formed type-iv library ibm distributed library customers use 'as lack direct ibm support products forced active users support encouraged modifications mutual support cp/cms type-iii products early forms free software source code distribution ibm operating systems may continued time e.g os/360 dos/360 dos/vse mvs even tss/370 today generally considered public domain since arguably published without copyright notice 1978 however unsupported status cp/cms placed different pressures user community created need source code distribution curiously cp/cms contributed type-iii library mit lincoln laboratory ibm despite fact system built ibm cambridge scientific center surprising decision described form collusion outmaneuver ibm political forces opposed time-sharing may also reflect amount formal informal input mit union carbide contributed design implementation cp-40 s/360-67 cp-67 cms see history cp/cms historical notes insights references topic many cp/cms users made extensive modifications copies source code much work shared among sites important changes found way back core system users national css academic sites continued independent development cp/cms rather switching vm/370 became available efforts diverged community today would termed software fork ibm released vm/370 source code distribution vm continued several releases vm project adopt use pl/s internal systems programming language mandated use within ibm many comparable projects use pl/s would made source code distribution impossible ibm attempted turn away assembly language higher level languages early 1965 making substantial use pl/s 1969 e.g mvs pl/s considered trade secret time available customers ibm apparently made exceptions policy much later vm user community continued make important contributions software cp/cms type-iii period os dos sites exhibited active user involvement deep operating system internals found many vm sites reverse support helped cp/cms concepts survive evolve despite vm second class citizen status ibm fundamental cp/cms architectural strategic parameters established cp-40 began production use ibm cambridge scientific center early 1967 effort occurred complex political technical milieu discussed length supported first-hand quotes wikipedia article history cp/cms nutshell cp/cms architecture revolutionary time system consisted virtualizing control program cp created multiple independent virtual machines vms platform virtualization possible two elements ibm system/360-67 program running 'problem state using privileged instruction invalid memory address would cause hardware raise exception condition trapping conditions cp could simulate appropriate behavior e.g performing i/o paging operations guest operating system would run 'supervisor state bare machine run 'problem state cp result fully virtualized environment virtual machine set virtual devices mapped system real hardware environment thus given dial-up teletype presented vm instance virtual console note cp-67 certain model-dependent diagnostic instructions virtualized notably diag instruction ultimately later development ibm elsewhere diag instructions used create non-virtualized interface became called hypervisor client operating systems could use mechanism communicate directly control program offered dramatic performance improvements s/360 operating system could fact run cp normal users ran cambridge monitor system cms simple single-user operating system cms allowed users run programs manage virtual devices cp-67 versions 1 2 support virtual memory inside virtual machine added version 3 point testing development cp could done running full copy cp/cms inside single virtual machine cp/cms operating system work cp-370 development mvs testing ran four- five-level deep stacks hardware os simulations cp/cms design different ibm previous monolithic operating systems separates complex big system dispatching hardware management mass storage little system application program execution file i/o console input/output re-categorization systems entities prevents bug one users system affecting model feature microkernel operating systems ibm decision implement virtualization virtual memory features subsequent s/370 design although missing initial s/370 series reflects least part success cp/cms approach turn survival success ibm vm operating system family virtualization technology general owe much s/360-67 many respects ibm cp-67 cp/cms products anticipated heavily influenced contemporary virtualization software vmware workstation xen microsoft virtual pc | [
6150,
6153,
2058,
3082,
6675,
7187,
10776,
25,
4637,
9762,
5158,
7217,
10803,
9780,
7733,
9784,
10809,
573,
576,
5697,
5702,
7248,
10333,
97,
9829,
6248,
8298,
6772,
7285,
9335,
2168,
1147,
2172,
3197,
1150,
2179,
10883,
6797,
4238,
9361,... | Test |
7,508 | 3 | Model-specific_register:model-specific register model-specific register msr various control registers x86 instruction set used debugging program execution tracing computer performance monitoring toggling certain cpu features introduction 80386 processor intel began introducing experimental features would necessarily present future versions processor first two test registers t6 t7 allowed 80386 speed virtual-to-physical address conversions three additional test registers followed 80486 tr3–tr5 enabled testing processor caches code data none five registers implemented subsequent pentium processor introduction pentium processor intel provided pair instructions codice_1 codice_2 access current future model-specific registers well cpuid instruction determine features present particular model many registers proven useful enough retained intel classified architectural model-specific registers committed inclusion future product lines reading writing registers handled codice_1 codice_2 instructions respectively privileged instructions executed operating system use linux msr kernel module creates pseudo file /dev/cpu/ x /msr unique x processor processor core user permissions read and/or write file use file i/o api access registers msr-tools package provides reference implementation documentation regarding msrs certain processor implementation supports usually found processor documentation cpu vendor examples rather well-known msrs memory type range registers mtrrs address-range registers arrs | [
6924,
4237,
8590,
499,
6868,
1915,
6078,
2847
] | Test |
7,509 | 2 | Aplay:aplay aplay command-line audio file player alsa sound card driver supports several file formats multiple sound cards multiple devices supported soundfile formats sampling rate bit depth forth automatically determined soundfile header play raw file foobar 22050-hz mono 8-bit mu-law .au file | [
6293,
823
] | None |
7,510 | 4 | Rajesh_De:rajesh de rajesh raj de born circa 1972 american lawyer former u.s. government official early 2011 april 2012 de served white house staff secretary april 2012 march 2015 general counsel u.s. national security agency period marked controversy disclosures nsa surveillance leaving nsa joined law firm mayer brown de jd harvard law school ab harvard college graduated class 1999 | [
7893,
7887
] | None |
7,511 | 2 | Usage_share_of_desktop_operating_systems:usage share desktop operating systems usage share desktop operating systems percentage operating systems os used computers approximately market share so-called retronym desktop operating system also run e.g laptops originally computers running operating systems desktop computers introduction so-called new class mobile operating systems desktop got part name former class oses computers running oses desktop metaphor style gui unlike mobile oses see also usage share operating systems breakdown share desktop mobile styles operating systems separately share operating systems part across classes three main divisions desktop computer operating systems microsoft windows apple macos linux variants section complete section complete section complete | [
2179,
10499,
10883,
394,
3978,
1804,
6797,
273,
7057,
6675,
7187,
11539,
9366,
11667,
6296,
25,
10776,
8092,
4637,
7325,
9887,
10016,
9762,
421,
5158,
10235,
2345,
7983,
3248,
7217,
11184,
6837,
823,
9784,
4409,
10809,
6075,
7483,
6078,
2... | Train |
7,512 | 1 | Amazon_DocumentDB:amazon documentdb amazon documentdb fully managed proprietary nosql database service supports document data structures mongodb workloads amazon documentdb currently available california oregon north virginia ireland regions aws | [
8962,
8451,
6027,
4236,
10893,
911,
1935,
4623,
8592,
2965,
2328,
4377,
8986,
5660,
11038,
6307,
11556,
9766,
5159,
2217,
6444,
7983,
8495,
3121,
7352,
10681,
2496,
4289,
11201,
1224,
5960,
8520,
10185,
4429,
590,
7248,
1362,
467,
9682,
2... | None |
7,513 | 9 | MiniD:minid minid renamed croc programming language small lightweight extension language vein lua squirrel designed used mainly programming language supports object-oriented imperative programming paradigms well simple functional aspects distributed licence zlib/libpng minid free software minid began june 2006 idea statically-typed language much like stripped-down version programming language reason name minid work began compiler creator jarrett billingsley realized large project language becoming decided recast language something simpler implement result lua-like language c-style syntax next several months minid acquired features various languages squirrel-like classes d-like module system lua-like collaborative multithreading august 1 2007 thirteen months planning programming version 1.0 reference implementation released version 1.0 language specification frozen june 15 2009 version 2 minid released version 2 brings major reimplementation library order support garbage collector rather relying underlying garbage collector better behavior realtime applications games version 2 also brings several changes language standard libraries development minid stopped june 2011 used base new language called croc author minid provides small flexible set data types similar lua squirrel unlike lua minid provides explicit support object-oriented programming classes minid also provides module system coroutines core language features like lua minid garbage-collected support first-class functions closures tail recursion minid also tries robust typical dynamic languages making easier catch bugs sooner example implicit variable declarations accessing globals exist throws error instead giving default value lua another helpful feature parameter type constraints way specifying valid types function parameters may accept checks still performed runtime unlike static languages concise syntax negligible performance impact make much attractive easy-to-use similar solutions dynamic languages help greatly catching bugs would cause functions malfunction corrupt data structures called unexpected parameter types small example given following example code minid 2 note due technical limitations keywords highlighted wikipedia source highlighter minid hello world program minid every minid source file must begin module declaration simplicity module declaration omitted rest examples example shows simple class two fields x initialized 0 default class constructor declared 'this keyword takes two parameters assigns instance fields syntax x shorthand this.x object upon method called like lua python members must accessed explicitly class one method 'tostring called automatically object needs converted string somewhat unusual syntax used inspired many functional languages shorthand following finally class instantiated calling like function similarly python squirrel instance printed using 'writeln 'tostring method called program outputs example demonstrates minid array manipulation abilities unlike lua minid separate array type example array created holds values 1 10 using 'array.range function 'map method arrays used takes function literal returns square parameter literal syntax inspired functional languages haskell shorthand following b printed shows first ten squares shows shorter way achieving result using minid list comprehensions syntax close python example shows 'foreach loop used iterate arrays tables strings shown well types example shows use 'foreach loop iterate coroutine way coroutines used generators shows simple use parameter type constraints way putting runtime checks parameters restrict allowable types 'first function allows arrays strings parameter x first two print statements work fine third throws error since integers allowable type x | [
2304,
9345,
8262,
4777,
8554,
5612,
5165,
7983,
338,
8854,
5783,
10198,
2045
] | None |
7,514 | 9 | Honeywell_ARGUS:honeywell argus argus assembly language devised 1960s honeywell honeywell 800 1800 computers name argus acronym standing automatic routine generating updating system assembly languages line argus copied one card related one word memory except one argus command reserve could reserve specified number words position specified reserve command also exceptional prescribing initial data reserved words exceptions machine language words coded order argus lines honeywell 800 1800 main memory control memory using ferrite cores main memory 4 16 banks depending customer requirements bank contained 2048 words 48 bits actual number banks individual installation multiple 4 control memory 256 registers 16 bits given time machine could theoretically run one operating system 7 application programs exclusive use 32 registers program required 2048 words data instructions combined split segments 2048 words less segment would exclusive use one bank main memory special instructions pass control one segment another line argus command fields follows location optional argus name assigned word memory address word assigned memory argus name line would linked position corresponding word lines argus could refer name words would assigned correct memory address within program name unique field may begin r rest card remarks field may begin x x addressname line x lines placed away lines marked addressed x +n addressname address field field may begin maskname line defines mask operation argus name machine language command argus-only command could followed address mask required commands extra information b c addresses translated machine code see b addresses typically two input words c address destination id normally serial number punched card card punch machine used resort cards might dropped machine language command used one word 48 bits split 4 sections 12 bits first 12 bits specified operation ancillary information including offset address mask command three sections b c addresses mask specified final result command would pass mask reaching destination example bit 17 mask 1 result would go bit 17 destination bit 17 mask 0 something else would go bit 17 destination might 0 might unchanged bit 17 input word depending command segment allowed 16 masks consecutive words beginning address whose last four bits 0 argus location names special register called mask register held base address command field 4 bits hold offset address named mask commands b c address sections used denote actual locations memory six modes addressing two rarely used remainder direct direct special register indirect addressing indexed main memory address specified directly command machine language one 12 bits indicates direct mode 11 specify exact address 11 bits represent numbers 0 2047 nothing larger however efficient type addressing dilemma bank 2048 words segment confined one bank two ways writing line argus code 1 name previously defined location column number decimal added e.g buffer0+59 2 location several lines words beyond current line e.g c,2 means line two beyond one 12 bits mode addressing address register control memory identified also increment 0 32 specified main memory address register control memory processor first obtain main memory address register call word main memory address finally increase increment register value amount specified 16 bit address register contains bank address 0 31 using 5 bits word bank using 11 bits incrementing recommended addresses b argus n r0,3 means use register r0 increase 3 register addressed directly manner word main memory argus z r0,3 means read write register r0 directly increase 3 increase recommended writing applies 8 registers called index registers takes 3 bits specify index register another 7 specify offset 0 127 offset added full-length main memory address powerful tool helpful processing multiword text record tape buffers usually addressed way argus x0,35 0,35 means use index register 0 increase number 35 decimal read write location main memory change value x0 argus address field dash meant field would ignored processor thereby nullifying part usual action command mentioned program access 32 registers 8 special functions 16 registers r0 r15 general purpose 8 x0 x7 index registers index addressing possible index registers direct indirect addressing applicable general purpose index registers would probably work registers would bad practice sc sequence counter sh sequence history csc cosequence counter csh cosequence history msk mask register au1 au2 operation sequence counter always contains full address command running normally commands executed location order sequence history contains last value sequence counter value stored immediately upon jumping subroutine otherwise impossible return cosequence counter history perform functions command x beginning argus location msk register holds full location first mask see au1 au2 used internally commands especially tn also used programs however risk internal operation might interfere wise choice argus line defines word memory normal operation processor performs command address order commands order jump another address direct addressing bank commands wa ba da different ways obtain numbers addresses b add together put result address c. commands bs ds subtract number address b number address placing result address c. wa word add treats two input numbers binary numbers sign often used add increment known address ba bs binary add binary subtract treat two input numbers signed binary da ds decimal add decimal subtract treat two input numbers signed decimal leftmost four bits define sign zero sign positive otherwise negative command dm multiplies number address b number address placing left half result address c. remaining low end digits left lop low output register transferred main memory address tx ts command dm fully supported floating point adaptor absence simulation required tx transfer address address c. address b must inactive see modes addressing ts transfer address address b jump sequence command address c. c must direct address optionally b inactive command becomes pure jump nearest machine gets goto command mt transfer address address c several times number times specified decimal number address field b number true address converted binary positioned operation section machine language command value large address c must indirect increment one individual transfer operates different word command rarely used experience application programming however may useful operating systems compilers tn transfer address address c. transfer a+1 c+1 continue total number times specified address b mt decimal number ends binary operation section machine command command frequently used applications especially “ blanking ” areas text command used registers au1 au2 manage address increments na compare addresses b equal continue normal unequal jump address c. la compare addresses b unsigned binary less equal b continue normal otherwise jump c. loop counter la safer na logic goes astray na loop could run away pr proceed nothing command nevertheless would take time three addresses would inactive could used loop wait operator take action perhaps reminding argus commands translated initial value binary address memory actual value would go address continuing addresses b c long necessary lines use constants would location code reference active commands oct punched letter number translated three bit octal code 0 becomes 000 1 becomes 001 2 becomes 010 ... 7 becomes 111 hex punched letter number translated four bit hexadecimal code 0 becomes 0000 1 becomes 0001 ... 9 becomes 1001 b g indicate decimal 10 15 binary 1010 1111 honeywell hexadecimal code used b g ibm used f. dec punched letter number translated four bit decimal code like hexadecimal except 0 9 valid alf punched letter number translated according honeywell binary code alphanumeric numbers letters symbols x text plus separate entries x text address field x h allowing 12 bit section word encoded using one methods oct hex dec leftmost 4 bits used denote sign number mask constant location entry maskname good practice put masks together argus case argus would put together consecutive words maximum number masks 15 mask could used modify action command could change value word example tx maskname would apply mask “ maskname ” tx command masking essential switch word command valuable commands installations standard use switch word full address first mask would placed msk register offset individual mask would placed command section machine language command specified consequently program needed one set masks could used segment switch word commands used move bits word bit positions two switch word commands similar switch word extract argus command swe maskname address source c address destination b address field amount switch x n x b representing binary decimal alphanumeric i.e units 1 4 6 bits respectively l r left right operation word obtained address bits moved left right number size unit specified bits “ fell ” end put back opposite end shifted word passed mask bit bit mask bit 1 shifted bit would copied otherwise 0 bit would passed modified word placed address c switch word command switch word superimpose sws syntax action differed mask stage mask bit 0 unshifted rather shifted bit placed output word mask bit 1 action swe example address contains 8 characters 6 bits abcdefgh mask onechar contains 1 right-most 6 bits 0 elsewhere command swe onechar a,4 r c address c contain 0000000d command sws onechar a,4 r c address c contain abcdefgd machine language shifts represented binary right argus codes x n format reduced binary right macro would called l macroname would request assembler insert argus text macro “ macroname ” point done early stage assembly argus translated machine code quite macros standard library held tape customers could add macros get put would get item input tape buffer put item output tape buffer reading writing record appropriate two types subroutine one entirely written argus example using subroutine suba type subroutine delivered machine language macro wrapper normally written honeywell staff macro used command gosub call subroutine honeywell 1800 optional floating point adaptor scientific computing set commands commands also available simulation form hardware include adaptor recommended regular use argus floating point commands regardless whether adaptor absence argus would supply machine language simulation true floating point operation input output device addresses machine level two octal digits 0-7 argus level two letters a-g first digits identified controller second digit identified device number controller tape processing one unit data tape called honeywell manuals record ibm called still calls block subdivision record called item ibm called record ibm terminology became american standard commands command rw aa would rewind tape tape unit aa octal 00 command rf aa would read next record tape unit aa octal 00 command rb aa would read back previous record tape unit aa octal 00 without delivering data amend existing tape could use rf find first record n't want rb reach space wf write onwards command wf ab would write next record tape unit ab octal 01 command rf ga would read next card card reader device ga octal 70 address would first word buffer read write operation normal use two buffers device reading writing could run parallel processing called double-buffering buffer size limiting factor size “ records ” blocks core memory limited preparing write record tape item terminated end item word prescribed code record terminated ortho word error checking followed end record word output buffer filled items compute ortho cc command used calculate ortho word provide end record word compute ortho command addresses b marked first last word positions next record would written wf command finally control would returned main program normal application work peripheral commands except perhaps rw would placed subroutine argus commands deal administration programs order assemble program following required administration commands required program created changed u newprog progname cards follow complete new program called progname u reassmb progname cards follow revisions existing program progname u newseg progname segname cards follow complete new segment called segname new existing program called progname u segment progname segname cards follow revisions segment segname program progname u endseg end segment revisions u endprog end program revisions ascher opler myra gray 1961 design multiprogrammed algebraic compiler subscription | [
4881,
7514,
3323,
8606
] | None |
7,515 | 4 | Malware:malware malware portmanteau malicious software software intentionally designed cause damage computer server client computer network malware damage implanted introduced way target computer take form directly executable code scripts so-called active content microsoft windows forms data kinds malware largely referred media computer viruses worms trojan horses ransomware spyware adware scareware among terms malware malicious intent acting interest computer user—and include software causes unintentional harm due deficiency typically described software bug programs officially supplied companies considered malware secretly act interests computer user example one point sony music compact discs silently installed rootkit purchasers computers running microsoft windows intention preventing illicit copying also reported users listening habits unintentionally created extra security vulnerabilities one strategy protecting malware prevent harmful software gaining access target computer reason antivirus software firewalls strategies used help protect introduction malware addition checking presence malware malicious activity recovering attacks many early infectious programs including first internet worm written experiments pranks today malware used black hat hackers governments steal personal financial business information malware sometimes used broadly government corporate websites gather guarded information disrupt operation general however malware used individuals gain information personal identification numbers details bank credit card numbers passwords since rise widespread broadband internet access malicious software frequently designed profit since 2003 majority widespread viruses worms designed take control users computers illicit purposes infected zombie computers used send email spam host contraband data child pornography engage distributed denial-of-service attacks form extortion programs designed monitor users web browsing display unsolicited advertisements redirect affiliate marketing revenues called spyware spyware programs spread like viruses instead generally installed exploiting security holes also hidden packaged together unrelated user-installed software sony bmg rootkit intended preventing illicit copying also reported users listening habits unintentionally created extra security vulnerabilities ransomware affects infected computer system way demands payment bring back normal state example programs cryptolocker encrypt files securely decrypt payment substantial sum money malware used generate money click fraud making appear computer user clicked advertising link site generating payment advertiser estimated 2012 60 70 active malware used kind click fraud 22 ad-clicks fraudulent addition criminal money-making malware used sabotage often political motives stuxnet example designed disrupt specific industrial equipment politically motivated attacks spread shut large computer networks including massive deletion files corruption master boot records described computer killing attacks made sony pictures entertainment 25 november 2014 using malware known shamoon w32.disttrack saudi aramco august 2012 best-known types malware viruses worms known manner spread rather specific types behavior computer virus software embeds executable software including operating system target system without user knowledge consent run virus spread executables hand worm stand-alone malware software actively transmits network infect computers definitions lead observation virus requires user run infected software operating system virus spread whereas worm spreads categories mutually exclusive malware may use multiple techniques section applies malware designed operate undetected sabotage ransomware computer virus software usually hidden within another seemingly innocuous program produce copies insert programs files usually performs harmful action destroying data example pe infection technique usually used spread malware inserts extra data executable code pe files 'lock-screens screen lockers type “ cyber police ” ransomware blocks screens windows android devices false accusation harvesting illegal content trying scare victims paying fee jisut slocker impact android devices lock-screens jisut making nearly 60 percent android ransomware detections trojan horse harmful program misrepresents masquerade regular benign program utility order persuade victim install trojan horse usually carries hidden destructive function activated application started term derived ancient greek story trojan horse used invade city troy stealth trojan horses generally spread form social engineering example user duped executing e-mail attachment disguised unsuspicious e.g. routine form filled drive-by download although payload anything many modern forms act backdoor contacting controller unauthorized access affected computer trojan horses backdoors easily detectable computers may appear run slower due heavy processor network usage unlike computer viruses worms trojan horses generally attempt inject files otherwise propagate spring 2017 mac users hit new version proton remote access trojan rat trained extract password data various sources browser auto-fill data mac-os keychain password vaults malicious software installed system essential stays concealed avoid detection software packages known rootkits allow concealment modifying host operating system malware hidden user rootkits prevent harmful process visible system list processes keep files read types harmful software contain routines evade identification and/or removal attempts merely hide early example behavior recorded jargon file tale pair programs infesting xerox cp-v time sharing system backdoor method bypassing normal authentication procedures usually connection network internet system compromised one backdoors may installed order allow access future invisibly user idea often suggested computer manufacturers preinstall backdoors systems provide technical support customers never reliably verified reported 2014 us government agencies diverting computers purchased considered targets secret workshops software hardware permitting remote access agency installed considered among productive operations obtain access networks around world backdoors may installed trojan horses worms implants methods since beginning 2015 sizable portion malware utilizes combination many techniques designed avoid detection analysis common least common increasingly common technique 2015 adware uses stolen certificates disable anti-malware virus protection technical remedies available deal adware nowadays one sophisticated stealthy ways evasion use information hiding techniques namely stegomalware survey stegomalware published cabaj et al 2018 malware exploits security defects security bugs vulnerabilities design operating system applications browsers e.g older versions microsoft internet explorer supported windows xp vulnerable versions browser plugins adobe flash player adobe acrobat reader java se sometimes even installing new versions plugins automatically uninstall old versions security advisories plug-in providers announce security-related updates common vulnerabilities assigned cve ids listed us national vulnerability database secunia psi example software free personal use check pc vulnerable out-of-date software attempt update malware authors target bugs loopholes exploit common method exploitation buffer overrun vulnerability software designed store data specified region memory prevent data buffer accommodate supplied malware may provide data overflows buffer malicious executable code data end payload accessed attacker legitimate software determines early pcs booted floppy disks built-in hard drives became common operating system normally started possible boot another boot device available floppy disk cd-rom dvd-rom usb flash drive network common configure computer boot one devices available normally none would available user would intentionally insert say cd optical drive boot computer special way example install operating system even without booting computers configured execute software media soon become available e.g autorun cd usb device inserted malware distributors would trick user booting running infected device medium example virus could make infected computer add autorunnable code usb stick plugged anyone attached stick another computer set autorun usb would turn become infected also pass infection way generally device plugs usb port even lights fans speakers toys peripherals digital microscope used spread malware devices infected manufacturing supply quality control inadequate form infection largely avoided setting computers default boot internal hard drive available autorun devices intentional booting another device always possible pressing certain keys boot older email software would automatically open html email containing potentially malicious javascript code users may also execute disguised malicious email attachments 2018 data breach investigations report verizon cited cso online states emails primary method malware delivery accounting 92 malware delivery around world computing privilege refers much user program allowed modify system poorly designed computer systems users programs assigned privileges malware take advantage two ways malware overprivileged users overprivileged code systems allow users modify internal structures users today would considered over-privileged users standard operating procedure early microcomputer home computer systems distinction administrator root regular user system systems non-administrator users over-privileged design sense allowed modify internal structures system environments users over-privileged inappropriately granted administrator equivalent status systems allow code executed user access rights user known over-privileged code also standard operating procedure early microcomputer home computer systems malware running over-privileged code use privilege subvert system almost currently popular operating systems also many scripting applications allow code many privileges usually sense user executes code system allows code rights user makes users vulnerable malware form e-mail attachments may may disguised malware attacks become frequent attention begun shift viruses spyware protection malware protection programs specifically developed combat malware preventive recovery measures backup recovery methods mentioned computer virus article specific component anti-virus anti-malware software commonly referred on-access real-time scanner hooks deep operating system core kernel functions manner similar certain malware would attempt operate though user informed permission protecting system time operating system accesses file on-access scanner checks file 'legitimate file file identified malware scanner access operation stopped file dealt scanner pre-defined way anti-virus program configured during/post installation user notified may considerable performance impact operating system though degree impact dependent well scanner programmed goal stop operations malware may attempt system occur including activities might exploit bugs trigger unexpected operating system behavior anti-malware programs combat malware two ways real-time protection malware works identically real-time antivirus protection software scans disk files download time blocks activity components known represent malware cases may also intercept attempts install start-up items modify browser settings many malware components installed result browser exploits user error using security software anti-malware though many sandbox browsers essentially isolate browser computer hence malware induced change also effective helping restrict damage done examples microsoft windows antivirus anti-malware software include optional microsoft security essentials windows xp vista windows 7 real-time protection windows malicious software removal tool included windows security updates patch tuesday second tuesday month windows defender optional download case windows xp incorporating mse functionality case windows 8 later additionally several capable antivirus software programs available free download internet usually restricted non-commercial use tests found free programs competitive commercial ones microsoft system file checker used check repair corrupted system files viruses disable system restore important windows tools task manager command prompt many viruses removed rebooting computer entering windows safe mode networking using system tools microsoft safety scanner hardware implants type general way detect malware also harms compromised websites breaking reputation blacklisting search engines etc websites offer vulnerability scanning scans check website detect malware may note outdated software may report known security issues last resort computers protected malware infected computers prevented disseminating trusted information imposing air gap i.e completely disconnecting networks however malware still cross air gap situations example removable media carry malware across gap december 2013 researchers germany showed one way apparent air gap defeated airhopper bitwhisper gsmem fansmitter four techniques introduced researchers leak data air-gapped computers using electromagnetic thermal acoustic emissions grayware term applied unwanted applications files classified malware worsen performance computers may cause security risks describes applications behave annoying undesirable manner yet less serious troublesome malware grayware encompasses spyware adware fraudulent dialers joke programs remote access tools unwanted programs may harm performance computers cause inconvenience term came use around 2004 another term potentially unwanted program pup potentially unwanted application pua refers applications would considered unwanted despite often downloaded user possibly failing read download agreement pups include spyware adware fraudulent dialers many security products classify unauthorised key generators grayware although frequently carry true malware addition ostensible purpose software maker malwarebytes lists several criteria classifying program pup types adware using stolen certificates turn anti-malware virus protection technical remedies available internet access became widespread viruses spread personal computers infecting executable programs boot sectors floppy disks inserting copy machine code instructions programs boot sectors virus causes run whenever program run disk booted early computer viruses written apple ii macintosh became widespread dominance ibm pc ms-dos system first ibm pc virus wild boot sector virus dubbed c brain created 1986 farooq alvi brothers pakistan executable-infecting viruses dependent users exchanging software boot-able floppies thumb drives spread rapidly computer hobbyist circles first worms network-borne infectious programs originated personal computers multitasking unix systems first well-known worm internet worm 1988 infected sunos vax bsd systems unlike virus worm insert programs instead exploited security holes vulnerabilities network server programs started running separate process behavior used today worms well rise microsoft windows platform 1990s flexible macros applications became possible write infectious code macro language microsoft word similar programs macro viruses infect documents templates rather applications executables rely fact macros word document form executable code notion self-reproducing computer program traced back initial theories operation complex automata john von neumann showed theory program could reproduce constituted plausibility result computability theory fred cohen experimented computer viruses confirmed neumann postulate investigated properties malware detectability self-obfuscation using rudimentary encryption doctoral dissertation subject computer viruses combination cryptographic technology part payload virus exploiting attack purposes initialized investigated mid 1990s includes initial ransomware evasion ideas | [
4100,
6149,
8197,
10245,
8,
8200,
8205,
8206,
2067,
8215,
2075,
28,
2084,
4133,
10278,
43,
10283,
46,
10295,
10297,
2114,
4165,
81,
87,
8281,
4186,
8288,
6241,
10338,
2147,
8292,
2151,
106,
107,
8302,
119,
8315,
10364,
2175,
8320,
131,
... | None |
7,516 | 4 | PA_Server_Monitor:pa server monitor pa server monitor server monitoring network monitoring software application developed power admin llc main function software monitor performance servers network devices windows linux environments data kept customers servers stored cloud agentless monitoring software watch ping cpu memory disk snmp traps events available historical reports apps available ios android power admin llc privately held company founded professionals located olathe kansas outside downtown kansas city area power admin providing professional grade system monitoring products since 1992 types business smbs fortune 500 companies power admin also developed two popular utilities used world paexec allows user launch windows programs remote windows computers without needing install software remote computer first written alternative microsoft psexec tool originally sysinternals mark russinovich could redistributed sensitive command-line options like username passwords sent clear text source code readily available github power admin also developed speedfanhttpagent speedfan http agent exports allows access speedfan utility alfredo milani comparetti temperature data across network via simple http request pa server monitor monitors event logs disk space running services web page content snmp object values log files processes ping response time directory quotas changed files directories equipped monitor thousands servers/devices single installation via satellite monitoring services extensive reporting get status reports servers/devices group summaries uptime historic stats providing actions alerts customizable email sms types notifications suppression escalation certain notifications also automatically restart services run custom scripts capabilities include satellite monitoring remote offices/locations across firewalls and/or across internet without vpn agentless server monitoring bulk config feature speed changes across many servers/devices | [
11221,
823
] | None |
7,517 | 9 | Trace_tree:trace tree trace tree data structure used runtime compilation programming code trace trees used type 'just time compiler traces code executing hotspots compiles hotspots entered compiled code run instead traces statement executed including within function calls entire execution path compiled different compiling individual functions compiler gain information optimizer operate remove overhead calls anytime compiled code makes call code jitted interpreter called continue | [
2620
] | Test |
7,518 | 1 | DBIx::Class:dbix :class dbix :class often abbreviated dbic object-relational mapper perl used map relational database table rows perl objects generates sql queries transparently application developer also implements active record pattern popular web application frameworks catalyst dancer | [
5249,
5253,
8582,
3080,
3988,
10276,
6313,
1837,
4398,
10413,
3763,
9014,
4294,
9286,
7764,
11610,
11492,
2281,
8941,
9467,
3837
] | Validation |
7,519 | 2 | Sleep_mode:sleep mode sleep mode suspend ram low power mode electronic devices computers televisions remote controlled devices modes save significantly electrical consumption compared leaving device fully upon resume allow user avoid reissue instructions wait machine reboot many devices signify power mode pulsed red colored led power light computers entering sleep state roughly equivalent pausing state machine restored operation continues point applications files open sleep mode gone various names including stand suspend suspend ram machine state held ram placed sleep mode computer cuts power unneeded subsystems places ram minimum power state sufficient retain data large power saving laptops automatically enter mode computer running batteries lid closed undesired behavior altered operating system settings computer must consume energy sleeping order power ram able respond wake-up event sleeping pc case machine standby power covered regulations many countries example united states limiting power one watt initiative 2010 addition wake-up press power button pcs also respond wake cues keyboard mouse incoming telephone call modem local area network signal hibernation also called suspend disk linux saves computer operational data fixed disk turning computer completely switching computer back computer restored state prior hibernation programs files open unsaved data intact contrast standby mode hibernation mode saves computer state hard disk requires power maintain whereas standby mode saves computer state ram requires small amount power maintain sleep mode hibernation combined contents ram first copied non-volatile storage like regular hibernation instead powering computer enters sleep mode approach combines benefits sleep mode hibernation machine resume instantaneously also powered completely e.g due loss power without loss data already effectively state hibernation mode called hybrid sleep microsoft windows windows xp hybrid mode supported portable apple macintosh computers compatible hardware running microsoft windows vista newer well linux distributions running kernel 3.6 newer acpi advanced configuration power interface current standard power management superseding apm advanced power management providing backbone sleep hibernation modern computers sleep mode corresponds acpi mode s3 non-acpi device plugged windows sometimes disable stand-by functionality whole operating system without acpi functionality seen older hardware sleep mode usually restricted turning monitor spinning hard drive sleep mode first introduced pc hardware supported correctly could cause problems peripherals n't detect transition rarely problem newer hardware operating systems microsoft windows 2000 later support sleep operating system level os-controlled acpi s4 sleep state without special drivers hardware manufacturer windows vista fast sleep resume feature saves contents volatile memory hard disk entering sleep mode aka hybrid sleep power memory lost use hard disk wake user option hibernating directly wish older versions prior windows vista sleep mode under-used business environments difficult enable organization-wide without resorting third-party pc power management software result earlier versions windows criticized wasting energy remains market third-party pc power management software newer versions windows offering features beyond built operating system products offer active directory integration per-user/per-machine settings advanced offering multiple power plans scheduled power plans anti-insomnia features enterprise power usage reporting vendors include 1e nightwatchman data synergy powerman software verdiem surveyor sleep macs running macos consist traditional sleep safe sleep power nap system preferences safe sleep referred sleep since safe sleep also allowed state restored event power outage unlike operating systems hibernate never offered option 2005 macs running mac os x v10.4 began support safe sleep feature saves contents volatile memory system hard disk time mac enters sleep mode mac instantaneously wake sleep mode power ram lost however power supply interrupted removing batteries without ac power connection mac would wake safe sleep instead restoring memory contents hard drive safe sleep capability found mac models starting october 2005 revision powerbook g4 double-layer sd mac os x v10.4 higher also required hack enabled feature well older macs running mac os x v10.4 2012 apple introduced power nap os x mountain lion 10.8 select mac models power nap allows mac perform tasks silently icloud syncing spotlight indexing low energy tasks performed battery power higher energy tasks performed ac power widespread use symbol campaign launched add set power characters unicode february 2015 proposal accepted unicode characters included unicode 9.0 characters miscellaneous technical block code points 23fb-fe symbol ⏾ x23fe defined power sleep symbol | [
8829,
521,
6281,
6797,
11549,
929,
3109,
7983,
2226,
7604,
823,
4032,
1098,
9035,
1741,
2383,
4178,
6486,
11095,
4444,
8161,
10223,
2811,
4221,
11647
] | None |
7,520 | 4 | Elie_Bursztein:elie bursztein elie bursztein born 1 june 1980 leads anti-abuse research team google best known research anti-fraud abuse novel attacks web service video games work applied cryptography prior google bursztein post-doctoral fellow computer science stanford university focused captchas security usability elie bursztein obtained computer engineering degree epita 2004 master degree computer science paris 7/ ens 2004 supervision patrick cousot phd computer science école normale supérieure de cachan 2008 supervision jean goubault-larrecq phd thesis tilted anticipation games théorie des jeux appliqués à la sécurité réseau anticipation game game theory applied network security showed combine model-checking temporal logic game theory find optimal responses network attacks stanford university post-doctoral fellow stanford security laboratory unit computer science department focuses network computer security 2014 bursztein published first study account manual hijackers kurt thomas et al published google attempt reduce phone verified account fraud 2015 kurt thomas et al received p best practical award study malicious ads injectors joseph bonneau et al got www'15 best student paper award publishing first practical study secret questions security usability using google data 2009 bursztein presented first complete analysis microsoft dpapi data protection application programming interface jean michel picod 2011 j. lagarenne m. hamburg d. boneh used private set intersection protocols defend game map hacking 2014 adam langley made chrome mobile roughly three times faster implementing new tls cipher suite uses algorithms chacha20 poly1305 bursztein research captchas aims make puzzles easier humans solve harder computers crack main contributions easier captcha human used recaptcha generic algorithm break text-based captcha 2009 bursztein showed steven bethard ebay audio captchas broken 2010 studied s. bethard c. fabry d. jurafsky j. c. mitchell humans perform real world captchas running large-scale study 2011 demonstrated r. beauxis h. paskov d. perito c. fabry j. mitchell non-continuous audio captcha ineffective bursztein part team stanford researchers broke nucaptcha security despite company claims next generation video-based captcha security told cnet news 2012 able break nucaptcha video scheme 90 percent success 2010 defcon showed build generic map hack software 2012 defcon demonstrated fuzz online games including diablo 3 league legend 2014 defcon showed use machine learning predict opponent play card based game hearthstone blizzard request tool never made public notable achievements web mobile security include notable awards | [
5977,
653,
2558,
519
] | Test |
7,521 | 2 | Moused:moused moused mouse daemon freebsd systems works console driver support mouse operations text console user programs first appeared freebsd 2.2 currently located codice_1 mouse daemon listens mouse port default codice_2 supplies mouse data virtual mouse driver sysmouse 4 user process wants use mouse simply opens codice_3 reads like normal file makes possible console user processes x window system share mouse | [
7425,
2180,
1927,
1801,
10761,
274,
9625,
1946,
4636,
2212,
6438,
10535,
684,
4908,
1071,
3248,
9009,
11698,
11573,
1718,
9784,
1465,
5177,
5819,
3006,
11459,
4423,
9927,
8266,
8395,
8909,
5710,
6864,
7249,
850,
10455,
6361,
8410,
4571,
6... | Test |
7,522 | 4 | Group-IB:group-ib group-ib develops software hardware proactive cyber defence 2015 gartner agency included group-ib top 7 global vendors threat intelligence 2017 company became leader russia threat intelligence security services market analysis conducted idc became one top-5 threat intelligence vendors forrester vendor landscape external threat intelligence 2017 report group-ib global hq located singapore group-ib founded 2003 group students bauman moscow state technical university headed ilya konstantinovich sachkov acting agency investigating cyber-attacks since group-ib involved range incident response investigations across world actively cooperating international partners detect perpetrators bring justice group-ib participated first successful cybercrime case russia organizers criminal groups identified arrested criminals involved financial theft bank accounts using malware pcs mobile devices phishing attacks targeted attacks financial institutions russia company generally involved series international operations leverages close cooperation international law enforcement agencies get criminals wherever hide according group-ib 80 high-profile investigation cases field high-tech crime russia supported group-ib experts 2010 group-ib established largest computer forensics laboratory eastern europe 2011 company established computer emergency response team cert —the first round-the-clock computer security incident response team eastern europe called cert-gib status competent security organization recognized coordination center tld ru administrator national top-level domains .ru .рф collaboration certs worldwide company developed series effective intellectual property protection services group-ib successfully protected sochi 2014 olympic brand products ticket sales blocked pirated links tv series movies owned sony pictures paramount pictures fox tv series discovery channel amedia exclusive rights hbo tv series russia well fraudulent websites abusing brands popular banks payment systems since 2012 group-iв developing early warning system provide cyber defence companies around world 2015 gartner included group-ib core product—group-ib intelligence—in top 7 global threat intelligence solutions along products developed ibm fireeye rsa check point since 2007 group-ib cooperating microsoft 2015 two companies presented joint research economic impact cyber-attacks group-ib resident moscow-based skolkovo foundation dubbed russian silicon valley part skolkovo innovative projects group-ib created so-called cybercop global counter-cybercrime system company also established additional office innopolis—a science park tatarstan russia 2010 leta group investment management company information technology acquired 50 group-ib assets 2013 group-ib management bought leta group share mid-2016 russian-founded altera capital run capital bought 10 percent stake group-ib according company announcement group-ib leverage investments develop products create r hubs middle east southeast asia latin america well hire local forensic specialists improve sales performance american european asian markets according gartner involved high-profile investigations allows group-ib get information cybercriminals relationships intelligence addition investigation materials forensics expertise gib threat data collection based high-tech infrastructure includes gib intelligence service uses personalized information security strategy planning making time-sensitive decisions tweaking protection tools gives time incidents prevention allowing urgently discover theft clients employees identifiers track modifications tactics tools used criminal groups potentially interested company prioritize threats based expert forecasts tds hardware software unit preventing infection vulnerabilities usage corporate networks tds sensors track suspicious activities corporate network cert-gib experts reveal critical threats immediately inform information security service help put stop incident evolving tds polygon allows start isolated environ suspicious files downloaded users received mail obtain objective conclusion degree harmfulness based classification formed computerized training pattern secure bank deletes blind spots online-payments security diagnosing signs infection remote controlling client machine identifiers compromised authorization secure portal prevents unauthorized access personal accounts personal data web users bonus accounts various fraudulent scenarios using bots competitor offers displays portal site may 2017 group-ib issued report proved connection lazarus group stole 18 mln bangladesh central bank conducted number attacks polish banks well attempted infect hundreds financial organizations 30 countries around globe including european central bank central banks russia brazil venezuela – north korea company experts made research complex technological infrastructure communications channels concealment techniques presented new evidence lazarus attribution north korea revealed details attack july 2016 group masked cyber-criminals jackpotted 34 atms operated first bank one taiwan largest banks perpetrators stole 83.27 2m usd according cctv footage thieves used cellphones trigger atms automatically dispense money group-ib experts first discover jackpotting attack tactics used cobalt gang force atms spit cash using malware group-ib released report cobalt logical attacks atms provided detailed analysis attack scheme get bank internal network hackers used spear phishing emails malicious attachment emails purported come european central bank atm maker wincor nixdorf local banks establishing control bank internal network criminals searched network segments could gain access atms workstations bank employees control atms access atms obtained uploaded specific software allowing criminals control cash dispensers february 2016 group-ib published report titled analysis attacks trading bank card systems first major successful attack trading system provoking major exchange volatility february 2015 corkow criminal group infected trading system terminal kazan-based energobank using specialized trojan software resulting trades 400 million hackers moved ruble-dollar rate 15 percent minutes moscow exchange bank claimed losses 244 million rubles 3.2 million due trades march 2016 group-ib published report activity buhtrap criminal group managed conduct 13 successful attacks russian banks total amount 1.8 billion rubles 25.7 million august 2015 february 2016 high effectiveness attacks achieved due spear phishing mailouts including sent acting central bank russia used criminals gain access corporate network criminals obtained access computers running automated working station central bank client aws cbc free software delivers payment documents behalf central bank performed fraudulent transactions acting bank attack scheme outlined report published group-ib later used perform thefts via swift buhtrap first hacker group using network worm infect overall bank infrastructure significantly increased difficulty removing malicious functions network result banks shut whole infrastructure worm able gain full control network using single infected machine late 2014 fox-it group-ib jointly released report anunak aka carbanak hacker group stolen 1 billion rubles 50 russian banks europe anunak attacked pos terminals large retail store chains data several million clients infected group performed successful thefts since early 2015 autumn 2015 novel technique targeted attacks called reverse atm attack allowed criminals steal money atms money mules criminal payment agents would deposit small sums unembossed cards legitimate accounts immediately withdrawing 'd put also took receipt atm contained payment reference number amount withdrawn information sent hackers would use data access thousands point sale terminals primarily based us czech republic create reversal operation terminal tricked bank believing withdrawal funds cancelled point sale terminal looked though goods returned payment declined whilst banks appeared atm withdrawal cancelled funds returned account though perpetrators already taken cash process repeated money remaining target atm attacks criminals managed steal 252 million rubles 3.8 million five large russian banks fraud longer perpetrated due additional security systems implemented banks assistance visa mastercard according report released group-ib march 2015 hackers self-proclaimed islamic state iraq levant isis attacked 600 russian internet resources 2014 criminals primarily defaced websites placing pictures video isis propaganda hackers believed attacked government organizations banks popular resources also galleries schools attacks chaotic massive researchers believe aimed gain experience perform reconnaissance russian internet according group-ib report attacks performed isis cyber division cyber caliphate 3 criminal groups called team system dz fallaga team global islamic caliphate totalling 40 members autumn 2013 group-ib supported investigative activity resulted arrest dmitry fedotov known nickname paunch author infamous blackhole exploit pack time used conduct 40 infections worldwide criminal sentenced 7 years prison according national legislation april 2016 2012 law enforcement agencies assistance sberbank group-ib arrested largest criminal gang russia two years group managed infect 1.5 million computers worldwide steal approximately 250 million bank accounts total 100 banks suffered attacks throughout world group-ib engaged partners netherlands canada investigation enabled company identify full chain actors including organizer owned botnet operators cashers money mules first case russia members criminal group arrested leaders sentenced 5 8 years prison year members criminal groups used carberp modifications attack individuals companies arrested summer 2012 hacker known germes aka arashi arrested creator one largest global botnets infected 6 million computers following 7 members hodprot criminal group detained one oldest russian hacker gangs known stolen approximately 125 million rubles russian bank accounts members criminal group arrested even though known used control servers located abroad – netherlands germany france usa april 2015 members hacker group infected 340,000 android-based devices steal money bank accounts arrested assistance group-ib sberbank hackers dubbed malware fifth reich used nazi symbols control system hackers distributed malware via sms messages containing link download program masked adobe flash player trojan enabled hackers intercept sms notifications banks furtively confirm money transfer hackers accounts attack scheme similar used waplook first criminal group members arrested money theft individuals using malicious mobile apps russia group leaders arrested september 2014 assistance group-ib may 2017 russian ministry internal affairs announced arrest cron gang infected 1 mln smartphones group-ib provided expert support investigation cron banking trojan spread two ways—via sms user clicked link message installed malicious application disguised legitimate application navitel framaroot pornhub avito etc hackers infected 3,500 smartphones daily managed steal 1 mln total june 2015 twin brother hackers reportedly arrested st. petersburg russia part police operation assisted group-ib 4 years popelysh brothers stolen money client accounts vtb24 online banking using fake bank page grab client data first case russia legal proceedings taken criminals using phishing schemes | [
2432,
10756,
2154,
9293,
10190,
4945,
3858,
4083,
4883,
4979,
5563,
7515,
11476,
7418,
3323,
8668
] | Test |
7,523 | 1 | Microsoft_Access:microsoft access microsoft access database management system dbms microsoft combines relational microsoft jet database engine graphical user interface software-development tools member microsoft office suite applications included professional higher editions sold separately microsoft access stores data format based access jet database engine also import link directly data stored applications databases software developers data architects power users use microsoft access develop application software like microsoft office applications access supported visual basic applications vba object-based programming language reference variety objects including legacy dao data access objects activex data objects many activex components visual objects used forms reports expose methods properties vba programming environment vba code modules may declare call windows operating system operations prior introduction access borland paradox dbase fox foxpro dominated desktop database market microsoft access first mass-market database program windows microsoft purchase foxpro 1992 incorporation fox rushmore query optimization routines access microsoft access quickly became dominant database windows effectively eliminating competition failed transition ms-dos world microsoft first attempt sell relational database product mid 1980s microsoft obtained license sell late 1980s microsoft developed solution codenamed omega confirmed 1988 database product windows os/2 development going include eb embedded basic language going language writing macros microsoft applications unification macro languages happen introduction visual basic applications vba omega also expected provide front end microsoft sql server application resource-hungry reports working slowly 386 processors available time scheduled released 1st quarter 1990 1989 development product reset rescheduled delivered sooner january 1991 parts project later used microsoft projects cirrus codename access thunder codename visual basic embedded basic engine used access premiere omega project demonstrated 1992 several journalists included features available access omega project scrapped developers assigned cirrus project assigned team created visual basic goal create competitor applications like paradox dbase would work windows microsoft acquired foxpro rumors microsoft project might get replaced company decided develop parallel assumed project would make use extensible storage engine jet blue end support microsoft jet database engine jet red provided project used code omega project pre-release version visual basic july 1992 betas cirrus shipped developers name access became official name product access originally used older terminal emulation program microsoft years program abandoned decided reuse name 1992 microsoft released access version 1.0 november 13 1992 access 1.1 release may 1993 improve compatibility microsoft products include access basic programming language 1994 microsoft specified minimum hardware requirements access v2.0 microsoft windows v3.1 4 mb ram required 6 mb ram recommended 8 mb available hard disk space required 14 mb hard disk space recommended product shipped seven 1.44 mb diskettes manual shows 1994 copyright date office 95 microsoft access 7.0 a.k.a access 95 became part microsoft office professional suite joining microsoft excel word powerpoint transitioning access basic vba since microsoft released new versions microsoft access release microsoft office includes access 97 version 8.0 access 2000 version 9.0 access 2002 version 10.0 access 2003 version 11.5 access 2007 version 12.0 access 2010 version 14.0 access 2013 version 15.0 versions 3.0 3.5 microsoft jet database engine used access 7.0 later-released access 97 respectively critical issue made versions access unusable computer 1 gb memory microsoft fixed problem jet 3.5/access 97 post-release never fixed issue jet 3.0/access 95 native access database format jet mdb database also evolved years formats include access 1.0 1.1 2.0 7.0 97 2000 2002 2007 significant transition access 97 access 2000 format backward compatible earlier versions access newer versions access support access 2000 format new features added access 2002 format used access 2002 2003 2007 2010 microsoft access 2000 increased maximum database size 2gb 1gb access 97 microsoft access 2007 introduced new database format accdb supports links sharepoint lists complex data types multivalue attachment fields new field types essentially recordsets fields allow storage multiple values files one field microsoft access 2007 also introduced file attachment field stored data efficiently ole object linking embedding field microsoft access 2010 introduced new version accdb format supported hosting access web solutions sharepoint 2010 server first time allowed access solutions run without install access pc first support mac users user sharepoint site sufficient rights could use access web solution copy access still required developer create access web solution desktop version access remained part access 2010 access web solutions desktop solutions automation macro language vba access automatically converted javascript data longer access database sharepoint lists access desktop database could link sharepoint data hybrid applications possible sharepoint users needing basic views edits could supported sophisticated traditional solutions could remain desktop access database microsoft access 2013 offers traditional access desktop solutions plus significantly updated sharepoint 2013 web solution access web model access 2010 replaced new architecture stores data actual sql server databases unlike sharepoint lists offers true relational database design referential integrity scalability extensibility performance one would expect sql server database solutions created sharepoint 2013 offer modern user interface designed display multiple levels relationships viewed edited along resizing different devices support touch access 2013 desktop similar access 2010 several features discontinued including support access data projects adps pivot tables pivot charts access data collections source code control replication legacy features access desktop database maximum size remained 2gb since 2000 version addition using database storage file microsoft access also may used 'front-end program products act 'back-end tables microsoft sql server non-microsoft products oracle sybase multiple backend sources used microsoft access jet database accdb mdb formats similarly applications visual basic asp.net visual studio .net use microsoft access database format tables queries microsoft access may also part complex solution may integrated technologies microsoft excel microsoft outlook microsoft word microsoft powerpoint activex controls access tables support variety standard field types indices referential integrity including cascading updates deletes access also includes query interface forms display enter data reports printing underlying jet database contains objects multi-user handles record-locking repetitive tasks automated macros point-and-click options also easy place database network multiple users share update data without overwriting work data locked record level significantly different excel locks entire spreadsheet template databases within program download microsoft website options available upon starting access allow users enhance database predefined tables queries forms reports macros database templates support vba code microsoft templates include vba code programmers create solutions using vba similar visual basic 6.0 vb6 used throughout microsoft office programs excel word outlook powerpoint vb6 code including use windows api calls used vba power users developers extend basic end-user solutions professional solution advanced automation data validation error trapping multi-user support number simultaneous users supported depends amount data tasks performed level use application design generally accepted limits solutions 1 gb less data access supports 2 gb performs quite well 100 fewer simultaneous connections 255 concurrent users supported capability often good fit department solutions using access database solution multi-user scenario application split means tables one file called back end typically stored shared network folder application components forms reports queries code macros linked tables another file called front end linked tables front end point back end file user access application would receive copy front end file applications run complex queries analysis across large datasets would naturally require greater bandwidth memory microsoft access designed scale support data users linking multiple access databases using back-end database like microsoft sql server latter design amount data users scale enterprise-level solutions microsoft access role web development prior version 2010 limited user interface features access forms reports work windows versions 2000 2003 access object type called data access pages created publishable web pages data access pages longer supported microsoft jet database engine core access accessed technologies odbc ole db data i.e. tables queries accessed web-based applications developed asp.net php java use microsoft terminal services remote desktop application windows server 2008 r2 organizations host access applications run web technique scale way web application would appropriate limited number users depending configuration host access 2010 allows databases published sharepoint 2010 web sites running access services web-based forms reports run modern web browser resulting web forms reports accessed via web browser n't require add-ins extensions e.g activex silverlight access 2013 create web applications directly sharepoint 2013 sites running access services access 2013 web solutions store data underlying sql server database much scalable robust access 2010 version used sharepoint lists store data access services sharepoint since retired compiled version access database file extensions .mde /accde .ade accde works access 2007 later created prevent user accessing design surfaces modify module code forms reports mde ade file microsoft access database file modules compiled editable source code removed .mde .ade versions access database used end-user modifications allowed application ’ source code kept confidential microsoft also offers developer extensions download help distribute access 2007 applications create database templates integrate source code control microsoft visual sourcesafe users create tables queries forms reports connect together macros advanced users use vba write rich solutions advanced data manipulation user control access also report creation features work data source access access original concept access end users able access data source features include import export data many formats including excel outlook ascii dbase paradox foxpro sql server oracle also ability link data existing location use viewing querying editing reporting allows existing data change ensuring access uses latest data perform heterogeneous joins data sets stored across different platforms access often used people downloading data enterprise level databases manipulation analysis reporting locally also jet database format mdb accdb access 2007 contain application data one file makes convenient distribute entire application another user run disconnected environments one benefits access programmer perspective relative compatibility sql structured query language — queries viewed graphically edited sql statements sql statements used directly macros vba modules manipulate access tables users mix use vba macros programming forms logic offers object-oriented possibilities vba also included queries microsoft access offers parameterized queries queries access tables referenced programs like vb6 .net dao ado microsoft access vba reference parameterized stored procedures via ado desktop editions microsoft sql server used access alternative jet database engine support started msde microsoft sql server desktop engine scaled version microsoft sql server 2000 continues sql server express versions sql server 2005 2008 microsoft access file server-based database unlike client–server relational database management systems rdbms microsoft access implement database triggers stored procedures transaction logging access 2010 includes table-level triggers stored procedures built ace data engine thus client-server database system requirement using stored procedures table triggers access 2010 tables queries forms reports macros developed specifically web based applications access 2010 integration microsoft sharepoint 2010 also highly improved 2013 edition microsoft access introduced mostly flat design ability install apps office store introduce new features theme partially updated 2016 dark theme created access asp.net web forms query microsoft access database retrieve records display browser sharepoint server 2010 via access services allows access 2010 databases published sharepoint thus enabling multiple users interact database application standards-compliant web browser access web databases published sharepoint server use standard objects tables queries forms macros reports access services stores objects sharepoint access 2013 offers ability publish access web solutions sharepoint 2013 rather using sharepoint lists data source access 2013 uses actual sql server database hosted sharepoint sql azure offers true relational database referential integrity scalability maintainability extensibility compared sharepoint views access 2010 used macro language enhanced support sophisticated programming logic database level automation microsoft access also import link directly data stored applications databases microsoft office access 2007 newer import link microsoft offers free runtime versions microsoft access allow users run access desktop application without needing purchase install retail version microsoft access allows access developers create databases freely distributed unlimited number end-users runtime versions access 2007 later downloaded free microsoft runtime versions access 2003 earlier part office developer extensions/toolkit required separate purchase runtime version allows users view edit delete data along running queries forms reports macros vba module code runtime version allow users change design microsoft access tables queries forms reports macros module code runtime versions similar corresponding full version access usually compatible earlier versions example access runtime 2010 allows user run access application made 2010 version well 2007 2000 due deprecated features access 2013 runtime version also unable support older features development one simulate runtime environment fully functional version using codice_1 command line option access stores database tables queries forms reports macros modules access jet database single file query development access offers query designer graphical user interface allows users build queries without knowledge structured query language query designer users show datasources query tables queries select fields want returned clicking dragging grid one set joins clicking dragging fields tables fields tables access allows users view manipulate sql code desired access table including linked tables different data sources used query access also supports creation pass-through queries snippets sql code address external data sources use odbc connections local machine enables users interact data stored outside access program without using linked tables jet users construct pass-through queries using sql syntax supported external data source developing reports design view additions changes controls cause linked queries execute background designer forced wait records returned able make another change feature turned non-programmers use macro feature automate simple tasks series drop-down selections macros allow users easily chain commands together running queries importing exporting data opening closing forms previewing printing reports etc macros support basic logic if-conditions ability call macros macros also contain sub-macros similar subroutines access 2007 enhanced macros included error-handling support temporary variables access 2007 also introduced embedded macros essentially properties object event eliminated need store macros individual objects however macros limited functionality lack programming loops advanced coding logic access 2013 significant enhancements introduced access 2013 capabilities macros became fully comparable vba made feature rich web-based application deployments practical via greatly enhanced microsoft sharepoint interface tools well traditional windows desktops common products microsoft office suite programming language used access microsoft vba similar visual basic 6.0 vb6 code stored modules classes code behind forms reports create richer efficient maintainable finished product good error handling professional access applications developed using vba programming language rather macros except web deployment business requirement manipulate data tables queries vba macros microsoft provides two database access libraries com components well dao ado developers also use ole db odbc developing native c/c++ programs access adps direct manipulation sql server data ado required dao appropriate managing data access/jet databases way manipulate complex field types accdb tables database container navigation pane access 2007 later versions system automatically categorizes object type e.g. table query macro many access developers use leszynski naming convention though universal programming convention dbms-enforced rule particularly helpful vba references object names may indicate data type e.g tbl tables qry queries developers deploy microsoft access often individual workgroup projects access 97 speed characterization done 32 users since access 97 access 2003 2007 microsoft access hardware evolved significantly databases 1 gb size fit entirely ram 200 simultaneous users well within capabilities microsoft access course performance depends database design tasks disk-intensive work complex searching querying take time data microsoft access database cached ram processing speed may substantially improve single user data changing past effect packet latency record-locking system caused access databases run slowly virtual private network vpn wide area network wan jet database broadband connections mitigated issue performance also enhanced continuous connection maintained back-end database throughout session rather opening closing table access access database performance vpn wan suffers client using remote desktop protocol microsoft terminal services provide effective solution access databases linked sql server access data projects work well vpns wans july 2011 microsoft acknowledged intermittent query performance problem versions access windows 7 windows server 2008 r2 due nature resource management vastly different newer operating systems issue severely affects query performance access 2003 earlier jet database engine code well access 2007 later access database engine ace microsoft issued hotfixes kb2553029 access 2007 kb2553116 access 2010 fix issue jet 4.0 mainstream support earlier versions microsoft access ability distribute applications required purchase developer toolkit access 2007 2010 access 2013 runtime version offered free download making distribution royalty-free applications possible windows xp vista 7 windows 8.x microsoft access applications adopt split-database architecture single database divided separate back-end file contains data tables shared file server front-end containing application objects queries forms reports macros modules front-end access application distributed user desktop linked shared database using approach user copy microsoft access runtime version installed machine along application database reduces network traffic since application retrieved use front-end database still contain local tables storing user settings temporary data split-database design also allows development application independent data one disadvantage users may make various changes local copy application makes hard manage version control new version ready front-end database replaced without impacting data database microsoft access two built-in utilities database splitter linked table manager facilitate architecture linked tables access use absolute paths rather relative paths development environment either path production environment dynamic-linker routine written vba large access databases may performance issues sql backend considered circumstances less issue entire database fit pc ram since access caches data indexes scale access applications enterprise web solutions one possible technique involves migrating microsoft sql server equivalent server database client–server design significantly reduces maintenance increases security availability stability transaction logging access 2000 access 2010 included feature called upsizing wizard allowed users upgrade databases microsoft sql server odbc client–server database feature removed access 2013 additional solution sql server migration assistant access ssma continues available free download microsoft variety upgrading options available migrating data queries sql server access database linked sql database however certain data types problematic notably yes/no microsoft access three states yes/no true/false data type empty no/false zero yes/true -1 corresponding sql server data type binary two states permissible values zero 1 regardless sql server still easiest migration retrieving data linked tables optimized records needed scenario may operate less efficiently would otherwise optimal sql server example instances multi-table joins still require copying whole table across network previous versions access including access 2010 databases also converted access data projects adp tied directly one sql server database feature removed access 2013 adp support ability directly create modify sql server objects tables views stored procedures sql server constraints views stored procedures significantly reduce network traffic multi-table joins sql server supports temporary tables links data sources beyond single sql server database finally access databases completely replaced another technology asp.net java data converted however migration may dictate major effort since access sql language powerful superset standard sql access application procedures whether vba macros written relatively higher level versus currently available alternatives robust comprehensive note access macro language allowing even higher level abstraction vba significantly enhanced access 2010 access 2013 many cases developers build direct web-to-data interfaces using asp.net keeping major business automation processes administrative reporting functions n't need distributed everyone access information workers maintain access data migrate sql server directly queries migrate successfully situations may need translate vba functions user defined functions t–sql .net functions procedures crosstab queries migrated sql server using pivot command microsoft access applications made secure various methods basic password access control relatively weak form protection higher level protection use workgroup security requiring user name password users groups specified along rights object type individual object level used specify people read-only data entry rights may challenging specify separate workgroup security file contains settings used manage multiple databases workgroup security supported access 2007 access 2010 accdb database format although access 2007 access 2010 still support mdb databases databases also encrypted accdb format offers significantly advanced encryption previous versions additionally database design needs secured prevent changes access databases locked/protected source code compiled converting database .mde file changes vba project modules forms reports need made original mdb reconverted mde access 2007 access 2010 accdb database converted accde file tools available unlocking decompiling although certain elements including original vba comments formatting normally irretrievable microsoft access saves information following file formats access versions 2.0 7.0 office 95 version launched word 7 office 95 products ole 2 capabilities access 7 shows compatible word 7 version number 13 skipped | [
4614,
522,
6166,
8227,
5669,
8230,
4647,
10286,
6709,
2046,
5691,
9286,
72,
2632,
4680,
8781,
83,
608,
10848,
8804,
10340,
10342,
8808,
9328,
5749,
10358,
2681,
5242,
641,
2183,
6797,
10899,
10900,
10389,
10902,
11414,
3224,
11422,
10413,
... | Test |
7,524 | 2 | Visual_Basic_Extension:visual basic extension computer programming visual basic extension commonly abbreviated vbx custom control component model used microsoft visual basic versions 1.0 3.0 still supported 16-bit version version 4.0 made obsolete ocxs vbx also supported first 16-bit version borland delphi vbx specification created developers could extend visual basic since time visual basic interpreted language limited speed vbxs often written c c++ provided ability create powerful efficient user interface sub-components could assembled applications using visual basic glue visual basic 4.0 added support newer ole controls ocxs became activex controls implicitly deprecating vbx controls ocxs based component object model version visual basic come many controls incorporating vbx controls visual basic microsoft spawned first commercially viable market reusable software components third parties created large market custom controls resale vbx components called custom controls microsoft development team envisioned visual control components like toggle switch button enterprising third party software component developers saw opportunities use vbx specification non-visual components components creating zip files manipulating low-level system settings communicating tcp/ip | [
5395,
10029,
847
] | Test |
7,525 | 4 | Forensic_Toolkit:forensic toolkit forensic toolkit ftk computer forensics software made accessdata scans hard drive looking various information example locate deleted emails scan disk text strings use password dictionary crack encryption toolkit also includes standalone disk imaging program called ftk imager tool saves image hard disk one file segments may later reconstructed calculates md5 hash values confirms integrity data closing files result image file saved several formats including dd raw accessdata forensic toolkit version 5.5 | [
2437,
7557,
1801,
6797,
5010,
4500,
8469,
3099,
7968,
6177,
1315,
5284,
11182,
7983,
10290,
4789,
2231,
4408,
8635,
2494,
830,
7369,
6475,
10189,
4049,
4834,
5475,
9319,
7160,
11642
] | Test |
7,526 | 4 | W3af:w3af w3af web application attack audit framework open-source web application security scanner project provides vulnerability scanner exploitation tool web applications provides information security vulnerabilities use penetration testing engagements scanner offers graphical user interface command-line interface w3af divided two main parts core plug-ins core coordinates process provides features consumed plug-ins find vulnerabilities exploit plug-ins connected share information using knowledge base plug-ins categorized discovery audit grep attack output mangle evasion bruteforce w3af started andres riancho march 2007 many years development community july 2010 w3af announced sponsorship partnership rapid7 rapid7 sponsorship project able increase development speed keep growing terms users contributors | [
899,
5636,
1926,
1803,
3473,
3604,
1429,
2084,
10412,
7983,
11567,
823,
7228,
9293,
4689,
1369,
4198,
8554,
10492,
2558,
9727
] | None |
7,527 | 4 | Tempest_(codename):tempest codename tempest u.s. national security agency specification nato certification referring spying information systems leaking emanations including unintentional radio electrical signals sounds vibrations tempest covers methods spy upon others shield equipment spying protection efforts also known emission security emsec subset communications security comsec nsa methods spying computer emissions classified protection standards released either nsa department defense protecting equipment spying done distance shielding filtering masking tempest standards mandate elements equipment distance walls amount shielding buildings equipment distance separating wires carrying classified vs. unclassified materials filters cables even distance shielding wires equipment building pipes noise also protect information masking actual data much tempest leaking electromagnetic emanations also encompasses sounds mechanical vibrations example possible log user keystrokes using motion sensor inside smartphones compromising emissions defined unintentional intelligence-bearing signals intercepted analyzed side-channel attack may disclose information transmitted received handled otherwise processed information-processing equipment world war ii bell telephone supplied u.s. military device called 131-b2 mixer encrypted teleprinter signals xor ’ ing key material one-time tapes sigtot system rotor based key generator called sigcum used electromechanical relays operation later bell informed signal corps able detect electromagnetic spikes distance mixer recover plain text meeting skepticism phenomenon discovered laboratory could really dangerous demonstrated ability recover plain text signal corps ’ crypto center varick st lower manhattan alarmed signal corps asked bell investigate identified three problem areas radiated signals signals conducted wires coming facility magnetic fields suggested shielding filtering masking possible solutions bell developed modified mixer 131-a1 shielding filtering proved difficult maintain expensive deploy instead relevant commanders warned problem advised control 100 feet diameter zone around communications center prevent covert interception things left 1951 cia rediscovered problem 131-b2 mixer found could recover plain text line carrying encrypted signal quarter mile away filters signal power lines developed control zone extended 200 feet based commanders could expected accomplish technical criteria long process evaluating systems developing possible solutions followed compromising effects discovered fluctuations power line rotors stepped question exploiting noise electromechanical encryption systems raised late 1940 ’ re-evaluated possible threat acoustical emanations could reveal plain text pick device close source bad news even mediocre microphones would soundproofing room made problem worse removing reflections providing cleaner signal recorder 1956 naval research laboratory developed better mixer operated much lower voltages currents therefore radiated far less incorporated newer nsa encryption systems however many users needed higher signal levels drive teleprinters greater distances multiple teleprinters connected newer encryption devices included higher level signal option nsa began developing techniques specifications filtering shielding grounding separating conductors carried sensitive plain text lines might leave secure environment red/black separation dogma 1958 joint policy called nag-1 set radiation standards equipment installations based 50 foot limit control also specified classification levels various aspects tempest problem policy adopted canada uk next year six organizations navy army air force nsa cia state department bulk work difficulties implementation quickly emerged computer processing intelligence data becoming important computers peripherals evaluated many proved problematical friden flexowriter popular i/o typewriter time proved among strongest emitters readable far 3,200 feet field tests u.s. communications security board uscsb produced flexowriter policy banned use overseas classified information limited use confidential level u.s. within 400 foot security zone users found policy onerous impractical later nsa found similar problems introduction cathode ray tube crt displays also powerful radiators multi-year process moving policy recommendations strictly enforced tempest rules resulting directive coordinated 22 separate agencies 5200.19 signed secretary defense robert mcnamara december 1964 still took years fully implement nsa ’ formal implementation took effect june 1966 meanwhile problem acoustic emanations became critical discovery 900 microphones u.s. installations overseas behind iron curtain responses build room-within-a-room enclosures transparent nicknamed fish bowl units fully shielded contain electronic emanations unpopular personnel supposed work inside calling meat lockers sometimes left door open none less installed critical locations embassy moscow two one state department use one military attaches unit installed nsa key generation equipment cost 134,000 tempest standards continued evolve 1970s later newer testing methods nuanced guidelines took account risks specific locations situations security needs often met resistance according nsa david g. boak still hear today circles rigorous technical standards whittled interest money time frighteningly reminiscent arrogant third reich enigma cryptomachine many specifics tempest standards classified elements public current united states nato tempest standards define three levels protection requirements additional standards include nsa department defense declassified tempest elements freedom information act requests documents black many key values descriptions declassified version tempest test standard heavily redacted emanation limits test procedures blacked redacted version introductory tempest handbook nacsim 5000 publicly released december 2000 additionally current nato standard sdip-27 2006 known amsg 720b amsg 788a amsg 784 still classified despite declassified documents give information shielding required tempest standards example military handbook 1195 includes chart right showing electromagnetic shielding requirements different frequencies declassified nsa specification shielded enclosures offers similar shielding values requiring minimum 100 db insertion loss 1 khz 10 ghz since much current requirements still classified publicly available correlations 100 db shielding requirement newer zone-based shielding standards addition many separation distance requirements elements provided declassified nsa red-black installation guidance nstissam tempest/2-95 information-security agencies several nato countries publish lists accredited testing labs equipment passed tests united states army also tempest testing facility part u.s. army information systems engineering command fort huachuca arizona similar lists facilities exist nato countries tempest certification must apply entire systems individual components since connecting single unshielded component cable device otherwise secure system could dramatically alter system rf characteristics tempest standards require red/black separation i.e. maintaining distance installing shielding circuits equipment used handle plaintext classified sensitive information encrypted red secured circuits equipment black latter including carrying encrypted signals manufacture tempest-approved equipment must done careful quality control ensure additional units built exactly units tested changing even single wire invalidate tests one aspect tempest testing distinguishes limits spurious emissions e.g fcc part 15 requirement absolute minimal correlation radiated energy detectable emissions plaintext data processed 1985 wim van eck published first unclassified technical analysis security risks emanations computer monitors paper caused consternation security community previously believed monitoring highly sophisticated attack available governments van eck successfully eavesdropped real system range hundreds metres using 15 worth equipment plus television set consequence research emanations sometimes called van eck radiation eavesdropping technique van eck phreaking although government researchers already aware danger bell labs noted vulnerability secure teleprinter communications world war ii able produce 75 plaintext processed secure facility distance 80 feet 24 metres additionally nsa published tempest fundamentals nsa-82-89 nacsim 5000 national security agency classified february 1 1982 addition van eck technique successfully demonstrated non-tempest personnel korea korean war 1950s markus kuhn discovered several low-cost techniques reducing chances emanations computer displays monitored remotely crt displays analog video cables filtering high-frequency components fonts rendering computer screen attenuate energy text characters broadcast modern flat panel displays high-speed digital serial interface dvi cables graphics controller main source compromising emanations adding random noise least significant bits pixel values may render emanations flat-panel displays unintelligible eavesdroppers secure method since dvi uses certain bit code scheme tries transport balanced signal 0 bits 1 bits may much difference two pixel colors differ much color intensity emanations differ drastically even last bit pixel color changed signal received eavesdropper also depends frequency emanations detected signal received many frequencies frequency signal differs contrast brightness related certain color screen usually technique smothering red signal noise effective unless power noise sufficient drive eavesdropper receiver saturation thus overwhelming receiver input led indicators computer equipment source compromising optical emanations one technique involves monitoring lights dial-up modem almost modems flash led show activity common flashes directly taken data line fast optical system easily see changes flickers data transmitted wire recent research shown possible detect radiation corresponding keypress event wireless radio keyboards also traditional wired keyboards even laptop keyboards 1970s onward soviet bugging us embassy ibm selectric typewriters allowed keypress-derived mechanical motion bails attached magnets detected implanted magnetometers converted via hidden electronics digital radio frequency signal eight character transmission provided soviet access sensitive documents typed us facilities moscow leningrad 2014 researchers introduced airhopper bifurcated attack pattern showing feasibility data exfiltration isolated computer nearby mobile phone using fm frequency signals 2015 bitwhisper covert signaling channel air-gapped computers using thermal manipulations introduced bitwhisper supports bidirectional communication requires additional dedicated peripheral hardware later 2015 researchers introduced gsmem method exfiltrating data air-gapped computers cellular frequencies transmission generated standard internal bus renders computer small cellular transmitter antenna february 2018 research published describing low frequency magnetic fields used escape sensitive data faraday-caged air-gapped computers malware code-named ’ odini ’ control low frequency magnetic fields emitted infected computers regulating load cpu cores | [
7424,
9857,
4,
9233,
150,
10909,
8356,
4389,
9640,
11432,
3629,
11695,
7090,
1083,
2558,
4807,
6344,
7887,
7635,
11349,
1121,
5986,
2403,
7652,
5110,
8574
] | None |
7,528 | 4 | Committee_on_National_Security_Systems:committee national security systems committee national security systems cnss united states intergovernmental organization sets policy security us security systems national security telecommunications information systems security committee nstissc established national security directive 42 national policy security national security telecommunications information systems dated 5 july 1990 october 16 2001 president george w. bush signed executive order 13231 critical infrastructure protection information age re-designating national security telecommunications information systems security committee nstissc committee national security systems cnss holds discussions policy issues sets national policy directions operational procedures guidance information systems operated u.s. government contractors agents either contain classified information involve intelligence activities involve cryptographic activities related national security involve command control military forces involve equipment integral part weapon weapons system critical direct fulfillment military intelligence missions department defense chairs committee membership consists representatives 21 u.s. government departments agencies voting privileges include cia dia dod doj fbi nsa national security council united states military services members voting committee include disa nga nist nro operating agency cnss appears national security agency serves primary contact public inquiries cnss defines several standards include standards training security current certifications include | [
3552,
9088,
5636,
999,
4798,
5774,
7887,
8462,
4689,
8881,
7388,
5780,
1369,
10170,
316,
5373,
2558
] | Test |
7,529 | 6 | WinAce:winace winace archiving program windows ace compressed archive format built-in support common archive formats types zip rar cab also offer freeware free software command-line interface decompression including listing testing program called unace macos linux beginning version 2.65 winace bundled whenu savenow adware program bundle removed current version 2.69 replaced opt-in sponsorship deal via trialpay application seems discontinued since n't seen updates since 2007 august 2017 also official website www.winace.com went offline web.archive.org snapshots july 2017 last ones show domain parked message text-based version dos called commandline ace addition ace format built-in support common archive format types arj rar zip partially lzh program distribution contains commandline ace unace decompressor programs versions dos os/2 windows support long file names despite name commandline ace contains full-fledged norton commander-like interface run commandline fullscreen mode unace run commandline mode commandline ace used file manipulation similar existing norton commander | [
6022,
10121,
1420,
6797,
1940,
3222,
9880,
3114,
10027,
7983,
950,
823,
6713,
2755,
11076,
1352,
4296,
10317,
10575,
4561,
722,
11614,
1631,
3296,
9953,
5858,
6759,
4459,
877,
237,
1646,
7667,
6389,
4089,
894,
10623
] | Test |
7,530 | 4 | XSA:xsa computer science xsa better known cross-server attack networking security intrusion method allows malicious client compromise security website service server using implemented services server may secure general xsa demonstrated websites yet sometimes used conjunction services located server xsa method allows malicious client use services remote server implements order attack another service server network website hosting companies offer hosting large even little amounts separate websites vulnerable method attack amount access services php webserver give client allows client access website configurations files passwords like term 'xsa first coined deadlydata prominent computer hacker early 2000s voice communications software teamspeak invented pioneered method intrusion coined shortened term describe act performing cross-server attacks xsas used community supports methods subsets method give computer hacker malicious individuals terminology attack websites using software located server | [
8644,
2470
] | Test |
7,531 | 2 | Quaject:quaject computer science quaject object-like data structure containing data code pointers code exposed interface form callentries accept list callentries quajects callbacks callouts developed alexia massalin 1989 synthesis kernel named qua machine unique hardware platform built massalin origin term 'qua unclear massalin claims humorously sound made koalas main purpose quajects provide abstraction manage self-modifying code allowing runtime code optimizing per-object basis original synthesis kernel required quajects written hand-developed assembly language done avoid developing complex compiler massalin noted just-in-time compilation jit high-level programming language permits runtime code generation lisp smalltalk also apply approach though also asserted complexity compiler likely prohibitive quajects differ conventional objects two key ways first always use form dependency injection pattern manage interfaces quajects continuations quaject list callentry references part quaject creation may updated quaject lifetime second critically given quaject set methods unique specific quaject methods type class quajects stored one templates rather fixed code shared methods accessed common table pointers individual quajects also methods generated specifically tailor performance quaject behavior | [
8609,
9330,
477,
6502
] | None |
7,532 | 7 | ZipBooks:zipbooks zipbooks accounting software company based american fork utah produces software name zipbooks founded tim chaves june 2015 backed venture capital firm peak ventures company secured additional 2 million funding july 2016 2017 awarded 100,000 economic grant utah governor office economic development technology commercialization innovation program zipbooks core modules invoicing transactions bills reporting time tracking contacts payroll accrual accounting added 2017 application available g suite ios slack web application computerworld compared zipbooks favorably accounting software pc magazine praised user experience stated lacked lot features competing sites offer | [
7489,
1539,
5224,
11113,
10509,
7983,
1008,
1680,
467,
8307,
6367
] | Train |
7,533 | 7 | Zapier:zapier zapier american for-profit corporation web-based service allows end users integrate web applications use although zapier based sunnyvale california employs workforce 200 employees located around united states 13 countries zapier started columbia missouri co-founders wade foster bryan helmig mike knoop part first startup weekend columbia 2011 initially submitting application winter 2012 funding cycle rejected built initial prototype 25 apps accepted combinator startup seed accelerator summer 2012 funding cycle result acceptance company relocated mountain view california spring 2012 october year zapier received 1.3 million seed funding round led global venture investment firm bessemer venture partners zapier reached profitability 2014 march 2017 company offered de-location package consisting 10,000 moving reimbursement employees desired move away san francisco bay area widely reported zapier entire workforce works remotely package result increasing housing costs company desire help local employees improve standard living shortly job applications increased 30 employees taken advantage offer zapier provides workflows automate use web applications together often described translator web apis | [
3462,
8554,
10517,
8117,
119
] | None |
7,534 | 2 | CRUX:crux crux lightweight x86-64-optimized linux distribution targeted experienced linux users delivered tar.gz-based package system bsd-style initscripts based linux distribution also utilizes ports system install upgrade applications although crux latin word cross choice name crux meaning per lidén chose sounded cool ends x puts line various unix flavors irix ultrix mac os x ibm aix crux include gui installation program instead user boots kernel stored either cd diskette partitions hard disk drive operating system installed using program fdisk cfdisk creates appropriate file systems various partitions mounts cd nfs share along partitions made previously use package installation script compiles new kernel installs bootloader via shell commands crux implements infrastructure similar bsd-based operating systems package management packages consist pkgfile shell script patches required adjust program work md5sum hashes used verify integrity downloaded files footprint file listing files included packages files downloaded crux software repository compiled installed using prt-get frontend pkgutils software sources downloaded websites respective upstream address specified pkgfile simone rota reviewed crux osnews blog named reviewr reviewed crux 2.2 | [
4611,
3079,
3089,
4113,
8209,
8727,
3097,
543,
11297,
9762,
7204,
9253,
11305,
56,
3129,
4153,
59,
8248,
9276,
4673,
3654,
5190,
3147,
2125,
1107,
1110,
89,
5721,
4192,
3685,
10860,
5742,
2671,
11388,
2692,
8837,
9353,
9873,
11410,
10387,... | Train |
7,535 | 9 | Real-time_Cmix:real-time cmix real-time cmix rtcmix one music-n family computer music programming languages rtcmix descended mix program developed paul lansky princeton university 1978 perform algorithmic composition using digital audio soundfiles ibm 3031 mainframe computer synthesis functions added program renamed cmix 1980s real-time capability added brad garton david topper mid-1990s support tcp socket connectivity interactive control scheduler object-oriented embedding synthesis engine fully featured applications years cmix/rtcmix run variety computer platforms operating systems including next sun microsystems irix linux mac os x always open source project differentiating commercial synthesizers music software currently developed group computer music researchers princeton columbia university university virginia rtcmix number unique highly unusual features compared synthesis signal processing languages one built-in minc parser enables user write c-style code within score file extending innate capability algorithmic composition making closer respects later music software supercollider max/msp uses single-script instruction file score file synthesis signal processing routines called instruments exist compile shared libraries different music-n languages csound instruments exist second file written specification language builds routines simple building blocks organized opcodes unit generators rtcmix similar functionality csound computer music languages however shared lineage means scripts written one language extremely familiar-looking immediately comprehensible users language | [
7172,
8958,
7571,
6933,
6810,
10924,
5037,
823,
7611,
9023,
9665,
3665,
7769,
9565,
7550,
372,
9210,
2045,
7806
] | Validation |
7,536 | 2 | Tatung_Einstein:tatung einstein tatung einstein eight-bit home/personal computer produced taiwanese corporation tatung designed bradford england tatung research laboratories assembled bridgnorth telford england aimed primarily small businesses einstein released united kingdom summer 1984 5,000 exported back taipei later year tatung monitor monochrome colour dot matrix printer also available options plus external disc drives 80 column display card also capable emulating spectrum 48k speculator addon expensive rivals einstein popular contemporary programmers commercially unsuccessful later revised version called tatung einstein 256 suffered similar fate machine physically large option one two built-in three-inch floppy disk drives manufactured hitachi time home computers used ordinary tape recorders storage another unusual feature einstein start-up computer entered simple machine code monitor called mos machine operating system variety software could loaded disk including cp/m-compatible operating system called xtal dos pronounced 'crystal dos created crystal computers torquay basic interpreter xtal basic thanks reliability machine ample memory machine proved useful many software houses use programming porting code machines made namely spectrum 48k amstrad cpc commodore 64 eventually superseded pc atari st development systems choice follow machine einstein256 basically original improved video yamaha v9938 slimline black case like msx specification | [
10533,
2822,
11462,
9322,
4109,
4110,
7983,
1776,
9006,
11311,
9651,
181,
4409,
1403,
2460,
8830,
4991
] | None |
7,537 | 7 | Serverless_computing:serverless computing serverless computing cloud-computing execution model cloud provider runs server dynamically manages allocation machine resources pricing based actual amount resources consumed application rather pre-purchased units capacity form utility computing serverless computing simplify process deploying code production scaling capacity planning maintenance operations may hidden developer operator serverless code used conjunction code deployed traditional styles microservices alternatively applications written purely serverless use provisioned servers confused computing networking models require actual server function like peer-to-peer p2p serverless vendors offer compute runtimes also known function service faas platforms execute application logic store data first pay go code execution platform zimki released 2006 commercially successful 2008 google released google app engine featured metered billing applications used custom python framework could execute arbitrary code picloud released 2010 offered faas support python aws lambda introduced amazon 2014 first public cloud infrastructure vendor abstract serverless computing offering google cloud platform offers google cloud functions since 2016 ibm offers ibm cloud functions public ibm cloud since 2016 microsoft azure offers azure functions offered azure public cloud on-premises via azure stack oracle introduced fn project open source serverless computing framework offered oracle cloud platform available github deployment platforms addition number open source serverless projects various levels popularity usage openwhisk initially developed ibm contributions redhat adobe others openwhisk core technology ibm cloud functions project riff open source serverless platform implementation built kubernetes pivotal software project riff foundation pivotal function service several serverless databases emerged last years systems extend serverless execution model rdbms eliminating need provision scale virtualized physical database hardware amazon aurora offers serverless version databases based mysql postgresql providing on-demand auto-scaling configurations azure data lake highly scalable data storage analytics service service hosted azure microsoft public cloud azure data lake analytics provides distributed infrastructure dynamically allocate de-allocate resources customers pay services use google cloud datastore eventually-consistent document store offers database component google app engine standalone service firebase also owned google includes hierarchical database available via fixed pay-as-you-go plans faunadb cloud serverless managed offering faunadb cloud accessed via function-as-a-service provider faunadb cloud data replicated across multiple datacenters running amazon web services google cloud platform microsoft azure serverless cost-effective renting purchasing fixed quantity servers generally involves significant periods underutilization idle time even cost-efficient provisioning autoscaling group due efficient bin-packing underlying machine resources described pay-as-you-go computing bare-code charged based solely upon time memory allocated run code without associated fees idle time immediate cost benefits related lack operating systems costs including licences installation dependencies maintenance support patching addition serverless architecture means developers operators need spend time setting tuning autoscaling policies systems cloud provider responsible scaling capacity demand.. google puts ‘ prototype production planet-scale. ’ cloud native systems inherently scale well systems known elastic rather scalable small teams developers able run code without dependence upon teams infrastructure support engineers developers becoming devops skilled distinctions software developer hardware engineer blurring function service units code exposed outside world simple functions means typically programmer worry multithreading directly handling http requests code simplifying task back-end software development infrequently-used serverless code may suffer greater response latency code continuously running dedicated server virtual machine container unlike autoscaling cloud provider typically spins serverless code completely use means runtime example java runtime requires significant amount time start create additional latency serverless computing suited computing workloads high-performance computing resource limits imposed cloud providers also would likely cheaper bulk-provision number servers believed required given point time diagnosing performance excessive resource usage problems serverless code may difficult traditional server code although entire functions timed typically ability dig detail attaching profilers debuggers apm tools furthermore environment code runs typically open source performance characteristics precisely replicated local environment serverless sometimes mistakenly considered secure traditional architectures true extent os vulnerabilities taken care cloud provider total attack surface significantly larger many components application compared traditional architectures component entry point serverless application moreover security solutions customers used protect cloud workloads become irrelevant customers control install anything endpoint network level intrusion detection/prevention system ids/ips intensified mono-culture properties entire server network single flaw applied globally solution secure serverless apps close partnership developers devops appsec find balance developers ’ security ’ absolved responsibility either take steps make everyone ’ problem create cross-functional teams work towards tight integration security specialists development teams collaborate organization resolve security risks speed serverless many serverless function environments based proprietary public cloud environments privacy implications considered shared resources access external employees however serverless computing also done private cloud environment even on-premises using example kubernetes platform gives companies full control privacy mechanisms hosting traditional server setups serverless computing covered international data center authority idca framework ae360 however part related portability issue moving business logic one public cloud another docker solution created cloud native computing foundation cncf also working developing specification oracle serverless computing provided third-party service applications software run serverless environment default locked specific cloud vendor therefore serverless cause multiple issues migration serverless frameworks designed make easier build test deploy serverless applications notable frameworks include | [
7054,
1935,
3993,
154,
6438,
1959,
939,
11692,
5677,
8640,
6856,
7248,
2641,
7889,
11221,
2263,
8539,
2910,
4194,
7022,
2418,
8181,
7802,
6395,
5245
] | None |
7,538 | 3 | Intel_8253:intel 8253 intel 8253 8254 programmable interval timers pits perform timing counting functions using three 16-bit counters 825x family primarily designed intel 8080/8085-processors later used x86 compatible systems 825x chips equivalent circuit embedded larger chip found ibm pc compatibles pc compatibles timer channel 0 assigned irq-0 highest priority hardware interrupt timer channel 1 assigned dram refresh least early models 80386 timer channel 2 assigned pc speaker intel 82c54 c cmos logic variant handles 10 mhz clock signals 8253 described 1980 intel component data catalog publication 8254 described superset 8253 higher clock speed ratings preliminary data sheet 1982 intel component data catalog 8254 implemented hmos read back command available 8253 permits reading writing counter interleaved modern pc compatibles either using system chip cpus discrete chipsets typically implement full 8254 compatibility backward compatibility interoperability read back command vital i/o feature interoperability multicore cpus gpus timer three counters numbered 0 2 channel programmed operate one six modes programmed channels operate independently counter two input pins – clk clock input gate – one pin data output three counters 16-bit counters independent easily read cpu operation mode pit changed setting hardware signals example write control word register one needs set =0 =1 =0 a1=a0=1 initialize counters microprocessor must write control word cw register done setting proper values pins read/write logic block sending control word data/bus buffer block control word register contains 8 bits labeled d7..d0 d7 msb decoding somewhat complex values set parameters one three counters however two forms setting pit microprocessor first sends control message count message pit counting process start pit received messages cases detects rising edge gate input signal status byte format bit 7 allows software monitor current state pin bit 6 indicates count read bit 1 counting element yet loaded read back processor bits 5 0 last bits written control register d3 d2 d1 bits control word set operating mode timer 6 modes total modes 2 3 d3 bit ignored missing modes 6 7 aliases modes 2 3 modes sensitive gate input gate high causing normal operation effects gate low depend mode mode 0 used generation accurate time delay software control mode counter start counting initial count value loaded 0 counting rate equal input clock frequency pin set low control word written counting starts one clock cycle count programmed remains low counter reaches 0 point set high counter reloaded control word written counter wraps around codice_1 internally continues counting pin never changes gate signal remain active high normal counting gate goes low counting suspended resumes goes high first byte new count loaded count register stops previous count mode 8253 used monostable multivibrator gate input used trigger input initially high go low clock pulse following trigger begin one-shot pulse remain low counter reaches zero go high remain high clk pulse next trigger writing control word initial count counter armed trigger results loading counter setting low next clk pulse thus starting one-shot pulse initial count n result one-shot pulse n clk cycles duration one-shot retriggerable hence remain low n clk pulses trigger one-shot pulse repeated without rewriting count counter gate effect new count written counter oneshot pulse current one-shot affected unless counter retriggered case counter loaded new count oneshot pulse continues new count expires mode device acts divide-by-n counter commonly used generate real-time clock interrupt like modes counting process start next clock cycle count sent remain high counter reaches 1 go low one clock pulse following cycle count reloaded goes high whole process repeats time high pulses depends preset count counter register calculated using following formula value loaded counter formula_1 note values count register range formula_2 1 register never reaches zero mode similar mode 2 however duration high low clock pulses output different mode 2 suppose formula_2 number loaded counter count message output high formula_4 counts low formula_5 counts thus period formula_2 counts formula_2 odd extra half-cycle spent high control word count loaded output remain high counter reaches zero counter generate low pulse 1 clock cycle strobe – output become high gate low suspends count resumes gate goes high mode similar mode 4 however counting process triggered gate input receiving control word count output set high device detects rising edge gate input start counting counter reaches 0 output go low one clock cycle – become high repeat cycle next rising edge gate 8253 used ibm pc compatibles since introduction 1981 modern times pit included separate chip x86 pc rather functionality included part motherboard chipset southbridge modern chipset change may show form noticeably faster access pit registers x86 i/o address space pc compatibles operate pit clock rate 105/88 1.193 mhz ntsc colorburst frequency frequency divided 2 largest divisor 8253 capable produces ≈18.2 hz timer interrupt used ms-dos related operating systems original ibm pcs counter 0 used generate timekeeping interrupt counter 1 a1=0 a0=1 used trigger refresh dram memory last counter a1=1 a0=0 used generate tones via pc speaker newer motherboards include additional counters advanced configuration power interface acpi counter local advanced programmable interrupt controller local apic high precision event timer cpu also provides time stamp counter tsc facility pcs address timer0 chip port 40h..43h second timer1 chip 50h..53h x86 pcs many video card bios system bios reprogram second counter use reprogramming typically happens video mode changes video bios may executed system management mode power saving state changes system bios may executed prevents serious alternative uses timer second counter many x86 systems timer used system x86 pcs channel 0 clock ticks theoretical value 1193181.8181 ... hz i.e one third ntsc color subcarrier frequency comes dividing system clock 14.31818 mhz 12 holdover first cga pcs – derived necessary frequencies single quartz crystal make tv output possible oscillator run multiple ntsc color subcarrier frequency stated channel 0 implemented counter typically initial value counter set sending bytes control data i/o port registers value 36h sent port 43h low byte port 40h port 40h high byte counter counts zero sends hardware interrupt irq 0 int 8 cpu counter resets initial value begins count fastest possible interrupt frequency little half megahertz slowest possible frequency also one normally used computers running ms-dos compatible operating systems 18.2 hz real mode operating systems bios accumulates number int 8 calls receives real mode address 0040:006c read program timer counts value also read directly reading i/o port twice first low byte high byte however free-running counter applications x86 pc necessary first write latch command desired channel control register bytes read belong one value according 2002 microsoft document reads writes hardware 8254 require communication io port programming takes several cycles prohibitively expensive os aperiodic functionality used practice | [
5922,
5348,
9861,
3272,
2861,
9166,
1776,
6129,
499,
5080,
8090
] | Test |
7,539 | 9 | RTML:rtml rtml proprietary programming language used exclusively yahoo yahoo store yahoo site web hosting services language originated viaweb company founded 1995 paul graham robert t. morris template language e-commerce platform rtml stands robert t. morris language rtml editor offered option customers usually small businesses wanted customize online stores built-in templates allowed built-in templates also written rtml provided starting point people used language 1998 yahoo bought viaweb 49.6 million renamed service yahoo store yahoo later offered rtml-based content management system hosting platform without shopping cart name yahoo site 2003 yahoo renamed yahoo store service yahoo merchant solutions part yahoo small business time began offering new customers choice standard php/mysql web hosting environment instead rtml-based store editor many new yahoo merchant solutions sites legacy yahoo stores continue built using store editor rtml although yahoo documentation mention rtml actually implemented top lisp-based system language somewhat unusual programmer edit source code directly text instead keywords presented hyperlinks browser-based html interface clicking keyword selects attributes edited blocks code pushed popped clipboard using stack metaphor editor maintains code s-expression structure automatically visually represents web interface using indentation instead lisp parentheses keywords correspond html elements also conditionals recursion control flow features make real programming language rtml templates evaluated dynamically pageview editing live site publish process generates static html files yahoo documentation used say rtml acronym real time markup language graham admitted made various explanations rtml supposed stand actually named robert morris founder viaweb whose username rtm | [
1347,
8644,
3336,
9,
8735,
7022,
11023,
4564,
311,
345,
7805,
319
] | None |
7,540 | 3 | Open_(system_call):open system call file systems program initializes access file file system using open system call allocates resources associated file file descriptor returns handle process use refer file cases open performed first access file may opened simultaneously several processes even process resulting several file descriptors file depending file organization filesystem operations descriptors moving file pointer closing independentthey affect descriptors file operations file write seen operations descriptors later read read newly written data codice_1 filesystem may allocate memory buffers may wait first operation absolute file path resolved may include connecting remote host notifying operator removable medium required may include initialization communication device point error may returned host medium available first access least directory within filesystem performed error usually returned higher level components path directories located accessed error returned file expected exist file already exist file expected exist file access restricted permission flags within file meta data access control list validated requested type operations usually requires additional filesystem access although filesystems meta-flags may part directory structure file created filesystem may allocate default initial amount storage specified amount depending file system capabilities fails error returned updating directory new entry may performed may delayed close performed various errors may occur open include directory update failures un-permitted multiple connections media failures communication link failures device failures return value must always examined error specific action taken many cases programming language-specific run-time library opens may perform additional actions including initializing run-time library structure related file soon file longer needed program close cause run-time library filesystem buffers updated physical media permit processes access data exclusive use required run-time libraries may close file program calls run-time exit filesystems may perform necessary operations program terminates neither likely take place event kernel power failure cause damaged filesystem structures requiring running privileged lengthy filesystem utilities entire filesystem may inaccessible using file process close file using close call takes file descriptor file closed filesystems include disposition permit releasing file computer languages include run-time libraries include additional functionality particular filesystems open auxiliary routine may include specifications key size record size connection speed open routines include specification program code executed event error example perl also uses codice_2 function codice_3 module associate array file codice_4 function associates hash file open call standardized posix specification c language value returned file descriptor reference process specific structure contains among things position pointer indicates place file acted upon next operation open may return −1 indicating failure codice_5 detailing error file system also updates global table open files used determining file currently use process name file open includes file path defining file system file found created codice_6 expects relative path argument formed or'ing together optional parameters fcntl.h one option parameters include additional flags errors defined open call codice_15 implemented fopen uses string flags codice_16 codice_17 codice_18 codice_19 returns file pointer used fgets fputs fclose optional relevant creating new file defines file permissions include read write execute file owner group users mode masked calling process umask bits set umask cleared mode | [
4616,
3082,
10785,
9762,
6180,
5158,
8242,
52,
4161,
8772,
6213,
8268,
589,
593,
6244,
5222,
10856,
4207,
9840,
5244,
4734,
11391,
7821,
4238,
10382,
2711,
6808,
9882,
6813,
1694,
2723,
10407,
1193,
8364,
10933,
5822,
5824,
1736,
2762,
63... | None |
7,541 | 4 | Censorship_by_Apple:censorship apple censorship apple refers apple inc. removal omission disruption spread content information services subsidiaries itunes store app store ios order comply apple company policies legal demands various government censorship laws ibooks description moby-dick censored sperm whale april 2010 according daily telegraph four erotic books including blonde wet complete story allegedly removed top 10 chart july 26 2010 northwest press repeated conflicts apple content limitations sales ibooks store 2011 adaptation tom bouden oscar wilde play importance earnest approved addition black bars cover partial male nudity technology company initially permitted individual issues jon macy fearful hunter rejected collected edition removed issues satirical al-qaeda super secret weapon rejected outright 2016 northwest published self-censored version hard swallow justin hall dave davenport – covering objectionable parts images apples – original version rejected due sexual content policy censoring profanity song titles itunes resulted scunthorpe glitch inoffensive titles censored due coincidental string letters song explicit label marked explicit next song title song marked explicit unavailable purchase restrict explicit content checked parental controls preference often clean mark next title songs meaning lyrics censored available purchase accounts generally song marked clean explicit version available well august 6th 2018 apple removed one podcasts created infowars website owned alex jones right-wing american conspiracy theorist radio-show host content creator apple cited hate speech reason removal content apple decision remove content sparked major technology companies including facebook youtube spotify google removing infowars content may 2009 apple rejected first version newspapers iphone app let users read content 50+ newspapers around world including new york times france le monde united kingdom tabloid sun app rejected topless page 3 girls daily features described obscene second version application submitted removing access sun adding price tag £0.59 app made available summer release iphone 3.0 software another application similar nature 'newspapers called 'eucalyptus allowed users download e-books iphone though rejected apple one e-books could downloaded kama sutra ban since lifted app store playboy sports illustrated adult-rated apps yet removed apps others removed citing adult content resulted accusations hypocrisy despite adult sites continue market iphone ipad users november 2009 application stern mainstream german weekly magazine print circulation 900,000 deleted several weeks without warning january 2010 europe largest newspaper german tabloid bild removed content iphone version print edition request apple later modify one applications like stern case nudity association german magazine publishers vdz warned interventions apple might moving towards censorship november 26 2010 informational magazine google os danish publisher mediaprovider n't allowed app store guardian described rejection explicit content apple analogous distributor wh smith main distributor many years imposed content restrictions british publishers workers fashion magazine dazed confused nicknamed ipad edition iran edition december 2009 apple banned cartoon app called newstoons cartoonist mark fiore grounds ridiculed public figures april 2010 fiore pulitzer prize political satire cartoons making history first internet-only cartoonist win prestigious journalistic prize following public outcry story broke wake award apple asked fiore resubmit app subsequently accepted fiore said sure mine might get approved someone n't pulitzer maybe making better political app mine need media frenzy get app approved political material april 2009 game called baby shaker approved app store later removed due complaints game allowed user shake phone image cartoon baby screen died may 2009 trent reznor rock band nine inch nails announced via twitter account apple rejected update nine inch nails application due objectionable content developer posted message nine inch nails discussion boards explaining situation apple later permitted update december 2009 ted lando ebook app take control iphone os 3 rejected apple app permitted back app store references jailbreaking removed 2011 apple banned game called phone story explored ethical challenges smartphone manufacturing including conflict minerals environmental waste troubled labor practices game eventually published web creator molleindustria august 2012 josh begley created iphone app sent push notification whenever u.s. military uav struck target app rejected apple finding content objectionable crude march 11 2013 hiddenapps approved appeared app store app provided access developer diagnostic menus allowed stock apps hidden enabled opt-out feature iads apple developer driven advertisement system july 2013 tech education startup called treehouse claimed apple refused let release ios app contained lessons android video game papers please centered around operation border checkpoint brought ipad december 2014 developer lucas pope forced remove pixellated nudity game full-body scanner allowed release game apple devices days pope permitted upload full version game app store including pixellated nudity apparent reversal apple however still rated 17+ app store may 4 2015 apple removed france musique application app store due airing inappropriate content podcast application displayed painting édouard manet olympia depicting mild nudity podcast application submitted app store 17+ rating october 2015 apple rejected custom streaming application apple tv created members frankfurt branch chaos computer club europe largest hacker association application meant show recordings talks chaos computer club conferences according blog post written incident apple reason videos show hack apple devices recordings publicly available hosted youtube well using youtube app still allows playback content apple devices apple banned video game binding isaac appearing ios app store due cartoon depictions violence towards children february 2018 apple removed telegram telegram x encrypted messaging applications made telegram messenger llp app store due content deemed inappropriate apple specifically cited instances child pornography made available users subsequently banned apps situation could dealt apple removed infowars app app store september 2018 citing content violated policy indecent material apple ban simply prevents users downloading app restrict access app installed november 2018 apple removed tumblr app app store due tumblr failure filter child pornography tumblr uses database known child pornography automatically detect remove child pornography website however found evidence images database present tumblr response ban tumblr removed instances child pornography since moved ban pornographic material platform december 17th 2018 december 2018 apple removed strategy game afghanistan '11 due fact featured real-life combatants slitherine developers game countered main objectives focused supporting afghan civilians rather defeating taliban followed temporary ban game ultimate general gettysburg featuring confederate flag historical context following instances censorship information control imposed apple app stores united states app store many imposed due pressure foreign governments put effect comply laws early 2017 apple restricted emoji flag taiwan devices used china 2018 apple restrictions sending word taiwan sending emoji representing flag taiwan idevices using chinese country code language settings caused devices crash 2018 apple removed apps chinese app store allowed users access content forbidden chinese government many apps gave users access virtual private networks could allow circumvent great firewall china apple cite chinese laws claimed apps broke laws local governments among apps removed vyprvpn app golden frog company filed amicus brief supporting apple fbi–apple encryption dispute apple first foreign global technology company concede chinese government demands 2019 bitter winter daily magazine human rights religious liberty china reported app also removed chinese app store artists reference tiananmen square protests music removed itunes including jacky cheung hok-yau tat ming pair february 2017 apple restricted payment services iranian apps comply u.s. sanctions forbade iranian currency entering united states iranian apps responded implementing iranian electronic payment service august 2017 apple removed many iranian apps app store citing u.s. sanctions placed iran apple neither stores iran specific versions app store country iranian citizens able get access apple products content external sources apple removed many apps developed specifically iranians including ride-sharing service called snapp food delivery service called delionfoods april 2018 apple blocked telegram app iran response concerns access encrypted messaging service presented threat iranian national security may 2018 apple played role censorship telegram encrypted messaging app used globally interested surveying encrypted messages russian government demanded telegram provide decryption keys federal security service telegram refused russian government threatened apple legal repercussions block telegram russian app store eliminate push notification feature founder telegram pavel durov publicly claimed apple restricted telegram users across world updating app action could cause problems telegram ability meet regulations | [
9732,
1317,
7869,
9063,
2282,
171,
1070,
11695,
6000,
1169,
6834,
9233,
10417,
5749,
3991,
1692,
4957
] | None |
7,542 | 4 | Scott_Vanstone:scott vanstone scott a. vanstone mathematician cryptographer university waterloo faculty mathematics member school centre applied cryptographic research also founder cybersecurity company certicom received phd 1974 university waterloo decade worked principally combinatorial design theory finite geometry finite fields 1980s started working cryptography early result vanstone joint ian blake r. fuji-hara ron mullin improved algorithm computing discrete logarithms binary fields inspired coppersmith develop famous exp n^ 1/3+ε algorithm n degree field vanstone one first see commercial potential elliptic curve cryptography ecc much subsequent work devoted developing ecc algorithms protocols standards 1985 co-founded certicom later became chief developer promoter ecc vanstone authored coauthored five widely-used books almost two hundred research articles held several patents fellow royal society canada fellow international association cryptologic research 2001 rsa award excellence mathematics 2009 received ontario premier catalyst award lifetime achievement innovation died march 2 2014 shortly cancer diagnosis notes | [
2074,
8674,
2580,
1783
] | Test |
7,543 | 9 | Mozilla_Raindrop:mozilla raindrop raindrop messaging application building apache couchdb used web interface raindrop works collecting messages currently emails tweets available addons storing json optionally attachments couchdb served users couchdb webserver users view web browsers december 2009 prototype testers official stable release raindrop introduced mozilla foundation thursday october 22 2009 exploration messaging innovation led team responsible thunderbird explore new ways use open web technologies create useful compelling messaging experiences february 2014 mozilla raindrop project considered inactive | [
1664,
6791,
9736,
1295,
7951,
2836,
10006,
11418,
9757,
803,
7983,
1713,
7861,
11449,
5054,
9152,
9281,
10057,
2893,
7889,
5078,
6231,
10078,
482,
10722,
8169,
5612,
10860,
6133,
4728,
5114,
8443,
637,
6143
] | Train |
7,544 | 2 | Services_menu:services menu services menu simply services user interface element computer operating system services programs accept input user selection process optionally put result back clipboard concept originated nextstep operating system carried macos gnustep similar features emulated operating systems apple advertises services menu connection features operating system example possible desktop search piece text selecting mouse using service spotlight central services grab taking screenshots system spell checker concept similar gui equivalent unix pipe allowing arbitrary data processed passed programs services implemented application services expose portion functionality application operate selected data usually without displaying interface developer documentation apple recommends applications use services provide features generally useful giving example usenet client providing rot13 encryption service standalone services may also created without host application simple one-purpose nature fact n't require gui designed makes writing standalone services popular beginner macos programming projects since many applications install entries without asking user macos services menu tends clog dozens entries quickly users ever use small subset possible options therefore cutting customizing menu makes faster pleasant use prior mac os x snow leopard third party software required snow leopard services menu customized keyboard pane system preferences point view software services menu means inter-process communication user interface executing actions selected data emulation services menu based fact several ways achieved operating system even macos alternative system called context menu handler carried classic mac os x window system data selected application available programs thus services menu application retrieves current selection lets user choose action missing part returning processed data back originating application instead service open new window show results alternatively service could replace current cut buffer results operation leaving user perform paste since different toolkits implement copy/select paste commands differently probably external program control | [
576,
8997,
3719,
9035,
7983,
8304,
8499,
3350,
8414,
7806
] | Test |
7,545 | 4 | The_Digital_Standard:digital standard digital standard technical standard offers product testing criteria software smart devices consumers manufacturers use standards evaluate extent product protects various digital rights including consumer privacy information security freedom speech product ownership consortium organizations including consumer reports disconnect mobile ranking digital rights cyber independent testing lab aspiration presented standard march 2017 intended use standard encourage consumer manufacturer evaluate discuss impact product digital features individuals society since standard list questions anyone answer questions product generate evaluation supporters standard argue answers questions either obvious manufacturers voluntarily disclose answers goals standard include setting consumer expectations products protect communicating acceptable practices manufacturers encouraging conversations sorts product behavior either beneficial harmful consumers use digital standard makes 4 assertions digital rights foundation assertions digital standard claims good products following characteristics standard work progress actively seeking comments participation anyone cares digital rights time standard release organizations established made statements contributions partnering others representative consumer technology association expressed wish anyone using standard evaluate product describe calculated score limitations score communicates peiter zatko cyber independent testing lab said need shed light industry really n't caring build quality software safety craig newmark speaking board member consumer reports advocate digital rights commented standard urgently needed statements project organizers published third-party media | [
11221,
5636,
5373,
9214
] | None |
7,546 | 5 | SmartFTP:smartftp smartftp network file transfer program microsoft windows supports file transfer via ftp ftps sftp webdav amazon s3 google drive microsoft onedrive box google cloud storage backblaze b2 protocols supports ssl/tls ipv6 fxp features transfer queue proxy firewall support multiple connections chmod features drag-and-drop software uses windows api interface available ia-32 x64 editions windows prior july 2008 program free home non-profit users july 7 2008 post smartftp forums announced software longer free use smartftp available three editions | [
11201,
5380,
7364,
11178,
2797,
6797,
7983,
4725,
5754,
5470
] | None |
7,547 | 2 | Hackathon:hackathon hackathon also known hack day hackfest codefest design sprint-like event computer programmers others involved software development including graphic designers interface designers project managers others often including domain experts collaborate intensively software projects goal hackathon create usable software hardware goal creating functioning product end event hackathons tend specific focus include programming language used operating system application api subject demographic group programmers cases restriction type software created word hackathon portmanteau words hack marathon hack used sense exploratory programming alternate meaning reference computer security openbsd apparent first use term referred cryptographic development event held calgary june 4 1999 ten developers came together avoid legal problems caused due export regulations cryptographic software united states since three-to-five events per year occurred around world advance development generally university campuses sun usage referred event javaone conference june 15 june 19 1999 john gage challenged attendees write program java new palm v using infrared port communicate palm users register internet starting mid late 2000s hackathons became significantly widespread began increasingly viewed companies venture capitalists way quickly develop new software technologies locate new areas innovation funding major companies born hackathons groupme began project hackathon techcrunch disrupt 2010 conference 2011 acquired skype 85 million software phonegap began project iphonedevcamp later renamed iosdevcamp 2008 company whose engineers developed phonegap nitobi refocused around phonegap nitobi bought adobe 2011 undisclosed amount hackathons typically start one presentations event well specific subject participants suggest ideas form teams based individual interests skills main work hackathon begins last anywhere several hours several days hackathons last 24 hours longer especially competitive ones eating often informal participants often subsisting food like pizza energy drinks sometimes sleeping informal well participants sleeping on-site sleeping bags end hackathons usually series demonstrations group presents results capture great ideas work-in-progress often people post video demonstrations blog results screenshots details share links progress social media suggest place open source code generally make possible people share learn possibly build ideas generated initial work completed sometimes contest element well panel judges select winning teams prizes given many hackathons judges made organisers sponsors barcamp-style hackathons organised development community iosdevcamp judges usually made peers colleagues field prizes sometimes substantial amount money social gaming hackathon techcrunch disrupt conference offered 250,000 funding winners controversial 2013 hackathon run salesforce.com payout 1 million winners billed largest-ever prize hackathons focus particular platform mobile apps desktop operating system web development video game development mobile app hackathons like air held phoenix park ireland see large amount corporate sponsorship interest music hack day hackathon music-related software hardware applications popular event held 30 times around world since 2009 also music tech fest three-day interdisciplinary festival music ideas bringing together musicians hackers researchers industry features hackathon similarly science hack day hackathon making things science held 45 times 15 countries around world since 2010 hackathons held develop applications run various mobile device operating systems android ios meego hackathons also held develop video-based applications computer games hackathons video games developed sometimes called game jams tv hackfest events held london san francisco focusing mainly social television second screen technologies tv hackfests challenge briefs typically submitted content producers brands form broadcast industry metadata video content sponsors supply apis sdks pre-existing open source software code hackathons also used life sciences advance informatics infrastructure supports research open bioinformatics foundation ran two hackathons member projects 2002 2003 since 2010 held 2-day codefests preceding annual conference national evolutionary synthesis center co-organized sponsored hackathons evolutionary bioinformatics since 2006 biohackathon annual event started 2008 targeted advancing standards enable interoperable bioinformatics tools web services neuroscientists also used hackathons bring developers scientists together address issues range focusing specific information system e.g. neurosynth hackathon allen brain atlas hackathon providing reserved time broad scientific inquiry e.g. brainhack using specific challenges focus hacking activity e.g. hbm hackathon hackathons devoted creating applications use specific language framework like javascript node.js html5 ruby rails hackathons focus applications make use application programming interface api single company data source open hack event run publicly yahoo since 2006 originally known hack day open hack day focused usage yahoo api addition apis websites owned yahoo like flickr company open hack india event 2012 700 attendees google run similar events apis travel guide company lonely planet website foursquare notably held large global hackathon 2011 500 developers 30 sites around world competed create applications using foursquare api second foursquare hackathon 2013 around 200 developers ietf organizes hackathons ietf meetings focused ietf internet draft ietf rfc implementation better inter-operability improved internet standards number hackathons devoted improving government specifically cause open government one event 2011 hosted united states congress starting 2012 nasa annually hosting international space apps challenge 2014 british government hackernest ran dementiahack world first hackathon dedicated improving lives people living dementia caregivers series continues 2015 adding canadian government facebook major sponsors global game jam largest video game development hackathon often includes optional requirements called 'diversifiers aim promote game accessibility causes various hackathons held improve city transit systems hackathons aimed improvements city local services increasing one london councils hackney creating number successful local solutions 2 day hackney-thon also number hackathons devoted improving education including education hack day smaller scale looking specifically challenges field work based geography education field studies council hosted fschackday random hacks kindness another popular hackathon devoted disaster management crisis response theport instead hackathon devoted solving humanitarian social public interest challenges hosted cern partners non-governmental organizations icrc undp number hackathons around world planned memory computer programmer internet activist aaron swartz died 2013 hackathons intended programmers within certain demographic group like teenagers college students women hackathons colleges become increasingly popular united states elsewhere usually annual semiannual events open college students universities often competitive awards provided university programming-related sponsors many supported organization major league hacking founded 2013 assist running collegiate hackathons pennapps university pennsylvania first student-run college hackathon 2015 became largest college hackathon 12th iteration hosting 2000 people offering 60k prizes university mauritius computer club cyberstorm.mu organized hackathon dubbed code wars focused implementing ietf rfc lynx 2017 shamhacks missouri university science technology held annually outreach activity campus curtis laws wilson library shamhacks 2018 focused problem statements better quality life factors us veterans pairing veteran-owned company sponsors companies hold internal hackathons promote new product innovation engineering staff example facebook like button conceived part hackathon hackathons startupbus founded 2010 australia combine competitive element road trip connect local tech communities multiple cities along bus routes taking place across north america europe africa australasia hackathons work single application operating system programming language content management system events often known code sprints especially popular open source software projects events sometimes opportunity developers meet face-to-face code sprints typically last one week three weeks often take place near conferences team attend unlike hackathons events rarely include competitive element annual hackathon work operating system openbsd held since 1999 one event may originated word hackathon | [
0,
6657,
5636,
7044,
3462,
6790,
10756,
11659,
10392,
7449,
8735,
5677,
7983,
6588,
9665,
8262,
3404,
8146,
3290,
4956,
2275,
1764,
9704,
10090,
5356,
2558
] | None |
7,548 | 2 | Android_Pie:android pie android pie codenamed android p development ninth major release 16th version android mobile operating system first released developer preview march 7 2018 released publicly august 6 2018. 10.4 android devices checking google play run pie android pie referred android p first announced google march 7 2018 first developer preview released day second preview considered beta quality released may 8 2018 third preview called beta 2 released june 6 2018 fourth preview called beta 3 released july 2 2018 final beta android p released july 25 2018 august 6 2018 google officially announced final release android 9 title pie update initially available current google pixel devices releases android one devices others follow later year essential phone first third-party android device receive update pie notably coming day-and-date final release sony xperia xz3 first device android pie pre-installed august 2019 handful notable custom android distributions roms 9.0 pie see list custom android distributions android pie utilizes refresh google material design language unofficially referred material design 2.0 revamp provides variance aesthetics encouraging creation custom themes base guidelines components rather standardized appearance bottom-aligned navigation bars also prominent applied android pie interface rounded corners influenced proprietary google theme used in-house software implementing material design 2.0 prominent addition pie contains official support screen cutouts notches including apis system behaviors depending size position android certification requirements restrict devices two cutouts may along top bottom screen significant user interface change pie redesigned on-screen navigation bar unlike previous versions android consists slim home button back button rendered available bar utilizes gesture navigation swiping opens overview screen redesign existing recent apps menu swiping handle right activates application switching gesture bar used primarily new devices pixel 3 existing devices may either use previous navigation key setup offer ability opt gesture navigation opposed previous recent apps menu overview utilizes horizontal layout rather vertical text may also selected copied apps appearing although uses ocr rather native text conserve resources pixel launcher exclusively supports ability access app drawer recently used apps overview well however integration proprietary current plans offer necessary integration third-party software due security concerns addition rotation lock enabled rotating device causes screen rotation button appear navigation bar notification area redesigned clock moved left number icons may displayed limited four order accommodate displays may notch cutouts center drop-down panels attached quick settings items removed long-pressing toggle directs users relevant settings screen notifications chats threaded displaying previous messages within complementing existing inline reply functionality particular type notification frequently dismissed user offered disable disturb mode overhauled larger array settings power menu contains screenshot button supports cropping image taking one optional lockdown mode disables biometric unlock methods volume pop-up controls media volume well choice sound vibrate silent modes notifications users directed settings menu change volume notifications magnifier display added text selection smart linkify offers access relevant apps particular types text phone numbers addresses highlighted android pie introduces major change power management using algorithms prioritize background activity apps based long-term usage patterns predictions dividing apps active working set run often frequent rare never similar adaptive brightness settings adjusted automatically based detected lighting conditions features developed collaboration deepmind precomputedtext api also available compatibility library compatible android 4.0 newer used perform text display processing background thread opposed ui thread improve performance fingerprint authentication api also revamped account different types biometric authentication experiences including face scanning in-screen fingerprint readers android runtime create compressed bytecode files profiler data uploaded google play servers bundled apps downloaded users similar device apps targeting older android api levels beginning android 4.2 display warning launched google play store requiring apps target api level released within past year also mandate 64-bit support 2019 android pie supports ieee 802.11mc including wi-fi round trip time location positioning camera api supports accessing multiple cameras apps may longer perform background audio video recording unless run foreground service support high efficiency image format subject patent licensing hardware support vp9 profile 2 dns tls supported name private dns android go android pie uses less storage previous release enhancements security storage tracking shortly launch several users pixel devices essential phone noted decrease battery life android pie became available phones users various devices reported similar comparisons | [
5637,
11273,
8719,
3600,
7700,
9244,
11294,
1578,
10284,
5677,
1083,
6212,
69,
8262,
4683,
4685,
11343,
3664,
8280,
8285,
2658,
8821,
11391,
1670,
7816,
5262,
10393,
8858,
7835,
673,
8870,
1191,
1203,
7359,
196,
3269,
3782,
8907,
2258,
22... | None |
7,549 | 3 | PowerBook_500_series:powerbook 500 series powerbook 500 series codenamed blackbird shared older macintosh iifx range apple macintosh powerbook portable computers first introduced apple computer 540c model may 16 1994 first stereo speakers trackpad ethernet networking built-in first powerbook series use motorola 68lc040 cpu simultaneous duo 280 upgradeable powerpc architecture via swap-out cpu daughter card powerpc 68040 upgrades sale use 9.5-inch dual scan passive color/b w displays 16-bit stereo sound stereo speakers expansion bay pc card capability two battery bays ten-minute sleep/clock battery allowed main batteries swapped sleep mode full-size keyboard f1–f12 function keys able sleep connected external monitor battery contact cover included actual batteries included single serial port could connect serial printer network via apple localtalk another first also included aaui port connecting ethernet networks 500 series discontinued completely introduction ill-fated powerbook 5300 powerbook 190 de facto successor 500 continued 68lc040 processor offering low end powerpc-based powerbook family survey taken november 2000 insanely great macintosh ranked 540c 2 list all-time best powerbook models made powerbook 500 series introduced may 16 1994 high-end active matrix lcd powerbook 540c 540 passive matrix 520c 520 soon one marketing highlights promise powerpc upgrade cpu pc card pcmcia expansion introduction model came time apple changeover new powerpc chip 68k line cpus apple advertising promise powerpc cause headaches company strong demand ground-breaking design apple incorrect market prediction customers would wait fully powerpc powerbooks resulted shortages early due course 540 dropped line 8 mb additional memory modem offered installed factory hard drive capacity increased 160 240 320 500 mb installed system upped system 7.1.1 7.5 pc card cage also released allowing macintosh users add pcmcia capability laptops first time 1995 apple gave permission apple japan introduce updated version called 550c bigger display 10.4 inches cpu fpu 68040 bigger hard drive japanese keyboard black case sold japan never received fcc certification delays new powerpc powerbook 5300 demand ppc upgrade mounted newer technology began market upgrade apple although produced upgrade modules apple first offered 117 mhz versions apple 100 actually 99 mhz offering soon thereafter newer technology introduced 167 mhz model outperformed fastest powerbook 5300 6,800 5300ce time problems line became real issue apple time apple introduced powerbook 1400 newer technology introduced 183 mhz upgrade 128 kb l2 cache kept ahead power curve performance newer technology stated could produce 183 mhz upgrades supply connectors exhausted laptop first industry include among apple powerbook line first although 500 blackbird prototypes black one five production models completely black 550c sold japan 550c differed four two-tone grey models key respects well including larger active-matrix color screen combined roman/kanji keyboard full 68040 processor models charcoal grey darker grey trim came variety displays active/passive matrix color greyscale used 68lc040 processor low-cost variant without math co-processor full-sized keyboard 12 function keys 640×480 resolution display consistent across family modem developed global village unique two-part design transceiver modem connector installed back modem located next cpu daughter card v.32 terbo top rate 19.2 kbit/s v.32 terbo modems official standard otherwise would drop 14.4 kbit/s due bug new combined printer/modem port driver upgraded 2.5.5 chooser replaced gv install 500 series powerbooks included ability use two batteries time allowing 4 hours battery life two installed charged batteries however left battery also internal pds slot allowed custom modules installed despite prototypes made two devices reached market one pcmcia module three versions reva revb revc revc useful take 16bit wifi cards allowing possibility get powerbook 5xx connected online home network using technology developed powerbook 5xxs discontinued apple different revisions pcmcia module released apple accommodate developing pcmcia standard modules difficult find revc module particular demand alone works 16-bit wifi cards br pc card pcmcia cage 16-bit 2 type i/ii 1 type iii cards using 68000 cpu convert pc card protocol pds fpu co-processor make lack one powerbook 68lc040 cpu fpu module uses 68882 fpu co-processor made sonnet total almost 600,000 powerbook 500 series units produced compared 300,000 powerbook 5300 units laptops grayscale displays mono speakers 8-bit audio insufficient battery life side-mounted snap-on track balls built-in ethernet via versatile aaui transceiver scsi port forerunner today ’ firewire adb similar usb features desktops time making first viable desktop replacement laptops | [
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
7211,
8253,
1090,
4180,
10838,
10840,
9312,
8806,
6258,
10357,
4220,
10365,
10878,
6783,
4741,
7305,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
7869,
8893,
8896,
4807,
... | Validation |
7,550 | 9 | MUSIC-N:music-n music-n refers family computer music programs programming languages descended influenced music program written max mathews 1957 bell labs music first computer program generating digital audio waveforms direct synthesis one first programs making music actuality sound digital computer certainly first program gain wide acceptance music research community viable task world first computer-controlled music generated australia programmer geoff hill csirac computer designed built trevor pearcey maston beard however csirac produced sound sending raw pulses speaker produce standard digital audio pcm samples like music-series programs music-n derivative programs more-or-less common design made library functions built around simple signal-processing synthesis routines written opcodes unit generators simple opcodes constructed user instrument usually text-based instruction file increasingly graphical interface defines sound played second file called score specifies notes durations pitches amplitudes parameters relevant musical informatics piece variants language merge instrument score though still distinguish control-level functions operate music functions run sampling rate audio generated operate sound notable exception chuck unifies audio-rate control-rate timing single framework allowing arbitrarily fine time granularity also one mechanism manage advantage flexible readable code well drawbacks reduced system performance music-n derived software mostly available complete self-contained programs different types user-interfaces text- gui-based ones aspect csound rtcmix since evolved work effectively software libraries accessed variety frontends programming languages c c++ java python tcl lua lisp scheme etc. well music systems pure data max/msp plugin frameworks ladspa vst number highly original day largely unchallenged assumptions implemented music descendants best way create sound computer many mathew implementations using pre-calculated arrays waveform envelope storage use scheduler runs musical time rather audio rate norm hardware software synthesis audio dsp systems today music included number variants e.g structured audio orchestra language saol imperative music-n programming language part mpeg-4 audio standard eric scheirer less obviously music seen parent program music iv computer music synthesis software package written max mathews program expansion earlier packages written mathews produce music direct digital computation could heard converting samples audible sound using digital-to-analog converter dac music iv expanded godfrey winham hubert howe music ivb music ivbf portable version written fortran precursor csound music iv allows programmer enter musical score text file note played particular musical instrument software algorithm instruments supplied package programmer supply new instruments form fortran code compiled called music iv package generate output designed package intended real-time generation music done modern portable electronic keyboard instrument instead entire songs musical pieces encoded processed digital file disk tape containing stream samples prior advent low-cost digital audio gear late 1980s samples typically sent dac recorded analog tape | [
7172,
267,
10508,
7571,
6933,
791,
6810,
8474,
1952,
4777,
4779,
5037,
5677,
692,
9783,
9023,
7108,
3665,
596,
7769,
9565,
10083,
6502,
8554,
7535,
8947,
372,
2804,
9210,
2045,
8958
] | Validation |
7,551 | 5 | MSN_Direct:msn direct msn direct fm radio-based digital service allowed 'spot portable devices receive information msn services devices supported msn direct included wristwatches desktop clocks in-car gps satellite navigation units even small appliances coffee makers information available paid channels included weather horoscopes stocks news sports results calendar notifications service also allowed users receive short messages windows live messenger garmin gps units nüvi 680 allowed traffic notifications weather forecasts movie schedules local gas prices received msn direct radio-based service msn direct universal coverage available populated parts united states canada launched areas microsoft latest expansion msn direct windows mobile platform msn direct windows mobile took advantage cellular wi-fi connections allowed microsoft devices better compete information services available mobile phone platforms three versions msn direct software garmin nüvi gps receivers version 1 available nüvis allowed users receive local gas prices movie times weather forecasts current conditions version 2 available nüvi 700- 800-series receivers offered enhanced movie listings local events news stock prices ability send microsoft ’ live search maps data nüvi version 3 offered general airport delays incoming outgoing flights individual flight delays doppler radar map viewing weather service shut january 1 2012 originally announced october 2009 | [
4704,
3610
] | Test |
7,552 | 2 | List_of_BSD_operating_systems:list bsd operating systems number unix-like operating systems active development descended berkeley software distribution bsd series unix variants developed originally bill joy university california berkeley electrical engineering computer science department four major bsd operating systems increasing number oss derived add remove certain features generally remain compatible originating os—and really forks list active since 2014 websites freebsd free unix-like operating system descended unix via berkeley software distribution bsd freebsd currently 200 active developers thousands contributors notable derivatives include dragonfly bsd forked freebsd 4.8 apple inc. mac os x darwin base including large amount code derived freebsd netbsd freely redistributable open source version unix-derivative berkeley software distribution bsd computer operating system second open source bsd descendant formally released 386bsd continues actively developed noted portability quality design implementation often used embedded systems starting point porting operating systems new computer architectures openbsd unix-like computer operating system descended berkeley software distribution bsd unix derivative developed university california berkeley forked netbsd 1995 openbsd includes number security features absent optional operating systems tradition developers auditing source code software bugs security problems bsd originally derived unix using complete source code sixth edition unix pdp-11 bell labs starting point first berkeley software distribution 1bsd series updated versions pdp-11 followed 2.xbsd releases 32-bit version vax platform released 3bsd 4.xbsd series added many new features including tcp/ip networking many years primary developer project leader bill joy graduate student time funding project provided darpa darpa interested obtaining programming platform programmer interface would provide robust general purpose time-sharing computing platform would become obsolete every time computing hardware replaced operating system would allow us department defense software especially intricate long-term finance logistics operations quickly ported new hardware became available time went code later ported unix system iii still later unix system v. unix system v revision 4 svr4 released circa 1992 contained much code ported bsd version including 4.3bsd | [
5506,
2180,
1927,
4745,
10761,
2061,
9743,
5397,
8725,
9625,
5534,
3488,
1316,
7460,
1574,
11689,
684,
4908,
8621,
1839,
7983,
2995,
1718,
1080,
5177,
6333,
9151,
9153,
3651,
7748,
10436,
9927,
8395,
7249,
850,
11604,
3673,
6361,
6491,
93... | Test |
7,553 | 4 | Malumpos_Malware:malumpos malware malumpos point sale malware designed steal scrape customer ’ credit debit card detail point sale system designed way records point sale ’ data running oracle micros payment system restaurant collected data used 333,000 customer sites around world malumpos malware targets hotels us businesses put retail customers risk pos ram scraper written delphi programming language malumpos monitors processes scrapes stolen data infected pos system ram first stores stolen credit debit card details customer infected point sale system swiped sends data cybercriminal empty customer bank balance details sold black market much like point sale malware malumpos get computer unknowingly conceals identity nvidia display driver nvidia display driv3r malware appears legitimate software victims peripherals function correctly malware infects oracle micros oracle forms shift4 systems systems accessed via internet explorer | [
10309,
6091,
2383,
4945,
6360,
7515
] | Test |
7,554 | 6 | NetWare_Core_Protocol:netware core protocol netware core protocol ncp network protocol used products novell inc usually associated client-server operating system novell netware originally supported primarily ms-dos client stations later support platforms microsoft windows classic mac os linux windows nt mac os x various flavors unix added ncp used access file print directory clock synchronization messaging remote command execution network service functions originally took advantage easy network configuration little memory footprint ipx/spx protocol stack since mid-1990s tcp/ip implementation available novell edirectory uses ncp synchronizing data changes servers directory service tree original ipx/spx implementation provided novell netware platform obsolete tcp/ip implementation uses tcp/udp port 524 relies slp name resolution ncp operation ipx/spx networks bare ipx protocol used packet type field set 17 workstation client station side ipx socket number 0x4003 used server side socket number 0x0451 ncp pdu following structure ncp type field determines type operation individual requests identified sequence number modulo 256 connection number identifies individual client station connection server novell netware servers version 2.x supported 255 connections connection number occupied 1 octet later extended 2 octets task number value 3 requests 1 replies data field starts ncp function number octet distinguishes individual services contents length rest data field depends ncp function | [
5120,
514,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
3611,
9249,
9762,
5158,
7225,
11323,
576,
8772,
1109,
4708,
9836,
7789,
9333,
6263,
9335,
9343,
7818,
6797,
654,
2193,
2194,
2197,
11413,
2199,
11419,
6309,
1190,
5286,
10405,
10... | Test |
7,555 | 2 | Diskless_Remote_Boot_in_Linux:diskless remote boot linux drbl diskless remote boot linux nfs-/nis server providing diskless systemless environment client machines could used providing drbl-server installation possible machine debian ubuntu mandriva red hat linux fedora centos suse already installed unlike ltsp uses distributed hardware resources makes possible clients fully access local hardware thus making feasible use server machines less power also includes clonezilla partitioning disk cloning utility similar symantec ghost drbl comes terms gnu gpl license providing user ability customize drbl excels two main categories disk cloning clonezilla packaged drbl uses partimage avoid copying free space gzip compress hard disk images stored image restored multiple machines simultaneously using multicast packets thus greatly reducing time takes image large numbers computers drbl live cd allows without actually installing anything machines simply booting one machine server cd pxe booting rest machines hybrid client hybrid client excellent way make use old hardware using old hardware thin clients good solution disadvantages hybrid client make drbl allows one set multiple hybrid clients relative ease client computer set boot network card using pxe etherboot client requests ip address tftp image boot provided drbl server client boots initial ram disk provided drbl server via tftp proceeds mount nfs share also provided drbl server root partition client boots either linux distribution drbl server installed clonezilla installer various linux distributions depending particular client configured drbl server system resources reside local machine except storage resides drbl server main bottleneck drbl installation storage drbl server client workstation fast storage server raid fast network gigabit ethernet ideal type environment | [
7938,
7812,
8326,
4360,
9353,
4493,
2195,
11155,
1813,
10780,
1694,
3618,
1406,
4011,
9646,
7983,
10926,
823,
9660,
8254,
10817,
5067,
10192,
4561,
8147,
1761,
8676,
4841,
1150
] | Test |
7,556 | 4 | Brute-force_attack:brute-force attack cryptography brute-force attack consists attacker submitting many passwords passphrases hope eventually guessing correctly attacker systematically checks possible passwords passphrases correct one found alternatively attacker attempt guess key typically created password using key derivation function known exhaustive key search brute-force attack cryptanalytic attack theory used attempt decrypt encrypted data except data encrypted information-theoretically secure manner attack might used possible take advantage weaknesses encryption system exist would make task easier password-guessing method fast used check short passwords longer passwords methods dictionary attack used brute-force search takes long longer passwords passphrases keys possible values making exponentially difficult crack shorter ones brute-force attacks made less effective obfuscating data encoded making difficult attacker recognize code cracked making attacker work test guess one measures strength encryption system long would theoretically take attacker mount successful brute-force attack brute-force attacks application brute-force search general problem-solving technique enumerating candidates checking one brute-force attacks work calculating every possible combination could make password testing see correct password password length increases amount time average find correct password increases exponentially resources required brute-force attack grow exponentially increasing key size linearly although u.s. export regulations historically restricted key lengths 56-bit symmetric keys e.g data encryption standard restrictions longer place modern symmetric algorithms typically use computationally stronger 128- 256-bit keys physical argument 128-bit symmetric key computationally secure brute-force attack so-called landauer limit implied laws physics sets lower limit energy required perform computation per bit erased computation temperature computing device kelvins k boltzmann constant natural logarithm 2 0.693 irreversible computing device use less energy even principle thus order simply flip possible values 128-bit symmetric key ignoring actual computing check would theoretically require 2 − 1 bit flips conventional processor assumed calculation occurs near room temperature ~300 k von neumann-landauer limit applied estimate energy required ~10 joules equivalent consuming 30 gigawatts power one year equal 30×10 w×365×24×3600 9.46×10 j 262.7 twh 1 world energy production full actual computation – checking key see solution found – would consume many times amount furthermore simply energy requirement cycling key space actual time takes flip bit considered certainly greater 0 however argument assumes register values changed using conventional set clear operations inevitably generate entropy shown computational hardware designed encounter theoretical obstruction see reversible computing though computers known constructed commercial successors governmental asic solutions become available also known custom hardware attacks two emerging technologies proven capability brute-force attack certain ciphers one modern graphics processing unit gpu technology field-programmable gate array fpga technology gpus benefit wide availability price-performance benefit fpgas energy efficiency per cryptographic operation technologies try transport benefits parallel processing brute-force attacks case gpus hundreds case fpga thousand processing units making much better suited cracking passwords conventional processors various publications fields cryptographic analysis proved energy efficiency today fpga technology example copacobana fpga cluster computer consumes energy single pc 600 w performs like 2,500 pcs certain algorithms number firms provide hardware-based fpga cryptographic analysis solutions single fpga pci express card dedicated fpga computers wpa wpa2 encryption successfully brute-force attacked reducing workload factor 50 comparison conventional cpus hundred case fpgas aes permits use 256-bit keys breaking symmetric 256-bit key brute force requires 2 times computational power 128-bit key fifty supercomputers could check billion billion 10 aes keys per second device could ever made would theory require 3×10 years exhaust 256-bit key space underlying assumption brute-force attack complete keyspace used generate keys something relies effective random number generator defects algorithm implementation example number systems originally thought impossible crack brute force nevertheless cracked key space search found much smaller originally thought lack entropy pseudorandom number generators include netscape implementation ssl famously cracked ian goldberg david wagner 1995 debian/ubuntu edition openssl discovered 2008 flawed similar lack implemented entropy led breaking enigma code credential recycling refers hacking practice re-using username password combinations gathered previous brute-force attacks special form credential recycling pass hash unsalted hashed credentials stolen re-used without first brute forced certain types encryption mathematical properties defeated brute force example one-time pad cryptography every cleartext bit corresponding key truly random sequence key bits 140 character one-time-pad-encoded string subjected brute-force attack would eventually reveal every 140 character string possible including correct answer – answers given would way knowing correct one defeating system done venona project generally relies pure cryptography upon mistakes implementation key pads truly random intercepted keypads operators making mistakes – errors case offline attack attacker access encrypted material one try key combinations without risk discovery interference however database directory administrators take countermeasures online attacks example limiting number attempts password tried introducing time delays successive attempts increasing answer complexity e.g requiring captcha answer verification code sent via cellphone and/or locking accounts unsuccessful logon attempts website administrators may prevent particular ip address trying predetermined number password attempts account site reverse brute-force attack single usually common password tested multiple usernames encrypted files process may repeated select passwords strategy attacker generally targeting specific user | [
9732,
2053,
519,
2567,
3084,
535,
2074,
4128,
4140,
1069,
3629,
7730,
10806,
2110,
577,
7754,
8779,
10315,
8273,
11349,
1623,
1114,
10332,
10341,
618,
1654,
8827,
9854,
3717,
658,
1683,
660,
1173,
10389,
2716,
4772,
169,
7857,
9403,
6863,... | None |
7,557 | 4 | Dictionary_attack:dictionary attack cryptanalysis computer security dictionary attack form brute force attack technique defeating cipher authentication mechanism trying determine decryption key passphrase trying hundreds sometimes millions likely possibilities words dictionary dictionary attack based trying strings pre-arranged listing typically derived list words dictionary hence phrase dictionary attack contrast brute force attack large proportion key space searched systematically dictionary attack tries possibilities deemed likely succeed dictionary attacks often succeed many people tendency choose short passwords ordinary words common passwords simple variants obtained example appending digit punctuation character dictionary attacks relatively easy defeat e.g using passphrase otherwise choosing password simple variant word found dictionary listing commonly used passwords possible achieve time–space tradeoff pre-computing list hashes dictionary words storing database using hash key requires considerable amount preparation time allows actual attack executed faster storage requirements pre-computed tables major cost less issue today low cost disk storage pre-computed dictionary attacks particularly effective large number passwords cracked pre-computed dictionary need generated completed password hashes looked almost instantly time find corresponding password refined approach involves use rainbow tables reduce storage requirements cost slightly longer lookup-times see lm hash example authentication system compromised attack pre-computed dictionary attacks rainbow table attacks thwarted use salt technique forces hash dictionary recomputed password sought making precomputation infeasible provided number possible salt values large enough | [
7426,
6916,
3717,
7556,
11144,
3984,
1941,
1429,
535,
3477,
4373,
2716,
5404,
10915,
4772,
9640,
4140,
3382,
7863,
6712,
8632,
7354,
10300,
3133,
6975,
8513,
2430,
6466,
733,
7135,
3937,
2274,
4580,
7525,
8827,
2429,
2558
] | Test |
7,558 | 9 | Charity_(programming_language):charity programming language charity experimental purely functional programming language developed university calgary supervision robin cockett based ideas hagino tatsuya completely grounded category theory disregarding interactions outside world charity programs guaranteed terminate stay productive “ charity interesting exercise non-turing-complete programming languages capable expressing ackermann function alas seems active last 10 years though would interest anyone interested seeing far one take non-tc language ” links added shown examples include also solving tower hanoi problem source charity also related total functional programming languages language allows ordinary recursive data types might found ml required finite corecursive data types allowed potentially infinite control structure operating recursive data types primitive recursion paramorphism control structure corecursive data types primitive co-recursion apomorphism neither control structure operate kind data paramorphisms terminate apomorphisms productive | [
9345,
10436,
8262,
10953,
12,
7983,
8976,
823,
7386
] | Test |
7,559 | 4 | Hylemetry:hylemetry term hylemetry modern day parlance refers type banknote authentication invented g. schirripa spagnolo 2008 used first time international context 2010 hylemetric approach based biometry identification unique random characteristic used create template uniquely identifying object hylemetric identification requires properties unique permanent measurable non-invasive i.e. characteristics measured without modifying anything typical example security metallic fibers distributed inside banknotes composition two greek words hyle metros aristotle used term ὕλη hyle mean non-living matter since biometric identification given excellent results comes naturally apply similar criteria uniquely identify “ non-living matter ” banknotes hylemetric approach based biometry identification unique random characteristic used create template uniquely identifying object theory every random irreproducible characteristic could used hylemetric identification however valid feature also needs following properties typical example security metallic fibers distributed inside banknotes seen image right put inside paper pulp making banknote paper distribution number absolutely random possible create hylemetric template uniquely identifies particular banknote starting analysis fibers distribution approach also valid non-living matter identified one correct characteristics | [
10207
] | None |
7,560 | 4 | Malware_analysis:malware analysis malware analysis study process determining functionality origin potential impact given malware sample virus worm trojan horse rootkit backdoor malware malicious software computer software intended harm host operating system steal sensitive data users organizations companies malware may include software gathers user information without permission three typical use cases drive need malware analysis method malware analysis performed typically falls one two types examining malicious software involves several stages including limited following note hosted sandboxes malwr use one products hood malwr uses cuckoo | [
7968,
1251,
5475,
5891,
8580,
9319,
1896,
4441,
10213,
4972,
6288,
1622,
1017,
7515,
10173
] | Test |
7,561 | 3 | Mach_(kernel):mach kernel mach kernel developed carnegie mellon university support operating system research primarily distributed parallel computing mach often mentioned one earliest examples microkernel however versions mach microkernels mach derivatives basis modern operating system kernels gnu hurd apple operating systems macos ios ipados tvos watchos project carnegie mellon ran 1985 1994 ending mach 3.0 true microkernel mach developed replacement kernel bsd version unix new operating system would designed around mach derivatives exist within number commercial operating systems include using xnu operating system kernel incorporates earlier non-microkernel mach major component mach virtual memory management system also adopted 4.4bsd bsd developers csrg appears modern bsd-derived unix systems freebsd mach logical successor carnegie mellon accent kernel lead developer mach project richard rashid working microsoft since 1991 various top-level positions revolving around microsoft research division another original mach developers avie tevanian formerly head software next chief software technology officer apple inc. march 2006 mach name mach evolved euphemization spiral developers naming phase bike lunch rainy pittsburgh mud puddles tevanian joked word muck could serve backronym multi-user multiprocessor universal communication kernel italian cmu engineer dario giuse later asked project leader rick rashid project current title received muck answer though spelled pronounced according italian alphabet wrote mach rashid liked giuse spelling mach much prevailed key concept original unix operating system idea pipe pipe abstraction allowed data moved unstructured stream bytes program program using pipes users programmers could link together multiple programs complete tasks feeding data several small programs turn contrasted typical operating systems era required single large program could handle entire task alternately used files pass data resource expensive time consuming pipes built underlying input/output system system turn based model drivers expected periodically block waited tasks complete instance printer driver might send line text line printer nothing printer completed printing line case driver would indicate blocked operating system would allow program run printer indicated ready data pipes system limited resource memory one program filled memory assigned pipe would naturally block normally would cause consuming program run emptying pipe contrast file entire file read written next program use pipes made movement data across multiple programs occur piecemeal fashion without programmer intervention however implementation pipes memory buffers meant data copied program program time consuming resource intensive operation made pipe concept unsuitable tasks quick turnaround low latency needed case device drivers operating system kernel core functionality instead written single large program operating system added new functionality computer networking instance size complexity kernel grew unix pipes offered conceptual system could used build arbitrarily complex solutions small interacting programs smaller programs easy program maintain well defined interfaces simplified programming debugging qualities even valuable device drivers small size bug-free performance extremely important strong desire model kernel basis small interacting programs one first systems use pipe-like system basis operating system aleph kernel developed university rochester introduced concept ports essentially shared memory implementation aleph kernel reduced providing access hardware including memory ports conventional programs using ports system implemented behavior device drivers user programs concept greatly reduced size kernel allowed users experiment different drivers simply loading connecting together runtime greatly eased problems developing new operating system code otherwise generally required machine restarted general concept small kernel external drivers became known microkernel aleph implemented data general eclipse minicomputers tightly bound machine far ideal required memory copied programs involved considerable performance overhead also quite expensive nevertheless aleph proved basis system sound went demonstrate computer clustering copying memory early ethernet interface around time new generation central processors cpus coming market offering 32-bit address spaces initially optional support memory management unit mmu mmu handled instructions needed implement virtual memory vm system keeping track pages memory use various programs offered new solution port concept using copy write mechanism used vm instead copying data programs sent data needed instruct mmu provide access memory system would implement interprocess communications system dramatically higher performance concept picked carnegie-mellon adapted aleph perq workstation implemented using copy-on-write port successful resulting accent kernel limited practical use run existing software moreover accent tightly tied perq aleph eclipse major change experimental kernels mach decision make version existing 4.2bsd kernel re-implemented accent message-passing concepts kernel would binary compatible existing bsd software making system immediately useful everyday use still useful experimental platform additionally new kernel would designed start support multiple processor architectures even allowing heterogeneous clusters constructed order bring system quickly possible system would implemented starting existing bsd code re-implementing bit bit inter-process communication-based ipc-based programs thus mach would begin monolithic system similar existing unix systems evolve toward microkernel concept time mach started largely effort produce cleanly defined unix-based highly portable accent result short list generic concepts mach developed accent ipc concepts made system much unix-like nature even able run unix programs little modification mach introduced concept port representing endpoint two-way ipc ports security rights like files unix allowing unix-like model protection applied additionally mach allowed program handle privileges would normally given operating system order allow user space programs handle things like interacting hardware mach like unix operating system becomes primarily collection utilities unix mach keeps concept driver handling hardware therefore drivers present hardware included microkernel architectures based hardware abstraction layer exokernels could move drivers microkernel main difference unix instead utilities handling files handle task operating system code moved kernel user space resulting much smaller kernel rise term microkernel unlike traditional systems mach process task consist number threads common modern systems mach first system define tasks threads way kernel job reduced essentially operating system maintaining utilities scheduling access hardware existence ports use ipc perhaps fundamental difference mach traditional kernels unix calling kernel consists operation known system call trap program uses library place data well known location memory causes fault type error system first started kernel set handler faults program causes fault kernel takes examines information passed carries instructions mach ipc system used role instead order call system functionality program would ask kernel access port use ipc system send messages port although messages triggered system calls would kernels mach pretty much kernel did—handling actual request would program thread concurrency support benefited message passing ipc mechanisms since tasks consisted multiple code threads mach could freeze unfreeze message handling allowed system distributed multiple processors either using shared memory directly mach messages adding code copy message another processor needed traditional kernel difficult implement system sure different programs n't try write memory different processors however mach ports process memory access make well defined easy implement made first-class citizen system ipc system initially performance problems strategies developed minimize impact like predecessor accent mach used single shared-memory mechanism physically passing message one program another physically copying message would slow mach relies machine memory management unit mmu quickly map data one program another data written would physically copied process called copy-on-write messages also checked validity kernel avoid bad data crashing one many programs making system ports deliberately modeled unix file system concepts allowed user find ports using existing file system navigation concepts well assigning rights permissions would file system development system would easier would code worked exist traditional program could built using existing tools could also started debugged killed using tools monokernel bug new code would take entire machine require reboot whereas mach would require program restarted additionally user could tailor system include exclude whatever features required since operating system simply collection programs could add remove parts simply running killing would program finally mach features deliberately designed extremely platform neutral quote one text mach number disadvantages however relatively mundane one clear find ports unix problem solved time programmers agreed number well known locations file system serve various duties approach worked mach ports well mach operating system assumed much fluid ports appearing disappearing time without mechanism find ports services represented much flexibility would lost mach initially hosted additional code written directly existing 4.2bsd kernel allowing team work system long complete work started already functional accent ipc/port system moved key portions os tasks threads virtual memory portions completed various parts bsd system re-written call mach change 4.3bsd also made process 1986 system complete point able run dec vax although little practical value goal making microkernel realized soon followed versions ibm rt pc sun microsystems 68030-based workstations proving system portability 1987 list included encore multimax sequent balance machines testing mach ability run multiprocessor systems public release 1 made year release 2 followed next year throughout time promise true microkernel yet delivered early mach versions included majority 4.3bsd kernel system known poe server resulting kernel actually larger unix based idea however move unix layer kernel user-space could easily worked even replaced outright unfortunately performance proved major problem number architectural changes made order solve problem unwieldy unix licensing issues also plaguing researchers early effort provide non-licensed unix-like system environment continued find use well development mach resulting mach 3 released 1990 generated intense interest small team built mach ported number platforms including complex multiprocessor systems causing serious problems older-style kernels generated considerable interest commercial market number companies midst considering changing hardware platforms existing system could ported run mach would seem would easy change platform underneath mach received major boost visibility open software foundation osf announced would hosting future versions osf/1 mach 2.5 investigating mach 3 well mach 2.5 also selected nextstep system number commercial multiprocessor vendors mach 3 led number efforts port operating systems parts microkernel including ibm workplace os several efforts apple build cross-platform version classic mac os mach originally intended replacement classical monolithic unix reason contained many unix-like ideas instance mach used permissioning security system patterned unix file system since kernel privileged running kernel-space os servers software possible malfunctioning malicious programs send commands would cause damage system reason kernel checked every message validity additionally operating system functionality located user-space programs meant needed way kernel grant programs additional privileges operate hardware instance mach esoteric features also based ipc mechanism instance mach able support multi-processor machines ease traditional kernel extensive work needs carried make reentrant interruptible programs running different processors could call kernel time mach bits operating system isolated servers able run like program processor although theory mach kernel would also reentrant practice n't issue response times fast simply wait serve requests turn mach also included server could forward messages programs even network area intense development late 1980s early 1990s unfortunately use ipc almost tasks turned serious performance impact benchmarks 1997 hardware showed mach 3.0-based unix single-server implementations 50 slower native unix study exact nature performance problems turned number interesting facts one ipc problem overhead associated memory mapping needed support added small amount time making call rest 80 time spent due additional tasks kernel running messages primary among port rights checking message validity benchmarks 486dx-50 standard unix system call took average 21μs complete equivalent operation mach ipc averaged 114μs 18μs hardware related rest mach kernel running various routines message given syscall nothing full round-trip bsd would require 40μs whereas user-space mach system would take 500μs mach first seriously used 2.x versions performance slower traditional monolithic operating systems perhaps much 25 cost considered particularly worrying however system also offering multi-processor support easy portability many felt expected acceptable cost pay mach 3 attempted move operating system user-space overhead became higher still benchmarks mach ultrix mips r3000 showed performance hit great 67 workloads example getting system time involves ipc call user-space server maintaining system clock caller first traps kernel causing context switch memory mapping kernel checks caller required access rights message valid another context switch memory mapping complete call user-space server process must repeated return results adding total four context switches memory mappings plus two message verifications overhead rapidly compounds complex services often code paths passing many servers source performance problems another centered problems trying handle memory properly physical memory ran low paging occur traditional monolithic operating systems authors direct experience parts kernel called others allowing fine-tune pager avoid paging code used mach n't possible kernel real idea operating system consisted instead use single one-size-fits-all solution added performance problems mach 3 attempted address problem providing simple pager relying user-space pagers better specialization turned little effect practice benefits wiped expensive ipc needed call performance problems related mach support multiprocessor systems mid-1980s early 1990s commodity cpus grew performance rate 60 year speed memory access grew 7 year meant cost accessing memory grew tremendously period since mach based mapping memory around programs cache miss made ipc calls slow ipc overhead major issue mach 3 systems however concept multi-server operating system still promising though still requires research developers careful isolate code modules call server server instance majority networking code would placed single server thereby minimizing ipc normal networking tasks developers instead stuck original poe concept single large server providing operating system functionality order ease development allowed operating system server run either user-space kernel-space allowed develop user-space advantages original mach idea move debugged server kernel-space order get better performance several operating systems since constructed using method known co-location among lites mklinux osf/1 nextstep/openstep/macos chorus microkernel made feature basic system allowing servers raised kernel space using built-in mechanisms mach 4 attempted address problems time radical set upgrades particular found program code typically writable potential hits due copy-on-write rare thus made sense map memory programs ipc instead migrate program code used local space program led concept shuttles seemed performance improved developers moved system semi-usable state mach 4 also introduced built-in co-location primitives making part kernel mid-1990s work microkernel systems largely stagnant although market generally believed modern operating systems would microkernel based 1990s primary remaining widespread uses mach kernel apple macos sibling ios run atop heavily modified hybrid open software foundation mach kernel osfmk 7.3 called xnu also used osf/1 xnu file systems networking stacks process memory management functions implemented kernel file system networking process memory management functions invoked user mode via ordinary system calls rather message passing xnu mach messages used communication user-mode processes requests user-mode code kernel kernel user-mode servers analysis demonstrated ipc performance problem obvious seemed recall single-side syscall took 20μs bsd 114μs mach running system 114 11 due context switch identical bsd additional 18 used mmu map message user-space kernel space adds 29μs longer traditional syscall much rest majority actual problem due kernel performing tasks checking message port access rights would seem important security concern fact makes sense unix-like system instance single-user operating system running cell phone robot might need features exactly sort system mach pick-and-choose operating system would valuable likewise mach caused problems memory moved operating system another task really makes sense system one address space dos early mac os single large address space shared programs systems mapping provide benefits realizations led series second generation microkernels reduced complexity system placed almost functionality user space instance l4 kernel version 2 includes seven system calls uses 12k memory whereas mach 3 includes 140 functions uses 330k memory ipc calls l4 486dx-50 take 5μs faster unix syscall system 20 times fast mach course ignores fact l4 handling permissioning security leaving user-space programs select much little overhead require potential performance gains l4 tempered fact user-space applications often provide many functions formerly supported kernel order test end-to-end performance mklinux co-located mode compared l4 port running user-space l4 added 5 –10 overhead compared mach 29 newer microkernels revitalized industry whole projects gnu hurd received new attention result following list operating system kernels derived mach operating systems kernels derived mach | [
5120,
3082,
2061,
7187,
546,
8754,
9784,
10809,
10813,
576,
1101,
10851,
9320,
6250,
4092,
3197,
7806,
2179,
5771,
7307,
4251,
6300,
9374,
7337,
8877,
3248,
2761,
8395,
9931,
8909,
3286,
10971,
5855,
9452,
1776,
242,
5363,
2804,
8441,
332... | Train |
7,562 | 9 | Scheme_48:scheme 48 scheme 48 programming language dialect language scheme implementation using interpreter emits bytecode foreign function interface calling functions language c comes library regular expressions regex interface portable operating system interface posix supported portable scheme library slib basis scheme shell scsh used academic research free open-source software released bsd license called scheme 48 first version written 48 hours august 1986 authors say intended understood 48 hours scheme 48 uses virtual machine interpret bytecode written restricted dialect scheme called prescheme translated c compiled native binary prescheme pre-scheme statically-typed dialect scheme efficiency low-level machine access c retaining many desirable features scheme | [
10752,
11269,
2056,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
8226,
3119,
2105,
3132,
6717,
8258,
8771,
8262,
1613,
9299,
10841,
3675,
7267,
2660,
8293,
9320,
2666,
5751,
7805,
9345,
1159,
9865,
9877,
5803,
2225,
7867,
4799,
7880,
8... | None |
7,563 | 7 | HyTrust:hytrust hytrust american company specialising security compliance control software virtualization information technology infrastructure company founded 2007 based mountain view california hytrust founded 2009 partnered vmware symantec cisco systems citrix systems backed 5.5 million funding trident capital epic ventures 10.5 million funding raised granite ventures cisco systems 2010 summer 2013 company raised 18.5 million oversubscribed c round investments intel capital in-q-tel carahsoft fortinet previous investors web site also mentions mcafee trend micro ca technologies rsa vce hytrust founded company president eric chiu vice president renata budko vice president boris strongin engineer boris belov hytrust chiu budko worked cemaphore systems – company specialising disaster recovery microsoft exchange hytrust ceo chairman john de santis – formerly vice president cloud services vmware chairman ceo tricipher software security infrastructure company november 2013 hytrust acquired highcloud security cloud encryption management software provider acquisition added encryption key management hytrust products spring 2015 company raised 33 million series funding hytrust products based company patented intelligent security control system virtualized ecosystems hytrust cloudcontrol vmware vsphere-compatible virtual appliance sits virtual infrastructure administrators whenever administrative request submitted infrastructure appliance determines whether request complies organization security policies permitting denying accordingly logging requests records produced used regulatory compliance auditing troubleshooting forensic analysis company also provides private cloud logging active directory root access two-factor authentication vi segmentation host hardening multi-tenant policy enforcement secondary approval services encryption key management advises organizations manage virtualized cloud computing environments hytrust partnered intel 2014 create hytrust boundarycontrol technology lets companies set policies control access cloud virtualized data stored boundarycountrol designed work intel txt technology company released hytrust datacontrol 3.0 2015 technology encrypts data virtual machines rest keeps data secure used | [
704,
9569,
4194,
11233,
5252,
6153,
2154,
4049,
6834,
5371,
127
] | Validation |
7,564 | 4 | United_States_v._Ancheta:united states v. ancheta united states america v. ancheta u.s. vs. ancheta 06-051 c.d cal name lawsuit jeanson james ancheta downey california u.s. government handled united states district court central district california first botnet related prosecution u.s history ancheta violated prohibited acts accessing transmitting malware intent consequence disrupting interstate foreign commerce case first prosecution united states america individual sentenced prison profiting use botnets used maliciously launch destructive denial service attacks sending large quantities spam across internet 57-month prison sentence ancheta longest history defendant spread malware ancheta pleaded guilty conspiring violate computer fraud abuse act causing damage computers used federal government united states national defence accessing protected computer without authorization purpose commit various types fraud dates june 25 2004 september 15 2004 los angeles county ancheta others knowingly conspired violate us code refers knowingly causing transmission program information code command result conduct cause damage without authorization computer used interstate foreign commerce communication cause loss one-year period aggregating least 5000 value secondly acheta others conspired violate us code refers access without authorization computer used interstate foreign commerce communication intentionally intimate transmission computer multiple commercial electronic email messages affect interstate foreign commerce finally ancheta charged laundering monetary instruments faced criminal forfeiture jeanson james ancheta time crime 20-year-old high school drop-out found rxbot software online decided going use create botnet army established set website would rent computer zombies hackers could employ fulfill whatever malicious job planned ancheta used least one computer system place residence accessed internet dial telephone line configure command botnet conduct business communication co-conspirator residing boca raton florida referred sobe also involved previous experience launching computer attacks internet bot program infects computer enables remote control computer security vulnerability computer system exploited hacker order install run malware case worm program installs set run background process daemon remains undetectable computer user infected computer often referred zombie computer ancheta depended building block botnet army ancheta engaged computers function unison network formation referred botnet controller called bot herder ancheta primary purpose engaging large numbers computers amplify attack reduce time taken execute greatest value provide relatively high level anonymity 2005 federal trade commission conjunction 35 government agencies organized initiative encourage internet service providers actively monitor identify quarantine customers whose computers appeared compromised transformed zombies appear remote control hackers one largest botnet implementations around time 2005 found dutch police botnet 1.5 million computers crime ring control zombie computers often employed response anti-spam laws spam filtering spammers started hiring virus writers hackers help architect armies zombie computers send spam email unsuspecting users computers around world february 2012 federal communications commission unveiled yet another plan calls internet service providers take specific steps combat online threats botnets july 2004 ancheta obtained access server internet hosting company set irc server utilizing ircd program created channel irc controlled remotely ancheta developed computer worm installed executed would report back irc channel controlled scan computers similar vulnerabilities leave open future unauthorized control ancheta initially developed worm modifying existing trojan called rxbot ddos attacks one use case botnets another major purpose use proxy server email spam propagation 2004 reported unsolicited email doubled late 2003 rising 310 billion message 700 billion messages worms like conficker originally found 2008 still remain threat significantly sophisticated disallowing updates communicated encrypted channels ancheta advertised sale bots purpose launching distributed denial-of-service ddos attacks send spam sold access bots clusters usually 10,000 time ancheta acted consultant advised buyer exact number bots would need successfully accomplish designated attack would offer separate channels additional cost assist control direction bots providing temporary control channel buyer around time crime estimated average botnet 20,000 computers size also profited sale developed worm would configure best propagation buyers also option using malware launch attack use worm offering ancheta accepted payments paypal would misleadingly describe nature transaction hosting web hosting dedicated box services total 17 different counts case count 1 violation refers conspiracy ancheta others commit offense defraud us agency violated us code counts 2 11 violation counts 2 3 4 involved intentionally causing damage accessing unauthorized computer belonging king pao electronic co sanyo electric software completed would caused damage exceeding 5000 launching distributed denial service ddos attack company whose name remains confidential completed would caused damage exceeding 5000 furtherance conspiracy ancheta committed various overt acts including payments accomplices directing numerous computers adware servers controlled ancheta servers unsuspecting users would redirected download malware counts 5 6 included knowingly causing transmission malicious code protected computers belonging naval air weapons station china lake us defense information systems agency used justice national defence national security naws china lake major navy research testing evaluation facility disa provides communication support president top executive staff us government count 7 11 violation ancheta knowingly accessed without authorization computers involved interstate foreign commerce installing adware without notice consent sole intent defraud 8,744 53,321 computers different count accessed without authorization monetary amounts 1306.52 7966.10 different count accepted payment services counts 12 16 violation knowing property involved financial transaction represents proceeds unlawful activity ancheta conducted financial transactions involved proceeds specified unlawful activity proceeds used intent promote unlawful activity proceeds selling worms rental botnet passed legitimate online transactions payments web hosting dedicated box services anchta also transferring payments internet hosting companies additional access servers used commit fraud november 2004 may 2005 varying amounts funds transferred wells fargo bank fdcservers sago networks count 17 violation ancheta required forfeit property involved offence included 2998.81 generated sale internet bots proxies deposited wells fargo account approximately 58,357.86 proceeds generated surreptitious install adware protected computers linked paypal account owned ancheta 1993 bmw 325 property used commit facilitate commission violations including desktop computers laptops hard drives | [
2409,
877,
11437,
4883,
4725,
2041,
7515
] | Test |
7,565 | 6 | Davfs2:davfs2 computer networking davfs2 linux tool connecting webdav shares though local disks open-source gpl-licensed file system mounting webdav servers communicating kernel davfs2 either use fuse file system api coda network file system protocol sockets davfs2 uses neon webdav library communicating web server davfs2 e.g used apache web server subversion installations | [
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,
7344,
2230,
5816,
1212,
8380,
10951,
9420,
3795,
4819,
8404,
... | Test |
7,566 | 2 | IGUANA_Computing:iguana computing independent group unix-alikes networking activists iguana developers wombat system iguana also operating system os personality provides set services memory management process protection iguana designed base provision operating system services embedded systems among others provides underlying os wombat version paravirtualised linux designed provide legacy support embedded systems wombat works combination kenge iguana also used along create qualcomm rex os designed cell phones | [
6787,
9863,
6412,
5397,
1304,
3487,
3241,
7983,
3248,
2995,
9141,
823,
9784,
10813,
9151,
10436,
4423,
6369,
5492,
2424,
633
] | Validation |
7,567 | 8 | Apache_Traffic_Server:apache traffic server apache traffic server ats modular high-performance reverse proxy forward proxy server generally comparable nginx squid created inktomi distributed commercial product called inktomi traffic server inktomi acquired yahoo shortly yahoo released ts source apache apache incubator project july 2009 guest editor yahoo online publication ostatic stated yahoo uses ts production serve 30 billion objects per day sites like yahoo homepage yahoo sports mail finance april 21 2010 apache board accepted traffic server tlp graduating project incubation latest stable version 8.0.2 released january 29 2019 latest long-term support version 6.2.3 released august 4 2018. ats released two stable versions version 6 long-term support version ats version 8 latest stable release quarterly minor versions scheduled beginning version 4.0 releases considered stable production follow regular semantic versioning developer preview releases made instead git master branch considered preview quality times long-term support provided last minor version within major release one added year ats good support next generation http protocol v6.0.0 http/2 a.k.a h2 tls fast yet site scores 100 ats actively developed supported several large companies well many individual contributors ostatic post describes ts shipping ... http web proxy caching solution also ... server framework build fast servers protocols traffic server benchmarked handle 200,000 requests per second small objects cache talk 2009 cloud computing expo members yahoo ts team stated ts used production yahoo handle 400tb traffic per day using 150 commodity machines ostatic post describes ts product literally hundreds developer-years context cloud computing ts would sit conceptually edge cloud routing requests come yahoo used edge services shown graphic distributed 2009 cloud computing expo depicting yahoo private cloud architecture practical terms typical server configuration might use ts serve static content images javascript cascading style sheets css hypertext markup language html files route requests dynamic content web server apache http server | [
6161,
1047,
8217,
8735,
11303,
44,
10800,
6714,
9789,
7742,
64,
7233,
7750,
595,
7261,
8799,
8294,
8810,
11376,
2163,
4725,
6774,
11386,
10377,
8860,
8350,
3746,
3237,
7338,
9387,
11439,
6338,
1222,
4294,
8408,
8923,
4837,
8425,
747,
6379... | None |
7,568 | 4 | Outbound_content_compliance:outbound content compliance outbound content compliance outbound content security relatively new segment computer security field aims detect prevent outbound content violates policy organization and/or government regulations deals internal threats opposite traditional security solutions firewall anti-virus anti-spam etc dealing external threats therefore sometimes called inside-out security business environment purpose prevent confidential and/or private data leaks protected information may belong company customers us canada european countries enacted laws mandating protection types computer-based information us laws including related provisions sarbanes-oxley hipaa gramm-leach-bliley act interest segment heated string high-profile data breaches personal information millions people stolen endangered | [
8998,
2558,
8471
] | Validation |
7,569 | 5 | GENA:gena gena stands general event notification architecture gena base defines http notification architecture transmits notifications http resources http resource could object might need send receive notification example distribution list buddy list print job etc defined internet-draft draft-cohen-gena-p-base-01.txt expired gena base client arbiter provides ability send receive notifications using http tcp/ip administratively scoped unreliable multicast udp provisions made use intermediary arbiters called subscription arbiters handle routing notifications intended destination july 13–14 1998 university california irvine convened wisen workshop internet-scale event notification event brought together number experts various fields included presentation gena josh cohen microsoft delegates showcased event notification architectures haggled requirements josh final slide includes bullet points gena implemented microsoft products wish collaborate agree standard gena comply interest event notification appears waned 1998 participants unable come common definitions required definition notification services protocols gena briefly considered use internet printing protocol found niche part universal plug play upnp architecture gena base client arbiter | [
11413,
119
] | Test |
7,570 | 5 | UDP-Lite:udp-lite udp-lite lightweight user datagram protocol sometimes udp lite connectionless protocol allows potentially damaged data payload delivered application rather discarded receiving station useful allows decisions integrity data made application layer application codec significance bits understood udp-lite described rfc 3828 udp-lite based user datagram protocol udp unlike udp either none packet protected checksum udp-lite allows partial checksums covers part datagram arbitrary count octets beginning packet therefore deliver packets partially corrupted designed multimedia protocols voice ip voip streamed video receiving packet damaged payload better receiving packet conventional udp transmission control protocol tcp single bit error cause bad checksum meaning whole packet must discarded way bit errors promoted entire packet errors even damage data trivial computing checksum udp-lite uses checksum algorithm used udp tcp modern multimedia codecs like g.718 adaptive multi-rate amr audio h.264 mpeg-4 video resilience features already built syntax structure stream allows codec detect errors stream b potentially correct least conceal error playback codecs ideal partners udp-lite since designed work damaged data stream better codecs receive perhaps 200 bytes bits damaged rather conceal loss entire packet discarded due bad checksum application layer understands significance data transport sees udp packets means error protection added necessary higher layer example forward error correction scheme application best place decide parts stream sensitive error protect accordingly rather single brute force checksum covers everything equally example seen research hammer et al udp-lite coupled amr codec give improved speech quality lossy network conditions since modern link layers protect carried data strong cyclic redundancy check crc discard damaged frames making effective use udp lite requires link layer aware network layer data carried since current ip stacks implement cross-layer interactions making effective use udp-lite currently requires specially modified device drivers ip protocol identifier 136 udp-lite uses set port numbers assigned internet assigned numbers authority iana use udp support udp-lite added linux kernel version 2.6.20 support udp-lite added freebsd kernel r264212 changeset also mfc'ed back stable/10 became available freebsd 10.1-release bsd socket api extended support udp-lite third parameter socket system call set ipproto_udplite request udp-lite socket one also easily set part packet covered checksum starting beginning including header packet smaller 12 octets sent setup checksum cover whole packet receiving side socket default drop packets covered completely udp emulation permit smaller coverage one use allow packets minimum 12 octets user data checksummed packet smaller coverage silently dropped bad packet coverage length least 20 octets including header checksum correct delivered application whole part payload still corrupted could covered checksum checksum correct incidentally latter unlikely checksum incorrect packet dropped actually impossible know error inside payload data udp-lite header packet could actually destined different program smallest possible coverage 8 octets headers need included checksum packets smaller length coverage always dropped independent settings ignoring sniffers interested traffic conforming standard udp-lite supported following operating systems | [
10242,
3847,
649,
9868,
3218,
9365,
10005,
11413,
5402,
5531,
3742,
10271,
9380,
2085,
9381,
3751,
3752,
10924,
7855,
562,
2996,
9909,
823,
10171,
4797,
5181,
3133,
3006,
5437,
7364,
2887,
8265,
8266,
2509,
4687,
5843,
2904,
5469,
5470,
5... | None |
7,571 | 9 | Max_(software):max software max also known max/msp/jitter visual programming language music multimedia developed maintained san francisco-based software company cycling '74 thirty-year history used composers performers software designers researchers artists create recordings performances installations max program modular routines existing shared libraries application programming interface api allows third-party development new routines named external objects thus max large user base programmers unaffiliated cycling '74 enhance software commercial non-commercial extensions program extensible design simultaneously represents program structure graphical user interface gui max described lingua franca developing interactive music performance software 1980s miller puckette began work max 1985 institut de recherche et coordination acoustique/musique ircam paris originally called patcher first version provided composers graphical interface creating interactive computer music scores macintosh point development max could n't perform real-time sound synthesis software instead sent control messages external hardware synthesizers samplers using midi similar protocol earliest widely recognized use composition pluton 1988 piano computer piece philippe manoury software synchronized computer piano controlled sogitec 4x audio processing 1989 ircam developed max/fts faster sound version max ported ircam signal processing workstation ispw next also known audio max would prove forerunner max msp audio extensions adding ability real-time synthesis using internal hardware digital signal processor dsp board year ircam licensed software opcode systems 1990s opcode launched commercial version named max 1990 developed extended david zicarelli however 1997 opcode considering cancelling instead zicarelli acquired publishing rights founded new company cycling '74 continue commercial development timing fortunate opcode acquired gibson guitar 1998 ended operations 1999 ircam in-house max development also winding last version produced jmax direct descendant max/fts developed 1998 silicon graphics sgi later linux systems used java graphical interface c real-time backend eventually released open-source software meanwhile puckette independently released fully redesigned open-source composition tool named pure data pd 1996 despite underlying engineering differences ircam versions continued tradition cycling '74 first max release 1997 derived partly puckette work pure data called max/msp max signal processing initials miller smith puckette remains notable max many extensions incarnations made max capable manipulating real-time digital audio signals without dedicated dsp hardware meant composers could create complex synthesizers effects processors using general-purpose computer like macintosh powerbook g3 1999 netochka nezvanova collective released nato.0+55 suite externals added extensive real-time video control max 2000s though nato became increasingly popular among multimedia artists development stopped 2001 softvns another set extensions visual processing max released 2002 canadian media artist david rokeby cycling '74 released set video extensions jitter alongside max 4 2003 adding real-time video opengl graphics matrix processing capabilities max 4 also first version run windows max 5 released 2008 redesigned patching gui first time max commercial history 2010s 2011 max 6 added new audio engine compatible 64-bit operating systems integration ableton live sequencer software extension called gen compile optimized max patches higher performance max 7 released 2014 focused 3d rendering improvements september 25 2018 max 8 recent major version software released new features include mc new way work multiple channels javascript support node max vizzie 2 june 6 2017 ableton announced purchase cycling '74 max continuing published cycling '74 david zicarelli remaining company programs sharing max visual programming concepts commonly used real-time audio video synthesis processing max named composer max mathews considered descendant music language though graphical nature disguises fact like music-n languages max distinguishes two levels time event scheduler dsp corresponds distinction k-rate a-rate processes csound control rate vs. audio rate supercollider basic language max sibling programs data-flow system max programs named patches made arranging connecting building-blocks objects within patcher visual canvas objects act self-contained programs reality dynamically linked libraries may receive input one visual inlets generate output visual outlets objects pass messages outlets inlets connected objects max supports six basic atomic data types transmitted messages object object int float list symbol bang signal msp audio connections several complex data structures exist within program handling numeric arrays table data hash tables coll data xml information pattr data json-based dictionaries dict data msp data structure buffer~ hold digital audio information within program memory addition jitter package adds scalable multi-dimensional data structure handling large sets numbers storing video datasets matrix data max typically learned acquiring vocabulary objects function within patcher example metro object functions simple metronome random object generates random integers objects non-graphical consisting object name several arguments-attributes essence class properties typed object box objects graphical including sliders number boxes dials table editors pull-down menus buttons objects running program interactively max/msp/jitter comes 600 objects standard package extensions program written third-party developers max patchers e.g encapsulating functionality patcher sub-program max patch objects written c c++ java javascript order execution messages traversing graph objects defined visual organization objects patcher result organizing principle max unusual program logic interface presented user typically related though newer versions max provide several technologies standard gui design max documents named patchers bundled stand-alone applications distributed free sold commercially addition max used author audio midi plugin software ableton live max live extension increased integration laptop computers live music performance electronic music elsewhere max/msp max/jitter received attention development environment available serious laptop music/video performance | [
9345,
2691,
7172,
3462,
6797,
8958,
6933,
6810,
5037,
5677,
7983,
823,
9783,
10051,
9926,
3665,
7128,
7769,
9565,
7550,
5612,
7535,
8051,
2045,
7806
] | Test |
7,572 | 5 | HTTP/3:http/3 http/3 h3 upcoming third major version hypertext transfer protocol used exchange binary information world wide web http/3 draft based previous rfc draft named hypertext transfer protocol http quic quic transport layer network protocol initially developed google user space congestion control used user datagram protocol udp 28 october 2018 mailing list discussion mark nottingham chair ietf http quic working groups made official request rename http-over-quic http/3 clearly identify another binding http semantics wire protocol ... people understand separation quic pass development quic working group http working group finalizing publishing draft subsequent discussions followed stretched several days nottingham proposal accepted fellow ietf members november 2018 gave official seal approval http-over-quic become http/3 | [
513,
6657,
9736,
2579,
6171,
9757,
7713,
10791,
9770,
559,
4661,
3639,
10808,
3643,
9275,
64,
5707,
10834,
6231,
8281,
6747,
1642,
9834,
9841,
115,
9843,
119,
4728,
637,
1664,
2182,
11413,
10910,
8351,
7340,
9394,
9908,
185,
11449,
4797,
... | Test |
7,573 | 2 | Larry_McVoy:larry mcvoy larry mcvoy born 1962 concord massachusetts united states ceo bitmover company makes bitkeeper version control system used february 2002 early 2005 manage source code linux kernel earned bs ms degrees computer science 1985 1987 respectively university wisconsin–madison work generally included performance enhancements various unix operating systems developed employers mcvoy worked sun worked peer-to-peer scm system named teamware would form basis later bitkeeper product mcvoy started working linux kernel around 0.9.7 version developed lmbench kernel benchmark lmbench maintained 2009 carl staelin bitkeeper source control system also developed integrated linux development process 2002 mcvoy decided charge use bitkeeper linux development community prompted development git tool began serving source control system linux kernel 2005 working sun early 1990s mcvoy number high-profile unix community members urged company open-source flagship unix product sunos compete microsoft new windows nt operating system proposal would created copyleft version sunos time linux reached 1.0 version | [
9665,
3618,
10051,
10436,
7983,
8976,
5492
] | Validation |
7,574 | 4 | Fred_Teeven:fred teeven fredrik fred teeven born 5 august 1958 retired dutch politician people party freedom democracy vvd jurist teeven served member house representatives parliamentary leader livable netherlands party house representatives 23 may 2002 30 january 2003 2003 rejoined people party freedom democracy general election 2006 served member house representatives 30 november 2006 14 october 2010 became state secretary security justice cabinet rutte ii general election 2012 served member house representatives 20 september 2012 5 november 2012 26 march 2015 23 march 2017 teeven born province north holland studied law vu university amsterdam public management university twente working first tax collector became prosecutor becoming known crimefighter since led many investigations organised crime teeven involved prosecutions dési bouterse mink kok johan verhoek willem holleeder 2002 teeven succeeded pim fortuyn front runner lijsttrekker livable netherlands leefbaar nederland 23 may 2002 30 january 2003 parliamentary group leader livable netherlands house representatives also member house representatives 23 may 2002 – 30 january 2003 found would front runner 2003 elections quit party returned former post public prosecutor 2006 teeven announced return politics time people party freedom democracy vvd dutch general election 2006 6th candidate list vvd elected house representatives 30 november 2006 main spokesperson justice policy dutch general election 2010 3rd candidate list vvd cabinet formation 2010 first rutte cabinet teeven became undersecretary security justice taking office 14 october 2010 resigned day mp 5 november 2012 continued undersecretary security justice second rutte cabinet meanwhile mp 20 september 2012 5 november 2012 undersecretary security justice tasked dealing prevention family law youth justice copyright law 10 march 2015 justice minister ivo opstelten resigned together teeven former informed house representatives wrongly early 2000s deal made teeven state prosecutor 1994 deal concerned money paid drug trafficker whose money seized received compensation origin money could proved illegal opstelten mentioned house representatives lower amount one actually paid receipt transaction gone missing later surfaced wake scandal house chairman van miltenburg resigned 12 december 2015 became clear suppressed two letters whistle blower justice department already mentioned right details 'deal putting letters shredder resigning state secretary teeven served member house representatives 26 march 2015 23 march 2017 teeven currently works bus driver public transportation company connexxion consultant public relations cybercrime | [
4945
] | None |
7,575 | 5 | Open_Archives_Initiative_Protocol_for_Metadata_Harvesting:open archives initiative protocol metadata harvesting open archives initiative protocol metadata harvesting oai-pmh protocol developed harvesting metadata descriptions records archive services built using metadata many archives implementation oai-pmh must support representing metadata dublin core may also support additional representations protocol usually referred oai protocol oai-pmh uses xml http version 2.0 protocol released 2002 document last updated 2015 creative commons license by-sa late 1990s herbert van de sompel ghent university working researchers librarians los alamos national laboratory us called meeting address difficulties related interoperability issues e-print servers digital repositories meeting held santa fe new mexico october 1999 key development meeting definition interface permitted e-print servers expose metadata papers held structured fashion repositories could identify copy papers interest interface/protocol named santa fe convention several workshops held 2000 acm digital libraries conference elsewhere share ideas santa fe convention discovered workshops problems faced e-print community also shared libraries museums journal publishers others needed share distributed resources address needs coalition networked information digital library federation provided funding establish open archives initiative oai secretariat managed herbert van de sompel carl lagoze oai held meeting cornell university ithaca new york september 2000 improve interface developed santa fe convention specifications refined e-mail oai-pmh version 1.0 introduced public january 2001 workshop washington d.c. another february berlin germany subsequent modifications xml standard w3c required making minor modifications oai-pmh resulting version 1.1 current version 2.0 released june 2002 contained several technical changes enhancements backward compatible oai protocol adopted many digital libraries institutional repositories digital archives although registration mandatory encouraged several large registries oai-compliant repositories commercial search engines use oai-pmh acquire resources google initially included support oai-pmh launching sitemaps however decided support standard xml sitemaps format may 2008 2004 yahoo acquired content oaister university michigan obtained metadata harvesting oai-pmh wikimedia uses oai-pmh repository provide feeds wikipedia related site updates search engines bulk analysis/republishing endeavors especially dealing thousands files harvested every day oai-pmh help reducing network traffic resource usage incremental harvesting nasa mercury metadata search system uses oai-pmh index thousands metadata records global change master directory gcmd every day mod_oai project using oai-pmh expose content web crawlers accessible apache web servers oai-pmh based client–server architecture harvesters request information updated records repositories requests data based datestamp range restricted named sets defined provider data providers required provide xml metadata dublin core format may also provide xml formats number software systems support oai-pmh including fedora ethos british library gnu eprints university southampton open journal systems public knowledge project desire2learn dspace mit hyperjournal university pisa digibib digibis mycore primo digitool rosetta metalib ex libris archivalware ptfs door elab lugano switzerland panfmp pangaea data library simpledl roaring development joai number large archives support protocol including arxiv cern document server dedicated workshop cern workshop innovations scholarly communication held cern geneva regular basis since 2001 co-organised university geneva cern every two years june oai8 held june 19th-21st 2013 oai9 held june 17–19 2015 oai10 held june 21 23 2017 | [
865,
10759,
140,
3052,
8735,
8405,
6331,
479
] | None |
7,576 | 9 | PowerHouse_(programming_language):powerhouse programming language powerhouse trademarked name byte-compiled fourth-generation programming language 4gl originally produced quasar corporation later renamed cognos incorporated hewlett-packard hp3000 mini-computer initially composed five components powerhouse introduced 1982 bundled together single product quiz quick/qdesign previously available separately new batch processor qtp 1983 quasar changed name cognos corporation began porting application development tools platforms notably digital equipment corporation vax data general eclipse mv ibm as/400 along unix platforms vendors cognos also began extending product line add-ons powerhouse example architect end-user applications written powerhouse example multiview subsequent development product added support platform-specific relational databases hp allbase/sql dec rdb microsoft sql server well cross-platform relational databases oracle sybase ibm db2 powerhouse language represented considerable achievement compared languages like cobol pascal pl/1 powerhouse substantially cut amount labour required produce useful applications chosen platforms achieved use central data-dictionary compiled file extended attributes data fields natively available dbms frequently used programming idioms order support data dictionary powerhouse tightly coupled underlying database management system and/or file system target platforms case hp3000 image shallow-network dbms ksam indexed file system entire powerhouse language reflected origins described data dictionary need describe attributes applications unless need change fly example change size item make fit within constraints defined item simple quick screens could generated four lines source code screenname name screen programmer assigned program filename file name accessed data dictionary whether items file would fit screen would determined many items size n't fit program would modified eliminate unneeded items change size items size etc file couple items quick easy generate screen data entry deletion simply look data index simple quiz reports almost easy one-file report simple items file would sent screen maybe desired fashion simple since qtp programs usually involved adding deleting modifying data much need simple code programs care exercised potential danger whole file files data could wiped rather easily quick quiz qtp programs could run compiled converted machine language uncompiled source code compiled programs generally ran faster good method modifications source code corrupt object code quick screens used primarily data entry could call quick screens quiz reports qtp applications update data also things done source code order generate compiled code example go command run source code equivalent build command generate compiled code commands could abbreviated first three characters writing source code access could abbreviated acc well define report screen etc quiz reports could routed printer screen ascii text files set report device printer screen disk command given right access commands novice could write simple report programs dangerous though novice could easily destroy data security whether one call interpreters access quiz also access qtp quick like virtual machine languages powerhouse cpu intensive sometimes produced visibly negative impact overall transaction performance necessitating hardware upgrades cognos practice tying license fees hardware performance metrics resulted high licensing costs powerhouse users cognos initially attempted move intel platform 1988 dos-based powerhouse pc product used numerous partners build bespoke applications small medium-sized customers entirely unsuccessful time however cognos eventually produced axiant c.1995 ported powerhouse-like syntax intel-based microsoft windows visual development environment linked sql aware dbms running machines radical changes wrought pc revolution began time powerhouse introduced eventually brought cost host computers extent high-priced software development tools powerhouse became unattractive customers around 1999 powerhouse web released order support development web-aware applications products like business intelligence financial performance management run commodity architectures high-end unix servers form core cognos product line cognos acquired ibm january 30 2008 powerhouse application development tools including powerhouse server axiant 4gl powerhouse web acquired ibm unicom systems division unicom global december 31 2013 unicom continues support worldwide customer base products | [
10340,
5384,
4042,
6797,
10413,
11604,
11030,
119,
3323,
1469
] | Validation |
7,577 | 0 | Sentence_embedding:sentence embedding sentence embedding collective name set techniques natural language processing nlp sentences mapped vectors real numbers sentence embedding used machine learning software libraries pytorch tensorflow way testing sentence encodings apply sentences involving compositional knowledge sick corpus entailment sick-e relatedness sick-r best results obtained using bilstm network trained stanford natural language inference snli corpus pearson correlation coefficient sick-r 0.885 result sick-e 86.3 slight improvement previous scores presented sick-r 0.888 sick-e 87.8 using concatenation bidirectional gated recurrent unit infersent sentence embeddings training code learning general purpose distributed sentence representations via large scale multi-task learning | [
6274,
11330,
7780,
9935,
4468
] | Test |
7,578 | 4 | Content_Threat_Removal:content threat removal content threat removal ctr cyber security technology intended defeat threat posed handling digital content cyberspace unlike defences including antivirus software sandboxed execution rely able detect threats similarly content disarm reconstruction ctr designed remove threat without knowing whether done acts without knowing data contains threat detection strategies work detecting unsafe content blocking removing content content deemed safe delivered destination contrast content threat removal assumes data hostile delivers none destination regardless whether actually hostile although data delivered business information carried data delivered using new data created purpose advanced attacks continuously defeat defences based detection often referred zero day attacks soon discovered attack detection mechanisms must updated identify neutralise attack systems unprotected attacks succeed attackers skilled finding new ways evading detection polymorphic code used evade detection known unsafe data sandbox detection allows attacks evade dynamic analysis content threat removal defence works intercepting data way destination business information carried data extracted data discarded entirely new clean safe data built carry information destination effect building new data carry business information unsafe elements original data left behind discarded includes executable data macros scripts malformed data triggers vulnerabilities applications ctr form content transformation transformations provide complete defence content threat ctr applicable user-to-user traffic email chat machine-to-machine traffic web services data transfers intercepted in-line application layer proxies transform way information content delivered remove threat ctr works extracting business information data possible extract information executable code means ctr directly applicable web browsing since web pages code however applied content downloaded uploaded web sites although web pages transformed render safe web browsing isolated remote access protocols used reach isolated environment subjected ctr ctr provides solution problem stegware naturally removes detectable steganography eliminates symbiotic permutation steganography normalisation deep secure pioneered development ctr number products services incorporate ctr including application layer proxies email web services icap internet content adaptation protocol sidecar servers uploaded downloaded content garrison provide remote desktop isolation solution display content converted video signal recoded video stream using separate hardware chips process removes threat content display content | [
10816,
10210,
3944,
7851,
4972,
4725,
1017,
2558
] | Test |
7,579 | 4 | Electronic_waste:electronic waste electronic waste e-waste describes discarded electrical electronic devices used electronics destined refurbishment reuse resale salvage recycling material recovery disposal also considered e-waste informal processing e-waste developing countries lead adverse human health effects environmental pollution electronic scrap components cpus contain potentially harmful materials lead cadmium beryllium brominated flame retardants recycling disposal e-waste may involve significant risk health workers communities developed countries great care must taken avoid unsafe exposure recycling operations leaking materials heavy metals landfills incinerator ashes electronic-waste electronic waste created electronic product discarded end useful life rapid expansion technology consumption driven society results creation large amount e-waste every minute european weee directive classifies waste ten categories large household appliances including cooling freezing appliances small household appliances equipment including monitors consumer electronics including tvs lamps luminaires toys tools medical devices monitoring control instruments automatic dispensers include used electronics destined reuse resale salvage recycling disposal well re-usables working repairable electronics secondary raw materials copper steel plastic etc. term waste reserved residue material dumped buyer rather recycled including residue reuse recycling operations loads surplus electronics frequently commingled good recyclable non-recyclable several public policy advocates apply term e-waste e-scrap broadly surplus electronics cathode ray tubes crts considered one hardest types recycle crts relatively high concentration lead phosphors confused phosphorus necessary display united states environmental protection agency epa includes discarded crt monitors category hazardous household waste considers crts set aside testing commodities discarded speculatively accumulated left unprotected weather damage crt devices often confused dlp rear projection tv different recycling process due materials composed eu member states operate system via european waste catalogue ewc european council directive interpreted member state law uk form list wastes directive however list ewc gives broad definition ewc code 16 02 13* hazardous electronic waste requiring waste operators employ hazardous waste regulations annex 1a annex 1b refined definition constituent materials waste also require assessment via combination annex ii annex iii allowing operators determine whether waste hazardous debate continues distinction commodity waste electronics definitions exporters accused deliberately leaving difficult-to-recycle obsolete non-repairable equipment mixed loads working equipment though may also come ignorance avoid costly treatment processes protectionists may broaden definition waste electronics order protect domestic markets working secondary equipment high value computer recycling subset electronic waste working reusable laptops desktops components like ram help pay cost transportation larger number worthless pieces achieved display devices less negative scrap value 2011 report ghana e-waste country assessment found 215,000 tons electronics imported ghana 30 brand new 70 used used product study concluded 15 reused scrapped discarded contrasts published uncredited claims 80 imports ghana burned primitive conditions rapid changes technology changes media tapes software mp3 falling prices planned obsolescence resulted fast-growing surplus electronic waste around globe technical solutions available cases legal framework collection logistics services need implemented technical solution applied display units crt lcd led monitors processors cpu gpu apu chips memory dram sram audio components different useful lives processors frequently out-dated software longer optimized likely become e-waste display units often replaced working without repair attempts due changes wealthy nation appetites new display technology problem could potentially solved modular smartphones phonebloks types phones durable technology change certain parts phone making environmentally friendly able simply replace part phone broken reduce e-waste estimated 50 million tons e-waste produced year usa discards 30 million computers year 100 million phones disposed europe year environmental protection agency estimates 15–20 e-waste recycled rest electronics go directly landfills incinerators 2006 united nations estimated amount worldwide electronic waste discarded year 50 million metric tons according report unep titled recycling – e-waste resources amount e-waste produced – including mobile phones computers – could rise much 500 percent next decade countries india united states world leader producing electronic waste tossing away 3 million tons year china already produces 2.3 million tons 2010 estimate domestically second united states despite banned e-waste imports china remains major e-waste dumping ground developed countries society today revolves around technology constant need newest high-tech products contributing mass amount e-waste since invention iphone cell phones become top source e-waste products made last two years electrical waste contains hazardous also valuable scarce materials 60 elements found complex electronics 2013 apple sold 796 million idevices ipod iphone ipad cell phone companies make cell phones made last consumer purchase new phones companies give products short lifespans know consumer want new product buy make united states estimated 70 heavy metals landfills comes discarded electronics agreement number discarded electronic devices increasing considerable disagreement relative risk compared automobile scrap example strong disagreement whether curtailing trade used electronics improve conditions make worse according article motherboard attempts restrict trade driven reputable companies supply chain unintended consequences one theory increased regulation electronic wastes concern environmental harm nature economies creates economic disincentive remove residues prior export critics trade used electronics maintain still easy brokers calling recyclers export unscreened electronic waste developing countries china india parts africa thus avoiding expense removing items like bad cathode ray tubes processing expensive difficult developing countries become toxic dump yards e-waste developing countries receiving foreign e-waste often go repair recycle forsaken equipment yet still 90 e-waste ended landfills developing countries 2003 proponents international trade point success fair trade programs industries cooperation led creation sustainable jobs bring affordable technology countries repair reuse rates higher defenders trade used electronics say extraction metals virgin mining shifted developing countries recycling copper silver gold materials discarded electronic devices considered better environment mining also state repair reuse computers televisions become lost art wealthier nations refurbishing traditionally path development south korea taiwan southern china excelled finding retained value used goods cases set billion-dollar industries refurbishing used ink cartridges single-use cameras working crts refurbishing traditionally threat established manufacturing simple protectionism explains criticism trade works like waste makers vance packard explain criticism exports working product example ban import tested working pentium 4 laptops china bans export used surplus working electronics japan opponents surplus electronics exports argue lower environmental labour standards cheap labour relatively high value recovered raw materials lead transfer pollution-generating activities smelting copper wire china malaysia india kenya various african countries electronic waste sent countries processing sometimes illegally many surplus laptops routed developing nations dumping grounds e-waste united states ratified basel convention ban amendment domestic federal laws forbidding export toxic waste basel action network estimates 80 electronic waste directed recycling u.s. get recycled put container ships sent countries china figure disputed exaggeration epa institute scrap recycling industries world reuse repair recycling association independent research arizona state university showed 87–88 imported used computers higher value best value constituent materials contained official trade end-of-life computers thus driven reuse opposed recycling proponents trade say growth internet access stronger correlation trade poverty haiti poor closer port new york southeast asia far electronic waste exported new york asia haiti thousands men women children employed reuse refurbishing repair re-manufacturing unsustainable industries decline developed countries denying developing nations access used electronics may deny sustainable employment affordable products internet access force deal even less scrupulous suppliers series seven articles atlantic shanghai-based reporter adam minter describes many computer repair scrap separation activities objectively sustainable opponents trade argue developing countries utilize methods harmful wasteful expedient prevalent method simply toss equipment onto open fire order melt plastics burn away non-valuable metals releases carcinogens neurotoxins air contributing acrid lingering smog noxious fumes include dioxins furans bonfire refuse disposed quickly drainage ditches waterways feeding ocean local water supplies june 2008 container electronic waste destined port oakland u.s. sanshui district mainland china intercepted hong kong greenpeace concern exports electronic waste raised press reports india ghana côte d'ivoire nigeria research undertaken countering weee illegal trade cwit project funded european commission found europe 35 3.3 million tons e-waste discarded 2012 ended officially reported amounts collection recycling systems 65 6.15 million tons either guiyu shantou region china massive electronic waste processing community often referred e-waste capital world traditionally guiyu agricultural community however mid-1990s transformed e-waste recycling center involving 75 local households additional 100,000 migrant workers thousands individual workshops employ laborers snip cables pry chips circuit boards grind plastic computer cases particles dip circuit boards acid baths dissolve precious metals others work strip insulation wiring attempt salvage tiny amounts copper wire uncontrolled burning disassembly disposal led number environmental problems groundwater contamination atmospheric pollution water pollution either immediate discharge surface runoff especially near coastal areas well health problems including occupational safety health effects among directly indirectly involved due methods processing waste six many villages guiyu specialize circuit-board disassembly seven plastics metals reprocessing two wire cable disassembly greenpeace environmental group sampled dust soil river sediment groundwater guiyu found high levels toxic heavy metals organic contaminants places lai yun campaigner group found 10 poisonous metals lead mercury cadmium guiyu one example digital dumps similar places found across world nigeria ghana india guiyu likely one oldest largest informal e-waste recycling sites world however many sites worldwide including india ghana agbogbloshie nigeria philippines research involving informal e-waste recycling done guiyu handful studies describe exposure levels e-waste workers community environment example locals migrant workers delhi northern union territory india scavenge discarded computer equipment extract base metals using toxic unsafe methods bangalore located southern india often referred silicon valley india growing informal e-waste recycling sector studies found e-waste workers slum community higher levels v cr mn mo sn tl pb workers e-waste recycling facility processes dismantling disposing electronic waste developing countries led number environmental impacts illustrated graphic liquid atmospheric releases end bodies water groundwater soil air therefore land sea animals – domesticated wild crops eaten animals human drinking water one study environmental effects guiyu china found following separate study agbogbloshie e-waste dump ghana found presence lead levels high 18,125 ppm soil us epa standard lead soil play areas 400 ppm 1200 ppm non-play areas scrap workers agbogbloshie e-waste dump regularly burn electronic components auto harness wires copper recovery releasing toxic chemicals like lead dioxins furans environment environmental impact processing different electronic waste components e-waste presents potential security threat individuals exporting countries hard drives properly erased computer disposed reopened exposing sensitive information credit card numbers private financial data account information records online transactions accessed willing individuals organized criminals ghana commonly search drives information use local scams electronic files government contracts discovered hard drives found agbogbloshie multimillion-dollar agreements united states security institutions defense intelligence agency dia transportation security administration homeland security resurfaced agbogbloshie recycling essential element e-waste management properly carried greatly reduce leakage toxic materials environment mitigate exhaustion natural resources however need encouraged local authorities community education one major challenges recycling printed circuit boards electronic wastes circuit boards contain precious metals gold silver platinum etc base metals copper iron aluminum etc one way e-waste processed melting circuit boards burning cable sheathing recover copper wire open- pit acid leaching separating metals value conventional method employed mechanical shredding separation recycling efficiency low alternative methods cryogenic decomposition studied printed circuit board recycling methods still investigation properly disposing reusing electronics help prevent health problems reduce greenhouse-gas emissions create jobs reuse refurbishing offer environmentally friendly socially conscious alternative downcycling processes u.s. environmental protection agency encourages electronic recyclers become certified demonstrating accredited independent third party auditor meet specific standards safely recycle manage electronics work ensure highest environmental standards maintained two certifications electronic recyclers currently exist endorsed epa customers encouraged choose certified electronics recyclers responsible electronics recycling reduces environmental human health impacts increases use reusable refurbished equipment reduces energy use conserving limited resources two epa-endorsed certification programs responsible recyclers practices r2 e-stewards certified companies ensure meeting strict environmental standards maximize reuse recycling minimize exposure human health environment ensure safe management materials require destruction data used electronics certified electronics recyclers demonstrated audits means continually meet specific high environmental standards safely manage used electronics certified recycler held particular standard continual oversight independent accredited certifying body certification board accredits oversees certifying bodies ensure meet specific responsibilities competent audit provide certification u.s. retailers offer opportunities consumer recycling discarded electronic devices us consumer electronics association cea urges consumers dispose properly end-of-life electronics recycling locator www.greenergadgets.org list includes manufacturer retailer programs use strictest standards third-party certified recycling locations provide consumers assurance products recycled safely responsibly cea research found 58 percent consumers know take end-of-life electronics electronics industry would much like see level awareness increase consumer electronics manufacturers retailers sponsor operate 5,000 recycling locations nationwide vowed recycle one billion pounds annually 2016 sharp increase 300 million pounds industry recycled 2010 sustainable materials management smm electronic challenge created united states environmental protection agency epa 2012 participants challenge manufacturers electronics electronic retailers companies collect end-of-life eol electronics various locations send certified third-party recycler program participants able publicly promote report 100 responsible recycling companies electronics takeback coalition etbc campaign aimed protecting human health limiting environmental effects electronics produced used discarded etbc aims place responsibility disposal technology products electronic manufacturers brand owners primarily community promotions legal enforcement initiatives provides recommendations consumer recycling list recyclers judged environmentally responsible major benefits rise recycling waste collection created producers consumers valuable materials recovered kept away landfill incineration still many problems present epr system including “ ensure proper enforcement recycling standards waste positive net value role competition ” kunz et al. many stakeholders agreed needs higher standard accountability efficiency improve systems recycling everywhere well growing amount waste opportunity downfall since gives us chances create efficient system make recycling competition cost-effective producers agreed needs higher drive competition allows wider range producer responsibility organizations choose e-waste recycling certified electronics recycler program electronic recyclers comprehensive integrated management system standard incorporates key operational continual improvement elements quality environmental health safety performance grassroots silicon valley toxics coalition promotes human health addresses environmental justice problems resulting toxins technologies world reuse repair recycling association wr3a.org organization dedicated improving quality exported electronics encouraging better recycling standards importing countries improving practices fair trade principles take back tv project electronics takeback coalition grades television manufacturers find responsible coalition view also efforts raise awareness potentially hazardous conditions dismantling e-waste american prisons silicon valley toxics coalition prisoner-rights activists environmental groups released toxic sweatshops report details prison labor used handle e-waste resulting health consequences among workers groups allege since prisons adequate safety standards inmates dismantling products unhealthy unsafe conditions many developed countries electronic waste processing usually first involves dismantling equipment various parts metal frames power supplies circuit boards plastics often hand increasingly automated shredding equipment typical example nadin electronic waste processing plant novi iskar bulgaria—the largest facility kind eastern europe advantages process human ability recognize save working repairable parts including chips transistors ram etc disadvantage labor cheapest countries lowest health safety standards alternative bulk system hopper conveys material shredding unsophisticated mechanical separator screening granulating machines separate constituent metal plastic fractions sold smelters plastics recyclers recycling machinery enclosed employs dust collection system emissions caught scrubbers screens magnets eddy currents trommel screens employed separate glass plastic ferrous nonferrous metals separated smelter leaded glass crts reused car batteries ammunition lead wheel weights sold foundries fluxing agent processing raw lead ore. copper gold palladium silver tin valuable metals sold smelters recycling hazardous smoke gases captured contained treated mitigate environmental threat methods allow safe reclamation valuable computer construction materials hewlett-packard product recycling solutions manager renee st. denis describes process move giant shredders 30 feet tall shreds everything pieces size quarter disk drive shredded pieces big hard get data ideal electronic waste recycling plant combines dismantling component recovery increased cost-effective processing bulk electronic waste reuse alternative option recycling extends lifespan device devices still need eventual recycling allowing others purchase used electronics recycling postponed value gained device use recycling raw materials end-of-life electronics effective solution growing e-waste problem electronic devices contain variety materials including metals recovered future uses dismantling providing reuse possibilities intact natural resources conserved air water pollution caused hazardous disposal avoided additionally recycling reduces amount greenhouse gas emissions caused manufacturing new products another benefit recycling e-waste many materials recycled re-used materials recycled include ferrous iron-based non-ferrous metals glass various types plastic “ non-ferrous metals mainly aluminum copper re-smelted re-manufactured ferrous metals steel iron also re-used due recent surge popularity 3d printing certain 3d printers designed fdm variety produce waste easily recycled decreases amount harmful pollutants atmosphere excess plastic printers comes byproduct also reused create new 3d printed creations benefits recycling extended responsible recycling methods used u.s. responsible recycling aims minimize dangers human health environment disposed dismantled electronics create responsible recycling ensures best management practices electronics recycled worker health safety consideration environment locally abroad europe metals recycled returned companies origin reduced cost committed recycling system manufacturers japan pushed make products sustainable since many companies responsible recycling products imposed responsibility manufacturers requiring many redesign infrastructure result manufacturers japan added option sell recycled metals one factors exacerbate e-waste problem diminishing lifetime many electrical electronic goods two drivers particular trend one hand consumer demand low cost products mitigates product quality results short product lifetimes manufacturers sectors encourage regular upgrade cycle may even enforce though restricted availability spare parts service manuals software updates planned obsolescence consumer dissatisfaction state affairs led growing repair movement often community level repair cafės restart parties promoted restart project right repair spearheaded us farmers dissatisfied non-availability service information specialised tools spare parts high-tech farm machinery movement extends far beyond farm machinery example restricted repair options offered apple coming criticism manufacturers often counter safety concerns resulting unauthorised repairs modifications computer components reused assembling new computer products others reduced metals reused applications varied construction flatware jewellery substances found large quantities include epoxy resins fiberglass pcbs pvc polyvinyl chlorides thermosetting plastics lead tin copper silicon beryllium carbon iron aluminium elements found small amounts include cadmium mercury thallium elements found trace amounts include americium antimony arsenic barium bismuth boron cobalt europium gallium germanium gold indium lithium manganese nickel niobium palladium platinum rhodium ruthenium selenium silver tantalum terbium thorium titanium vanadium yttrium almost electronics contain lead tin solder copper wire printed circuit board tracks though use lead-free solder spreading rapidly following ordinary applications residents living around e-waste recycling sites even involve e-waste recycling activities also face environmental exposure due food water environmental contamination caused e-waste easily contact e-waste contaminated air water soil dust food sources general three main exposure pathways inhalation ingestion dermal contact studies show people living around e-waste recycling sites higher daily intake heavy metals serious body burden potential health risks include mental health impaired cognitive function general physical health damage see also electronic waste hazardous dna damage also found prevalent e-waste exposed populations i.e adults children neonates populations control area dna breaks increase likelihood wrong replication thus mutation well lead cancer damage tumor suppressor gene prenatal exposure e-waste found adverse effects human body burden pollutants neonates guiyu one famous e-waste recycling sites china found increased cord blood lead concentration neonates associated parents participation e-waste recycling processes well long mothers spent living guiyu e-waste recycling factories workshops pregnancy besides higher placental metallothionein small protein marking exposure toxic metals found among neonates guiyu result cd exposure higher cd level guiyu neonates related involvement e-waste recycling parents high pfoa exposure mothers guiyu related adverse effect growth new-born prepotency area prenatal exposure informal e-waste recycling also lead several adverse birth outcomes still birth low birth weight low apgar scores etc longterm effects behavioral learning problems neonates future life children especially sensitive e-waste exposure several reasons smaller size higher metabolism rate larger surface area relation weight multiple exposure pathways example dermal hand-to-mouth take-home exposure measured 8-time potential health risk compared adult e-waste recycling workers studies found significant higher blood lead levels bll blood cadmium levels bcl children living e-waste recycling area compared living control area example one study found average bll guiyu nearly 1.5 times compared control site 15.3 ug/dl compared 9.9 ug/dl cdc united states set reference level blood lead 5 ug/dl highest concentrations lead found children parents whose workshop dealt circuit boards lowest among recycled plastic exposure e-waste cause serious health problems children children exposure developmental neurotoxins containing e-waste lead mercury cadmium chromium pbdes lead higher risk lower iq impaired cognitive function adverse effects certain age groups decreased lung function children e-waste recycling sites found studies also found associations children e-waste exposure impaired coagulation hearing loss decreased vaccine antibody tilters e-waste recycling area occupational safety health administration osha summarized several potential safety hazards recycling workers general crushing hazards hazardous energy released toxic metals osha also specified chemical components electronics potentially harm e-recycling workers health lead mercury pcbs asbestos refractory ceramic fibers rcfs radioactive substances.besides united states chemical hazards specific occupational exposure limits oels set osha national institute occupational safety health niosh american conference governmental industrial hygienists acgih details health consequences chemical hazards see also electronic waste electronic waste substances informal e-recycling industry refers small e-waste recycling workshops automatic procedures personal protective equipment ppe hand formal e-recycling industry refers regular e-recycling facilities sorting materials e-waste automatic machinery manual labor pollution control ppe common sometimes formal e-recycling facilities dismantle e-waste sort materials distribute downstream recycling department recover materials plastic metals health impact e-waste recycling workers working informal industry formal industry expect different extent studies three recycling sites china suggest health risks workers formal e-recycling facilities jiangsu shanghai lower compared worked informal e-recycling sites guiyu another study e-waste recycling india hair samples collected workers e-waste recycling facility e-waste recycling slum community informal industry bangalore levels v cr mn mo sn tl pb significantly higher workers e-waste recycling facility compared e-waste workers slum community however co ag cd hg levels significantly higher slum community workers compared facility workers even formal e-recycling industry workers exposed excessive pollutants studies formal e-recycling facilities france sweden found workers overexposure compared recommended occupational guidelines lead cadmium mercury metals well bfrs pcbs dioxin furans workers formal industry also exposed brominated flame-retardants reference groups occupational health safety e-waste recycling workers employers workers take actions suggestions e-waste facility employers workers given california department public health illustrated graphic policy conventions security general | [
6658,
8836,
5637,
6,
9356,
11534,
403,
7704,
10393,
7579,
9499,
6301,
1056,
10023,
3626,
2867,
1083,
3009,
7492,
1477,
2383,
3279,
3666,
2259,
2773,
3162,
1500,
6494,
484,
8678,
232,
11368,
6763,
1776,
5875,
1524,
11391
] | None |
7,580 | 9 | IDL_(programming_language):idl programming language idl short interactive data language programming language used data analysis popular particular areas science astronomy atmospheric physics medical imaging idl shares common syntax pv-wave originated codebase though languages subsequently diverged detail also two free implementations gnu data language gdl fawlty language fl idl vectorized numerical interactive commonly used interactive processing large amounts data including image processing syntax includes many constructs fortran c. idl originated early vax/vms/fortran syntax still shows heritage findgen function example returns one-dimensional array floating point numbers values equal series integers starting 0 note operation second line applies vectorized manner whole 100-element array created first line analogous way general-purpose array programming languages apl j k would example contains divide zero idl report arithmetic overflow store nan value corresponding element array first one array elements finite nan excluded visualization generated plot command array programming languages idl fast vector operations sometimes fast well-coded custom loop fortran c quite slow elements need processing individually hence part art using idl array programming language matter numerically heavy computations make use built-in vector operations predecessor versions idl developed 1970s laboratory atmospheric space physics lasp university colorado boulder lasp david stern involved efforts allow scientists test hypotheses without employing programmers write modify individual applications first program evolutionary chain idl stern developed named rufus simple vector-oriented calculator ran pdp-12 accepted two-letter codes specified arithmetic operation input registers serve operands destination register version rufus developed pdp-8 mars mariner spectrum editor mmed mmed used lasp scientists interpret data mariner 7 mariner 9 later stern wrote program named sol also ran pdp-8 unlike predecessors true programming language fortran-like syntax sol array-oriented language primitive graphics capabilities stern left lasp found research systems inc. rsi 1977 first rsi product idl pdp-11 release graphics supported idl primarily tektronix terminals raster graphics displays rsi sold first idl licenses nasa goddard space flight center ball aerospace technologies corp. 1979 two years later rsi released initial vax/vms version idl written vax-11 macro fortran took advantage vax virtual memory 32-bit address space national center atmospheric research ncar university michigan university colorado naval research laboratory started use idl version 1987 rsi shifted development work idl unix environment required complete re-write code c rather port existing version vax idl stern ali bahrami rewrote idl unix sun 3 taking advantage re-write extend improve language subsequently idl expanded ported several variants unix vms linux microsoft windows 1992 mac os 1994 widgets added idl 1992 providing event-driven programming graphical user interfaces 1997 ion idl net web server-based system commercially released first version envi application remote sensing multispectral hyperspectral image analysis written idl released 1994 envi created developed owned better solutions consulting llc purchased bsc october 2000 eastman kodak coincident purchase rsi rsi sold marketed supported envi terms license agreement bsc llc 1994 october 2000 new object pointer types limited object-oriented programming capabilities added idl 1997 idl applied widely space science example solar physics european space agency used idl process almost pictures halley comet taken giotto spacecraft team repairing hubble space telescope used idl help diagnose anomalies main mirror 1995 astronauts board space shuttle used idl loaded laptop study ultraviolet radiation currently amongst applications idl used analysis secchi part stereo mission nrl usa rutherford appleton laboratory uk rsi became wholly owned subsidiary itt industries march 2004 15 may 2006 rsi began business itt visual information solutions effective 31 october 2011 result restructuring company became exelis visual information solutions idl owned maintained harris geospatial solutions computer language idl features make idl simple use interactively also cause difficulties building large programs single namespace particularly problematic example language updates include new built-in functions occasion invalidated large scientific libraries arrays passed reference mechanism advertised feature language pass data back subroutine – contrast array slices copied passed data modifications flow back array ranges subroutine exits violating principle least surprise many historical irregularities survive early heritage language requiring individual workarounds programmer example preceding issue alleviated using compiler option also provision idl eula effect australia result sections 47d 47h country copyright act following graphics created idl source code included | [
9345,
7684,
7301,
8582,
5129,
7945,
3980,
2317,
6797,
15,
7950,
8079,
9490,
5395,
9871,
2457,
5148,
8732,
7326,
8611,
7341,
9133,
6962,
10043,
6718,
2242,
10946,
5830,
5703,
4808,
5833,
4042,
5450,
8262,
8013,
2000,
5588,
2652,
10848,
104... | Validation |
7,581 | 1 | Commitment_ordering:commitment ordering commitment ordering co class interoperable serializability techniques concurrency control databases transaction processing related applications allows optimistic non-blocking implementations proliferation multi-core processors co also increasingly utilized concurrent programming transactional memory especially software transactional memory stm achieving serializability optimistically co also name resulting transaction schedule history property originally defined 1988 name dynamic atomicity co compliant schedule chronological order commitment events transactions compatible precedence order respective transactions co broad special case conflict serializability effective means reliable high-performance distributed scalable achieve global serializability modular serializability across collection database systems possibly use different concurrency control mechanisms co also makes system serializability compliant already not-co-compliant database system augmented co component commitment order coordinator—coco orders commitment events co compliance neither data-access transaction operation interference co provides low overhead general solution global serializability distributed serializability instrumental global concurrency control distributed concurrency control multi database systems transactional objects possibly highly distributed e.g. within cloud computing grid computing networks smartphones atomic commitment protocol acp type fundamental part solution utilized break global cycles conflict precedence serializability graph co general property necessary condition guarantees global serializability database systems involved share concurrency control information beyond atomic commitment protocol unmodified messages knowledge whether transactions global local database systems autonomous thus co variants general technique require typically costly distribution local concurrency control information e.g. local precedence relations locks timestamps tickets generalizes popular strong strict two-phase locking ss2pl property conjunction two-phase commit protocol 2pc de facto standard achieve global serializability across ss2pl based database systems result co compliant database systems different concurrency control types transparently join ss2pl based solutions global serializability addition locking based global deadlocks resolved automatically co based multi-database environment important side-benefit including special case completely ss2pl based environment previously unnoticed fact ss2pl furthermore strict commitment ordering sco raz 1991c intersection strictness co provides better performance shorter average transaction completion time resulting better transaction throughput ss2pl whenever read-write conflicts present identical blocking behavior write-read write-write conflicts comparable locking overhead advantage sco especially significant lock contention strictness allows ss2pl sco use effective database recovery mechanisms two major generalizing variants co exist extended co eco raz 1993a multi-version co mvco raz 1993b well provide global serializability without local concurrency control information distribution combined relevant concurrency control allow optimistic non-blocking implementations use additional information relaxing co constraints achieving better concurrency performance vote ordering vo generalized co gco raz 2009 container schedule set property technique co variants local vo necessary condition guaranteeing global serializability atomic commitment protocol acp participants share concurrency control information generalized autonomy property co variants inter-operate transparently guaranteeing global serializability automatic global deadlock resolution also together mixed heterogeneous environment different variants commitment ordering co raz 1990 1992 1994 2009 schedule property referred also dynamic atomicity since 1988 commit ordering commit order serializability strong recoverability since 1991 latter misleading name since co incomparable recoverability term strong implies special case means schedule strong recoverability property necessarily co property vice versa 2009 co characterized major concurrency control method together previously known since 1980s three major methods locking time-stamp ordering serialization graph testing enabler interoperability systems using different concurrency control mechanisms federated database system loosely defined multidatabase system typically distributed communication network transactions span multiple possibly distributed databases enforcing global serializability system problematic even every local schedule single database serializable still global schedule whole system necessarily serializable massive communication exchanges conflict information needed databases reach conflict serializability would lead unacceptable performance primarily due computer communication latency problem achieving global serializability effectively characterized open public disclosure co 1991 inventor yoav raz raz 1991a see also global serializability enforcing co effective way enforce conflict serializability globally distributed system since enforcing co locally database transactional object also enforces globally database may use possibly different type concurrency control mechanism local mechanism already provides conflict serializability enforcing co locally cause additional aborts since enforcing co locally affect data access scheduling strategy mechanism scheduling determines serializability related aborts mechanism typically consider commitment events order co solution requires communication overhead since uses unmodified atomic commitment protocol messages already needed distributed transaction reach atomicity atomic commitment protocol plays central role distributed co algorithm enforces co globally breaking global cycles cycles span two databases global conflict graph co special cases generalizations interoperable achieve global serializability transparently utilized together single heterogeneous distributed environment comprising objects possibly different concurrency control mechanisms commitment ordering including special cases together generalizations see co variants provides general high performance fully distributed solution central processing component central data structure needed guaranteeing global serializability heterogeneous environments multidatabase systems multiple transactional objects objects states accessed modified transactions e.g. framework transactional processes within cloud computing grid computing co solution scales network size number databases without negative impact performance assuming statistics single distributed transaction e.g. average number databases involved single transaction unchanged proliferation multi-core processors optimistic co oco also increasingly utilized achieve serializability software transactional memory numerous stm articles patents utilizing commit order already published e.g. zhang et al 2006 commitment ordering co special case conflict serializability co enforced non-blocking mechanisms transaction complete task without data-access blocked allows optimistic concurrency control however commitment could blocked co schedule commitment events partial precedence order transactions corresponds precedence partial order respective transactions directed conflict graph precedence graph serializability graph induced conflicting access operations usually read write insert/modify/delete operations co also applies higher level operations conflicting noncommutative well conflicts operations upon multi-version data commitment decision events generated either local commitment mechanism atomic commitment protocol different processes need reach consensus whether commit abort protocol may distributed centralized transactions may committed concurrently commit partial order allows conflicting operations different conflicting operations induce different partial orders transactions conflict graph cycles schedule violate serializability transactions cycle committed case partial order commitment events found thus cycles conflict graph need broken aborting transactions however conflict serializable schedule made co without aborting transaction properly delaying commit events comply transactions precedence partial order co enforcement sufficient concurrency control mechanism since co lacks recoverability property supported well fully distributed global commitment ordering enforcement algorithm exists uses local co participating database needs unmodified atomic commitment protocol messages communication distributed algorithm combination local database co algorithm processes atomic commitment protocol fully distributed atomic commitment protocol essential enforce atomicity distributed transaction decide whether commit abort procedure always carried distributed transactions independently concurrency control co common example atomic commitment protocol two-phase commit protocol resilient many types system failure reliable environment processes usually fail together e.g. integrated circuit simpler protocol atomic commitment may used e.g. simple handshake distributed transaction participating processes arbitrary known special participant transaction coordinator i.e. type one-phase commit protocol atomic commitment protocol reaches consensus among participants whether commit abort distributed global transaction spans participants essential stage protocol yes vote either explicit implicit participant means obligation voting participant obey decision protocol either commit abort otherwise participant unilaterally abort transaction explicit vote protocol commits transaction yes votes received participants thus missing vote typically considered otherwise protocol aborts transaction various atomic commit protocols differ abilities handle different computing environment failure situations amounts work computing resources needed different situations entire co solution global serializability based fact case missing vote distributed transaction atomic commitment protocol eventually aborts transaction database system local co algorithm determines needed commitment order database characterization co order depends local precedence order transactions results local data access scheduling mechanisms accordingly yes votes atomic commitment protocol scheduled unaborted distributed transaction follows vote means yes vote precedence relation conflict exists two transactions second voted first completed either committed aborted prevent possible commit order violation atomic commitment protocol happen since commit order protocol necessarily voting order precedence relation exists voted concurrently vote ordering strategy ensures also atomic commitment protocol maintains commitment order necessary condition guaranteeing global co local co database without global co local co property meaning database co compliant may violated however since database systems schedule transactions independently possible transactions precedence orders two databases compatible global partial order exists embed respective local partial orders together co precedence orders also commitment orders participating databases distributed transaction compatible local precedence orders transaction without knowing typically coordination database systems exists conflicts since needed communication massive unacceptably degrades performance means transaction resides global cycle involving two databases global conflict graph case atomic commitment protocol fail collect votes needed commit transaction vote ordering strategy least one database delay vote transaction indefinitely comply commitment precedence order since waiting completion another preceding transaction global cycle delayed indefinitely another database different order means voting-deadlock situation involving databases cycle result protocol eventually abort deadlocked transaction global cycle since transaction missing least one participant vote selection specific transaction cycle aborted depends atomic commitment protocol abort policies timeout mechanism common may result one needed abort per cycle preventing unnecessary aborts abort time shortening achieved dedicated abort mechanism co abort break global cycle involving distributed transaction deadlocked transactions possibly conflict deadlocked thus blocked free voted worthwhile noting database involved voting-deadlock continues vote regularly transactions conflict deadlocked transaction typically almost outstanding transactions thus case incompatible local partial commitment orders action needed since atomic commitment protocol resolves automatically aborting transaction cause incompatibility means vote ordering strategy also sufficient condition guaranteeing global co following concluded global co implies global serializability global co algorithm comprises enforcing local co participating database system ordering commits local transactions see enforcing co locally enforcing vote ordering strategy theorem global transactions global cycle elimination process voting deadlock explained detail following observation first assumed simplicity every transaction reaches ready-to-commit state voted least one database implies blocking locks occurs define wait vote commit graph directed graph transactions nodes directed edge first transaction second transaction first transaction blocks vote commit second transaction opposite conventional edge direction wait-for graph blocking happens second transaction conflict first transaction see thus wait vote commit graph identical global conflict graph cycle wait vote commit graph means deadlock voting hence deadlock voting cycle conflict graph local cycles confined single database eliminated local serializability mechanisms consequently global cycles left eliminated atomic commitment protocol aborts deadlocked transactions missing blocked respective votes secondly also local commits dealt note enforcing co also waiting regular local commit local transaction block local commits votes transactions upon conflicts situation global transactions change also without simplifying assumption final result also local commitment local transactions without voting atomic commitment finally blocking lock excluded far needs considered lock blocks conflicting operation prevents conflict materialized lock released transaction end may block indirectly either vote local commit another transaction get ready state effect direct blocking vote local commit case cycle generated conflict graph blocking lock also represented edge added edges representing events blocking-by-a-lock conflict graph becoming augmented conflict graph presence co augmented conflict graph fact reversed edge local-commit voting wait-for graph edge exists first transaction either local global second second waiting first end order either voted global locally committed local global cycles across two databases graph generate voting-deadlocks graph global cycles provide complete characterization voting deadlocks may include combination materialized non-materialized conflicts cycles materialized conflicts also cycles regular conflict graph affect serializability one lock related non-materialized conflicts cycle prevent cycle regular conflict graph make locking related deadlock global cycles voting-deadlocks need broken resolved maintain global serializability resolve global deadlocks involving data access locking indeed broken atomic commitment protocol due missing votes upon voting deadlock comment observation also explains correctness extended co eco global transactions voting order must follow conflict graph order vote blocking order relation graph path exists two global transactions local transactions voted local commits blocked upon conflicts results voting-deadlock situations resulting global cycle elimination process eco voting-deadlock situation summarized follows also following locking based special case concluded voting-deadlocks key operation distributed co global cycle elimination voting-deadlock resolution atomic commitment resulting aborted transactions re-executions time consuming regardless concurrency control used databases schedule transactions independently global cycles unavoidable complete analogy cycles/deadlocks generated local ss2pl distribution transaction operation scheduling coordination results autonomy violation typically also substantial performance penalty however many cases likelihood made low implementing database transaction design guidelines reduce number conflicts involving global transaction primarily properly handling hot spots database objects frequent access avoiding conflicts using commutativity possible e.g. extensively using counters finances especially multi-transaction accumulation counters typically hot spots atomic commitment protocols intended designed achieve atomicity without considering database concurrency control abort upon detecting heuristically finding e.g. timeout sometimes mistakenly unnecessarily missing votes typically unaware global cycles protocols specially enhanced co including co variants prevent unnecessary aborts accelerate aborts used breaking global cycles global augmented conflict graph better performance earlier release upon transaction-end computing resources typically locked data example existing locking based global deadlock detection methods timeout generalized consider also local commit vote direct blocking besides data access blocking possible compromise mechanisms effectively detecting breaking frequent relatively simple handle length-2 global cycles using timeout undetected much less frequent longer cycles commitment ordering enforced locally single database dedicated co algorithm algorithm/protocol provides special case co. important protocol utilized extensively database systems generates co schedule strong strict two phase locking protocol ss2pl release transaction locks transaction either committed aborted see ss2pl proper subset intersection 2pl strictness generic local co algorithm raz 1992 algorithm 4.1 algorithm independent implementation details enforces exactly co property block data access nonblocking consists aborting certain set transactions needed upon committing transaction aborts uniquely determined given time minimal set undecided neither committed aborted transactions run locally cause serializability violation future later generate cycles committed transactions conflict graph abort set committed transaction committing transaction abort commit time committed doomed aborted set consists undecided transactions directed edges conflict graph committed transaction size set increase transaction waiting committed ready state processing ended typically decreases time transactions decided thus unless real-time constraints exist complete transaction preferred wait committing transaction let set decrease size another serializability mechanism exists locally eliminates cycles local conflict graph cycle involving transaction exists set empty eventually abort set member needed otherwise set stabilize transactions local cycles aborting set members occur break cycles since case co conflicts generate blocking commit local cycles augments conflict graph see indicate local commit-deadlocks deadlock resolution techniques ss2pl used e.g. like timeout wait-for graph local cycle augmented conflict graph least one non-materialized conflict reflects locking-based deadlock local algorithm applied local augmented conflict graph rather regular local conflict graph comprises generic enhanced local co algorithm single local cycle elimination mechanism guaranteeing local serializability handling locking based local deadlocks practically additional concurrency control mechanism always utilized even solely enforce recoverability generic co algorithm affect local data access scheduling strategy runs alongside local concurrency control mechanism affects commit order reason need abort transactions needed aborted serializability violation prevention combined local concurrency control mechanism net effect co may delay commit events voting distributed environment comply needed commit order delay special cases example ss2pl average significantly less following theorem concluded proliferation multi-core processors variants generic local co algorithm also increasingly utilized concurrent programming transactional memory especially software transactional memory achieving serializability optimistically commit order e.g. ramadan et al 2009 zhang et al 2006 von parun et al 2007 numerous related articles patents utilizing co already published database system multidatabase environment assumed software architecture point view co component implements generic co algorithm locally commitment order coordinator coco designed straightforward way mediator single database system atomic commitment protocol component raz 1991b however coco typically integral part database system coco functions vote commit ready global transactions processing ended according local commitment order vote abort transactions database system initiated abort database system initiate abort transaction many reasons pass atomic commitment decision database system local transactions identified voting needed determining commitment order coco maintains updated representation local conflict graph local augmented conflict graph capturing also locking deadlocks undecided neither committed aborted transactions data structure e.g. utilizing mechanisms similar locking capturing conflicts data-access blocking coco component interface database system receive conflict ready processing ended readiness vote global transaction commit local one abort notifications database system also interfaces atomic commitment protocol vote receive atomic commitment protocol decision global transaction decisions delivered coco database system interface well local transactions commit notifications proper commit order coco including interfaces enhanced implements another variant co see plays role database concurrency control mechanism beyond voting atomic commitment coco also guarantees co locally single isolated database system interface atomic commitment protocol databases participate distributed transactions i.e. transactions span single database use shared concurrency control information use unmodified atomic commitment protocol messages reaching atomicity maintaining local commitment ordering one generalizing variants see necessary condition guaranteeing global serializability proof technique found raz 1992 different proof method raz 1993a also sufficient condition mathematical fact derived definitions serializability transaction means complying co global serializability guaranteed condition condition local concurrency control information sharing databases beyond atomic commit protocol messages atomic commitment minimal requirement distributed transaction since always needed implied definition transaction raz 1992 defines database autonomy independence complying requirement without using additional local knowledge using definition following concluded however definition autonomy implies example transactions scheduled way local transactions confined single database identified autonomous database system realistic transactional objects restrictive less realistic general purpose database systems autonomy augmented ability identify local transactions compliance general property extended commitment ordering eco see makes eco necessary condition raz 2009 notion generalized autonomy captures intended notion autonomy definition probably broadest definition possible context database concurrency control makes co together useful concurrency control information distribution generalizing variants vote ordering vo see co variants necessary condition global serializability i.e. union co generalizing variants necessary set vo may include also new unknown useful generalizing variants commitment ordering co solution technique global serializability summarized follows database transactional object multidatabase environment complies co i.e. arranges local transactions commitments votes global distributed transactions atomic commitment protocol according local database partial order induced local conflict graph serializability graph respective transactions global co global serializability guaranteed database co compliance achieved effectively local conflict serializability based concurrency control mechanism neither affecting transaction execution process scheduling aborting also database autonomy violated low overhead incurred detecting conflicts e.g. locking data-access blocking already detected purposes ordering votes local transactions commits according conflicts case incompatible partial orders two databases global partial order embed respective local partial orders together global cycle spans two databases global conflict graph generated together co results cycle blocked votes voting-deadlock occurs databases cycle however allowed concurrent voting database typically almost outstanding votes continue execute case atomic commitment protocol fails collect votes needed blocked transactions global cycle consequently protocol aborts transaction missing vote breaks global cycle voting-deadlock resolved related blocked votes free executed breaking global cycle global conflict graph ensures global co global serializability maintained thus case incompatible local partial commitment orders action needed since atomic commitment protocol resolves automatically aborting transaction cause incompatibility furthermore also global deadlocks due locking global cycles augmented conflict graph least one data access blocking result voting deadlocks resolved automatically mechanism local co necessary condition guaranteeing global serializability databases involved share concurrency control information beyond unmodified atomic commitment protocol messages i.e. databases autonomous context concurrency control means every global serializability solution autonomous databases must comply co otherwise global serializability may violated thus likely violated quickly high-performance environment co solution scales network size number databases without performance penalty utilizes common distributed atomic commitment architecture distinguishing characteristic co solution distributed serializability techniques fact requires conflict information distributed e.g. local precedence relations locks timestamps tickets makes uniquely effective utilizes unmodified atomic commitment protocol messages already used instead common way achieve distributed serializability distributed system distributed lock manager dlm dlms communicate lock non-materialized conflict information distributed environment typically suffer computer communication latency reduces performance system co allows achieve distributed serializability general conditions without distributed lock manager exhibiting benefits already explored multidatabase environments particular reliability high performance scalability possibility using optimistic concurrency control desired conflict information related communications network incurred overhead delays automatic distributed deadlock resolution distributed transactional systems rely atomic commitment protocol coordinate atomicity whether commit abort among processes distributed transaction also typically recoverable data i.e. data transactions control e.g. database data confused recoverability property schedule directly accessed single transactional data manager component also referred resource manager handles local sub-transactions distributed transaction portion single location e.g. network node even data accessed indirectly entities distributed system transaction i.e. indirect access requires direct access local sub-transaction thus recoverable data distributed transactional system typically partitioned among transactional data managers system transactional data managers typically comprise participants system atomic commitment protocol participant complies co e.g. using ss2pl cocos combination see entire distributed system provides co theorems participant considered separate transactional object thus distributed serializability furthermore co utilized together atomic commitment protocol also distributed deadlocks i.e. deadlocks span two data managers caused data-access locking resolved automatically thus following corollary concluded theorem also means ss2pl co variant used locally transactional data manager data manager exclusive control data distributed lock manager often utilized enforce distributed ss2pl needed distributed ss2pl serializability relevant wide range distributed transactional applications easily designed meet theorem conditions implementing distributed optimistic co doco generic local co algorithm utilized atomic commitment protocol participants system data access blocking thus local deadlocks previous theorem following corollary distributed database system utilizes ss2pl resides two remote nodes b database system two transactional data managers resource managers one node database data partitioned two data managers way exclusive control local node portion data handles data locks without knowledge manager distributed transaction data managers need execute available atomic commitment protocol two distributed transactions formula_3 formula_2 running concurrently access data x y. x exclusive control data manager b manager access x b respective local sub-transactions b portions formula_3 formula_2 nodes following database system schedule certain point time following formula_3 holds read-lock x formula_2 holds read-locks thus formula_27 formula_30 blocked lock compatibility rules ss2pl executed distributed deadlock situation also voting-deadlock see distributed global cycle length 2 number edges conflicts 2 frequent length local sub-transactions following states since atomic commitment protocol receive votes blocked sub-transactions voting-deadlock eventually abort transaction missing vote timeout either formula_3 formula_2 timeouts fall close resolve global deadlock remaining transaction complete running voted committed aborted transaction immediately restarted re-executed scenario conflicts non-materialized global voting-deadlock reflected cycle global wait-for graph global conflict graph see exact characterization voting-deadlocks global cycles however database system utilize co variant exactly conflicts voting-deadlock situation resolution conflicts either materialized non-materialized depending co variant used example sco used distributed database system instead ss2pl two conflicts example materialized local sub-transactions ready states vote blocking occurs two transactions one node co voting rule applied independently b due conflicts formula_52 voted formula_53 ends formula_54 voted formula_55 ends voting-deadlock conflict graph global cycle conflicts materialized resolved atomic commitment protocol distributed serializability maintained unlikely distributed database system possible principle occurs multi-database employ ss2pl b employs sco case global cycle neither wait-for graph serializability graph still augmented conflict graph union two various combinations summarized following table comment examples describe real recommended utilization co example hypothetical demonstration certain experimental distributed memory-resident databases advocate multi single-threaded core music transactional environments single-threaded refers transaction threads serial execution transactions purpose possible orders magnitude gain performance e.g. h-store voltdb relatively conventional transaction execution multiple threads core described music independent way cores distributed may reside one integrated circuit chip many chips possibly distributed geographically many computers environment recoverable transactional data partitioned among threads cores implemented conventional way distributed co described previous sections doco strictness exist automatically however downsides exist straightforward implementation environment practicality general-purpose solution questionable hand tremendous performance gain achieved applications bypass downsides situations comment music straightforward implementation described uses example usual distributed co voting transaction thread blocking atomic commitment protocol needed demonstration connection implementation h-store project music environment local schedules serial thus local optimistic co oco see global co enforcement vote ordering strategy condition atomic commitment protocol met automatically results distributed co compliance thus distributed serializability automatic global voting deadlock resolution furthermore also local strictness follows automatically serial schedule theorem 5.2 raz 1992 page 307 co vote ordering strategy applied also global strictness guaranteed note serial locally mode allows strictness optimistic data access blocking together following concluded special case schedule property classes e.g. ss2pl sco strictly contained co class generalizing classes eco mvco strictly contain co class i.e. include also schedules co compliant generalizing variants also guarantee global serializability without distributing local concurrency control information database generalized autonomy property uses local information relaxing co constraints utilizing additional local information better concurrency performance eco uses knowledge transactions local i.e. confined single database mvco uses availability data versions values like co generalizing variants non-blocking interfere transaction operation scheduling seamlessly combined relevant concurrency control mechanism term co variant refers general co eco mvco combination relevant concurrency control mechanism property including multi-version based eco mveco generalizing variants guarantee global serializability local concurrency control information distribution known may discovered strong strict two phase locking ss2pl also referred rigorousness rigorous scheduling means read write locks transaction released transaction ended either committed aborted set ss2pl schedules proper subset set co schedules property widely utilized database systems since implies co databases use participate global transactions generate together serializable global schedule using atomic commitment protocol needed atomicity multi-database environment database modification addition needed case participate co distributed solution set undecided transactions aborted committing local generic co algorithm empty locks hence algorithm unnecessary case transaction voted database system immediately entering ready state i.e. completing running task locally locks released database system decided atomic commitment protocol thus condition global co enforcing theorem kept automatically local timeout mechanism used database system resolve local ss2pl deadlocks aborting blocked transactions breaks potential local cycles global conflict graph real cycles augmented conflict graph also database system potential global cycles side effect atomic commitment protocol abort mechanism relatively slow independent aborts several entities typically may result unnecessary aborts one transaction per global cycle situation different local wait-for graph based mechanisms identify global cycles atomic commitment protocol break global cycle resulting voting deadlock resolved earlier another database local ss2pl together atomic commitment implying global serializability also deduced directly transactions including distributed obey 2pl ss2pl rules atomic commitment protocol mechanism needed consensus commit rather end phase-two synchronization point probably reason without considering atomic commitment voting mechanism automatic global deadlock resolution noticed co strict commitment ordering sco raz 1991c intersection strictness special case recoverability co provides upper bound schedule concurrency properties exist implemented using blocking mechanisms locking similar used popular ss2pl similar overheads unlike ss2pl sco block read-write conflict possibly blocks commit instead sco ss2pl identical blocking behavior two conflict types write-read write-write result sco shorter average blocking periods concurrency e.g. performance simulations single database significant variant locks ordered sharing identical sco clearly show approximately 100 gain transaction loads also identical transaction loads sco reach higher transaction rates ss2pl lock thrashing occurs concurrency means given computing resources transactions completed time unit higher transaction rate throughput average duration transaction shorter faster completion see chart advantage sco especially significant lock contention sco practical ss2pl since ss2pl provides besides serializability also strictness widely utilized basis efficient recovery databases failure ss2pl mechanism converted sco one better performance straightforward way without changing recovery methods description sco implementation found perrizo tatarinov 1998 see also semi-optimistic database scheduler ss2pl proper subset sco another explanation sco less constraining provides concurrency ss2pl implementing optimistic commitment ordering oco generic local co algorithm utilized without data access blocking thus without local deadlocks oco without transaction operation scheduling constraints covers entire co class special case co class rather useful co variant mechanism characterization extended commitment ordering eco raz 1993a generalizes co local transactions transactions confined single database distinguished global distributed transactions transactions span two databases commitment order applied global transactions thus local database schedule eco property chronological partial order commit events global transactions unimportant local transactions consistent order respective local conflict graph distributed algorithm guarantee global eco exists co algorithm needs unmodified atomic commitment protocol messages order guarantee global serializability database needs guarantee also conflict serializability transactions local concurrency control mechanism condition eco local serializability weaker co allows concurrency cost little complicated local algorithm however practical overhead difference co exists transactions assumed global e.g. information available transactions local eco reduces co. global transaction committed generic local database eco algorithm aborts minimal set undecided transactions neither committed aborted either local transactions global run locally cause later cycle conflict graph set aborted transactions unique contrary co optimized transaction assigned weight determined transaction importance computing resources already invested running transaction optimization carried example reduction max flow networks problem raz 1993a like co set time dependent becomes empty eventually practically almost needed implementations transaction committed set empty set optimization applicable local database concurrency control mechanism separate eco algorithm ensures local cycles eliminated unlike co implies serializability however practically also co local concurrency mechanism utilized least ensure recoverability local transactions always committed concurrently even precedence relation exists unlike co overall transactions local partial order determined local conflict graph possible temporary local cycles since cycles eliminated local serializability mechanism allows also global transactions voted committed concurrently transitively indirect preceding via conflict global transactions committed transitively preceding local transactions state analogy distributed co algorithm stronger concurrent voting condition transitively preceding transactions need committed condition guaranteeing global eco summarized similarly co global eco global cycles global conflict graph eliminated atomic commitment together local serializability i.e. database system maintains serializability locally local cycles eliminated imply global serializability cycles eliminated means database system multidatabase environment provides local serializability mechanism enforces vote ordering strategy theorem generalization co vote ordering strategy global serializability guaranteed local co needed anymore similarly co well eco voting-deadlock situation summarized follows co means also global deadlocks due data-access locking least one lock blocking voting deadlocks automatically resolved atomic commitment multi-version commitment ordering mvco raz 1993b generalization co databases multi-version resources resources read-only transactions block blocked better performance utilizing resources common way nowadays increase concurrency performance generating new version database object time object written allowing transactions read operations several last relevant versions object mvco implies one-copy-serializability 1ser 1sr generalization serializability multi-version resources like co mvco non-blocking combined relevant multi-version concurrency control mechanism without interfering introduced underlying theory mvco conflicts generalized different versions resource differently earlier multi-version theories different versions conflict chronological order replaced version order possibly reversed keeping usual definitions conflicting operations results regular augmented conflict graphs remain unchanged similarly co distributed mvco enforcing algorithm exists mixed environment single-version multi-version resources single-version special case multi-version co mvco algorithm needs unmodified atomic commitment protocol messages additional communication overhead locking-based global deadlocks translate voting deadlocks resolved automatically analogy co following holds mvco generalized employ generalization eco mveco co based snapshot isolation cosi intersection snapshot isolation si mvco si multiversion concurrency control method widely utilized due good performance similarity serializability 1ser several aspects theory raz 1993b mvco described utilized later fekete et al 2005 articles si e.g. cahill et al 2008 see also making snapshot isolation serializable references analyzing conflicts si order make serializable method presented cahill et al 2008 serializable snapshot isolation serializablesi low overhead modification si provides good performance results versus si small penalty enforcing serializability different method combining si mvco cosi makes si serializable well relatively low overhead similarly combining generic co algorithm single-version mechanisms furthermore resulting combination cosi mvco compliant allows cosi compliant database systems inter-operate transparently participate co solution distributed/global serializability see besides overheads also protocols behaviors need compared quantitatively one hand serializable si schedules made mvco cosi possible commit delays needed without aborting transactions hand serializablesi known unnecessarily abort restart certain percentages transactions also serializable si schedules co variants e.g. ss2pl sco oco eco mvco global serializability achieved via atomic commitment protocol based distributed algorithms co variants atomic commitment protocol instrument eliminate global cycles cycles span two databases global augmented thus also regular conflict graph implicitly global data structure implementation needed cases either incompatible local commitment orders two databases global partial order embed respective local partial orders together data-access locking related voting deadlock implying global cycle global augmented conflict graph missing votes atomic commitment protocol breaks cycle aborting undecided transaction see distributed co algorithm differences various variants exist local level within participating database systems local co instance variant role determine position every global transaction transaction spans two databases within local commitment order i.e. determine transaction turn voted locally atomic commitment protocol thus co variants exhibit behavior regard atomic commitment means interoperable via atomic commitment using software interfaces typically provided services already standardized atomic commitment primarily two phase commit protocol e.g. x/open xa transparently utilized together distributed environment co variant instance possibly associated relevant local concurrency control mechanism type summary single global transaction participate simultaneously databases may employ possibly different co variant concurrently running processes database running concurrently local global transactions database atomic commitment protocol indifferent co distinguish various co variants global cycle generated augmented global conflict graph may span databases different co variants generate broken local abort voting deadlock resolved atomic commitment exactly way single co variant environment local cycles possibly mixed materialized non-materialized conflicts serializability data-access-locking deadlock related e.g. sco resolved locally respective variant instance local mechanisms vote ordering vo generalized co gco raz 2009 union co variants useful concept global serializability technique comply vo local serializability general form commutativity based including multi-versioning vote order strategy voting local precedence order needed combining results co variants following concluded | [
9224,
3725,
8979,
7446,
5658,
7581,
10675,
1083,
9663,
5441,
5956,
3398,
4817,
2901,
10201,
4194,
1636,
11620,
1382,
9069,
11377,
7802,
3326
] | Test |
7,582 | 1 | Domain_relational_calculus:domain relational calculus computer science domain relational calculus drc calculus introduced michel lacroix alain pirotte declarative database query language relational data model drc queries form x either domain variable constant formula_2 denotes drc formula result query set tuples x x make drc formula true language uses operators tuple calculus logical connectives ∧ ∨ ¬ existential quantifier ∃ universal quantifier ∀ used bind variables computational expressiveness equivalent relational algebra let b c mean rank name id enterprise relation let e f mean name deptname id department relation find captains starship uss enterprise formula_3 example b c denotes result set set table enterprise find names enterprise crew members stellar cartography formula_4 example 're looking name b condition f c requirement need find enterprise crew members stellar cartography department alternate representation previous example would formula_5 example value requested f domain directly placed formula c domain variable re-used query existence department since already holds crew member id | [
4065,
4066,
4263,
9397,
987
] | Train |
7,583 | 4 | Reboot_Restore_Rx:reboot restore rx reboot restore rx horizon data sys freeware application microsoft windows acts alternative windows steadystate allows users restore computer back established baseline helps prevent long term damage computer operating system os upon installation administrator reboot restore rx establish baseline baseline point computer return upon reboot administrator allowed update baseline done tray icon program program operates outside windows master boot record mbr protects mbr also allows user boot windows even windows otherwise unbootable whether software change blue screen death alternative windows steadystate reboot restore rx works maintain computer constant state alternatives including faronic deep freeze toolwiz time machine reboot restore rx pro formerly drive vaccine rollback rx latter two developed developer reboot restore rx horizon data sys reboot restore rx received generally favourable reviews received many awards review techrepublic said looking make -accessible pc junk proof consistently reliable reboot restore rx definitely nice product consider preserving peace freeware release might nearly customizable microsoft steadystate time least system thank allowing condition deteriorate rapidly abuse review product lifehacker wrote nothing worse rebooting computer thinking everything fine find something busted need troubleshoot especially bad start problems driver update series windows updates 're stuck trying figure thing caused problem first place reboot restore rx takes hassle app even restore windows wo n't boot reboot restore rx award best new product 31st annual tech learning awards | [
700,
925,
6797,
7983
] | Test |
7,584 | 2 | Greg_Kroah-Hartman:greg kroah-hartman greg kroah-hartman gkh major linux kernel developer linux kernel maintainer codice_1 branch staging subsystem usb driver core debugfs kref kobject sysfs kernel subsystems userspace i/o hans j. koch tty layer also created linux-hotplug udev project linux driver project worked novell suse labs division works linux foundation co-author linux device drivers 3rd edition author linux kernel nutshell used contributing editor linux journal also contributes articles lwn.net computing news site kroah-hartman frequently helps documentation kernel driver development talks tutorials 2006 released cd image material introduce programmer working linux device driver development kroah-hartman strong advocate stable kernel–user space api i.e advocate stable kernel interface/binary kernel interface general user space programs also initiated development opensuse tumbleweed bleeding-edge rolling release model edition opensuse | [
1026,
3082,
5644,
5139,
2581,
10780,
10785,
6691,
6180,
6694,
8242,
9266,
2109,
6213,
10822,
8263,
8268,
589,
4177,
8787,
5222,
10856,
7793,
3189,
4734,
7812,
4238,
10382,
8848,
657,
2195,
2711,
6808,
9882,
1694,
6302,
8354,
2723,
8364,
1... | Test |
7,585 | 0 | Pheme_(project):pheme project pheme 36-month research project establishing veracity claims made internet unverified content dominant prolific social media messages big data typically presents challenges information volume variety velocity social media presents fourth establishing veracity pheme project aims analyse content real time determine accurate claims made claims propagate social network individual chooses whether pass information based accurate think analysing language used spread information network well spatial temporal context information used build real-time lie detector social media help example emergency services already integrate social media part alerting response systems flag potential hoax emergencies evaluating authority sources automatically also project goal based treatment news information comes example tweet bbc news article would hold weight one unknown source project named greek goddess pheme pheme addresses social media lies two scenarios information healthcare particularly damaging wrong information used journalists pheme addresses speculation controversy misinformation disinformation project partnership university sheffield part gate university warwick king college london saarland university germany modul university vienna four companies also taking part atos ihub nairobi ontotext swissinfo pheme funded eu | [
7780
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.