Modules - Node.js : Notes

•

0 gefällt mir•36 views

Written for getting up to date with Node.js: Modules Node.js API Node.js is an open-source, cross-platform, back-end, JavaScript runtime environment that executes JavaScript code outside a web browser. Node.js lets developers use JavaScript to write command line tools and for server-side scripting—running scripts server-side to produce dynamic web page content before the page is sent to the user's web browser. Consequently, Node.js represents a "JavaScript everywhere" paradigm,[6] unifying web-application development around a single programming language, rather than different languages for server- and client-side scripts.

Software

265.2020
MODULES
acc.ecsing the main moded
Qddenda: packoge manager ips
addenda: themis extersion
Cultogether.*****
achtno4
Modole ching 0Qvecs
Core modules
cycles
le modoles
koleles as necdole
loading rom odemadolesolders
oading hremthe global holders
hemodule uwrappen
omomnavm waawwwww.wwwo w www.
wwwww.wwwwwwwwwwwwwwwwwwwwwwwww. wwwww.wwwwww.ww.wwww.wwwww.wwwwwwwwwwwwww.wwwwwwwwwwwwwwwwwwwww.wwwwwww.w.wwww.wwww.wwww.wwwwwwwwweawonnmwwwww.wmwwwwwww.me
the modole Scope
-dinname
--hilename
eKport
module
*******
A wwwwwww wwwwwwww wwwwawwwwwwwwwwwwwwwww wwwwwwwwwwwwwwwwwww.wwwwwwwwwww.wwwwwww.w.wwwww.www.www.w.wwww.wwww.www.um mmvamnmowwwwwwwww.wwww
roquire Cid) ********e wwwwwwwwweww*
reqwirn oohe
main_
reSolves
wwwww.w.wwnpathswww. A wwww.wwm wwwww.wwww.wwwww.n
he modole object
modulechildren wwwwwwwwwwwwwwwwwwwwwww.www.www.wwwrowwwwwww.www.owovowmwwwww.ww.ww mdwwewwwwwwww.wwwwwwwwwwwwawwww.wwwwwwwwww
OXporK
ep
exp.ort Shorteut
wwwwwwwwwww.wwww
QUALCOW

moduleilename
eaded
parent
wwwwwwwwmpathS
vaquireCid)
he Modole object
moclole abuiltinMocoleg ** *
crate Requice
SyncBuiltin£CMxpork
Source Map V3Sopport wwww.w.wwww.wwww.ww.wnww
madole bindSourcoMop
olad: madule.SaurceMap
me SourcoMap
SourceMapepayload
*indEnm
www.wwwwmAaA
QUALCOMw

Weitere ähnliche Inhalte

Mehr von Subhajit Sahu

Dynamic Batch Parallel Algorithms for Updating PageRank : POSTER

Subhajit Sahu

Abstract for IPDPS 2022 PhD Forum on Dynamic Batch Parallel Algorithms for Up...

Subhajit Sahu

In this paper, the authors describe two approaches for dynamic community detection using the CNM algorithm. CNM is a hierarchical, agglomerative algorithm that greedily maximizes modularity. They define two approaches: BasicDyn and FastDyn. BasicDyn backtracks merges of communities until each marked (changed) vertex is its own singleton community. FastDyn undoes a merge only if the quality of merge, as measured by the induced change in modularity, has significantly decreased compared to when the merge initially took place. FastDyn also allows more than two vertices to contract together if in the previous time step these vertices eventually ended up contracted in the same community. In the static case, merging several vertices together in one contraction phase could lead to deteriorating results. FastDyn is able to do this, however, because it uses information from the merges of the previous time step. Intuitively, merges that previously occurred are more likely to be acceptable later. https://gist.github.com/wolfram77/1856b108334cc822cdddfdfa7334792a

Fast Incremental Community Detection on Dynamic Graphs : NOTES

Subhajit Sahu

Can you ﬁx farming by going back 8000 years : NOTES

Subhajit Sahu

1. Webpages tend to behave as authorities or hubs. 2. An authority represents an research thesis, and a hub represents an encyclopedia. 3. Each page has an authority and a hub score. 4. The graph is based on query, included pointed to and from pages. 5. Authority score is the sum of scores of all hubs pointing to it. 6. Hub score is the sum of scores of all authorities is pointing to. 7. Score are normalized with L2-norm in each iteration (root of sum of squares). 8. Needs to be performed at query time. 9. Two scores are returned, instead of just one. https://gist.github.com/wolfram77/3d9ef6c5a5b63f53caabce4812c7ea81

HITS algorithm : NOTES

Subhajit Sahu

