node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
1,685 | 2 | IFilter:ifilter ifilter plugin allows microsoft search engines index various file formats documents email attachments database records audio metadata etc become searchable without appropriate ifilter contents file parsed indexed search engine obtained standalone packages bundled certain software adobe reader libreoffice microsoft office openoffice also refers software interface needed implement plugins ifilter acts plug-in extracting full-text metadata search engines search engine usually works two steps step 1 search engine n't understand format document therefore looks windows registry appropriate ifilter extract data document format filtering embedded formatting non-textual data windows indexing service newer windows search windows desktop search msn desktop search internet information server sharepoint portal server windows sharepoint services wss site server exchange server sql server products based microsoft search technology support indexing technology also ifilters used sql server component sql server full text search service | [
7879,
3937,
3263,
378,
2198,
6096,
1475,
7553,
7195,
5410,
7564,
2953,
422,
6844,
1499,
2245,
435,
5442,
4377,
5090,
3340,
7602,
6164,
458,
4759,
1534,
6885,
7619,
2999,
5475,
6528,
2290,
4774,
1181,
3711,
5134,
7272,
1571,
5850,
140,
6... | Validation |
1,686 | 8 | AOLserver:aolserver aolserver aol open source web server aolserver multithreaded tcl-enabled used large scale dynamic web sites aolserver distributed mozilla public license aolserver originally developed navisoft name naviserver changed names aol bought company 1995 philip greenspun convinced america online open-source program 1999 aolserver first http server program combine multithreading built-in scripting language pooling persistent database connections database-backed web sites enabled performance improvements 100× compared standard practices time cgi scripts opened fresh database connections every page load eventually http server programs able achieve similar performance similar architecture aolserver key component open architecture community system openacs advanced open-source toolkit developing web applications sept 2007 port aolserver iphone made available later forked name joggame server fork described sourceforge project page spin-off aolserver devices naviserver also hosted sourceforge fork aolserver | [
6788,
3168,
5369,
1349,
5206,
5820,
5214,
2646,
6270,
1834,
2291,
8182,
6536,
26,
5571,
7544,
7988,
486,
4701,
1392,
7786,
417,
3135,
2506,
3408,
3915,
1236,
1602,
6061,
7411,
7952,
1435,
2807
] | Test |
1,687 | 4 | Melissa_Hathaway:melissa hathaway melissa hathaway born november 10 1968 leading expert cyberspace policy cybersecurity served two u.s. presidential administrations 2007 2009 including 8 months white house spearheading cyberspace policy review president barack obama leading comprehensive national cybersecurity initiative cnci president george w. bush president hathaway global strategies llc senior fellow member board regents potomac institute policy studies distinguished fellow centre international governance innovation canada non-resident research fellow kosciuszko institute poland previously senior adviser harvard kennedy school ’ belfer center hathaway received b.a american university graduated us armed forces staff college special certificate information operations hathaway employed consulting firm evidence based research work included developing models detection cocaine movement united states june 1993 february 2007 hathaway worked consulting firm booz allen hamilton focusing information operations long-range strategy policy support business units work included evaluations new force options across electromagnetic spectrum design development novel techniques mapping social business process infrastructure relationships hathaway served senior advisor director national intelligence mike mcconnell cyber coordination executive chaired national cyber study group ncsg role ncsg contributed development comprehensive national cybersecurity initiative cnci hathaway appointed director joint interagency cyber task force january 2008 hathaway named acting senior director cyberspace national security homeland security councils february 9 2009 placed charge 60-day inter-agency review plan programs activities underway throughout government dedicated cyber security january 2009 request assistant president national security affairs ms. hathaway asked lead 60-day cyberspace policy review president obama assembled team experienced government cyber experts identified 250 recommendations may 2009 president obama presented blueprint cyberspace policy review announced cybersecurity would one administration priorities recognized ms. hathaway leadership noted president said “ opportunities everyone—academia industry governments—to work together build trusted resilient communications information infrastructure. ” august 3 2009 announced hathaway would return private sector resignation taking effect august 21 2009 departing cited frustration yet selected new position cyber coordinator n't willing continue wait longer 'm empowered right continue drive change october 1 2009 till project conclusion 2015 hathaway served senior adviser project minerva harvard kennedy school also one lead instructors executive program cybersecurity intersection policy technology hathaway president hathaway global strategies consulting firm also serves advisor companies including cisco one thirty commissioners global commission internet governance | [
4210,
4783
] | Test |
1,688 | 6 | Ultracopier:ultracopier ultracopier file-copying software windows macos linux supersedes supercopier main features include normal vs ultimate version difference supercopier ultracopier skin supercopier skin ultracopier css use little bit cpu talk supercopier implies refer v3 less talk ultracopier implies refer supercopier v4 later rename ultracopier v1.4 | [
1812,
5571,
7046,
578,
5354
] | Test |
1,689 | 6 | Transaction-Safe_FAT_File_System:transaction-safe fat file system transaction-safe fat file system tfat transaction-safe extended fat file system texfat refer two file systems used microsoft products provide transaction-safety data stored disk goal reduce risk data loss cases power loss unexpected removal drive latter problem become common spread usb drives transaction-safe fat file system tfat tfat12 tfat16 tfat32 file systems driver layer modification original fat file systems fat12 fat16 fat32 maintaining two copies fat 0 fat 1 file allocation table instead two identical ones performing drive operation changes would made fat 1 operation complete fat 1 table would copied fat 0 updating stable view file system transaction-safe extended fat file system texfat texfat provides similar functionality tfat using exfat file system base file system instead fat introduced windows embedded ce 6.0 sometimes referred tfat well lead confusion original tfat described use exfat underlying file system allows larger files larger partitions texfat requires hardware-specific driver designed type media texfat volume resides due lack support desktop operating systems neither tfat texfat recommended removable media desktop os could still read drive could use transaction-safe features unexpected removal power outage could lead data loss addition directories created desktop os may transaction-safe even drive later attached tfat/texfat aware operating system | [
3599,
2547,
7161,
4672,
3626,
6117,
6854,
5437,
4375,
6500,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
174,
2710,
1624,
5900,
4480,
4855,
7718,
200,
12... | Test |
1,690 | 4 | Smurf_Amplifier_Registry:smurf amplifier registry smurf amplifier registry blacklist networks internet misconfigured way used smurf amplifiers smurf denial service attacks probe networks vulnerability smurf amplification either add database remove database depending result test | [
3175
] | Test |
1,691 | 4 | Denial-of-service_attack:denial-of-service attack computing denial-of-service attack dos attack cyber-attack perpetrator seeks make machine network resource unavailable intended users temporarily indefinitely disrupting services host connected internet denial service typically accomplished flooding targeted machine resource superfluous requests attempt overload systems prevent legitimate requests fulfilled distributed denial-of-service attack ddos attack incoming traffic flooding victim originates many different sources effectively makes impossible stop attack simply blocking single source dos ddos attack analogous group people crowding entry door shop making hard legitimate customers enter thus disrupting trade criminal perpetrators dos attacks often target sites services hosted high-profile web servers banks credit card payment gateways revenge blackmail activism motivate attacks court testimony shows first demonstration dos attack made khan c. smith 1997 def con event disrupting internet access las vegas strip hour release sample code event led online attack sprint earthlink e-trade major corporations year follow march 5 2018 unnamed customer us-based service provider arbor networks fell victim largest ddos history reaching peak 1.7 terabits per second previous record set days earlier march 1 2018 github hit attack 1.35 terabits per second hong kong anti-extradition protests june 2019 messaging app telegram subject ddos attack aimed preventing protesters using coordinate movements founders telegram stated attack appears state sized actor via ip addresses originating china denial-of-service attacks characterized explicit attempt attackers prevent legitimate use service two general forms dos attacks crash services flood services serious attacks distributed distributed denial-of-service ddos large-scale dos attack perpetrator uses one unique ip address often thousands hosts infected malware distributed denial service attack typically involves around 3–5 nodes different networks fewer nodes may qualify dos attack ddos attack since incoming traffic flooding victim originates different sources may impossible stop attack simply using ingress filtering also makes difficult distinguish legitimate user traffic attack traffic spread across multiple points origin alternative augmentation ddos attacks may involve forging ip sender addresses ip address spoofing complicating identifying defeating attack scale ddos attacks continued rise recent years 2016 exceeding terabit per second common examples ddos attacks fraggle smurf syn flooding application layer ddos attack sometimes referred layer 7 ddos attack form ddos attack attackers target application-layer processes attack over-exercises specific functions features website intention disable functions features application-layer attack different entire network attack often used financial institutions distract security personnel security breaches 2013 application-layer ddos attacks represented 20 ddos attacks according research akamai technologies 51 percent application layer attacks q4 2013 q4 2014 16 percent q3 2014 q4 2014 november 2017 junade ali computer scientist cloudflare noted whilst network-level attacks continue high capacity occurring less frequently ali notes although network-level attacks becoming less frequent data cloudflare demonstrates application-layer attacks still showing sign slowing osi model iso/iec 7498-1 conceptual model characterizes standardizes internal functions communication system partitioning abstraction layers model product open systems interconnection project international organization standardization iso model groups similar communication functions one seven logical layers layer serves layer served layer example layer provides error-free communications across network provides communications path needed applications calls next lower layer send receive packets traverse path osi model definition application layer narrower scope often implemented osi model defines application layer user interface osi application layer responsible displaying data images user human-recognizable format interface presentation layer implementation application presentation layers frequently combined application layer ddos attack done mainly specific targeted purposes including disrupting transactions access databases requires fewer resources network layer attacks often accompanies attack may disguised look like legitimate traffic except targets specific application packets functions attack application layer disrupt services retrieval information search functions website advanced persistent dos apdos associated advanced persistent threat requires specialised ddos mitigation attacks persist weeks longest continuous period noted far lasted 38 days attack involved approximately 50+ petabits 50,000+ terabits malicious traffic attackers scenario may tactically switch several targets create diversion evade defensive ddos countermeasures eventually concentrating main thrust attack onto single victim scenario attackers continuous access several powerful network resources capable sustaining prolonged campaign generating enormous levels un-amplified ddos traffic apdos attacks characterised vendors provide so-called booter stresser services simple web-based front ends accept payment web marketed promoted stress-testing tools used perform unauthorized denial-of-service attacks allow technically unsophisticated attackers access sophisticated attack tools without need attacker understand use usually powered botnet traffic produced consumer stresser range anywhere 5-50 gbit/s cases deny average home user internet access united states computer emergency readiness team us-cert identified symptoms denial-of-service attack include additional symptoms may include attack conducted sufficiently large scale entire geographical regions internet connectivity compromised without attacker knowledge intent incorrectly configured flimsy network infrastructure equipment wide array programs used launch dos-attacks cases mydoom slowloris tools embedded malware launch attacks without knowledge system owner stacheldraht classic example ddos tool uses layered structure attacker uses client program connect handlers compromised systems issue commands zombie agents turn facilitate ddos attack agents compromised via handlers attacker using automated routines exploit vulnerabilities programs accept remote connections running targeted remote hosts handler control thousand agents cases machine may become part ddos attack owner consent example operation payback organized group anonymous loic typically used way along hoic wide variety ddos tools available today including paid free versions different features available underground market hacker related forums irc channels various dos-causing exploits buffer overflow cause server-running software get confused fill disk space consume available memory cpu time kinds dos rely primarily brute force flooding target overwhelming flux packets oversaturating connection bandwidth depleting target system resources bandwidth-saturating floods rely attacker higher bandwidth available victim common way achieving today via distributed denial-of-service employing botnet another target ddos attacks may produce added costs application operator latter uses resources based cloud computing case normally application used resources tied needed quality service level e.g responses less 200 ms rule usually linked automated software e.g amazon cloudwatch raise virtual resources provider order meet defined qos levels increased requests.the main incentive behind attacks may drive application owner raise elasticity levels order handle increased application traffic order cause financial losses force become less competitive floods may use specific packet types connection requests saturate finite resources example occupying maximum number open connections filling victim disk space logs banana attack another particular type dos involves redirecting outgoing messages client back onto client preventing outside access well flooding client sent packets land attack type attacker shell-level access victim computer may slow unusable crash using fork bomb kind application-level dos attack xdos xml dos controlled modern web application firewalls wafs pulsing zombies compromised computers directed launch intermittent short-lived floodings victim websites intent merely slowing rather crashing type attack referred degradation-of-service rather denial-of-service difficult detect regular zombie invasions disrupt hamper connection websites prolonged periods time potentially causing disruption concentrated floods exposure degradation-of-service attacks complicated matter discerning whether server really attacked normal traffic loads goal dos l2 possibly ddos attack cause launching defense mechanism blocks network segment attack originated case distributed attack ip header modification depends kind security behavior fully block attacked network internet without system crash distributed denial-of-service ddos attack occurs multiple systems flood bandwidth resources targeted system usually one web servers attack often result multiple compromised systems example botnet flooding targeted system traffic botnet network zombie computers programmed receive commands without owners knowledge server overloaded connections new connections longer accepted major advantages attacker using distributed denial-of-service attack multiple machines generate attack traffic one machine multiple attack machines harder turn one attack machine behavior attack machine stealthier making harder track shut attacker advantages cause challenges defense mechanisms example merely purchasing incoming bandwidth current volume attack might help attacker might able simply add attack machines end completely crashing website periods time malware carry ddos attack mechanisms one better-known examples mydoom dos mechanism triggered specific date time type ddos involved hardcoding target ip address prior release malware interaction necessary launch attack system may also compromised trojan allowing attacker download zombie agent trojan may contain one attackers also break systems using automated tools exploit flaws programs listen connections remote hosts scenario primarily concerns systems acting servers web stacheldraht classic example ddos tool uses layered structure attacker uses client program connect handlers compromised systems issue commands zombie agents turn facilitate ddos attack agents compromised via handlers attacker using automated routines exploit vulnerabilities programs accept remote connections running targeted remote hosts handler control thousand agents cases machine may become part ddos attack owner consent example operation payback organized group anonymous attacks use different types internet packets tcp udp icmp etc collections systems compromisers known botnets rootservers ddos tools like stacheldraht still use classic dos attack methods centered ip spoofing amplification like smurf attacks fraggle attacks also known bandwidth consumption attacks syn floods also known resource starvation attacks may also used newer tools use dns servers dos purposes unlike mydoom ddos mechanism botnets turned ip address script kiddies use deny availability well known websites legitimate users sophisticated attackers use ddos tools purposes extortioneven business rivals simple attacks syn floods may appear wide range source ip addresses giving appearance well distributed dos flood attacks require completion tcp three way handshake attempt exhaust destination syn queue server bandwidth source ip addresses trivially spoofed attack could come limited set sources may even originate single host stack enhancements syn cookies may effective mitigation syn queue flooding however complete bandwidth exhaustion may require involvement attacker mounts attack single host would classified dos attack fact attack availability would classed denial-of-service attack hand attacker uses many systems simultaneously launch attacks remote host would classified ddos attack reported new attacks internet things iot devices involved denial service attacks one noted attack made peaked around 20,000 requests per second came around 900 cctv cameras uk gchq tools built ddos named predators face rolling thunder 2015 ddos botnets dd4bc grew prominence taking aim financial institutions cyber-extortionists typically begin low-level attack warning larger attack carried ransom paid bitcoin security experts recommend targeted websites pay ransom attackers tend get extended extortion scheme recognize target ready pay first discovered 2009 http post attack sends complete legitimate http post header includes 'content-length field specify size message body follow however attacker proceeds send actual message body extremely slow rate e.g 1 byte/110 seconds due entire message correct complete target server attempt obey 'content-length field header wait entire body message transmitted take long time attacker establishes hundreds even thousands connections resources incoming connections server victim used hence making including legitimate connections impossible data sent notable unlike many dos attacks try subdue server overloading network cpu http post attack targets logical resources victim means victim would still enough network bandwidth processing power operate combined fact apache default accept requests 2gb size attack particularly powerful http post attacks difficult differentiate legitimate connections therefore able bypass protection systems owasp open source web application security project released testing tool test security servers type attacks challenge collapsar cc attack attack standard http requests sent targeted web server frequently uniform resource identifiers uris require complicated time-consuming algorithms database operations order exhaust resources targeted web server 2004 chinese hacker nicknamed kiki invented hacking tool send kinds requests attack nsfocus firewall named collapsar thus hacking tool known challenge collapsar cc short consequently type attack got name cc attack smurf attack relies misconfigured network devices allow packets sent computer hosts particular network via broadcast address network rather specific machine attacker send large numbers ip packets source address faked appear address victim devices network default respond sending reply source ip address number machines network receive respond packets large victim computer flooded traffic overloads victim computer even make unusable attack ping flood based sending victim overwhelming number ping packets usually using ping command unix-like hosts -t flag windows systems much less capable overwhelming target also -l size flag allow sent packet size greater 65500 windows simple launch primary requirement access greater bandwidth victim ping death based sending victim malformed ping packet lead system crash vulnerable system blacknurse attack example attack taking advantage required destination port unreachable icmp packets nuke old denial-of-service attack computer networks consisting fragmented otherwise invalid icmp packets sent target achieved using modified ping utility repeatedly send corrupt data thus slowing affected computer comes complete stop specific example nuke attack gained prominence winnuke exploited vulnerability netbios handler windows 95 string out-of-band data sent tcp port 139 victim machine causing lock display blue screen death bsod attackers found way exploit number bugs peer-to-peer servers initiate ddos attacks aggressive peer-to-peer-ddos attacks exploits dc++ peer-to-peer botnet attacker communicate clients subverts instead attacker acts puppet master instructing clients large peer-to-peer file sharing hubs disconnect peer-to-peer network connect victim website instead permanent denial-of-service pdos also known loosely phlashing attack damages system badly requires replacement reinstallation hardware unlike distributed denial-of-service attack pdos attack exploits security flaws allow remote administration management interfaces victim hardware routers printers networking hardware attacker uses vulnerabilities replace device firmware modified corrupt defective firmware image—a process done legitimately known flashing therefore bricks device rendering unusable original purpose repaired replaced pdos pure hardware targeted attack much faster requires fewer resources using botnet root/vserver ddos attack features potential high probability security exploits network enabled embedded devices needs technique come attention numerous hacking communities brickerbot piece malware targeted iot devices used pdos attacks disable targets phlashdance tool created rich smith employee hewlett-packard systems security lab used detect demonstrate pdos vulnerabilities 2008 eusecwest applied security conference london distributed denial-of-service attack may involve sending forged requests type large number computers reply requests using internet protocol address spoofing source address set targeted victim means replies go flood target reflected attack form sometimes called drdos icmp echo request attacks smurf attack considered one form reflected attack flooding host send echo requests broadcast addresses mis-configured networks thereby enticing hosts send echo reply packets victim early ddos programs implemented distributed form attack amplification attacks used magnify bandwidth sent victim typically done publicly accessible dns servers used cause congestion target system using dns response traffic many services exploited act reflectors harder block others us-cert observed different services implies different amplification factors tabulated dns amplification attacks involve new mechanism increased amplification effect using much larger list dns servers seen earlier process typically involves attacker sending dns name look request public dns server spoofing source ip address targeted victim attacker tries request much information possible thus amplifying dns response sent targeted victim since size request significantly smaller response attacker easily able increase amount traffic directed target snmp ntp also exploited reflector amplification attack example amplified ddos attack network time protocol ntp command called monlist sends details last 600 hosts requested time ntp server back requester small request time server sent using spoofed source ip address victim results response 556.9 times size request sent victim becomes amplified using botnets send requests spoofed ip source result massive amount data sent back victim difficult defend types attacks response data coming legitimate servers attack requests also sent udp require connection server means source ip verified request received server order bring awareness vulnerabilities campaigns started dedicated finding amplification vectors led people fixing resolvers resolvers shut completely attack works using worm infect hundreds thousands iot devices across internet worm propagates networks systems taking control poorly protected iot devices thermostats wi-fi enabled clocks washing machines device becomes enslaved usually owner user immediate indication iot device direct target attack used part larger attack newly enslaved devices called slaves bots hacker acquired desired number bots instruct bots try contact isp october 2016 mirai botnet attacked dyn isp sites twitter netflix etc soon occurred websites unreachable several hours type attack physically damaging certainly costly large internet companies get attacked rudy attack targets web applications starvation available sessions web server much like slowloris rudy keeps sessions halt using never-ending post transmissions sending arbitrarily large content-length header value manipuling maximum segment size selective acknowledgement sack may used remote peer cause denial service integer overflow linux kernel causing even kernel panic jonathan looney discovered cve-2019-11477 cve-2019-11478 cve-2019-11479 june 17 2019 shrew attack denial-of-service attack transmission control protocol uses short synchronized bursts traffic disrupt tcp connections link exploiting weakness tcp re-transmission timeout mechanism slow read attack sends legitimate application layer requests reads responses slowly thus trying exhaust server connection pool achieved advertising small number tcp receive window size time emptying clients tcp receive buffer slowly causes low data flow rate sophisticated low-bandwidth ddos attack form dos uses less traffic increases effectiveness aiming weak point victim system design i.e. attacker sends traffic consisting complicated requests system essentially sophisticated ddos attack lower cost due use less traffic smaller size making difficult identify ability hurt systems protected flow control mechanisms syn flood occurs host sends flood tcp/syn packets often forged sender address packets handled like connection request causing server spawn half-open connection sending back tcp/syn-ack packet acknowledge waiting packet response sender address response ack packet however sender address forged response never comes half-open connections saturate number available connections server make keeping responding legitimate requests attack ends teardrop attack involves sending mangled ip fragments overlapping oversized payloads target machine crash various operating systems bug tcp/ip fragmentation re-assembly code windows 3.1x windows 95 windows nt operating systems well versions linux prior versions 2.0.32 2.1.63 vulnerable attack although september 2009 vulnerability windows vista referred teardrop attack targeted smb2 higher layer tcp packets teardrop used one fields ip header “ fragment offset ” field indicating starting position offset data contained fragmented packet relative data original packet sum offset size one fragmented packet differs next fragmented packet packets overlap happens server vulnerable teardrop attacks unable reassemble packets resulting denial-of-service condition voice ip made abusive origination large numbers telephone voice calls inexpensive readily automated permitting call origins misrepresented caller id spoofing according us federal bureau investigation telephony denial-of-service tdos appeared part various fraudulent schemes telephony denial-of-service exist even without internet telephony 2002 new hampshire senate election phone jamming scandal telemarketers used flood political opponents spurious calls jam phone banks election day widespread publication number also flood enough calls render unusable happened accident 1981 multiple +1-area code-867-5309 subscribers inundated hundreds misdialed calls daily response song 867-5309/jenny tdos differs telephone harassment prank calls obscene phone calls number calls originated occupying lines continuously repeated automated calls victim prevented making receiving routine emergency telephone calls related exploits include sms flooding attacks black fax fax loop transmission takes router resources drop packet ttl value 1 less forward packet higher ttl value packet dropped due ttl expiry router cpu must generate send icmp time exceeded response generating many responses overload router cpu attack uses existing vulnerability universal plug play upnp protocol get around considerable amount present defense methods flood target network servers attack based dns amplification technique attack mechanism upnp router forwards requests one outer source another disregarding upnp behavior rules using upnp router returns data unexpected udp port bogus ip address making harder take simple action shut traffic flood according imperva researchers effective way stop attack companies lock upnp routers defensive responses denial-of-service attacks typically involve use combination attack detection traffic classification response tools aiming block traffic identify illegitimate allow traffic identify legitimate list prevention response tools provided application front-end hardware intelligent hardware placed network traffic reaches servers used networks conjunction routers switches application front end hardware analyzes data packets enter system identifies priority regular dangerous 25 bandwidth management vendors approaches ddos attacks cloud-based applications may based application layer analysis indicating whether incoming bulk traffic legitimate thus triggering elasticity decisions without economical implications ddos attack approaches mainly rely identified path value inside application monitor progress requests path markers called key completion indicators essence technique statistical methods assessing behavior incoming requests detect something unusual abnormal going analogy bricks-and-mortar department store customers spend average known percentage time different activities picking items examining putting back filling basket waiting pay paying leaving high-level activities correspond key completion indicators service site normal behavior determined abnormal behavior identified mob customers arrived store spent time picking items putting back never made purchases could flagged unusual behavior department store attempt adjust periods high activity bringing reserve employees short notice routinely mob start showing never buying anything could ruin store extra employee costs soon store would identify mob activity scale back number employees recognising mob provides profit served may make difficult legitimate customers get served mob presence saves store total ruin case elastic cloud services huge abnormal additional workload may incur significant charges cloud service provider technique used scale back even stop expansion server availability protect economic loss blackhole routing traffic attacked dns ip address sent black hole null interface non-existent server efficient avoid affecting network connectivity managed isp dns sinkhole routes traffic valid ip address analyzes traffic rejects bad packets sinkholing efficient severe attacks intrusion prevention systems ips effective attacks signatures associated however trend among attacks legitimate content bad intent intrusion-prevention systems work content recognition block behavior-based dos attacks asic based ips may detect block denial-of-service attacks processing power granularity analyze attacks act like circuit breaker automated way rate-based ips rbips must analyze traffic granularly continuously monitor traffic pattern determine traffic anomaly must let legitimate traffic flow blocking dos attack traffic focused problem ips dos defense system dds block connection-based dos attacks legitimate content bad intent dds also address protocol attacks teardrop ping death rate-based attacks icmp floods syn floods case simple attack firewall could simple rule added deny incoming traffic attackers based protocols ports originating ip addresses complex attacks however hard block simple rules example ongoing attack port 80 web service possible drop incoming traffic port prevent server serving legitimate traffic additionally firewalls may deep network hierarchy routers adversely affected traffic gets firewall also many security tools still support ipv6 may configured properly firewalls often might get bypassed attacks similar switches routers rate-limiting acl capability manually set routers easily overwhelmed dos attack cisco ios optional features reduce impact flooding switches rate-limiting acl capability switches provide automatic and/or system-wide rate limiting traffic shaping delayed binding tcp splicing deep packet inspection bogon filtering bogus ip filtering detect remediate dos attacks automatic rate filtering wan link failover balancing schemes work long dos attacks prevented using example syn flood prevented using delayed binding tcp splicing similarly content based dos may prevented using deep packet inspection attacks originating dark addresses going dark addresses prevented using bogon filtering automatic rate filtering work long set rate-thresholds set correctly wan-link failover work long links dos/ddos prevention mechanism traffic passed cleaning center scrubbing center via various methods proxies tunnels digital cross connects even direct circuits separates bad traffic ddos also common internet attacks sends good traffic beyond server provider needs central connectivity internet manage kind service unless happen located within facility cleaning center scrubbing center ddos attacks overwhelm type hardware firewall passing malicious traffic large mature networks becomes effective economically sustainable ddos unintentional denial-of-service occur system ends denied due deliberate attack single individual group individuals simply due sudden enormous spike popularity happen extremely popular website posts prominent link second less well-prepared site example part news story result significant proportion primary site regular userspotentially hundreds thousands peopleclick link space hours effect target website ddos attack vipdos specifically link posted celebrity michael jackson died 2009 websites google twitter slowed even crashed many sites servers thought requests virus spyware trying cause denial-of-service attack warning users queries looked like automated requests computer virus spyware application news sites link sitessites whose primary function provide links interesting content elsewhere internetare likely cause phenomenon canonical example slashdot effect receiving traffic slashdot also known reddit hug death digg effect routers also known create unintentional dos attacks d-link netgear routers overloaded ntp servers flooding ntp servers without respecting restrictions client types geographical limitations similar unintentional denials-of-service also occur via media e.g url mentioned television server indexed google another search engine peak periods activity lot available bandwidth indexed also experience effects dos attack legal action taken least one case 2006 universal tube rollform equipment corporation sued youtube massive numbers would-be youtube.com users accidentally typed tube company url utube.com result tube company ended spend large amounts money upgrading bandwidth company appears taken advantage situation utube.com containing ads advertisement revenue march 2014 malaysia airlines flight 370 went missing digitalglobe launched crowdsourcing service users could help search missing jet satellite images response overwhelmed company servers unintentional denial-of-service may also result prescheduled event created website case census australia 2016 could caused server provides service specific time might university website setting grades available result many login requests time computer network security backscatter side-effect spoofed denial-of-service attack kind attack attacker spoofs forges source address ip packets sent victim general victim machine distinguish spoofed packets legitimate packets victim responds spoofed packets normally would response packets known backscatter attacker spoofing source addresses randomly backscatter response packets victim sent back random destinations effect used network telescopes indirect evidence attacks term backscatter analysis refers observing backscatter packets arriving statistically significant portion ip address space determine characteristics dos attacks victims many jurisdictions laws denial-of-service attacks illegal january 7 2013 anonymous posted petition whitehouse.gov site asking ddos recognized legal form protest similar occupy protests claim similarity purpose | [
1068,
4665,
5733,
2923,
4318,
5746,
7549,
3637,
3638,
5401,
744,
3302,
6459,
6823,
5760,
4716,
1124,
7209,
2961,
429,
1886,
7217,
6492,
5439,
4009,
6150,
1515,
6503,
3680,
4021,
6868,
4025,
2626,
2632,
4759,
1533,
5814,
6526,
819,
5828,
... | Test |
1,692 | 9 | Vensim:vensim vensim simulation software developed ventana systems primarily supports continuous simulation system dynamics discrete event agent-based modelling capabilities available commercially free personal learning edition vensim provides graphical modeling interface stock flow causal loop diagrams top text-based system equations declarative programming language includes patented method interactive tracing behavior causal links model structure well language extension automating quality control experiments models called reality check modeling language supports arrays subscripts permits mapping among dimensions aggregation built-in allocation functions satisfy constraints sometimes met conventional approaches like logit supports discrete delays queues variety stochastic processes multiple paths cross sectional time-series data import export including text files spreadsheets odbc models may calibrated data using optimization kalman filtering markov chain monte carlo methods sensitivity analysis options provide variety ways test sample models including monte carlo simulation latin hypercube sampling vensim model files packaged published customizable read-only format executed freely available model reader allows sharing interactive models users program and/or model author wish access model code base vensim general-purpose software used wide variety problem domains common high-profile applications include | [
3378,
5571
] | Test |
1,693 | 8 | Service_Mapping_Description:service mapping description service mapping description smd proposed standard describing machine-readable json format web services available particular endpoint goal similar principle wsdl | [
84
] | Test |
1,694 | 2 | Operating_system_abstraction_layer:operating system abstraction layer operating system abstraction layer osal provides application programming interface api abstract operating system making easier quicker develop code multiple software hardware platforms os abstraction layers deal presenting abstraction common system functionality offered operating system means providing meaningful easy use wrapper functions turn encapsulate system functions offered os code needs porting well designed osal provides implementations api several real-time operating systems vxworks ecos rtlinux rtems implementations may also provided non real-time operating systems allowing abstracted software developed tested developer friendly desktop environment addition os apis os abstraction layer project may also provide hardware abstraction layer designed provide portable interface hardware devices memory i/o ports non-volatile memory facilitate use apis osals generally include directory structure build automation e.g. set makefiles facilitate building project particular os hardware platform implementing projects using osals allows development portable embedded system software independent particular real-time operating system also allows embedded system software developed tested desktop workstations providing shorter development debug time | [
5571
] | Test |
1,695 | 1 | DBeaver:dbeaver dbeaver sql client database administration tool relational databases uses jdbc api interact databases via jdbc driver databases nosql uses proprietary database drivers provides editor supports code completion syntax highlighting provides plugin architecture based eclipse plugins architecture allows users modify much application behavior provide database-specific functionality features database-independent desktop application written java based eclipse platform community edition ce dbeaver free open source software distributed apache license closed-source enterprise edition dbeaver distributed commercial license dbeaver started 2010 hobby project supposed free open-source good-looking convenient ui include frequently used features database developers first official release 2011 freecode quickly became popular tool open-source community year official web site founded community support forum moved github created 2012 eclipse plugin version released since dbeaver become one popular database extensions eclipse top 50-60 among eclipse extensions shortly various software vendors started integrate dbeaver mostly extensions proprietary eclipse rcp products zend studio nxtware deltadna etc. 2014 enterprise edition ee version released ee version based ce also provides support nosql/bigdata databases cassandra mongodb redis includes additional eclipse plugins 2015 dbeaver source code/community moved github 2017 dbeaver ce relicensed apache license starting version 4.x july 2017 dbeaver ee version became commercial order support ce version dbeaver cross-platform tool works platforms supported eclipse windows linux macos x solaris dbeaver available english chinese russian italian german full list released versions community edition ce initial version dbeaver released 2010 became open-source gpl 2011 ce version includes extended support following databases besides relational databases ce version supports wmi driver windows management instrumentation – works windows version year response multiple user requests eclipse plugin version released eclipse marketplace version used programmers use eclipse ide software development need database management tool right ide eclipse plugin includes features community edition also released gpl license dbeaver 3.x announced support nosql databases cassandra mongodb initial version since dbeaver divided community enterprise editions enterprise edition support nosql databases persistent query manager enterprise-level features ee version open-source requires purchase license trial license generated free charge list additional features dbeaver features include differences features available across different databases | [
7957,
5717,
6879,
7715,
5728,
1359,
1737,
3863,
1096,
5126,
6538,
5571,
6279,
3542,
578,
4708,
4798,
7999,
6462,
4167,
3652,
2956,
6755,
6386,
5956,
7213,
4363,
955,
5780,
6056,
3915,
2259,
7598
] | Validation |
1,696 | 0 | Lexical_database:lexical database lexical database lexical resource associated software environment database permits access contents database may custom-designed lexical information general-purpose database lexical information entered information typically stored lexical database includes lexical category synonyms words well semantic phonological relations different words sets words | [
2695,
5508,
2054
] | Test |
1,697 | 2 | Envsys:envsys envsys framework kernel-level hardware monitoring sensors framework netbsd framework used close 85 device drivers export various environmental monitoring sensors evidenced references codice_1 symbol within codice_2 path netbsd temperature sensors codice_3 likely type exported given driver sensors registered kernel codice_4 api consumption monitoring sensors userland performed help codice_5 utility codice_6 codice_7 codice_8 pseudo-device file codice_9 power management daemon responds kernel events running scripts codice_10 well third-party tools like codice_11 gkrellm pkgsrc framework allows user amend monitoring limits specified driver driver perform monitoring sensors kernel space even programme hardware chip monitoring system automatically two levels limits defined critical warning additionally extend categorisation limit thresholds crossed kernel event may generated caught userland codice_9 execute pre-defined user script comparison openbsd hw.sensors monitoring user-defined values performed userspace codice_13 framework facilitate computer fan control although drivers could still implement interfacing fan-controlling capabilities chips means example driver-specific sysctl interface approach taken codice_14 driver however drivers popular super i/o chips like codice_15 codice_16 implement fan control fact historically openbsd netbsd dragonfly drivers n't even report duty cycle fans — actual rpm values reported framework undergone two major revisions first version codice_17 committed codice_18 man page following 2000 2007 manual page envsys 4 netbsd stated api experimental entire api replaced sysctl 8 one developed noted 2003 exact approach taken openbsd sysctl hw.sensors envsys 4 drivers ported openbsd second revision came serialisation userland reimplemented using property lists help netbsd new proplib 3 library underlying transport layer kernel userland still done ioctl envsys framework precursor openbsd sysctl hw.sensors framework 2003 many drivers well sensor types ported back forth netbsd openbsd support sensors codice_19 type added netbsd similar codice_19 type openbsd time bio 4 bioctl ported openbsd netbsd | [
885,
1254,
6972,
191,
732,
5571,
8194,
6743,
1394,
6211,
5518,
1133,
8135,
1052,
6149,
1793,
8037,
3751,
1435,
6505
] | Test |
1,698 | 4 | Trusted_Computing_Group:trusted computing group trusted computing group group formed amd hewlett-packard ibm intel microsoft implement trusted computing concepts across personal computers trusted computing group announced 2003 successor trusted computing platform alliance previously formed 1999 many companies since joined trusted computing group including wave systems corp digital management inc. cisco lenovo infineon juniper networks fujitsu october 11 1999 trusted computing platform alliance abbreviated tcpa consortium various technology companies including compaq hewlett-packard ibm intel microsoft formed effort promote trust security personal computing platform november 1999 tcpa held founding conference announced 70 leading hardware software companies joined alliance since inception previous month january 30 2001 tcpa announced release version 1.0 trusted computing platform specifications aiming provide industry clear direction facilitates trust computing platforms environments december tcpa released version 1.1a trusted computing platform specifications ibm first original equipment manufacturer incorporate hardware features based version 1.1 tcpa trusted computing platform specifications introduction thinkpad t30 mobile computer april 24 2002 2003 tcpa succeeded trusted computing group increased emphasis trust mobile devices cell phones pdas tcg original goal development trusted platform module tpm semiconductor intellectual property core integrated circuit conforms trusted platform module specification put forward trusted computing group included computers enable trusted computing features tcg-compliant functionality since integrated directly certain mass-market chipsets tcg also recently released first version trusted network connect tnc protocol specification based principles aaa adding ability authorize network clients basis hardware configuration bios kernel version updates applied os anti-virus software etc 2009 tcg released set specifications describe protocol communicate self encrypting disk drives tcg storage work group swg storage core architecture specification describes detail implement utilize trust security services storage devices security subsystem class ssc specifications describe requirements specific classes devices specifically enterprise ssc defines minimum requirements data center server class devices opal ssc defines minimum requirements client devices vendor tpm-enabled system complete control software run owner system cases vendor may choose grant permission owner configure hardware legally purchased conversely restrict owner fully using property include possibility operating system os whether chosen user preinstalled hardware purchase refuses load unsigned unlicensed software e.g. microsoft described detail restrictions would enforced operating system tcg technology tpm provide case capability os lock software specific machine configurations meaning hacked versions os designed get around restrictions would work legitimate concern os vendors could use capabilities restrict software would load os hurting small software companies open source/shareware/freeware providers causing vendor lock-in data formats microsoft already stated begin restricting software allow run windows starting windows 8 arm tpm used conjunction boot loader ensure vendor-approved operating systems running could restrict alternative operating systems running including free open source operating systems example microsoft requiring x86/x64 machines come windows 8 secure boot enabled default caused alternative os vendors make payments microsoft ensure os able installed user additionally arm machine shipped windows 8 banned allowing another os installed time several projects experimenting tpm support free operating systems examples projects include tpm device driver linux open source implementation tcg trusted software stack called trousers also ported windows vista windows 7 2010 java interface tpm capabilities called tpm/j tpm-supporting version grub bootloader called trustedgrub tpm 1.1 specification envisioned standard pc platform equipped tpm chip scenario tpm chip serve hardware key storage additionally keep track so-called measurements platform i.e hashes various software able produce signed statements running software chain particularly latter mode operation proved unfeasible practice since amount software measured trusted large includes addition system firmware operating system drivers application programs therefore numerous tpm-related projects progress purpose make possible launch measure trusted subenvironment within untrusted environment tpm specification 1.2 enhanced accommodate mode operation additionally hardware changes required cpu chipset note confused inclusion tpm functionality chipset even though possibility intel approach called trusted execution technology txt many intel core 2 duo cpus advertised support extensions however chipset support required extensions operational currently intel chipset q35 express supports txt addition chipset support mainboard must also feature tpm 1.2 chip intel currently advertises dq35mp dq35jo compliant technology first application technology set manageability enhancements brand name vpro amd platform called secure execution mode 2002-2003 microsoft announced initiative called next-generation secure computing base formerly palladium basically vision tpm 1.2 chip cpu chipset software could provide environment software ecosystem trusted applications launched within regular windows could developed intel txt amd sem seen realizations hardware side ngscb vision owing significant difficulties creating working implementation third-party developers interested using unavailability enhancements cpu chipset ngscb included microsoft windows vista instead vista ships technologies make use subset functions tpm chip intel txt amd sem bitlocker drive encryption new version microsoft cryptography api group faced widescale opposition free software community grounds technology developing negative impact users privacy create customer lock-in especially used create drm applications received criticism gnu/linux freebsd communities well software development community general significant backlash amongst trusted computing group present richard stallman speech hackers planet earth conference july 2006 new york richard stallman free software foundation also criticized group publicly speeches criticism calls trusted computing treacherous computing instead warns vendors lock software officially signed specific vendors rendering unusable privacy concerns tcg revolve around fact tpm unique keypair called endorsement key identifies platform initial versions tpm version 1.1 tcg addressed privacy concerns suggesting use privacy ca could certify pseudonymous machine credentials separate credentials interacting different parties actions could linked level privacy provided however requires trust privacy ca could still link pseudonyms common identifying machine credential since left unresolved privacy concerns version 1.2 tpm specification introduced direct anonymous attestation protocol based idea zero-knowledge proof allows tpm user receive certification way privacy ca would able link requests single user platform still able identify rogue tpms privacy concerns tpm heightened christopher tarnovsky presented methods access compromise infineon tpm non-volatile memory capacity contains user data black hat 2010 efforts tcg specifications standardized iso active first part october 2007 member states iso/dis jtc1 expected send opinion iso july 24 2008 may 18 2009 tcg managed achieve standardization tpm specifications august 2014 approximately 100 promoters contributors adopters tcg specifications membership fees vary level promoters pay annual membership fees 30,000 contributors pay 15,000 depending upon company size adopters pay annual membership fees either 2,500 7,500 | [
3074,
363,
3764,
4388,
2723,
6899,
6539,
5571,
6823,
595,
1594,
1052,
4550,
5785,
5440,
2979
] | Test |
1,699 | 2 | Dependency_hell:dependency hell dependency hell colloquial term frustration software users installed software packages dependencies specific versions software packages dependency issue arises around shared packages libraries several packages dependencies depend different incompatible versions shared packages shared package library installed single version user may need address problem obtaining newer older versions dependent packages turn may break dependencies push problem another set packages dependency hell takes several forms specific computing platforms dependency hell often goes local specific name generally name components | [
1621,
4759,
4675,
5912,
7075,
3366,
4778,
578,
405,
3559,
6835,
4812,
4441,
1406,
1889,
6586,
7042,
1989
] | Validation |
1,700 | 8 | Executable_choreography:executable choreography executable choreography represents decentralized form service composition involving cooperation several individual entities improved form service choreography executable choreographies intuitively seen arbitrary complex workflows get executed systems belonging multiple organisations authorities executable choreographies actual code created encode system behavior global point view behavior main entities system given single program choreographies enhance quality software behave like executable blueprints communicating systems behave offer concise view message flows enacted system almost applications business logic must separated different services orchestration represents way services organized composed resulting service integrated hierarchically another composition service choreography global description participating services defined exchange messages rules interaction agreements two endpoints choreography employs decentralized approach service composition industry concept choreography generally considered non-executable standards proposed web services choreography description language present choreography formal model describe contracts autonomous entities generally distinct organizations participating composition services analyzed globally perspective composition must implemented centrally different orchestration mechanisms made available companies naive code composition use specific orchestration languages engines bpel business process execution language rule engines etc area academic research concept executable choreography proposed method longer contractual part actual part code two different artifacts non-synchronized require subjective interpretations examples executable calculus service choreography executable choreography framework dynamic service-oriented architectures approaches also practical impact often level articles least research projects real breakthrough blockchain recent years brought even attention academic community industry concept smart contract seen particular form executable choreography executable choreographies general concept necessarily verifiable choreographies use idea site regarded security context code execution examples approaches programming using executable choreographies could list european project choreos chor programming language web service modeling choreographing web services aspects related composition web services using pi-calculus verifiable term introduced highlight possibility verifying swarm choreographies explicit presence execution location idea leads possibility developing verification algorithms seen article levels privacy e-health systems cloud era encrypted cryptography supposes addition verification offer higher-level solutions advanced cryptographic methods without need programmers become cryptography specialists distributed applications could built subsystems allow identification verification architectural points expose secret data example ideally programming system uses encrypted choreographs guarantees least helps minimize situations person legally licensed hacker holds encrypted private data encryption keys related resources way administrators programmers subsystems fewer possibilities perform internal attacks privacy level frequent attacks even applications use approach encrypted choreographies minimize security risks caused people inside administer program systems thus number points discreet access data ideally never formally ensured form choreography useful allow companies secure code application legislation security rules assumed implementation encrypted choreographies implies example existence storage systems using cryptographic techniques practical implementation homomorphic encryption cryptdb implementation mit method also called storage division anonymization method help encrypted choreographies lead ideal total sovereignty within limits law private data published article private data system enabling self-sovereign storage managed executable choregraphies paper presents choreographies anonymize divide data way ensures data copied single administrator hacker controls one participating nodes implemented mechanisms also include interfaces easy use programmers advanced cryptographic methods serverless computing cloud computing model cloud provider dynamically manages allocation computing resources serverless choreographies involve automating launching methods using virtualization automation techniques implementation advanced type choreography requires development new business models facilitate cloud-based application hosting without friction related payment installation etc example tor concept provides example serverless systems best known example amazon lambda great commercial success allowing programmers ignore installation details facilitate dynamic scalability systems blockchains considered examples serverless databases serverless choreographies assume cloud execution storage done using encrypted choreographies using form choreography hosting companies individuals managing physical logical hosting infrastructure able influence hosted installation applications serverless choreographies present opportunity develop distributed decentralized systems potential formally secure advanced privacy properties | [
6430,
6714
] | Test |
1,701 | 4 | Lew_Allen:lew allen lew allen jr. september 30 1925 – january 4 2010 united states air force four-star general served tenth chief staff united states air force chief staff allen served senior uniformed air force officer responsible organization training equipping 750,000 active duty air force air national guard air force reserve civilian personnel serving united states overseas member joint chiefs staff service chiefs function ed military advisers secretary defense national security council president born miami florida allen attended graduated high school gainesville texas 1942 entered united states military academy 1943 graduated 1946 bachelor science degree commission second lieutenant awarded pilot wings upon graduation flight training completing multi-engine flight training november 1946 allen assigned strategic air command 7th bombardment group carswell air force base texas flew b-29 superfortress bombers new long-range convair b-36 bomber allen also served various technical positions area nuclear weapons allen also attended air tactical course tyndall air force base florida next returned carswell air force base flight instructor assistant special weapons officer 7th bombardment wing september 1950 allen entered university illinois graduate study nuclear physics completed master science degree 1952 allen continued graduate study earned ph.d. physics 1954 completed experimental thesis high-energy photonuclear reactions allen assigned u.s. atomic energy commission los alamos scientific laboratory los alamos new mexico physicist test division became acquainted bomb designer ted taylor allen conducted experiments several different nuclear test series experiments concerned physics thermonuclear weapons design effects high altitude nuclear explosions conceivably used ballistic missile defense june 1957 december 1961 allen assigned kirtland air force base new mexico science adviser physics division air force special weapons center special weapons euphemism nuclear thermonuclear bombs allen specialized military effects high altitude nuclear explosions participated several nuclear weapons test series scientific director major experiment utilized large series high altitude rockets measure characteristics electrons trapped geomagnetic field exoatmospheric nuclear burst allen assigned december 1961 office secretary defense space technology office directorate research engineering washington d.c. june 1965 february 1973 assigned office secretary air force initially los angeles california deputy director advanced plans directorate special projects allen next moved pentagon june 1968 deputy director space systems june 1969 became director returned los angeles september 1970 assistant director special projects april 1971 became director special projects additional duty deputy commander satellite programs space missile systems organization serving briefly chief staff air force systems command andrews air force base maryland allen appointed march 1973 deputy director central intelligence intelligence community washington d.c august 1973 allen became director national security agency nsa chief central security service fort george g. meade maryland allen tenure nsa director noteworthy became first director ever testify publicly congress august 1977 named commander air force systems command allen served vice chief staff united states air force april 1978 became chief staff air force july 1978 nomination unusual never served overseas combat assignment positions specialized technical activities rather usual command structure air force also last chief staff bomber background subsequent chiefs staff except general norton schwartz fighter pilots trend reflected service weapon budgets devote funding fighters rather bombers following retirement air force 1982 allen became director jet propulsion laboratory jpl part voyager program space probes launched 1977 served director jpl 1990 allen member national academy engineering council foreign relations 1993 1995 allen served member president foreign intelligence advisory board pfiab intelligence oversight board allen awarded 1999 distinguished graduate award association graduates alumni association west point graduates allen died potomac falls virginia january 4 2010 complications rheumatoid arthritis buried arlington national cemetery march 22 2010 united states air force created general lew allen jr. trophy allen honor awarded annually officer senior nco aircraft maintenance munitions career fields directly involved setting aircraft sorties since 1986 jet propulsion laboratory awards honor lew allen award excellence 1990 called director research achievement award | [
4210,
820,
6627,
1278,
3716,
4429,
7917,
5412,
5767,
5509,
4727,
4988,
2343,
4996,
4201
] | Test |
1,702 | 2 | HP_Pre_3:hp pre 3 hp pre 3 styled pre touchscreen slider smartphone manufactured hewlett-packard device uses webos powered qualcomm snapdragon processor 3.6-inch screen conceptually successor palm pre 2 earlier pre pre plus models hp pre 3 announced february 9 2011 hp webos think beyond event held fort mason center san francisco alongside veer touchpad commercially released united kingdom august 17 2011 device supports new touch-to-share proximity-based sharing feature allows compatible devices touchpad instantly exchange data media information via bluetooth pre 3 802.11 a/b/g/n wi-fi 512 mb ram 8 gb internal storage bluetooth v2.1 1230 mah battery 16 gb model manufactured verizon united states models never released general public pre 3 released august 17 2011 united kingdom next day august 18 hp announced would discontinuing webos devices including pre 3 phone never officially released united states although models eventually sold hp employee store california many phones ended ebay auctions hp pre 3 features 3.58-inch multi-touch capacitive touchscreen resolution 800-by-480 pixels pre 3 three physical buttons input including volume up/down buttons side power button top navigating os pre 3 gesture area swipe enter card like multitasking view swipe right left go back application swipe left right go forward optionally swipe completely right left switch applications modifier keys combined gestures enable text selection cursor positioning command shortcuts triggered holding tap gesture area pressing key keyboard pre 3 supports bluetooth 2.1 802.11a/b/g/n wifi hspa+ well gsm evdo cdma depending service provider along hp touchpad pre 3 supports new technology called touch share touch share lets share urls phone calls text messages data 3rd party apps touchpad hp pre 3 tapping phone touchpad sensor example web site browsed touchpad transferred pre browser tapping two devices together umts frequency bands supported pre 3 mono loudspeaker well dual mic noise cancellation pre 3 features 5 mega pixel camera auto focus led flash capable 720p video recording phone also front-facing vga camera video calling integrated skype application pre 3 sold carphone warehouse uk competitive pay monthly contract terms limited available stock us gsm models sold direct hp employees 75 12 per employee branded unsupported either hp/palm though received over-the-air ota update 2.2.0 2.2.3 addition update webos 2.2.4 released update webos doctor ota update | [
1066,
2538,
7326,
4754,
3764,
2370,
1167,
289,
2551,
3524,
4317,
7442,
6443,
488,
1284,
6910,
740,
1202,
5236,
7919,
4166,
6378,
1581,
1582,
4627,
3734,
1973,
3405,
2338,
1237,
7049
] | Train |
1,703 | 2 | GEOM:geom geom main storage framework freebsd operating system available freebsd 5.0 higher provides standardized way access storage layers geom modular allows geom modules connect framework example geom_mirror module provide raid1 mirroring functionality system wide range modules already available new ones always active development various freebsd developers geom developed freebsd project poul-henning kamp nai labs security research division network associates inc. darpa/spawar contract n66001-01-c-8035 cboss part darpa chats research program name symbolizes impact disk geometry geom modular design modules 'stacked together form chain geom layers example top geom_mirror module encryption module added geom_eli provide mirrored encrypted volume module consumers providers provider 'source geom module often physical hard drive sometimes virtualized disk memory disk geom module turn provides 'output device geom modules called consumers use provider create chain modules connected source → geom module → output referred provider → geom module → consumer example geom_mirror module may use consumer following providers /dev/ada0 /dev/ada1 creates provider new device called /dev/mirror/gm0 end geom chain often filesystem applied actually use geom provider something useful provider created geom modules behaves like physical hard drive contain filesystems freebsd native unix file system ufs storage modules encryption compression modules filesystem modules virtualization | [
1523,
1341,
1254,
7514,
191,
6711,
1356,
1640,
1547,
4498,
7355,
481,
3457,
732,
2300,
5571,
6278,
8194,
8096,
1193,
7267,
1013,
3636,
4059,
8001,
1391,
6918,
1394,
5760,
6211,
3986,
4806,
5065,
594,
4441,
5865,
4534,
6477,
424,
2512,
5... | Test |
1,704 | 4 | Black_fax:black fax term black fax refers prank fax transmission consisting one pages entirely filled uniform black tone sender intention generally use much recipient fax ink toner thermal paper possible thus costing recipient money well denying recipient use machine similar computer-based denial service attacks made easier fax transmission protocols compress solid black image well short fax call produce many pages black faxes used harass large institutions government departments retaliate senders junk faxes merely simple pranks basic principle black fax extended form black fax attack case one sheets fed halfway sender fax machine taped end end forming endless loop cycles machine solid black used also images repeat endlessly receiver machine toner runs introduction computer-based facsimile systems combined integrated document imaging solutions major corporations means black faxes unlikely cause problems hand ability computer modems send faxes offers new avenues abuse program could used generate hundreds pages highly compressed pure black – huge volumes relevant-looking original non-repeating high-black-density junk effective far difficult counteract – send quickly target fax machine black faxes fax loops similar intention implementation lace cards | [
1691,
4178,
598
] | Test |
1,705 | 4 | Industry_Connections_Security_Group:industry connections security group industry connections security group ieee icsg global group computer security entities past present members include anh labs avg avira eset f-secure k7 computing kaspersky labs marvell mcafee microsoft palo alto networks panda software safenet sophos symantec trend micro come together ieee pool experience resources combating systematic rapid rise computer security threats ieee icsg activities include | [
496,
5144,
91,
5452,
6644,
142,
3896,
6305,
8100,
88
] | Test |
1,706 | 4 | Unidirectional_network:unidirectional network unidirectional network also referred unidirectional gateway data diode network appliance device allows data travel one direction data diodes found commonly high security environments defense serve connections two networks differing security classifications given rise industrial iot digitization technology found industrial control level facilities nuclear power plants power generation safety critical systems like railway networks years development use data diodes increased creating two variations data diodes commonly found high security military government environments becoming widely spread sectors like oil gas water/wastewater airplanes flight control units in-flight entertainment systems manufacturing cloud connectivity industrial iot new regulations increased demand increased capacity major technology vendors lowered cost core technology first data diodes developed governmental organizations eighties nineties organizations work confidential information making sure network secure highest priority primary solutions used organizations air gaps amount transferable data increased continuous real-time data stream became important organizations look automated solution search standardization increasing number organizations started look solution better fit activities commercial solutions created stable organizations succeeded given level security long-term support us utilities oil gas companies used data diodes several years regulators encouraged use protect equipment processes siss nuclear regulatory commission nrc mandates use data diodes many sectors addition electrical nuclear also use data diodes effectively europe regulators operators several safety-critical systems started recommending implementing regulations use unidirectional gateways 2013 working industrial control system cybersecurity directed french network information security agency anssi stated forbidden use firewalls connect class 3 network railway switching systems lower class network corporate network unidirectional technology permitted unidirectional network devices typically used guarantee information security protection critical digital systems industrial control systems cyber attacks use devices common high security environments defense serve connections two networks differing security classifications technology also used enforce one-way communications outbound critical digital systems untrusted networks connected internet physical nature unidirectional networks allows data pass one side network connection another way around low side untrusted network high side trusted network vice versa first case data high side network kept confidential users retain access data low side functionality attractive sensitive data stored network requires connectivity internet high side receive internet data low side data high side accessible internet-based intrusion second case safety-critical physical system made accessible online monitoring yet insulated internet-based attacks might seek cause physical damage cases connection remains unidirectional even low high network compromised security guarantees physical nature two general models using unidirectional network connections classical model purpose data diode prevent export classified data secure machine allowing import data insecure machine alternative model diode used allow export data protected machine preventing attacks machine described detail involves systems must secured remote/external attacks public networks publishing information networks example election management system used electronic voting must make election results available public time must immune attack model applicable variety critical infrastructure protection problems protection data network less important reliable control correct operation network example public living downstream dam needs up-to-date information outflow information critical input control system floodgates situation critical flow information secure control system public vice versa majority unidirectional network applications category defense defense contractors organizations traditionally applied air gaps keep classified data physically separate internet connection introduction unidirectional networks environments degree connectivity safely exist network classified data network internet connection bell-lapadula security model users computer system create data security level applies contexts hierarchy information classifications users security level share machine dedicated level machines connected data diodes bell-lapadula constraints rigidly enforced traditionally network provides dmz server access authorized user data vulnerable intrusions network however unidirectional gateways separating critical side ot network sensitive data open side business internet connectivity normally network organizations achieve best worlds enabling connectivity required assuring security holds true even network compromised traffic flow control physical nature simplest form unidirectional network modified fiber-optic network link send receive transceivers removed disconnected one direction link failure protection mechanisms disabled commercial products rely basic design add software functionality provides applications interface helps pass data across link sophisticated commercial offerings enable simultaneous one-way data transfer multiple protocols usually require bidirectional links owl cyber defense offered specialized government defense data diode solutions since late 1990s well solutions critical infrastructure commercial applications recently low-cost iot security data diode 2018 siemens mobility released industrial grade unidirectional gateway solution data diode data capture unit uses electromagnetic induction new chip design achieve eba safety assessment guaranteeing secure connectivity new existing safety critical systems safety integrity level sil 4 enable secure iot provide data analytics cloud hosted digital services us naval research laboratory nrl developed unidirectional network called network pump many ways similar dsto work except allows limited backchannel going high side low side transmission acknowledgments technology allows protocols used network introduces potential covert channel high- low-side compromised artificially delaying timing acknowledgment different implementations also differing levels third party certification accreditation cross domain guard intended use military context may require extensive third party certification accreditation data diode intended industrial use however may require third party certification accreditation depending application | [
2961,
8010,
2705,
2774,
2054,
6405,
2779,
3680
] | Test |
1,707 | 3 | Chung_Laung_Liu:chung laung liu professor chung laung dave liu 劉炯朗 c. l. liu ethnic chinese computer scientist born guangzhou spent childhood macau received b.sc degree taiwan master degree doctorate united states liu received b.sc degree 1956 national cheng kung university taiwan s.m e.e degrees 1960 sc d. degree 1962 massachusetts institute technology faculty massachusetts institute technology 1962–1972 university illinois urbana-champaign 1972–1998 associate provost 1995 1998 retired uiuc served president professor computer science national tsing hua university nthu hsinchu taiwan february 1998 february 2002 currently william mong honorary chair professor national tsing hua university visiting professor city university hong kong waseda university tokyo japan li k. t. honorary chair professor national central university since 2007 li kuo-ting forum professor national cheng kung university author co-author seven books monographs 180 technical papers research interests include computer-aided design vlsi circuits real-time systems computer-aided instruction combinatorial optimization discrete mathematics received ieee millennium medal ieee circuits systems society golden jubilee medal 2000 also received ieee computer society real time systems technical committee 1999 technical achievement award inaugural winner contributions area real time scheduling ieee circuits systems society 1998 technical achievement award contributions area computer aided design vlsi circuits received outstanding talents foundation award 1998 recipient 1994 ieee education medal also received taylor l. booth education award ieee computer society 1992 inaugural winner karl v. karlstrom education award association computing machinery 1989 member academia sinica fellow institute electrical electronics engineers fellow association computing machinery 2004 university macau awarded honorary doctorate | [
1243,
479
] | Test |
1,708 | 4 | Cracking_of_wireless_networks:cracking wireless networks cracking wireless network defeating security wireless local-area network back-jack wireless lan commonly used wireless lan wi-fi network wireless lans inherent security weaknesses wired networks exempt wireless cracking information network attack similar direct intrusion two frequent types vulnerabilities wireless lans caused poor configuration caused weak flawed security protocols 802.11 networks use data frames management frames control frames data frames convey real data similar ethernet management frames maintain network configuration connectivity control frames manage access ether prevent access points clients interfering ether information management frames helpful better understand programs reconnaissance wardriving common method wireless network reconnaissance well-equipped wardriver uses laptop computer wireless card antenna mounted car power inverter connected gps receiver way connect internet wirelessly purpose wardriving locate wireless network collect information configuration associated clients laptop computer wireless card must support mode called monitor rfmon netstumbler network discovery program windows free netstumbler become one popular programs wardriving wireless reconnaissance although disadvantage detected easily wireless intrusion detection systems actively probes network collect information netstumbler integrated support gps unit support netstumbler displays gps coordinate information next information discovered network useful finding specific networks sorted collected data latest release netstumbler 1 april 2004 work well 64-bit windows xp windows vista inssider wi-fi network scanner 32-bit 64-bit versions windows xp vista 7 windows 8 android free open source software uses current wireless card wireless usb adapter supports gps devices namely use nmea 2.3 higher graphical user interface shows mac address ssid signal strength hardware brand security network type nearby wi-fi networks also track strength signals show time graph kismet wireless network traffic analyser os x linux openbsd netbsd freebsd wireshark packet sniffer network traffic analyser run popular operating systems support capture wireless traffic limited free open source decoding analysing wireless traffic foremost function wireshark give results obtained programs wireshark requires sufficient knowledge network protocols obtain full analysis traffic however airmagnet laptop analyser airmagnet handheld analyser wireless network analysis tools made airmagnet company started handheld analyser suitable surveying sites wireless networks deployed well finding rogue access points laptop analyser released hand-held product impractical reconnaissance wide areas commercial analysers probably offer best combination powerful analysis simple user interface however well adapted needs wardriver free programs androdumpper android apk used test hack wps wireless routers vulnerability using algorithms hack wifi network runs best android version 5.0+ airopeek packet sniffer network traffic analyser made wildpackets commercial program supports windows works wireless network interface cards become industrial standard capturing analysing wireless traffic however like wireshark airopeek requires thorough knowledge protocols use ability kismac program discovery wireless networks runs os x operating system functionality kismac includes gps support mapping ssid decloaking deauthentication attacks wep cracking two basic types vulnerabilities associated wlans caused poor configuration caused poor encryption poor configuration causes many vulnerabilities wireless networks often put use insufficient security settings security settings – default configuration – access obtained simply association without sufficient security settings networks easily defeated cloaking and/or mac address filtering poor encryption causes remaining vulnerabilities wired equivalent privacy wep defective defeated several ways wi-fi protected access wpa cisco lightweight extensible authentication protocol leap vulnerable dictionary attacks wep encryption standard firstly available wireless networks deployed 64 128 bit strength 64 bit wep secret key 40 bits initialisation vector 24 bits often called 40 bit wep 128 bit wep secret key 104 bits initialisation vector 24 bits called 104 bit wep association possible using password ascii key hexadr cracking wep fluhrer mantin shamir attack|fms attack chopping attack fms attack – named fluhrer mantin shamir – based weakness rc4 encryption algorithm researchers found 9000 possible 16 million initialisation vectors considered weak collecting enough allows determination encryption key crack wep key cases 5 million encrypted packets must captured collect 3000 weak initialisation vectors cases 1500 vectors cases 5000 needed success weak initialisation vectors supplied rc4 key-scheduling algorithm ksa |key scheduling algorithm ksa rc4 pseudo-random generation algorithm prga |pseudo random generator prng determine first byte wep key procedure repeated remaining bytes key chopping attack chops last byte captured encrypted packets breaks cyclic redundancy check checksum|integrity check value crc/icv 8 bits removed byte zero crc shortened packet made valid manipulation last four bytes manipulation result original xor certain value manipulated packet retransmitted method enables determination key collecting unique initialisation vectors main problem fms attack chopping attack capturing enough packets take weeks sometimes months fortunately speed capturing packets increased injecting packets network one address resolution protocol arp packets usually collected end transmitted access point repeatedly enough response packets captured arp packets good choice recognizable size 28 bytes waiting legitimate arp packet take awhile arp packets commonly transmitted authentication process rather waiting sending deauthentication frame pushes client network require client reauthenticate often creates arp packet wpa developed vulnerabilities wep wpa uses either pre-shared key wpa-psk used combination radius server wpa-radius encryption algorithm wpa uses either temporal key integrity protocol tkip advanced encryption standard aes wi-fi protected access wpa2|wpa2 developed vulnerabilities wpa-psk strengthen encryption wpa2 uses tkip aes requires encryption piece also authentication piece form extensible authentication protocol eap deployed piece wpa-psk attacked psk shorter 21 characters firstly four-way eap lan eapol handshaking|handshake must captured captured legitimate authentication reauthentication forced sending deauthentication packets clients secondly word word-list must cryptographic hash function|hashed hashed message authentication code – secure hash algorithm 1 two called nonce values along mac address client asked authentication mac address access point gave authentication word-lists found leap uses variation microsoft challenge handshake protocol version 2 ms-chapv2 handshake uses data encryption standard des key selection leap cracked dictionary attack attack involves capturing authentication sequence comparing last two bytes captured response generated word-list wpa-radius cracked however radius authentication server cracked whole network imperilled security authentication servers often neglected wpa2 attacked using wpa-psk attack largely ineffective aircrack-ng runs windows linux crack wep wpa-psk use pychkine-tews-weinmann korek attacks statistical methods efficient traditional fms attack aircrack-ng consists components airmon-ng configures wireless network card airodump-ng captures frames aireplay-ng generates traffic aircrack-ng cracking using data collected airodump-ng finally airdecap-ng decrypts packets captured thus aircrack-ng name suite also one components cowpatty automates dictionary attack wpa-psk runs linux program started using command-line interface specifying word-list contains passphrase dump file contains four-way eapol handshake ssid network void11 program deauthenticates clients runs linux mac address filtering used alone ineffective security measure combination encryption attack determining allowed mac address changing mac address attacker address etherchange one many programs available change mac address network adapters runs windows penetration test ing wireless network often stepping stone penetration testing internal network wireless network serves so-called entry vector wpa-radius use target site another entry vector must investigated 'wireless packet analyzer|sniffer find ip address es helpful network mapping access points usually connect nodes wireless network wired network bridge router bridge router use routing table forward packets finding relevant reachable ip addresses objective reconnaissance phase attacking organization internet relevant ip addresses determined collecting many domain name system|dns host names possible translating ip addresses ip address ranges called footprinting web search engine|search engine key finding much information possible target many cases organizations want protect resources internet access instance web server must accessible many organizations additionally message transfer agent|email servers file transfer protocol|ftp servers systems must accessible internet ip addresses organization often grouped together one ip address found rest probably found around name server store tables show domain names must translated ip addresses vice versa windows command nslookup|nslookup used query dns servers word help entered nslookup prompt list commands given linux command dig used query dns servers displays list options invoked option -h command host reverses ip addresses hostnames program nmap used reverse dns walker nmap -sl 1.1.1.1-30 gives reverse entries given range arin ripe apnic lacnic afrinic five regional internet registry|regional internet registries responsible assignment registration ip addresses website databases searched owner ip address registries respond search name organization list ip address ranges assigned name however records registries always correct cases useless probably computers access internet receive ip address dynamically dynamic host configuration protocol|dhcp protocol become popular last years decrease available ip addresses increase large networks dynamic dhcp particularly important many employees take portable computer one office another router/ firewall computing |firewall device people use home connect internet probably also functions dhcp server nowadays many router/dhcp devices perform network address translation nat nat device gateway telecommunications |gateway local network internet seen internet nat device seems single host nat local network use ip address space ip address ranges reserved private network s. ranges typically used local area network behind nat device 10.0.0.0 10.255.255.255 172.16.0.0 172.31.255.255 192.168.0.0 192.168.255.255 relevant ip addresses must narrowed reachable purpose process scanning enters scene access wireless network gained helpful determine network topology including names computers connected network nmap used available windows linux version however nmap provide user network diagram network scanner network view runs windows program asks one ip address ip address range program finished scanning displays map network using different pictures routers workstation server computing |servers laptop names added direct method finding hosts local area network|lan using program ping networking utility |ping using modern flavour unix shell computing |shell commands combined produce custom ping sweep|ping-sweeps using windows command-line also used create ping-sweep examples given reference ping-sweeps also known host scans nmap used host scan option -sp added nmap -n -sp 10.160.9.1-30 scans first 30 addresses subnet 10.160.9 -n option prevents reverse dns lookups ping packets could reliably determine whether computer line specified ip address nowadays internet control message protocol|icmp echo request packets sometimes blocked firewall operating system although nmap also probes tcp port 80 specifying tcp ports probe recommended pings blocked consequently nmap -sp -ps21,22,23,25,80,139,445,3389 10.160.9.1-30 achieve better results combining various options nmap -sp -ps21,22,23,25,80,135,139,445,1025,3389 -pu53,67,68,69,111,161,445,514 -pe -pp -pm 10.160.9.1-30 superb host scanning achieved nmap available windows unix operating systems offers graphical command-line interfaces purpose port scanning finding open ports computers found host scan port scan started network without making use results host scan much time wasted many ip addresses address range vacant programs communicate internet use either transmission control protocol|tcp user datagram protocol|udp protocol protocols support 65536 called port computer networking |ports programs choose bind allows programs run concurrently one ip address programs default ports often used example http servers commonly use tcp port 80 network scanners try connect tcp udp ports port accepts connection assumed commonly bound program running tcp connections begin syn packet sent client server server responds syn/ack packet finally client sends ack packet scanner sends syn packet gets syn/ack packet back port considered open rst packet received instead port considered closed response received port either considered filtered firewall running host ip address scanning udp ports difficult udp use handshakes programs tend discard udp packets process udp packet sent port program bound icmp error packet returned port considered closed answer received port considered either filtered firewall open many people abandoned udp scanning simple udp scanners distinguish filtered open ports although thorough scan 65536 ports would take time scanning common ports therefore nmap scans 1667 tcp ports default 2007 -p option instructs nmap scan specified ports nmap -p 21-25,80,100-160 10.150.9.46 specifying tcp udp ports also possible nmap -pt:21-25,80 u:5000-5500 10.150.9.46 nmap always requires specification host hosts scan single host specified ip address domain name multiple hosts specified ip address ranges examples 1.1.1.1 www.company.com 10.1.50.1-5,250-254 nmap performs tcp syn scan default scan packets syn flag set -ss option specifies default explicitly nmap started administrator privileges default scan takes effect nmap started user privileges connect scan performed -st option instructs nmap establish full connection scan inferior previous additional packet must sent logging target likely connect scan performed nmap executed user privileges ipv6 addresses scanned -sn option instructs nmap send packets none syn rst ack flags set tcp port closed rst packet sent return tcp port open filtered response null scan often bypass stateless firewall useful stateful firewall employed -su option instructs nmap send udp packets data icmp error returned port assumed closed response received port assumed open filtered differentiation open filtered ports severe limitation -su -sv options instruct nmap use application data application identification combination options lead slow scanning packets sent network faster cope dropped leads inaccurate scanning results intrusion detection system intrusion prevention system present target network detection becomes likely speed increases many intrusion prevention system|ips devices firewalls respond storm syn packets enabling syn cookies make appear every port open full speed scans even wreak havoc stateful firewall|stateful network devices nmap provides five templates adjusting speed also adapts -t0 option makes wait 5 minutes next packet sent -t1 option makes wait 15 seconds -t2 inserts 0.4 seconds -t3 default leaves timing settings unchanged -t4 reduces time-outs retransmissions speed things slightly -t5 reduces time-outs retransmissions even speed things significantly modern ids/ips devices detect scans use -t1 option user also define new template settings use instead provided one -sv option instructs nmap also determine version running application -o option instructs nmap try determine operating systems targets specially crafted packets sent open closed ports responses compared database -ox filename option instructs nmap save output file xml format vulnerability bug application program affects security made public places bugtraq|bugtraq full-disclosure mailing lists computer emergency response team|computer emergency response team cert brings statistical report every year 8064 vulnerabilities counted 2006 alone vulnerability scanning determining whether known vulnerabilities present target exploit computer security |exploit takes advantage software bug|bug application software|application take effect execution arbitrary commands inserting execution path program privilege escalation|escalation privileges bypass authentication infringement confidentiality result metasploit project|metasploit framework released 2003 framework provided first time basic procedure using metasploit choose exploit choose payload set ip address port target start exploit evaluate stop repeat procedure metasploit suited finding vulnerabilities host vulnerability scanner alternatively port scanner found open port exploits port may tried metasploit 3.0 provides following payloads vnc connections need relatively large bandwidth computing |bandwidth usable someone front compromised computer interaction seen quickly command-line interfaces linux os x powerful windows meterpreter payload remedies shortcomings reference gives list meterpreter commands ultimate gratification network intruder always obtain administrator privileges network intruder inside one first undertakings often install so-called rootkit target computer collection programs facilitate durable influence system programs used compromise new user computing user account|user accounts new computers network programs obscure presence intruder obscuring programs may include false versions standard network utilities netstat programs remove data log files computer relate intruder yet programs rootkit may used survey network overhear passwords travelling rootkits may also give means change operating system computer installed network intruder proceeds creating one called backdoor computing |back doors access provisions hard find system administrators serve prevent logging monitoring results normal use network back door may concealed account account privileges escalated may utility remote access telnet configured operate port number customary network intruder proceeds stealing files stealing credit card information preparing computer send spam emails another goal prepare next intrusion cautious intruder protective discovery location method choice use computer already attacked intermediary intruders use series intermediate computers making impracticable locate purpose back door maintain communication channel methods control host gained entry methods include file transfer execution programs often important make sure access communication remains secret access control desirable order prevent others using back door back orifice 2000 designed back door server runs windows client computing |clients windows linux operating systems server configured easily utility configuration server needs uploaded target started back orifice 2000 supports file transfer file execution keystroke logging|logging keystrokes control connections also aes plug-in computing |plug-in traffic encryption stcpio plug-in obfuscation traffic first plug-in adds security combination plug-ins makes much harder ids relate traffic back door information found http //www.bo2k.com rootkits specialize hiding programs hacker defender hxdef open source rootkit windows hide files process windows registry|registry entries port multiple dynamic-link library|dlls although simple command-line interface back door often better use ability hide appropriate tool unprotected wireless network extremely insecure anywhere within broadcast range someone eavesdrop start using network therefore ieee 802.11 standard wireless networks accompanied wired equivalent privacy wep security protocol takes care following wep criticized security experts experts regard ineffective 2004 draft better security protocol appeared included ieee 802.11 standard 2007 new protocol ieee 802.11i-2004|wpa2 uses aes block cipher instead rc4 algorithm better procedures authentication key distribution wpa2 much secure wep wep still wide use 2009 many wireless routers also support controlling mac addresses computers authorized use wireless network measure effectively stop neighbour using network experienced intruders stopped mac filtering attacked mac address faked easily past turning broadcasting ssid also thought give security wireless network case however freely available tools exist quickly discover ssid broadcast microsoft also determined switching broadcasting ssid leads less security details found non-broadcast wireless networks microsoft windows returning encryption wep specification encryption strength unable withstand determined hacking therefore wi-fi protected access wpa derived wep software upgrades often available latest devices conform ieee 802.11g-2003|802.11g ieee 802.11n-2009|802.11n standards also support wpa2 wpa uses tkip encryption wpa2 uses stronger aes method recommended use hardware supports wpa wpa2 installing updates regularly disabling wps setting custom ssid requiring wpa2 using strong password make wireless router difficult crack even unpatched security flaws router software firmware may still used attacker bypass encryption gain control device many router manufacturers always provide security updates timely manner especially inexpensive models wps currently severe vulnerability 8 pin numbered 0-9 passwords used easily split two halves means half brute-forced individually possible combinations greatly lessened 10^4 10^4 opposed 10^8 vulnerability addressed manufacturers days using lock mechanism router automatically lock wps number failed pin attempts take number hours router automatically unlock even rebooted make wps attacks completely obsolete without lock feature wpa2 router wps enabled easily cracked 5 hours using brute force wps attack ssid used routers identify within mass 2.4 3.6 5 60 ghz frequencies currently flying around cities also used seed router password hashes standard popular ssid netgear brute forced use rainbow table however use salt greatly improves security rainbow tables popular method wpa wpa2 cracking obtaining known 4 way handshake device connecting network 4-stage authorization process referred 4 way handshake wireless device undergoes process handshake sent air easily monitored saved external system handshake encrypted router password means opposed communicating router directly quite slow cracker attempt brute force handshake using dictionary attacks device connected directly router still undergo process however handshake sent connected wire opposed air intercepted 4 way handshake already intercepted mean cracker granted immediate access however password used contains least 12 characters consisting random upper lower case letters numbers spell word name pattern password essentially uncrackable give example let take minimum 8 characters wpa2 suppose take upper case lower case letters digits 0-9 small selection symbols avail hefty choice 64 characters 8 character length password grand total 64^8 possible combinations taking single machine could attempt 500 passwords per second gives us 17,900 years attempt every possible combination even mention amount space necessary store combination dictionary note use mac filtering protect network work macs using network easily detected spoofed network scanner sniffer application program makes use wireless network interface card repeatedly tunes wireless card successively number radio channels network detector passive scanning|passive scanner pertains receiver wireless card therefore scanning detected attacker obtain considerable amount information passive scanner information may obtained sending crafted frames provoke useful responses called active scanning probing active scanning also involves use transmitter wireless card activity therefore detected wireless card located detection possible intrusion detection system wireless networks locating possible suitable equipment wireless intrusion detection systems designed detect anomalous behaviour one sensors collect ssids radio channels beacon intervals encryption mac addresses transmission speeds signal-to-noise ratio s. wireless intrusion detection systems maintain registry mac addresses unknown clients detected making use someone else wireless access point wireless router connect internet – without owner consent way – punishable criminal law netherlands true even device uses form access protection penetrate someone else computer without owner consent punishable criminal law though consensus computer attackers divided following groups term hacker originally used someone could modify computer purposes hacking intrusion combined direct alteration security data structures breached system word hacking often confused cracking popular media discourse obfuscates fact hacking less eavesdropping related interference alteration however consistent abuse news media 2007 term hacker commonly used someone accesses network computer without authorization owner 2011 collins english dictionary|collins dictionary stated word hacker mean computer fanatic particular one means personal computer breaks computer system company government like also denoted sense word hacker slang slang words appropriate formal writing speech computer experts reserve word hacker clever programmer call someone breaks computers intruder attacker cracker category computer network security category computer security category cryptographic attacks category data security category dutch law category hacking computer security category local area networks category wi-fi category wireless networking | [
3932,
5272,
4295,
3172,
3766,
4759,
1722,
2823,
2095,
2192,
558,
3775,
5116,
1461,
651,
7637,
4208,
5571,
1942,
2119,
5046,
578,
3714,
740,
5051,
3797,
6823,
5847,
2944,
2043,
588,
7106,
7207,
6220,
3486,
7209,
2062,
2244,
6574,
4451,
7... | Train |
1,709 | 5 | Server_Routing_Protocol:server routing protocol server routing protocol srp proprietary network protocol used transfer data blackberry enterprise server research motion blackberry infrastructure srp communication takes place tcp port 3101 default srp work two different part 1 srp id 2 srp authorization key blackberry enterprise server installation unique server routing protocol identifier srp id srp authentication key must entered srp id srp authentication key register authenticate blackberry enterprise server network work flow like authentication process srp id thought login name authentication key password srp id uniquely identifies blackberry enterprise server network blackberry enterprise server connects blackberry infrastructure must provide two pieces information connect open session blackberry enterprise server connected blackberry infrastructure another server attempts connect using srp id authentication key blackberry infrastructure drops connection blackberry enterprise server creates session newly connecting server multiple concurrent connections made srp id blackberry device attempts send message must include srp id blackberry enterprise server note service book menu blackberry device open desktop cmime service book specified unique identifier uid value srp id blackberry enterprise server blackberry device attempts send messages blackberry device sends message arrives blackberry infrastructure message contains srp id pulled service book uid value blackberry infrastructure uses information send message corresponding blackberry enterprise server decryption processing ref blackberry server trial mentioning technology | [
4469,
6871,
6966,
709,
4580,
2281,
4676,
3775,
3525,
2644,
1543,
1544,
3777,
7170,
1364,
7173,
7637,
2119,
6908,
5492,
3383,
2219,
3207,
3797,
3799,
5142,
7916,
2043,
3314,
3819,
3821,
7217,
7765,
2795,
5880,
3597
] | Train |
1,710 | 6 | Computer_file:computer file computer file computer resource recording data discretely computer storage device words written paper information written computer file files edited transferred internet particular computer system different types computer files designed different purposes file may designed store picture written message video computer program wide variety kinds data types files store several types information using computer programs person open read change save close computer file computer files may reopened modified copied arbitrary number times typically files organised file system keeps track files located disk enables user access word file derives latin filum thread file used context computer storage early january 1940 punched card methods scientific computation w.j eckert stated first extensive use early hollerith tabulator astronomy made comrie used building table successive differences adding large numbers harmonic terms tables functions constructed differences great efficiency either printed tables file punched cards february 1950 radio corporation america rca advertisement popular science magazine describing new memory vacuum tube developed rca stated results countless computations kept 'on file taken 'file exists 'memory tube developed rca laboratories electronically retains figures fed calculating machines holds storage memorizes new ones speeds intelligent solutions mazes mathematics 1952 file denoted inter alia information stored punched cards early use underlying hardware rather contents stored denominated file example ibm 350 disk drives denominated disk files introduction circa 1961 burroughs mcp mit compatible time-sharing system concept file system managed several virtual files one storage device origin contemporary denotation word although contemporary register file demonstrates early concept files use greatly decreased modern operating systems files organized one-dimensional arrays bytes format file defined content since file solely container data although platforms format usually indicated filename extension specifying rules bytes must organized interpreted meaningfully example bytes plain text file windows associated either ascii utf-8 characters bytes image video audio files interpreted otherwise file types also allocate bytes metadata allows file carry basic information file systems store arbitrary interpreted file system file-specific data outside file format linked file example extended attributes forks file systems done via sidecar files software-specific databases methods however susceptible loss metadata container archive file formats instant time file might size normally expressed number bytes indicates much storage associated file modern operating systems size non-negative whole number bytes system limit many older operating systems kept track number blocks tracks occupied file physical storage device systems software employed methods track exact byte count e.g. cp/m used special control character ctrl-z signal end text files general definition file require size real meaning however unless data within file happens correspond data within pool persistent storage special case zero byte file files newly created files yet data written may serve kind flag file system accidents results aborted disk operations example file link points typical unix-like system probably defined size seldom changes compare also file size may obscure information computer file consist smaller packets information often called records lines individually different share common traits example payroll file might contain information concerning employees company payroll details record payroll file concerns one employee records common trait related payroll—this similar placing payroll information specific filing cabinet office computer text file may contain lines text corresponding printed lines piece paper alternatively file may contain arbitrary binary image blob may contain executable way information grouped file entirely designed led plethora less standardized file structures imaginable purposes simplest complex computer files used computer programs create modify delete files use as-needed basis programmers create programs decide files needed used often names cases computer programs manipulate files made visible computer user example word-processing program user manipulates document files user personally names although content document file arranged format word-processing program understands user able choose name location file provide bulk information words text stored file many applications pack data files single file called archive file using internal markers discern different types information contained within benefits archive file lower number files easier transfer reduce storage usage organize outdated files archive file must often unpacked next using basic operations programs perform file files computer created moved modified grown shrunk deleted cases computer programs executed computer handle operations user computer also manipulate files necessary instance microsoft word files normally created modified microsoft word program response user commands user also move rename delete files directly using file manager program windows explorer windows computers command lines cli unix-like systems user space programs operate directly low level file kernel deals files handles user-space interaction files manner transparent user-space programs operating system provides level abstraction means interaction file user-space simply filename instead file descriptor example rm filename delete file link file many links file removed kernel considers file memory space free reallocated free space commonly considered security risk due existence file recovery software secure-deletion program uses kernel-space system functions wipe file data modern computer systems files typically accessed using names filenames operating systems name associated file others file anonymous pointed links names latter case user identify name link file false analogue especially exists one link file files links files located directories however generally directory contain either list files list links files within definition paramount importance term file includes directories permits existence directory hierarchies i.e. directories containing sub-directories name refers file within directory must typically unique words must identical names within directory however operating systems name may include specification type means directory contain identical name one type object directory file environments file named file name path file directory must uniquely identify among files computer system—no two files name path file anonymous named references exist within namespace cases name within namespace refer exactly zero one file however file may represented within namespace zero one names string characters may well-formed name file link depending upon context application whether name well-formed depends type computer system used early computers permitted letters digits name file modern computers allow long names 255 characters containing almost combination unicode letters unicode digits making easier understand purpose file glance computer systems allow file names contain spaces others case-sensitivity file names determined file system unix file systems usually case sensitive allow user-level applications create files whose names differ case characters microsoft windows supports multiple file systems different policies regarding case-sensitivity common fat file system multiple files whose names differ case user uses disk editor edit file names directory entries user applications however usually allow user create multiple files name differing case computers organize files hierarchies using folders directories catalogs concept irrespective terminology used folder contain arbitrary number files also contain folders folders referred subfolders subfolders contain still files folders thus building tree-like structure one master folder root folder — name varies one operating system another contain number levels folders files folders named files except root folder often name use folders makes easier organize files logical way computer allows use folders file folder name also path identifies folder folders file folder resides path sort special character—such slash—is used separate file folder names example illustration shown article path uniquely identifies file called folder called turn contained folder called folder file names separated slashes example topmost root folder name path begins slash root folder name would precede first slash many computer systems use extensions file names help identify contain also known file type windows computers extensions consist dot period end file name followed letters identify type file extension identifies text file extension identifies type document documentation commonly microsoft word file format even extensions used computer system degree computer system recognizes heeds vary systems required systems completely ignored presented many modern computer systems provide methods protecting files accidental deliberate damage computers allow multiple users implement file permissions control may may modify delete create files folders example given user may granted permission read file folder modify delete user may given permission read modify files folders execute permissions may also used allow certain users see contents file folder permissions protect unauthorized tampering destruction information files keep private information confidential unauthorized users another protection mechanism implemented many computers read-only flag flag turned file accomplished computer program human user file examined modified flag useful critical information must modified erased special files used internal parts computer system systems also include hidden flag make certain files invisible flag used computer system hide essential system files users alter file useful purpose must physical manifestation file abstract concept real computer system must real physical analogue exist physical terms computer files stored type data storage device example operating systems store files hard disk hard disks ubiquitous form non-volatile storage since early 1960s files contain temporary information may stored ram computer files also stored media cases magnetic tapes compact discs digital versatile discs zip drives usb flash drives etc use solid state drives also beginning rival hard disk drive unix-like operating systems many files associated physical storage device examples files directories virtual files exist objects within operating system kernel seen running user program files usually represented either file control block file handle file control block fcb area memory manipulated establish filename etc passed operating system parameter used older ibm operating systems early pc operating systems including cp/m early versions ms-dos file handle generally either opaque data type integer introduced around 1961 algol-based burroughs mcp running burroughs b5000 ubiquitous file said corrupted contents saved computer way ca n't properly read either human software depending extension damage original file sometimes recovered least partially understood file may created corrupt may corrupted later point overwriting many ways file become corrupted commonly issue happens process writing file disk example image-editing program unexpectedly crashes saving image file may corrupted program could n't save entirety program might warn user error allowing another attempt saving file examples reasons files become corrupted include although file corruption usually happens accidentally may also done purpose fool someone else thinking assignment ready earlier date potentially gaining time finish said assignment services provide demand file corruption essentially fill given file random data ca n't opened read yet still seems legitimate one effective countermeasures file corruption backing important files event important file becoming corrupted user simply replace backed version computer files contain information extremely important back-up process used protect disasters might destroy files backing files simply means making copies files separate location restored something happens computer deleted accidentally many ways back files computer systems provide utility programs assist back-up process become time-consuming many files safeguard files often copied removable media writable cds cartridge tapes copying files another hard disk computer protects failure one disk necessary protect failure destruction entire computer copies files must made media taken away computer stored safe distant location grandfather-father-son backup method automatically makes three back-ups grandfather file oldest copy file son current copy way computer organizes names stores manipulates files globally referred file system computers least one file system computers allow use several different file systems instance newer ms windows computers older fat-type file systems ms-dos old versions windows supported addition ntfs file system normal file system recent versions windows system advantages disadvantages standard fat allows eight-character file names plus three-character extension spaces example whereas ntfs allows much longer names contain spaces call file ntfs fat would restricted something like unless using vfat fat extension allowing long file names file manager programs utility programs allow users manipulate files directly allow move create delete rename files folders although actually allow read contents file store information every computer system provides least one file-manager program native file system example file explorer formerly windows explorer commonly used microsoft windows operating systems nautilus common several distributions linux | [
2181,
2547,
5022,
6088,
1835,
3626,
4685,
1471,
1104,
5401,
6117,
1114,
3984,
7199,
7564,
3990,
759,
1495,
765,
1127,
7213,
2248,
5783,
5784,
6857,
3336,
4739,
84,
5090,
1149,
5095,
6507,
5457,
7239,
4759,
6168,
6883,
1534,
2636,
5810,
... | Test |
1,711 | 7 | AppFolio:appfolio appfolio founded 2006 offers software-as-a-service saas applications vertical markets appfolio initially focused property management software acquisition mycase 2012 expanded law practice management industry company ’ headquarters goleta california united states also offices san diego california dallas texas appfolio established 2006 co-founders klaus schauser jon walker schauser previously founded expertcity company ’ first focus property management small-to-medium businesses first product appfolio property manager launched 2007 november 2012 appfolio acquired mycase legal practice management software provider appfolio purchased real estate software firm rentlinx april 2015 acquisition included rights website showmetherent.com expanded sphere appfolio ’ clients provided greater listing presence may 2015 appfolio announced ipo unveiled june raised 74 million 2019 appfolio acquired dynasty marketplace inc. leading provider advanced artificial intelligence ai solutions real estate market 2019 2018 2017 2016 2015 2014 | [] | Test |
1,712 | 3 | Aliens:_The_Computer_Game_(1987_video_game):aliens computer game 1987 video game aliens computer game also known aliens video game developed software studios published electric dreams software 1987 initially amstrad cpc commodore 64 zx spectrum based film title ports commodore 16 msx developed mr. micro published 1987 aliens computer game played first-person perspective set inside atmosphere processing plant maze complex consisting 255 rooms player encounters alien enemies throughout game upon killing alien body leaves deadly pool acid blood must avoided player also faces threat bio-mechanical growth left uncontained results new alien eggs facehugger enemies player ultimate goal reach room houses queen alien nests must destroyed player directly control team marine soldiers issue orders team mobile tactical operations bay mtob playing mtob player view team surroundings via video cameras attached soldier helmet according retro gamer game praised computing press zzap amstrad action sinclair user awarded 81 90 5/5 respectively crash gave score 84 one reviewer declaring best game-of-the-film date review zzap 64 also opined best tie-in game date good game boot computer gamer gave excellent game superb film overall score 80 commodore user gave 8 10 sinclair gave 9 10 1993 commodore force ranked game number 59 list top 100 commodore 64 games retro gamer retrospective darren jones opined despite incredible basic look aliens dripped atmosphere quite unlike movie conversion time bloody good first-person view used game perfectly matched moment film pumped-up marines start exploring deserted base game progressed managed capture terror confusion movie way titles managed magazine also declared scariest 8-bit game ever made stephen kleckner gamesbeat wrote may lack audio/visual punch gameplay tightly defined forward-thinking time also recommended windows fan remake aliens titled lv-426 | [
2120
] | Test |
1,713 | 3 | Computer_architecture_simulator:computer architecture simulator computer architecture simulator program simulates execution computer architecture computer architecture simulators used following purposes computer architecture simulators classified many different categories depending context full-system simulator execution-driven architecture simulation level detail complete software stacks real systems run simulator without modification full system simulator provides virtual hardware independent nature host computer full-system model typically includes processor cores peripheral devices memories interconnection buses network connections emulators full system simulators imitate obsolete hardware instead development hardware defining property full-system simulation compared instruction set simulator model allows real device drivers operating systems run single programs thus full-system simulation makes possible simulate individual computers networked computer nodes software network device drivers operating systems network stacks middleware servers application programs full system simulation speed system development process making easier detect recreate repair flaws use multi-core processors driving need full system simulation extremely difficult time-consuming recreate debug errors without controlled environment provided virtual hardware also allows software development take place hardware ready thus helping validate design decisions cycle-accurate simulator computer program simulates microarchitecture cycle-by-cycle basis contrast instruction set simulator simulates instruction set architecture usually faster cycle-accurate specific implementation architecture often used emulating older hardware time precisions important legacy reasons often cycle-accurate simulator used designing new microprocessorsthey tested benchmarked accurately including running full operating system compilers without actually building physical chip easily change design many times meet expected plan cycle-accurate simulators must ensure operations executed proper virtual real possible timebranch prediction cache misses fetches pipeline stalls thread context switching many subtle aspects microprocessors | [
1713,
6922,
3747,
5571,
7453,
5666,
2425
] | Test |
1,714 | 3 | Time_Gal:time gal time gal interactive movie video game developed published taito malone films originally released japan arcades 1985 action game uses full motion video fmv display on-screen action player must correctly choose on-screen character actions progress story pre-recorded animation game produced toei animation game set fictional future time travel possible protagonist reika travels different time periods search criminal luda time successfully tracking luda reika prevents plans alter past time gal inspired success earlier laserdisc video games notably 1983 title dragon lair also used pre-recorded animation game later ported sega cd worldwide release also laseractive japan home console versions received mixed reception time gal fmv-based game uses pre-recorded animation rather sprites display on-screen action gameplay divided levels referred time periods game begins 4001 ad theft time travel device thief luda steals device take world changing history reika protagonist also known time gal uses time travel device pursue travels different time periods 70,000,000 bc 44 bc 1588 ad 2010 ad search luda time period scenario presents series threats must avoided confronted successfully navigating sequences allows player progress another period player uses joystick button input commands though home versions use game controller directional pad game progresses visual cues—highlighted portions background foreground—will appear screen help survive dangers occur throughout stage difficult settings omit visual cues depending location cue player input one four directions left right attack shoot target laser gun inputting correct command either avoid neutralize threats progress game incorrect choices result character death reika dying many times results game specific moments game involve reika stopping time moments players presented list three options seven seconds choose one save character game uses laserdisc technology stream pre-recorded animation produced japanese studio toei animation game features raster graphics crt monitor amplified monaural sound reika physical appearance possibly derived either lum urusei yatsura yuri dirty pair several factors prevented overseas release decline popularity laserdisc arcade games mid-80s expensive price laserdisc technology difficulty translate original japanese release reika voiced yuriko yamamoto since original release arcades japan 1985 time gal ported different home formats first released exclusively japan nippon victor video high density format could played microsoft msx via sony laserdisc player release sega cd console 1991 spawned numerous games took advantage cd technology introduce interactive fmvs among new titles time gal one several older laserdisc-based games ported system renovation products acquired rights publish time gal sega cd wolf team handling development released along similar games part action-reaction series first released japan november 1992 north america europe next year macintosh version also released japan 1994 american press coverage japanese release prompted video game enthusiasts contact renovations western release number requests persuaded renovation president hide irie announce release usa addition dubbed english death scenes us version censored sega cd version uses smaller color palette original includes video gallery requires passwords view level animation sequences features new opening ending theme shinji tamura motoi sakuraba respectively time gal ported playstation 1996 compilation ninja hayate another laserdisc arcade game developed taito release lacks sega cd version additional content features accurate reproduction animation compilation also released sega saturn following year game also played pioneer laseractive via sega mega-ld module laseractive version rarest home release time gal well one expensive system among collectors april 1 2017 taito classics announced would release several older games onto mobile devices time gal first release game later released japan april 5 2017 ability use game navigational function ability see game original concept art acquired in-app purchases gamepro magazine noted japanese players ate first released japanese arcades however gamesetwatch todd ciolek believed released late life laserdisc games players getting tired genre gameplay commented despite gameplay unique charming gamepro reviewer referred arcade game lost laserdisc treasure enthusiastic sega cd release called death sequences hilarious felt reduced tediousness dying mega magazine rated sega cd version number five cd game commenting though lacked difficulty good showcase system prior sega cd release electronic gaming monthly praised use cd technology felt would followed titles similar gameplay critics praised time gal visuals gamefan magazine praising wolfteam port game complimented sega cd version graphics short load times gamepro said animation great bright vivid colors fast-paced exciting movement praised funny gameplay nonstop action chris bieniek videogames computer entertainment criticized story nonsensical said unlockable video gallery nice feature effectively eliminates replay value compounds easiness game give low longevity nonetheless recommended time gal based chiefly gameplay though never really feel like 're control time gal movements zany action undeniable appeal takes lot slack shawn sackenheim allgame complimented animation calling high quality criticized sega cd graphics calling downgraded commented though time gal offered good thrill lacked replay value ciolek echoed similar statements saying enjoyable watch play commented game frustrating rigid compared contemporary standards electronic gaming monthly group reviewers praised sega cd version graphics quality three four reviewers lauded gameplay specifically challenge format reviewer stated n't care type game referring gameplay nothing memorizing author masaru takeuchi attributes origin quick time event game mechanic laserdisc games like dragon lair time gal ign levi buchanan listed fmv games like time gal one reasons behind sega cd commercial failure citing waste system capabilities ciolek referred protagonist one first human heroines industry added reika appealing lead character taito could easily turned mascot featured games media character later included alfa system shooting game castle shikigami iii —taito published arcade version japan game reika features similar attacks personality character visual design updated reika recent appearance elevator action remake elevator action deluxe one free taito dlcs | [
1338,
1946
] | Validation |
1,715 | 4 | XRY_(software):xry software xry digital forensics mobile device forensics product swedish company micro systemation used analyze recover information mobile devices mobile phones smartphones gps navigation tools tablet computers consists hardware device connect phones pc software extract data xry designed recover contents device forensic manner contents data relied upon user typically used civil/criminal investigations intelligence operations data compliance electronic discovery cases software available law enforcement military intelligence agencies become well known digital forensics community one common tools type work many complex challenges examining mobile phones comparison forensic examination normal computers many mobile phones proprietary operating systems makes reverse engineering devices complex operation speed mobile device market also means many new devices manufactured regular basis mobile forensics tool must deal issues suitable task xry system allows logical examinations direct communication device operating system also physical examinations bypassing operating system dumping available memory whilst logical recovery data generally better supported devices physical examination offers ability recover deleted information sms text messages images call records etc complexities topic specialist training usually recommended operate software latest versions include support recover data smartphone apps android iphone blackberry devices data recovered xry used successfully various court systems around world xry tested number different government organizations suitable needs worldwide use | [
3517,
3179,
2195,
5561,
4316,
3700,
7825,
7181,
6020,
1756,
5150,
4523,
7105,
3823,
5254,
6488,
1899,
8148
] | Test |
1,716 | 9 | The_Art_of_the_Metaobject_Protocol:art metaobject protocol art metaobject protocol amop 1991 book gregor kiczales jim des rivieres daniel g. bobrow three working xerox parc subject metaobject protocol book contains explanation metaobject protocol desirable de facto standard metaobject protocol supported many common lisp implementations extension common lisp object system clos complete portable implementation clos metaobject protocol defined book provided xerox parc portable common loops book presents simplified clos implementation common lisp called closette sake pedagogical brevity include complex exotic clos features forward-referencing superclasses full class method redefinitions advanced user-defined method combinations complete integration clos classes common lisp type system also lacks support compilation error checking since purpose closette actual use simply demonstrate fundamental power expressive flexibility metaobject protocols application principles metacircular evaluator 1997 talk oopsla alan kay called best book anybody written ten years contended contained profound insights practical insights oop dismayed written highly lisp-centric clos-specific fashion calling hard book people read n't know lisp culture hard read | [
6876,
1445,
6888,
2915,
6352,
3370,
3788,
6191,
4332,
4878,
5494,
5757,
6116,
3212,
7750,
6210,
1116,
3895,
6471,
940,
1676,
4535,
5077,
4543,
2249,
1890,
6949,
1803,
3250,
360
] | Test |
1,717 | 2 | Clock_(software):clock software clock mobile app included iphone since iphone os 1 ipad since ios 6 app world clock alarms stopwatch timer tabs ios 10 bedtime tab added world clock section allows user access temperature time pressure major cities choice user add new cities tapping plus icon top screen typing name city user wants add user also remove cities swiping left clicking delete button alarms section allows user view alarms week view create new alarms turn existing alarms stopwatch section allows user ability time events see long take app also allows user pause reset use stopwatch lap feature timer section allows user set timer count specific time timer reaches zero alarm sounded ios 10 later versions bedtime feature allows user get better sleep done determining user would like wake many days alarm go many hours sleep user would like whether user would want bedtime notification feature also integrates health application track sleep data since ios 7 app icon shows user current time since ios 10 interface dark theme new stopwatch face accessed swiping left | [
6788,
3940,
7890,
4320,
2926,
4690,
734,
5752,
6125,
2954,
1123,
6847,
6142,
2609,
1895,
5091,
4749,
7601,
2284,
1940,
2300,
3025,
2665,
2327,
6565,
2331,
3050,
4820,
6582,
1234,
5189,
889,
2368,
552,
7335,
3445,
3107,
5571,
5579,
1654,
... | Test |
1,718 | 0 | Natural-language_generation:natural-language generation natural-language generation nlg software process transforms structured data natural language used produce long form content organizations automate custom reports well produce custom content web mobile application also used generate short blurbs text interactive conversations chatbot might even read loud text-to-speech system automated nlg compared process humans use turn ideas writing speech psycholinguists prefer term language production process also described mathematical terms modeled computer psychological research nlg systems also compared translators artificial computer languages decompilers transpilers also produce human-readable code generated intermediate representation human languages tend considerably complex allow much ambiguity variety expression programming languages makes nlg challenging nlg may viewed opposite natural-language understanding whereas natural-language understanding system needs disambiguate input sentence produce machine representation language nlg system needs make decisions put concept words practical considerations building nlu vs. nlg systems symmetrical nlu needs deal ambiguous erroneous user input whereas ideas system wants express nlg generally known precisely nlg needs choose specific self-consistent textual representation many potential representations whereas nlu generally tries produce single normalized representation idea expressed nlg existed long time commercial nlg technology recently become widely available nlg techniques range simple template-based systems like mail merge generates form letters systems complex understanding human grammar nlg also accomplished training statistical model using machine learning typically large corpus human-written texts pollen forecast scotland system simple example simple nlg system could essentially template system takes input six numbers give predicted pollen levels different parts scotland numbers system generates short textual summary pollen levels output example using historical data july 1 2005 software produces grass pollen levels friday increased moderate high levels yesterday values around 6 7 across parts country however northern areas pollen levels moderate values 4 contrast actual forecast written human meteorologist data pollen counts expected remain high level 6 scotland even level 7 south east relief northern isles far northeast mainland scotland medium levels pollen count comparing two illustrates choices nlg systems must make discussed process generate text simple keeping list canned text copied pasted possibly linked glue text results may satisfactory simple domains horoscope machines generators personalised business letters however sophisticated nlg system needs include stages planning merging information enable generation text looks natural become repetitive typical stages natural-language generation proposed dale reiter content determination deciding information mention text instance pollen example deciding whether explicitly mention pollen level 7 south east document structuring overall organisation information convey example deciding describe areas high pollen levels first instead areas low pollen levels aggregation merging similar sentences improve readability naturalness instance merging two following sentences following single sentence lexical choice putting words concepts example deciding whether medium moderate used describing pollen level 4 referring expression generation creating referring expressions identify objects regions example deciding use northern isles far northeast mainland scotland refer certain region scotland task also includes making decisions pronouns types anaphora realization creating actual text correct according rules syntax morphology orthography example using future tense alternative approach nlg use end-to-end machine learning build system without separate stages words build nlg system training machine learning algorithm often lstm large data set input data corresponding human-written output texts end-to-end approach perhaps successful image captioning automatically generating textual caption image popular media paid attention nlg systems generate jokes see computational humor commercial perspective successful nlg applications data-to-text systems generate textual summaries databases data sets systems usually perform data analysis well text generation research shown textual summaries effective graphs visuals decision support computer-generated texts superior reader perspective human-written texts first commercial data-to-text systems produced weather forecasts weather data earliest system deployed fog used environment canada generate weather forecasts french english early 1990s success fog triggered work research commercial recent applications include uk met office text-enhanced forecast currently considerable commercial interest using nlg summarise financial business data indeed gartner said nlg become standard feature 90 modern bi analytics platforms nlg also used commercially automated journalism chatbots generating product descriptions e-commerce sites summarising medical records enhancing accessibility example describing graphs data sets blind people example interactive use nlg wysiwym framework stands see meant allows users see manipulate continuously rendered view nlg output underlying formal language document nlg input thereby editing formal language without learning content generation systems assist human writers makes writing process efficient effective content generation tool based web mining using search engines apis built tool imitates cut-and-paste writing scenario writer forms content various search results relevance verification essential filter irrelevant search results based matching parse tree query parse trees candidate answers alternative approach high-level structure human-authored text used automatically build template new topic automatically written wikipedia article several companies started since 2009 build systems transform data narrative using nlg ai techniques include narrative science phrasetech arria nlg automated insights retresco visual nlg yseop united robots scientific fields nlg researchers need test well systems modules algorithms work called evaluation three basic techniques evaluating nlg systems ultimate goal useful nlg systems helping people first techniques however task-based evaluations time-consuming expensive difficult carry especially require subjects specialised expertise doctors hence areas nlp task-based evaluations exception norm recently researchers assessing well human-ratings metrics correlate predict task-based evaluations work conducted context generation challenges shared-task events initial results suggest human ratings much better metrics regard words human ratings usually predict task-effectiveness least degree although exceptions ratings produced metrics often predict task-effectiveness well results preliminary case human ratings popular evaluation technique nlg contrast machine translation metrics widely used | [
3601,
886,
1718,
7422,
1444,
4760,
8065,
715,
1927,
2648,
5218,
5304,
3292,
2215,
1751,
6283,
6732,
7372,
4337,
3651,
2590,
4349,
7474,
8046,
7397,
6138,
4089,
1314,
7578,
5429,
3742,
2884,
5782,
5528,
5612,
5971,
7138,
5885,
5008
] | Test |
1,719 | 2 | Accelerator_(software):accelerator software accelerator collection development solutions ibm windows platforms using .net framework and/or lansa technologies provided surround technologies accelerator development architecture tool building windows web apps within structured framework intent accelerator solutions provide rapid application development rad environment produces well-designed n-tier code run client/server web mobile deployment use microsoft ’ .net framework recommended surround zero-lock development optimal deployment flexibility including windows presentation foundation wpf responsive web mobile design asp.net mvc bootstrap clients accelerator uses customizable templates standards naming conventions generate code generated code human readable standardized minimize testing debugging customization future maintenance efforts generated code follows object-oriented programming design principles inversion control ioc pattern observer pattern model–view–viewmodel mvvm oo techniques avoid redundancy promote ease testing maintenance supports asp.net mvc3 framework patterns followed architecture adapted depending case flexibility promoted typical use abstraction patterns practical abstraction promoted though use windows presentation foundation windows communication foundation accelerator core system architecture provides base set functionality wizard-driven code generation implementation accelerator architecture supports service-oriented architecture includes built-in features like business objects frameworks bus interfaces plug-ins xml dashboards wizards simplify deployment accelerator business objects services implements framework consists server-side business objects presentation data service buses service adapters service-oriented architecture integrates adapters xml soap rest activex .net xaml/wpf etc soa bos functions ibm windows lansa – virtually server | [
930,
2866,
6991,
2530,
7315
] | Test |
1,720 | 9 | Renjin:renjin renjin implementation r programming language atop java virtual machine free software released gpl renjin tightly integrated java allow embedding interpreter java application full two-way access java r code renjin development primarily supported bedatadriven ultimately made possible several current past contributors including mehmet hakan satman hannes mühleisen ruslan shevchenko renjin roots lie abortive 2010 attempt compile gnu r interpreter jvm via nestedvm toolchain involves cross-compiling c fortran code static mips binary nestedvm translate jvm bytecode proved challenging gnu r grown rely heavily dynamic linking best c standard library implementation available time mips architecture newlib fully compatible gnu c library gnu r developed experience r4jvm project provided bedatadriven team depth look gnu r codebase convinced new implementation written java feasible undertaking development renjin began october 2010 rapidly resulted functional minimal interpreter r language | [
4070,
3915,
5571
] | Test |
1,721 | 4 | Windows_Live_OneCare_Safety_Scanner:windows live onecare safety scanner windows live onecare safety scanner formerly windows live safety center codenamed vegas online scanning pc cleanup diagnosis service help remove viruses spyware/adware malware free web service part windows live november 18 2008 microsoft announced discontinuation windows live onecare offering users new free anti-malware suite microsoft security essentials available since second half 2009 however windows live onecare safety scanner branding windows live onecare discontinued time service officially discontinued april 15 2011 replaced microsoft safety scanner windows live onecare safety scanner offered free online scanning protection threats windows live onecare safety scanner must downloaded installed computer scan computer full service scan looks common pc health issues viruses temporary files open network ports searches removes viruses improves computer performance removes unnecessary clutter pc hard disk user choose full scan customized quick scan full scan scans viruses comprehensive scan quick scan hard disk performance disk fragmentation scan and/or desk cleanup scan network safety open port scan quick scan scans viruses specific areas computer quick scan faster full scan hence appellation service also provides virus database information online threats general computer security documentation tools virus scanner windows live onecare safety scanner site runs scan user computer site visited run periodic scans system provide features prevent viruses infecting computer time thereafter simply resolves detected infections many users posted product feedback forum report script errors relating internet explorer 7 besides ie browser supported service onecare safety scanner team actively solving problems many registry-related | [
1620,
3962,
5571,
5227,
3551,
7564,
6762,
2784,
2885,
7682,
7867,
179
] | Validation |
1,722 | 4 | Vulnerability_database:vulnerability database vulnerability database platform aimed collecting maintaining disseminating information discovered computer security vulnerabilities database customarily describe identified vulnerability assess potential impact affected systems workarounds updates mitigate issue hacker surmount system information assurance three elements must apply susceptibility within system access susceptibility ability exploit susceptibility major vulnerability databases iss x-force database symantec securityfocus bid database open source vulnerability database osvdb osvdb shut april 2016 paid service vulndb took place aggregate broad range publicly disclosed vulnerabilities including common vulnerabilities exposures cve primary purpose cve run mitre attempt aggregate public vulnerabilities give standardized format unique identifier many vulnerability databases develop received intelligence cve investigate providing vulnerability risk scores impact ratings requisite workaround past cve paramount linking vulnerability databases critical patches debugs shared inhibit hackers accessing sensitive information private systems national vulnerability database nvd run national institute standards technology nist operated separately mitre-run cve database includes vulnerability information cve nvd serves enhancement data providing common vulnerability scoring system cvss risk scoring common platform enumeration cpe data open source vulnerability database provides accurate technical unbiased index vulnerability security comprehensive database cataloged 121,000 vulnerabilities spanning 113-year period osvdb founded august 2002 launched march 2004 primitive beginning newly identified vulnerabilities investigated site members explanations detailed website however necessity service thrived need dedicated staff resulted inception open security foundation osf founded non-profit organisation 2005 provide funding security projects primarily osvdb u.s. national vulnerability database comprehensive cyber security vulnerability database formed 2005 reports cve nvd primary cyber security referral tool individuals industries alike providing informative resources current vulnerabilities nvd holds excess 50,000 records publishes 13 new entries daily average similar osvdb nvd publishes impact ratings categorises material index provide users intelligible search system variety commercial companies also maintain vulnerability databases offering customers services deliver new updated vulnerability data machine-readable format well web portals examples include symantec deepsight portal vulnerability datafeed secunia purchased flexera vulnerability manager accenture vulnerability intelligence service formerly idefense vulnerability databases advise organisations develop prioritize execute patches mitigations endeavour rectify critical vulnerabilities however often lead creation additional susceptibilities patches created hastily thwart system exploitations violations depending upon level user organisation warrant appropriate access vulnerability database provides user disclosure known vulnerabilities may affect justification limiting access individuals impede hackers versed corporation system vulnerabilities could potentially exploited vulnerability databases contain vast array identified vulnerabilities however organisations possess expertise staff time revise remedy potential system susceptibilities hence vulnerability scoring method quantitatively determining severity system violation multitude scoring methods exist across vulnerability databases us-cert sans institute critical vulnerability analysis scale common vulnerability scoring system cvss prevailing technique vulnerability databases including osvdb vfeed nvd cvss based upon three primary metrics base temporal environmental provide vulnerability rating metric covers immutable properties vulnerability potential impact exposure confidential information accessibility information aftermath irretrievable deletion information temporal metrics denote mutable nature vulnerability example credibility exploitability current state system violation development workarounds could applied aspect cvss rates potential loss individuals organisations vulnerability furthermore details primary target vulnerability ranging personal systems large organisations number potentially affected individuals complication utilising different scoring systems consensus severity vulnerability thus different organisations may overlook critical system exploitations key benefit standardised scoring system like cvss published vulnerability scores assessed pursued remedied rapidly organisations individuals alike determine personal impact vulnerability system benefits derived vulnerability databases consumers organisations exponential information systems become increasingly embedded dependency reliance grows opportunity data exploitation although functionality database may appear unblemished without rigorous testing exiguous flaws allow hackers infiltrate system cyber security frequently databases published without stringent security controls hence sensitive material easily accessible database attacks recurrent form cyber security breaches recorded vulnerability databases sql nosql injections penetrate traditional information systems big data platforms respectively interpolate malicious statements allowing hackers unregulated system access established databases ordinarily fail implement crucial patches suggested vulnerability databases due excessive workload necessity exhaustive trialling ensure patches update defective system vulnerability database operators concentrate efforts major system deficiencies offers hackers unmitigated system access neglected patches databases require audit tracks record data amended accessed systems created without necessary auditing system exploitation system vulnerabilities challenging identify resolve vulnerability databases promulgate significance audit tracking deterrent cyber attacks data protection essential business personal financial information key asset purloining sensitive material discredit reputation firm implementation data protection strategies imperative guard confidential information hold view initial apathy software designers turn necessitates existence vulnerability databases systems devised greater diligence may impenetrable sql nosql injections making vulnerability databases redundant | [
1708,
3932,
5960,
3265,
5616,
5972,
2875,
404
] | Validation |
1,723 | 2 | Listaller:listaller listaller free computer software installation system similar package management system aimed making simple create package installed linux distributions well providing tools api make software management linux user-friendly listaller started december 2007 freedesktop.org developer matthias klumpp experimental project explore possibility writing universal user interface manage kinds linux software matter installed therefore listaller backends manage autopackage loki mojo native distribution packages original project provided one user interface manage kinds installed software interaction native distribution package management done via abstraction layer later replaced packagekit listaller also provided cross-distribution software installation format made easier create packages run multiple distributions installer part listaller also able assist installing autopackage packages first versions written object pascal although project started experiment soon evolved competitor autopackage mojo 2011 listaller never made stable release announcement appstream lot original listaller goals would achieved author decided change listaller away full software manager software installer joined forces appstream project pascal considered ideal language collaborate projects project already spent much time developing pascal bindings third-party libraries listaller rewritten vala subset original features main goal provide seamless integration appstream packagekit therefore universal software manager part removed project focuses creating cross-distro format distribution binary linux software nov 10 2014 matthias announced limba project limba supposed listaller next version listaller intended used installing binary pre-compiled versions non-core applications word processors web browsers personal computer games rather core libraries applications operating system shells listaller intended provide support installing system libraries security reasons listaller using package format so-called ipk packages short installation package lzma-compressed signed tarballs ipk packages contain small configuration files modify setup process provide logic scripts run install time parts setup process handled listaller built-in routines make possible distributors modify setup process 3rd-party applications comply policy necessary key value listaller integration desktop environments existing package management tools distributions therefore project provides several integration components default make possible manage listaller-installed 3rd-party applications software manager supports packagekit and/or appstream time discussed run installed 3rd-party tools sandbox default programs use listaller must also relocatable meaning must installable varying directories single binary makes possible listaller install software non-root users home directory although method enabled explicitly use encouraged listaller developer tools provide tools documentation application developers make software relocatable august 2010 projects announced merge consequence merge autopackage abandoned package binary package format user interfaces install autopackage packages autopackage tools like binreloc create relocatable applications apbuild developed part listaller project reason merging autopackage listaller mainly great lack developers projects decided join forces kde provides support listaller apper although distributors need explicitly enable using compile-time switch support gnome currently developed part gnome-packagekit suite theory distribution run packagekit 0.8.6 able provide listaller support ubuntu announced use listaller 3rd-party installer ubuntu phone develop ubuntu-specific solution instead | [
8055,
1621,
2091,
5200,
5017,
5545,
1260,
4675,
5912,
3366,
5480,
4778,
5571,
578,
2034,
4603,
7092,
2581,
7555,
6743,
3559,
1406,
6663,
4991,
3495,
5530,
781,
1989,
7042,
1435
] | Test |
1,724 | 2 | Nokia_E50:nokia e50 nokia e50 business device bar-style monoblock quad-band smartphone nokia announced 18 may 2006 part eseries intended primarily corporate business market includes sophisticated e-mail support nokia ’ intellisync wireless email blackberry connect visto mobile activesync mail exchange altexia well imap4 also ability view microsoft word powerpoint excel attachments pdf documents used editing without additional apps application manager downloads removes installs nokia third-party applications device device synchronization possible data transfer application features include edge bluetooth 2.0 1,280 × 960 pixels 1.3-megapixel camera microsd memory-card slot digital music video player functionality realplayer flash player unit support umts wi-fi fm radio uses third edition series 60 user-interface s60v3 symbian operating system version 9.1 binary compatible software compiled earlier versions symbian operating system check firmware v 07.36.0.0 | [
1066,
5979,
2271,
3082,
6517,
372,
7521,
3615,
1453,
4935,
3694,
3524,
3952,
472,
5909,
8072,
1544,
2922,
4407,
118,
23,
2564,
3703,
7261,
7545,
5044,
5493,
740,
1202,
5315,
3029,
5499,
7012,
139,
6465,
5062,
3039,
3653,
1582,
4894,
506... | Test |
1,725 | 4 | SciEngines_GmbH:sciengines gmbh sciengines gmbh privately owned company founded 2007 spin-off copacobana project universities bochum kiel germany project intended create platform affordable custom hardware attack copacobana massively-parallel reconfigurable computer utilized perform so-called brute force attack recover des encrypted data consists 120 commercially available reconfigurable integrated circuits fpgas xilinx spartan3-1000 run parallel create massively parallel system since 2007 sciengines gmbh enhanced developed successors copacobana furthermore copacobana become well known reference platform cryptanalysis custom hardware based attacks symmetric asymmetric cyphers stream ciphers 2008 attacks a5/1 stream cipher encryption system used encrypt voice streams gsm published first known real world attack utilizing off-the-shelf custom hardware introduced 2008 rivyera s3-5000 enhancing performance computer dramatically via using 128 spartan-3 5000 currently sciengines rivyera holds record brute-force breaking des utilizing 128 spartan-3 5000 fpgas current systems provide unique density 256 spartan-6 fpgas per single system enabling scientific utilization beyond field cryptanalysis like bioinformatics providing standard off-the-shelf intel cpu mainboard integrated fpga computer rivyera systems allow execute standard code without modifications sciengines aims programmers focus porting time consuming 5 code fpga therefore bundle eclipse like development environment allows code implementation hardware based implementation languages e.g vhdl verilog well c based languages application programming interface c c++ java fortran allow scientists programmers adopt code benefit application-specific hardware architecture | [
2861,
2659,
7777,
2803,
1435
] | Test |
1,726 | 4 | Nuix:nuix nuix pty ltd australian technology company produces software platform indexing searching analyzing extracting knowledge unstructured data applications include digital investigation cybersecurity e-discovery information governance email migration privacy january 2017 software platform reportedly used least 1800 customers 65 countries company headquarters sydney australia offices conshohocken herndon san francisco new york united states cork ireland london united kingdom nuix founded 2000 goal make vast quantities unstructured data easily searchable 2006 company grew two developers 400 employees 2010 nuix awarded five-year contract securities exchange commission 2014 company appointed industry partner international multilateral partnership cyber threats 2017 nuix board directors appointed rod vawdrey position chief executive officer nuix markets ediscovery digital investigation security intelligence information governance solutions based nuix engine nuix engine combines load balancing fault tolerance processing technologies provide insights large volumes unstructured semi-structured structured data several features nuix engine granted patent 2011 november 2016 nuix announced new analysis platform called nuix insight analytics intelligence endpoint security product nuix insight adaptive security integrates cybersecurity threat prevention detection response remediation deception nuix donated software licences training international consortium investigative journalists icij used nuix investigate offshore leaks data süddeutsche zeitung icij also used analyze panama papers using nuix software panama papers investigation team made 2.6 terabytes scanned documents text-searchable extracted metadata helped journalists cross-reference people places business entities across documents october 2015 nuix reported raised 250,000 room read philanthropic product proof finder nuix largest shareholder macquarie group shareholding approximately 70 | [
1998,
8014
] | Validation |
1,727 | 3 | Advanced_Computing_Environment:advanced computing environment advanced computing environment ace defined industry consortium early 1990s next generation commodity computing platform successor personal computers based intel 32-bit instruction set architecture effort found little support market dissolved due lack sales infighting within group consortium announced 9th april 1991 compaq microsoft mips computer systems digital equipment corporation santa cruz operation time widely believed risc-based systems would maintain price/performance advantage ad hoc wintel systems however also widely believed windows nt would quickly displace many operating systems combined effects wide selection software ease building wintel machines supported ace formed provide alternative platform wintel providing viable alternative advantages terms software support greater advantages terms performance environment standardized mips architecture two operating systems sco unix open desktop would become windows nt originally named os/2 3.0 advanced risc computing arc document produced give hardware firmware specifications platform members consortium included acer control data corporation kubota nec corporation nkk olivetti prime computer pyramid technology siemens silicon graphics sony sumitomo tandem computers wang laboratories zenith data systems besides large companies several start-up companies built ace-compliant systems well companies involved reasons joining ace effort initiative used microprocessor companies attempt take market share away intel system companies used initiative attempt take market share away workstation leader sun microsystems soon initiative announced dissenting faction seven ace members declared decision support little-endian architectures short-sighted subgroup known apache group promoted big-endian alternative group whose name conceived pun big indian unrelated later apache software foundation later adopted name mips/open rift within ace consortium averted decided add support big-endian svr4 even ace initiative consortium began fall apart little year started became apparent mass market alternative wintel computing platform upstart platforms offer enough performance improvement incumbent pc major cost disadvantages systems due low volume production initiative started risc based systems running 100-200 mhz time substantial performance advantage intel 80486 original pentium chips running approximately 60 mhz time intel quickly migrated pentium design newer semiconductor process generations performance operating frequency advantage slipped away compaq first company leave consortium stating departure ceo rod canion one primary backers behind formation ace shifting priorities away higher-end systems followed short order sco announcing suspending work moving version unix mips platform potential conflicts earlier year mips purchased sgi may also contributed concerns neutrality target platform dec released alpha processor less interested promoting competing architecture finally significant improvements intel x86 performance made abandoning less attractive although ace supported x86 time intel never member main product ace group advanced risc computing specification arc initially based mips-based computer hardware firmware environment although ace went defunct computer ever manufactured fully complied arc standard arc system still exerts widespread legacy microsoft windows nt-based operating systems windows xp used arc conventions naming boot devices windows vista sgi used modified version arc firmware calls arcs systems sgi computers run irix 6.1 later indy octane etc boot arcs console uses drive naming conventions windows accordingly addition various risc-based computers designed run windows nt used versions arc boot console boot nt among computers also predicted intel ia-32-based computers would adopt arc console although sgi ever marketed ia-32-based machines arc firmware namely sgi visual workstation series went sale 1999 products complying degree arc standard include | [
2983,
5104,
6256,
1452,
6784,
4859,
5571,
4959,
1992,
5055,
7010,
1112,
2226,
4799,
3567,
4816,
2792,
2699,
4370,
4099,
352
] | Test |
1,728 | 1 | IFIS_Publishing:ifis publishing ifis academic publishing company not-for-profit organisation operating sciences regulations food health based reading ifis produces online bibliographic databases fsta resource company offered since 1969 along escalex launched 2017 fsta food science technology abstracts includes 1.4 million scientific non-predatory records trusted sources related disciplines surrounding food beverages ifis also produces association wiley blackwell dictionary food science technology second edition not-for-profit charitable organisation ifis offers access researchers developing countries research4life programmes hinari agora escalex created collaboration molecular connections launched april 2017 allows search retrieval food beverage food law information various geographies across globe originally known international food information service ifis established 1968 collaboration four organisations company originally based lane end house shinfield though recently moved granary bridge farm arborfield fsta bibliographic abstracting indexing database scientific technological information relating food beverages nutrition contains 1.3 million indexed records full-text links available covering 5,475 active historical journals books trade publications reviews conference proceedings reports patents standards database updated weekly records indexed ifis thesaurus containing 12,346 food science keywords curated structured hierarchies resource used researchers industry practitioners students contains information sources 29 languages sourced publishers 60 countries coverage includes major commodities food beverage industry related applied pure sciences pet foods food psychology food economics food safety fsta accessed ebscohost ovid proquest dialog stn web science | [] | Validation |
1,729 | 3 | Socket_479:socket 479 socket 479 mpga479m cpu socket intel pentium celeron mobile processors normally used laptops also used tualatin-m pentium iii processors official naming intel µfcpga µpga479m exist multiple electrically incompatible mechanically compatible processor families available pga packages using socket variants thereof even intel cpu specifications seem clear enough distinction instead use package/socket designations pga478 ppga478 1 sockets perhaps adding yet confusion pga-based cpus also available bga precisely µbga even µfcbga package 479 contacts balls populated cpu variants intel cpu specifications use designations bga479 pbga479 h-pbga479 however pointed designations denote rather cpu package socket bga variants use intended directly soldered mainboard e.g embedded system non-bga counterparts cpus use one mentioned sockets socket 479 socket 479 479 pin holes pentium processors pga package 479 pins plug zero insertion force socket 478 pins electrically connected b2 reserved depopulated micro-fcpga package although electrically mechanically similar socket 478 one pin less making impossible use pentium processor 478 board reason manufacturers like asus made drop-in boards e.g ct-479 allow use socket 479 processors chipsets employ socket pentium intel 855gm/gme/pm intel 915gm/gms/pm intel 855gme chipset supports pentium cpu intel 855gm chipset officially support 90 nm 2mb l2 cache dothan core models even though works works 400fsb 3rd party/user able overclock fsb 855gm/gme/pm support 533fsb dothan core difference 855gm chipset graphics core runs 200 mhz 855gme runs 250 mhz 2006 intel released successor socket 479 revised pinout core processor called socket m. socket placement one pin changed pentium version socket 479 socket processors physically fit socket 479 electrically incompatible versions socket479 except using ati north bridge rc415md socket supports 667 mt/s fsb intel 945pm/945gm chipsets | [
2541,
4123,
3849,
6173,
2828,
7974,
2830,
3002,
4314,
5379,
3193,
1841,
1645,
3203,
4968,
3385,
4972,
5853,
2685,
6935,
8021,
7302,
5963,
866,
3333,
7134,
262,
2351,
6683,
5886
] | Test |
1,730 | 1 | Database_index:database index database index data structure improves speed data retrieval operations database table cost additional writes storage space maintain index data structure indexes used quickly locate data without search every row database table every time database table accessed indexes created using one columns database table providing basis rapid random lookups efficient access ordered records index copy selected columns data table searched efficiently also includes low-level disk block address direct link complete row data copied databases extend power indexing letting developers create indexes functions expressions example index could created upper last_name would store upper-case versions codice_1 field index another option sometimes supported use partial indices index entries created records satisfy conditional expression aspect flexibility permit indexing user-defined functions well expressions formed assortment built-in functions database software includes indexing technology enables sub-linear time lookup improve performance linear search inefficient large databases suppose database contains n data items one must retrieved based value one fields simple implementation retrieves examines item according test one matching item stop finds single item multiple matches must test everything means number operations worst case n linear time since databases may contain many objects since lookup common operation often desirable improve performance index data structure improves performance lookup many different used purpose complex design trade-offs involving lookup performance index size index-update performance many index designs exhibit logarithmic log n lookup performance applications possible achieve flat 1 performance indexes used police database constraints unique exclusion primary key foreign key index may declared unique creates implicit constraint underlying table database systems usually implicitly create index set columns declared primary key capable using already-existing index police constraint many database systems require referencing referenced sets columns foreign key constraint indexed thus improving performance inserts updates deletes tables participating constraint database systems support exclusion constraint ensures newly inserted updated record certain predicate holds record used implement unique constraint equality predicate complex constraints like ensuring overlapping time ranges intersecting geometry objects would stored table index supporting fast searching records satisfying predicate required police constraint data present arbitrary order logical ordering specified index data rows may spread throughout table regardless value indexed column expression non-clustered index tree contains index keys sorted order leaf level index containing pointer record page row number data page page-organized engines row offset file-organized engines non-clustered index one non-clustered index database table clustering alters data block certain distinct order match index resulting row data stored order therefore one clustered index created given database table clustered indices greatly increase overall speed retrieval usually data accessed sequentially reverse order clustered index range items selected since physical records sort order disk next row item sequence immediately last one fewer data block reads required primary feature clustered index therefore ordering physical data rows accordance index blocks point databases separate data index blocks separate files others put two completely different data blocks within physical file multiple databases multiple tables joined referred cluster confused clustered index described records tables sharing value cluster key shall stored together nearby data blocks may improve joins tables cluster key since matching records stored together less i/o required locate cluster configuration defines data layout tables parts cluster cluster keyed b-tree index hash table data block table record stored defined value cluster key order index definition defines columns important possible retrieve set row identifiers using first indexed column however possible efficient databases retrieve set row identifiers using second greater indexed column example imagine phone book organized city first last name first name given city easily extract list phone numbers city however phone book would tedious find phone numbers given last name would look within city section entries last name databases others ’ use index phone book example composite index created columns codice_2 search giving exact values three fields search time minimal—but provide values codice_3 codice_4 search uses codice_3 field retrieve matched records sequential lookup checks matching codice_4 improve performance one must ensure index created order search columns indexes useful many applications come limitations consider following sql statement codice_7 process statement without index database software must look last_name column every row table known full table scan index database simply follows b-tree data structure smith entry found much less computationally expensive full table scan consider sql statement codice_8 query would yield email address every customer whose email address ends wikipedia.org even email_address column indexed database must perform full index scan index built assumption words go left right wildcard beginning search-term database software unable use underlying b-tree data structure words where-clause sargable problem solved addition another index created codice_9 sql query like codice_10 puts wild-card right-most part query gro.aidepikiw index reverse email_address satisfy wildcard characters used sides search word wikipedia.org index available field used rather sequential search performed takes n time bitmap index special kind indexing stores bulk data bit arrays bitmaps answers queries performing bitwise logical operations bitmaps commonly used indexes b+ trees efficient values index repeat repeat small number times contrast bitmap index designed cases values variable repeat frequently example sex field customer database usually contains three distinct values male female unknown recorded variables bitmap index significant performance advantage commonly used trees dense index databases file pairs keys pointers every record data file every key file associated particular pointer record sorted data file clustered indices duplicate keys dense index points first record key sparse index databases file pairs keys pointers every block data file every key file associated particular pointer block sorted data file clustered indices duplicate keys sparse index points lowest search key block reverse-key index reverses key value entering index e.g. value 24538 becomes 83542 index reversing key value particularly useful indexing data sequence numbers new key values monotonically increase primary index contains key fields table pointer non-key fields table primary index created automatically table created database create file must specify two things primary index 1 name primary index 2 primary index specification used index field neither ordering fields key fields assurance file organized key field primary key field one index entry every tuple data file dense index contains value indexed attribute pointer block/record indices implemented using variety data structures popular indices include balanced trees b+ trees hashes microsoft sql server leaf node clustered index corresponds actual data simply pointer data resides elsewhere case non-clustered index relation single clustered index many unclustered indices index typically accessed concurrently several transactions processes thus needs concurrency control principle indexes utilize common database concurrency control methods specialized concurrency control methods indexes exist applied conjunction common methods substantial performance gain cases index used quickly locate data record required data read words index used locate data records table return data covering index special case index contains required data field answer required data consider following table fields omitted find name id 13 index id useful record must still read get name however index id name contains required data field eliminates need look record covering indexes specific table queries join/ access across multiple tables may potentially consider covering indexes one tables covering index dramatically speed data retrieval may large due additional keys slow data insertion update reduce index size systems allow including non-key fields index non-key fields part index ordering included leaf level allowing covering index less overall index size standard defines create indexes iso sql standard cover physical aspects indexes one physical parts database conception among others like storage tablespace filegroups rdbms vendors give create index syntax specific options depend software capabilities | [
5717,
5014,
6415,
1449,
3951,
2199,
6430,
6462,
1861,
6128,
7205,
5419,
7213,
6144,
1891,
4010,
784,
2265,
7231,
7248,
3005,
3011,
6543,
7999,
4798,
840,
4430,
3391,
517,
519,
7303,
4457,
533,
5885,
5209,
7715,
3776,
8079,
1640,
5217,
9... | Test |
1,731 | 9 | OpenBUGS:openbugs openbugs software application bayesian analysis complex statistical models using markov chain monte carlo mcmc methods openbugs open source variant winbugs bayesian inference using gibbs sampling runs microsoft windows linux well inside r statistical package versions v3.0.7 onwards designed least efficient reliable winbugs range test applications addition different licence greater range operating systems fundamental difference openbugs winbugs way expert system selects updating algorithm use class full conditional distribution node winbugs defines one algorithm possible class limit number algorithms openbugs use allowing greater flexibility extensibility user select updater used node compilation differences detailed openbugs website source code openbugs written component pascal programming language dependent component pascal libraries provided oberon microsystems part blackbox component framework development tools available open source binaries current version openbugs available microsoft windows previous version linux also run wine linux installation problems development usage questions discussed openbugs bulletin board attempts port openbugs java gardens point component pascal given favor new portable implementation called jags bugs language language specifies model code parsed openbugs creates executable compiled code generates sample posterior distribution run openbugs designed run together s-plus bugs language similar programming language openbugs works well together r r2openbugs brugs packages provides interoperability r modules help analyses | [
3606,
2820,
1626,
4759,
5548,
5288,
5117,
5571,
4872,
578,
4705,
4067,
3981,
3388,
4070,
3807,
1398,
6934,
1879,
1128,
7579,
610,
3410,
256,
3915,
1989
] | Train |
1,732 | 8 | 80legs:80legs 80legs web crawling service allows users create run web crawls software service platform 80legs created computational crawling company houston tx company launched private beta 80legs april 2009 publicly launched service demofall 09 conference time public launch 80legs offered customized web crawling scraping services since added subscription plans product offerings 80legs built top distributed grid computing network grid consists approximately 50,000 individual computers distributed across world uses bandwidth monitoring technology prevent bandwidth cap overages 80legs criticised numerous site owners technology effectively acting distributed denial service attack obeying robots.txt average webmaster aware existence 80legs blocking access crawler done already late server ddosed guilty party detected time-consuming in-depth analysis logfiles rulesets modsecurity like one atomicorp block access webserver 80legs order prevent ddos webknight also blocks 80legs default distributed crawler impossible block crawler ip best way found block 80legs useragent 008 wrecksite blocks 80legs default | [
6114,
2739,
4159,
4450,
3161,
503,
654,
80,
330,
7886,
855,
1333,
518
] | Validation |
1,733 | 3 | Theatre_Europe:theatre europe theatre europe turn-based strategy video game developed published personal software services first released united kingdom commodore 64 zx spectrum amstrad cpc atari 8-bit home computers 1985 later released france ere informatique 1986 released united states datasoft later year also ported tatung einstein home computer 1989 exclusively united kingdom fifth instalment strategic wargames series game set fictional war europe nato warsaw pact sides use nuclear chemical weapons main objective game fight conventional battles continental europe whilst trying avoid worldwide nuclear holocaust throughout game various capital cities civilian populations destroyed nuclear weapons game end either side forced surrender entire population europe perishes order request nuclear strike player required call dedicated telephone number led automated message announcing authorisation code development developers obtained extensive information statistics military strength ministry defence soviet embassy london theatre europe gained national controversy upon release receiving criticism campaign nuclear disarmament cnd sun newspaper high street retail chains refused sell game upon release despite controversy game received critical acclaim reviewers praise directed accuracy playability value money best strategy game award 1985 golden joystick awards nominated game year title game turn-based strategy revolves around fictional conflict powers nato allies warsaw pact player choice choosing either nato warsaw pact collectively referred soviet forces demo computer versus computer option game plays game takes place period 30 in-game days one day equal one round three types difficulty level one unless provoked enemy use nuclear weapons whilst levels two three enable enemy use nuclear chemical attacks prevent player winning game main feature game focused map europe western russia displays accurate terrain mountain ranges major cities borders military forces belonging side game also features arcade sequence involves shooting enemy units order secure combat bonuses gameplay mode however ignored changing game settings arcade sequences turned player notified choose battle map depending area chosen illustration battle commencing countryside city presented various forms military equipment including aeroplanes helicopters tanks player must shoot destroy enemy units using cursor similar style missile command outcome arcade sequence affect game performing poorly result severe losses throughout round combat resolved player must move assemble forces continental europe known movement phase two special units exclusively available warsaw pact 1st airborne army flown directly behind enemy lines 1st amphibious army move sea tactical attack point units moved cursor one may moved time units moved within round attack phase begin amount friendly units may attack opposing army however unit dispatched battle stopped current attack phase concludes attacking phase separate screen displaying combat information enemy numbers casualties displayed screen detailing attacking phase turned settings battle instead decided warrants air superiority armaments battle sequences player opportunity rebuild units allocating quantity armament supplies air support issued friendly unit map rebuilding ground units game move onto air phase consists commanding aircraft aeroplanes bombers limited number reserve air units several options allocating air forces include counter air strikes reconnaissance enemy movement interdiction assault breakers deep strikes counter air strikes involve attacks enemy air bases whereas interdiction involves aircraft sent behind enemy lines order attack supply movement networks interdiction aircraft discovered enemy territory chance side respond retaliatory nuclear strike remaining three aircraft options attack single unit strike enemy territory attack railways order disable enemy reinforcements respectively game allows player request chemical nuclear tactical strikes enemy chemical attack automatically targeted enemy capital city conclude readout announcing outcome attack civilian casualties order launch strategic nuclear attack player given 30 seconds call dedicated 1-800 telephone number obtain special authorisation code automated answerphone message authorisation code 'midnight sun authorisation code received player given three separate options proceed standby mode postpone nuclear launch whereas strategic launch involve one nuclear warhead targeting city third option known fire-plan issue full-scale nuclear strike across europe may result nuclear holocaust end game personal software services founded coventry west midlands gary mays richard cockayne 1981 company known creating games revolved around historic battles conflicts battle britain bismarck falklands '82 company partnership french video game developer ere informatique published localised versions products united kingdom 1986 cockayne took decision alter products release 16-bit consoles found smaller 8-bit consoles zx spectrum lacked processing power larger strategy games decision falsely interpreted pulling spectrum market video game journalist phillipa irving following years successful sales throughout mid-1980s personal software services experienced financial difficulties cockayne admitted retrospective interview took eye ball company acquired mirrorsoft february 1987 later dispossessed company due strains debt interview computer magazine richard cockayne stated theatre europe received heavy criticism campaign nuclear disarmament cnd sun newspaper respectively cnd accused developers bad taste despite cockayne claiming organisation never looked product development game cockayne mays obtained figures statistics various military strength ministry defence soviet embassy london cockayne asserted statistics developers gained realistically plausible stating would let horrifying results speak game game designer alan steel stated testing alarmed discover computer played warsaw pact always conventional war overwhelmingly forcing nato either surrender begin nuclear war steel adjusted game give nato chance win theatre europe first released united kingdom commodore 64 zx spectrum amstrad cpc atari 8-bit home computers 1985 re-released france united states consoles 1986 due lobbying cnd high street outlets boots john menzies refused sell game stores former finding morally offensive game received critical acclaim upon release gwyn hughes sinclair defended accuracy morality game stating bad taste game well researched program thought would give player insight nature modern war philippa irving crash similarly stated theatre europe offered usual run-of-the-mill war game heralded simplistic nature adding novice gamers would get ease john gilbert sinclair user added scepticism developer intention making something serious opposed titles however praised game brilliant chilling simulation reviewer writing zx computing similarly stated game superbly chilling extremely well-presented reviewer computer video games criticised inferior graphics zx spectrum stating bit flawed comparison commodore 64 version mark reed computer gamer noted game attracted media attention despite objective game discouraging use nuclear weapons reed praised presentation gameplay also stating use joystick keyboard excellent reviewer zzap 64 heralded presentation value money stating overall special indeed reviewer also gave praise sound suggesting game featured one best pieces micro music ever antic stated atari 8-bit version execution uneven magazine reported arcade portion quickly becomes nuisance nato could defeat warsaw pact lack balance flaws exist commodore 64 version peter connor advanced computer entertainment said theatre europe gift regards value money level playability 1994 survey wargames computer gaming world gave title two-plus stars five stating rendered obsolete history game play game best strategy game award 1985 golden joystick awards also nominated game year title | [
616
] | Test |
1,734 | 3 | EComStation:ecomstation ecomstation ecs pc operating system based os/2 published serenity systems mensys bv currently owned developed xeu.com includes several additions accompanying software present ibm version system ecomstation 32-bit operating system runs exclusively x86 processor architecture real virtualized still used version 1 ecomstation released 2001 based around integrated os/2 version 4.5 client convenience package os/2 warp version 4 released ibm 2000 latter made available holders existing os/2 support contracts included following new features among others compared final retail version os/2 1996 os/2 warp version 4 ecomstation provided retail channel end users obtain updates addition beginning bundled number additional features enhancements including limited ibm began wind os/2 development serenity partners began take slack combination in-house contract community/open source development efforts terms keeping operating system usable current hardware results many efforts included version 2 ecomstation among others became clear ibm would release new retail version os/2 warp client operating system version 4 1996 users began consider alternatives ibm released final version server edition ibm os/2 warp server e-business wseb internally called version 4.5 ibm also continued updating client merged parts server proposed bob st. john serenity systems oem company could create client using existing os/2 client ibm enhancements adding improvements needed serenity ibm business partner done similar thing os/2-based vertical applications like serenity managed client rapid deployment os based workspace on-demand ecomstation server managed server based wseb os/2 software vendor stardock made proposal ibm 1999 followed company april 29 2000 serenity conjunction kim cheung touchvoice systems created discussion group purpose discussing os/2 community interest new managed client ebusiness using components wseb called ecomstation replace one based wod idea brought also create new non-remote boot client — effect oem version os/2 client although serenity initial response suggestion thick client negative response positive enough community ibm get things moving months later first ecs preview shipped notwithstanding cheung fairly simple initial concept community input actively solicited beginning feature requests quickly began coming final ga release ecomstation 1.0 us english released july 2001 significantly different original preview many respects obviously ibm os/2 install routine longer used instead rapid-deployment system based cheung wisemanager product utilized install operating system components addition number enhancements os/2 user interface integrated including revamped desktop layout entirely new icons customizable graphic effects number windowing components redesigned system dialogs enhanced user-extensible system shutdown ecomstation 1.0 built 2000 release ibm convenience package os/2 warp version 4 commonly referred mcp mcp1 additionally several commercial applications bundled operating system package notably lotus smartsuite os/2 ibm desktop on-call english edition released efforts turned making language editions called national language versions nlvs available however first non-english nlv targeted german released end 2001 due large part greater-than-anticipated effort localizing redesigned installer new materials ultimately non-english nlvs released ecomstation 1.0 languages would become available ecomstation 1.1 1.2. ecomstation 1.1 included several major new features compared version 1.0 largest change operating system installed package wide-ranging functional enhancements desktop environment workplace shell based open source xworkplace project netlabs.org included desktop folder enhancements status bars improved sorting options new virtual desktop feature customizable desktop toolbar support programmable widgets expanded configuration options various enhancements built-in support pppoe pptp internet connections also provided addition completely new install process designed bootable code installation cd rewritten improve compatibility modern bioses pre-boot menu introduced allowed user select various drivers kernel options use booting cd graphical installer ecomstation 1.0 replaced new streamlined interface ecomstation 1.1 based 2001 release ibm convenience package 2 os/2 warp version 4 also known mcp2 subsequent ibm service updates integrated version serenity systems separated base operating system product major commercial applications bundled ecomstation 1.0 base ecomstation 1.1 product sold title ecomstation entry applications including lotus smartsuite 1.7 hoblink x11 server packaged separately ecomstation application pack multi-processor support included ecomstation entry due additional license fees required ibm time instead smp package available ecomstation retailers paid extra release ecomstation 1.1 ecomstation server edition also made available based os/2 warp server e-business product besides english also german russian nlvs released ecomstation 1.1 principal new feature ecomstation 1.2 advertised revamped desktop multimedia support updated versions various bundled components ibm non-ibm also included ecomstation 1.2 released english german dutch nlvs serenity systems announced intention provide media refresh incorporating number fixes updates made available release ecomstation 1.2 released version 1.2r initially 12 november 2005 subsequently withdrawn re-released due last-minute bug fix 17 november 2005 principal new feature ecomstation 1.2r support installation athlon 64 systems previously possible awkward work-arounds ecomstation 1.2r released english german italian nlvs additionally beta release traditional chinese nlv made available via download registered customers ecomstation 2.0 longer-than-usual development cycle first beta released 21 december 2005 first self-styled release candidate announced 18 june 2007 final ga release available may 2010 biggest change ecomstation 2.0 addition acpi support represented first major update core operating system developed specifically ecomstation ibm benefits acpi included support modern hardware including advanced power-management features well support irqs 15 addition new acpi driver allowed access os/2 symmetric multi-processing support obviating need ibm proprietary smp-enablement driver consequently starting ecomstation 2.0 smp support included base product additional cost major feature introduced version 2.0 enhanced version journaled file system allowed operating system booted directly jfs-formatted partitions previous versions jfs usable non-bootable data partitions installing operating system onto jfs allowed significant performance improvement due much larger cache sizes supported jfs well reduced chkdsk times event non-clean shutdown ecomstation pricing model revamped significantly version 2.0 standard consumer version home student edition edition lower recommended retail price previous versions ecomstation however one customer limited five purchases business edition targeted commercial customers limit number purchases business edition also came telephone support whereas home student edition customers limited e-mail online assistance software-wise two products identical license terms differed noted editions ecomstation 2.0 included openoffice.org office suite provided separate cd application pack available previous versions discontinued ecomstation 2.0 available english release language versions deferred version 2.1 current version ecomstation 2.1 released year version 2.0 may 2011 version 2.1 two significant new features first support ahci disk controllers via newly developed device driver second replacement old ibm boot manager open-source air-boot software require primary partition therefore easier install disks pre-existing operating systems ecomstation 2.1 also updates included applications notably mozilla firefox minor improvements installer version 2.1 much former branding serenity systems removed released product replaced mensys bv ecomstation 2.1 currently available english german nlvs preview release japanese nlv also available certain customers nlvs including dutch italian reportedly development beta versions ecomstation 2.2 released 2013. ecomstation currently developed xeu.com various third party companies individuals although os/2 longer sold ibm ecomstation developed sold long remains profitable according serenity xeu.com important development ecomstation keeps adding value stakeholders involved recent major release version 2 released warpstock europe held 14–16 may 2010 updated version 2.1 followed year later may 2011 date last edition taken installation cds official release dates may different release dates refer us english editions unless otherwise noted ecomstation also complemented several open source applications included installer following open-source packages available ecomstation actively maintained see unix ports os/2 ecs netlabs ported packages also server edition based ibm os/2 warp server e-business minimum hardware requirements system running ecomstation 1.0 2.0 rc listed ecomstation number limitations relative operating systems currently available | [
4670,
4671,
5021,
13,
3271,
6802,
3626,
5041,
7550,
405,
4352,
65,
5783,
7223,
5088,
6500,
785,
2266,
788,
1522,
7605,
4759,
1534,
4397,
7975,
5116,
2300,
4786,
6922,
5161,
5865,
861,
1237,
3751,
1992,
7325,
3431,
190,
8066,
6984,
4494,... | Test |
1,735 | 3 | Socket_F+:socket f+ socket f+ also socket fr2 internally cpu socket amd server processors starting 45 nm generation k10 cpu family successor socket f. main difference two sockets supported hypertransport version socket f supports hypertransport 2.0 1.0 ghz speed socket f+ supports hypertransport 3.0 2.6 ghz speed backwards compatible version 1.0 2.0 | [
2539,
6599,
2541,
5895,
4931,
7163,
3362,
5377,
6351,
913,
7826,
2751,
6545,
6373,
5063,
6655,
6562,
3145,
4090,
866,
5436,
1237,
1143
] | Test |
1,736 | 4 | Information_Networking_Institute:information networking institute information networking institute ini established carnegie mellon 1989 nation ’ first research education center devoted information networking integral department college engineering collaboration school computer science tepper school business heinz college ini ’ professional graduate degree programs represent fusion technologies economics policies secure communication networks systems services ini also partners research outreach entities extend educational training programs broad audience people using information networking part daily lives ini educational partner carnegie mellon cylab university-wide multidisciplinary research center involving 50 faculty 100 graduate students work ini cylab carnegie mellon university designated national security agency department homeland security national center academic excellence information assurance/cyber defense education cae-ia/cd national center academic excellence information assurance/cyber defense research cae-r also designated nsa u.s. cyber command national center academic excellence cyber operations cae-cyber ops designations ini cylab participate ini teaching faculty drawn ini also ongoing partnership university hyogo graduate school applied informatics faculty involved teaching advising ini programs conducting research aspects information networking information security affiliated research centers ini graduated 1,400 alumni currently occupy positions variety sectors across industry government academia | [
7641,
1218,
3736
] | Test |
1,737 | 9 | Zend_Studio:zend studio zend studio commercial proprietary integrated development environment ide php developed zend technologies based php development tools pdt plugin eclipse platform pdt project led zend zend studio tightly integrated zend server zend pre-integrated tested php application stack integration enables developers quickly set complete php environment speed root cause analysis problems detected testing production environment zend studio also integrated zend framework example provides mvc view easy code navigation integration zend_tool automated code generation along zend server 2013 zend studio deployed 40,000 companies | [
1155,
4296,
6701,
2824,
7715,
1172,
6986,
6622,
3863,
1643,
3463,
6029,
933,
4896,
5956,
7933,
7213,
7214,
5433,
4998,
1695,
5092
] | Validation |
1,738 | 7 | Fast_automatic_restoration:fast automatic restoration fast automatic restoration fastar automated fast response system developed deployed american telephone telegraph 1992 centralized restoration digital transport network fastar automatically reroutes circuits spare protection capacity fiber-optic cable failure detected hence increasing service availability reducing impact outages network similar operation real-time restoration rtr developed deployed mci used mci network minimize effects fiber cut recovery technique used computer networks telecommunication networks mesh optical networks backup path alternate path affected traffic takes failure condition backup channel computed real time occurrence failure technique broadly classified two centralized restoration distributed restoration technique utilizes central controller access complete up-to-date accurate information network available resources resources utilized physical topology network service demands etc failure detected part network failure detection identification notification scheme central controller calculates new re-route path around failure based information database current state network new route backup path calculated central controller sends commands affected digital cross-connects make appropriate reconfigurations switching elements order implement new path fastar rtr restoration systems examples systems utilize restoration technique restoration technique central controller used hence up-to-date database state network needed scheme nodes network utilize local controllers local information particular node connected neighboring nodes available spare capacity links used connect neighbors state switching elements failure occurs part network local controllers handle computation re-routing affected traffic example approach technique utilized self-healing networks shn transport networks gradually developed digital cross connect system dcs -based mesh networks sonet ring networks optical mesh networks years recovery architecture used therein recovery architectures used different transport networks dcs-based mesh networks restoration ds3 facilities add-drop multiplexer adm -based ring protection sonet ring networks finally optical cross connect oxc -based mixed protection restoration optical mesh networks first restoration architecture used 1980s dcs-based mesh restoration ds3 facilities architecture utilized centralized restoration technique every restoration event coordinated network operation center noc restoration architecture path-based failure dependent utilized fault occurs fault detection isolation architecture capacity-efficient due use stub release slow failure recovery time time takes reestablish traffic continuity failure rerouting signals diverse facilities order minutes architecture implemented 1990s introduction sonet/sdh networks employed distributed protection technique utilizes either path-based upsr span-based blsr protection recovery path precomputed occurrence failure adm-based ring protection capacity-inefficient unlike dcs-based mesh restoration faster recovery time 50 ms recovery architecture used protection optical mesh networks introduced early 2000s protection architecture recovery time tens hundreds milliseconds significant improvement recovery time supported dcs-based mesh restoration unlike dcs-based mesh restoration recovery path predetermined pre-provisioned architecture also capacity efficiency seen preceding mesh restoration architecture dcs-based fastar uses dcs-based mesh restoration architecture architecture consists nodal equipment central control equipment data communication network interconnecting nodes central controller figure right explains architecture fastar different building blocks interact central processor called restoration provisioning integrated design rapid located noc responsible receiving analyzing alarm reports generated event fiber failure also handles alternate backup route computation re-routing affected traffic primary path already computed backup path path assurance tests enables roll-back traffic original path failure repaired rapid maintains up-to-date information state network available spare capacity central access display system cads provides craft interface rapid related restoration management systems traffic maintenance administration system tmas enables rapid perform control protection switch lock-out process protection channels used restoration sending commands line terminating equipment lte restoration network controllers rncs located central office co fiber optic network alarms generated affected digital access cross-connect system dacss lte sent rnc aged find alarm result transient correlated finally sent rapid via data communication network lte either ft series g digital transmission system add drop multiplexer adm reports fiber failure ltes rnc also provides rapid immediate access backup channels re-routing traffic path assurance tests restoration test equipment rte provides rapid means perform continuity tests used path assurance dacs responsible reporting fiber failures node failures occur within office rnc addition dacs enables automatic restoration providing central processor access remotely perform cross-connects ds-3 level data communication network used connect nodal equipments central controller achieve needed availability network full redundancy used form two totally diverse terrestrial satellite-based networks event major restoration process one networks support communication burden absence fastar operates ds-3 level restore individual smaller demands fastar restores 90 95 percent affected ds-3 demand within two three minutes fiber-optic cut occurs output dacs equipment input another rnc collects alarms affected ltes rnc ages alarms sends rapid rapid determines amount spare capacity available failure identifies ds-3 demands affected finds restoration route affected traffic sequential order priority sends command appropriate dacss implement re-route thus establishing restoration figure right route exists node node q via nodes c f k l. event fiber-optic cable failure nodes f k lte ft series g adm two offices detects sends alarm reports failure respective rncs rncs age alarm send reports rapid located noc rapid initiates time window ensure related alarms generated rncs affected nodes rnc office whose traffic utilizes f k failed fiber optic cable window times rapid performs route computation establish new backup path traffic node node q creates new route c f g j k l. route computation also done sequentially order priority traffic two nodes network utilize failed fiber-optic cable backup path traffic going nodes f k computed rapid ensures continuity connectivity along established back-up paths sending command rncs located q turn use test signal generated respective rte check continuity link connectivity backup path verified traffic nodes q transferred backup path commanding dacs iiis make appropriate cross connections rapid performs service verification test verify service transfer successful test returns positive result service transfer successful else service transfer unsuccessful needs repeated service traffic transfer process performed traffic going affected fiber optic cable f–k fastar restores much affected traffic demand available protection capacity allow shared risk link groups srlgs refer situations links connect two distinct nodes offices network share common conduit configuration links group shared risk one link fails links group may fail majority networks use today utilize srlgs times access building across bridge single conduit restore traffic link two offices nodes share srlg links event conduit cut least one two offices must fastar-ompliant cut srlg1 would restorable using fastar fastar implemented either office b b c yet fastar-compliant given failure srlg2 ds-3 traffic link 3 would restored fastar via newly re-computed backup path ds-3 traffic link 2 would restored fastar implemented either office b c. restore three links event failure srlgs fastar implemented offices c. failure srlg1 would cause fastar automatically re-route traffic link 1 3 via two re-computed backup paths also another time failure srlg2 detected reported rapid traffic link 2 3 re-routed new backup path fastar network management used integrate analyze different data alarms supplied various system elements make fastar architecture centralized display troubleshoot isolate problems fault management analysis corrective action taken fastar network management cuts across three tiers | [
6335,
4378,
2054
] | Test |
1,739 | 4 | Evasi0n:evasi0n evasi0n stylized evasi0n jailbreak program ios 6.0 6.1.2 ios 7.0 7.0.6 evasi0n7 known portable code base minimal use arbitrary code execution seven million copies evasi0n downloaded presumably installed first four days release released 4 february 2013 four six exploits used patched apple 18 march 2013 release ios 6.1.3 meant end original version evasi0n 22 december 2013 evad3rs released new version evasi0n supports ios 7.x known evasi0n7 one major exploit used jailbreak patched apple 4th beta ios 7.1 two beta 5 final release ios 7.1 fixed exploits used evasi0n7 evasi0n jailbreak specifically breaches modern security features address space layout randomization kernel space version launchd hard-coded list exclusive services serve device stability well vendor lock-in ios evasi0n reads fixed data vectors locate random address kernel space utilizes codice_1 file launchd processes regardless list exclusive services | [
4759,
6188,
5571,
3967,
2327,
578,
3635
] | Test |
1,740 | 3 | The_Portopia_Serial_Murder_Case:portopia serial murder case often translated portopia serial murder case english adventure game designed yuji horii published enix first released nec pc-6001 june 1983 since ported personal computers nintendo famicom mobile phone services game player must resolve murder mystery searching clues exploring different areas interacting characters solving item-based puzzles game features first-person graphics nonlinear gameplay open world conversations non-player characters branching dialogue choices suspect interrogations nonlinear storytelling plot twists famicom version also features command menu system point-and-click interface 3d dungeon maze upon release portopia serial murder case well received japan became influential title helped define visual novel genre portopia serial murder case follows first-person perspective narrative various events described still pictures text messages player interacts game using verb-noun parser requires typing precise commands keyboard finding exact words type considered part riddles must solved sound effects present game lacks music save function features conversation system branching dialogue choices story develops entering commands receiving answers player sidekick non-player characters game features nonlinear gameplay allowing multiple different ways achieve objectives includes travelling different areas open world making choices determine dialogues order events well alternative endings depending player identifies culprit however one characters true culprit others red herrings player closes case wrong culprit player face criticism police chief need re-open case game includes phone could used manually dial number needed contact several non-player characters game also features inventory system requiring examination collection items could used evidence later game keyboard famicom version replaces verb-noun parser menu list fourteen set commands selectable gamepad similar command selection menu system introduced yuji horii murder mystery adventure game released 1984 pc famicom releases portopia one commands menu allowed player use point-and-click interface using d-pad move cursor screen order look clues hotspots famicom version portopia also features branching menu selections includes using pointer magnifying glass investigate objects needed find hidden clues fist hammer hit anything anyone could used carry beatings suspect interrogations additional sequences also added notably underground dungeon maze style similar role-playing video games although story game fictional set real japanese cities mainly kobe addition sequences kyoto sumoto president successful bank company found dead secretary inside locked room mansion signs seem indicate kouzou stabbed however police sends detective investigate detective charge case unnamed unseen silent protagonist essentially embodies player simply referred works assistant named nicknamed one actually speaks executes player commands characters include among others daughter man named kouzou nephew heir stripper game conceived yuji horii around 1981 27 years old shortly bought first computer learned program modifying games time read pc magazine article computer game genre united states text adventures horii noticed lack games japanese market decided create adventure game horii also cited manga authors tetsuya chiba mitsuru adachi katsuhiro otomo influences game developed using basic programming language horii wanted expand adventure game genre ideas one concept create program story would develop entering command receiving answer idea game progresses conversations human computer started get ambitious thought could make computer converse enough data entered attempting create artificial intelligence language algorithm however realized n't possible computers time created dialogue computer beforehand player could type words computer would reply back reaction another concept contrast linear stories adventure games time idea branching non-linear storytelling main scenario take 20 game ’ content remaining 80 response various actions player however due pc memory limitations able create several short branching scenarios still found interesting one long linear scenario also conceived graphical format picture on-screen representing happening command menu system select action later became standard format japanese adventure games following 1983 release game ported various japanese personal computers famicom port released 1985 first adventure game released platform famicom version also first collaboration yuuji horii koichi nakamura chunsoft dragon quest famicom version programmed nakamura 19 years old time version portopia changed interface adopting command menu system horii created 1984 adventure game due frustration text-based entry admitting never able get far adventure games horii created command menu system hokkaido later used famicom version portopia horii also noted famicom versions portopia hokkaido wanted make appealing mature audience beyond famicom typical younger audience also playing wizardry time inspiring include 3d dungeon maze famicom version portopia game never released western world largely due mature content involving themes murder suicide fraud bankruptcy interrogation beatings drug dealings strip club lack western release prompted rom hacking group dvd translations develop unofficial translation famicom version first mobile phone version game branded part trilogy along mobile versions hokkaido rensa satsujin okhotsk ni kiyu karuizawa yūkai annai released 2003 ezweb yahoo keitai services features list set commands similar famicom version also improved graphics free-moving cursor save function games trilogy retitled re-released 2005 2006 services second portopia version possesses content first mobile one addition updated graphics background music bonus function obtained completing game hint option nullifies ending bonus used frequently famicom version game sold 700,000 copies game well received japan allowing multiple ways achieve objectives well-told storyline surprising twist ending japanese press described game without game technically way lose according square enix first real detective adventure game game along super mario bros. inspired hideo kojima creator metal gear series enter video game industry praised portopia mystery drama humor 3d dungeons providing proper background explanation behind murderer motives expanding potential video games kojima considers one three influential games played influence evident games including metal gear series snatcher pc-6001 version portopia serial murder case included hidden secret portopia also one first video games ever played nintendo eiji aonuma went become director legend zelda series starting ocarina time portopia influence also evident horii later work including seminal role-playing game dragon quest used storytelling techniques menu interface portopia john szczepaniak retro gamer considers one influential games responsible defining visual novel genre comparing role super mario bros. tetris street fighter defining respective genres platform game puzzle game fighting game respectively 2003 portopia serial murder case ranked 19th poll determine thirty best famicom games poll conducted tokyo metropolitan museum photography part level x exhibition english-language webzine retrogaming times monthly compared game later-released shadowgate player must examine collect objects find true purpose later recommended portopia fans slower paced games require players think puzzles john szczepaniak praised pacing quality writing considers gameplay plot sophisticated time noted contains elements found number later titles including déjà vu snatcher nine hours nine persons nine doors 1up also noted portopia similar icom simulations déjà vu released several years later nintendo successful series adventure games also inspired portopia usgamer compared later police quest adventure games csi television series well classic sherlock holmes novels according official xbox magazine portopia features point-and-click murder mystery plot open world suspect interrogations nonlinear gameplay dialogue choices alternate endings standard 2015 way ahead time 1983 comparing l.a. noire peter tieryas gave portopia positive retrospective review stating influence undeniable tragic back story strange vicissitudes characters face uncanny freedom investigate haunting uncovering killer makes special | [
5429,
7583,
4907,
6092
] | Test |
1,741 | 2 | Bélády's_anomaly:bélády anomaly computer storage bélády anomaly phenomenon increasing number page frames results increase number page faults certain memory access patterns phenomenon commonly experienced using first-in first-out fifo page replacement algorithm fifo page fault may may increase page frames increase optimal stack-based algorithms like lru page frames increase page fault decreases lászló bélády demonstrated 1969 common computer memory management information loaded specific-sized chunks chunk referred page main memory hold limited number pages time requires frame page load page fault occurs page found might need loaded disk memory page fault occurs frames use one must cleared make room new page simple algorithm fifo whichever page frames longest one cleared bélády anomaly demonstrated believed increase number page frames would always result number fewer page faults bélády nelson shedler constructed reference strings fifo page replacement algorithm produced nearly twice many page faults larger memory smaller one formulated conjecture 2 general bound 2010 fornai iványi showed anomaly fact unbounded one construct reference string arbitrary page fault ratio | [
1254,
1575
] | Test |
1,742 | 7 | Manaba:manaba manaba cloud-based collaborative learning system developed internet service provider asahi net inc. manaba developed 2007 collaboration two private universities japan initially designed connect students teachers enable students accumulate learning evidence elevate learning outcomes mutual review known intuitive interface meaningful design focused learning outcomes flexibility scalability cloud application manaba adopted approximately 200 educational institutions globally december 31 2013 manaba provides spaces teachers conduct surveys tests collect assignments enable group projects facilitate online discussions students also review work develop debates course materials manaba provides individual space student accumulate learning evidence time share others reflect back previous work instructors assess learning outcomes looking students ’ portfolios collectively manaba creates spaces groups engage community discussions various topics name “ manaba ” comes two japanese words manabu 学 ba 場 manabu means learning ba activity place events occur | [
3915,
5571
] | Train |
1,743 | 2 | OS_2200:os 2200 os 2200 operating system unisys clearpath dorado family mainframe systems operating system kernel os 2200 lineal descendant exec 8 univac 1108 documentation information current past unisys systems found unisys public support website see unisys 2200 series system architecture description machine architecture relationship os 2200 operating system earlier 1100 systems going back 1101 1951 1108 first 1100 series computer designed efficient support multiprogramming multiprocessing along new hardware came operating system exec 8 executive system 1108 univac 1108 computer announced 1964 delivered late 1965 first 1108 computers used exec exec ii developed univac 1107 however univac planned offer symmetric multiprocessor versions 1108 4 processors earlier operating systems really basic monitor programs n't designed even though supported limited multiprogramming univac 1110 introduced 1972 operating system name changed os 1100 reflect support wider range systems name os 1100 retained 1988 introduction sperry 2200 series follow 1100 series name changed os 2200 since time 2200 series became unisys clearpath ix series unisys clearpath dorado series operating system retained os 2200 name company name product names also changed time engineering research associates era saint paul acquired remington rand corporation remington rand also acquired eckert–mauchly computer corporation philadelphia building univac computer two combined univac division remington rand direction william norris william norris one founders era later left remington rand start control data corporation univac division remington rand corporation became univac division sperry rand corporation remington rand merged sperry corporation 1970s sperry rand began corporate identity program changed name sperry corporation division names begin sperry computer systems division became sperry univac later division names dropped everything simply became sperry operating system kernel still referred exec unisys customer personnel however unisys began releasing suites products tested together system base releases later called clearpath os 2200 release n term os 2200 changed refer entire suite products system release others bis released asynchronously dorado hardware platforms 1986 burroughs sperry corporations merged become unisys long time 2200 series clients say stands univac still supplier major mainframe product lines companies continued development including mcp operating system burroughs os 2200 sperry 2016 unisys made virtual microsoft windows version os2200 available cost educational leisure purposes exec 8 sometimes referred exec viii univac operating system developed univac 1108 1964 combined best features earlier operating systems exec exec ii used univac 1107 exec 8 one first commercially successful multiprocessing operating systems supported simultaneous mixed workloads comprising batch time-sharing real-time one file system flat naming structure across many drums spindles also supported well-received transaction processing system previous systems real-mode systems hardware support protection separation programs operating system support multiprogramming previous systems limited running one user job concurrently multiple supporting functions known well-behaved card reader printer card punch spoolers exec 8 operating system designed beginning multiprogramming multiprocessing operating system 1108 designed four cpus memory mass storage primary system constraints 1100 series envisioned targeting general market extreme real time processing primary requirement specifications exec 8 drawn december 1964 preliminary programmers reference manual user guide work began may 1965 exec 8 began real time operating system early use mostly general scientific engineering work also used message switching process control simulation missile firing control designed run systems often 128k words 576 k bytes—less maximum memory size ibm pc xt focused real time batch processing earliest release levels work 128kw increasing functionality later releases made untenable since n't leave enough space programs useful size maximum memory capacity 1108 256kw 1,148 kb efficient use memory important constraint since core memory expensive part system mass storage consisted 6-foot long rotating drums held 256kw fh-432 2mw fh-1782 highest capacity mass storage fastrand drum held 22 mw 99 mb file fragmentation dealt process called file save generally done per day night involved rolling files tape reinitializing drum file system reading files back severe memory constraints real time use keeping single copy code loaded core requirement since 1108 designed multitasking system fully reentrant thread safe reentrant module accessed program data single memory base address different instance run data switching execution contexts could done single instruction merely setting different base address single register system used fine-grained locking protect shared data structures executive compilers utilities even sophisticated user applications might multiple copies running concurrently written code could shared required loading one copy memory saving space time took load code another reason separate code data different load entities memory implemented two independent banks separate physical cabinets called ibank dbank instruction data access path cpu could read banks simultaneously loading executable code one memory bank data run time many programs could almost halved reentrant code thread safe execute self-modifying code allowed programs modifying executable code runtime still acceptable programming technique time 1100-series computers users encouraged performance hit security benefits touted highly valued hacking 1100-series applications would provide benefit anyone hackers malevolent exec 8 primarily batch processing system gave applications called tasks fine control cpu scheduling priority threads called activities processor switching preemptive higher priority threads gaining control processor currently running lowest priority thread program except realtime systems even lowest priority tasks got processor time multiprogramming multiprocessing operating system fully symmetric processor management test-and-set instruction built hardware allowed efficient fine-grained locking within os within multi-threaded applications exec 8 work organized jobs called runs scheduled based priority need lockable resources uniservo tape drives fastrand drum files control language syntax uses symbol univac called master space control statement recognition symbol immediately followed command program name comma option switches space character remainder statement differed particular commands command compile fortran program would look like options sourcefile objectfile input data application could read file generally card images immediately follow command run stream lines sentinel command end assumed input data forgetting insert led compiler interpreting subsequent commands program data reason preferable process data files rather inputting run stream 1968 work began adding time-sharing capability exec 8 delivered level 23 executive 1969 time sharing called demand mode capabilities batch real time processes everything could done batch could done ascii terminal demand mode job stream i/o attached terminal handler rather card image input spool output files run control language used years later specific time sharing commands added control statements could issued asynchronously immediate processing even neither executive running program expecting data commands could entered terminal began could performed without stopping work progress terminal called transparent commands first statements kill current program redirect terminal output file eventually almost control statements allowed immediate batch demand runs terminate fin statement demand user terminates session run active exec automatically terminates run without requiring fin transaction processing capability developed late 1960s joint project united airlines later refined another joint project air canada capability fully integrated operating system 1972 became basis much future growth 1100 series early users controlled communication lines directly within real time programs part development transaction processing included communication message system managed communication lines presented messages exec 8 scheduled transactions moved low level communication physical line management protocols applications cms 1100 application cms 1100 ran real time multi-threaded program privilege acquiring control communication lines submitting transaction messages scheduling led notions exec 8 applications nature needed carefully controlled ensure could cause integrity issues security certainly concern early days system reliability integrity much larger issues system still primarily batch transaction processing little chance anyone could install unauthorized code system cms 1100 later added capability interface demand terminals well transaction terminals terminals could used early terminal drivers could removed exec cms 1100 later replaced combination cpcomm clearpath enterprise servers communications platform silas system interface legacy application systems intel-based dorado server models lower level communications moved firmware upper levels handled silas cpcommos clearpath enterprise servers communications platform open systems exec contains code system allowed run highest privilege levels mechanisms code promoted privilege levels exec responsible managing system hardware scheduling managing work communicating operators administrators release 16.0 exec level 49r2 49.70.5 internal system levels use three-part number 21.92.42 first widely used production system although earlier releases used production number sites first number part major level indicates new version exec previous updates integrated new base version infrequent process occurs intervals years second number part indicates versions updates major level often occurs several times per week decision made freeze feature content prepare release third part comes play indicates versions pre-release level fixes minor feature updates applied concurrently preparing level release updates mainline continue engineers integrate changes preparation future release many years official release level full three-part number later releases named simply 44r1 44r2 49r2 although three-part number still used internally exec heart real time multi-threaded batch processing system everything built around model exec largely structured real time program functions performed services windows daemons linux unix implemented either activities within exec batch programs always running background time-sharing known demand mode transaction processing implemented special cases batch one result restrictions time-sharing user transaction program lots warnings writers transaction programs happy performance example call tape mount permitted largest unit work run taken factory production run terminology generally equates job session systems run defined run stream run stream sequence control statements represent steps taken may include file handling program execution branches control batch run typically stored file scheduled start command within another run operator time sharing run initiated logging time-sharing terminal inputting run command often run statement second control statement often add program execution generated automatically based user profile security authorizations validated based authenticated user-id information supplied run control statement transactions special case ’ actually control statements internal data structures run created enables exec associate security accounting debugging etc mechanisms transaction programs generally security profile cached memory time transaction user authenticated copied user session data transaction run state transaction scheduled transaction instance essentially run accounting logging error handling encapsulated run mechanism batch jobs runs characterized runstream job control language statements stored file batch job always contains run statement first record file statement gives run name runid defines priorities defines maximum number sups standard units processing job expected use job started job start control statement operator via st keyin system may configured automatically issue start statements number jobs boots jobs serve purpose performing initialization recovery background functions fields run statement may overridden corresponding fields start statement except start executed privileged user userid security state always taken run start two priority fields run statement one used specify backlog priority 26 backlog priority levels – z exec configured maximum number open batch runs level reached jobs selected backlog queues priority order within priority selection usually fifo however exec pre-scans job control statements first program execution looking file names reel numbers job would immediately stall resources needs available may bypassed start jobs priority level second priority level defines execution processor resource group general higher execution group priorities typically get processor time os 2200 job control language support full programmability allow dynamic additions sequences control language add control statement file added may created job immediately preceding adding add control statements may also submitted within running program via api additional programmability available indirectly use symbolic stream generator ssg ssg programming language manipulating creating text files input parameters system information used heavily configuration management make processing functions text images need created programmatically resulting output add ed run thus providing indirectly programmable runstream operator commands available change backlog execution priorities runs operator commands available api suitably privileged users automated controlled remote administrator deadline special case batch deadline run looks like batch run except deadline time specified run start control statement deadline time used conjunction maximum sups time estimate control statement deadline job runs normal batch priorities unless appears could miss deadline time mismatch time deadline remaining sups higher priority deadline ’ totally shut transactions effect real time effectively shut processing system necessary achieve goal os 2200 time-sharing sessions called demand demand runs use control language batch runs additions known immediate control statements immediate control statements use sentinel indicates executed immediately even program running used create assign files important ones allow demand user error terminate running program even send signal transactions execute runs without stored submitted control statements instead message received session defined transaction session scanned determine transaction queue placed normally determined first characters message user-written scanners may added communication manager capable handling 250,000 active sessions takes incoming transaction messages passes message queuing software handle unlimited number queued messages using message queuing architecture call made transaction interface package tip apis operating system queue transaction appropriate queuing point queuing point identifies priority concurrency level work associated transaction program executed transaction program scheduling tree allows client establish relative usage groups transaction programs concurrency limits avoid one type work dominating system exclusion work avoid creating commitment resources 4094 nodes may created tree priority 0 63 concurrency level 1 2047 specified transaction program highest priority transaction selected scheduling except limited concurrency policies effect node higher nodes real time another type run rather set priority levels activity may request real time typically used long running batch programs like os 2200 communications manager cpcomm restricted 36 real time priority levels available api applications use user account must privilege use real time priorities site control applications use priority levels real time priorities totally dominate lower priorities quite possible misbehaved real time program tie one processors real time priority applies individual activity thread program may real time non-real time threads executing time run started getting access processor controls rate progress heart exec dispatcher manages processors exec supports 4095 dispatching priorities although sites define small subset two highest priorities ’ switchable recognition certain types processing must allowed continue processor started voluntarily give control interrupt lockout occurs interrupt arrives special cases exec code prevents interrupts order change data interrupt handler may also access interlock used interrupt post processing routines either need run physical processor simply interrupted dispatcher i/o completions i/o initiation examples locks used priorities spin locks way set someone else another processor design requires set short instruction sequences high exec priority used operator command handler functions may run even real time program control expected use short amounts time need time queue work processed low exec activity real time activities unlimited processor quantum run without switching unless interrupted higher priority real time activity high exec activity real time activities given control available processor running something lower priority interrupts sent processors necessary ensure immediate availability real time used customers fly missiles run simulators functions require immediate response transaction priorities may handled two ways defined site may sort lower priority real time priority matters quantum size essentially infinite appropriate short-lived transactions airline reservations one loops due programming error exec terminate reaches small configured maximum time form allows exec vary priority within range optimize system resource usage approach gives higher priority shorter time slices programs i/o limited progressively lower priorities longer time slices computing exec dynamically adjusts priorities based behavior programs often behave ways different times approach appropriate longer running transactions like database queries airline fare quotes batch demand always use dynamically adjusted priorities programs i/o limited conversation time-sharing user get higher priorities short time slices compute-oriented programs get lower priorities longer time slices exec two additional mechanisms optimizing dispatching one affinity-based dispatching possible exec run activity processor last time get greatest advantage residual cache contents n't possible tries keep activity nearest processor standpoint cache memory access times second fairness policy mechanism site define relative percentage resources allocated transactions demand batch within transactions batch priority groupings indicate percentage group time allocated priority ensures transactions dominate system batch work gets done within various priority groupings ensures progress assured group unless group percentage zero fairness algorithms come play processors busy os 2200 systems often run processors near 100 utilized os 2200 supports several models system performance management customers may purchase certain fixed performance level exec monitor processor usage ensure performance exceed level customers also purchase additional performance either temporarily permanently full capacity system workload increases emergency requires recently system added metered usage capability mode full power system always available customer although may administratively limit usage accumulated month reported usage submitted unisys billing depending specific contract terms client may receive bill excess usage contracted baseline month statement showing total contracted usage decremented first form like cell phone bill potential charging excess minutes latter like buying pre-paid phone card os 2200 hierarchical file system operating systems rather structured naming convention notion container files called program files files os 2200 simply containers may addressed either word offset file sector 28-word unit offset file 28 words historical unit early mass storage device fastrand drum could hold 64 units per physical track nonetheless fortunate historical accident four 28-word units 112 words occupy 504 bytes today mass storage devices using 512-byte physical records os 2200 clients almost adopted multiple 112 words physical record size database page size i/o processors automatically adjust 504 512 byte mapping adding 8 bytes zeros writes stripping reads physical record os 2200 handles applications use sizes multiples 112 words indivisibly reading containing physical records writing back unchanged changed portions data chaining special locking functions guarantee indivisibility even device errors across multiple systems cluster file formats internal data structures described data structures programming reference manual ever since exec-8 file names taken form qualifier*filename f-cycle e.g. personnel*employees +1 qualifier filename simply twelve-character strings used create whatever naming structure client desires f-cycle number 0 999 allows multiple generations file may referenced relative numbers +1 next new cycle -1 previous cycle +0 current cycle leaving cycle defaults current cycle batch production runs create new generations files use approach numbers wrap around 999 32 consecutive relative cycle numbers may exist one time creating +1 deletes -31 file may used program file program file contains elements generally act files element naming qualifier*filename f-cycle .element/version e-cycle e.g. personnel*programs.taxcalc/2008 element version twelve-character names used way user desires e-cycle similar f-cycle represents generation number without restriction 32 concurrent cycles limit 256k cycles however e-cycle applies text elements line text element marked cycle numbers inserted deleted elements also type sub-type commonly used types text object default type suitable options select appropriate type text elements also sub-types typically represent programming language e.g. asm c cob default element name object file text file created object element may executed main program linked object elements including main program linking may static dynamic main program may executed without pre-linking provided required sub-programs program file system libraries otherwise known rules may included program file direct dynamic linker search unfulfilled references linker may also used statically link multiple object modules together form new object module containing instructions data information original object modules omnibus elements may used data applications may serve hold structured information applications system utilities assumed structure omnibus element compatibility earlier basic mode programming models relocatable absolute element types relocatable elements output basic mode compilers may combined basic mode static linker map – collector form absolute element executable os 2200 implements fully virtual file system files may allocated anywhere across mass storage devices mass storage treated large space pool similar way virtual memory managed contiguous space allocated possible mass storage treated set pages 8kb size file placed many areas different devices required dynamic expansion files attempts allocate space adjacent previous allocation find space wherever available fact files need even present mass storage used exec file backup system fully integrated file backups made tape reel number recorded file directory space gets short mass storage files simply marked unloaded current backup copy space available use enough space ca n't found way backup started reference unloaded file queued file copied back mass storage whole system automatic generally transparent users general exec provide access methods files simply containers access methods provided language run time systems database manager one exception fixed-block access method provided high-volume transaction processing much less overhead database manager participate locking clustering recovery mechanisms clients want explicit control location files use removable pack concept one time truly represented physically removable disk packs operating system would automatically generate pack mount requests operators needed today still used place files usually database files transaction files one disk volumes files may still span multiple disk volumes list volume names given file created files volume groups still backed subject automatic virtual space management os 2200 also provides full implementation common internet file system cifs cifs implements smb protocol used microsoft servers unix/linux samba software cifs clearpath os 2200 file server file client cifs-compliant systems includes desktop pcs running windows cifs supports smb message signing maintain os 2200 security cifs clearpath os 2200 provides two levels protection first os 2200 files visible network declared shares cifs command specific privilege exists control may declare share second level control access still protected os 2200 security clients accessing os 2200 via cifs either automatically identified via ntlm kerberos presented query os 2200 user id password cifs allows os 2200 files presented hierarchical view typically qualifier appear highest level tree followed filename element name version addition files may stored os 2200 servers using full windows filename format windows applications see os 2200 another file server os 2200 applications apis available read write files existing cifs-compliant servers windows file servers network text files automatically converted os 2200 internal formats binary files must understood application program cifsut utility running os 2200 exchange encrypted compressed files software winzip concept subsystems protected subsystems central design os 2200 subsystem analogous .dll windows code data may shared among programs running system os 2200 subsystem set banks reside separate part address space directly accessed user program instead hardware os provide gate may target call instruction see unisys 2200 series system architecture information database managers run time libraries messaging system many system functions implemented subsystems subsystems usually consisting pure code run time libraries may direct target call instruction without requiring gate subsystems run user program protection environment subsystems database managers consist code data privileged code may called via gate subsystems may also access control lists associated control may call importantly gate controls specific entry points visible protection environment subsystem run often user-specific parameter provides additional secure information caller os 2200 security system designed protect data unauthorized access modification exposure includes implementation dod orange book b1 level specification os 2200 first obtained successful b1 evaluation september 1989 evaluation maintained 1994 point os 2200 developers continued follow development documentation practices required b1 evaluation central b1 system concepts users objects users identities clearance levels compartments privileges objects require certain combinations various types access objects os 2200 consist files protected subsystems devices tape reels security profile user session includes user identity clearance level 0-63 compartment set set allowed privileges os 2200 implements mandatory access control mac discretionary access control dac based bell-la padula model confidentiality read write biba integrity model read write run read execute file run executing clearance level must greater equal clearance level file file clearance level must 0 within clearance level range run addition run executing compartment set must contain file compartment set os 2200 combines bell-la padula biba model requirements run executing clearance level compartment set must exactly match file permit writing file deleting dac associates access control list object list identifies users user groups access defines type access user group allowed read write execute delete full set b1 controls restrictive environments system administrators configure servers choosing controls apply set security levels fundamental security security level 3 serves starting point every os 2200 system one user designated security officer systems configured fundamental security security officer allowed perform certain tasks systems configured higher levels security trusted users may allowed perform tasks os 2200 provides fine-grained security mechanism based principle least privilege principle demands minimum privilege granted necessary perform task required thus os 2200 concept super user role assumed user rather uses large set specific privileges may granted separately user privilege associated specific authority systems configured security level 1 higher levels user creates object object owner default object private creating user may also public controlled access control list owner security officer may create access control list object system configured fundamental security files owners instead created private account project public access controlled read write keys users log system identify optionally select clearance level compartment set use session os 2200 offers flexible authentication system multiple authentication mechanisms supported concurrently client- third party-written authentication software may also used standard authentication capabilities include last two permit use biometrics smart cards authentication mechanism supported technologies os 2200 provides encryption data rest cipher api software subsystem encrypts decrypts caller data cipher api also supports use hardware accelerator card bulk data encryption cmos-based dorado servers cpcomm provides ssl/tls encryption data transit intel-based dorado servers ssl tls provided openssl included dorado firmware dorado servers support tls levels 1.0 1.2 well sslv3 ssl disabled default vulnerabilities protocol cpcomm cipher api use encryption services cryptolib fips-certified software encryption module aes triple des algorithms among algorithms implemented cryptolib os 2200 also supports encrypting tape drives provide encryption archive data os 2200 systems may clustered achieve greater performance availability single system 4 systems may combined cluster sharing databases files via shared disks hardware device xpc-l provides coordination among systems providing high-speed lock manager database file access clustered environment allows system local files databases application groups along shared files one shared application groups local files databases accessed single system shared files databases must disks simultaneously accessible systems cluster xpc-l provides communication path among systems coordination actions also provides fast lock engine connection xpc-l via special i/o processor operates extremely low latencies lock manager xpc-l provides functions required file database locks includes deadlock detection ability free locks failed applications xpc-l implemented two physical servers create fully redundant configuration maintenance including loading new versions xpc-l firmware may performed one servers continues run failures including physical damage one server stop cluster information kept servers os 2200 operations built around active operators one consoles console terminal window part reserved fixed display frequently updated summary information activity system rest console used scrolling display events message issued requires operator response given number 0 9 remains display answered tape mount messages scroll messages repeated every two minutes tape mounted operations sentinel used os 2200 operations os 2200 consoles simply windows within operations sentinel display may many display pcs desired remote operation typical operations sentinel supports number clearpath windows linux unix systems auto-action message database released product database allows operations sentinel recognize messages scripts may written automatically respond messages require response hide unwanted messages translate languages create events etc full dark room operation used clients operations sentinel displays remote locations monitoring system creating alerts certain events occur administration os 2200 systems performed using wide variety tools specialized particular area system example tool used administering transaction environment allows new transaction programs installed specifies necessary information changes queuing structure priorities concurrency levels tools specific security officer allow creation users changing allowed privileges changing system security settings etc tools graphical interface although provide batch stored file interface actions specified control stream allows scripting administrative interfaces either local sites maybe based time day events remote sites unique privileges required administrative area application groups logical construct consisting instance universal data system uds instance message queue subsystem set transactions application group audit trail os 2200 supports maximum 16 application groups system notion application group corresponds often called application set programs data represent larger unit connected processing example application group might represent airline system another application group might represent corporate finance system application groups might represent instances application data models bank branches important thing application group environment sessions recovery etc application groups may started stopped recovered independently application groups accounting scheduling rules transactions multiple application groups may share priorities interleaved priorities permits site control relative priorities transactions across entire system unisys history newsletter contains articles unisys history computers addition unisys history newsletters links sites historical archives unisys charles babbage institute university minnesota hagley museum library delaware charles babbage institute holds archives era early remington rand archives saint paul mn burroughs archives hagley museum library holds bulk sperry archives | [
1710,
4566,
1522,
4759,
3951,
1180,
3106,
5571,
7827,
7733,
5232,
3559,
1298,
1400,
3990,
4261,
7570,
2879,
1785,
5967,
3751
] | Test |
1,744 | 8 | MacHTTP:machttp machttp webserver designed run classic mac os versions 7.x 9.x written software developer chuck shotton originally shareware dates 1993 available source code form sourceforge.net perl artistic license current version 2.6.1 still used older macintosh hardware later commercialized webstar sold originally starnine later bought quarterdeck software program runs mac os x classic environment ported run natively mac os x though attempt apparently underway 2003 functionally replaced apache web server machttp supports common gateway interface standard generating dynamic content well apple events scriptability | [
405
] | Validation |
1,745 | 6 | Unix_file_types:unix file types standard unix file types regular directory symbolic link fifo special block special character special socket defined posix different os-specific implementations allow types posix requires e.g solaris doors file type identified codice_1 command displays type first character file system permissions field regular files unix impose provide internal file structure therefore structure interpretation entirely dependent software using however codice_2 command used determine type data contain take example one line codice_1 output posix specifies format output long format codice_4 option particular first field first space dubbed file mode string first character describes file type rest string indicates file permissions therefore example mode string codice_5 file type codice_6 directory permissions codice_7 internally codice_8 obtains codice_9 structure associated file transforms codice_10 field human-readable format note codice_10 actually bit field two parts file type stored within codice_12 mask tested macros like codice_13 codice_14 value mask codice_12 get file type flags gnu coreutils version codice_8 uses call codice_17 glibc function exposed gnulib library get mode string freebsd uses simpler approach allows smaller number file types regular files show codice_1 hyphen-minus codice_19 mode field common special file directory layout directory file defined filesystem used several filesystems available unix native non-native one directory file layout directory marked codice_6 first letter mode field output codice_21 codice_9 e.g symbolic link reference another file special file stored textual representation referenced file path means destination may relative path may exist symbolic link marked codice_23 lower case codice_24 first letter mode string e.g one strengths unix always inter-process communication among facilities provided os pipes connect output one process input another fine processes exist parent process space started user circumstances communicating processes must use fifos referred named pipes one circumstance occurs processes must executed different user names permissions named pipes special files exist anywhere file system created command codice_25 codice_26 named pipe marked codice_27 first letter mode string e.g socket special file used inter-process communication enables communication two processes addition sending data processes send file descriptors across unix domain socket connection using codice_28 codice_29 system calls unlike named pipes allow unidirectional data flow sockets fully duplex-capable socket marked codice_30 first letter mode string e.g unix almost things handled files location file system even hardware devices like hard drives great exception network devices turn file system handled separately device files used apply access rights devices direct operations files appropriate device drivers unix makes distinction character devices block devices distinction roughly follows although example disk partitions may character devices provide un-buffered random access blocks partition block devices provide buffered random access blocks partition character device marked codice_31 first letter mode string likewise block device marked codice_32 e.g door special file inter-process communication client server currently implemented solaris door marked codice_33 upper case first letter mode string e.g | [
1710,
3979,
1047,
5566,
6017,
4771
] | Test |
1,746 | 9 | Kristen_Nygaard:kristen nygaard kristen nygaard 27 august 1926 – 10 august 2002 norwegian computer scientist programming language pioneer politician internationally nygaard acknowledged co-inventor object-oriented programming programming language simula ole-johan dahl 1960s nygaard dahl received 2001 a. m. turing award contribution computer science nygaard born oslo received master degree mathematics university oslo 1956 thesis abstract probability theory entitled theoretical aspects monte carlo methods nygaard worked full-time norwegian defense research establishment 1948 1960 computing programming 1948–1954 operational research 1952–1960 1957 1960 head first operations research groups norwegian defense establishment cofounder first chairman norwegian operational research society 1959–1964 1960 hired norwegian computing center ncc responsible building ncc research institute 1960s becoming director research 1962 together ole-johan dahl developed simula 1961–1965 simula-67 first object-oriented programming languages introducing core concepts object-oriented programming languages objects classes inheritance virtual quantities multi-threaded quasi-parallel program execution 2004 aito established annual prize name ole-johan dahl kristen nygaard honor pioneering work object-orientation aito dahl-nygaard prize awarded annually two individuals made significant technical contributions field object-orientation work spirit pioneer conceptual and/or implementation work dahl nygaard shaped present view object-oriented programming prize presented year ecoop conference prize consists two awards given senior junior professional conducted research norwegian trade unions planning control data processing evaluated light objectives organised labour 1971–1973 working together olav terje bergo research development work included social impact computer technology general system description language delta 1973–1975 working erik holbaek-hanssen petter haandlykken nygaard professor aarhus denmark 1975–1976 became professor emeritus oslo part-time 1977 full-time 1984–1996 work aarhus oslo included research education system development social impact computer technology became foundation scandinavian school system development closely linked field participatory design beginning 1976 engaged development since 1986 implementation general object-oriented programming language beta together bent bruun kristensen ole lehrmann madsen birger moeller-pedersen language available wide range computers nygaard first half 1980s chairman steering committee scandinavian research program sydpol system development profession oriented languages coordinating research supporting working groups system development language research artificial intelligence also 1980s chairman steering committee cost-13 european common market commission -financed research project extensions profession-oriented languages necessary artificial intelligence information technology becoming part professional work nygaard research 1995-1999 related distributed systems leader general object-oriented distributed systems goods three-year norwegian research council-supported project starting 1997 aiming enriching object-oriented languages system development methods new basic concepts make possible describe relation layered and/or distributed programs computer hardware people carrying programs goods team also included haakon bryhni dag sjøberg ole smørdal nygaard final research interests studies introductory teaching programming creation process-oriented conceptual platform informatics subjects developed new research project called cool comprehensive object-oriented learning together number international test sites giving lectures courses subjects norway elsewhere november 1999 became chair advisory committee broadband communication norwegian department municipal regional affairs held part-time position simula research laboratory 2001 research institute opened june 1990 received honorary doctorate lund university sweden june 1991 became first individual given honorary doctorate aalborg university denmark became member norwegian academy sciences october 1990 computer professionals social responsibility awarded norbert wiener award social professional responsibility 1999 became together dahl first receive rosing prize new prize awarded norwegian data association exceptional professional achievements june 2000 awarded honorary fellowship originating object technology concepts object management group international organization standardization within object-orientation november 2001 dahl awarded ieee john von neumann medal institute electrical electronics engineers introduction concepts underlying object-oriented programming design implementation simula 67 february 2002 given together ole-johan dahl 2001 a. m. turing award association computing machinery acm citation ideas fundamental emergence object oriented programming design programming languages simula simula 67 august 2000 made commander royal norwegian order st. olav king norway 1984 1985 nygaard chairman informatics committee university oslo active design university plan developing research education computing communication facilities faculties university first chairman environment protection committee norwegian association protection nature 10 years 1970s norwegian representative oecd activities information technology member research committee norwegian federation trade unions cooperated unions number countries several years engaged running experimental social institution trying new ways creating humane living conditions socially outcast alcoholics nygaard active norwegian politics mid late 1960s member national executive committee norwegian liberal party chair party strategy committee minor ballot candidate 1949 parliamentary election intense political fight 1972 referendum whether norway become member european common market later european union worked coordinator many youth organisations worked membership 1971 2001 nygaard member labour party member committees research policies party november 1988 became chair information committee norway eec august 1990 reorganized nei til ef organization disseminating information norway relation common market coordinating efforts keep norway outside european union membership norway literally eu 1993 eec ratified maastricht treaty became european union organization changed name reflect nei til ef became largest political organization norway 145,000 members 1994 population 4 million nygaard worked anne enger lahnstein leader anti-eu centre party campaign referendum november 28 1994 nei til eu succeeded 52.2 electorate voted voter participation highest ever norway history 88.8 strategy campaign insisted nygaard something well i.e scandinavian welfare state nygaard considered threatened maastricht agreement resigned chair 1995 later chair organization strategy committee member council 1996 1997 nygaard coordinator efforts establish european anti-maastricht movement team cooperative network national organizations opposing economic monetary union european union emu maastricht treaty european countries within outside eu team successfully started march 3 1997 kristen nygaard married johanna nygaard 1951 johanna nygaard worked norwegian agency aid developing countries specialized number years recruiting giving administrative support specialists working east africa johanna kristen nygaard three children seven grandchildren nygaard died heart attack 2002 | [
7707,
1381,
7009,
3470,
43,
7382,
3895,
1308,
5424,
6485,
7863,
1600,
5621,
1803,
360
] | Validation |
1,747 | 8 | SiteKey:sitekey sitekey web-based security system provides one type mutual authentication end-users websites primary purpose deter phishing sitekey deployed several large financial institutions 2006 including bank america vanguard group bank america vanguard group discontinued use 2015 product owned rsa data security 2006 acquired original maker passmark security sitekey uses following challenge-response technique user phishing site different web site domain legitimate domain user browser refuse send state token step 2 phishing site owner either need skip displaying correct security image prompt user security question obtained legitimate domain pass answers theory could cause user become suspicious since user might surprised re-prompted security questions even used legitimate domain browser recently however practice evidence users generally fail notice anomalies harvard study found sitekey 97 ineffective practice real people n't notice n't care sitekey missing according results also requires users keep track authentication information someone associated n different websites use sitekey must remember n different 4-tuples information site username phrase password may 2015 bank america announced sitekey would discontinued users end year would allow users log username password one step july 2015 vanguard also discontinued use sitekey website | [
4237,
1078
] | Test |
1,748 | 4 | Anthony_Zboralski:anthony zboralski anthony zboralski french hacker artist internet entrepreneur anthony zboralski born martigues france attended parmiter school 1989 1990. 1994 zboralski social engineered fbi connect internet set teleconferences hackers period four months zboralski posed legal attaché paris thomas baker costing fbi 250,000 dollars zboralski part group hackers called w00w00 2011 2013 zboralski worked managing consultant ioactive 2014 zboralski co-founded belua systems limited surfez couvert tv show co-written antoine rivière zboralski zboralski offered practical recommendations protect life 2.0 began airing game one 2013 co-produced flair production mtv networks france | [
6229,
2972,
3486
] | Test |
1,749 | 7 | Intelliquip:intelliquip intelliquip llc develops browser-based software also known intelligent front-end basic function company software automate front-end sales process complex equipment software specialized fluid handling equipment industry compatible pumps compressors valves blowers turboexpanders heat exchangers actuators filters seals couplings motors variable-frequency drives intelliquip browser-based software incorporates concept software service saas means deploy subscription-based hosted service users access via internet without need install software user computer saas platform intelliquip ’ intelligent front-end allows clients deploy selection configuration solutions equipment directly internal sales force sales channels company licensed fpx llc patented core configurator engine use software intelliquip also member hydraulic institute largest association pump industry manufacturers north america part hydraulic institute electronic data exchange committee participate project fiatech adopt aex cfixml schemas implement intelliquip software initiative developing standards automate information exchange design procurement delivery installation operation maintenance engineered equipment | [
330,
3042
] | Test |
1,750 | 4 | Duplicati:duplicati duplicati backup client securely stores encrypted incremental compressed remote backups local files cloud storage services remote file servers duplicati supports various online backup services like onedrive amazon s3 backblaze rackspace cloud files tahoe lafs google drive also servers support ssh/sftp webdav ftp duplicati uses standard components rdiff zip aescrypt gnupg allows users recover backup files even duplicati available released terms gnu lesser general public license lgpl duplicati free software duplicati written mostly c implemented completely within clr enables cross-platform runs well 32-bit 64-bit versions windows macos linux using either .net framework mono duplicati graphical user interface wizard-style interface command-line version use headless environments interfaces use core thus set features capabilities command-line version similar duplicity interface duplicati unique features usually found commercial systems remote verification backup files disk snapshots backup open files disk snapshots performed vss windows lvm linux original duplicati project started june 2008 intended produce graphical user interface duplicity program included port duplicity code use windows dropped september 2008 work clean re-implementation began re-implementation includes sub-programs found duplicity rdiff ftp etc initial version duplicati saw initial release june 2009 2012 work duplicati 2 started complete rewrite includes new storage engine allows efficient incremental continuous backups new user interface web-based makes possible install duplicati 2 headless systems like servers nas also responsive easily used mobile devices even though duplicati 2 still beta already 20,000 active installations duplicati gui command-line interface call common component called main serves binding point operations supported currently encryption compression storage component considered subcomponent loaded runtime making possible third-party developer inject subcomponent duplicati without access source need modify duplicati license type also flexible enough allow redistribution duplicati closed-source storage provider duplicati designed independent provider possible means storage medium supports common commands get/put/list/delete work duplicati duplicity model duplicati based relies heavily components system librdiff tcftp others since duplicati intended cross-platform unlikely components available platforms duplicati re-implements components instead notably duplicati features rdiff aescrypt implementation work system supports clr runtime duplicati gui duplicati 1.x intended used single machine display attached however also possible install duplicati windows service linux daemon set duplicati system tray starting duplicati service limitation addressed duplicati 2 web interface used headless systems duplicati 1.x extremely slow file listings browsing file tree restores take long time since duplicati produces incremental backups corrupt missing incremental volume render following incremental backups next full backup useless duplicati 2 regularly tests backup detect corrupted files early duplicati 1.x stores file modification date metadata like permissions attributes addressed duplicati 2 | [
7838,
4594,
2390,
7821,
2700,
3915,
2566,
5571,
2682,
2530,
3134,
578
] | Test |
1,751 | 0 | Stemming:stemming linguistic morphology information retrieval stemming process reducing inflected sometimes derived words word stem base root form—generally written word form stem need identical morphological root word usually sufficient related words map stem even stem valid root algorithms stemming studied computer science since 1960s many search engines treat words stem synonyms kind query expansion process called conflation computer program subroutine stems word may called stemming program stemming algorithm stemmer stemmer english operating stem cat identify strings cats catlike catty stemming algorithm might also reduce words fishing fished fisher stem fish stem need word example porter algorithm reduces argue argued argues arguing argus stem argu first published stemmer written julie beth lovins 1968 paper remarkable early date great influence later work area paper refers three earlier major attempts stemming algorithms professor john w. tukey princeton university algorithm developed harvard university michael lesk direction professor gerard salton third algorithm developed james l. dolby r consultants los altos california later stemmer written martin porter published july 1980 issue journal program stemmer widely used became de facto standard algorithm used english stemming dr. porter received tony kent strix award 2000 work stemming information retrieval many implementations porter stemming algorithm written freely distributed however many implementations contained subtle flaws result stemmers match potential eliminate source error martin porter released official free software mostly bsd-licensed implementation algorithm around year 2000 extended work next years building snowball framework writing stemming algorithms implemented improved english stemmer together stemmers several languages paice-husk stemmer developed chris paice lancaster university late 1980s iterative stemmer features externally stored set stemming rules standard set rules provides 'strong stemmer may specify removal replacement ending replacement technique avoids need separate stage process recode provide partial matching paice also developed direct measurement comparing stemmers based counting over-stemming under-stemming errors several types stemming algorithms differ respect performance accuracy certain stemming obstacles overcome simple stemmer looks inflected form lookup table advantages approach simple fast easily handles exceptions disadvantages inflected forms must explicitly listed table new unfamiliar words handled even perfectly regular e.g cats cat table may large languages simple morphology like english table sizes modest highly inflected languages like turkish may hundreds potential inflected forms root lookup approach may use preliminary part-of-speech tagging avoid overstemming lookup table used stemmer generally produced semi-automatically example word run inverted algorithm might automatically generate forms running runs runned runly last two forms valid constructions unlikely.. suffix stripping algorithms rely lookup table consists inflected forms root form relations instead typically smaller list rules stored provides path algorithm given input word form find root form examples rules include suffix stripping approaches enjoy benefit much simpler maintain brute force algorithms assuming maintainer sufficiently knowledgeable challenges linguistics morphology encoding suffix stripping rules suffix stripping algorithms sometimes regarded crude given poor performance dealing exceptional relations like 'ran 'run solutions produced suffix stripping algorithms limited lexical categories well known suffixes exceptions however problem parts speech well formulated set rules lemmatisation attempts improve upon challenge prefix stripping may also implemented course languages use prefixing suffixing suffix stripping algorithms may differ results variety reasons one reason whether algorithm constrains whether output word must real word given language approaches require word actually exist language lexicon set words language alternatively suffix stripping approaches maintain database large list known morphological word roots exist real words approaches check list existence term prior making decision typically term exist alternate action taken alternate action may involve several criteria non-existence output term may serve cause algorithm try alternate suffix stripping rules case two suffix stripping rules apply input term creates ambiguity rule apply algorithm may assign human hand stochastically priority one rule another algorithm may reject one rule application results non-existent term whereas overlapping rule example given english term friendlies algorithm may identify ies suffix apply appropriate rule achieve result friendl friendl likely found lexicon therefore rule rejected one improvement upon basic suffix stripping use suffix substitution similar stripping rule substitution rule replaces suffix alternate suffix example could exist rule replaces ies affects algorithm varies algorithm design illustrate algorithm may identify ies suffix stripping rule well suffix substitution rule apply since stripping rule results non-existent term lexicon substitution rule substitution rule applied instead example friendlies becomes friendly instead friendl diving details common technique apply rules cyclical fashion recursively computer scientists would say applying suffix substitution rule example scenario second pass made identify matching rules term friendly ly stripping rule likely identified accepted summary friendlies becomes via substitution friendly becomes via stripping friend example also helps illustrate difference rule-based approach brute force approach brute force approach algorithm would search friendlies set hundreds thousands inflected word forms ideally find corresponding root form friend rule-based approach three rules mentioned would applied succession converge solution chances brute force approach would slower lookup algorithms direct access solution rule-based try several options combinations choose result seems best complex approach problem determining stem word lemmatisation process involves first determining part speech word applying different normalization rules part speech part speech first detected prior attempting find root since languages stemming rules change depending word part speech approach highly conditional upon obtaining correct lexical category part speech overlap normalization rules certain categories identifying wrong category unable produce right category limits added benefit approach suffix stripping algorithms basic idea stemmer able grasp information word stemmed apply accurate normalization rules unlike suffix stripping rules also modify stem stochastic algorithms involve using probability identify root form word stochastic algorithms trained learn table root form inflected form relations develop probabilistic model model typically expressed form complex linguistic rules similar nature suffix stripping lemmatisation stemming performed inputting inflected form trained model model produce root form according internal ruleset similar suffix stripping lemmatisation except decisions involved applying appropriate rule whether stem word return word whether apply two different rules sequentially applied grounds output word highest probability correct say smallest probability incorrect typically measured lemmatisation algorithms stochastic given word may belong multiple parts speech probability assigned possible part may take account surrounding words called context context-free grammars take account additional information either case assigning probabilities possible part speech likely part speech chosen appropriate normalization rules applied input word produce normalized root form stemming techniques use n-gram context word choose correct stem word hybrid approaches use two approaches described unison simple example suffix tree algorithm first consults lookup table using brute force however instead trying store entire set relations words given language lookup table kept small used store minute amount frequent exceptions like ran run word exception list apply suffix stripping lemmatisation output result linguistics term affix refers either prefix suffix addition dealing suffixes several approaches also attempt remove common prefixes example given word indefinitely identify leading prefix removed many approaches mentioned earlier apply go name affix stripping study affix stemming several european languages found algorithms use stem database example set documents contain stem words stems mentioned necessarily valid words rather common sub-strings brows browse browsing order stem word algorithm tries match stems database applying various constraints relative length candidate stem within word example short prefix stem words would considered stem word beside .. much early academic work area focused english language significant use porter stemmer algorithm many languages investigated hebrew arabic still considered difficult research languages stemming english stemmers fairly trivial occasional problems dries third-person singular present form verb dry axes plural axe well axis stemmers become harder design morphology orthography character encoding target language becomes complex example italian stemmer complex english one greater number verb inflections russian one complex noun declensions hebrew one even complex due nonconcatenative morphology writing system without vowels requirement prefix stripping hebrew stems two three four characters multilingual stemming applies morphological rules two languages simultaneously instead rules single language interpreting search query commercial systems using multilingual stemming exist two error measurements stemming algorithms overstemming understemming overstemming error two separate inflected words stemmed root been—a false positive understemming error two separate inflected words stemmed root not—a false negative stemming algorithms attempt minimize type error although reducing one type lead increasing example widely used porter stemmer stems universal university universe univers case overstemming though three words etymologically related modern meanings widely different domains treating synonyms search engine likely reduce relevance search results example understemming porter stemmer alumnus → alumnu alumni → alumni alumna alumnae → alumna english word keeps latin morphology near-synonyms conflated stemming used approximate method grouping words similar basic meaning together example text mentioning daffodils probably closely related text mentioning daffodil without cases words morphological stem idiomatic meanings closely related user searching marketing satisfied documents mentioning markets marketing stemmers common elements query systems web search engines effectiveness stemming english query systems soon found rather limited however led early information retrieval researchers deem stemming irrelevant general alternative approach based searching n-grams rather stems may used instead also stemmers may provide greater benefits languages english stemming used determine domain vocabularies domain analysis many commercial companies using stemming since least 1980s produced algorithmic lexical stemmers many languages snowball stemmers compared commercial lexical stemmers varying results google search adopted word stemming 2003 previously search fish would returned fishing software search algorithms vary use word stemming programs simply search substrings obviously find fish fishing searching fishes find occurrences word fish | [
3601,
5800,
1718,
1444,
4760,
8065,
7138,
715,
4403,
5304,
3292,
2215,
7372,
4337,
3651,
4349,
4089,
1314,
5429,
6489,
5528,
5612,
84,
5885,
5008
] | Validation |
1,752 | 3 | Claasen's_law:claasen law claasen logarithmic law usefulness named technologist theo a. c. m. claasen introduced idea 1999 cto philips semiconductors law also expressed system parameters e.g ram cpu speed disk capacity need increase multiple create noticeable impact performance case ram law 256mb unit practically useful 128mb unit though base unit doubled would require 16384mb 128 × 128mb unit ram truly double performance law modern car e.g ford mondeo substantially useful getting occupants b older car e.g ford model order achieve linear improvement usefulness time necessary exponential increase technology time moore law delivers exponential increase technology claasen law combined moore law implies linear improvement usefulness time | [
1592
] | Validation |
1,753 | 3 | Baikal_CPU:baikal cpu baikal cpu line mips arm-based microprocessors developed fabless design firm baikal electronics spin-off russian supercomputer company t-platforms judging information available online sources baikal electronics selected different approach compared russian microprocessor initiatives elbrus-2sm elbrus-8s mcst multiclet line chips design baikal electronics based existing commercial ip cores imagination technologies arm holdings compared innovative approach multiclet elbrus cpu history dating back elbrus supercomputers soviet union march 2015 synopsys inc. announced baikal electronics selected synopsys solutions accelerate design verification advanced system chips may 2015 baikal electronics imagination technologies announced first commercial baikal microprocessor based mips warrior p5600 called baikal-t1 first samples new cpu available starting june 2015 baikal-t1 mainly targets applications networking industrial automation features hardware support virtualization high performance 128-bit simd engine march 2016 announced imagination technologies blog desktop pc called tavolga terminal also known meadowsweet terminal pc available order t-platforms computer based baikal-t1 cpu sm750 graphics processing unit debian linux operating system | [
4657,
5364,
3098,
7442,
650,
5571,
578,
8102,
5055,
1761,
1778,
6480,
3747,
1237,
352,
971
] | Validation |
1,754 | 4 | REACH_authorisation_procedure:reach authorisation procedure authorisation procedure one regulatory tools european regulation ec reach n°1907/2006 aiming ban use substances high concern svhc included annex xiv reach substitute technically economically feasible alternatives process concerns manufacturers importers downstream users substances representatives foreign manufacturers also apply authorisation authorisation today impacts many industries including aerospace electronics automotive energy paint industries moreover defence applications de facto exempted authorisation process member states must decide case case basis whether company benefit procedure outlined article 2.3 reach reach regulation relies four main procedures registration evaluation restriction authorisation chemical substances eu member states european chemicals agency request european commission submit propositions identify substances high concern based criteria laid article 57 reach work supported expert groups echa eu member states based various criteria screening methodologies order identify relevant svhcs annex xiv last step prioritisation process lists svhcs exhibit particularly high risk human health environment based inherent properties quantities uses order forbid use eu market recommendations include svhcs annex xiv made echa debated relevant stakeholders member states companies ngos etc. final decision inclusion substance annex xiv taken european commission listed annex xiv reach regulation substance therefore assigned “ sunset date ” use banned unless authorisation granted definite period time today 2015/05/26 161 substances listed candidate list 31 substances listed annex xiv candidate list usually updated every 6 months annex xiv updated every 12 18 months authorisation procedure complex concerns manufacturers importers downstream users representatives substances banning use takes effect sunset date date use substance possible companies granted authorisation submitted dossier latest application date latter indeed benefit transitional period pending eu commission final decision exception made downstream users case upstream stakeholder within supply chain granted authorisation substance use point view supply chain substance matters instance subcontractors authorised importers covered annex xiv substance use supplied via supply chain authorisation application made granted finally downstream users need apply authorisation nevertheless obligation notify use echa art 66 reach check compliance risk management measures concerned companies thus invited take measures soon substance use enters candidate list enquiring impacted actors strategies authorisation applications made one several specific uses article 3 reach thus defines “ use ” “ processing formulation consumption storage keeping treatment filling containers transfer one container another mixing production article use ” framework authorisation dossier description use applied specify market supply chain processes type articles concerned use applied consistent enough cover exposure scenario also analysis alternatives use applied mistaken identified use corresponds reach registration process identified use focuses process consider performances markets questions exceptions exist application authorisation required production article may require authorisation point finished articles require authorisation put market even though still contain substance subject authorisation consequently articles requiring use annex xiv substance still produced outside eu imported particular case future restrictions procedure could however limit placing market articles risk remains art 58.6 reach review period duration eu commission authorises use substance sunset date following durations considered review periods end review period application authorisation reassessed evaluate progress made terms research development substitution applications extend review period made latest 18 months expiry date european commission may also reduce duration new circumstances appear terms risks impacts court european union qualified rule appeals applications authorisation member states turn responsible controlling decision implementation application authorisation afa made three main parts chemical safety report csr analysis alternatives aoa socio-economic analysis sea goal dossier demonstrate alternative substance immediately available risks controlled social economic advantages use substance outweigh risks human health environment dossier usually takes 6 18 months preparation echa guidelines available assist drafting application authorisation filed latest application date lad set 18 months sunset date lad enables benefit transitional period pending european commission decision afa made one several substances case grouping need demonstrated basis annex xi reach one several uses applied one several companies latter case called joint application requires appointing main applicant contact point echa two submission routes planned reach regulation adequate control route goal chemical safety report prove threshold values respected socio-economic route goal chemical safety report demonstrate risks reduced minimum chemical safety report contains aoa aims demonstrate alternative appropriate i.e technically economically feasible less risky available analysis alternatives therefore presents substance alternative solutions contains socio-economic analysis compulsory document socio-economic route also complete application justified adequate control route aims demonstrate advantages use substance outweigh risks human health environment purpose applicants must compare two scenarios ‘ use scenario ’ continued use substance one hand ‘ non-use scenario ’ cease use substance hand discuss impacts contains dossiers submitted submission windows february may august november echa strongly advise follow windows plenary sessions two committees rac seac organised march june september december year submitting plenary sessions submission windows therefore helps efficient assessment application applications deemed received business rules check successfully passed provided echa fees paid time examination dossier carried risk assessment committee rac socio-economic analysis committee seac opens public consultation alternatives 8 weeks companies ngos interested party possibility comment possibly challenge alternatives proposed applicant consultation followed additional discussions two committees order clarify application process called trialogue stakeholders invited participate duration examination varies according complexity clarity dossier committees however obligation deliver first opinion dossier 10 months submission latest dossier committee opinion sent commission whole process take 2 years may 4 2015 28 applications authorisation filed total 56 uses dossier requires implementing specific strategy define uses analysis industrial processes associated risks alternatives socio-economic impacts banning substance committees expect dossier contain precise description industrial process operational conditions representative dossier well risk management measures implemented applicant main issue application authorisation process duration review period granted therefore critical bring necessary precisions dossiers justify requested review period duration justification weak argumentation generic may induce granting shorter-than-requested review period beyond simple drafting application authorisation dossier whole process implies expertise deep analysis company activity multiple aspects analysis therefore requires extensive collection information also possibly contacts customers strengthen analysis alternatives public consultation one core mechanisms authorisation process stakeholders ’ competing companies universities laboratories ngos member states etc involvement consultation process growing last years reach 400 comments single dossier influence comments particular concerning alternatives makes major step authorisation process order streamline process templates comments instructions available echa website consulting costs application authorisation estimated echa amounts average around 230,000 eur single use | [] | Test |
1,755 | 2 | Windows_Imaging_Component:windows imaging component windows imaging component wic component object model based imaging codec framework introduced windows vista later available windows xp service pack 3 working processing digital images image metadata allows applications supporting framework automatically get support installed codecs graphics file formats similar directshow acm/vcm extended using image codecs support third-party graphics formats system-wide basis additionally windows presentation foundation applications also automatically support installed image codecs codecs raw image formats used high-end professional digital cameras also supported manner wic enables application developers perform image processing operations image format single set common apis without requiring prior knowledge specific image formats writing codec wic developers get system-wide support graphics file format applications use wic .net 3.x wpf windows imaging component provides extensible architecture image codecs pixel formats metadata automatic run-time discovery new formats supports reading writing arbitrary metadata image files ability preserve unrecognized metadata editing working images preserves high bit depth image data 32 bits per channel throughout revamped high dynamic range image processing pipeline built windows vista windows imaging component supports windows color system icc v4-compliant color management technology windows vista default windows vista ships jpeg tiff gif png bmp hd photo encoders decoders ico decoder additionally 2009 camera manufacturers 3rd-parties released wic codecs proprietary raw image formats enabling mac-like raw image support windows 7 vista july 2011 extended significantly microsoft providing separate codec pack current digital cameras progressive graphics file pgf viewer distributed wic codec wic supports exchangeable image file exif png textual metadata image file directory ifd iptc information interchange model iptc extensible metadata platform xmp formats addition wic includes extensible framework support third-party metadata implementations metadata format support per codec example native jpeg codec supports xmp native gif png codecs wic available windows xp service pack 2 stand-alone downloadable program built windows xp service pack 3 also available part .net framework 3.0 discontinued powertoy windows xp microsoft known photo info allows viewing editing image metadata windows explorer also uses wic starting windows vista windows explorer windows photo gallery based wic thus view organize images format wic codec installed office 2010 later versions core office apps word excel powerpoint outlook import image file formats supported wic starting windows 7 windows media center available windows 7 home premium wic-enabled also gdi+ graphic library built wic although gdi+ load 3rd-party external codecs windows 7 wic stack underwent major overhaul free-threaded built-in external codecs shipping windows free-threaded also requirement new codecs targeting windows 7 microsoft expression design import export capabilities entirely based wic expression media phase one media pro service pack 1 later also supports additional raw camera formats hd photo jpeg xr using wic 2018 third-party imaging applications image editors image organizers image viewers utilize wic fastpictureviewer simple standalone third-party image viewer supports standard image formats along hd photo raw camera formats nrw nef cr2 dng using wic experimental wic import plug-in adobe photoshop also found fastpictureviewer website another wic import plug-in gimp found gimp-forum.net | [
7149,
6420,
714,
720,
1460,
2928,
7907,
5747,
2953,
6840,
422,
4017,
6504,
4022,
4026,
7607,
1526,
3687,
2283,
5479,
7263,
5850,
150,
6933,
519,
3052,
4448,
3407,
1232,
2702,
7687,
1989,
4848,
6256,
4129,
8073,
2018,
8085,
6989,
6991,
5... | Test |
1,756 | 4 | The_Sleuth_Kit:sleuth kit sleuth kit tsk library collection unix- windows-based utilities facilitate forensic analysis computer systems written maintained primarily digital investigator brian carrier sleuth kit capable parsing ntfs fat/exfat ufs 1/2 ext2 ext3 ext4 hfs iso 9660 yaffs2 file systems either separately within disk images stored raw dd expert witness aff formats sleuth kit used examine microsoft windows apple macintosh osx many linux unix computers sleuth kit used sleuth kit free open-source suite provides large number specialized command-line based utilities based coroner toolkit official successor platform tools included sleuth kit include | [
452,
1715,
5983,
3842,
4759,
1534,
3517,
3179,
2195,
5561,
4316,
3700,
7825,
5571,
7181,
578,
6020,
5150,
4523,
7105,
7848,
3823,
5254,
6488,
5783,
174,
4375,
8148,
1435
] | Test |
1,757 | 7 | SAP_Cloud_Platform:sap cloud platform sap cloud platform platform service developed sap se creating new applications extending existing applications secure cloud computing environment managed sap sap cloud platform integrates data business processes sap cloud platform open platform-as-a-service includes in-memory sap hana database management system connects premises cloud-based systems running sap third-party software relies open standards like java javascript node.js cloud foundry integration options sap cloud platform promoted build extend business applications rapid innovation cycles sap apple inc. partnered develop mobile applications ios using cloud-based software development kits sdks sap cloud platform sap cloud platform based open source technology developed supported partnership suse company also partnership cloud foundry beta offering sap cloud platform enables customers test give feedback functionalities coming cloud foundry initially unveiled sap netweaver cloud belonging sap hana cloud portfolio october 16 2012 cloud platform reintroduced new name sap hana cloud platform may 13 2013 foundation sap cloud products including sap businessobjects cloud adoption sap hana cloud platform increased steadily since platform launch 2012 sap claiming 4000 customers 500 partners adopting sap hana cloud platform february 27 2017 sap hana cloud platform renamed sap cloud platform mobile world congress sap cloud platform contains many services better overview assigned several categories following list contains categories defined sap applications available sap hana app center extend integrate applications customize existing applications extend mobile footprint mobile-first apps sap cloud platform organizations better engage customers empower employees developers build applications running cloud still access data premises clouds sap cloud platform developer edition offers users easy free way explore sap cloud platform capabilities addition 1gb shared sap hana sap cloud platform provides users | [
4211,
5894,
2451,
4217,
2988,
7613,
370,
632,
189,
289,
1634,
3091,
6262,
7165,
3954,
7722,
3958,
6806,
22,
1550,
5927,
2212,
6906,
5135,
7741,
320,
3028,
7838,
5940,
2317,
842,
3309,
754,
5064,
330,
7114,
4627,
518,
2961,
2430,
4636,
... | Test |
1,758 | 5 | Anti-replay:anti-replay anti-replay sub-protocol ipsec part internet engineering task force ietf main goal anti-replay avoid hackers injecting making changes packets travel source destination anti-replay protocol uses unidirectional security association order establish secure connection two nodes network secure connection established anti-replay protocol uses packet sequence numbers defeat replay attacks follows source sends message adds sequence number packet sequence number starts 0 incremented 1 subsequent packet destination maintains 'sliding window record sequence numbers validated received packets rejects packets sequence number lower lowest sliding window i.e old already appears sliding window i.e duplicates/replays accepted packets validated update sliding window displacing lowest sequence number window already full see also replay attack | [
2644
] | Test |
1,759 | 3 | NLX_(motherboard_form_factor):nlx motherboard form factor nlx new low profile extended form factor proposed intel developed jointly ibm dec vendors low profile low cost mass-marketed retail pcs release 1.2 finalized march 1997 release 1.8 finalized april 1999 nlx similar overall design lpx including riser card low-profile slimline case modernized updated allow support latest technologies keeping costs fixing main problems lpx specified motherboards size officially nlx form factor designed use atx power supplies featured soft power function however nlx cases instead used smaller sfx form factor proprietary form factors 20-pin connector many slimline systems formerly designed fit lpx form factor modified fit nlx nlx true standard unlike lpx making interchangeability components easier older form factor ibm gateway nec produced fair number nlx computers late 1990s primarily socket 370 pentium ii-iii celeron nlx never enjoyed widespread acceptance lpx importantly one largest pc manufacturers dell decided using nlx created proprietary motherboards use slimline systems although many computers motherboards still available secondhand new production essentially ceased slimline small form factor market nlx superseded micro-atx flexatx mini-itx form factors | [
7212,
7302,
4974,
6478,
7041,
7484,
972,
6089,
2147
] | Test |
1,760 | 8 | Business_Process_Execution_Language:business process execution language web services business process execution language ws-bpel commonly known bpel business process execution language oasis standard executable language specifying actions within business processes web services processes bpel export import information using web service interfaces exclusively one describe web-service interactions two ways executable business processes abstract business processes ws-bpel aims model behavior processes via language specification executable abstract business processes extends web services interaction model enables support business transactions also defines interoperable integration model facilitate expansion automated process integration within businesses development came notion programming large programming small required different types languages serialized xml aims enable programming large concepts programming large programming small distinguish two aspects writing type long-running asynchronous processes one typically sees business processes origins ws-bpel go back web services flow language wsfl xlang 2001 ibm microsoft defined fairly similar programming large languages wsfl web services flow language xlang respectively microsoft even went ahead created scripting variant called xlang/s would later serve basis orchestrations services inside biztalk server specifically documented language proprietary fully documented advent popularity bpml growing success bpmi.org open bpms movement led jboss intalio inc. ibm microsoft decided combine languages new language bpel4ws april 2003 bea systems ibm microsoft sap siebel systems submitted bpel4ws 1.1 oasis standardization via web services bpel technical committee although bpel4ws appeared 1.0 1.1 version oasis ws-bpel technical committee voted 14 september 2004 name spec ws-bpel 2.0 change name aligned bpel web service standard naming conventions start ws- similar ws-security took account significant enhancements made bpel4ws 1.1 ws-bpel 2.0 discussing specific version moniker bpel commonly used june 2007 active endpoints adobe systems bea ibm oracle sap published bpel4people ws-humantask specifications describe human interaction bpel processes implemented ten original design goals associated bpel bpel orchestration language choreography language primary difference orchestration choreography executability control orchestration specifies executable process involves message exchanges systems message exchange sequences controlled orchestration designer choreography specifies protocol peer-to-peer interactions defining e.g. legal sequences messages exchanged purpose guaranteeing interoperability protocol directly executable allows many different realizations processes comply choreography realized writing orchestration e.g. form bpel process peer involved orchestration choreography distinctions based analogies orchestration refers central control conductor behavior distributed system orchestra consisting many players choreography refers distributed system dancing team operates according rules choreography without centralized control bpel focus modern business processes plus histories wsfl xlang led bpel adopt web services external communication mechanism thus bpel messaging facilities depend use web services description language wsdl 1.1 describe outgoing incoming messages addition providing facilities enable sending receiving messages bpel programming language also supports standard graphical notation ws-bpel oasis technical committee decided scope vendors invented notations notations take advantage fact constructs bpel block-structured e.g. sequence pick scope etcetera feature enables direct visual representation bpel process descriptions form structograms style reminiscent nassi–shneiderman diagram others proposed use substantially different business process modeling language namely business process model notation bpmn graphical front-end capture bpel process descriptions illustration feasibility approach bpmn specification includes informal partial mapping bpmn bpel 1.1 detailed mapping bpmn bpel implemented number tools including open-source tool known bpmn2bpel however development tools exposed fundamental differences bpmn bpel make difficult cases impossible generate human-readable bpel code bpmn models even difficult problem bpmn-to-bpel round-trip engineering generating bpel code bpmn diagrams maintaining original bpmn model generated bpel code synchronized sense modification one propagated bpel control structures 'if-then-elseif-else 'while well variable manipulation facilities depend use 'programming small languages provide logic bpel implementations must support xpath 1.0 default language design bpel envisages extensibility systems builders use languages well bpelj effort related jsr 207 may enable java function 'programming small language within bpel despite wide acceptance web services distributed business applications absence human interactions significant gap many real-world business processes fill gap bpel4people extended bpel orchestration web services alone orchestration role-based human activities well within context business process bpel4people extending bpel additional independent syntax semantic ws-humantask specification introduces definition human tasks notifications including properties behavior set operations used manipulate human tasks coordination protocol introduced order control autonomy life cycle service-enabled human tasks interoperable manner bpel4people specification introduces ws-bpel extension address human interactions ws-bpel first-class citizen defines new type basic activity uses human tasks implementation allows specifying tasks local process use tasks defined outside process definition extension based ws-humantask specification version 2.0 introduced changes new features | [
1710,
5631,
4028,
7333,
5111,
1825,
4770,
6714,
6986,
302,
6015,
7368,
4246,
5409,
7921,
7565,
2054,
1224,
1409,
3498,
4203,
2807
] | Test |
1,761 | 3 | KOMDIV-32:komdiv-32 komdiv-32 family 32-bit microprocessors developed manufactured scientific research institute system development niisi russian academy sciences manufacturing plant niisi located dubna grounds kurchatov institute komdiv-32 processors intended primarily spacecraft applications many radiation hardened rad-hard microprocessors compatible mips r3000 integrated mips r3010 compatible floating-point unit | [
4657,
6872,
5364,
4221,
3098,
6014,
1753,
8102,
4336,
4062,
5055,
1778,
6480,
3741,
4368,
3747,
1237,
352,
971
] | Test |
1,762 | 7 | Online_SAS:online sas online sas also known online.net french cloud computing web hosting company founded xavier niel 1999 100 subsidiary iliad group company provides physical dedicated servers cloud computing architectures dedibox scaleway brands domain registration services bookmyname brand colocation services datacenters brand iliad datacenter company second player france gb/s internet traffic 1999 online started activities web hosting domain name registration services august 2002 domain name registrar bookmyname bought iliad concurrent ldcom may 2006 rental dedicated servers dedibox brand launched december 2008 iliad bought alice adsl also took construction operation datacenters launched 1999 isdnet bought cable wireless january 2000 acquired tiscali france june 2003 finally renamed iliad datacenter april 2010 online merges dedibox another subsidiary iliad bringing together different hosting activities single brand 2012 company opened third datacenter 11800 m² vitry-sur-seine 11 months construction works site received first tier-iii certification france uptime institute january 2014 since 2012 company publishes real time pue datacenters pue.online.net effort transparency 2013 online launched labs.online.net preview infrastructure service offer based dedicated hardware without virtualization based arm cpus hardware made factory near laval france april 2015 service left beta status renamed scaleway popularity platform grows online added servers x86_64 based cpus march 2016 online owns operates several data centers located île-de-france region past company operated also since august 2013 network online as12876 online s.a.s independent one free case allowed company move away closed interconnection policy internet service provider early 2015 company announced exceeded gb/s immediate internet traffic may 2016 online shows total gb/s capacity links weathermap present following internet exchange points france-ix equinix-ix ams-ix et neutral internet exchange | [
1930,
978,
2961,
6179,
4948,
1982,
1142
] | Train |
1,763 | 9 | Curry_(programming_language):curry programming language curry experimental functional logic programming language based haskell language merges elements functional logic programming including constraint programming integration nearly superset haskell lacking support mostly overloading using type classes implementations provide anyway language extension münster curry compiler functional program set functions defined equations rules functional computation consists replacing subexpressions equal regards function definitions subexpressions replacements reductions possible value normal form obtained instance consider function double defined expression “ ” replaced latter replaced interpret operator “ ” defined infinite set equations e.g. etc similar way one evaluate nested expressions subexpressions replaced quoted also another order evaluation replace arguments operators right left case derivations lead result property known confluence follows fundamental property pure functional languages termed referential transparency value computed result depend order time evaluation due absence side effects simplifies reasoning maintenance pure functional programs many functional languages like haskell curry supports definition algebraic data types enumerating constructors instance type boolean values consists constructors declared follows functions booleans defined pattern matching i.e. providing several equations different argument values principle replacing equals equals still valid provided actual arguments required form e.g complex data structures obtained recursive data types instance list elements type elements arbitrary denoted type variable either empty list “ ” non-empty list “ ” consisting first element list type “ ” usually written finite lists x1x2 ... xn written x1x2 ... xn define operations recursive types inductive definitions pattern matching supports convenient separation different cases instance concatenation operation “ ” polymorphic lists defined follows optional type declaration first line specifies “ ” takes two lists input produces output list list elements unspecified type beyond application various programming tasks operation “ ” also useful specify behavior functions lists instance behavior function last yields last element list specified follows lists xs elements e xs e ∃ysyse xs based specification one define function satisfies specification employing logic programming features similarly logic languages functional logic languages provide search solutions existentially quantified variables contrast pure logic languages support equation solving nested functional expressions equation like yse solved instantiating ys list e value curry one define operation last follows symbol “ ” used equational constraints order provide syntactic distinction defining equations similarly extra variables i.e. variables occurring left-hand side defining equation explicitly declared “ ” order provide opportunities detect bugs caused typos conditional equation form l c r applicable reduction condition c solved contrast purely functional languages conditions evaluated boolean value functional logic languages support solving conditions guessing values unknowns condition narrowing discussed next section used solve kind conditions narrowing mechanism whereby variable bound value selected among alternatives imposed constraints possible value tried order remainder program invoked case determine validity binding narrowing extension logic programming performs similar search actually generate values part search rather limited testing narrowing useful allows function treated relation value computed directions curry examples previous section illustrate noted previous section narrowing thought reduction program term graph often many different ways strategies reduce given term graph antoy et al proved 1990s particular narrowing strategy needed narrowing optimal sense number reductions get normal form corresponding solution minimal among sound complete strategies needed narrowing corresponds lazy strategy contrast sld-resolution strategy prolog rule defining shown expresses fact actual argument must match result narrowing expression curry express property also following concise way haskell allow declaration since pattern left-hand side contains defined function pattern also called functional pattern functional patterns enabled combined functional logic features curry support concise definitions tasks requiring deep pattern matching hierarchical data structures since curry able solve equations containing function calls unknown values execution mechanism based non-deterministic computations similarly logic programming mechanism supports also definition non-deterministic operations i.e. operations delivers one result given input archetype non-deterministic operations predefined infix operation called choice operator returns one arguments operator defined following rules thus evaluation expression returns well computing non-deterministic operations computing free variables narrowing expressive power rules defining show important feature curry rules tried order evaluate operation hence one define operation insert element list indeterminate position operation defined returns permutation given input list due absence side effects functional logic program executed different strategies evaluate expressions curry uses variant needed narrowing strategy combines lazy evaluation non-deterministic search strategies contrast prolog uses backtracking search solutions curry fix particular search strategy hence implementations curry like kics2 user easily select search strategy like depth-first search backtracking breadth-first search iterative deepening parallel search | [
6980,
6507,
7557,
2740,
6120,
4573,
8137,
5571,
3944,
8097,
154,
1435
] | Test |
1,764 | 3 | List_of_former_IA-32_compatible_processor_manufacturers:list former ia-32 compatible processor manufacturers 32-bit intel architecture became dominant computing platform 1980s 1990s multiple companies tried build microprocessors compatible intel instruction set architecture companies successful mainstream computing market far amd market presence computing market couple product generations cyrix successful 386 486 generations products well pentium introduced list former ia-32 compatible microprocessor vendors | [
4900,
5822,
2744,
6922,
352
] | Test |
1,765 | 2 | Commercial_Operating_System_(COS):commercial operating system cos cos-3xx commercial operating system name used digital equipment corporation family operating systems supported use dibol programming language combining features basic fortran cobol cos also supported rpg report program generator commercial operating system implemented run hardware pdp-8 pdp-11 family cos-310 developed pdp-8 provide operating environment dibol cos-310 system purchased package included desk vt-52 vdt video display tube pair eight inch floppy drives optionally could purchase one 2.5 mb hard drives removable media cos-310 one operating systems available decmate ii unlike tss-8 user 4k virtual machine cos user virtual 32k cos-350 developed support pdp-11 port dibol focus vendors turnkey software packages pre-cos-350 pdp 11/05 single-user batch-oriented implementation released multi-user pdp 11/10-based cos came 4 years later much powerful pdp-11/34 added significant configuration flexibility expansion capability | [
2582,
4946,
861,
5571,
190,
4786,
7396,
6804
] | Test |
1,766 | 4 | Zombie_(computing):zombie computing computing zombie computer connected internet compromised hacker computer virus trojan horse program used perform malicious tasks one sort another remote direction botnets zombie computers often used spread e-mail spam launch denial-of-service attacks dos attacks owners zombie computers unaware system used way owner tends unaware computers metaphorically compared fictional zombies coordinated ddos attack multiple botnet machines also resembles zombie horde attack depicted fictional zombie films zombie computers used extensively send e-mail spam 2005 estimated 50–80 spam worldwide sent zombie computers allows spammers avoid detection presumably reduces bandwidth costs since owners zombies pay bandwidth spam also greatly furthers spread trojan horses trojans self-replicating rely movement e-mails spam grow whereas worms spread means similar reasons zombies also used commit click fraud sites displaying pay-per-click advertising others host phishing money mule recruiting websites zombies used conduct distributed denial-of-service ddos attacks term refers orchestrated flooding target websites large numbers computers large number internet users making simultaneous requests website server intended result crashing prevention legitimate users accessing site variant type flooding known distributed degradation-of-service committed pulsing zombies distributed degradation-of-service moderated periodical flooding websites done intent slowing rather crashing victim site effectiveness tactic springs fact intense flooding quickly detected remedied pulsing zombie attacks resulting slow-down website access go unnoticed months even years notable incidents distributed denial- degradation-of-service attacks past include attack upon spews service 2003 one blue frog service 2006 2000 several prominent web sites yahoo ebay etc clogged standstill distributed denial service attack mounted ‘ mafiaboy ’ canadian teenager attack grc.com discussed length perpetrator 13-year-old probably sardis mississippi identified gibson research web site steve gibson disassembled 'bot zombie used attack traced distributor account research describes operation 'bot'-controlling irc channel beginning july 2009 similar botnet capabilities also emerged growing smartphone market examples include july 2009 wild release sexy space text message worm world first botnet capable sms worm targeted symbian operating system nokia smartphones later month researcher charlie miller revealed proof concept text message worm iphone black hat briefings also july united arab emirates consumers targeted etisalat blackberry spyware program 2010s security community divided real world potential mobile botnets august 2009 interview new york times cyber security consultant michael gregg summarized issue way point smart phones desktops '80s | [
2173,
6788,
7151,
6417,
6419,
7186,
740,
2577,
5401,
6823,
1482,
74,
7600,
3680,
4025,
6515,
1166,
2996,
3698,
5848,
7657,
3047,
4446,
1594,
7307,
3071,
2354,
3426,
880,
3076,
2733,
2021,
7729,
210,
924,
6643,
3486,
1316,
2789,
8133,
16... | Validation |
1,767 | 7 | TerraNet_AB:terranet ab terranet ab company delivers mobile telephony data services via peer-to-peer mobile mesh network handsets light infrastructure headquartered sweden currently led ceo pär-olof johannesson system uses unit within range additional network node allowing voice data transmission via radio frequency rather conventional cell sites terranet concept originally developed way bring mobile coverage under-served geographies populations technology much broader market terranet phone switched begins look phones within effective range finds connects extends radio network actual number dialled handset uses checks see person called within range handsets network call goes detractors questioned terranet lack clear business model though device manufacturers appear interested efforts noted thought leaders voice ip alexander straub truphone identified mesh networks next big thing telecoms terranet ab founded 2004 inventor technology anders carlius serial entrepreneur lund skåne county carlius came background chip manufacturing switchcore also worked web portal operator spray network served first ceo 2010 since inception terranet headquartered lund ideon science park best known home ericsson radio systems carlius says came idea travelling safari east africa wife emma first extensive pilot project carried autumn 2005 farming co-operative botswana trials included agreement indian operator bharat sanchar nigam test 50 handsets late 2012 number pilots south america year development engineer conny said main prerogative miniaturise terranet credit card-sized circuit could installed mobile handset company prestigious red herring magazine award april 2008 carlius received number honours work promoting entrepreneurship sweden including leadership awards 2005 rapidus 2008 jönköping international business school terranet supported private investors july 2013 emerged serial entrepreneur dan olofsson bought 12.5 stake ceo pär-olof johannesson acknowledged oloffson investment means lot company well-known operator heavy industrial background knows industry inside | [
6025,
6987
] | Test |
1,768 | 1 | Temporal_database:temporal database temporal database stores data relating time instances offers temporal data types stores information relating past present future time temporal databases could uni-temporal bi-temporal tri-temporal specifically temporal aspects usually include valid time transaction time decision time uni-temporal database one axis time either validity range system time range bi-temporal database two axes time tri-temporal database three axes time approach introduces additional complexities temporal databases contrast current databases confused currently available databases store facts believed true current time temporal databases support managing accessing temporal data providing one following features development sql attendant use real-life applications database users realized added date columns key fields issues arose example table primary key attributes adding date primary key track historical changes lead creation rows intended deletes must also handled differently rows tracked way 1992 issue recognized standard database theory yet resolving issue neither then-newly formalized sql-92 standard richard snodgrass proposed 1992 temporal extensions sql developed temporal database community response proposal committee formed design extensions 1992 edition sql standard ansi x3.135.-1992 iso/iec 9075:1992 extensions known tsql2 developed 1993 committee late 1993 snodgrass presented work group responsible american national standard database language sql ansi technical committee x3h2 known ncits h2 preliminary language specification appeared march 1994 acm sigmod record based responses specification changes made language definitive version tsql2 language specification published september 1994 attempt made incorporate parts tsql2 new sql standard called sql3 parts tsql2 included new substandard sql3 iso/iec 9075-7 called sql/temporal tsql2 approach heavily criticized chris date hugh darwen iso project responsible temporal support canceled near end 2001 december 2011 iso/iec 9075 database language part 2 sql/foundation included clauses table definitions define application-time period tables valid time tables system-versioned tables transaction time tables system-versioned application-time period tables bitemporal tables substantive difference tsql2 proposal adopted sql:2011 hidden columns sql:2011 treatment new data type intervals instead two date timestamp columns bound together using codice_1 declaration another difference replacement controversial prefix statement modifiers tsql2 set temporal predicates features standard related temporal databases automatic time period splitting temporal primary keys temporal referential integrity temporal predicates allen interval algebra time-sliced sequenced queries illustration consider following short biography fictional man john doe store life john doe current non-temporal database use table person name address order simplify name defined primary key person john father officially reported birth april 4 1975 date smallville official inserted following entry database codice_2 note date stored database graduation john moves forgets register new address john entry database changed december 27 1994 finally reports bigtown official updates address database person table contains codice_3 note information john living smallville overwritten longer possible retrieve information database official accessing database december 28 1994 would told john lives bigtown technically database administrator ran query codice_4 december 26 1994 result would codice_5 running query 2 days later would result codice_6 death database would state lived bigtown april 1 2001 coroner deletes john doe entry database running query would return result valid time time fact true real world valid time period may past span current time occur future example record valid time person table two fields added valid-from valid-to specify period person address valid real world april 4 1975 john father registered son birth official inserts new entry database stating john lives smallville april 3 note although data inserted 4th database states information valid since 3rd official yet know john move another place valid-to field set infinity ∞ entry database december 27 1994 john reports new address bigtown living since august 26 1994 new database entry made record fact original entry codice_7 deleted valid-to attribute updated reflect known john stopped living smallville august 26 1994 database contains two entries john doe john dies current entry database updated stating john live bigtown longer database looks like transaction time records time period database entry accepted correct enables queries show state database given time transaction time periods occur past current time transaction time table records never deleted new records inserted existing ones updated setting transaction end time show longer current enable transaction time example two fields added person table transaction-from transaction-to transaction-from time transaction made transaction-to time transaction superseded may infinity yet superseded makes table bitemporal table happens person address stored database incorrect suppose official accidentally entered wrong address date suppose person lied address reason upon discovery error officials update database correct information recorded example 1-jun-1995 3-sep-2000 john doe moved beachy avoid paying beachy exorbitant residence tax never reported authorities later tax investigation discovered 2-feb-2001 fact beachy dates record fact existing entry john living bigtown must split two separate records new record inserted recording residence beachy database would appear follows however leaves record database ever claimed lived bigtown 1-jun-1995 3-sep-2000 might important know auditing reasons use evidence official tax investigation transaction time allows capturing changing knowledge database since entries never directly modified deleted instead entry records entered superseded logically deleted database contents look like database records happened real world also officially recorded different times bitemporal model contains valid transaction time provides historical rollback information historical information e.g john live 1992 provided valid time rollback e.g 1992 database believe john lived provided transaction time answers example questions may database may altered since 1992 causing queries produce different results valid time transaction time single fact example consider temporal database storing data 18th century valid time facts somewhere 1701 1800 transaction time would show facts inserted database example january 21 1998 challenging issue support temporal queries transaction time database evolving schema order achieve perfect archival quality key importance store data schema version first appeared however even simple temporal query rewriting history attribute value would required manually rewritten schema versions potentially hundreds case mediawiki process would particularly taxing users proposed solution provide automatic query rewriting although part sql similar standards approaches minimize complexities schema evolution following implementations provide temporal features relational database management system rdbms non-relational nosql database management systems provide temporal features including following sometimes slowly changing dimension used method | [
1905,
3341,
3343,
3928,
7248,
7715,
3621,
4048,
4950,
6543,
2937,
6364,
7999,
4252,
2054,
6658,
1220,
5419,
7757,
5956,
5338,
5778,
7213,
7303,
6056,
4278,
784,
4463,
2265
] | Test |
1,769 | 9 | Zathura_(document_viewer):zathura document viewer zathura free plugin-based document viewer plugins available pdf via poppler mupdf postscript djvu epub written lightweight controlled vi-like keybindings zathura customizability makes well-liked many linux users zathura official packages available arch linux debian fedora gentoo openbsd opensuse source mage gnu/linux ubuntu unofficial macos package provided macports zathura named 2005 film development zathura began 12 august 2009 18 september 2009 version 0.0.1 announced arch linux community zathura official arch linux package since april 2010 year end july imported source mage test grimoire official debian package since least 2011 part debian squeeze zathura automatically reloads documents working compiled documents written latex zathura refresh output whenever compilation takes place zathura option enabling inverse search using synctex zathura adjust document best-fit fit width rotate pages view pages side-by-side fullscreen mode pages also recolored black background white foreground zathura search text copy text primary x selection supports bookmarks open encrypted files behavior appearance zathura customized using configuration file zathura ability execute external shell commands opened tabs using | [
1524,
6557,
5200,
893,
5571,
2706,
6016,
1435,
1267
] | Test |
1,770 | 3 | Transactional_Synchronization_Extensions:transactional synchronization extensions transactional synchronization extensions tsx-ni extension x86 instruction set architecture isa adds hardware transactional memory support speeding execution multi-threaded software lock elision according different benchmarks tsx provide around 40 faster applications execution specific workloads 4–5 times database transactions per second tps tsx documented intel february 2012 debuted june 2013 selected intel microprocessors based haswell microarchitecture haswell processors 45xx well r-series k-series unlocked multiplier skus support tsx august 2014 intel announced bug tsx implementation current steppings haswell haswell-e haswell-ep early broadwell cpus resulted disabling tsx feature affected cpus via microcode update 2016 side-channel timing attack found abusing way tsx handles transactional faults i.e page faults order break kaslr major operating systems support tsx emulation provided part intel software development emulator also experimental support tsx emulation qemu fork tsx provides two software interfaces designating code regions transactional execution hardware lock elision hle instruction prefix-based interface designed backward compatible processors without tsx support restricted transactional memory rtm new instruction set interface provides greater flexibility programmers tsx enables optimistic execution transactional code regions hardware monitors multiple threads conflicting memory accesses aborting rolling back transactions successfully completed mechanisms provided software detect handle failed transactions words lock elision transactional execution uses memory transactions fast path possible slow fallback path still normal lock hardware lock elision hle adds two new instruction prefixes codice_1 codice_2 two prefixes reuse opcodes existing codice_3 codice_4 prefixes codice_5 codice_6 processors support tsx codice_3 codice_4 prefixes ignored instructions codice_1 codice_2 valid thus enabling backward compatibility codice_1 prefix hint used following instructions explicit codice_12 prefix codice_13 codice_14 codice_15 codice_16 codice_17 codice_18 codice_19 codice_20 codice_21 codice_22 codice_23 codice_24 codice_25 codice_26 codice_27 codice_28 codice_29 codice_30 codice_30 instruction used without codice_12 prefix well codice_2 prefix hint used instructions listed codice_34 codice_35 instructions hle allows optimistic execution critical section eliding write lock lock appears free threads failed transaction results execution restarting codice_1-prefixed instruction treating instruction codice_1 prefix present restricted transactional memory rtm alternative implementation hle gives programmer flexibility specify fallback code path executed transaction successfully executed rtm adds three new instructions codice_38 codice_39 codice_40 codice_38 codice_39 instructions mark start end transactional code region codice_40 instruction explicitly aborts transaction transaction failure redirects processor fallback code path specified codice_38 instruction abort status returned codice_45 register tsx provides new codice_46 instruction returns whether processor executing transactional region intel tsx specification describes transactional memory exposed programmers withholds details actual transactional memory implementation intel specifies developer optimization manuals haswell maintains read-sets write-sets granularity cache line tracking addresses l1 data cache processor intel also states data conflicts detected cache coherence protocol haswell l1 data cache associativity eight means implementation transactional execution writes nine distinct locations mapping cache set abort however due micro-architectural implementations mean fewer accesses set guaranteed never abort additionally cpu configurations hyper-threading technology l1 cache shared two threads core operations sibling logical processor core cause evictions independent research points haswell ’ transactional memory likely deferred update system using per-core caches transactional data register checkpoints words haswell likely use cache-based transactional memory system much less risky implementation choice hand intel skylake later may combine cache-based approach memory ordering buffer mob purpose possibly also providing multi-versioned transactional memory amenable speculative multithreading august 2014 intel announced bug exists tsx implementation haswell haswell-e haswell-ep early broadwell cpus resulted disabling tsx feature affected cpus via microcode update bug fixed f-0 steppings vpro-enabled core m-5y70 broadwell cpu november 2014 bug found reported diploma thesis school electrical computer engineering national technical university athens | [
2000,
5012,
3173,
2989,
4845,
3942,
4224,
5209,
6344,
6523,
6616,
4108,
3100,
1465,
5665,
5934,
742,
5669,
5670,
584,
5055,
6647,
2226,
2498,
5765,
4077,
6563,
5165,
3139,
6133,
2332,
1881,
766,
5431,
691,
3747,
6148,
6236,
6675,
352,
9... | Train |
1,771 | 4 | Novabackup:novabackup novabackup developed novastor data protection software enables smb users backup recover mission critical data across hybrid physical virtual machines novabackup designed work microsoft windows operating systems offering local online file backups disaster recovery image backups novabackup uses proprietary file format uses .nbd file extension backwards compatible meaning backups older versions novabackup version 8 restored latest version software version 7 8 backups still restored file extensions need updated .nbd multiple novabackup editions available versions built smb users support backups pcs laptops servers including support exchange/sql virtual machines novabackup software includes novacare premium support email/phone-in technical support maintenance upgrades novastor partnered buffalo offering novabackup software included linkstation family consumer nas solutions terastation family business-class nas solutions release change log novabackup starting version 13.0 current novabackup release log | [
644,
1640,
2390,
4295,
2566,
6731
] | Validation |
1,772 | 3 | AVR32:avr32 avr32 32-bit risc microcontroller architecture produced atmel microcontroller architecture designed handful people educated norwegian university science technology including lead designer øyvind strøm cpu architect erik renno atmel norwegian design center instructions executed single-cycle multiply–accumulate unit perform 32-bit × 16-bit 48-bit arithmetic operation two cycles result latency issued per cycle resemble 8-bit avr microcontroller family even though designed atmel norway trondheim debug-tools similar support avr32 dropped linux kernel 4.12 atmel switched mostly variants arm architecture avr32 least two micro-architectures avr32a avr32b differ instruction set architecture register configurations use caches instructions data avr32a cpu cores inexpensive applications provide dedicated hardware registers shadowing register file status return address interrupts saves chip area expense slower interrupt-handling avr32b cpu cores designed fast interrupts dedicated registers hold values interrupts exceptions supervisor calls avr32b cores also support java virtual machine hardware avr32 instruction set 16-bit compact 32-bit extended instructions similar e.g arm several specialized instructions found older armv5 armv6 mips32 several u.s. patents filed avr32 isa design platform like avr 8-bit microcontroller architecture avr32 designed high code density packing much function instructions fast instructions clock cycles atmel used independent benchmark consortium eembc benchmark architecture various compilers consistently outperformed armv5 16-bit thumb code armv5 32-bit arm code much 50 code-size 3× performance atmel says picopower avr32 at32uc3l consumes less 0.48 mw/mhz active mode claimed time used less power 32-bit cpu march 2015 claim new cortex-m0+-based microcontrollers using arm holdings arm architecture instruction set broken ultra-low power performance barriers date avr32 architecture used atmel products 2006 atmel launched avr32a avr32 ap7 core 7-stage pipelined cache-based design platform ap7000 implements avr32b architecture supports simd single instruction multiple data dsp digital signal processing instructions risc instruction-set addition java hardware acceleration includes memory management unit mmu supports operating systems like linux early 2009 rumored ap7200 follow-on processor held back resources going chips 2007 atmel launched second avr32 avr32 uc3 core designed microcontrollers using on-chip flash memory program storage running without mmu memory management unit avr32 uc3 core uses three-stage pipelined harvard architecture specially designed optimize instruction fetches on-chip flash memory avr32 uc3 core implements avr32a architecture shares instruction set architecture isa ap7 sibling differs including optional simd instructions java support shares 220 instructions avr32b isa features atomic bit manipulation control on-chip peripherals general purpose i/os fixed point dsp arithmetic implementations combined compatible set peripheral controllers buses first seen at91sam arm-based platforms peripherals first seen ap7000 high speed usb peripheral controller standalone dma controller appeared later updated arm9 platforms arm cortex-m3 based products avr32 cores include nexus class 2+ based on-chip debug framework build jtag uc3 core announced electronica 2010 munich germany november 10 2010 first 32-bit avr microcontroller optional floating-point unit april 10 2012 atmel announced end life ap7 core devices april 4 2013 devicename ends *au audio version allow execution atmel licensed audio firmware ips devicename ends *s includes aes crypto module series low-power uc3d embeds sleepwalking technology allows peripheral wake device sleep mode | [
5893,
1252,
4846,
804,
895,
5208,
4040,
6177,
7980,
4137,
1640,
3365,
4408,
5920,
6720,
3014,
1556,
2929,
7905,
5307,
578,
4336,
7654,
5055,
4251,
2130,
2226,
2765,
6919,
6922,
6753,
5423,
3747,
5614,
6236,
534,
441,
1430,
2443,
971
] | Test |
1,773 | 0 | Robert_Mercer:robert mercer robert leroy mercer born july 11 1946 american computer scientist developer early artificial intelligence co-ceo renaissance technologies hedge fund mercer played key role brexit campaign donating data analytics services nigel farage also major funder organizations supporting right-wing political causes united states breitbart news donald trump 2016 campaign president principal benefactor make america number 1 super pac november 2017 mercer announced would step renaissance technologies sell stake breitbart news daughters mercer grew new mexico developed early interest computers 1964 attended national youth science camp west virginia learned program donated ibm computer went get bachelor degree physics mathematics university new mexico working degree job air force weapons laboratory kirtland air force base writing programs though felt produced good work felt optimized later said experience left jaundiced view government-funded research earned ph.d. computer science university illinois urbana–champaign 1972 mercer joined ibm research fall 1972 worked thomas j. watson research center yorktown new york helped develop brown clustering statistical machine translation technique part speech recognition translation research program led frederick jelinek lalit bahl june 2014 mercer received association computational linguistics lifetime achievement award work 1993 mercer joined hedge fund renaissance technologies recruited executive nick patterson founder renaissance james harris simons quantitative analyst preferred hire mathematicians computer scientists physicists rather business school students financial analysts mercer former colleague ibm peter brown became co-ceos renaissance simons retired 2009 renaissance main fund medallion earned 39 per year average 1989 2006 bipartisan senate panel estimated 2014 medallion investors underpaid taxes 6.8 billion decade masking short-term gains long-term returns 2014 renaissance managed 25 billion assets november 2017 mercer announced would stepping position renaissance technologies decision taken hedge fund faced backlash mercer political activism mercer appears director eight bermuda companies paradise papers appear used legally avoid us taxes 2015 washington post called mercer one ten influential billionaires politics since 2006 mercer donated 34.9 million republican political campaigns us mercer given 750,000 club growth 2 million american crossroads 2.5 million freedom partners action fund 2010 financially supported fringe biochemist art robinson unsuccessful efforts unseat peter defazio oregon 4th congressional district 2013-2014 election cycle mercer donated fourth largest amount money among individual donors second among republican donors mercer joined koch brothers ’ conservative political donor network 2010 citizens united v. fec mercer daughter rebekah mercer decided establish political foundation mercer family foundation run rebekah donated variety conservative causes mercer donated heritage foundation cato institute media research center reclaim new york gai 2013 mercer shown data former jimmy carter pollster patrick caddell critical top democrats commissioned research caddell showed voters becoming alienated political parties mainstream candidates mercer main financial backer jackson hole summit conference took place wyoming august 2015 advocate gold standard also supported doctors disaster preparedness fred kelly grant idaho activist encourages legal challenges environmental laws campaign death penalty nebraska funded ads new york critical so-called ground-zero mosque according associates interviewed bloomberg mercer concerned monetary banking systems united states believes danger government meddling mercer major source funds breitbart news gave least 10 million media outlet according newsweek 2015 mercer also gave 400,000 black americans better future conservative think tank led raynard jackson since 2017 mercer donated 87,100 super pac mercer activist campaign united kingdom end membership european union also known brexit andy wigmore communications director leave.eu said mercer donated services data analytics firm cambridge analytica nigel farage head united kingdom independence party ukip firm able advise leave.eu ability harvest data people facebook profiles order target individualized persuasive messages vote brexit reported cambridge analytica also undisclosed links canadian digital firm aggregateiq also played pivotal role domenic cummings voteleave campaign delivered estimated one billion individually curated targeted adverts voters lead brexit referendum contravention established voting rules voteleave leave.eu inform uk electoral commission donation despite fact law demands donations valued £7,500 must reported 2018 electoral commission found voteleave campaign guilty breaking electoral law january 2016 mercer biggest single donor 2016 u.s. presidential race june 2016 ranked 1 donor federal candidates 2016 election cycle donated 2 million john r. bolton super pac 668,000 republican national committee mercer major financial supporter 2016 presidential campaign ted cruz contributing 11 million super pac associated candidate mercer major supporter donald trump 2016 campaign president mercer daughter rebekah helped get steve bannon kellyanne conway senior roles trump campaign rebekah worked conway cruz super-pac keep promise 2016 republican primaries mercer also financed super pac make america number one supported trump campaign nick patterson former colleague mercer said 2017 trump would elected without mercer support mercer said civil rights act 1964 landmark federal statute arising civil rights movement 1960s major mistake 2017 david magerman former renaissance employee alleged lawsuit mercer said african americans economically better civil rights movement white racists longer existed united states racists remaining black racists mercer portrayed actor aden gillett 2019 hbo channel 4 produced drama entitled mercer wife diana lynne dean three daughters jennifer jenji rebekah bekah heather sue rebekah runs mercer family foundation three mercer daughters formerly owned bakery called ruby et violette mercer plays competitive poker owns ho scale model railroad 2009 mercer filed suit raildreams custom model railroad design alleging raildreams overcharged 2 million mercer lives owl nest mansion head harbor new york commissioned series yachts named sea owl recent one 203 feet 62 metres length pirate-themed playroom mercer grandchildren chandelier venetian glass florida mercer built large stable horse riding center acquired one country largest collections machine guns historical firearms including weapon arnold schwarzenegger wielded terminator 2013 mercer sued several members household staff accused docking wages failing pay overtime compensation lawsuit settled according lawyer represented staff members mercer net worth estimated hundreds millions dollars often referred billionaire | [
479,
1839,
5388,
1243,
7372
] | Validation |
1,774 | 2 | APL_(programming_language):apl programming language apl named book programming language programming language developed 1960s kenneth e. iverson central datatype multidimensional array uses large range special graphic symbols represent functions operators leading concise code important influence development concept modeling spreadsheets functional programming computer math packages also inspired several programming languages mathematical notation manipulating arrays developed kenneth e. iverson starting 1957 harvard university 1960 began work ibm developed notation adin falkoff published book programming language 1962 preface states premise notation used inside ibm short research reports computer systems burroughs b5000 stack mechanism stack machines versus register machines evaluated ibm upcoming computers iverson also used notation draft chapter programming language written book writing fred brooks automatic data processing would published 1963 1979 iverson received turing award work apl early 1962 first attempt use notation describe complete computer system happened falkoff discussed william c. carter work standardize instruction set machines later became ibm system/360 family 1963 herbert hellerman working ibm systems research institute implemented part notation ibm 1620 computer used students special high school course calculating transcendental functions series summation students tested code hellerman lab implementation part notation called personalized array translator pat 1963 falkoff iverson edward h. sussenguth jr. working ibm used notation formal description ibm system/360 series machine architecture functionality resulted paper published ibm systems journal 1964 published team turned attention implementation notation computer system one motivations focus implementation interest john l. lawrence new duties science research associates educational company bought ibm 1964 lawrence asked iverson group help use language tool develop use computers education lawrence m. breed philip s. abrams stanford university joined team ibm research continued prior work implementation programmed fortran iv part notation done ibm 7090 computer running ibsys operating system work finished late 1965 later named ivsys iverson system basis implementation described detail abrams stanford university technical report interpreter iverson notation 1966 academic aspect formally supervised niklaus wirth like hellerman pat system earlier implementation include apl character set used special english reserved words functions operators system later adapted time-sharing system november 1966 reprogrammed ibm system/360 model 50 computer running time sharing mode used internally ibm key development ability use apl effectively wide use cathode ray tube crt terminals development special ibm selectric typewriter interchangeable typing element special apl characters used paper printing terminal workstations using selectric typewriter typing element mechanism ibm 1050 ibm 2741 terminal keycaps could placed normal keys show apl characters would entered typed key struck first time programmer could type see proper apl characters used iverson notation forced use awkward english keyword representations falkoff iverson special apl selectric typing elements 987 988 designed late 1964 although apl computer system available use iverson cited falkoff inspiration idea using ibm selectric typing element apl character set many apl symbols even apl characters selectric typing element still typed over-striking two extant element characters example grade character made delta shift-h sheffer stroke shift-m necessary apl character set much larger 88 characters allowed typing element even letters restricted upper-case capitals first apl interactive login creation apl workspace 1966 larry breed using ibm 1050 terminal ibm mohansic labs near thomas j. watson research center home apl yorktown heights new york ibm chiefly responsible introducing apl marketplace apl first available 1967 ibm 1130 apl\1130 would run little 8k 16-bit words memory used dedicated 1 megabyte hard disk apl gained foothold mainframe timesharing systems late 1960s early 1980s part would support multiple users lower-specification systems dynamic address translation hardware additional improvements performance selected ibm system/370 mainframe systems included apl assist microcode support apl execution included processor firmware distinct implemented entirely higher-level software somewhat later suitably performing hardware finally growing available mid- late-1980s many users migrated applications personal computer environment early ibm apl interpreters ibm 360 ibm 370 hardware implemented multi-user management instead relying host services thus timesharing systems first introduced 1966 apl\360 system multi-user interpreter ability programmatically communicate operating system information setting interpreter system variables done special privileged i-beam functions using monadic dyadic operations 1973 ibm released apl.sv continuation product offered shared variables means access facilities outside apl system operating system files mid-1970s ibm mainframe interpreter even adapted use ibm 5100 desktop computer small crt apl keyboard small computers time offered basic 1980s vsapl program product enjoyed wide use conversational monitor system cms time sharing option tso vspc music/sp cics users 1973-1974 patrick e. hagerty directed implementation university maryland apl interpreter 1100 line sperry univac 1100/2200 series mainframe computers time sperry nothing 1974 student alan stebbens assigned task implementing internal function 1960s 1970s several timesharing firms arose sold apl services using modified versions ibm apl\360 interpreter north america better-known ones i. p. sharp associates scientific time sharing corporation stsc time sharing resources tsr computer company tcc compuserve also entered market 1978 apl interpreter based modified version digital equipment corp carnegie mellon ran dec ki kl 36-bit machines compuserve apl available commercial market consumer information service advent first less expensive mainframes ibm 4300 later personal computer mid-1980s timesharing industry gone sharp apl available i. p. sharp associates first timesharing service 1960s later program product starting around 1979 sharp apl advanced apl implementation many language extensions packages ability put one objects single variable file system nested arrays shared variables apl interpreters available mainframe mini-computer manufacturers also notably burroughs control data corporation cdc data general digital equipment corporation dec harris hewlett-packard hp siemens ag xerox others garth foster syracuse university sponsored regular meetings apl implementers community syracuse minnowbrook conference center blue mountain lake new york later years eugene mcdonnell organized similar meetings asilomar conference grounds near monterey california pajaro dunes near watsonville california sigapl special interest group association computing machinery continues support apl community microcomputers became available mid 1970s onwards basic became dominant programming language nevertheless microcomputers provided apl instead first intel 8008-based mcm/70 released 1974 primarily used education another machine time videobrain family computer released 1977 supplied dialect apl called apl/s commodore superpet introduced 1981 included apl interpreter developed university waterloo 1976 bill gates claimed open letter hobbyists microsoft corporation implementing apl intel 8080 motorola 6800 little incentive make available hobbyists software piracy never released starting early 1980s ibm apl development leadership jim brown implemented new version apl language contained primary enhancement concept nested arrays array contain arrays new language features facilitated integrating nested arrays program workflow ken iverson longer control development apl language left ibm joined i. p. sharp associates one major contributions directing evolution sharp apl accord vision vendors busy developing apl interpreters new hardware notably unix-based microcomputers apl2 almost always standard chosen new apl interpreter developments even today apl vendors users cite apl2 compatibility selling point products apl2 ibm mainframe computers still available ibm cites use problem solving system design prototyping engineering scientific computations expert systems teaching mathematics subjects visualization database access first available cms tso 1984 apl2 workstation edition windows os/2 aix linux solaris followed much later early 1990s various implementations apl aplx dyalog et al. include extensions object-oriented programming support .net framework xml-array conversion primitives graphing operating system interfaces lambda calculus expressions apl formed basis influenced following languages apl criticized praised choice unique non-standard character set learn become ardent adherents suggesting weight behind iverson idea notation used make difference 1960s 1970s terminal devices even display monitors could reproduce apl character set popular ones employed ibm selectric print mechanism used special apl type element one early apl line terminals line-mode operation full screen texas instruments ti model 745 circa 1977 full apl character set featured half full duplex telecommunications modes interacting apl time-sharing service remote mainframe run remote computer job called rje time universal use high-quality graphic displays printing devices unicode support apl character font problem largely eliminated however entering apl characters requires use input method editors keyboard mappings virtual/on-screen apl symbol sets easy-reference printed keyboard cards frustrate beginners accustomed programming languages beginners prior experience programming languages study involving high school students found typing using apl characters hinder students measurable way defense apl use apl requires less coding type keyboard mappings become memorized time also special apl keyboards manufactured use today freely available downloadable fonts operating systems microsoft windows reported productivity gains assume one spend enough time working apl make worthwhile memorize symbols semantics keyboard mappings mention substantial number idioms common tasks unlike traditionally structured programming languages apl code typically structured chains monadic dyadic functions operators acting arrays apl many nonstandard primitives functions operators indicated single symbol combination symbols primitives defined precedence always associate right thus apl read best understood right-to-left early apl implementations circa 1970 programming loop-flow control structures codice_1 codice_2 loops codice_3 constructs instead used array operations use structured programming constructs often necessary since operation could performed full array one statement example codice_4 function codice_5 replace for-loop iteration ιn applied scalar positive integer yields one-dimensional array vector 1 2 3 ... n. recent implementations apl generally include comprehensive control structures data structure program control flow clearly cleanly separated apl environment called workspace workspace user define programs data i.e. data values exist also outside programs user also manipulate data without define program examples apl interpreter first types six spaces awaiting user input output starts column one user save workspace values programs execution status apl uses set non-ascii symbols extension traditional arithmetic algebraic notation single character names single instruction multiple data simd vector functions one way apl enables compact formulation algorithms data transformation computing conway game life one line code nearly versions apl theoretically possible express computable function one expression one line code unusual character set many programmers use special keyboards apl keytops write apl code although various ways write apl code using ascii characters practice almost never done may thought support iverson thesis notation tool thought modern implementations use standard keyboard layouts special mappings input method editors access non-ascii characters historically apl font distinctive uppercase italic alphabetic characters upright numerals symbols vendors continue display apl character set custom font advocates apl claim examples so-called write-only code badly written almost incomprehensible code almost invariably examples poor programming practice novice mistakes occur language advocates also claim far productive apl conventional computer languages working software implemented far less time far fewer programmers using technology also may claim compact terse apl lends well larger-scale software development complexity number lines code reduced greatly many apl advocates practitioners also view standard programming languages cobol java comparatively tedious apl often found time-to-market important trading systems apl makes clear distinction functions operators functions take arrays variables constants expressions arguments return arrays results operators similar higher-order functions take functions arrays arguments derive related functions example sum function derived applying reduction operator addition function applying reduction operator maximum function returns larger two numbers derives function returns largest group vector numbers j language iverson substituted terms verb function adverb conjunction operator apl also identifies features built language represented symbol fixed combination symbols primitives primitives either functions operators coding apl largely process writing non-primitive functions versions apl operators however primitives considered neither functions operators noticeably assignment words used apl literature meanings differ mathematics generality computer science apl explicit representations functions operators syntax thus providing basis clear explicit statement extended facilities language tools experiment displays hello world 'hello world sample user session youtube design theme apl define default actions cases would produce syntax errors programming languages 'hello world string constant displays display default action expression action specified explicitly e.g assignment function parameter another example theme exponentiation apl written indicates raising 2 power 3 would written languages fortran python many languages use signify multiplication 2*3 apl uses however base specified statement apl languages programming languages one would syntax error apl however assumes missing base natural logarithm constant e 2.71828 ... interpreting suppose array numbers gives average reading right-to-left gives number elements x since dyadic operator term left required well parenthesis since otherwise x would taken summation would element x divided number elements x adds elements x building calculates standard deviation since assignment operator appear within expression would place suitable values av sd naturally one would make expression function repeated use rather retyping time following immediate-mode expression generates typical set pick 6 lottery numbers six pseudo-random integers ranging 1 40 guaranteed non-repeating displays sorted ascending order lot concisely although seems complex new apler combines following apl functions also called primitives glyphs since function left left-most x tell apl result simply outputs display single line separated spaces without needing explicit instruction codice_6 also monadic equivalent called codice_15 simply returns one random integer 1 sole operand right inclusive thus role-playing game program might use expression codice_16 roll twenty-sided die following expression finds prime numbers 1 r. time space calculation complexity formula_1 big notation executed right left means note assumes apl origin 1 i.e. indices start 1 apl set use 0 origin codice_45 codice_46 convenient calculations following expression sorts word list stored matrix x according word length following function life written dyalog apl takes boolean matrix calculates new generation according conway game life demonstrates power apl implement complex algorithm little code also hard follow unless one advanced knowledge apl following example also dyalog first line assigns html code variable codice_47 uses apl expression remove html tags explanation apl used many purposes including financial insurance applications artificial intelligence neural networks robotics argued apl calculation tool programming language symbolic nature array capabilities made popular domain experts data scientists require skills computer programmer apl well suited image manipulation computer animation graphic transformations encoded matrix multiplications one first commercial computer graphics houses digital effects produced apl graphics product named visions used create television commercials animation 1982 film tron latterly stormwind boating simulator uses apl implement core logic interfacing rendering pipeline middleware major part physics engine today apl remains use wide range commercial scientific applications example investment management asset management health care dna profiling hobbyists first implementation apl using recognizable apl symbols apl\360 ran ibm system/360 completed november 1966 though time remained use within ibm 1973 implementors larry breed dick lathwell roger moore awarded grace murray hopper award association computing machinery acm given work design implementation apl\360 setting new standards simplicity efficiency reliability response time interactive systems 1975 ibm 5100 microcomputer offered apl\360 one two built-in rom-based interpreted languages computer complete keyboard display supported special symbols used language significant developments apl\360 included cms/apl made use virtual storage capabilities cms aplsv introduced shared variables system variables system functions subsequently ported ibm system/370 vspc platforms final release 1983 replaced apl2 1968 apl\1130 became first publicly available apl system created ibm ibm 1130 became popular ibm type-iii library software ibm released apl*plus sharp apl versions apl\360 added business-oriented extensions data formatting facilities store apl arrays external files jointly developed two companies employing various members original ibm apl\360 development team two companies i. p. sharp associates ipsa apl\360 services company formed 1964 ian sharp roger moore others stsc time-sharing consulting service company formed 1969 lawrence breed others together two developed apl*plus thereafter continued work together develop apl separately apl*plus sharp apl stsc ported apl*plus many platforms versions made vax 11 pc unix whereas ipsa took different approach arrival personal computer made sharp apl available platform using additional pc-xt/360 hardware 1993 soliton incorporated formed support sharp apl developed sharp apl sax sharp apl unix apl*plus continues apl2000 apl+win 1985 ian sharp dan dyer stsc jointly received kenneth e. iverson award outstanding contribution apl apl2 significant re-implementation apl ibm developed 1971 first released 1984 provides many additions language notable nested non-rectangular array support available mainframe computers running z/os z/vm workstations running aix linux sun solaris microsoft windows entire apl2 products services team awarded iverson award 2007 dyalog apl first released british company dyalog ltd. 1983 available aix linux including raspberry pi macos microsoft windows platforms based apl2 extensions support object-oriented programming functional programming licences free personal/non-commercial use 1995 two development team john scholes peter donnelly awarded iverson award work interpreter gitte christensen morten kromberg joint recipients iverson award 2016 nars2000 open-source apl interpreter written bob smith prominent apl developer implementor stsc 1970s 1980s nars2000 contains advanced features new datatypes runs natively microsoft windows platforms wine aplx cross-platform dialect apl based apl2 several extensions first released british company microapl 2002 although longer development commercial sale available free charge dyalog gnu apl free implementation extended apl specified iso/iec 13751:2001 thus similar apl2 runs gnu/linux windows using cygwin uses unicode internally written jürgen sauermann richard stallman founder gnu project early adopter apl using write text editor high school student summer 1969 apl traditionally interpreted language language characteristics weak variable typing well suited compilation however arrays core data structure provides opportunities performance gains parallelism parallel computing massively parallel applications very-large-scale integration vlsi outset apl regarded high-performance language example noted speed could perform complicated matrix operations operates arrays performs operations like matrix inversion internally nevertheless apl rarely purely interpreted compilation partial compilation techniques used include following apl interpreters support idiom recognition evaluate common idioms single operations example evaluating idiom codice_48 single operation codice_49 boolean vector codice_50 array creation two intermediate arrays avoided weak typing apl means name may reference array datatype function operator general interpreter know advance form must therefore perform analysis syntax checking etc run-time however certain circumstances possible deduce advance type name expected reference generate bytecode executed reduced run-time overhead bytecode also optimised using compilation techniques constant folding common subexpression elimination interpreter execute bytecode present assumptions made met dyalog apl includes support optimised bytecode compilation apl subject research experiment since language first became available first compiler considered burroughs apl-700 released around 1971 order able compile apl language limitations imposed apex research apl compiler written robert bernecky available gnu public license stsc apl compiler hybrid bytecode optimiser compiler enables compilation functions machine code provided sub-functions globals declared interpreter still used runtime library execute functions meet compilation requirements apl standardized american national standards institute ansi working group x3j10 international organization standardization iso international electrotechnical commission iec iso/iec joint technical committee 1 subcommittee 22 working group 3 core apl language specified iso 8485:1989 extended apl language specified iso/iec 13751:2001 | [
4302,
5020,
13,
7526,
3619,
3620,
6428,
3623,
3630,
1435,
5396,
2214,
737,
2576,
5401,
38,
4705,
7557,
1114,
752,
5424,
1128,
6846,
4366,
775,
1892,
2619,
5091,
6507,
1524,
1158,
4759,
7246,
2638,
6172,
811,
470,
1543,
5117,
1180,
3368,... | Test |
1,775 | 1 | Sqsh:sqsh sqsh pronounced skwish short sqshell pronounced s-q-shell open-source substitute isql interactive sql client supplied sybase adaptive server enterprise ase relational database management system isql sqsh essentially rudimentary command-line tools issuing transact-sql commands ase server receiving displaying results sqsh supports among others command history aliases piping output external programs sources runs various flavours unix including linux well windows cygwin libraries | [
1524,
3172,
4759,
187,
578
] | Test |
1,776 | 2 | Line_discipline:line discipline line discipline ldisc layer terminal subsystem unix-like systems terminal subsystem consists three layers upper layer provide character device interface lower hardware driver communicate hardware pseudo terminal middle line discipline implement behavior common terminal devices line discipline glues low level device driver code high level generic interface routines read 2 write 2 ioctl 2 responsible implementing semantics associated device policy separated device driver serial hardware driver used devices require different data handling example standard line discipline processes data receives hardware driver applications writing device according requirements terminal unix-like system input handles special characters interrupt character typically control-c erase kill characters typically backspace delete control-u respectively output replaces lf characters cr/lf sequence serial port could also used dial-up internet connection using serial modem ppp case ppp line discipline would used would accumulate input data serial line ppp input packets delivering networking stack rather character device would transmit packets delivered networking stack serial line unix-like systems use streams implement line disciplines | [
3062,
5880,
6267
] | Test |
1,777 | 0 | Multilingual_notation:multilingual notation multilingual notation representation lexical resource allows translation two words instance within lmf multilingual notation could presented following diagram english french translation diagram two intermediate senseaxis instances used order represent near match fleuve french river english senseaxis instance bottom linked directly english sense notion exist english complex situation two languages concerned following diagram dealing english italian spanish within context multilingual database comprising two languages usually multilingual notations factorized order save number links terms multilingual notations interlingual nodes shared among language descriptions specific context lexical resource bilingual lexicon term bilingual link usually preferred let us note instead translation rather broad meaning authors prefer equivalence words different notions like dynamic formal equivalences term mainly used context machine translation nlp lexicons term used context translation dictionary concerns mainly hand-held electronic translators | [
5429,
7732,
5008
] | Train |
1,778 | 3 | Elbrus-2S+:elbrus-2s+ elbrus-2s+ multi-core microprocessor based elbrus 2000 architecture developed moscow center sparc technologies mcst multiple reports regarding evolution technology purpose import substitution russia raised several ministries july 2014 due economic sanctions response 2014 pro-russian unrest ukraine december 2014 announced mikron start pilot production dual-core variant microprocessor called elbrus-2sm using 90 nanometer cmos manufacturing process zelenograd russia elbrus-4s cpu reported built support intel x86 emulation well native vliw mode perform 23 instructions per clock cycle programs built elbrus 2000 native mode compiler determines different operations shall distributed 23 computing units saving final program means dynamic scheduling needed runtime thus reducing amount work cpu perform every time program executed static scheduling needs performed one time program built advanced algorithms finding optimal distribution work employed south bridge elbrus 2000 chipset connects peripherals bus cpu developed mcst also compatible mcst-r1000 december 2012 kraftway announced deliver elbrus based pc together partner mcst august 2013 kuyan gusev kozlov kaimuldenov kravtsunov mcst published article based experience building deployment debian linux elbrus computer architecture done using hybrid compiler toolchain cross native elbrus-2s+ intel core 2 duo december 2014 implementation opengl 3.3 standard demonstrated running game doom 3 bfg edition elbrus-4s clocked 720 mhz using radeon graphics card 2 gigabytes video memory april 2015 mcst announced two new products based elbrus-4s cpu one 19-inch rack server four cpus 16 cores one personal computer december 2015 first shipment pcs based vliw cpu elbrus-4s made russia | [
4657,
5364,
1361,
3098,
6014,
7453,
1753,
8102,
5055,
1761,
7569,
2332,
6480,
3741,
3747,
1237,
352,
971
] | Validation |
1,779 | 3 | Nomadik:nomadik nomadik family microprocessors multimedia applications stmicroelectronics based arm9 arm architecture designed specifically mobile devices december 12 2002 stmicroelectronics texas instruments jointly announced initiative open mobile application processor interfaces omapi intended used 2.5 3g mobile phones going produced 2003 later merged larger initiative renamed mipi alliance nomadik stmicroelectronics implementation standard nomadik first presented october 7 2003 ceatec show tokyo later year nomadik microprocessor report analysts choice award application processors family aimed 2.5g/3g mobile phones personal digital assistants portable wireless products multimedia capability addition suitable automotive multimedia applications known device using nomadik processor nokia n96 used stn8815 version chip n96 debuted 2008 absence gpu noticed derivative nomadik created specifically navigation systems gps named cartesio sta2062 used products garmin nüvi 205 nüvi 500 derivative used arm926ej-s coupled sta5620 gps rf downconverter added 32-channel hardware gps correlator nomadik family discontinued 2009 development already begun successor soc called stn8500 superseded novathor family st-ericsson renamed u8500 st-nxp wireless division merged st-ericsson joint venture | [
2538,
6082,
6421,
7890,
722,
2926,
5740,
5750,
5752,
5405,
5406,
1864,
67,
446,
451,
6165,
463,
804,
1167,
5472,
469,
4041,
3008,
3365,
6910,
5845,
7654,
5499,
6919,
3397,
1977,
2339,
2711,
1995,
550,
4846,
3786,
2024,
5576,
7364,
1284,... | Test |
1,780 | 7 | Crunchfish:crunchfish crunchfish swedish technology company malmö develops gesture recognition software mobile phone tablet market crunchfish founded 2010 initial focus create innovations ios android app markets gesture recognition using standard webcam main gesture sensor one core innovations company focusing touchless interaction based camera based gestures 2013 april company selected '2013 red herring top 100 company red herring magazine crunchfish produces gesture sensing software set customized mid-air gesture recognition solutions named a3d™ global mobile device manufacturers app developers crunchfish cooperates smartphone manufacturers enable crunchfish gesture sensing technology partners mobile devices crunchfish developed touchless functions chinese gionee smartphone elife e6 launched china july 2013 india africa august 2013 crunchfish integrates touchless functions e.g smartphones technology portable mobile platform devices gesture recognition technology used mobile phones tablets dtvs equipped front-facing camera typical uses crunchfish touchless technology devices intelligent home smartphones tablets digital tv games home electronics built-in standard camera gesture based functionality adds alternative options standard touch interface user example put tablet front him/her free mid-air gesture hands interacting media player without touching smartphone users answer reject phone calls start slideshows photo gallery use video scrubber etc without touching device device pause video playback users look away screen crunchfish touchless a3d software able detect track objects fingers hand gestures face movements three dimensions based video stream embedded standard camera e.g mobile device | [
740
] | Test |
1,781 | 4 | Challenge–response_spam_filtering:challenge–response spam filtering challenge–response c/r system type spam filter automatically sends reply challenge alleged sender incoming e-mail originally designed 1997 stan weatherby called email verification reply sender asked perform action assure delivery original message would otherwise delivered action perform typically takes relatively little effort great effort perform large numbers effectively filters spammers challenge–response systems need send challenges unknown senders senders previously performed challenging action previously sent e-mail would automatically whitelisted c/r systems attempt provide challenges fulfilled easily legitimate senders non-easily spammers two characteristics differ legitimate senders spammers exploited achieve goal listed examples challenges could used exploit differences nowadays c/r systems used widely enough make spammers bother automatically respond challenges therefore c/r systems generally rely simple challenge would made complicated spammers ever build automated responders c/r systems ideally problems sending challenges forged email addresses reduced challenges sent critics c/r systems raised several issues regarding usefulness email defense number issues relate programs auto-respond e-mail including mailing list managers vacation programs bounce messages mail servers spammers use fake non-existent address sender address field e-mail header also use forged existing sender address valid arbitrary person address without person consent latter would become increasingly common e.g callback verification would become popular detect spam c/r systems challenging message forged sender address would send challenge new message person whose address forged would create e-mail backscatter would effectively shift burden person would received spam person whose address forged addition forged sender decided validate challenge c/r user would receive spam anyway forged sender address would whitelisted though definitely undesirable side-effect issue would non-existent people whose email address used forged address spam happen run c/r system case one c/r users must implement form return address signing bounce address tag validation ensure challenge goes also systems like spf dkim became common forged sender addresses would recognized systems reaching c/r system cases c/r systems tricked becoming spam relays useful part message challenge generally included challenge message spammer knowing sending c/r using system could design message spam payload part message challenge message includes case forged sender actual recipient spam c/r system unwittingly relay disseminating ordinary email address protected c/r system results challenges send mail address c/r critics consider rude give people email address require unless previously whitelisted might always possible answer challenge send mail advocates c/r systems argue benefits far outweigh 'burden incidental challenge probably never final solution spam without laying kind burden e-mail sender reason widespread use c/r systems understood accepted appreciated analogy snail mail sender prepared pay stamp analogy phone calls caller prepared pay outgoing call c/r systems interact badly mailing list software person subscribed mailing list begins use c/r software posters mailing list may confronted challenge messages order confirmations billing statements delivery notices online shopping systems usually sent via automated systems email challenges sent systems lost legitimate mail sent systems may reach c/r system user advocates c/r systems argue though takes extra effort solutions problems exist end-user behind c/r system simple things c/r advocates claim systems lower rate false positives systems automatically filtering unsolicited bulk email critics argue typical users c/r systems still need review challenged mail regularly looking non-bulk mail solicited bulk email sender responded challenge issue particularly notable newsletters transactional messages solicited bulk email senders usually check challenges mail however bulk email question solicited c/r user could expected added whitelist bulk email solicited definition spam filtered c/r system | [
2510,
5733,
2043,
4734,
5722,
7624,
2578
] | Test |
1,782 | 3 | Memory_barrier:memory barrier memory barrier also known membar memory fence fence instruction type barrier instruction causes central processing unit cpu compiler enforce ordering constraint memory operations issued barrier instruction typically means operations issued prior barrier guaranteed performed operations issued barrier memory barriers necessary modern cpus employ performance optimizations result out-of-order execution reordering memory operations loads stores normally goes unnoticed within single thread execution cause unpredictable behaviour concurrent programs device drivers unless carefully controlled exact nature ordering constraint hardware dependent defined architecture memory ordering model architectures provide multiple barriers enforcing different ordering constraints memory barriers typically used implementing low-level machine code operates memory shared multiple devices code includes synchronization primitives lock-free data structures multiprocessor systems device drivers communicate computer hardware program runs single-cpu machine hardware performs necessary bookkeeping ensure program executes memory operations performed order specified programmer program order memory barriers necessary however memory shared multiple devices cpus multiprocessor system memory-mapped peripherals out-of-order access may affect program behavior example second cpu may see memory changes made first cpu sequence differs program order following two-processor program gives example out-of-order execution affect program behavior initially memory locations codice_1 codice_2 hold value codice_3 program running processor 1 loops value codice_2 zero prints value codice_1 program running processor 2 stores value codice_6 codice_1 stores value codice_8 codice_2 pseudo-code two program fragments shown steps program correspond individual processor instructions processor 1 processor 2 one might expect print statement always print number 42 however processor 2 store operations executed out-of-order possible codice_2 updated codice_1 print statement invoked come loop similarly processor 1 load operations may executed out-of-order possible codice_1 read codice_2 checked print statement might therefore print unexpected value programs neither situations acceptable memory barrier inserted processor 2 assignment codice_2 ensure new value codice_1 visible processors prior change value codice_2 another inserted processor 1 access codice_1 ensure value codice_1 read prior seeing change value codice_2 another example driver performs following sequence processor store operations executed out-of-order hardware module may triggered data ready memory another illustrative example non-trivial one arises actual practice see double-checked locking multithreaded programs usually use synchronization primitives provided high-level programming environment java .net framework application programming interface api posix threads windows api synchronization primitives mutexes semaphores provided synchronize access resources parallel threads execution primitives usually implemented memory barriers required provide expected memory visibility semantics environments explicit use memory barriers generally necessary api programming environment principle high-level memory model defines memory visibility semantics although programmers usually need use memory barriers high level environments important understand memory visibility semantics extent possible understanding necessarily easy achieve memory visibility semantics always consistently specified documented programming language semantics defined different level abstraction machine language opcodes programming environment memory model defined different level abstraction hardware memory model important understand distinction realize always simple mapping low-level hardware memory barrier semantics high-level memory visibility semantics particular programming environment result particular platform implementation posix threads may employ stronger barriers required specification programs take advantage memory visibility implemented rather specified may portable memory barrier instructions address reordering effects hardware level compilers may also reorder instructions part program optimization process although effects parallel program behavior similar cases general necessary take separate measures inhibit compiler reordering optimizations data may shared multiple threads execution note measures usually necessary data protected synchronization primitives discussed prior section c c++ volatile keyword intended allow c c++ programs directly access memory-mapped i/o memory-mapped i/o generally requires reads writes specified source code happen exact order specified omissions omissions reorderings reads writes compiler would break communication program device accessed memory-mapped i/o c c++ compiler may omit reads writes volatile memory locations may reorder read/writes relative actions volatile location variable keyword volatile guarantee memory barrier enforce cache-consistency therefore use volatile alone sufficient use variable inter-thread communication systems processors c c++ standards prior c11 c++11 address multiple threads multiple processors usefulness volatile depends compiler hardware although volatile guarantees volatile reads volatile writes happen exact order specified source code compiler may generate code cpu may re-order execution volatile read write reordered regard non-volatile reads writes thus limiting usefulness inter-thread flag mutex preventing compiler specific compilers like gcc reorder operations around in-line assembly code volatile memory tags like asm volatile memory see examples compiler memory barrier moreover guaranteed volatile reads writes seen order processors cores due caching cache coherence protocol relaxed memory ordering meaning volatile variables alone may even work inter-thread flags mutexes | [
3256,
2182,
3613,
7528,
7532,
5744,
6443,
2942,
6117,
4341,
5762,
412,
415,
3666,
2970,
4017,
7956,
5453,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
5829,
1556,
130,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
1237,
7312,
1607,
... | Test |
1,783 | 5 | Security_Parameter_Index:security parameter index security parameter index spi identification tag added header using ipsec tunneling ip traffic tag helps kernel discern two traffic streams different encryption rules algorithms may use spi per rfc 2401 required part ipsec security association sa enables receiving system select sa received packet processed spi local significance since defined creator sa spi generally viewed opaque bit string however creator sa may interpret bits spi facilitate local processing works like port numbers tcp udp connections means could different sas used provide security one connection sa could therefore act set rules carried encapsulating security payload esp header authentication header ah length 32 bits | [
7626,
2644
] | Test |
1,784 | 5 | Cell_Loss_Priority:cell loss priority cell loss priority clp flag bit atm cell header determines probability cell discarded network becomes congested cells clp 0 insured traffic unlikely dropped cells clp 1 best-effort traffic may discarded congested conditions order free resources handle insured traffic clp used control network traffic policing mechanism policing process determines cells meet predefined restrictions enter atm network restrictions include traffic rates burst sizes agreed upon customer network provider | [
2062,
585
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.