投稿時間:2021-05-24 10:33:14 RSSフィード2021-05-24 10:00 分まとめ(34件)

カテゴリー等	サイト名等	記事タイトル・トレンドワード等	リンクURL	頻出ワード・要約等/検索ボリューム	登録日
ROBOT	ロボスタ	川崎重工とソニーがロボット事業の新会社を設立へ　リモートロボットプラットフォームを提供、働く機会を創出	https://robotstart.info/2021/05/24/kawasaki-sony-robotics.html	出資比率	2021-05-24 00:23:05
TECH	Techable（テッカブル）	スマホ充電器に加湿器がセット？ 斬新な発想の「EZVALOワイヤレス充電セット」	https://techable.jp/archives/155060	glotur	2021-05-24 00:00:43
TECH	TechAcademyマガジン	プログラミングが学べる「東京工科大学」について	https://techacademy.jp/magazine/64313	プログラミングが学べる「東京工科大学」について本記事ではプログラミングが学べる「東京工科大学」について紹介します。	2021-05-24 00:32:20
TECH	TechAcademyマガジン	プログラミングが学べる「武庫川女子大学」について	https://techacademy.jp/magazine/62398	プログラミングが学べる「武庫川女子大学」について本記事ではプログラミングが学べる「武庫川女子大学」について紹介します。	2021-05-24 00:30:35
TECH	TechAcademyマガジン	プログラミングが学べる「長浜バイオ大学」について	https://techacademy.jp/magazine/63539	プログラミングが学べる「長浜バイオ大学」について本記事ではプログラミングが学べる「長浜バイオ大学」について紹介します。	2021-05-24 00:29:39
TECH	TechAcademyマガジン	プログラミングが学べる「福知山公立大学」について	https://techacademy.jp/magazine/64531	プログラミングが学べる「福知山公立大学」について本記事ではプログラミングが学べる「福知山公立大学」について紹介します。	2021-05-24 00:27:15
デザイン	コリス	CSSでテキストやボタン、ボーダーに美しいネオンライトのエフェクトを実装するテクニックのまとめ	https://coliss.com/articles/build-websites/operation/css/css-neon-sign-effects.html	続きを読む	2021-05-24 00:36:11
デザイン	コリス	アドビのセールがAmazonで開催！Adobe CC コンプリートプラン 12か月版が通常セールより安く、お買い得です	https://coliss.com/articles/products/adobe-cc-amazon-20210524-sale.html	続きを読む	2021-05-24 00:26:35
python	Pythonタグが付けられた新着投稿 - Qiita	SECCON Beginners CTF 2021 crypto 02 Logical_SEESAW Writeup	https://qiita.com/housu_jp/items/18dc698941d6da7ce0c3	閃きがある人はproblempyを見ないでoutputtxtだけでこの問題を解いたと思う。	2021-05-24 09:00:54
Program	[全てのタグ]の新着質問一覧｜teratail（テラテイル）	HTMLのページ遷移を正常にしたい！2	https://teratail.com/questions/339997?rss=all	今回もHTMLの方でエラーが発生しております。	2021-05-24 09:58:03
Program	[全てのタグ]の新着質問一覧｜teratail（テラテイル）	:activeが機能しない問題を解決したい。	https://teratail.com/questions/339996?rss=all	btnactiveが動作しない。	2021-05-24 09:40:53
Program	[全てのタグ]の新着質問一覧｜teratail（テラテイル）	税込み金額が表示されません。	https://teratail.com/questions/339995?rss=all	税込み金額が表示されません。	2021-05-24 09:17:56
AWS	AWSタグが付けられた新着投稿 - Qiita	【備忘録】お名前.comで作成したドメインの証明書をACMを使用して取得する	https://qiita.com/ms2geki/items/dd8c4de231dc282bd0b5	【備忘録】お名前comで作成したドメインの証明書をACMを使用して取得する楽なやり方お名前com側に検証レコードを作成するやり方でも可能だが以下の方法が楽。	2021-05-24 09:44:22
golang	Goタグが付けられた新着投稿 - Qiita	[エラー] Golang-migrationを使っていて 「Dirty database version 2. Fix and force version.」が出た時の対処法	https://qiita.com/juchilian/items/0bfed79cc1229deb4c62	エラーGolangmigrationを使っていて「DirtydatabaseversionFixandforceversion」が出た時の対処法この記事で説明することgolangmigrateライブラリを使っていてデータベースのマイグレーションをしたときにerrorDirtydatabaseversionFixandforceversionというエラーが出た時の対処法環境golangMySQL解決法migrateforceコマンドを使うmigratedatabasemysqlrootgolangtcpmysqlgolangdbcharsetutfampparseTimetrueamplocAsiaFTokyopathmigrationsVERSIONdatabase以降はDBのURLを指定pathでマイグレーションファイルの場所指定VERSIONの部分はエラーで出ているVERSIONを数字で指定。	2021-05-24 09:57:55
golang	Goタグが付けられた新着投稿 - Qiita	DynamoDBのテーブル設計&Goでの実装プラクティス〜GSI Overloading編	https://qiita.com/hisamitsu0723/items/2bedd05f071d64ab9d56	例えば以下のようなイベントテーブルがあったときに、IDだけでなく、他のカラムイベント名、日付、タグでも検索したいようなケースです。	2021-05-24 09:37:01
GCP	gcpタグが付けられた新着投稿 - Qiita	【2021年版】Azure/GCP/AWS OCRサービス比較	https://qiita.com/c-makitahiroki/items/d6a0b3416d2845dae050	Azure、GCP共に高い精度で文字認識が出来ていることが分かりましたが、ノイズが少ない点、自然な読み取り順序でOCR出来る点で、機能的にはAzureの方が優れていると感じました。	2021-05-24 09:34:03
Azure	Azureタグが付けられた新着投稿 - Qiita	【2021年版】Azure/GCP/AWS OCRサービス比較	https://qiita.com/c-makitahiroki/items/d6a0b3416d2845dae050	Azure、GCP共に高い精度で文字認識が出来ていることが分かりましたが、ノイズが少ない点、自然な読み取り順序でOCR出来る点で、機能的にはAzureの方が優れていると感じました。	2021-05-24 09:34:03
Git	Gitタグが付けられた新着投稿 - Qiita	We couldn’t deliver this payload: timed out｜GitHubのwebhookでのエラー	https://qiita.com/SwuBHj8aKGqBKHet/items/b59b969b6a0d192df941	WecouldntdeliverthispayloadtimedoutGitHubのwebhookでのエラー解決した方法私のところではプルしている本番環境で自動的に変わってしまっていたファイルを元に戻してプルし直したら治りました。	2021-05-24 09:29:04
Ruby	Railsタグが付けられた新着投稿 - Qiita	PWAとは、railsにPWA導入、vuejsにPWA導入	https://qiita.com/pham_thanh_thuong/items/f5a043f1730c3bf4bfe7	PWAとは、railsにPWA導入、vuejsにPWA導入PWAとはProgressiveWebAppsモバイル端末でウェブサイトを表示するときに、まるでネイティブアプリのような動作を可能にする仕組みPWAとネイティブアプリとウェブサイトの違いウェブサイトブラウザーでURLアクセス出来るHTMLCSSWEBFrameworkで開発するどの端末でもブラウザーがあれば、アクセス出来るOSの深い機能触れませんアプリOSにサポートしているSDKを使って、アプリを開発するOSによって、アプリが違うAndroidIOSMacOsWindowsアプリ使えるため、アプリをダウンロードして、インストールして、開けます。	2021-05-24 09:55:38
海外TECH	DEV Community	Virtualizing Memory	https://dev.to/thesystemsprogrammer/virtualizing-memory-4b0m	Virtualizing MemoryIn the last article we asked ourselves how the operating system gives each process the illusion that it has its own address space despite only having one hardware RAM This is one of the most important and most complicated virtualization techniques that the operating system performs Because of that we will discuss memory virtualization in three separate articles The goals of the operating system with respect to memory are as follows Give processes a contiguous address spaceGive processes memory isolation from each otherDo both of the above efficiently with respect to memory usage and processing speedLet s first talk about what memory is Memory can be thought of as a series of slots bit memory has bit slots and bit memory has bit slots The size of a computer s memory can be quite large For example on my Mac the size of the memory is gigabytes Each memory slot more commonly referred to as address is numbered Memory gigabytes large with bit slots is numbered to each at intervals of bytes bits Diving a bit deeper what does a specific process s memory address space look like There are a couple important sections in a program s memory and they are the stack the heap the code and the data At the bottom is the text segment this is where the code lives Above that is the data segment variables that are global or static live here Above that is the heap segment This is where data allocated at runtime using the malloc call in C for example is located The heap grows upwards memory is allocated at the bottom first and grows to the top Conversely the stack is above the heap and grows downward The stack area is used for local variables that exist only during the duration of its scope and are automatically free d when the scope is exited Contiguous Address SpaceIt s important for a process to have the illusion that it has a contiguous address space If it doesn t then pointer arithmetic can not happen and we wouldn t be able to allocate memory larger than a word at a time A programmer needs a consistent view of memory to them to be able to write code that performs deterministically For example the program needs to know that the calling function s stack is above the callee function s stack Otherwise when exiting the scope of a function the programming language wouldn t know where to go to find the next instruction One way to give programs a contiguous address space is by dividing up the computer s total available memory or RAM random access memory into a fixed number and giving each process one of these chunks The obvious downside of this approach is that we may only be able to have a fixed number of processes running at a particular time For example if I divided up my computer s gigabytes of RAM into gigabyte per process then I would only be able to have processes running simultaneously The th process wouldn t have a chunk of memory readily available to it Additionally there will be a large amount of wasted memory since all these processes would likely not use up the entire address space How can we minimize the amount of unused memory and make it so that any process can access a free memory address One way to do this is to add a layer of indirection that gives each process the illusion that it has a contiguous address space while it may be fragmented in the physical address space This layer of indirection would be a translation table The operating system could have a table that translates address spaces as viewed by the process to address spaces as viewed by the actual hardware Every time the process reads or writes to memory it needs to ask the operating system to look at the translation table to determine what physical address space corresponds to the virtual address space the process is reading or writing from One huge downside of this approach is that every memory access has to go through the operating system Since most programs out there need to access memory frequently having the operating system maintain this data structure and check it on every memory access would take up a lot of CPU cycles How can we make this lookup faster One way to make it faster is by having this translation table live in hardware and have the hardware do the translation instead of the operating system doing it This would be much faster A common implementation of this is to have a translation lookaside buffer TLB in hardware The TLB will map virtual addresses to physical addresses and is updated by the operating system When the hardware looks up a virtual address in the TLB if the translation doesn t exist the hardware executes a handler in the operating system The operating system will fill the TLB with the correct address and the instruction will re execute Now the user process does not need to request an address translation from the operating system everytime it reads or writes to memory Instead the hardware does the memory address translation under the hood Let s see how this might work in practice Let s say a user process wants to allocate some memory at address x The CPU attempts to access the address x by first looking for a translation in the TLB Because this is the first time the program is attempting to access x it doesn t find any entry for x in the TLB and it jumps to execute instructions in the operating system The operating system then checks to see if the process can still allocate memory it is not at its memory limit If it does then it finds a memory address that is unused by any other processes To do this the operating system needs a mapping of memory addresses to whether it is available or not Once the operating system finds an available physical address lets say x it fills the TLB with the virtual address to physical address mapping x gt x Then it will resume the execution of the CPU instruction The next time the CPU wants to read the data at virtual address x the CPU looks it up in the TLB and finds the physical address is x and is able to pull the value correctly To make all this possible the operating system needs a data structure for the mapping of virtual memory addresses to its physical memory address Wait a minute this means that for every memory address we need another memory address to tell us what physical address a virtual address maps to if it does at all Woah this means that we lose half the memory addresses available to us Is there a way we can use memory a little bit more efficiently so we don t lose half of it to operating system accounting overhead Yes there is actually What if instead of a one to one mapping of physical address space to whether it is free or not we map things in larger chunks For example if we have a chunk size of addresses then we would have one entry in memory representing whether addresses are free another entry representing if addresses are free etc…What is the space complexity of this scheme Instead of having to reserve half our memory for a virtual address to physical address mapping we spend the amount of memory on it This is a huge win and the chunk size parameter can be tuned I call this a chunk but it is more commonly referred to as a page and the technique referred to as paging Let s see an example of how all this works Let s say that our program wants to access memory address x address in decimal If our page size is then the TLB will use the last two bits as an offset into the page and the remaining bits to find the virtual to physical page mapping The TLB will first identify the offset which is in decimal x Next it will identify the remaining bits used to find the virtual to physical page mapping The remaining bits are x in hex which corresponds to the virtual to physical page table mapping at index The TLB will take the physical page frame and append the offset to generate the physical memory address that the program will find the data the CPU is requesting Great we now have an efficient way of giving processes the illusion that it has a contiguous address space and access exclusive access to physical hardware when it really doesn t The next thing we need to worry about is memory isolation between processes Memory IsolationWhat s stopping a malicious process or a buggy process from accessing an area of memory that it isn t allocated Easy We can re use the address translation mechanism for creating a contiguous address space In the TLB we can include data about the active process If the active process running an instruction doesn t match the TLB entry then the CPU will trap and execute a SEGFAULT signal handler into the operating system Demand PagingSo are we done Is that what all modern operating systems do Nope one more question Our computers are not limited to a fixed number of processes so how do they do it while still providing memory isolation between processes The answer to this is demand paging Demand paging was an invention during the multi programming era of the operating system initially invented by the Atlas operating system The trick is we can store the memory chunk of a process that isn t running to disk When this process requests the memory again the operating system swaps it from disk and back into memory We re effectively swapping out these pages of memory and putting it into disk when it is not needed and bringing it back when it is needed We are now able to run many processes on the operating system without worrying about the specific number of allotted chunks ConclusionThese are the general principles behind how physical memory is virtualized by the operating system If there is something you are curious to learn more about feel free to reach out to me on Twitter or via email	2021-05-24 00:05:40
金融	日本銀行：RSS	営業毎旬報告（5月20日現在）	http://www.boj.or.jp/statistics/boj/other/acmai/release/2021/ac210520.htm	月日	2021-05-24 10:00:00
金融	日本銀行：RSS	（論文）中国の中長期的な成長力	http://www.boj.or.jp/research/wps_rev/wps_2021/wp21j09.htm	論文	2021-05-24 10:00:00
海外ニュース	Japan Times latest articles	World’s semiconductor supply is in danger unless Taiwan gets vaccines	https://www.japantimes.co.jp/news/2021/05/24/business/taiwan-semiconductors-vaccines/	china	2021-05-24 09:30:22
ニュース	BBC News - Home	US PGA Championship: Phil Mickelson becomes oldest major winner with sixth title	https://www.bbc.co.uk/sport/golf/57224082	title	2021-05-24 00:15:46
ビジネス	ダイヤモンド・オンライン - 新着記事	ガザ地区の再建、米国などはハマスへの資金流入警戒 - WSJ発	https://diamond.jp/articles/-/272068	資金	2021-05-24 09:20:00
ビジネス	ダイヤモンド・オンライン - 新着記事	中国CO2削減目標、鉄鋼需要抑制が不可欠 - WSJ発	https://diamond.jp/articles/-/272069	需要	2021-05-24 09:03:00
LifeHuck	ライフハッカー［日本版］	Word「検索と置換」の意外と知らない便利な使い方	https://www.lifehacker.jp/2021/05/234737how-to-hide-or-mass-delete-all-images-in-a-microsoft-wo.html	置換	2021-05-24 10:00:00
北海道	北海道新聞	コンゴの噴火で１５人死亡　避難中交通事故、刑務所脱獄も	https://www.hokkaido-np.co.jp/article/547175/	交通事故	2021-05-24 09:03:31
北海道	北海道新聞	エンゼルス大谷、代打で同点犠飛　アスレチックス戦	https://www.hokkaido-np.co.jp/article/547186/	犠飛	2021-05-24 09:15:00
北海道	北海道新聞	東京、大阪で大規模接種　高齢者向けワクチン加速	https://www.hokkaido-np.co.jp/article/547182/	高齢者	2021-05-24 09:09:00
北海道	北海道新聞	小室圭さん、ロースクールを卒業　７月にＮＹ州の弁護士試験	https://www.hokkaido-np.co.jp/article/547181/	弁護士試験	2021-05-24 09:09:00
ビジネス	プレジデントオンライン	｢セミナー講師の言いなりで大出費｣自己啓発沼にハマる47歳独身薬剤師のあきれた金癖 - FPの家計見直し要請を断固拒否	https://president.jp/articles/-/46270	沼にハマる	2021-05-24 10:00:00
技術ブログ	Goodpatch Blog	「もう逃げるのはやめた」Goodpatch歴4年、UXデザインリードが振り返る自身の変化とは？｜Blog｜Goodpatch グッドパッチ	https://goodpatch.com/blog/interview-jin	bloggoodpatch	2021-05-24 00:58:26
マーケティング	AdverTimes	松下洸平がワイヤーアクションに初挑戦！ 「ボディメンテ ドリンク」新テレビCM	https://www.advertimes.com/20210524/article350624/	大塚製薬	2021-05-24 00:00:45