Computer architectures are facing issues: Memory latencies are far higher. Benefits from instruction level parallelism (ILP) is reducing. With increasing clock rates, power consumption is increasing. Increasing complexity with multi-stage pipelines, intermediate buffers, multi-level caches, out-of-order execution, branch prediction, ... GPUs are parallel computer architectures that are good at some tasks, not so good at others. Running routines with high arithmetic intensity with overlapped memory access is the preferred approach. They may be unsuitable for irregular algorithms, where it is difficult to get high efficiency due to the high latency of accesses. They are less versatile compared to CPUs, using SIMD parallelism, and are dense compute-wise (per currency). NVIDIA's CUDA programming model enables GPUs to be used for general-purpose computing, and hence the term GPGPU. GPU Architectural, Programming, and Performance Models presentation at PPoPP, 2010, Bangalore, India. By Prof. Kishore Kothapalli with Prof. P. J. Narayanan and Suryakant Patidar. https://gist.github.com/wolfram77/43a6660121eef45b78c10d4e652dad6c

Basic Computer Architecture and the Case for GPUs : NOTES

Subhajit Sahu

For the IPDPS ParSocial event a presentation submission is required by 15th May. The event is on 3rd June. https://gist.github.com/wolfram77/51b15ca09eb28f6909673a2deb1a314d DYNAMIC BATCH PARALLEL ALGORITHMS FOR UPDATING PAGERANK Subhajit Sahut, Kishore Kothapallit and Dip Sankar Banerjeet tInternational Institute of Information Technology Hyderabad, India. tIndian Institute of Technology Jodhpur, India. subhajit.sahu@research. ,kkishore@iiit.ac.in, dipsankarb@iitj.ac.in This work is partially supported by a grant from the Department of Science and Technology (DST), India, under the National Supercomputing Mission (NSM) R&D in Exascale initiative vide Ref. No: DST/NSM/R&D Exascale/2021/16. FACEBOOK 15 TAKING A PAGE OUT OF GOOGLE’S PLAYBOOK 10 STOP FAKE NEWS FROM GOING VIRAL PUBLISHED APR 2015 BY SALVADOR RODRIGUEZ Click-Gap: When is Facebook is driving disproportionate amounts of traffic to websites. Effort to rid fakes news from Facebook’s services. Is a website relying on Facebook to drive significant traffic, but not well ranked by the rest of the web? Also News Citation Graph. PAGERANK APPLICATIONS Ranking of websites. Measuring scientific impact of researchers. Finding the best teams and athletes. Ranking companies by talent concentration. Predicting road/foot traffic in urban spaces. Analysing protein networks. Finding the most authoritative news sources Identifying parts of brain that change jointly. Toxic waste management. PAGERANK APPLICATIONS Debugging complex software systems (Moni torRank) Finding the most original writers (BookRank) Finding topical authorities (TwitterRank) WHAT IS PAGERANK l—-d Plu = Cus + —— UCIiNny Pru u->v = (1-—d) x “us ( ) outdegy, PageRank is a lLink-analysis algorithm. By Larry Page and Sergey Brin in 1996. For ordering information on the web. Represented with a random-surfer model. Rank of a page is defined recursively. Calculate iteratively with power-iteration.

Dynamic Batch Parallel Algorithms for Updating Pagerank : SLIDES

Subhajit Sahu

Satellites are usually covered in aluminized polyimide. The yellowish gold color of polyimide with silver aluminium side facing in gives the satellite the appearance of being wrapped in gold. The material is called Multi-layer Insulation (MLI). It helps in radiative insulation of the onboard instruments of satellite. Gold is actually used in electrical contacts to prevent corrosion due to Ultra-violet light or X-rays. https://gist.github.com/wolfram77/8ae2de1a29caf1a2f84babed79943389

Are Satellites Covered in Gold Foil : NOTES

Subhajit Sahu

This tutorial discusses on tax calculation for long-term and short-term capital gains, as well as for business income that speculative (intraday, BTST) and non-speculative (F&O, BTST). Also a nice concept on tax-loss harvesting. When turnover for business income is more than 5Cr or gains less than 6% an audit is required by a CA. Business income requires maintaining balance sheet and income statement. I may need an audit by a CA.

Taxation for Traders < Markets and Taxation : NOTES

Subhajit Sahu

This paper discusses a method of Generalizing PageRank algorithm for different types of networks. Rank of each vertex is considered to be dependent upon both the in- and out-edges. Each edge can also have differing importance. This solves the problem of dead ends and spider traps without the need of taxation (?). --- Abstract— PageRank is a well-known algorithm that has been used to understand the structure of the Web. In its classical formulation the algorithm considers only forward looking paths in its analysis- a typical web scenario. We propose a generalization of the PageRank algorithm based on both out-links and in-links. This generalization enables the elimination network anomalies- and increases the applicability of the algorithm to an array of new applications in networked data. Through experimental results we illustrate that the proposed generalized PageRank minimizes the effect of network anomalies, and results in more realistic representation of the network. Keywords- Search Engine; PageRank; Web Structure; Web Mining; Spider-Trap; dead-end; Taxation;Web spamming

