投稿時間:2021-12-05 08:13:51 RSSフィード2021-12-05 08:00 分まとめ(14件)

カテゴリー等	サイト名等	記事タイトル・トレンドワード等	リンクURL	頻出ワード・要約等/検索ボリューム	登録日
TECH	Techable（テッカブル）	非デジタル人材に優しい、ノーコードの機械学習プラットフォーム「Comler」	https://techable.jp/archives/168010	comler	2021-12-04 22:00:14
js	JavaScriptタグが付けられた新着投稿 - Qiita	Next.jsでcommit時にaddされているファイルにのみリントとフォーマットを実行する	https://qiita.com/taku-hu/items/50bb3c43c10db85c7c4d	つまり単純にmoduleexportsjstsxfilenamesgtyarnformatyarnlintfixのように書くと、ステージングされたファイルにjsjsxtstsxが存在すると、yarnformatとyarnlintが実行されます。	2021-12-05 07:53:39
Program	[全てのタグ]の新着質問一覧｜teratail（テラテイル）	WEBページを作成していますがスマホで画像が表示されない	https://teratail.com/questions/372294?rss=all	WEBページを作成していますがスマホで画像が表示されないHTML、CSSを使用してWEBサイトを作成しているのですがセパレーターとして配置したい画像がスマホandroid、iphoneで表示されません。	2021-12-05 07:11:07
Program	[全てのタグ]の新着質問一覧｜teratail（テラテイル）	spleeter がファイルを読み込まない	https://teratail.com/questions/372293?rss=all	spleeterがファイルを読み込まない前提・実現したいことspleeterを使いたい。	2021-12-05 07:07:10
Linux	Ubuntuタグが付けられた新着投稿 - Qiita	ミルククラウン解析（その１，アニメーション）	https://qiita.com/openyanagi/items/81639964f129b4654ef5	解析	2021-12-05 07:58:43
海外TECH	MakeUseOf	7 Terms You Need to Know When Buying a New SSD	https://www.makeuseof.com/tag/7-terms-need-know-buying-new-ssd/	ssdwhile	2021-12-04 22:55:37
海外TECH	MakeUseOf	Oculus Rolls Out Quest v35: Here's What's New	https://www.makeuseof.com/oculus-quest-v35-new-features/	update	2021-12-04 22:14:31
海外TECH	DEV Community	How to reduce the time complexity of nested loops	https://dev.to/leandronsp/how-to-reduce-the-time-complexity-of-nested-loops-1lkd	How to reduce the time complexity of nested loopsIn this post I ll demonstrate a way to understand analyse and reduce the time complexity on algorithms specially on nested loops The examples will use Ruby but it can be translated to any programming language ProblemWorking throughout a variety of projects it s not rare to stumble on pieces of code like the following a nested loop which is a loop under another loop for group in groups for user in users do something with the group and user endendAnalysing the above code and assuming we have groups and users for each group times we iterate over all users times which leads iterationseach iteration has a cost to the CPU so the more iterations we do the more our algorithm will perform worseif the lists grow over time we can face serious performance issues on such algorithmIn the Big O notation analysis this algorithm may end up having a squared time complexity or O n² because ² Can we improve it With regard to reducing the time complexity of O n² squared we can work to reduce to O n linear or O log n in most cases which would make our algorithm to perform faster There are some category of problems where it s not possible to reduce in optimal ways but in our example it s perfectly possible to reduce Let s see how to improve it Reducing iterationsRemember that at this point our algorithm will perform iterations ² groups users for group in groups for user in users A naive solution is to remove the nested loop for group in groups do something with group and user now we are missing the user but we need to fetch the user information from another data structureendthe algorithm will perform only iterations much fasterwhich means it s linear or O n However our algorithm is lo longer working because we have to fetch the user information from inside the groups loop Ideally for each group we want the fetch the user information in constant time no matter how big is the user s list Long live the hash tablesIn computer science data structures are a VERY important topic to study and understand In order to fetch the user information in constant time O we can use a hash table Ruby provides this data structure out of the box which is called Hash Building a hashHow can we build a hash containing all the information required in the groups loop We must iterate over all users and build the hash with the needed information Such technique is widely used for creating structure like indices where the information is accessed via a key in constant time O Example users idx for user in users users idx user id endThen wherever we have to fetch the user information we are able to do it be accessing via users idx and the respective keys Putting all togetherContinuing on the challenge to reduce the iterations on our algorithm we have to perform the following steps build the index with the information to be accessed lateriterate over the loop and fetch the additional information from the previously created index users idx for user in users users idx user group id endfor group in groups user information users idx group id do something with group AND user informationendBut wait two loops Isn t it still squared O n² Let s compare it The first solution performs iterations whereas the second performs iterations for building the index plus iterations for iterating over groups Put simply nested loop index AND loop It s still WAY lower than the initial We could write even more loops three four five times It doesn t matter it will be linear O n because in terms of time complexity O n O n O n and so on Comparing both solutionsIn this Gist I created the dummy data and the benchmark in order to compare both solutions For small list sizes there are no practical differences But with bigger lists the improvement is perceived Here are the results on how faster is using the index groups users gt x faster groups users gt x faster groups users gt x faster groups users gt x faster groups users gt x faster ConclusionThis post is a demonstration on how to analyse understand and reduce time complexity on algorithms specifically when we face situations of nested loops Most of times instead of trying to look to another complex solutions such as caching and even more complex ones understanding algorithms analysis can help us to write good and cheaper solutions Moreover in case the loops perform database queries using ORM many nested loops can be improved by just using SQL JOINS	2021-12-04 22:11:13
Apple	AppleInsider - Frontpage News	Best deals Dec. 4: $979 11-inch iPad Pro, $148 Respawn gaming chair, Lego Star Wars Droid, more!	https://appleinsider.com/articles/21/12/04/best-deals-dec-4-979-11-inch-ipad-pro-148-respawn-gaming-chair-lego-star-wars-droid-more?utm_medium=rss	Best deals Dec inch iPad Pro Respawn gaming chair Lego Star Wars Droid more Along with off an inch iPad Pro Saturday s best deals include off Sennheiser Momentum true Wireless earbuds a K done for and an Echo Show for Best deals for December The internet has a plethora of deals each day but many deals aren t worth pursuing In an effort to help you sift through the chaos we ve hand curated some of the best deals we could find on Apple products tech accessories and other items for the AppleInsider audience Read more	2021-12-04 22:56:35
海外TECH	Engadget	Clearview AI will get a US patent for its facial recognition tech	https://www.engadget.com/clearview-ai-facial-recognition-patent-222347603.html?src=rss	Clearview AI will get a US patent for its facial recognition techClearview AI is about to get formal acknowledgment for its controversial facial recognition technology Politicoreports Clearview has received a US Patent and Trademark Office quot notice of allowance quot indicating officials will approve a filing for its system which scans faces across public internet data to find people from government lists and security camera footage The company just has to pay administrative fees to secure the patent In a Politico interview Clearview founder Hoan Ton That claimed this was the first facial recognition patent involving quot large scale internet data quot The firm sells its tool to government clients including law enforcement hoping to accelerate searches As you might imagine there s a concern the USPTO is effectively blessing Clearview s technology and giving the company a chance to grow despite widespread objections to its technology s very existence Critics are concerned Clearview is building image databases without targets knowledge or permission and multiple governments including Australia and the UK believe the facial recognition violates data laws The tech could theoretically be used to stifle political dissent or in private use to stalk other people That s not including worries about possible gender and race biases for facial recognition as a whole nbsp Ton That maintained Clearview has no plans to sell to anyone besides government clients and that it was quot important quot to have unbiased systems However the patent left the door open to non government purposes like learning more about a dating partner or business client Clearview is aware of the problematic path its technology might take even if it doesn t intend to head in that direction	2021-12-04 22:23:47
海外科学	NYT > Science	What We Know About the New Covid Variant, Omicron	https://www.nytimes.com/article/omicron-coronavirus-variant.html	What We Know About the New Covid Variant OmicronIntense research into the new coronavirus variant first identified in southern Africa has just begun World leaders have urged people not to panic ーand to get vaccinated if they can	2021-12-04 22:33:42
ニュース	BBC News - Home	Why Ugandan troops have entered DR Congo - again	https://www.bbc.co.uk/news/world-africa-59507543?at_medium=RSS&at_campaign=KARANGA	againprevious	2021-12-04 22:02:55
ニュース	BBC News - Home	'It will be anyone's to grab' - Arsenal and Chelsea face-off in FA Cup final	https://www.bbc.co.uk/sport/football/59518489?at_medium=RSS&at_campaign=KARANGA	x It will be anyone x s to grab x Arsenal and Chelsea face off in FA Cup finalThe Women s Super League s top two sides meet in the delayed FA Cup final as leaders Arsenal face Chelsea at Wembley on Sunday	2021-12-04 22:23:27
ニュース	BBC News - Home	Britain's Archibald wins endurance title at inaugural UCI Track Champions League	https://www.bbc.co.uk/sport/cycling/59536278?at_medium=RSS&at_campaign=KARANGA	Britain x s Archibald wins endurance title at inaugural UCI Track Champions LeagueGreat Britain s Katie Archibald claims the women s endurance title following the inaugural UCI Track Champions League	2021-12-04 22:21:25