A Generalization of the PageRank Algorithm : NOTES

Subhajit Sahu

With biomedical signal processing algorithms, such as the Pan-Tompkins QRS peak detection algorithm, FIR filters are utilized. Raw ECG signal can be fed to a Moving window filter, which helps filter out noise and get the signal of interest. These FIR filters involve the use of multipliers and adders, which take in several input sample and output a single sample. This paper replaces accurate adders in such filters with 10 16-bit signed approximate adders (power ve error parameters) from the EvoApprox library. Functional validation is done in MATLAB with Structural Similarity Index (SSIM) and Peak Signal-to-Noise Ratio (PSNR) of Moving Window Integration; and Mean Square Error (MSE) of thresholds as error metrics. MIT-BIH Arrythmia database is used as the raw ECG input. In hardware evaluation, a 100-point FIR filter is implemented with a single Multiply-accumulate unit where the exact adder is replaced with selected approximate adder. RTL model is synthesized with 45nm NandGate Open Cell library in Synopsys design compiler. Area, Average power, and Worst-case delay are measured. On average the presented methodology provides an area-saving of 19.71% and power-saving of 19.27%.

ApproxBioWear: Approximating Additions for Efficient Biomedical Wearable Comp...

Subhajit Sahu

1. Old vs New tax regime [Form26AS] 2. Quarterly Tax Deducted at Source (TDS) [Form16] 3. Quarterly Tax Deducted at Source (other income) [Form 15G/H] 4. Quarterly Advance Tax (extra income) [Challan ITNS 280] Extras: - Public Provident Fund scheme (PPF) - National Pension Scheme (NPS) References: - https://www.incometax.gov.in/iec/foportal - https://finshots.in/archive/finshots-money-resolution-4-axe-your-tax/

Income Tax Calender 2021 (ITD) : NOTES

Subhajit Sahu

Youngistaan Foundation: Annual Report 2020-21 : NOTES

Subhajit Sahu

Youngistaan: Voting awarness-campaign : NOTES

Subhajit Sahu

Highlighted notes on: Cost Efficient PageRank Computation using GPU This paper discusses the use of Aitken extrapolated Power method for PageRank computation. However, the results are unclear whether the performance improvement is due to GPU implementation, or due to use of Aitken extrapolation. The paper mentions a good performance improvement for damping factor values close to 1, and very low tolerance values which are usually not used for PageRank computation. It needs to be cross-checked to see if Aitken extrapolation provides and reduction of iterations on CPU only (as the same effect would be observed on the GPU, only timings change).

Cost Efficient PageRank Computation using GPU : NOTES

Subhajit Sahu

This is my report on: Rank adjustment strategies for Dynamic PageRank (v1). While doing research work under Prof. Dip Banerjee, Prof. Kishore Kothapalli. Abstract — To avoid calculating ranks of vertices in a dynamic graph from scratch for every snapshot, the ones computed in the previous snapshot of the graph can be used, with adjustment. Four different rank adjustment strategies for dynamic PageRank are studied here. These include zero-fill, 1/N-fill, scaled zero-fill, and scaled 1/N-fill. Results indicate that the scaled 1/N-fill strategy requires the least number of iterations, on average. As long as the graph has no affected dead ends (including dead ends in the previous snapshot), unaffected vertices can be skipped with this adjustment strategy. Index terms — PageRank algorithm, Dynamic graph, Rank adjustment, Initial ranks.

Rank adjustment strategies for Dynamic PageRank : REPORT

Subhajit Sahu

Variadic CRTP : NOTES

Subhajit Sahu

Highlighted notes on: Proceedings Scholar Metrics: H Index of proceedings on Computer Science, Electrical & Electronic Engineering, and Communications according to Google Scholar Metrics (2009-2013) The objective of this report is to present a list of proceedings (conferences, workshops, symposia, meetings) in the areas of Computer Science, Electrical & Electronic Engineering, and Communications covered by Google Scholar Metrics and ranked according to their hindex. Google Scholar Metrics only displays publications that have published at least 100 papers and have received at least one citation in the last five years (2009-2013). The searches were conducted between the 15th and 22nd of December, 2014. A total of 1208 proceedings have been identified.

Proceedings Scholar Metrics : NOTES

Subhajit Sahu

Highlighted notes on: Top CSE conferences list (IIIT Hyderabad) ICDE: International Conference on Data Engineering WWW: International World Wide Web Conference VLDB: International Conference on Very Large Databases ICDM: International Conference on Data Mining ICDE: International Conference on Data Engineering WSDM: International Conference on Web Search and Data Mining POPL: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages PLDI: ACM SIGPLAN Conference on Programming Language Design and Implementation OOPSLA: Conference on Object Oriented Programming Systems Languages and Applications PODC: ACM Symposium on Principles of Distributed Computing SODA: ACM/SIAM Symposium on Discrete Algorithms ASPLOS: Architectural Support for Programming Languages and Operating Systems SC: ACM/IEEE Supercomputing Conference IPDPS: International Parallel and Distributed Processing Symposium SIGMETRICS: ACM SIG on Computer and Communication Metrics and Performance ICSE: International Conference on Software Engineering FSE/ESEC: ACM SIGSOFT International Symposium on Foundations of Software Engineering

Top CSE conferences list (IIIT Hyderabad) : NOTES

Subhajit Sahu

Policy on stipend support for research students (IIIT Hyderabad) : NOTES

Subhajit Sahu

Mehr von Subhajit Sahu (20)

Dynamic Batch Parallel Algorithms for Updating PageRank : POSTER

Abstract for IPDPS 2022 PhD Forum on Dynamic Batch Parallel Algorithms for Up...

Fast Incremental Community Detection on Dynamic Graphs : NOTES

Can you ﬁx farming by going back 8000 years : NOTES

HITS algorithm : NOTES

Basic Computer Architecture and the Case for GPUs : NOTES

Dynamic Batch Parallel Algorithms for Updating Pagerank : SLIDES

Are Satellites Covered in Gold Foil : NOTES

Taxation for Traders < Markets and Taxation : NOTES

A Generalization of the PageRank Algorithm : NOTES

ApproxBioWear: Approximating Additions for Efficient Biomedical Wearable Comp...

Income Tax Calender 2021 (ITD) : NOTES

Youngistaan Foundation: Annual Report 2020-21 : NOTES

Youngistaan: Voting awarness-campaign : NOTES

Cost Efficient PageRank Computation using GPU : NOTES

Rank adjustment strategies for Dynamic PageRank : REPORT

Variadic CRTP : NOTES

Proceedings Scholar Metrics : NOTES

Top CSE conferences list (IIIT Hyderabad) : NOTES

Policy on stipend support for research students (IIIT Hyderabad) : NOTES

Modules - Node.js : Notes

1. 265.2020 MODULES acc.ecsing the main moded Qddenda: packoge manager ips addenda: themis extersion Cultogether.***** achtno4 Modole ching 0Qvecs Core modules cycles le modoles koleles as necdole loading rom odemadolesolders oading hremthe global holders hemodule uwrappen omomnavm waawwwww.wwwo w www. wwwww.wwwwwwwwwwwwwwwwwwwwwwwww. wwwww.wwwwww.ww.wwww.wwwww.wwwwwwwwwwwwww.wwwwwwwwwwwwwwwwwwwww.wwwwwww.w.wwww.wwww.wwww.wwwwwwwwweawonnmwwwww.wmwwwwwww.me the modole Scope -dinname --hilename eKport module ******* A wwwwwww wwwwwwww wwwwawwwwwwwwwwwwwwwww wwwwwwwwwwwwwwwwwww.wwwwwwwwwww.wwwwwww.w.wwwww.www.www.w.wwww.wwww.www.um mmvamnmowwwwwwwww.wwww roquire Cid) ********e wwwwwwwwweww* reqwirn oohe main_ reSolves wwwww.w.wwnpathswww. A wwww.wwm wwwww.wwww.wwwww.n he modole object modulechildren wwwwwwwwwwwwwwwwwwwwwww.www.www.wwwrowwwwwww.www.owovowmwwwww.ww.ww mdwwewwwwwwww.wwwwwwwwwwwwawwww.wwwwwwwwww OXporK ep exp.ort Shorteut wwwwwwwwwww.wwww QUALCOW

2. moduleilename eaded parent wwwwwwwwmpathS vaquireCid) he Modole object moclole abuiltinMocoleg ** * crate Requice SyncBuiltin£CMxpork Source Map V3Sopport wwww.w.wwww.wwww.ww.wnww madole bindSourcoMop olad: madule.SaurceMap me SourcoMap SourceMapepayload *indEnm www.wwwwmAaA QUALCOMw

Modules - Node.js : Notes

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Mehr von Subhajit Sahu

Mehr von Subhajit Sahu (20)

Modules - Node.js : Notes