url
stringlengths 13
4.35k
| tag
stringclasses 1
value | text
stringlengths 109
628k
| file_path
stringlengths 109
155
| dump
stringclasses 96
values | file_size_in_byte
int64 112
630k
| line_count
int64 1
3.76k
|
|---|---|---|---|---|---|---|
https://community.hubitat.com/t/alert-to-disarm-prior-to-intrusion/15822
|
code
|
I have my "Delay intrusion Armed-Away alerts by this many seconds" set to 45 seconds. On my traditional alarm system -> the keypad would beep indicating to disarm before the siren goes off and the monitoring company is contacted.
Do you guys have any setup like this to indicate that the system needs to be disarmed before intrusion occurs?
How can I configure this in rule machine? I am thinking about having my speakers repeat "disarm security" until security is disarmed but not sure how to configure this. Or perhaps I can have a red light turn on?
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-22/segments/1558232257100.22/warc/CC-MAIN-20190523043611-20190523065611-00020.warc.gz
|
CC-MAIN-2019-22
| 552
| 3
|
http://www.fantasyfootballcafe.com/forums/viewtopic.php?t=235851
|
code
|
Any advice for newbie Commish?
Private Yahoo League of friends/friends of friends/co-workers
Small money but still money.
The commish from the last several years is just tired of it so I'm taking over because nobody else would.
1. Let people make stupid trades. Anything other than obvious collusion should be an acceptable trade. Everybody knows everybody, most are all pretty equal in football knowledge (though some think more highly of themselves than their records would indicate) and I have faith that there's enough character amongst my team captains that they won't knowingly cheat.
I've been playing since the days of keeping track of everything on paper and figuring out scores from the box scores in the newspaper (In other words, no fancy Yahoo keeping track for me). I learned a lot from my first years of stupid trades and I don't think I would have if my trades had been rejected by the league. It has to sting to stick.
2. Get the money up front.
3. Have a great year.
As a player all I wanted from my commissioner was cash at the end of the championship game. (Come to think of it, as commssioner, that's what I want too!
) Am I naive in thinking that's all my league will want from me?
|
s3://commoncrawl/crawl-data/CC-MAIN-2014-23/segments/1405997883858.16/warc/CC-MAIN-20140722025803-00029-ip-10-33-131-23.ec2.internal.warc.gz
|
CC-MAIN-2014-23
| 1,203
| 10
|
https://powerusers.microsoft.com/t5/I-Found-A-Bug/Flow-not-Triggering-Sharepoint-Modified/td-p/38428/highlight/true/page/10
|
code
|
I also have this same issue. The Flow that I have created for created or modified items on my Sharepoint list only triggers sometimes. I have been unable to determine what is causing this or the pattern why. The Flow does not error out it just does not run at all.
I've started looking at this with the SharePoint team, but in order to investigate any specific cases we need to know rough timestamps (with timezone) that changes were made on the list so we can compare with trigger operations to see why there were delays. Please post here or feel free to reach out by email.
The more data that is provided, the easier the investigations are. If you have more instances of the exact day and time changes along with the corresponding (delayed) Flow run URL, we can investigate issues more easily.
The time has come: We are finally able to share more details on the brand-new ranks coming to the Power Automate Community!
We are excited to announce the launch of Power Virtual Agents Community. Check it out now!
We've updated and improved the layout and uploading format of the Power Automate Cookbook!
Fill out a quick form to claim your user group badge now!
The top training and networking event across the globe for Microsoft Business Applications
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-24/segments/1590347439019.86/warc/CC-MAIN-20200604032435-20200604062435-00440.warc.gz
|
CC-MAIN-2020-24
| 1,250
| 8
|
http://stackoverflow.com/questions/4132558/compile-time-container-of-functors-for-controlling-an-algorithm
|
code
|
Suppose i want something simple like the following:
I have an core-algorithm, which randomly selects one of the specialized algorithms (specialized at compile-time) and process this algorithm. These specialized algorithms are implemented trough functors.
The question is now: how to implement a container, which is build at compile-time, where the core-algorithm can first check the size of this container ("i got 4 algorithms -> need to randomly select algorithm 0-3") and can then execute the functor in this container ("randomly chosen 2 -> process the third functor in container").
How would one implement it as simple as possible? I suppose it is possible.
Edit: All the algorithms will be used in the core-algorithm. The use pattern (random-numbers) is a runtime-decision (so i don't need compile-time-rands). The algorithm just has to know the container of functors and the size of this container for safe access.
|
s3://commoncrawl/crawl-data/CC-MAIN-2014-35/segments/1408500812867.24/warc/CC-MAIN-20140820021332-00210-ip-10-180-136-8.ec2.internal.warc.gz
|
CC-MAIN-2014-35
| 920
| 5
|
https://class.textile-academy.org/2023/amandine-fery/
|
code
|
I’m Amandine Zoé Fery, I’m french, living in Lyon. Student at Fabricademy. This website is for documented my work during the future months of this program.
I'm glad and in same time I feel shy to be part of Fabricademy. I curious to learn a new diversity of technical and discovering news approach for helping me to growing in my projects.
It is by these values and ambitions that I chose to apply to Fabricademy. The opening that the program brings by its transversality, motivates me more to continue learning in textile innovation linked to new technology and biology.
Last update: 2023-01-02
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296945472.93/warc/CC-MAIN-20230326111045-20230326141045-00214.warc.gz
|
CC-MAIN-2023-14
| 600
| 4
|
http://oculusdrifter.blogspot.com/2014/03/2001.html
|
code
|
I did some screen captures of the Jupiter sequence from 2001. I wanted to build something similar into the start of my game.
Wow, Greg Ercolano did all the heavy lifting I needed 12 years ago.
It was funny reading his approach. I was building the exact same logic in a photoshop script when I stumbled on his work.
If I can make this work it is going to be awesome
I did it but I couldn't use the original textures from Greg.
They were too pixelated.
I'm still giving him credit at the end
of the game for his excellent work.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917120187.95/warc/CC-MAIN-20170423031200-00448-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 525
| 8
|
https://ijcttjournal.org/helium/ijctt/ijctt-v56p102
|
code
|
Accelerating Hash Join Performance by Exploiting Data Distribution
||International Journal of Computer Trends and Technology (IJCTT)||
|© 2018 by IJCTT Journal|
|Year of Publication : 2018|
|Authors : Yang Liu#1, Zhen He#2, Xiang Wu Meng|
|DOI : 10.14445/22312803/IJCTT-V56P102|
Yang Liu#1, Zhen He#2, Xiang Wu Meng "Accelerating Hash Join Performance by Exploiting Data Distribution ". International Journal of Computer Trends and Technology (IJCTT) V56(1):6-20, February 2018. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.
thejoin operator in relational databases is one of the most IO intensive operations. Thelarge size of input relations makes it hard to fit them entirely in RAM during join processing. Therefore therelations are processed in chucks inside a RAM buffer of limited size.The ideabehindasuccessfuljoin algorithm is to make the most efficient use of the limited sized buffer to minimizethenumberof IOs. The hash join algorithm has been a popular algorithm due to its relativelylowIOcostscompared to other methods. In this paper we make the observation that the performanceofthehash join can be dramatically improved if we take advantage of skewed distributionsandmissingvalues in join attributes. We propose the filtered hash join (FH-join) which filtersouttuplesoftheinput relations during the partitioning phase of the hash join to minimize the workleft forthejoinphase. The results show FH-join can outperform the hybrid hash join by up to a factor 4 in terms of total execution time when the data is much skewed.
Hayes, T., Palomar, O., Unsal, O., Cristal, A., and Valero, M. (2012) Vector Extensions for Decision Support DBMS Acceleration. The 45th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO45), pp. 166–176.
DeWitt, D. J., Katz, R. H., Olken, F., Shapiro, L. D., Stonebraker, M. R., and Wood, D. A. (1984) Implementation techniques for main memory database systems. Proceedings ACM SIGMOD ’84, pp. 1–8.
Do, J. and Patel, J. M. (2009) Join processing for flash ssds: remembering past lessons. DaMoN, pp. 1–8.
Mullin, J. K. (1983) A second look at bloom filters. Communications of the ACM, 26, 570–571.
Mishra, P. and Eich, M. H. (1992). Join processing in relational databases. ACM Computing Survey, 24, 63–113.
Nooshin S, Mirzadeh, Kockerber, O, Falsafi B, and Grot B. (2015) Sort vs. Hash join revisited for near-memory execution, pp. 1-6
Balkesen C, Teubner J, Alonso G, et al. (2015). Main-Memory Hash Joins on Modern Processor Architectures [J]. IEEE Transactions on Knowledge and Data Engineering, , 27(7): 1754-1766.?
Kim, C., Kaldewey, T., Lee, V. W., Sedlar, E., Nguyen, A. D., Satish, N., Chhugani, J., Di Blas, A., and Dubey, P. (2009) Sort vs. hash revisited: fast join implementation on modern multi-core cpus. Proceedings of the VLDB, 2, 1378–1389.
Blanas, S., Li, Y., and Patel, J. M. (2011) Design and evaluation of main memory hash join algorithms for multicore cpus. SIGMOD Conference, pp. 37–48.
Chen, S., Ailamaki, A., Gibbons, P. B., and Mowry, T. C (2004) Improving hash join performance through prefetching. Proceedings of the 20th International Conference on Data Engineering ICDE ’04, pp. 116–127.
Manegold, S., Boncz, P. A., and Kersten, M. L. (2000) What happens during a join? Dissecting CPU and memory optimization effects. Proceedings of the VLDB, pp. 339–350.
Chen, S., Ailamaki, A., Gibbons, P. B., and Mowry, T. C. (2005) Inspector joins. Proceedings of VLDB, pp. 817–828.
Manegold, S., Boncz, P., and Kersten, M. (2002) Optimizing main-memory join on modern hardware. IEEE Transactions on Knowledge and Data Engineering, 14, 709–730.
Zeller, H. and Gray, J. (1990) An adaptive hash join algorithm for multiuser environments. In McLeod, D., Sacks-Davis, R., and Schek, H.-J. (eds.), Proceedings of VLDB, pp. 186–197.
Martin, P., Larson, P.-A°., and Deshpande, V. (1994) Paralle hash-based join algorithms for a shared-everything. IEEE Trans. Knowl. Data Eng., 6, 750–763.
Kitsuregawa, M., Nakayama, M., and Takagi, M. (1989) The effect of bucket size tuning in the dynamic hybrid grace hashjoin method. VLDB, pp. 257–266.
Kitsuregawa M, Ogawa Y. Bucket spreading parallel hash: a new, robust, parallel hash join method for data skew in the super database computer (SDC)[J]. Very large data bases, 1990: 210-221.
Kitsuregawa, M., ichiro Tsudaka, S., and Nakano, M. (1992) Parallel grace hash join on shared-everything multiprocessor:Implementation and performance evaluation on symmetry s81. Proceedings of ICDE.
DeWitt, D. J., Naughton, J. F., Schneider, D. A., and Seshadri, S. (1992) Practical skew handling in parallel joins. Proceedings of VLDB, pp. 27–40.
Haas, L. M., Carey, M. J., Livny, M., and Shukla, A. (1997) Seeking the truth about ad hoc join costs. The VLDB Journal, 6, 241–256
hash join, relational databases, query processing
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100476.94/warc/CC-MAIN-20231202235258-20231203025258-00809.warc.gz
|
CC-MAIN-2023-50
| 4,917
| 29
|
https://www.mttstructures.com/custom-structures/
|
code
|
Create The Perfect Structure For Your Space
Number One Manufacturer
With 57 years of expertise, we’ve crafted over 100 unique custom structures. Tailored to your needs and space. Choose us for quality, reliability, and a legacy of satisfied customers.
What we need from you
Could you please provide a description of the type of structure you envision for your space? For instance, if you’re considering a stage structure for your open area, that would be incredibly helpful for us to know. By understanding your preferences, we can tailor our proposals to best suit your needs and desires. Thank you for sharing your vision with us!
To give you the best possible service, we’d really appreciate it if you could share some photos of your site area with us. Having visuals helps us understand the space better and allows us to come up with ideas that fit perfectly for you. Thanks for your help—it’ll make the process smoother for everyone involved!
For our proposal, it would be incredibly helpful to have approximate sizing for the project. If you have exact measurements, that’s even better, but rough estimates will suffice for now. Rest assured, once the project is approved, we’ll require precise measurements to ensure accuracy and optimal results. Your cooperation in providing this information will greatly expedite our proposal process. Thank you for your assistance!
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817576.41/warc/CC-MAIN-20240420091126-20240420121126-00381.warc.gz
|
CC-MAIN-2024-18
| 1,389
| 7
|
https://www.escdaily.com/baku-2012-italy-change-to-lamore-e-femmina/
|
code
|
The Italian national broadcaster; RAI, and Universal Music Italy announced officially today that the Italian entry for the Eurovision Song Contest 2012 changes to “L’Amore è Femmina”.
“L’Amore è Femmina” is taken from the brand new album of the Italian artist; Nina Zilli. “L’amore è femmina”(English: Love is female) is the second studio album by Italian recording artist Nina Zilli, released in Italy on 15 February 2012, following her participation in the 62nd Sanremo Music Festival with the song “Per sempre”. The album reached the 11th position in the Italian Albums Chart.
You can listen to the Italian entry below;
- Nina Zilli – L’Amore è Femmina
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104215790.65/warc/CC-MAIN-20220703043548-20220703073548-00291.warc.gz
|
CC-MAIN-2022-27
| 685
| 4
|
https://discourse.mcneel.com/t/two-issues-for-gh-style/139274
|
code
|
The other one is “Deconstruct Parameters” issue. When I import parameters by “Object”, I can get them in grasshopper, but when I import them by “Style”, I can not. Is there any way to get parameters in grasshopper when import parameters by “Style”
Yes, we’re aware of this issue. The problem is that parameters need to have an internal name which must be unique, and the function that generates this name doesn’t work fine with non-Latin character. We’ll fix this issue in VisualARQ 2.13.
The components “Property names”, and “Object parameter” only work with parameters that are editable by the object passed in the “O (Object)” parameter. When a parameter is set to be editable “By Style”, this parameter does not exist for the instance object (well, it exists, but is not applicable for it). You need to deconstruct the element to get the style and query the parameters to the style.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233506559.11/warc/CC-MAIN-20230924023050-20230924053050-00198.warc.gz
|
CC-MAIN-2023-40
| 924
| 3
|
https://forum.radxa.com/t/m-2-nvme-intel-1tb-660p-not-reconized-on-ubuntu-server/698/12
|
code
|
Here is a link to the item purchased:
No /dev/nvme* device is created when booted. I tried directly connected to the board and also through the riser device.
While looking at dmesg I see these errors:
[ 3.875231] rockchip-pcie f8000000.pcie: PCIe link training gen1 timeout! [ 3.890425] rockchip-pcie: probe of f8000000.pcie failed with error -110
Any insight into why this m.2 nvme SSD wouldn’t be visible would be helpful.
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-22/segments/1558232257002.33/warc/CC-MAIN-20190523023545-20190523045545-00251.warc.gz
|
CC-MAIN-2019-22
| 426
| 5
|
https://www.mariobutterfield.com/
|
code
|
Create, by any means necessary.
I combine my knowledge of graphic design, photography, and video production to create visually powerful work for all types of clients.
In two decades of design, I have been through a very interesting journey. I've seen a lot, learned a lot, and met some very interesting people.
In here you'll find various photographs, album covers, video work, logo, and website designs. I hope you find some of my work interesting.
If interested in anything that you see on my site and would like for me to work on your next project, please send me an email. That would be... DOPE.
All Art Everything.
Building - Smoke.jpg
Dwele - Candid Alley.jpg
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947474661.10/warc/CC-MAIN-20240226162136-20240226192136-00591.warc.gz
|
CC-MAIN-2024-10
| 665
| 8
|
https://stocksharp.com/store/gdax/
|
code
|
Cryptocurrency exchange GDAX is a division of Coinbase, California. It is possible to create orders for stop orders, limits and market. The exchange provides access to margin trading with a leverage of 1 to 3. The platform's security level is high.
S#.GDAX connector is developed and stands for communication and exchanging data between both GDAX cryptocurrency exchange and S# programs: S#.Data
. It is fully compatible with our S#.API
such as other custom software based on it.
Its features and functionality:
- Connection to GDAX and receiving all the data it needs for the trade such as price, volume, order book, etc.
- Portfolio Status Update
- Get historical data for cryptocurrencies
- Get the status of your order and its execution
- A list of functions provided by API
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679516047.98/warc/CC-MAIN-20231211174901-20231211204901-00373.warc.gz
|
CC-MAIN-2023-50
| 778
| 10
|
http://blog2piazze.blogspot.com/2010/03/litalia-e-mia-un-altro-punto-di-vista.html
|
code
|
I decree today that life
Is simply taking and not giving
England is mine - it owes me a living
But ask me why, and I'll spit in your eye
Oh, ask me why, and I'll spit in your eye
But we cannot cling to the old dreams anymore
No, we cannot cling to those dreams
Does the body rule the mind
Or does the mind rule the body ?
I don´t know....
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676596204.93/warc/CC-MAIN-20180723090751-20180723110751-00563.warc.gz
|
CC-MAIN-2018-30
| 339
| 10
|
https://forums.macrumors.com/threads/hey-the-cheese-is-right-here.366708/
|
code
|
Does anyone find the current cat & mouse game of hackers vs. Apple a bit silly? The hacker side (let's call them the mouse) are running around broadcasting not only exactly how they are getting into 1.1.1 but they are taking the added step of making it very clear how simple it will be for Apple to fix the hole very simply. So all that Apple (the cat) has to do is fix the TIFF Safari exploit - which is pretty much like the cat being able to take a nap while the mouse runs around and starts screaming about where they are and how to catch them when they find a scrap of cheese. Yes, I know that there are smart people on both sides and that ultimately the cheese/catnip ball will go back & forth with each side figuring out the other and 1-upping them for a period of time. But broadcasting the hole and the instructions on how to plug it really seems to take the game out of this, doesn't it? Maybe it's brilliant misdirection on the hackers' part or maybe it's the hackers' way of trying to tweak Apple for leaving such a simple hole there but right about now, it seems like we should all write-off the existence of the TIFF exploit and let the games begin anew with a search for new exploits. And maybe if they are quiet about the "how" it will be something that has a chance to breath before it dies?
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-04/segments/1547583668324.55/warc/CC-MAIN-20190119135934-20190119161934-00137.warc.gz
|
CC-MAIN-2019-04
| 1,307
| 1
|
https://community.aseprite.org/t/app-command-movemask-error-when-wrapping-with-a-value-higher-than-sprite-width/10437/1
|
code
|
For context, I’m using Aseprite v1.3-beta5-x64 from Steam in Windows 10.
Hello! I’m working on an Aseprite script that uses app.command.MoveMask for shifting pixels in a selection and having them wrap around the selection boundary.
However, I found that, if the amount of pixels to shift for (labeled internally as quantity) is higher than the image width, rather than wrap the pixels around, it will instead just “paste” the new image while leaving the rest of the pixels “untouched” (that is, not repeated, not wrapped, but instead completely unaltered). Undoing the action will also break the original image by only restoring the original image partially, and leaving a section completely untouched.
Included below is an image that hopefully explains the bug and its results:
It’s beyond frustrating that a legitimate bug has gone entirely ignored for a month and a half. I understand most “regular users” wouldn’t ever encounter it, but it sucks to be spending my own time as a script developer, trying to expand the features of Aseprite for the rest of the userbase, and then go entirely ignored when reporting a problem with the software that directly affects my contributions to the community, especially when I know as a programmer that such a fix would be quite trivial (I’m absolutely sure this could be fixed in the application with a simple modulo operation). Just disappointing.
Sorry if we didn’t put a high priority to this bug and fix, but generally we focus our time in more general bugs/problems/crashes that are being experienced by larger audiences. Generally scripting API is not the most priority stuff (and the API was still usable as it was, even without this fix).
Whether or not the scripting API should be a priority or not is highly debatable when considering a lot of those “larger audiences” are also using user-created scripts to extend Aseprite all the time. Even my scripts, which I don’t promote in the community for multiple reasons, still get thousands of downloads from users in that “large audience.”
Still though, I’m not here to debate that, because I don’t care anymore, especially after a whole year. I abandoned the add-on I was making a long time ago, because I never heard anything back, not even a courtesy “we will look into it later, thanks” reply. I just wanted to highlight that maybe a whole year to implement a simple fix that could potentially affect “larger audiences”, or at least giving even just one acknowledgement of the issue, is not a good thing, and maybe it should be more of a priority.
In any case, again, I don’t care anymore. I already gave up on this around October of last year.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296945168.36/warc/CC-MAIN-20230323132026-20230323162026-00636.warc.gz
|
CC-MAIN-2023-14
| 2,695
| 9
|
https://courses.cs.washington.edu/courses/cse303/08sp/
|
code
|
Meetings: MWF 2:30-3:20, EE 037
Class discussion list
Class email list archives
Collection dropbox for homework assignments
Homework 0, due Wed. April 2, at the beginning
of class (worth 1 point, but it's an important 1 point!)
Homework 1A, due Monday, April 7 at 2 pm.
Homework 1B, due Friday, April 11 at 9 pm.
Homework 2, due Monday, April 21, at 9 pm. (Problem 1 added on Monday, April 14.)
Homework 3, due Tuesday, April 29, at 9 pm.
Homework 4, due Thursday, May 15, at 9 pm.
Homework 5, due in phases: 0 (partners) Mon. 5/19, 9 pm; 1 (skeleton code) Thur., 5/22, 9 pm; 2 (everything) Thur., 5/29, 9 pm.
Homework 6, due Wednesday, June 4, at 9 pm.
Societal-impact paper, due June 6 at 2 pm. No late assignments will be accepted. example paper
Some old final exams: au07 (solution)
wi07 (solution) sp06 (solution) wi06 (solution) sp05 (solution)
This quarter's final: exam (sample solution)
A selection of old midterms: au07 (solution)
wi07 (solution) sp07 (solution)
sp06 (solution) wi06 (solution) sp05 (solution)
This quarter's midterm: exam (sample solution)
Tentative schedule to be updated as the quarter progresses. Links to slides, sample code, and other files won't work until the associated files are posted shortly after the corresponding lecture.
1. March 31: Course Introduction, Shell Basics
2. Apr 2: Processes, Users, Shell Special Characters, Emacs slides shell history
3. Apr 4: I/O Redirection, Shell Scripts slides scripts shell history
Hint for accessing the scripts: tar -xf lec3scripts.tar (see man tar)
4. Apr 7: Shell Variables, More Shell Scripts slides scripts shell history
5. Apr 9: Regular Expressions (and more), grep, Other Utilities slides shell history
6. Apr 11: sed, command-line-tools wrap-up slides shell history
7. Apr 14: Introduction to C slides
8. Apr 16: C: locals, left vs. right expressions slides short programs from lecture more sample code
9. Apr 18: C: pointers, function calls slides short programs from lecture
10. Apr 21: C: pointers, casts, structs slides More examples: generic_swap.c list.c
11. Apr 23: C: Linked lists, program structure, catch up
12. Apr 25: No class - department event
13. Apr 28: C: preprocessor, scanf/printf slides; summary, function pointers slides
14. Apr 30: Tools: make slides makefile demo
15. May 2: Makefiles, next assignment, midterm topics (as time permits)
X. May 4, 3 pm: informal review Q&A, 5th floor breakout area
X. May 5: Midterm, in class
16. May 7: gdb slides gdb manual; Testing slides
17. May 9: Societal issues - data ownership and privacy slides
18. May 12: Version control slides subversion book; shell history 1 shell history 2
19. May 14: Testing slides; ; Memory management and hw5
20. May 16: Societal implications: diversity slides
21. May 19: Specification slides; C++ slides code cplusplus.com tutorial
22. May 21: C++; memory management idioms slides str code code
23. May 23: Societal implications: code quality and liability slides
X. May 26: No class; Memorial day
24. May 28: C++ (cont)
25. May 30: Linking and libraries slides
26. June 2: Shared-memory concurrency slides
27. June 4: Concurrency (cont.) slides
28. June 6: Some last surveys: Profiling and gprof slides code gprof manual; Code-Pointers and Objects; Course Summary slides files
X. Tuesday, June 10: Final exam, 2:30-4:30 pm.
Instructor: Hal Perkins; perkins(at)cs; CSE 548
TA: Kari Christianson; karibeth(at)cs
TA: Dingding Liu; liudd(at)cs
TA: Pamela Vagata; psv3(at)cs
Office hours in CSE 006 (basement lab)
Monday: Perkins, 4:00-4:30+ (i.e., later if people are still around)
Tuesday: Liu, 3:30-4:30
Wednesday: Vagata, 11:30-12:20
Wednesday: Perkins, 4:30-5:00+
Thursday: Christianson, 3:30-4:30
Friday: Liu, 1:30-2:30
A Quick-And-Dirty Getting-Started Guide
Your ACM Chapter's tutorials
The CSE department's Computing Resources for Undergrads
The Bash Manual
Stanford CS library: Essential C, Unix Programming Tools
Are the texts required?
Linux Pocket Guide by Daniel J. Barrett, O'Reilly, 2004.
C: A Reference Manual (5th Edition) by Samuel P. Harbison, Guy L. Steele. Prentice Hall, 2002.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-21/segments/1620243991812.46/warc/CC-MAIN-20210515004936-20210515034936-00466.warc.gz
|
CC-MAIN-2021-21
| 4,078
| 74
|
http://wordpress.org/support/topic/extremely-rude-and-unhelpful-forum-moderator
|
code
|
We do it for a pretty simple reason: Very rarely do two people actually have 100% the same problem.
WordPress is installed on myriad servers, with a variety of themes and plugins. The number of themes and plugins out there is a bit staggering, and when you've got 20,000+ possible plugins that two users may be using, it's not actually that often that it's 100% the same. Yes, sometimes it is, when everyone who uses a plugin has a problem, but then that's a plugin issue :)
In the case of that thread, we still have no idea if the original poster was using a plugin or not, so while it's likely they're related, we have 6 (you can't see the posts we deleted) people going 'Me to, but I was using a plugin...' and now that poor OP is going to get lost in the shuffle.
Which sucks for him, if he ever comes back at all. :(
And yes we deleted your other posts. We just like it if you make your own topics for problems, it helps us help you better :)
I would make a topic where you actually tell us what plugin you;re using. Maybe that plugin dev would like to know, so they could fix it?
|
s3://commoncrawl/crawl-data/CC-MAIN-2013-20/segments/1368698693943/warc/CC-MAIN-20130516100453-00005-ip-10-60-113-184.ec2.internal.warc.gz
|
CC-MAIN-2013-20
| 1,085
| 6
|
https://www.construct.net/en/tutorials/test-game-lan-preview-doesnt-558
|
code
|
The Simple Answer: By running a development server for your games.
Why? Because there are a few of us who no matter what can't get the Construct 2 LAN preview working with Construct 2 and port number.
I've tried on multiple phones - lol.
So, this simple tutorial's goal is to offer a work-a-round solution that allows us to connect using our network ip only.
I've managed to play my games on my pc/laptops/smart tv/moble devices using this work-a-around.
Sidenote: So cool to sit in the lounge and play your own game on the TV.
Objective: Get a development environment That turns any Windows machine into a development server.
Tools We will be using Xampp
The Step by Step Process:
Step1: Download Xampp
You have a number of OS. I am installing on windows.
Step2: Install it to your desired location
By Default xampp likes to install to C:\xampp\
So go ahead and let it.
Once installed and you hit finish.
It will launch control panel and you can see I only have apache running which is all we need.
To check if it works. Open a browser and Type 127.0.0.1.
You should get this
Cool Its installed and working.
Step3: Now Browse to your xampp directory
1) Add a folder called games
2) Either remove the index.php
3) Edit it like this
Leave the other index file alone (that is the one in the image with chrome icon) It just says "It works"
Step4: Open Construct 2.
Press File, then prefrences and check your network ip
mine is 10.0.0.6
Type it into your browser if you want to test it.
It should give you either...
1) "It Works" (this is if you deleted the index.php [Step 3: Option2])
2) Open your network ip 10.0.0.6/games/
3) You get browser error (this is not good and beyond the scope of this tutorial as it means you are not on your network, or connecting to your network correctly because of firewalls etc
Checkout Ashleys Post
Step5: So to preview your game(s)
Export your game to your games folder.
Using the html export button.
So the destination will be your xampp/htdocs/games/
Step6: complete url with games and hit enter
Now you can use any device connected on your network to browse to your game using your network ip range.
Example Smartphone and Ashleys Flippen' Flappin' Birds
Hope this helps all those who can't preview their games using the construct 2 built in lan preview.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710771.39/warc/CC-MAIN-20221130192708-20221130222708-00611.warc.gz
|
CC-MAIN-2022-49
| 2,291
| 41
|
https://www.cfd-online.com/Forums/fluent/33156-urgent-random-number-udf-print.html
|
code
|
Urgent: Random number in UDF
Can anyone tell me which function to use to generate uniform random numbers in (0~1) or Gaussian random numbers in Fluent UDF?
Re: Urgent: Random number in UDF
Hi, Your UDF is programmed in C, so that I think you can only use C language to generate random numbers.
The function rand() is defined in sdtlib.h.
Have a look to the following links:
|All times are GMT -4. The time now is 05:06.|
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-04/segments/1484560279650.31/warc/CC-MAIN-20170116095119-00173-ip-10-171-10-70.ec2.internal.warc.gz
|
CC-MAIN-2017-04
| 420
| 7
|
http://cloudcomputing.sys-con.com/node/2756296
|
code
|
|By Greg Schulz||
|August 12, 2013 07:44 AM EDT||
Viking SATADIMM: Nand flash SATA SSD in DDR3 DIMM slot?
By Greg Schulz
Today computer and data storage memory vendor Viking announced that SSD vendor Solidfire has deployed their SATADIMM modules in DDR3 DIMM (e.g. Random Access Memory (RAM) main memory) slots of their SF SSD based storage solution.
Solidfire SD solution with SATADIMM via Viking
Nand flash SATA SSD in a DDR3 DIMM slot?
Per Viking, Solidfire uses the SATADIMM as boot devices and cache to complement the normal SSD drives used in their SF SSD storage grid or cluster. For those not familiar, Solidfire SF storage systems or appliances are based on industry standard servers that are populated with SSD devices which in turn are interconnected with other nodes (servers) to create a grid or cluster of SSD performance and space capacity. Thus as nodes are added, more performance, availability and capacity are also increased all of which are accessed via iSCSI. Learn more about Solidfire SD solutions on their website here.
Here is the press release that Viking put out today:
Viking Technology SATADIMM Increases SSD Capacity in SolidFire’s Storage System (Press Release)
Viking Technology’s SATADIMM enables higher total SSD capacity for SolidFire systems, offering cloud infrastructure providers an optimized and more powerful solution
FOOTHILL RANCH, Calif., August 12, 2013 – Viking Technology, an industry leading supplier of Solid State Drives (SSDs), Non-Volatile Dual In-line Memory Module (NVDIMMs), and DRAM, today announced that SolidFire has selected its SATADIMM SSD as both the cache SSD and boot volume SSD for their storage nodes. Viking Technology’s SATADIMM SSD enables SolidFire to offer enhanced products by increasing both the number and the total capacity of SSDs in their solution.
“The Viking SATADIMM gives us an additional SSD within the chassis allowing us to dedicate more drives towards storage capacity, while storing boot and metadata information securely inside the system,” says Adam Carter, Director of Product Management at SolidFire. “Viking’s SATADIMM technology is unique in the market and an important part of our hardware design.”
SATADIMM is an enterprise-class SSD in a Dual In-line Memory Module (DIMM) form factor that resides within any empty DDR3 DIMM socket. The drive enables SSD caching and boot capabilities without using a hard disk drive bay. The integration of Viking Technology’s SATADIMM not only boosts overall system performance but allows SolidFire to minimize potential human errors associated with data center management, such as accidentally removing a boot or cache drive when replacing an adjacent failed drive.
"We are excited to support SolidFire with an optimal solid state solution that delivers increased value to their customers compared to traditional SSDs," says Adrian Proctor, VP of Marketing, Viking Technology. "SATADIMM is a solid state drive that takes advantage of existing empty DDR3 sockets and provides a valuable increase in both performance and capacity.”
SATADIMM is a 6Gb SATA SSD with capacities up to 512GB. A next generation SAS solution with capacities of 1TB & 2TB will be available early in 2014. For more information, visit our website www.vikingtechnology.com or email us at [email protected].
About Viking Technology Viking Technology is recognized as a leader in NVDIMM technology. Supporting a broad range of memory solutions that bridge DRAM and SSD, Viking delivers solutions to OEMs in the enterprise, high-performance computing, industrial and the telecommunications markets. Viking Technology is a division of Sanmina Corporation (Nasdaq: SANM), a leading Electronics Manufacturing Services (EMS) provider. More information is available at www.vikingtechnology.com.
About SolidFire SolidFire is the market leader in high-performance data storage systems designed for large-scale public and private cloud infrastructure. Leveraging an all-flash scale-out architecture with patented volume-level quality of service (QoS) control, providers can now guarantee storage performance to thousands of applications within a shared infrastructure. In-line data reduction techniques along with system-wide automation are fueling new block-storage services and advancing the way the world uses the cloud.
What's inside the press release
On the surface this might cause some to jump to the conclusion that the nand flash SSD is being accessed via the fast memory bus normally used for DRAM (e.g. main memory) of a server or storage system controller. For some this might even cause a jump to conclusion that Viking has figured out a way to use nand flash for reads and writes not only via a DDR3 DIMM memory location, as well as doing so with the Serial ATA (SATA) protocol enabling server boot and use by any operating system or hypervisors (e.g. VMware vSphere or ESXi, Microsoft Hyper-V, Xen or KVM among others).
Note for those not familar or needing a refresh on DRAM, DIMM and related items, here is an excerpt from Chapter 7 (Servers - Physical, Virtual and Software) from my book "The Green and Virtual Data Center" (CRC Press).
Computers rely on some form of memory ranging from internal registers, local on-board processor Level 1 (L1) and Level 2 (L2) caches, random accessible memory (RAM), non-volatile RAM (NVRAM) or Flash along with external disk storage. Memory, which includes external disk storage, is used for storing operating system software along with associated tools or utilities, application programs and data. Read more of the excerpt here...
Is SATADIMM memory bus nand flash SSD storage?
In short no.
Some vendors or their surrogates might be tempted to spin such a story by masking some details to allow your imagination to run wild a bit. When I saw the press release announcement I reached out to Tinh Ngo (Director Marketing Communications) over at Viking with some questions. I was expecting the usual marketing spin story, dancing around the questions with long answers or simply not responding with anything of substance (or that requires some substance to believe). Again what I found was the opposite and thus want to share with you some of the types of questions and answers.
So what actually is SATADIMM? See for yourself in the following image (click on it to view or Viking site).
Does SATADIMM actually move data via DDR3 and memory bus? No, SATADIMM only draws power from it (yes nand flash does need power when in use contrary to a myth I was told about).
Wait, then how is data moved and how does it get to and through the SATA IO stack (hardware and software)?
Simple, there is a cable connector that attached to the SATADIMM that in turn attached to an internal SATA port. Or using a different connector cable attach the SATADIMM (up to four) to a standard SAS internal port such as on a main board, HBA, RAID or caching adapter.
Does that mean that Viking and who ever uses SATADIMM is not actually moving data or implementing SATA via the memory bus and DDR3 DIMM sockets? That would be correct, data movement occurs via cable connection to standard SATA or SAS ports.
Wait, why would I give up a DDR3 DIMM socket in my server that could be used for more DRAM? Great question and one that should be it depends on if you need more DRAM or more nand flash? If you are out of drive slots or PCIe card slots and have enough DRAM for your needs along with available DDR3 slots, you can stuff more nand flash into those locations assuming you have SAS or SATA connectivity.
SATADIMM with SATA connector top right via Viking
SATADIMM SATA connector via Viking
SATADIMM SAS (Internal) connector via Viking
Why not just use the onboard USB ports and plug-in some high-capacity USB thumb drives to cut cost? If that is your primary objective it would probably work and I can also think of some other ways to cut cost. However those are also probably not the primary tenants that people looking to deploy something like SATADIMM would be looking for.
What are the storage capacities that can be placed on the SATADIMM? They are available in different sizes up to 400GB for SLC and 480GB for MLC. Viking indicated that there are larger capacities and faster 12Gb SAS interfaces in the works which would be more of a surprise if there were not. Learn more about current product specifications here.
Good questions. Attached are three images that sort of illustrates the connector. As well, why not a USB drive; well, there are customers that put 12 of these in the system (with up to 480GB usable capacity) that equates to roughly an added 5.7TBs inside the box without touching the drive bays (left for mass HDD's). You will then need to raid/connect) all the SATADIMM via a HBA.
How fast is the SATADIMM and does putting it into a DDR3 slot speed things up or slow them down? Viking has some basic performance information on their site (here). However generally should be the same or similar to reach a SAS or SATA SSD drive, although keep SSD metrics and performance in the proper context. Also keep in mind that the DDR3 DIMM slot is only being used for power and not real data movement.
Is the SATADIMM using 3Gbs or 6Gbs SATA? Good questions, today is 6Gb SATA (remember that SATA can attach to a SAS port however not vise versa). Lets see if Viking responds in the comments with more including RAID support (hardware or software) along with other insight such as UNMAP, TRIM, Advanced Format (AF) 4KByte blocks among other things.
Have I actually tried SATADIMM yet? No, not yet. However would like to give it a test drive and workout if one were to show up on my doorstep along with disclosure and share the results if applicable.
Future of nand flash in DRAM DIMM sockets
Keep in mind that someday nand flash will actually seem not only in a Webex or Powerpoint demo preso (e.g. similar to what Diablo Technology is previewing), as well as in real use for example what Micron earlier this year predicted for flash on DDR4 (more DDR3 vs. DDR4 here).
Is SATADIMM the best nand flash SSD approach for every solution or environment? No, however it does give some interesting options for those who are PCIe card, or HDD and SSD drive slot constrained that also have available DDR3 DIMM sockets. As to price, check with Viking, wish I could say tell them Greg from StorageIO sent you for a good value, however not sure what they would say or do.
Related more reading:
How much storage performance do you want vs. need?
Can RAID extend the life of nand flash SSD?
Can we get a side of context with them IOPS and other storage metrics?
SSD & Real Estate: Location, Location, Location
What is the best kind of IO? The one you do not have to do
SSD, flash and DRAM, DejaVu or something new?
Ok, nuff said (for now).
All clouds are not equal. To succeed in a DevOps context, organizations should plan to develop/deploy apps across a choice of on-premise and public clouds simultaneously depending on the business needs. This is where the concept of the Lean Cloud comes in - resting on the idea that you often need to relocate your app modules over their life cycles for both innovation and operational efficiency in the cloud. In his session at @DevOpsSummit at19th Cloud Expo, Valentin (Val) Bercovici, CTO of So...
Sep. 29, 2016 06:00 PM EDT Reads: 1,525
SYS-CON Events announced today that Commvault, a global leader in enterprise data protection and information management, has been named “Bronze Sponsor” of SYS-CON's 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. Commvault is a leading provider of data protection and information management solutions, helping companies worldwide activate their data to drive more value and business insight and to transform moder...
Sep. 29, 2016 05:15 PM EDT Reads: 2,842
SYS-CON Events announced today that eCube Systems, a leading provider of middleware modernization, integration, and management solutions, will exhibit at @DevOpsSummit at 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. eCube Systems offers a family of middleware evolution products and services that maximize return on technology investment by leveraging existing technical equity to meet evolving business needs. ...
Sep. 29, 2016 05:15 PM EDT Reads: 1,557
Personalization has long been the holy grail of marketing. Simply stated, communicate the most relevant offer to the right person and you will increase sales. To achieve this, you must understand the individual. Consequently, digital marketers developed many ways to gather and leverage customer information to deliver targeted experiences. In his session at @ThingsExpo, Lou Casal, Founder and Principal Consultant at Practicala, discussed how the Internet of Things (IoT) has accelerated our abil...
Sep. 29, 2016 04:45 PM EDT Reads: 2,767
SYS-CON Events has announced today that Roger Strukhoff has been named conference chair of Cloud Expo and @ThingsExpo 2016 Silicon Valley. The 19th Cloud Expo and 6th @ThingsExpo will take place on November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. "The Internet of Things brings trillions of dollars of opportunity to developers and enterprise IT, no matter how you measure it," stated Roger Strukhoff. "More importantly, it leverages the power of devices and the Interne...
Sep. 29, 2016 04:45 PM EDT Reads: 3,415
Whether they’re located in a public, private, or hybrid cloud environment, cloud technologies are constantly evolving. While the innovation is exciting, the end mission of delivering business value and rapidly producing incremental product features is paramount. In his session at @DevOpsSummit at 19th Cloud Expo, Kiran Chitturi, CTO Architect at Sungard AS, will discuss DevOps culture, its evolution of frameworks and technologies, and how it is achieving maturity. He will also cover various st...
Sep. 29, 2016 04:30 PM EDT Reads: 1,941
Digital innovation is the next big wave of business transformation based on digital technologies of which IoT and Big Data are key components, For example: Business boundary innovation is a challenge to excavate third-party business value using IoT and BigData, like Nest Business structure innovation may propose re-building business structure from scratch, as Uber does in the taxicab industry The social model innovation is also a big challenge to the new social architecture with the design fr...
Sep. 29, 2016 04:30 PM EDT Reads: 1,336
So, you bought into the current machine learning craze and went on to collect millions/billions of records from this promising new data source. Now, what do you do with them? Too often, the abundance of data quickly turns into an abundance of problems. How do you extract that "magic essence" from your data without falling into the common pitfalls? In her session at @ThingsExpo, Natalia Ponomareva, Software Engineer at Google, provided tips on how to be successful in large scale machine learning...
Sep. 29, 2016 04:00 PM EDT Reads: 2,370
[session] Understanding the Inscrutable Chinese Internet By @CDSGlobalCloud | @CloudExpo #API #Cloud
If you had a chance to enter on the ground level of the largest e-commerce market in the world – would you? China is the world’s most populated country with the second largest economy and the world’s fastest growing market. It is estimated that by 2018 the Chinese market will be reaching over $30 billion in gaming revenue alone. Admittedly for a foreign company, doing business in China can be challenging. Often changing laws, administrative regulations and the often inscrutable Chinese Interne...
Sep. 29, 2016 04:00 PM EDT Reads: 459
Why do your mobile transformations need to happen today? Mobile is the strategy that enterprise transformation centers on to drive customer engagement. In his general session at @ThingsExpo, Roger Woods, Director, Mobile Product & Strategy – Adobe Marketing Cloud, covered key IoT and mobile trends that are forcing mobile transformation, key components of a solid mobile strategy and explored how brands are effectively driving mobile change throughout the enterprise.
Sep. 29, 2016 03:45 PM EDT Reads: 2,182
In his session at @ThingsExpo, Kausik Sridharabalan, founder and CTO of Pulzze Systems, Inc., will focus on key challenges in building an Internet of Things solution infrastructure. He will shed light on efficient ways of defining interactions within IoT solutions, leading to cost and time reduction. He will also introduce ways to handle data and how one can develop IoT solutions that are lean, flexible and configurable, thus making IoT infrastructure agile and scalable.
Sep. 29, 2016 03:30 PM EDT Reads: 1,616
Creating replica copies to tolerate a certain number of failures is easy, but very expensive at cloud-scale. Conventional RAID has lower overhead, but it is limited in the number of failures it can tolerate. And the management is like herding cats (overseeing capacity, rebuilds, migrations, and degraded performance). Download Slide Deck: ▸ Here In his general session at 18th Cloud Expo, Scott Cleland, Senior Director of Product Marketing for the HGST Cloud Infrastructure Business Unit, discusse...
Sep. 29, 2016 03:30 PM EDT Reads: 2,527
Data is an unusual currency; it is not restricted by the same transactional limitations as money or people. In fact, the more that you leverage your data across multiple business use cases, the more valuable it becomes to the organization. And the same can be said about the organization’s analytics. In his session at 19th Cloud Expo, Bill Schmarzo, CTO for the Big Data Practice at EMC, will introduce a methodology for capturing, enriching and sharing data (and analytics) across the organizati...
Sep. 29, 2016 03:15 PM EDT Reads: 1,779
SYS-CON Events announced today that Bsquare has been named “Silver Sponsor” of SYS-CON's @ThingsExpo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. For more than two decades, Bsquare has helped its customers extract business value from a broad array of physical assets by making them intelligent, connecting them, and using the data they generate to optimize business processes.
Sep. 29, 2016 03:00 PM EDT Reads: 2,964
Internet of @ThingsExpo has announced today that Chris Matthieu has been named tech chair of Internet of @ThingsExpo 2016 Silicon Valley. The 6thInternet of @ThingsExpo will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA.
Sep. 29, 2016 03:00 PM EDT Reads: 2,782
A strange thing is happening along the way to the Internet of Things, namely far too many devices to work with and manage. It has become clear that we'll need much higher efficiency user experiences that can allow us to more easily and scalably work with the thousands of devices that will soon be in each of our lives. Enter the conversational interface revolution, combining bots we can literally talk with, gesture to, and even direct with our thoughts, with embedded artificial intelligence, wh...
Sep. 29, 2016 02:00 PM EDT Reads: 3,942
In his keynote at 18th Cloud Expo, Andrew Keys, Co-Founder of ConsenSys Enterprise, provided an overview of the evolution of the Internet and the Database and the future of their combination – the Blockchain. Andrew Keys is Co-Founder of ConsenSys Enterprise. He comes to ConsenSys Enterprise with capital markets, technology and entrepreneurial experience. Previously, he worked for UBS investment bank in equities analysis. Later, he was responsible for the creation and distribution of life sett...
Sep. 29, 2016 02:00 PM EDT Reads: 3,616
Cloud computing is being adopted in one form or another by 94% of enterprises today. Tens of billions of new devices are being connected to The Internet of Things. And Big Data is driving this bus. An exponential increase is expected in the amount of information being processed, managed, analyzed, and acted upon by enterprise IT. This amazing is not part of some distant future - it is happening today. One report shows a 650% increase in enterprise data by 2020. Other estimates are even higher....
Sep. 29, 2016 02:00 PM EDT Reads: 4,184
SYS-CON Events announced today that SoftLayer, an IBM Company, has been named “Gold Sponsor” of SYS-CON's 18th Cloud Expo, which will take place on June 7-9, 2016, at the Javits Center in New York, New York. SoftLayer, an IBM Company, provides cloud infrastructure as a service from a growing number of data centers and network points of presence around the world. SoftLayer’s customers range from Web startups to global enterprises.
Sep. 29, 2016 01:45 PM EDT Reads: 1,121
Most of us already know that adopting new cloud applications can boost a business’s productivity by enabling organizations to be more agile and ready to change course in our fast-moving and connected digital world. But the rapid adoption of cloud apps and services also brings with it profound security threats, including visibility and control challenges that aren’t present in traditional on-premises environments. At the same time, the cloud – because of its interconnected, flexible and adaptable...
Sep. 29, 2016 01:45 PM EDT Reads: 1,791
|
s3://commoncrawl/crawl-data/CC-MAIN-2016-40/segments/1474738661953.95/warc/CC-MAIN-20160924173741-00220-ip-10-143-35-109.ec2.internal.warc.gz
|
CC-MAIN-2016-40
| 21,336
| 92
|
https://pdfbox.apache.org/1.8/dependencies.html
|
code
|
PDFBox consists of three related components and depends on a few external libraries. This page describes what these libraries are and how to include them in your application.
These components are needed during runtime, development and testing dependent on the details below.
The three PDFBox components are named
jempbox. The Maven groupId of all PDFBox components is org.apache.pdfbox.
The main PDFBox component, pdfbox, has a hard dependency on the commons-logging library. Commons Logging is a generic wrapper around different logging frameworks, so you'll either need to also use a logging library like log4j or let commons-logging fall back to the standard java.util.logging API included in the Java platform.
For PDFBox Preflight only commons-io 1.4 is needed.
For font handling the fontbox component is needed.
To support XMP metadata the jembox component is needed.
To add the pdfbox, fontbox, jempbox and commons-logging jars to your application, the easiest thing is to declare the Maven dependency shown below. This gives you the main pdfbox library directly and the other required jars as transitive dependencies.
Set the version field to the latest stable PDFBox version.
Some features in PDFBox depend on optional external libraries. You can enable these features simply by including the required libraries in the classpath of your application.
To support JBIG2 and writing TIFF images additional libraries are needed.
The image plugins described below are not part of the PDFBox distribution because of incompatible licensing terms. Please make sure to check if the licensing terms are compatible to your usage.
For JBIG2 support a Java ImageIO Plugin such as the Levigo Plugin or JBIG2-Image-Decoder will be needed.
To write TIFF images a JAI ImageIO Core library will be needed.
The most notable such optional feature is support for PDF encryption. Instead of implementing its own encryption algorithms, PDFBox uses libraries from the Legion of the Bouncy Castle. Both the bcprov and bcmail libraries are needed and can be included using the Maven dependencies shown below.
Another important optional feature is support for bidirectional languages like Arabic. PDFBox uses the ICU4J library from the International Components for Unicode (ICU) project to support such languages in PDF documents. To add the ICU4J jar to your project, use the following Maven dependency.
PDFBox also contains extra support for use with the Lucene and Ant projects. Since in these cases PDFBox is just an add-on feature to these projects, you should first set up your application to use Lucene or Ant and then add PDFBox support as described on this page.
The above instructions expect that you're using Maven or another build tool like Ivy that supports Maven dependencies. If you instead use tools like Ant where you need to explicitly include all the required library jars in your application, you'll need to do something different.
The easiest approach is to run
mvn dependency:copy-dependencies inside the pdfbox directory of the latest PDFBox source release. This will copy all the required and optional
libraries discussed above into the pdfbox/target/dependencies directory. You can then simply copy all the libraries you need from this directory to your application.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-23/segments/1685224657169.98/warc/CC-MAIN-20230610095459-20230610125459-00022.warc.gz
|
CC-MAIN-2023-23
| 3,272
| 22
|
http://meta4worlds.blogspot.com/2008/02/vista-joining-chorus.html
|
code
|
I've tried Linux, and liked it, but on my new laptop, I just had to go with the system the store(and HP) had installed, Windows Vista, as well as on my desktop PC that is running XP. As usual, there has been an adjustment period, but I'm not being quick to make judgement, Vista sucks.
For my part, I actually had good luck with XP. It runs nicely on my old desktop and has handled every upgrade and install I threw at it nicely, too nicely, because elsewhere things aren't quite as smooth. On my laptop, Vista is a nightmare, beyond what I can accept as normal adjustment to a "new" operating system. This thing has the bugs of a BETA, at full price, and nobody supports it. WTF???
First off, there is the handling of periphery devices like my camcorder and MP3 players. My not that old Sony Handycam won't interface with Vista, after a bit of digging on the Sony support site, I find that the USB interface no longer works and I will have to purchase a different cable. BS. Hey MS, ever hear of backwards compatibility?
And the MP3 player, one a Sansa that was flaky before, but now can't even be recognized, no matter how many updated drivers I download. They don't make the damn thing work, but they sure leave tracks all over my new HD. Sansa's player is nice, and the right price, but the support stinks. Sansa e250, on XP, it only works with Windows Media Player 9. Aside from being a massive pain in the ass to maintain, I like the thing, but my laptop and Vista hate it.
So I bought another MP3 Player, Creative Labs, no, I don't want to pony up the extra money for an Ipod and let Apple worm it's way into my life. Well, Creative Labs has a better driver system, with it's own managers and lots of extra footprints on my desktop to wipe off. But it works. Because I liked the interface best with Windows Media Player, I use it on the laptop too, but there I have Windows Media Player 11, not an upgrade for the same reasons Vista is not. It just looks different, doesn't work better.
The Vista Explorer views and options are fancied up but depowered, and navigation is needlessly complicated.
And, nobody supports this. Instant Rails for Ruby runs headlong into a wall when using this as does Open Laszlo and every other application I want to work on. Thats why i am writing instead of working with new applications.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676594954.59/warc/CC-MAIN-20180723051723-20180723071723-00145.warc.gz
|
CC-MAIN-2018-30
| 2,326
| 7
|
http://www.todayweb60.com/write-your-own-tcpip/
|
code
|
TCP/IP takes into consideration anybody to compose a convention on top of it since it decouples the exchange of the information from the semantics of the information itself, i.e. TCP/IP does not mind what information is being exchanged.
I am not mindful of any such assets, and would be astonished if there existed any assets that reveal to you how to compose a convention. I say this on the grounds that a convention can essentially do anything, and all things considered there are no guidelines to characterizing one. It's what you characterize as tenets that makes a convention. Also, what you characterize ought to be represented by what you need your application to do.
In the realm of systems administration, there are 2 essential elements that speak with each other: the Server and the Client, and both ought to know your convention. Regularly a Client is the initiator of the TCP association. The Server sits latently tuning in on a TCP port for associations from Clients. Once the TCP association has been set up, the customer and the server can start talking your convention.
To utilize your own thought that you need an iOS application that discussions your convention, well you'll require 2 renditions of the application, one that acts as a server and the other that carries on as the customer. At that point you have to characterize what ought to the convention do. For effortlessness, lets simply say that when a customer application associates with the server application, the server application reacts with a "Welcome" and disengages the TCP association. This is an inconsequential case however it IS a convention.
The upsides of utilizing your own convention depend particularly on the unique situation. Regularly you would characterize a convention when you understand that the current conventions don't fill the need you require, or maybe when a current convention has a ton of components that you needn't bother with.
For instance, routers normally connect with 192.168.1.1, but that could be rewire to 192.168.0.1, also Video Streaming regularly utilizes UDP rather than TCP since TCP has highlights like parcel re-transmission if there should be an occurrence of a bundle misfortune. For spilling applications this is a needless excess. You need the video information to be conveyed as and when it is accessible to the application on top of the vehicle layer and the way that a parcel is lost has little impact in gushing. Be that as it may, TCP additionally a component of parcel affirmations, which UDP does not give.
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-51/segments/1575540586560.45/warc/CC-MAIN-20191214094407-20191214122407-00051.warc.gz
|
CC-MAIN-2019-51
| 2,541
| 6
|
https://reshade.me/forum/suggestions/4756-opacity-option-for-shaders
|
code
|
Opacity option for shaders
- Topic Author
Like using a effect that blurs but has an effect of 75%.
Is it possible to add this to Reshade so you can control each effects opacity? 1-100%.
- Topic Author
Ah okay, I understand
crosire wrote: This has to be done in the shader code. Some effects already have such options. But it is not something ReShade can do globally.
So, There's actually a way to get this effect. Funny thing is that I had this idea just cause of this topic, but I then totally forgot about it.
Anyway, here's the solution.
Duran.te wrote: Tweak: Reducing every shaders intensity / opacity
Some Shaders allows you to edit their Intensity by playing with their settings, some others don't.
Though there's not an official way to "reduce shaders opacity" through ReShade interface, I managed to achieve this by making some tweaks.
Basically we'll use a mask for a specific shaders and we'll make it cover the entire screen.
First of all you'll need the effect UIMask to be present in your Shaders Folder ( Game Directory > reshade-shaders > Shaders ), so check this Shader during ReShade installation.
UIMask shader comes with a sample texture called UIMask.png, located in the Texture Folder ( Game Directory > reshade-shaders > Textures ). Open this one with an image editor software and fill it completely with Black ( or download a full black image from google and rename it UIMask.png, after all it's the result that counts ).
Once all's set, launch your game, open ReShade interface and drag your interested Shader between UIMask_Top and UIMask_Bottom. In this way it will limit its effectiveness just to that specific shader (watch the image below to see the load order).
To increase or decrease the opacity, just move the slider "Mask Intensity" as you want.
Decreasing Godrays Opacity level
source: Easy Troubleshooting
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764499819.32/warc/CC-MAIN-20230130133622-20230130163622-00380.warc.gz
|
CC-MAIN-2023-06
| 1,842
| 19
|
http://www.advogato.org/person/simosx/diary.html?start=5
|
code
|
Learning from BSA (Asia)
Quite often you see people supporting a view and makes you wonder how
they can do it with a straight face.
Mark MacGann from EICTA issued a press release expressing his dissapointment that the legislation on software patents did not pass during a European Union Agricultural(sic)
Council meeting on December 21, 2004.
Lenz has a diary entry on his blog questioning the EICTA reaction and motivation.
At another part of the world, BSA (Asia) and GOH Seow Hiong have been quite active against
open-source software since his appointment of the latter as Director of Software Policy in Asia (BSA).
BSA is the company that normally uses questionable
methods to identify and collect license fees for pirated software belonging to
the set of companies it is funded by. It is quite confusing to understand their role by visiting their Website, as you will read things like "Promoting a safe and legal digital world", "BSA educates consumers on software management and copyright protection, cyber security, trade, e-commerce and other Internet-related issues."
To state the obvious, not following the license of the software you are
using is illegal; that's the same for products based on either proprietary or open-source software. However, you should choose products based on open-source software as it offers you a safer legal digital world.
BSA (Asia) has surpassed the role of just doing the essential money collection job
for the companies it represents and now attacks open-source software
efforts in South-East Asia.
BSA (Asia) and GOH Seow Hiong use misleadingly (page 23) the term commercial software to describe proprietary source code. One can have commercial software products based on proprietary software but also commercial software products based on open-source software. A third option is that one also has the freedom to be self-sufficient by choosing directly open-source software.
The open-source policy in Malaysia says [GoogleCache] that "in situations where advantages and disadvantages of OSS and proprietary software are equal, preference shall be given to OSS". It looks quite modest to me, as the preference clause is invoked only in the extreme case of equality of advantages and disadvantages between the two. However, BSA (Asia) and GOH Seow Hiong issue a polemic [GoogleCache] against "OSS procurement preference".
BSA (Asia) and GOH Seow Hiong maintain that "any preference for any model of software, open source or proprietary, could disturb the balance in the industry". The current balance in the industry is that proprietary software is used almost exclusively in any aspect of the industry. My idea of a balance is something towards 50-50.
BSA (Asia) and GOH Seow Hiong are unhappy with the work that IOSN is doing in South-East Asia on advocating about open-source software to developing countries. IOSN has been producing a set of Primers to help developing countries on open-source software. BSA sent a letter showing their discomfort. Perhaps the BSA line does not work well in South-East Asia anymore? In this letter, they include editorial comments for some of the primers although the public feedback period has already passed on each of them.
In addition, on the subject of security, BSA (Asia) tries to add that proprietary vendors offer "source code sharing initiatives", probably as a plug to the Shared Source program by Microsoft. It is quite interesting to see that what you get with Shared Source is not even close to being enough to conduct a security review. Once you sign up to the special Government Security Program, you only get to view and search the source code through your Web browser. The Windows XP source code consists of around 40 million lines of code. Assume this gets printed to 60 lines per page, binded to one thousand page volumes, and you get in total around 666 huge volumes. If this was a story book, you might be able to follow the first few volumes. However, it's not a linear story; it's source code, interconnected in a complex mesh structure. With open-source, you get the full source code files, you are able to compile, run visualisation and analysis tools, debug, test, verify, compare. With Shared-source, you can only peak through your Web browser; no chance to analyse, compile, run visualisation tools, test, verify... Initiatives such as "Shared Source" are a gimmick.
Furthermore, BSA cannot see why teaching proprietary tools/software quite often results to piracy, as each student is unable to pay for the license. BSA says that since a student buys the hardware, they should be able financially to shell out money for any expensive proprietary software, for their homework and assignments.
Finally, BSA appears to firmly believe that software patents are good for developing countries (the primary audience of IOSN is developing countries).
In another article, BSA (Asia) and GOH Seow Hiong claim that software patents not bad. In particular, "software patents do not necessarily benefit bigger players" (perhaps in the same way that BSA wants primarily to educate consumers). Also, "software patents benefit start-ups or small companies more because it encourages innovation". Does this make sense? Is this the education the developing countries of Asia should receive?
You should voice your concerns on all these.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917122992.88/warc/CC-MAIN-20170423031202-00434-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 5,324
| 25
|
https://fancyrednecks.com/tasmania/mlab-mongodb-inserting-previous-document-automatically.php
|
code
|
MongoDB Part 6 - scalegrid.io
VC Mobile Case Study mLab Cloud MongoDB Hosting. Embedding arrays in documents is a great example of this. mongodb's versatile array previous в†ђ how to use mongodb on redhat openshift mlab cloud mongodb, assumes you have previously created a mlab mongodb account copy code into file nodejsmongodbtest.js. it is created automatically when we insert. */.
Using MongoDB in Python using pymongo – Sahil Sehwag
MongoDB vs Cassandra vs Couchbase 2018 Comparison of. Getting started with mongodb and mongoose. you run an insert command into a collection named mongodb acquires mlab вђ” what are the different mongodb, ... why does a document-oriented database like mongodb provide a file layer в†ђ previous 1 mongodb acquires mlab вђ” what are the different mongodb.
22/02/2018в в· we were inserting several gbs a day to date version for you automatically. along with this, mongodb atlas provides using mlab (formerly mongolab i am trying to import a json file to my mongoldb in heroku by using the 'add document' button. when i only insert one object, everything is working accordingly.
Connect, save and find data in mongodb with nodejs and expressjs. in this article i'll tell you about how to connect, save and find data in mongodb using nodejs with if you have followed the previous article, let's write some documents to our primary. how to find word in string in mlab and mongodb
If you have followed the previous article, let's write some documents to our primary. how to find word in string in mlab and mongodb 10/05/2017в в· using mongodb in python using pymongo. localhost and default port for mongodb is 27017. since i am using mlab host name and insert _one() and
Node js, mongodb, mongoose, npm, node js and mongodb, mongodb with mongoose, easy way to insert data into mongodb mongo_client вђ“ tools for connecting to mongodb pymongo automatically uses mongodb-cr when connected to a pre-3.0 full_document='default', resume
The next step is to insert data and do some processing on the records using the mongodb command line. inserting a document to automatically verify the tip on how to set ids for collections when inserting new document --- why? you so compared to your previous item 5) create a mlab mongodb with
Using MongoDB on Node JS Application Using Mongoose
GitHub gamontal/mongolab-data-api A NodeJS wrapper for. Mongodb is an open-source, document-oriented database. here is a tutorial on using mongodb for storing and retrieving data for how can i insert the data in mlab, i use a hosted mongodb instance on mlab for this to ensure we catch errors in inserting a document to mongodb. returned data from previous promise.
Using MongoDB on Node JS Application Using Mongoose. 12/02/2016в в· how to connect to mongodb at mongolab with uri using simple use mlab for mongodb вђ” create database, collections, documents, and users - duration, mongodb bulk insert, mongodb insertmany, mongodb insert document, mongodb bulk insert java note that the id is automatically generated by mongodb for the car.
VC Mobile Case Study mLab Cloud MongoDB Hosting
Add a json document with mlab (mongodb in heroku) with. Connect, save and find data in mongodb with nodejs and expressjs. in this article i'll tell you about how to connect, save and find data in mongodb using nodejs with Accessing the mongodb oplog. a special capped collection that keeps a rolling record of all insert, mlab oplog database users are automatically granted the.
Mlab's mongodb solution provided freshub with an easy transition from mysql: data replicates automatically across multiple it wanted to use a document items inside collections are called documents. front-end code вђ” it just happened automatically. insert a few more tasks the mongodb collection and sets
Mlab is the leading database-as-a-service for mongodb, powering over half a million deployments worldwide. trusted by companies such as lyft, facebook, and whole foods. building a simple crud application with express and mongodb. the server automatically whenever you save a file that the on cloud services like mlab
They had worked on previous projects the team had experience using node.js and determined that it wanted a document database. mongodb stood mlab's service is i am trying to update my collections in my mongodb instance hosted on mlab on mlab the document goes mongodb.driver.protocol.insert - inserting 20
Items inside collections are called documents. front-end code вђ” it just happened automatically. insert a few more tasks the mongodb collection and sets mongodb & mlabintroduction mongodb is a cross-platform document-oriented database. as of july 2015. and is published as free and open-sour...
Mongo_client вђ“ tools for connecting to mongodb pymongo automatically uses mongodb-cr when connected to a pre-3.0 full_document='default', resume insert the document from the official mlab data api documentation: mlab use this method only if you cannot connect using a mongodb driver. visit mlab's
Tip on how to set ids for collections when inserting new document --- why? you so compared to your previous item 5) create a mlab mongodb with databases, part 1. one of the most difficult parts of teaching people how to build things with meteor is figuring out when to introduce certain ideas.
Tutorial: scaling meteor with mongodb oplog tailing. the app will also have an input form for inserting new players and scores to show real mlab cloud mongodb 16/11/2017в в· create database mlab for mongodb a suggested video will automatically play next. modeling data for nosql document databases - duration:
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-40/segments/1600400193087.0/warc/CC-MAIN-20200920000137-20200920030137-00744.warc.gz
|
CC-MAIN-2020-40
| 5,655
| 21
|
https://www.sensorysite.com/product/makeblock-ultimate-2-0-curriculum-kit/
|
code
|
Ultimate 2.0 has an impressive parts library; boasting more than 550 mechanical and electronic items, it provides a comprehensive range of features and includes everything you need for realizing your ideas. To give you a head start and allow you to learn the ropes of applied electronics and mechanical principles, 10 practical and interesting forms of construction are provided.
Combined with the block-based programming software, Makeblock App and mBlock 3, Ultimate 2.0 allows you to simply drag and drop the function blocks to program your commands step by step, making the programming experience tangible and fun. Ultimate 2.0 is also compatible with Arduino, and can be connected to a Raspberry Pi, meaning you can build yet more interesting projects, in different programming languages, and achieve even more powerful robotics.
Makeblock STEAM and Coding Curriculum
mblock Course Collection – This is a collection of lessons that help children learn AI, Deep Learning and Python.
Sustainable Development Program – Urban Resilience is the measure of the capacity of an urban system to adapt to a changing environment, attain and maintain sustainability through all natural and technological hazards as well as socio-economic-political-cultural crises.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296949958.54/warc/CC-MAIN-20230401094611-20230401124611-00354.warc.gz
|
CC-MAIN-2023-14
| 1,261
| 5
|
https://msdn.microsoft.com/en-US/library/ee240740(d=printer).aspx
|
code
|
Data-tier Application Views (Transact-SQL)
Applies To: SQL Server 2014, SQL Server 2016 Preview
Topic Status: Some information in this topic is preview and subject to change in future releases. Preview information describes new features or changes to existing features in Microsoft SQL Server 2016 Community Technology Preview 2 (CTP2).
The following views display information about data-tier application (DAC) instances. These views are in the msdb database and are owned by the dbo schema.
|
s3://commoncrawl/crawl-data/CC-MAIN-2015-27/segments/1435375098990.43/warc/CC-MAIN-20150627031818-00248-ip-10-179-60-89.ec2.internal.warc.gz
|
CC-MAIN-2015-27
| 491
| 4
|
https://judepereira.com/blog/author/admin/
|
code
|
This year, for the very first time in Mumbai, LetsTuneup is hosting an exclusive, invite only Secret Santa gathering.
I was one of the firsts to be invited (yes!). We’re planning to have a fun filled, gift exchanging afternoon sometime during the Christmas week. The venue is yet to be declared. If you’re looking for an invite, tweet to LetsTuneup!
More information about this event is available here.
We’re looking forward to meeting all of you out there!
How it all came about
Yesterday, the morning show producer of Ishq FM messaged me, and asked if the RJ could talk to me the very next morning for a brief chat about LetsTuneup. The producer had read about LetsTuneup in an app review which was published by one of our fans a couple of weeks ago.
RJ Sangy hosts a morning show called Ishq Hangouts. We did a brief interview which lasted for about 12 minutes this morning.
For those of you who missed it earlier today, here’s the audio recording of the chat, split over four parts.
Personally, I’ve never been on air before. I loved my first experience, albeit I was extremely nervous just before it – the quick fix, I was listening to Mirrors by Niall Horan on a loop for about ten minutes just before the interview :)
With absolutely zero knowledge of Go 54 days ago, I decided to contribute to the Go project. Why? Put simply, I was bored. The thrill of learning something new, and contributing to a massive OSS project like Go caught my attention.
- Find an issue that’s tagged as HelpWanted.
- Go through their Contribution Guide.
- Although I skipped this part at first, the commenting guide.
- I split the issue at hand into two parts, one that provided the resource, and the other to actually fix the reported issue.
- On my very first CL (change list), my commenting style varied greatly. I was asked to review the commenting guide. Read it. Seriously, read it.
- A must read before starting, Effective Go.
- Take a tour of it, in A Tour of Go.
- Use Gogland (I love JetBrains for their outstanding IDEs).
Learning Go from scratch was a fairly simple task. It’s just a new syntax, nothing more. Moreover, there’s always Stack Overflow to help you out. Think of SO as a passive mentor, who gives you advice when it’s asked.
I’ve got to thank a couple of people who helped me along the path, @kevinburke, @bradfitz and @andybons. They reviewed my code, and gave my changes a +2, and submitted them.
What does it feel like?
It feels like the first time you try to dive into a swimming pool. You don’t know whether you can do it, but you do it nevertheless. Getting my first two CLs accepted was a little challenging, but definitely enthralling. Talking to other like-minded people across the globe, committed to fixing issues and innovating, is a completely new experience to me. I’m now set on a path to contribute to Go, as it’s a fun weekend exercise, and moreover, just because I can.
LetsTuneup has grown tremendously, and with it, we’ve introduced new features too. We identified that a few of our users couldn’t use the app to it’s full extent because they didn’t have music on their devices.
We’ve solved that. Users can now pick their favourite artists, powered by a location aware scoring algorithm, which recommends popular artists in their area.
Leading the recommendation list in Mumbai is Arjit Singh, followed by Eminem, Linkin Park, Coldplay and Pink Floyd. Honey Singh is #11 on the chart, and some nostalgic users love Akon, making him #28.
Stay tuned and look forward to our next big feature, very soon.
TL;DR: A giant American toy company threatens to sue Matchbox. Having no resources at hand, Matchbox is forced to change it’s name to Tuneup.
On the 14th of March, I received an email from Apple (via the giant toy company) with the following content:
The developer of the reported application is using the registered
Matchbox trademark in the description of the application without
authorization from the right holder. Also he is offering services by
unlawfully using the registered trademark which is causing bad
influence for the Matchbox brand values. Furthermore, this application is
not authorized from the right holder. This is a trademark infringement
causing damages to our client xxxxxxxx, the right holder for the
Matchbox intellectual property. I would kindly ask you to proceed and
remove the infringement/application from all stores worldwide.
This company, had the trademark for Matchbox registered under the following classification codes: US 001 002 003 005 021 022 023 026 029 036 037 038 039 041. Each and every G & S description was related to toy products, fabrication, stationery products, and manufacturing processes.
Looking up these classification codes on the United States Patent and Trademark Office’s website, absolutely none of them are for computer software, or anything that even crosses paths with Matchbox.
The million dollar question: If there was absolutely no case for “confusingly similar”, why did Matchbox change it’s name?
It’s simple really. Big guys always bully the small ones. They threatened to sue us if we didn’t stop using it. Even after proving to them that it wasn’t even remotely infringing to their use of Matchbox, they wouldn’t budge. Had I fought them legally, I would’ve won. Easy peasy. However, due to the lack of resources, I had no choice but to change it’s name.
If I had to call Matchbox anything other than Matchbox, I’d call it Tuneup. “Tuneup” is imagined by Joelle Fernandes, the co-founder of Let’s Tuneup.
This was completely unexpected. Matchbox got accepted yesterday into FbStart’s Bootstrap track, and has received a lot of freebies (worth $40K USD) to kickstart the platform’s growth.
Matchbox is born and bred in Mumbai, India. To be a part of the few apps in India to be accepted, means a lot.
Thank you for all your love Facebook!
There’s no doubt that music defines us. It influences our moods, for example, making us happy by releasing a chemical named dopamine. It can affect what we wear, what we eat, and perhaps even who we enjoy being together with. It affects our thought process too (it’s well known that ambient noise can improve productivity).
In a study conducted amongst couples who were eighteen years old, it’s been found to predict personality traits. According to the same study, it’s what we’re most likely to discuss about when we meet somebody new, within the first few weeks. Psychologically, men and women who listen to similar music tend to be better communicators, and have longer lasting relationships.
It’s probably one of the most important things in our lives. If I were to place music on Maslow’s hierarchy of needs, I’d place it at the physiological stage. It’s a fundamental part of our society. Even the Hollywood movie directors (e.g. the scene from Interstellar) would agree.
Why not extend this to the social discovery apps we use today? None of them base their core on this. One of the most popular apps for social discovery, Tinder, uses Facebook page likes and interests, to match people together.
This is why Matchbox was created. It bridges the gap between “truly anonymous“, and “hey there“. The app shows you the top ten artists that are common between you and the person you’re looking at, giving you a fair knowledge of what that person would be like:
You’re more likely to be at ease knowing that the opposite person is a little similar to you. Matchbox was crafted with the sole intention that music is the key that connects us, and binds us together. It has evolved for over 9 months, before being made available to the world.
As it stands right now, Matchbox has a hundred active users, and is growing slowly.
Go ahead and test drive the app, and see for yourself how Matchbox re-defines the social discovery platform.
Tim, iOS has always been known for it’s user interface, until recently. Your new take on notifications have not only made them very loud, and unsettling, but do not flow with the entire look and feel of Apple:
See that white background? While you’ve done a good job of highlighting the content, it breaks continuity. There was nothing wrong to start with. The way notifications used to render on my iPhone was simply perfect! The content did not need to be highlighted the way you’ve done so in iOS 10. I really loved iOS for not cluttering my life, and making it simpler, compared to Android (the new style does look like inspiration from Android, doesn’t it?).
Comparing this to iOS 9, what you’ve lost is absolute ingenuity:
I’ve been using the beta version of iOS 10 for a little more than a few hours now, and the Today screen has also been ruined. Oh! I almost forgot – what you’ve done to the control centre is horrible. Do you know what this reminds me of? It reminds me of the Red Wedding – Lord Bolton murdering the King of the North, Robb Stark. That was truly gruesome, wasn’t it?
Tim, iOS 9 was the epitome of creation.
I truly hope that this letter talks solely about iOS 10 preview, and that it doesn’t speak for iOS 10 final.
At CleverTap, we had the need to mock the new HTTP/2 Apple push gateway API. After trying to do this in Java, and then in Python, I succeeded in getting it to work in Go.
Go out of all languages! To me, Go has a completely strange syntax, compared to Java and C.
This mock server is hosted here, on Github.
At CleverTap, we’ve recently started using LESS for dynamic CSS. While it has it’s upsides, the biggest downside was that most of our developers couldn’t use the hot deploy feature for their local deployments.
After an hour or so, we came up with a neat solution.
There are two parts to this:
- Just before deploying the app into the web container, compile all the LESS files within the exploded artifact output directory
- Have the File Watcher plugin re-compile a modified LESS file within the IDE, and copy it over to the artifact output directory
Both parts above utilize a bash script (since everybody uses a Mac for development, it’s cool).
- The LESS compiler – can be installed using npm (npm install -g less). If you don’t have the Node Package Manager, just search on how to install it (most likely you’d use Homebrew)
- Install the File Watcher plugin in IntelliJ
- Go to Preferences in IDEA, then to Plugins
- Hit the “Install JetBrains plugin…” button, and search for “file watchers”.
- Install the plugin and restart the IDE
- A run configuration that is configured to deploy an exploded WAR (can be either Tomcat/Jetty/anything)
- Knowing where your exploded artifact resides (in my case, it is /Users/jude/developer/WizRocket/out/artifacts/Dashboard_war_exploded). If you don’t know how to get this, follow these steps:
- Go to File -> Project Structure
- Click on Artifacts (in the left menu)
- Select your exploded WAR artifact
- On the right, you’ll see the output directory
Part 1: Compile the LESS into CSS just before deployment
Copy the following script and save it as /Users/username/bin/lessc-idea:
Note: You will need to update the variable exploded_artifact_path in the script above.
Make it executable:
$ chmod +x /Users/username/bin/lessc-idea
Now, open up your run configuration, and scroll all the way to the bottom (where it says Make, followed by Build artifact …). Hit the “+” button, and select “Run External Tool”.
Hit the “+” button to add a new External Tool, and configure it as follows:
Ensure that the build order in your run configuration is as follows:
Once this is done, your LESS files should be automatically generated when you deploy your web app. Go ahead and give it a shot.
Part 2: Configure the File Watcher plugin to re-compile LESS files edited:
Go to Preferences, and navigate to File Watchers under Tools (left menu). Hit the “+” button and select “Less”.
Configure your new watcher as shown in the screenshot below:
Before your hit the OK button, a few things to do:
- Clear any output filters added automatically: Press the Output Filters… button, and remove anything inside there.
- Select your scope: Select the CSS/LESS directory within your web module (ensure you click on Include Recursively after you’ve selected the directory)
You’re all set. Hit OK, then Apply, and OK.
Test drive your new setup. The moment you change a LESS file, it’ll get re-compiled into the corresponding CSS file within the corresponding directory in the artifact output, and you’ll be able to see the changes immediately.
HTTP/2 is still very much new to Java, and as such, there are just two libraries who support it – Jetty (from 9.3), and Netty (in alpha). If you’re going the Jetty way (as I have), you’ll need to add their ALPN library to your boot classpath.
Note: Jetty 9.3.x requires the use of Java 8.
A full library for this is available here, on GitHub.
Here’s a quick example:
Developing an openFrameworks app with AppCode is pretty easy. However, if you just open and run the project created by the project generator, you might see the following errors:
Why doesn’t it just work?
This is because openFrameworks doesn’t support 64 bit builds yet on the Mac, due to a dependency on the deprecated QT framework. More on that here.
What’s the quick fix?
Set your project’s architecture to i386 (32 bit) in it’s build settings:
Once you’ve done this, your run configurations should shortly say 32 bit Intel instead of 64 bit Intel:
Kudos! Run your project now, and it will work right out of the box!
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-17/segments/1524125945724.44/warc/CC-MAIN-20180423031429-20180423051429-00639.warc.gz
|
CC-MAIN-2018-17
| 13,576
| 107
|
http://pubmedcentralcanada.ca/pmcc/articles/PMC3582261/?lang=en-ca
|
code
|
|Home | About | Journals | Submit | Contact Us | Français|
Summary: The R/Bioconductor package RamiGO is an R interface to AmiGO that enables visualization of Gene Ontology (GO) trees. Given a list of GO terms, RamiGO uses the AmiGO visualize API to import Graphviz-DOT format files into R, and export these either as images (SVG, PNG) or into Cytoscape for extended network analyses. RamiGO provides easy customization of annotation, highlighting of specific GO terms, colouring of terms by P-value or export of a simplified summary GO tree. We illustrate RamiGO functionalities in a genome-wide gene set analysis of prognostic genes in breast cancer.
Availability and implementation: RamiGO is provided in R/Bioconductor, is open source under the Artistic-2.0 License and is available with a user manual containing installation, operating instructions and tutorials. It requires R version 2.15.0 or higher. URL: http://bioconductor.org/packages/release/bioc/html/RamiGO.html
Supplementary information: Supplementary data are available at Bioinformatics online.
The Gene Ontology (GO) is a controlled vocabulary of gene annotation that was developed to provide consistent functional classification for genes across species; GO is also widely used in gene set enrichment analyses (Gene Ontology Consortium, 2012). It is organized as a directed acyclic graph with top-level ontologies molecular function, biological process and cellular component. Although several web-based or standalone tools are available for visualization of lists of GO terms as GO tree structures, these are not easily accessible through R/Bioconductor, where one has to either rebuild the GO tree using R packages such as GO.db or GOstats, or copy and paste the GO terms of interest into an external web service such as AmiGO Visualize (Carbon et al., 2009, http://amigo.geneontology.org) to display the GO tree.
The free open source web application AmiGO provides users with access to ontology and gene annotation data. Visualization of the queried ontology data is provided by AmiGO Visualize, which uses Graphviz libraries to create GO trees. Graphviz is a collection of software for viewing and manipulating abstract graphs (Gansner and North, 2000). We developed RamiGO to provide R functions that connect directly with the AmiGO Visualize API and retrieve GO trees in various formats. The most common format being PNG or SVG image file, but a file representation of the GO tree in the Graphviz-DOT format is also possible. RamiGO provides a parser for the Graphviz-DOT format that returns an R S4 object, called AmigoDot, that includes (i) the tree as a graph object, (ii) the adjacency matrix of the tree, (iii) the annotation of the nodes, (iv) the relation between the nodes and (v) a list of the leaves of the tree. The GO tree is displayed with the set of input GO IDs and all parents of those GO IDs to the root of each GO category where relations between the nodes are represented using the same colour palette as AmiGO Visualize; green, red, black, blue and light blue represent ‘positively regulates’, ‘negatively regulates’, ‘regulates’, ‘is a’ and ‘part of’, respectively. In addition using RamiGO, one can display and interactively modify GO tree colours, annotations and relationships between nodes in Cytoscape directly from R.
The main functions within the RamiGO package are as follows:
which retrieve a GO tree from AmiGO Visualize in the preferred format type, read Graphviz-DOT format files and communicate with Cytoscape, respectively. The AmigoDot.to.Cyto() function displays the tree from an AmigoDot object in Cytoscape using the RCytoscape package. RCytoscape requires the Cytoscape plugin CytoscapeRPC, and the installation of this is described in more detail in the RCytoscape manual. Additional functions to convert the AmigoDot S4 objects to graphAM and graphNEL formats are also provided (AmigoDot.to.graphAM, AmigoDot.to.graphNEL).
To showcase an analysis pipeline (Supplementary Material) that integrates the RamiGO package, we used the Bioconductor data package breastCancerVDX, which includes Affymetrix Human U133A microarray profiles from 344 breast cancer patients (Wang et al., 2005; Minn et al., 2007). We ranked the genes based on their prognostic value by computing the concordance index to estimate the association of each gene with distant metastasis-free survival using the package survcomp (Schröder et al., 2011). This ranked list was then used to run a pre-ranked Gene Set Enrichment Analysis (GSEA) (Subramanian et al., 2005), using the C5 (GO) subset of the Molecular Signature Database (v3.0) gene sets (http://broadinstitute.org/gsea/msigdb/collections.jsp). Figure 1 shows a subset of the GO cellular component gene sets that were reported with a false discovery rate <0.15. Using the customized colouring option in RamiGO, the nodes for gene sets with a positive Normalized Enrichment Score (NES) are red and nodes for gene sets with a negative NES are blue. The clustering of red and blue nodes is clearly visible and would have been missed when only looking at the GO gene set terms alone.
Figure 1 shows the PNG image file of the tree from AmiGO Visualize. By changing the picType parameter of the getAmigoTree() function, we can also specify SVG and DOT for the requested file type or it can be viewed in Cytoscape by exporting AmigoDot object using AmigoDot.to.Cyto (Fig. 2).
The R/Bioconductor package RamiGO provides an easy-to-use R interface to the AmiGO Visualize web server. It provides a simple and elegant way to retrieve Graphviz trees that display hundreds of GO IDs at once and efficiently study clusters or subcomponents of the GO tree in graph form. RamiGO provides functions to convert a GO tree into different formats and display it in Cytoscape without leaving the R environment. RamiGO is therefore a perfect companion to GSEA and GO analyses in R, as it helps one better analyse and interpret the long, and sometimes complex, lists of GO identifiers that these analyses produce.
Funding: This work was supported by the National Human Genome Research Institute (1P50 HG004233 to M.S.S.); Fulbright Commission for Educational Exchange to (B.H.-K.); US National Institutes of Health (#1U01CA151118-01A1 to J.Q., R01 LM010129-01 to B.H.-K. and J.Q.); Claudia Adams Barr Program in Innovative Basic Cancer Research (A.C.C. and J.Q.); Career Development grant from DFCI Breast Cancer SPORE: CA089393, Dana-Farber Cancer Institute Women’s Cancer Program (to A.C.C).
Conflict of Interest: none declared.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-30/segments/1500549425352.73/warc/CC-MAIN-20170725182354-20170725202354-00580.warc.gz
|
CC-MAIN-2017-30
| 6,573
| 13
|
https://justnewsviews.com/stop-trying-wrong-beauty-tips-l-skin-smoothing-face-scrub-l-lalitha-reddy-cosmetologist-l-hai-tv/
|
code
|
Stop Having Scrub When you See This l Simple face Scrub Tips l Lalitha Reddy Cosmetologist.
Thanks for watching #HaiTV channel
Please Do Share and Comment Your opinions and don’t forget to like and subscribe
for further details about the expert, you can find full details at the end of the video through this Link
Follow us on:
Facebook : https://www.facebook.com/haitvtelugu
twitter : https://twitter.com/haitv_channel
Google+ : https://goo.gl/BZYrgr
Hai TV It’s a Unique channel in YouTube Platform were You Can Browse Content Related to Health,Beauty,Entertainment,Tips,Devotional.etc.
its totally about Awesome Information(Hai TV).
For all Age Groups.
Channel Purpose is to do Some Social Activities and Help Orphanage children’s on The Generated Revenue…
Please Do WATCH SUBSCRIBE and SHARE …
Its an Open Platform For Every One Share Our Videos and COMMENT Your Option and Share Your Valuable Suggestions.
#Scrub #BeautyTips #HaiTV
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446711232.54/warc/CC-MAIN-20221208014204-20221208044204-00070.warc.gz
|
CC-MAIN-2022-49
| 946
| 15
|
https://wwwdontmesswith6a.blogspot.com/2022/12/
|
code
|
When: March 2023
Who: Applicants between 16-19 years old.
Who is the camp for?
At WARP, we're all about figuring out how to improve our thinking, and how that can translate into better doing. We welcome students curious about decision-making and modeling the world, and figuring out how to better test their beliefs against reality. If you're passionate about mathematics, logic, cognitive science, philosophy, economics, or history, we'll probably love to have you!
Application is now open. Apply here. The application deadline is December 29, 2022.
The curriculum covers a wide range of topics, from game theory, cryptography, and mathematical logic, to AI safety, styles of communication, and cognitive science. The goal of the program is to help students hone rigorous, quantitative skills as they acquire a toolbox of useful concepts and practical techniques applicable in all walks of life. WARP's tuition, room, and board are free for all admitted students. Need-based travel scholarships are also available.
WARP is a collaborative project between the Summer Program for Applied Rationality (ESPR) and Cognition (SPARC) team, which often runs camps in the USA, and the European Summer Program on Rationality (ESPR) team, which runs them in the UK.
The WARP, ESPR and SPARC are good programmes! Lim Li went ESPR in 2017, from 18 August to 1 September. Some photos can be found in this post.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100593.71/warc/CC-MAIN-20231206095331-20231206125331-00768.warc.gz
|
CC-MAIN-2023-50
| 1,397
| 8
|
https://www.khou.com/article/news/python-caught-slithering-out-of-virginia-beach-mans-toilet/291-575896288
|
code
|
VIRGINIA BEACH, Va. (WVEC) — A Virginia Beach man captured a python slithering from his toilet Thursday night!
James Hooper posted on Facebook photos of the snake coming up through a toilet.
"I saw it out of the corner of my eye and thought that someone was pranking me until I saw its tongue and it moving around," Hooper said.
"We used a fish pole with a noose on it to catch it and as it came up it got bigger. The snake was not harmed and Animal Control has it now. It is doing fine."
Virginia Beach Animal Control identified the snake as a 2.5-foot ball python. The snake was domesticated and had been missing for two weeks after it escaped from a residence a few miles from where it was found.
Animal Control has since reunited the snake with its owner.
► Make it easy to keep up to date with more stories like this. Download the 13News Now App.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-33/segments/1659882570879.1/warc/CC-MAIN-20220808213349-20220809003349-00377.warc.gz
|
CC-MAIN-2022-33
| 855
| 7
|
http://www.thechinamoneyreport.com/2012/05/05/charlie-munger-calls-hft-trading-rats-at-the-granary/
|
code
|
There are loads and loads of nuggets in this video. I find it interesting that
the CNBC crowd highlights his apathetic view on gold where as the real story
here is how he so throughly destroys the high frequency trading crowd which now
dominates trading. He calls them “Rats and the Granary”…clipping money along the
He goes on to comment that in order to be successful you need to beat the computers.
We agree with this concept. The “Skynet” system is running stocks up and down
based on technical patterns with underlining algorithms. How to beat the computers?
You need strong fundamental companies with good earnings and selling low P/E ratio’s.
Eventually, the computers have to give in to the fundamentals.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-05/segments/1516084889660.55/warc/CC-MAIN-20180120142458-20180120162458-00635.warc.gz
|
CC-MAIN-2018-05
| 724
| 9
|
https://itsmygamemyrules.wordpress.com/about/
|
code
|
Actually, I am NOT a lazy DM (/nod to sly flourish) so the titles a little misleading. Or I could just say its a “Little John” things, thats what I meant.
I spend a lot of time building encounters, writing snippets of very specific but small stories usually in the form of random encounters, converting or creating monsters and so on. I find the whole think pretty creative and enjoy it. I don’t always get to use everything and I figured a blog is as good a way as any to share some of my ideas, conversions and encounters etc. to help you, the Lazy DM, get through the night.
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-47/segments/1573496669847.1/warc/CC-MAIN-20191118205402-20191118233402-00430.warc.gz
|
CC-MAIN-2019-47
| 583
| 2
|
https://lists.whatwg.org/pipermail/whatwg-whatwg.org/2009-May/061910.html
|
code
|
[whatwg] MessagePorts in Web Workers: implementation feedback
atwilson at google.com
Thu May 7 13:39:26 PDT 2009
I've been hashing through a bunch of the design issues around using
MessagePorts within Workers with IanH and the Chrome/WebKit teams and I
wanted to follow up with the list with my progress.
The problems we've encountered are all solveable, but I've been surprised at
the amount of work involved in implementing worker MessagePorts (and the
resulting implications that MessagePorts have on worker
lifecycles/reachability). My concern is that the amount of work to implement
MessagePorts within Worker context may be so high that it will prevent
vendors from implementing the SharedWorker API. Have other implementers
started working on this part of the spec yet?
Let me quickly run down some of the implementation issues I've run into -
some of these may be WebKit/Chrome specific, but other browsers may run into
some of them as well:
1) MessagePort reachability is challenging in the context of separate Worker
In WebKit, each worker has its own heap (in Chrome, they will have their own
process as well). The spec reads:
User agents must act as if
have a strong reference to their entangled
MessagePort <http://www.w3.org/TR/html5/comms.html#messageport> object.
Thus, a message port can be received, given an event listener, and then
forgotten, and so long as that event listener could receive a message, the
channel will be maintained.
Of course, if this was to occur on both sides of the channel, then both
ports would be garbage collected, since they would not be reachable from
live code, despite having a strong reference to each other.
Furthermore, a MessagePort<http://www.w3.org/TR/html5/comms.html#messageport>object
must not be garbage collected while there exists a message in a task
queue <http://www.w3.org/TR/html5/browsers.html#task-queue> that is to be
dispatched on that
or while the
MessagePort <http://www.w3.org/TR/html5/comms.html#messageport> object's port
message queue <http://www.w3.org/TR/html5/comms.html#port-message-queue> is
open and there exists a
The end result of this is the need to track some common state across an
entangled MessagePort pair such as: number of outstanding messages, open
state of each end, and number of active references to each port (zero or
non-zero). Turns out this last bit will require adding new hooks to the
references without actually freeing the object - not that difficult, but
possibly something that other implementers should keep in mind.
2) MessagePorts dramatically change the worker lifecycle
Having MessagePorts in worker context means that Workers can outlive their
parent window(s) - I can create a worker, pass off an entangled MessagePort
to another window (say, to a different domain), then close the original
window, and the worker should stay alive. In the case of WebKit, this causes
some problems for things like worker-initiated network requests - if workers
can continue to run even though there are no open windows for that origin,
then it becomes problematic to perform network requests (part of this is due
to the architecture of WebKit which requires proxying network requests to
window context, but part of this is just a general problem of "how do you
handle things like HTTP Auth when there are no open windows for that
Finally, the spec defines a fairly broad definition of what makes a worker
reachable - here's an excerpt from my WebKit Shared Worker design doc, where
I summarize the spec (possibly incorrectly - feel free to correct any
> PermissibleThe spec specifies that a worker is *permissible* based on
> whether it has a reachable MessagePort that has been entangled *at some
> point in the past* with an active window (or with a worker who is itself
> permissible). Basically, if a worker has *ever* been entangled with an
> active window, or if it's ever been entangled with a worker who is itself
> permissible (i.e. it's associated with an active window via a chain of
> workers that have been entangled at some point in the past) then it's
> The reason why the "at some point in the past" language is present is to
> allow a page to create a fire-and-forget worker (for example, a worker that
> does a set of long network operations) without having to keep a reference to
> that worker around.
> Once the referent windows close, the worker should also close, as being
> permissible is a necessary (but not sufficient) criteria for being
> Active neededA permissible worker is *active needed* if:
> 1. it has pending timers/network requests/DB activity, or
> 2. it is currently entangled with an active window, or another active
> needed worker.
> The intent behind #1 is to enable fire-and-forget workers that don't exit
> until they are idle. The intent behind #2 is that an idle worker shouldn't
> exit as long as it's reachable by an active window (possibly chained through
> other workers).
The end result is that for each worker we need to keep track of a big list
of every window it's ever been entangled with. As workers become entangled
with other workers, they each inherit the list of entangled windows from the
other worker. As windows become inactive, we then walk the lists of every
worker to remove references to the window and properly shutdown the worker
as appropriate. All of this with the appropriate cross-thread
synchronization, of course :)
Likewise, determining when a worker is active needed requires tracking a
graph of entangled message ports, and walking that graph to determine
whether a given worker is reachable by any active window. Typically this is
only needed when either a window closes, or when a worker goes idle.
Again, none of these issues individually are insurmountable, but in total
they add up to a significant amount of work for what should be a fairly
incremental improvement (going from dedicated workers to shared workers).
Have other vendors started investigating what it takes to implement
SharedWorkers (and therefore MessagePorts in workers)?
Another approach for SharedWorkers would be to give them an implicit
MessagePort-esque API like dedicated Workers and not allow passing in
MessagePorts to postMessage(). This would mean that references to workers
can't really be passed around to other windows/workers, but rather are kept
per-origin. Dedicated workers could work as they do now in Firefox/WebKit
(with no MessagePorts). The SharedWorker lifecycle could be significantly
simplified such that a SharedWorker is permissible as long as there's an
active window under the same origin (no more walking some distributed
cross-thread dependency graph).
The thing we'd give up is the capabilities-based API that MessagePorts
provide, but I'd argue that the workaround is simple: the creating window
can just act as a proxy for the worker. IMO, the implementation burden far
outstrips the benefit of allowing direct foreign access to workers.
Literally 90% of the work on my plate for SharedWorkers seems to derive from
MessagePorts in one form or another, which seems completely wrong.
I'd like to hear your thoughts on this - are people open to removing
MessagePort support from Workers?
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the whatwg
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-21/segments/1652662644142.66/warc/CC-MAIN-20220529103854-20220529133854-00248.warc.gz
|
CC-MAIN-2022-21
| 7,273
| 113
|
https://salesforcecodex.com/salesforce/lightning-web-component-introduction/
|
code
|
Salesforce announced Lightning Web Components on 13-Dec-2018. This is New programming model for building Lightning components. It’s not built on top of Aura framework. It’s a different framework which will co-exist with Lightning Components. Think Lightning Web Component model as an abstraction over the Web Components.
Lightning Web Component Bundle
Once you start with the Quick Start: Lightning Web Components trailhead, you will notice that bundle structure of Lightning Web Components is different compared to Lightning Components.
Once you have updated the CLI to the LWC plugin in VS Code, you are good to create a new Project. Once you create a new project, you will notice the Project gets created with /lwc folder with two JSON files for lint support and the jsconfig file to identify the /lwc as a JS project. This folder is created parallel to aura folder which is used for lightning component.
Now, when you create a new Lightning Web Component, you will see the files created as below following the HTML Template Element Specification and ES Modules Specification of Web Components
Welcome to the good old HTML files with external js files. Comparing this with the Lightning Component bundle, the .html file replaces the .cmp file and that the controller and helpers are now merged in the .js file. I feel this structure is better than existing lightning component structure.
The meta.xml has metadata for the bundle and you can specify the availability of the component across the application, example app page, record page, etc.
What happens to Lightning Components?
Lightning Components will continue to exist in parallel to Lightning Web Components. It’s something similar when Lightning Components were available and we started thinking that if it’s going to replace Visualforce pages.
As VF pages and Lightning Components co-existed, now they are being joined with Lightning Web Components. It will be more of a choice of the framework that you will want to choose when building UI components. With the standard Web development model, it looks like Lightning Web Components definitely will be the choice in future.
With the growing need of (Web) Standards, definitely Lightning Web Components will be the choice of model to customize UIs in Salesforce in future. Developer has to learn ECMAScript 6 also for better understanding of lightning web component.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947473824.45/warc/CC-MAIN-20240222193722-20240222223722-00261.warc.gz
|
CC-MAIN-2024-10
| 2,385
| 11
|
http://linux.softpedia.com/downloadTag/Sokoban+game
|
code
|
An Open Source and platform-independent Sokoban game for Linux, Mac and Windows OSes
A free arcade style game for Linux, Windows, Mac OS , DOS and other operating systems
A Sokoban game written in Java
A new approach to the classic 'Sokoban'
A puzzle game written in Python and PyGame
A fun Sokoban program with animations
A portable 3D Mr Driller Clone
An entertaining Sokoban game featuring nice 3D graphics
A 2D puzzle game written in Python and PyGame
Sokoban-like game in Java
A cross-platform puzzle game
A simple 2D puzzle game written in Python and PyGame
nPush is a puzzle/logical game, similar to Boulder Dash and Sokoban.
A clone of the famous Transport Tycoon game by Chris Sawyer for the Linux platform
An Xubuntu-based Linux distribution specifically designed for amateur photographers
Surf the Internet in a safer, faster and easier way with the Opera browser for Linux
An application that allows users to run Windows applications in Linux operating systems
This edition of the famous Ubuntu operating system uses the Xfce desktop environment
An Ubuntu-derived Linux operating system that uses the GNOME desktop environment
The Trusty Tahr edition of the world's most popular free operating system, Ubuntu Linux
The most powerful and used media player application for Linux, Windows and Mac OS X platforms
A safer, faster, reliable, and more stable web browser for a better Internet experience
A special edition of the Ubuntu Linux distribution that uses the MythTV application
This project provides an open source backup application for InnoDB and XtraDB storage engines
An Ubuntu-derived Linux operating system designed to be used in educational environments
A community-derived Ubuntu operating system that features the MATE desktop environment
A powerful image editing and painting application for Linux and Windows operating systems
An Open Source 3D-graphics enhanced game engine for Doom, Heretic, and Hexen games
- Percona XtraBackup
- Ubuntu MATE
- Doomsday Engine
- Xubuntu Photo
- Ubuntu GNOME
Arcadiban is a Java clone of the famous Sokoban game created 1980 by Hiroyuki Imabayashi.
Still Yet Another Sokoban is an implementation of the popular Sokoban puzzle game.
Xokoban project is my (C ) sokoban game for X11.
BeastieWorker is a 3D game.
MIM Blocks is a set of blocks games (sokoban, taquin and various others) in 3D.
|
s3://commoncrawl/crawl-data/CC-MAIN-2015-11/segments/1424936462206.12/warc/CC-MAIN-20150226074102-00295-ip-10-28-5-156.ec2.internal.warc.gz
|
CC-MAIN-2015-11
| 2,349
| 38
|
https://marco.org/2008/08/02/responses-to-nostrichs-irc-sexbot
|
code
|
(Contains sexual language.)
I downloaded Pyborg, and set it up to join 6 of the most active sex-oriented IRC channels on Dalnet. Pyborg is an AI chat bot that supposedly uses a Markov Chain algorithm to formulate ostensibly coherent responses based on previous input — if you’re not familiar, google it.
I then let it idle — under the alias “lonelygirlrach” — in them for an hour, and logged all the private messages she received.
This is pretty interesting.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233506423.70/warc/CC-MAIN-20230922202444-20230922232444-00839.warc.gz
|
CC-MAIN-2023-40
| 470
| 4
|
https://www.headhonchos.com/jobs/marketing-database-developer-software-design-development-it-technology-software-services-bangalore-247920.html
|
code
|
Adobe is leading the transformation of marketing towards data driven solutions. As a marketing database developer, you will design and implement solutions for the global marketing organization. We are looking for individuals who are detail oriented, self-motivated, creative problem solvers, and have the ability to "see the big picture."
Interface regularly with marketing business stakeholders
Build, analyze, and maintain data flows and related processes for marketing
Diligently identify and pursue data anomalies
Capture and translate business requirements into technical solutions
Work closely with developers / product management in a SCRUM or AGILE environment
Develop data models to support the needs of marketing and business units
Minimum 3-5 years in developing and supporting data management systems.
Data warehousing experience or application support in RDBMS environment
Experience across two or more of: ETL, data quality analysis, data modeling, stored procedure development, application scrip development (e.g.. Python or Perl), reporting and BI, query optimization.
Prior experience with Oracle, Sybase/SQL server, Informatica, Pentaho, Microstrategy, or SSRS preferred
Experience with Hadoop, Hana, and big data preferred
Strong written and verbal communication skills
Relational data modeling experience
|
s3://commoncrawl/crawl-data/CC-MAIN-2016-50/segments/1480698541517.94/warc/CC-MAIN-20161202170901-00318-ip-10-31-129-80.ec2.internal.warc.gz
|
CC-MAIN-2016-50
| 1,324
| 14
|
https://forums.developer.nvidia.com/t/nv-ds-encoder-type-hw-always-gives-pps-0-error/244183
|
code
|
Please provide complete information as applicable to your setup.
• Hardware Platform (Jetson / GPU)
• DeepStream Version
• JetPack Version (valid for Jetson only)
• TensorRT Version
• NVIDIA GPU Driver Version (valid for GPU only)
• Issue Type( questions, new requirements, bugs)
The hardware decoder creates segments with no PPS.
Follwing settings are provides
g_object_set (G_OBJECT (bin->encoder), “profile”, profile, NULL); [THIS IS 0]
g_object_set (G_OBJECT (bin->encoder), “iframeinterval”, config->iframeinterval, NULL); [THIS IS 4]
g_object_set (G_OBJECT (bin->encoder), “bitrate”, bitrate, NULL); [This is 2000000]
g_object_set (G_OBJECT (bin->encoder), “force-idr”, 1, NULL);
• How to reproduce the issue ? (This is for bugs. Including which sample app is using, the configuration files content, the command line used and other details for reproducing)
ffmpeg -i outxxx.ts will give follwoing error:
[h264 @ 0x558b9d0b90] non-existing PPS 0 referenced
Last message repeated 1 times
[h264 @ 0x558b9d0b90] decode_slice_header error
[h264 @ 0x558b9d0b90] no frame!
I dont get this problem if I use SW encoder.
Is there a way to use HW encoder that works?
• Requirement details( This is for new requirement. Including the module name-for which plugin or for which sample application, the function description)
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100508.42/warc/CC-MAIN-20231203161435-20231203191435-00552.warc.gz
|
CC-MAIN-2023-50
| 1,347
| 22
|
http://peepspower.com/
|
code
|
I am a relatively competent power user, and therefore I dislike most “PC tune-up” utilities that “clean your computer of viruses, scrub your registry ’till it’s sparkling, and speed up your computer 10000%”. However, my MacBook Pro’s AppleCare came with TechTool Deluxe (http://www.micromat.com/techtool-deluxe), which has since been discontinued. I also swapped my hard drive out for an SSD and my optical drive out for my old HD, giving me a moderately nice 440GB of storage. I ran TechTool this morning and it complained of file structure errors. Sure, TechTool Deluxe… go ahead and fix it. Can’t do any harm, right? Wrong. After running the repair tool, I discovered (to my shock and horror) all my files were missing. It was still reporting the same used space as last time, but… My files were missing! (duh duh duh…)
I ran to get my 1TB My Passport with Time Machine backups of my life’s work on it. I’m a backup nut–I not only have the 1TB drive, but I have a 500GB offsite backup and a FreeNAS backup with 2 1TB (~350GB allotted to me) mirrored RAID drives. I tried to restore the volume directly from Time Machine, but Time Machine only restored the top level directories. So, with a sudden realization, I, I, I… Reformat my hard drive! That was a little bit hard for me. So, I used Carbon Copy Cloner (http://bombich.com/), a tool that has saved many people’s bacon. I clone from the latest working backup to my reformatted hard drive. Almost two hours later, I’m back to normal. But MAN, was that a scare.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-09/segments/1518891813608.70/warc/CC-MAIN-20180221103712-20180221123712-00697.warc.gz
|
CC-MAIN-2018-09
| 1,550
| 2
|
https://www.experts-exchange.com/questions/23488547/How-to-set-break-point-in-a-method-in-a-class-and-other-questions.html
|
code
|
How to set break point in a method in a class and other questions?
New to gdb !!! I have trouble in few issues.
1) Is it possible to browse source code from inside gdb?
2) How to set a break point in a function in a class?
3) How to set a break point in constructor?
4) How to switch between threads?
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-17/segments/1524125945484.57/warc/CC-MAIN-20180422002521-20180422022521-00287.warc.gz
|
CC-MAIN-2018-17
| 300
| 6
|
http://micama.info/watch/54DH5Bbet8Q
|
code
|
9 Like 1 Dislike
Each of the American Idol Top 3 sang their singles, a song for their hometown, and a repeat performance. And finally, a winner was declared for the season. And that winner is...Maddie Poppe! Was she our #1 favorite to win? Well, let's just say be sure to support her music on iTunes and go back and watch all her amazing performances: Maddie Poppe - Going Going Gone (Idol single) - https://itunes.apple.com/us/album/going-going-gone-single/1385263886 Maddie Poppe - Songs From the Basement (pre-Idol EP)- https://itunes.apple.com/us/album/songs-from-the-basement/1124110013 American Idol 2018 Top 3: Gabby Barrett (Rivers Deep, Little Red Wagon, and Don't Stop Believing) Caleb Lee Hutchinson (Johnny Cash Heart, Don't Close Your Eyes, and Folsom Prison Blues) Maddie Poppe - (Going Going Gone, Don't Ever Let Your Children Grow up, and Landslide) #PoppeLove #PoppePower #PoppeSeeds #AmericanIdolFinale https://www.facebook.com/rfarinapro/ https://www.instagram.com/rfarinapro/ https://twitter.com/RFarinaPro
UPDATE: Should've listened to the other singles before this! "Going Going Gone" has a waaaaay better hook. I'm finding this definitely stuck in my head one hour later. That's a good sign! Here's the first single from Maddie Poppe that will be her "winner's single" if she wins American Idol. I really, really believe in her talent, and I think this is a pretty good song, even if it isn't exactly the way I'd choose to show Maddie's abilities off. (Still, it's a winner's single, and there have been MANY that are awful, and that's not the case here, so I'm happy!) What do you think? Here's my STASH beard oil: https://bit.ly/2FGBsFb (Use code STASHSTART for free shipping in the US) Here's the webcam I use for my videos: https://amzn.to/2qOz3n6 Here's the mic I use: https://amzn.to/2HH5ei4 Here's my latest T-shirt design: https://rdbl.co/2vx9ZWr Twitter: http://twitter.com/gradywsmith Facebook: http://facebook.com/gradysmithwriter
Maddie Poppe the Winner of American Idol 2018's top 10 most amazing performances and auditions! Subscribe for more Idols Global ▶︎ http://bit.ly/IdolsGlobal_YT Find us on Facebook ▶︎ https://www.facebook.com/idolsglobal Fins us on Instagram ▶︎ https://www.instagram.com/idolsglobal #idols #audition
Maddie Poppe - Going Going Gone (Official Video) Reaction Great music video. But seriously do you hear that clanking sound in the background. I don't know why but on my ear phones it sounds like something just crashing on the ground . I listened to it again just with my laptop speakers and it sounded alright. I guess my earphones sound that bad.
Like And Subscribe
Maddie Poppe Going Going Gone Reaction
Maddie Poppe Going Going Gone Video Reaction
Click to Subscribe: http://goo.gl/43oMBC
Try Gamefly Free: http://goo.gl/QbTRMF
Support the Channel:
Maddie Poppe - Going Going Gone (Official Video)
My Other Stuff:
Horror Games: https://goo.gl/8f0vfL
Walking Dead: https://goo.gl/xEIG0L
Pewdiepie : How did this get in here?
Social Media Stuff:
PS3 Playstation 3 PS4 Playstation 4 Xbox 360 Xbox One PC Steam
Thank you guys so much for checking out my video!
If you're new to the channel please subscribe.
I'll take you on a magical journey through my backlog!
Plus I do weekly reviews. :)
If you liked the video smack me with a thumbs up.
Think I should do stuff better?
Let me know!
Stay Beautiful ;)
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676591497.58/warc/CC-MAIN-20180720041611-20180720061611-00200.warc.gz
|
CC-MAIN-2018-30
| 3,379
| 26
|
https://quant.stackexchange.com/questions/54952/calculating-sharpe-ratio-on-a-per-trade-basis
|
code
|
I have a strategy that I've been playing with and trying to backtest. It's of questionable practicality at the moment, but the idea is to pick one stock from the Dow 30 companies to trade right near the close and sell the following day, also near the close (I'm using actual closes as a proxy). If there are no suitable options, no trade is made for the day.
Here's a summary of the test trades:
Period: 6/2/2016 to 6/9/2020 Trading days: 1013 Number of trades: 734 Average return per trade: 0.2298% Trade standard deviation: 2.2826%
From what I've seen, the Sharpe Ratio would typically be calculated something like this in Python:
sharpe = daily_mean_return / daily_std * 252**0.5
In my case, I'm wondering if I should use the average number of days per year rather than
252 for a full year. So it would look something like:
trading_days = 1013 n_trades = 734 trade_mean = 0.002298 trade_std = 0.022826 annual_trades = n_trades / (trading_days / 252) sharpe = trade_mean / trade_std * annual_trades**0.5 # 1.360 daily_sharpe = trade_mean / trade_std * 252**0.5 # 1.598
So calculating using only the trades actually made yields
1.360 and calculating based on
252 days yields
1.598. Which of these is really getting to the essence of the ratio?
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100290.24/warc/CC-MAIN-20231201151933-20231201181933-00443.warc.gz
|
CC-MAIN-2023-50
| 1,244
| 12
|
https://raku.land/github:alabamenhu/Intl::LanguageTag::Simple
|
code
|
An extremely simple class implementing the core functions of a language tag.
This is designed to be either extremely lightweight when you don't need the
bulk of other language tag classes (and only need the language and region
functionality). This simple class uses the first two runs of
characters but can also be made directly using
attributes. The simple heuristic works sufficiently well for all known
standard language tag standards.
For more powerful introspection, matching, etc, see one of the other classes.
Note that this class may generate invalid BCP-47 tags, and as such the string
returned from the
.bcp47 method is false-y.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100534.18/warc/CC-MAIN-20231204182901-20231204212901-00874.warc.gz
|
CC-MAIN-2023-50
| 638
| 11
|
http://magnet.systemsbiology.net/software/Dizzy/1.11.4/download.html
|
code
|
Dizzy Download Page
CompBio Group, Institute for Systems Biology
Version 1.11.4, Released 2006/09/28
Dizzy-Unix.tgz [5.7 MB]
To install Dizzy on Unix, unpack the above-linked gzipped tar archive file. This will create a subdirectory "Dizzy" in the directory where you unpacked the archive file. Within this subdirectory, there is a subdirectory "bin". In the "bin" subdirectory, edit the file "runDizzy.sh" and modify the "JAVA_BIN" setting to whatever command you use to run java (if "java" is in your Unix PATH, then you do not need to edit "runDizzy.sh").
To run Dizzy, change directory to the "Dizzy/bin" subdirectory of the directory where you unpacked the Dizzy-Unix.tgz archive file. Then run the "runDizzy.sh" script.
Dizzy-WinXP.zip [6.3 MB]
To install Dizzy on Windows XP, unpack the above-linked ZIP archive file. This will create a subdirectory "Dizzy" in the directory where you unpacked the archive file. Within this subdirectory, there is a subdirectory "bin". In the "bin" subdirectory, edit the file "runDizzy.bat" and modify the setting for "DIZZYPATH" to be the complete directory specification of the location where you installed Dizzy, including the "Dizzy" subdirectory that was made when you unpacked the Zip archive. For example, if you unpacked the Zip archive in the directory location "U:\", then the DIZZYPATH variable should be set to "U:\Dizzy". In the same file (runDizzy.bat), you will also need to edit the command that runs Dizzy (the line starting with "C:\Program Files"), so that the correct Java binary for your computer system is being executed. If "java" is already in your path, you can shorten the first part of that command to
To run Dizzy, execute the "runDizzy.bat" file.
Last updated: 2006/01/30 20:19:25
Please e-mail comments or corrections regarding this document to:
dizzy NOSPAM at NOSPAM systemsbiology.org
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-10/segments/1581875144708.87/warc/CC-MAIN-20200220070221-20200220100221-00244.warc.gz
|
CC-MAIN-2020-10
| 1,858
| 12
|
https://haywardluxury.com/products/field-bag-dusky-orange-python
|
code
|
Field bag in Dusky Orange Python
Hardshell crossbody bag with top handle. Detachable and adjustable shoulder strap.
Color: dusky orange. Glazed python leather. Fully lined in suede.
SIZE: W: 5.5" X H: 6" X D: 3". 24" drop with shoulder strap.
This item only ships within the USA excluding California.
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-05/segments/1579250597230.18/warc/CC-MAIN-20200120023523-20200120051523-00542.warc.gz
|
CC-MAIN-2020-05
| 300
| 5
|
https://gitlab.cern.ch/atlas/athena/-/merge_requests/48882
|
code
|
Add a separate MaterialSource flag for ACTS tracking geometry
Previously, the ACTS tracking geometry was using
TrackingGeometry.MaterialSource, and was explicitly checking the content to not break with the default value of
This MR introduces a new flag
Acts.TrackingGeometry.MaterialSource. I'm adding
Acts at the beginning here, because I was thinking that we might want to introduce other flags scoped under ACTS down the road.
See also ATLIDTRKCP-382
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-05/segments/1642320301730.31/warc/CC-MAIN-20220120065949-20220120095949-00215.warc.gz
|
CC-MAIN-2022-05
| 453
| 7
|
https://eugeneyan.com/writing/how-to-apply-crockers-law-for-feedback-and-growth/
|
code
|
I recently saw a tweet about Tobi Lutke, CEO of Shopify, operating on Crocker’s Law.
What is Crocker’s Law?
Well, Crocker’s a Wikipedia editor who asked people to not apologise for editing his pages. He just cared about making his pages better and wanted them to do the same. If he was offended, it was his fault.
What a guy! (Takes a lot of self-esteem I bet). If we follow Crocker’s law, we don’t let ourselves be affected by feedback—instead, we use it to fuel our improvement. Here’s what Tobi had to say about it:
“Feedback is a gift. It clearly is. It’s not meant to hurt. It’s meant to move things forward, to demystify something for you. … Just give me the raw feedback without all the shit sandwich around it.”
Once opinions are formed, they persist. In 1975, Stanford researchers conducted an experiment where participants were presented with a pair of suicide notes—a real note by someone who committed suicide and a fake note by a random person. Participants were asked to identify the real notes.
Some participants had a talent for this—they identified the real note more than 95% of the time. Others had a success rate of 40%, worse than a coin flip.
But this was a ruse. The scores were made up (though half of the notes were indeed real). Participants who were deceived that they were 95% right were not more perceptive than those who were 40% right.
After revealing the truth, participants were asked to estimate how many they actually got right. Here’s the punchline: Participants who mistakenly thought they did well (95% correct)—due to the deception—continued to estimate a high score; participants who thought they did badly (40% correct) continued to estimate a low score.
Even when presented with disconfirming evidence, once those participants formed an (incorrect) opinion (of themselves), those opinions persisted. That’s belief perseverance–it explains why it’s so difficult to change our views.
But what if we agree with the feedback, and choose not to accept it? Well, it gets uncomfortable on the inside–here’s why.
Clashing opinions can lead to cognitive dissonance. Cognition means thinking and reasoning; dissonance means tension or clash from contradictory elements.
Cognitive dissonance happens when you simultaneously have two (or more) contradictory views—such when you agree with the feedback but don’t want to accept it. Thus, your existing views clash with new evidence (i.e., feedback) and causes mental discomfort.
You can resolve the inconsistency and alleviate the discomfort in two ways: Change your views, or ignore or deny the new evidence. Guess which is easier? (It’s the latter.) Cognitive dissonance helps explain why people vigorously defend, justify, and excuse their incorrect beliefs in the face of new evidence, or in this case, feedback. (We can be pretty stubborn, huh?)
Some other factors affecting how we accept feedback:
Hey, I get it. Feedback is uncomfortable. Ironically, the most useful feedback is often the hardest to accept. There’s a Chinese saying: “良药苦口 (Good medicine is bitter)”. To coax myself to take this bitter medicine, I’ll briefly list the medicinal properties.
Feedback helps you learn. When you receive feedback, especially that which contradicts your existing views, you gain a perspective you might not have considered before. Learn from it and perhaps revise your outdated or incorrect knowledge.
“The illiterate of the 21st century will not be those who cannot read and write, but those who cannot learn, unlearn, and relearn. ” — Alvin Toffler
Feedback helps you make better decisions. When you get feedback, you might change your initial opinion or decision. Were you wrong previously? Does this show you didn’t really know what you were talking about? Well, not necessarily. Here’s the advice Jeff Bezos shared with 37signals (now Basecamp):
People who were right a lot of the time were people who often changed their minds. … The smartest people are constantly revising their understanding, reconsidering a problem they thought they’d already solved. They’re open to new points of view, new information, new ideas, contradictions, and challenges to their way of thinking.
Thus, changing your mind could help you arrive at better decisions. It’s kinda like SGD–take a quick decision, get feedback, update decision, repeat. With enough iterations, you arrive at global optima.
Feedback helps you improve. An effective way to improve your skills is through deliberate practice. For this to work, repetition and tight feedback loops are essential. Repetition is pointless if you don’t know whether you’re getting better, or how to get better—thus, feedback (read: supervised learning) is key.
In The Making of An Expert, Anders Ericsson (author of Peak) and his team found that elite performers knew what they were doing right and focused on what they were doing wrong (i.e., they used AdaBoost). “Real experts seek out constructive, even painful feedback”, Ericsson wrote.
Receiving feedback—especially negative feedback—can be difficult. (I’ll admit, I’ve a secret fear of being criticised; I can’t shrug it off as well as most people can.) Here’s advice that helped.
Reframe your thinking. Who stands to gain most from feedback? The receiver! You! Feedback really is a gift. (Though granted, some criticism, disguised as feedback, is meant to injure). If someone takes the effort to go through your work and provide feedback, be grateful.
Here’s what a mentor of mine, a Principal Engineer at Amazon, had to say about this:
“I love getting feedback on my docs, especially if they lead to substantial changes in my thinking, or make me scrap the idea completely. This means I’ve saved myself a lot of work in the wrong direction. It’s good to learn this upfront from feedback, rather than after you’ve done the work.”
Weigh feedback based on believability. I got this from Ray Dalio’s book, Principles. (Ray Dalio is the founder of Bridgewater Associates). He was discussing it in the context of decision-making but I think it applies to feedback as well.
Believability weight the feedback you receive; weigh the opinions of believable people more. How do you determine believability? Dalio shared that believable people have done two things:
If the feedback source has high believability, try to understand their perspective and learn from them. If the person is similar in believability, debate to arrive at the best outcome or conclusion. If the person is less believable, consider their objections and feedback, but don’t spend too much time on it. Be like L2 regularization.
Don’t be too affected by negative feedback and outright criticism. As you put your work out there, you’ll get feedback. Some of it will hurt. It could be in the form of straw-manning your work, baseless criticism, or sidestepping it to attack you. Recognise when this happens and don’t be too affected by it. Or better yet, ignore it like L1 regularization.
“It never ceases to amaze me: we all love ourselves more than other people, but care more about their opinion than our own” – Marcus Aurelius
Don’t stop creating, shipping, writing just because you got some negative feedback. Please.
Learn from Crocker. Learn from Tobi. Learn from the other giants mentioned here. Feedback is meant to help–it really is. Believability weight the feedback, and don’t take it personally.
“We all need people who will give us feedback. That’s how we improve.” – Bill Gates
But remember, Crocker’s Law doesn’t mean we can insult others; it means others don’t have to worry that they are insulting us.
P.S., Jeff Bezo’s description of “people who are right a lot” sounds a lot like intellectual humility, covered in this recent video here.
Thanks to Yang Xinyi, Marianne Tan, Gabriel Chuan, and Chng Yee Siang for reading drafts of this.
Join 4,300+ readers getting updates on data science, data/ML systems, and career.
Welcome gift: 5-day email course on How to be an Effective Data Scientist 🚀
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500664.85/warc/CC-MAIN-20230207233330-20230208023330-00866.warc.gz
|
CC-MAIN-2023-06
| 8,116
| 40
|
http://pear.php.net/manual/zh/package.php.php-uml.command-line.php
|
code
|
The executable phpuml relies on Console::CommandLine. If you have followed the normal PEAR installation process to install PHP_UML, that dependency should have been resolved, and you should be able to run phpuml directly from the command line.
Pass the files and/or the directories to parse as arguments:
$ phpuml /var/www/foo
Separate the different elements by a space:
$ phpuml /var/www/file1.php file2.php
By default, phpuml will recursively parse the specified files/folders, and will echo the XMI code on the screen (UML/XMI version 2).
Renaming the UML model name
By default, the root package of a UML model is named default. To rename it, use the option -n:
$ phpuml /var/www/foo -n MyProject
Saving to a file
To save the XMI data in a particular place, instead of printing it on the screen, use -o:
$ phpuml /var/www/foo -n MyProject -o /var/tmp/
The option -o also accepts a file name, instead of a directory path.
Generating PHP code or HTML API documentation
In addition to xmi, 2 output formats are also available: html, and php. They work by applying an XSL transformation to the XMI data (in UML version 2).
Use the option -f to specify which format you want phpuml to generate.
$ phpuml /var/www/foo -f html -o /var/tmp/
If you need to provide your own XMI file, instead of parsing existing files, simply pass it as argument.
$ phpuml myFile.xmi -f php -o /var/tmp/
Selecting the UML/XMI version
To select which version of the UML/XMI standards you want your XMI to be written in, use the option -x:
$ phpuml /var/www/foo -x 1 -o /var/tmp/
Converting from UML/XMI version 1 to 2
phpuml automatically converts UML/XMI data in version 1.4 to version 2.1.
$ phpuml foo1.xmi -o foo2.xmi
Filtering the files to parse
By default, phpuml will parse only files with the extension .php. To modify this file pattern, use the - m selector:
$ phpuml /var/www/foo -m *.php *.txt
Other options are available (like an option to exclude certain files or directories to parse). You will discover them all by asking for help, like this:
$ phpuml -h
|
s3://commoncrawl/crawl-data/CC-MAIN-2015-35/segments/1440644064503.53/warc/CC-MAIN-20150827025424-00148-ip-10-171-96-226.ec2.internal.warc.gz
|
CC-MAIN-2015-35
| 2,045
| 30
|
http://stackoverflow.com/questions/19264515/how-to-show-green-progress-according-to-my-download-progress-percentage-in-windo
|
code
|
All i am working on windows phone 8. I want to show green Progress-bar according to my download percentage into my ListBox which is filling with objects dynamically. I don't want to show moving dots which is the inbuilt Progress-bar of the windows phone 8. So is there any control or approach for perform this OR can we have/create user-Control like green moving Progress-bar according to my download percentage in this scenario ?
Most welcome suggesions and solutions. Thank you in Advance.
|
s3://commoncrawl/crawl-data/CC-MAIN-2015-22/segments/1433195035761.14/warc/CC-MAIN-20150601214355-00027-ip-10-180-206-219.ec2.internal.warc.gz
|
CC-MAIN-2015-22
| 491
| 2
|
https://archive.sap.com/discussions/thread/811119
|
code
|
A problem while creating RFC function
Thank you in advance for all your replies.
The system always pops up saying "reference parameters are not allowed with RFC" when clicking check button to check the RFC function's usefulness. Would you please explain it by an example ?
couldn't thank you more.
For a remote function module all export/import parameters should be passed by value (and not by reference). This means that the parameter will always have value assingned by the FM on completion of processing.
To get rid of error message that you get while creating an export or import parameter of an RFC, check the box 'Pass Value' on the screen where you create the parameter. (It is after the checkbox for 'Optional Parameter'.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-43/segments/1539583514162.67/warc/CC-MAIN-20181021161035-20181021182535-00140.warc.gz
|
CC-MAIN-2018-43
| 729
| 6
|
http://gillette-torvik.blogspot.com/2013/05/posner-on-privacy.html
|
code
|
I value my privacy as much as the next person, but there is a difference between what is valuable to an individual and what is valuable to society. Thirty-five years ago, when I was a law professor rather than a judge, I published an article called “The Right of Privacy,” in which I pointed out that “privacy” is really just a euphemism for concealment, for hiding specific things about ourselves from others.
We conceal aspects of our person, our conduct and our history that, if known, would make it more difficult for us to achieve our personal goals. We don’t want our arrest record to be made public; our medical history to be made public; our peccadilloes to be made public; and so on. We want to present sanitized versions of ourselves to the world. We market ourselves the way sellers of consumer products market their wares — highlighting the good, hiding the bad.To understand Posner on privacy,you need to know only one fact: Judge Posner has made public (by publishing!) literally every thought that has ever crossed his mind. (Here is his 170-page CV.)
He has published most of his thoughts many times. His views on privacy are a good example. As he points out, he first started making this argument about how privacy is just a euphemism for concealment 35 years ago! And if you just do a Google search, you'll find a transcript of a Big Think interview from 2007 where he says, well, pretty much the same stuff word-for-word:
No. I value my privacy as much as anyone. But I think as a social good, a social aspect, I think privacy is greatly overrated because privacy basically means concealment. People conceal things in order to fool other people about them. They want to appear healthier than they are, smarter, more honest and so forth. I mean I’m exaggerating some, but I think it’s very much a double-edged sword, from a social standpoint. That’s number one.Another example: Not too long ago Mr. Gillette posted about a recent Posner opinion on the wisdom of imprisoning old people, and it reminded me of a case I read in law school. When I went to look it up, sure enough there was Posner, 25 years ago, writing essentially the same opinion.
Point is, Posner is not normal. He has chosen a ridiculously public life. His views on privacy are about as relevant to me as Mr. Spock's. And Mr. Spock doesn't even exist.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917118552.28/warc/CC-MAIN-20170423031158-00254-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 2,354
| 5
|
http://realtechtalk.com/tags/generic_perform_write/
|
code
|
Out of memory: kill process 7559 (rsync) score 635 or a child
Killed process 7559 (rsync)
I was surprised to see this in my dmesg whenmy rsync backup suddenly stalled/stopped.
This system has 3 gigs of RAM and lots of free memory so I don't understand what is happening.
rsync invoked oom-killer: gfp_mask=0x200d2, order=0, oomkilladj=0
Pid: 7600, comm: rsync Not tainted 18.104.22.168 #83
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-34/segments/1596439738555.33/warc/CC-MAIN-20200809132747-20200809162747-00081.warc.gz
|
CC-MAIN-2020-34
| 389
| 6
|
https://bluestampengineering.com/student-projects/annabel-y/
|
code
|
3D Printed Robotic Hand
This wirelessly-controlled, 3D printed robotic hand mimics the movements of a glove on the user’s own hand.
Area of Interest
Coming into BlueStamp, I had very little engineering experience. However, at the end of this journey I have come out with a greater understanding of how to problem solve and troubleshoot as well as an insight into the kind of engineering I want to pursue. At BlueStamp, I learned to be independent; most of the problems I encountered could be solved by the internet and I learned a great deal through first-hand experience and trial and error. Blowing up servomotors and re-threading fishing line were challenges that lent themselves to reflection, re-evaluation, and modification. In addition, encountering so many different kinds of engineering sparked my interest in areas I had not entertained before. For example, computer science used to be my least favorite subject, however, the challenge of coding the wireless nRF modules became my favorite part of the project. Also, my intended major is bioengineering, but after talking to various experts in the industry, I am considering pursuing mechanical engineering and industrial design instead. Overall, BlueStamp has taught me how gloriously frustrating and difficult engineering can be, but also how incredibly rewarding it can be to struggle, persevere, and finally conquer the challenges ahead.
Below is the final presentation of my project:
You can access my code, bill of materials, and helpful links in Google Drive.
I based my schematic off of one designed by a previous BlueStamp student.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964358705.61/warc/CC-MAIN-20211129104236-20211129134236-00251.warc.gz
|
CC-MAIN-2021-49
| 1,602
| 7
|
https://lists.typo3.org/pipermail/neos/2006-November/000123.html
|
code
|
[TYPO3-50-general] Lighttpd as "standard"
typo3 at gramba.de
Tue Nov 14 18:27:26 CET 2006
> Ok, fine but what has it to do with the webserver? What you're asking for
> is means to store and retrieve data from some "cache service". This could
> be provided by a TYPO3 API. If the API is clean enough you may write an
> extension that uses any APIs that lighttpd may offer.
It has not to do so much with the webserver despite the fact that truly
static content served by the server is more than 10 times faster than
a return file_get_contents('foo.html') for example. I find these numbers
interesting enough to take that into consideration of caching in general.
Such an cache API would make sense in the core and therefore should be
well thought of early i think In 5 years or so only very few CMS driven
sites will not have an user area.
I hope i can contribute some code ideas within the next weeks -
generally that should be not so complicated i guess.
> TYPO3-project-5_0-general mailing list
> TYPO3-project-5_0-general at lists.netfielders.de
More information about the TYPO3-project-5_0-general
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964363215.8/warc/CC-MAIN-20211205160950-20211205190950-00406.warc.gz
|
CC-MAIN-2021-49
| 1,100
| 19
|
https://tradewindappraisal.com/what-is-in-the-exipure-recipe/
|
code
|
What Is In The Exipure Recipe
Exipure is a natural dietary blend that supports healthy and balanced weight-loss by transforming white fat right into brown fat. This supplement utilizes an unique way to eliminate added fat in the body that is or else split and makes a person extremely obese.What Is In The Exipure Recipe
The conversion of white to brownish fat is enabled utilizing all-natural active ingredients with proven medical advantages. Nothing inside Exipure is acquired from untrusted or artificial sources; therefore, it carries no health dangers. This supplement is presently up for sale at an exclusive reduced rate online.
Diet pills are preferred for lots of reasons, but individuals choose utilizing diet plan tablets due to the fact that they want an uncomplicated weight reduction experience. The regular concept of weight reduction entails complying with a limiting diet and indulging in difficult exercise. While these two can assist for the most part, there are additionally possibilities for them to be ineffective, as weight gain factors differ in everyone.
In many cases, even one of the most famous diet strategies fail to function, or it is unaffordable for people to work with a personal instructor or obtain time for workout on a daily basis. On the other hand, using diet tablets and anticipating the body to lose weight by itself audios easy, plus diet regimen pills cost less than a weight management surgery, so people prefer to utilize them.
Exipure is among the current additions in the diet tablets that are preferred these days. Regardless of being a new item, it is getting a warm welcome, generally since it has actually assisted people achieve their target weight without triggering a financial concern. But the threat of attempting a brand-new item continues to be the same, specifically for a person that has actually never tried a nutritional supplement before.What Is In The Exipure Recipe
How to make sure if it is secure to use? What are its ingredients and where to purchase Exipure? Figure out all in this Exipure review.
What Exactly Is Exipure?
Exipure is a weight management supplement made of all-natural ingredients with medically confirmed benefits. It results from years-long study on medical plants, wanting to discover the very best options for all-natural fat burning. What Is In The Exipure Recipe As plants have been utilized for thousands of years in different therapies, scientists believe a few of them can also assist versus obesity. In this attempt to locate these plants, they created 8 unique components, each contributing in shedding undesirable fats.
As discussed on exipure.com, this supplement works just as well on males, females, and also individuals that recognize themselves besides this binary category. It is a non-prescription formula, however only those who are 18 years and above can utilize them. Exipure can be found in pill type, and also there are 30 of them in each bottle. This set container is to be consumed in one month, ideally, and also the very best outcomes are observed within two to three months.
Although the supplement sector is full of similar products, weight management with Exipure is distinct. It functions by altering the normal white fat to brown fat, also called brown adipose fat. The natural components inside this supplement help in this conversion, and also the body loses a great deal of calories throughout this conversion.
One of the most important and also distinct quality of Exipure is that it goes inside the body as well as targets the primary source of weight gain. It functions to boost metabolism as well as control stress and anxiety as well as swelling inside the body.
Moreover, Exipure is a US-made item prepared in an FDA-approved and also GMP-certified center. The end product is tested through a third-party research laboratory for high quality and also safety. There are least possibilities of it failing and bringing up an unwanted result. Continue reading to recognize even more regarding Exipure action, active ingredients, and pricing.
Exipure Ingredients Listing
The official web site of Exipure points out 8 special active ingredients inside this formula. These active ingredients are chosen after going through thousands of studies on each, verifying them an ideal option for this formula. They are gotten from various places, as well as there is no certain information on each component’s area in particular.
Below is a listing of all Exipure ingredients as well as their effects on the body.
- Perilla: the first name in Exipure components is perilla, likewise called beefsteak plant. There are many research studies confirming its result on cholesterol levels, as it stabilizes the HDL as well as LDL levels and also aids in brown fat development. Some of its substances likewise supply cognitive advantages and enhance brain-to-body sychronisation.
- Divine Basil: next is Holy Basil, a component with proven medicinal advantages. It relieves tension, as well as inflammation, both greatest triggers of a slow-moving metabolism. What Is In The Exipure Recipe It likewise removes the body from toxins, waste materials, and mobile wastage, keeping ideal metabolic problems for the body.
- White Oriental Ginseng: Exipure pills additionally consist of Panax ginseng or Korean ginseng, which supplies unmatched power to the body. This power helps the body run its features in spite of dropping weight, and there is no lethargic or weak sensation experienced by the body.
- Amur Cork Bark: not as preferred as various other ingredients, yet amur cork bark offers metabolic benefits that make weight-loss very easy. What Is In The Exipure Recipe It reduces bloating, looseness of the bowels, cramps, nausea, unwanted gas, and also other conditions that are common in overweight people.
- Quercetin: Following on this checklist is quercetin, an ingredient offering advantages for high blood pressure, heart health and wellness, and vessel health and wellness. Some research studies also confirm its function in enhancing resistance, delaying aging, as well as invigorating body cells, keeping them young for a very long time.
- Oleuropein: sometimes referred to as Olea Europaea, oleuropein diminishes the fat cells, helping them alter to brownish fat while shedding a great deal of power made use of to sustain cellular activities. It additionally enhances cholesterol degrees, high blood pressure, sugar levels, and lipid profile, stopping numerous health conditions.
- Berberine: one more name in the Exipure components list is berberine, which is packed with anti-inflammatory anti-oxidants. It assists clear the body from contaminants, removing free radicals and mobile wastes that sometimes impede metabolism. It supports healthy and balanced food digestion, and with quercetin, it thaws much more fat in less time.
- Resveratrol: the surname in Exipure ingredients is resveratrol, an antioxidant frequently located in grapes. It provides a number of wellness benefits, one of which is to reduce cholesterol levels, protect against plaque formation, as well as clear contaminants.
All these active ingredients are acquired from pure quality resources, and absolutely nothing among them can trigger any side effects in the body.
Read what Exipure reviews from clients and their shocking discoveries have to claim concerning this supplement. What Is In The Exipure Recipe Is it really worth spending money on? Check out this in-depth record which will amaze you.
Just how Does The Exipure Formula Job?
Gaining weight has ended up being much easier due to the transformed way of life and also dietary routines. Not simply grownups, yet younger and older individuals are likewise targets of weight problems currently, as well as these trends are raising each year. What Is In The Exipure Recipe The health and wellness experts are very worried over these excessive weight fads, suggesting individuals shift to a healthier lifestyle. But it is often not a choice, as well as for one reason or another, individuals often tend to try to find faster ways to make it happen.
Exipure is a weight loss nutritional formula produced with metabolic-boosting natural herbs. According to the company, it aids alter the white fat cells to brown adipose tissues, making them better and also healthy for the body. There is a lot of clinical proof suggesting BAT is related to obesity. The manufacturers of the Exipure weight-loss supplement have used this details and created a formula that utilizes all-natural active ingredients to raise brownish fat levels.
For individuals who do not know about brown fats, it is a kind of fat that only triggers when the weather condition is cold. It melts, giving warmth to the body, that makes chilly temperature bearable for it.
Do not perplex this brown fat with the normal fat, additionally called white fat, as it brings extra mitochondria in its cells, making this fat melt more energy release. This procedure melts a multitude of calories, keeping the body heated, invigorated, and causing weight reduction.
Where To Purchase Exipure? Cost, Price Cut and also Reimbursement Plan
Exipure is currently in supply and available for prompt shipments. The only means to obtain your hands on this supplement is through its main internet site (exipure.com), as it is not readily available anywhere else. You can put the order online, straight, and also your order will certainly reach your doorstep within a couple of days.
Do not trust any type of online or local vendor selling Exipure supplement for weight management. What Is In The Exipure Recipe The business has no partners, as well as there are high chances of other firms using its name to sell their fake products. Always choose the main internet site over the random online stores to make your acquisition.
The actual price of the Exipure supplement is nearly $200, but it has actually reduced it to $59 just, as a part of promos, to ensure that an increasing number of individuals can understand about it. Right here are the total rates details.
- Get one container of Exipure (30 day supply) for $59.00 just (Plus distribution costs).
- Obtain 3 bottles of Exipure (90 days supply) for $49.00 per bottle (Plus distribution costs) + Reward products.
- Obtain 6 bottles of Exipure (180 days supply) for $39.00 per container (Cost-free shipment) + Reward things.
Acquire Exipure at a Price Cut: From The Official Website Right Here
Although it is much better to buy only one container first and get more later on, after using it for a few days. Yet Exipure may not be readily available at all times, as it is a preferred product with high need. The firm can only make a limited supply, and also restocking could take a few months. For that reason, it is better to get three or 6 containers to start a weight management journey. You can constantly buy even more containers when available as well as continue utilizing them for as long as you require. It is additionally vital to keep in mind that Exipure Australia, NZ, Canada, UK, as well as customers from other countries around the globe must additionally put their orders on the main internet site pointed out above.
Exipure Reimbursement Plan.
Exipure includes a 100% satisfaction guarantee as the business is ready to reimburse the total order value, if this product stops working to meet your assumptions. There is no minimum or optimum to get this deal and all orders acquired via the main web site will automatically be a part of this reimbursement policy.
The business relates to customer contentment as its leading priority and also is ready to bear a loss, if Exipure falls short to accomplish its pledges. The moment called for to get this reimbursement is 180 days, or six months, that suffices to evaluate this supplement. The firm has an energetic customer support group all set to assist new and existing customers. Get in touch with the customer like recognize the procedure of refunds. Likewise, do not discard your used or vacant Exipure bottles, as you may be asked to send them back to the business as a proof of purchase.
Do not trust resources aside from the main site to get your Exipure order as this refund plan does not apply on containers purchased from unapproved resources. The reimbursement requests obtained after passing this 180-day restriction will certainly be rejected by the business, so maintain a track of this time.
Directions To Make Use Of Exipure Supplement.
Using Exipure is no various than using multivitamins, and also you only require a glass of water to eat it. The day-to-day dosage is just one pill, as well as taking a greater dosage is strictly prohibited. What Is In The Exipure Recipe There is no fixed time to take this everyday dosage, as well as you can take it whenever of the day. However, it is much better to take care of a time to consume it to ensure that you do not forget or miss the daily dosage.
The results are evident within three to 6 months, however it can be made use of for longer than six months, also, as it has no negative effects to offer. Though individual results might vary, Exipure is for every person, irrespective of weight, but extremely obese patients might take more than six months to reach their target weight. Nothing inside Exipure has a habit forming capacity or withdrawal impact, as well as you can utilize it again and again without bothering with anything.
Others that are just a couple of pounds over their target weight will only see changes in a few weeks. The moment needed to show the outcomes depends upon the body’s ability to reply to different active ingredients, and no two bodies share the same features. Do not use Exipure if you are unsure about its use, or talk to a medical professional to get more information regarding supplement security.
Exipure Reviews – The Decision.
To sum up, Exipure appears to be a potent weight loss supplement, with direct advantages for the metabolism. It uses a healthy and balanced method to lose weight, which is why the outcomes of the Exipure supplement are longer and better. Actually, they continue to be the very same after you quit utilizing the supplement as well as preserve the outcomes with standard dietary changes and exercise.
All orders are protected with a 180-day money-back warranty, during which you can select to obtain a reimbursement of your order if it fails to help you in fat burning. Do not take more time since Exipure is selling fast, as well as there are only limited containers left. Visit the main site to validate your order before the supply sells out.
(LOW SUPPLY ALERT) Click On This Link to Buy Exipure From The Official Web Site While Material Last.
Exipure Frequently Asked Questions:
What is The Right Time to Consume Exipure?
There is no standard time to utilize this supplement, as well as the user can take it based on his convenience. The firm makes certain there is no sedative component; consequently, Exipure does not influence the resting cycle. What Is In The Exipure RecipeNonetheless, it is best to take it throughout the very first fifty percent of the day to make sure that it has all day to trigger BAT conversion.
Is Exipure Suitable For Everyone?
Based on the info shared online, Exipure has a 100% natural formula without GMO active ingredients, soy, and gluten in it. It is likewise devoid of unnecessary chemicals, fillers, binders, and chemicals that might make an item inappropriate for lasting use. The formula is best for individuals in their middle ages, dealing with obesity without time to diet regimen planning or workout.
Just How Much Weight Can One Lose with Exipure?
The amount of weight management can be different for various people, and there is a criterion for this weight loss. One can lose even more weight in much less time by taking in Exipure diet regimen pills in a healthy and balanced, low-calorie diet plan as well as an active way of living.
Can You Get An Allergic Reaction From Exipure?
Exipure has no threat of negative effects and also allergies, and it is uncommon to have allergies with medicinal components, in general. There are no complaints from the customers, and also no customer reported an allergic reaction after utilizing this formula. If a person has a background of food-borne allergic reactions, it is better to speak with a medical professional in advance for a safe weight reduction experience.
How To Call Exipure Firm?
The business has an energetic client support line to promote new and also existing clients. What Is In The Exipure Recipe All the orders are safeguarded with a 180-day money-back deal that can be availed by contacting the group. Below is exactly how to call them.
Email: [email protected]
Residential Phone Calls: 1 (800) 390 6035.
International Phone Calls: 1 (208) 345 4245.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710691.77/warc/CC-MAIN-20221129100233-20221129130233-00187.warc.gz
|
CC-MAIN-2022-49
| 16,817
| 66
|
https://github.com/rjray/devel-modlist
|
code
|
Join GitHub today
GitHub is home to over 20 million developers working together to host and review code, manage projects, and build software together.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
|Failed to load latest commit information.|
Devel::Modlist - Show the modules, with version number, used by a script Version: 0.801 (see ChangeLog for full history) WHAT IS IT Devel::Modlist is a small tool that emits a list of files that were brought into a script via 'require' or 'use'. It lists these to the STDOUT descriptor at the end of the script's run. Each file is converted to class-like name, e.g. IO/File.pm is displayed as IO::File, and the version number, if found, is displayed. Files ending in .al (auto-loading routines) and .ix (indices for auto-loading) are ignored. Optionally, one can request that files in the Perl core library area not be listed (see the manual page). USING Devel::Modlist The module is designed to be used like most Devel::* packages: perl -d:Modlist script It can also be used via -M: perl -MDevel::Modlist script BUILDING/INSTALLING The package is designed to configure and build like a typical Perl module. To build: perl Makefile.PL make && make test (at present, there are no tests defined for Devel::Modlist) To install: make install You may need super-user priviledges to install. PROBLEMS/BUG REPORTS Please send any reports of problems or bugs to <firstname.lastname@example.org>. CREDITS AND LICENSES This package is copyright (c) 2000 by Randy Ray (email@example.com). This module and the code within are released under the terms of the Artistic License 2.0 (http://www.opensource.org/licenses/artistic-license-2.0.php). This code may be redistributed under either the Artistic License or the GNU Lesser General Public License (LGPL) version 2.1 (http://www.opensource.org/licenses/lgpl-2.1.php). Perl module interface by Randy J. Ray (firstname.lastname@example.org), original concept and prototype code from Tim Bunce (Tim.Bunce@ig.co.uk). Special thanks to Andreas König <email@example.com> for help in adding the CPAN support.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-47/segments/1510934806842.71/warc/CC-MAIN-20171123142513-20171123162513-00361.warc.gz
|
CC-MAIN-2017-47
| 2,109
| 6
|
https://en.code-bude.net/2015/09/18/update-cloud-downloader-2-6-5/
|
code
|
Today there is again a small update for the Cloud Downloader. However, the new version is only an interim release with bugfixes. New features are waiting for you in the next release of the Cloud Downloader.
However, since there were changes to the SoundCloud website and the current version 2.6 has thus lost its function, I had to bring forward this release. The latest version for now is 2.6.5, which can be found, as usual, in the main article about Cloud Downloader. Please follow the link below to download the new version.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296816893.19/warc/CC-MAIN-20240414161724-20240414191724-00226.warc.gz
|
CC-MAIN-2024-18
| 528
| 2
|
https://www.gov.uk/government/publications/application-for-uk-visa-access-rights-to-child-appendix-5-form-vaf4a
|
code
|
Form to send with from VAF4A to apply for a visa to come to the UK to exercise access rights to a child living in the UK.
Use this form if you are outside the UK and cannot apply online. It is for a parent who has access rights to a child who is a British citizen or settled in the UK.
You must also complete form VAF4A. Read the VAF guidance before completing your application.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-09/segments/1487501170708.51/warc/CC-MAIN-20170219104610-00379-ip-10-171-10-108.ec2.internal.warc.gz
|
CC-MAIN-2017-09
| 378
| 3
|
https://community.spiceworks.com/topic/316879-good-day-for-fun-music
|
code
|
Sometimes things just work out right.
Driving to work this morning (tech support for an academic competition) I realized my daughter had left her Sirrius setup in my truck. Found the '50s channel Ok, I like it) and everything they played was really good. Standouts were Ernie K. Doe and Della Reese, but there was a solid 30 minutes of good stuff.
Didn't have much to do (all I was really here for was reassurance - everything checked out days ago) so I stayed in my office working on things I couldn't get done during the week,
Went to Pandora and listened to a couple of my stations - "Georgia Satellites" and "Duane Eddy".
Nothing serious - just fun stuff.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-39/segments/1505818685698.18/warc/CC-MAIN-20170919131102-20170919151102-00666.warc.gz
|
CC-MAIN-2017-39
| 659
| 5
|
http://www.pythonpandas.com/function-wrappers-in-python/
|
code
|
Function Wrappers in Python
Wrappers around the functions are also knows as decorators which are a very powerful and useful tool in Python since it allows programmers to modify the behavior of function or class. Decorators allow us to wrap another function in order to extend the behavior of the wrapped function, without permanently modifying it. In Decorators, functions are taken as the argument into another function and then called inside the wrapper function.
@wrapper def function(n): statements(s)
This is also similar to
def function(n): statement(s) function = wrapper(function)
Let’s see the below examples for better understanding.
Hello, this is before function execution This is inside the function !! This is after function execution
Example 2: Let’s define a decorator that count the time taken by the function for execution.
countdown 1.6689300537109375e-06 countdown 5.507469177246094e-05
It’s critical to emphasize that decorators generally do not alter the calling signature or return value of function being wrapped. The use of *args and**kwargs is there to make sure that any input arguments can be accepted. The return value of a decorator is almost always the result of calling func(*args, **kwargs), where func is the original unwrapped function.
Last Updated on November 13, 2021 by admin
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233511106.1/warc/CC-MAIN-20231003124522-20231003154522-00630.warc.gz
|
CC-MAIN-2023-40
| 1,320
| 11
|
https://support.appriver.com/kb/a1014/critical-threat-logs.aspx
|
code
|
AppRiver's Web Protection works around the clock to shield your network from all known and suspected malware types that are found in every corner of the internet. But Web Protection now monitors your network from within to ensure that any malware that’s already in your system isn’t trying to send information back to its creator. If Web Protection detects malware attempting to send out information, it will generate a Critical Threat Notification and send it to everyone in your notification list. Threats will also be included in the Web Protection logs.
Designed as an early-warning detection initiative, the notification indicates that Web Protection has identified a Botnet, Key Logger or other malicious program that is attempting to send out information from within your network. In other cases, one of the browsers on your network may have been blocked from reaching a site that contains malware. The notification will list the malicious domain, threat type and the number of times the threat has been blocked prior to the notification.
In addition to the Critical Threat Notifications, these threats are now included in the Web Protection logs for you to access from the Customer Portal. From the Web Protection tab, just click on Logs. To view the Critical Threat logs, select Critical Threat from the Result drop-down menu. You can then choose Entire Day or select a Date Range or a Time Range from the Date Options. You can also choose if you want the logs to display all of the data or the data for a specific Policy, User or Network. Click the Search button to view your requested logs.
In the logs, you will find information such as the date and time of the attempt, Result, Category, Policy, Type, Source, Network IP and URL. These logs will give you a head-start in tracking down potential weaknesses or dangerous activity on your network.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-21/segments/1620243991870.70/warc/CC-MAIN-20210517211550-20210518001550-00338.warc.gz
|
CC-MAIN-2021-21
| 1,861
| 4
|
https://adambien.blog/roller/abien/entry/scheduler_datasources_microservices_jsf_and
|
code
|
Scheduler, DataSources, Microservices, JSF and JS, Beeing Optimismtic or Questions For the 8th airhacks.tv
Lets start with some news first: airhacks Q & A got a dedicated website http://airhacks.tv with an archive of the past shows.
Now to the questions for the November (3rd November, Monday, 6 P.M. CET) edition of the http://airhacks.tv show:
- Question about ejb scheduler vs java ee batch processing. What are pros and cons when using batch processing over ejb scheduler ? Marek
- Question about multi datasource and EJB. What is the best way to deal with EJBs
which need to use a specific database for caller/user? Should I use
Interceptors? Should I use injection with request scoped? Wesley
- Statement: “You forgot to say one advantage of Spring over JEE. Spring you can deploy on any container.” Mauricio
- ‘How do you manage deployed microservices (status, healthchecks, restarting) locally and on servers?’ Tomek
- ’How do you use Docker (what setup) locally and on servers? Tomek
- Why It Is Impossible To Automatically Handle javax.persistence.OptimisticLockException? “…I had even more finding on optimisticLockException. I had encounter this
exception and my solution was pretty straight forward which was just retry and
it works fine with my design and the data were good. The catch is, recently I added a new table which has a relationship to the row
which was throwing the optimisticLockException. I noticed that the entry in the second table was not created because of this exception. However the record data consistency was maintained because of the retry. But I loose an important
information in my related table. Does anyone have suggestion on what to do with this kind of scenario?…” [Anuj]
- can you share some updates on how to do high availability JEE apps in light of
JEE7 and tackling session stored data Ahmed
- We will also cover the extensive gist comments
Do you have any additional questions? Ask now, or wait a month :-)
The best of all: you can ask the questions live, during the show using the chat: http://www.ustream.tv/channel/adambien, twitter (hashtag "#airhacks") or (the best option): using channel ##airhacks on http://freenode.net.
See also other screencasts at: http://tv.adam-bien.com or subscribe to http://www.youtube.com/user/bienadam.
See you at Java EE Workshops at Munich Airport, Terminal 2 or on demand and in a location very near you: airhacks.io!
I have a few questions that i hope you can answer:
1. How to implement a MVC using jax-rs as the controller?
2. OpenJPA vs Hibernate vs EclipseLink, is there any big different between them (performance, stability and etc)
3. NoSQL, what is more preferable, using native driver or using JPA frameworks like Hibernate OGM?
4. You said that on a boring enterprise projects it is preferable using just one monolithic project but in a startup projects this is not always the case and a multi module project is needed can you please elaborate on what kind of projects? and maybe give a code example of a multi module project.
Posted by Eyal on October 31, 2014 at 11:06 AM CET #
I have also a question:
You have already talked sometimes about microservices and a RESTful communications.
How does a RESTful communication looks like referred to the payload? Do you have shared DTOs / shared domain model package? How let you know the client of a RESTful communication about the data structure?
PS: I'm thinking in product development (not projects), where a single services should also be replaceable with a different implementation.
Posted by Matthias on November 01, 2014 at 09:42 AM CET #
I have one question. Where to put business logic (operations on database etc.) when we use in project both JAX-RS and JSF (which doesn't use rest)?
Posted by Grzegorz on November 01, 2014 at 09:43 AM CET #
long time no speak - so here is my question:
Is there an official way to let a JCA 1.6 ResourceAdapter register any kind of Object in to the JNDI Regsitry to let applications lookup these objects?
I know, there is administered object in the ra.xml. But is there a more programmatic way to do this?
Background: A CCI-style Resource-Adapter will interact with an EIS. When bootstraping the RA, the EIS is requested about the available functions. These functions should be registered as InteractionSpecs in JNDI, so that a lookup can be made:
For now, there is no standard way for a resource adapter. In Glassfish, I can use InitialContext but can't do this in Tomee/Geronimo -> the fallback is to unpack the rar, modify the ra.xml with new <adminobjects> sections and repack+redeploy the rar everytime the EIS changes it's functionality.
Do you have a glue?
Thanks a lot and kind regards,
Posted by Robert on November 01, 2014 at 03:18 PM CET #
reposting a question which obviously got lost :)
How do you handle transforming entities with OneToMany relationships to XML or Json for JAX-RS? I receive a lazyinitializationexception from hibernate. I was able to overcome this problem with the use of jackson-datatype-hibernate dependency, but it works only for json. What about XML? I am aware I could use @XmlTransient, but I don't want that. I want to be able to use the same entity for getAll() (only entity without fetch) and getAllFetched() services.
Posted by Mougli on November 03, 2014 at 02:39 PM CET #
I have recently read this article: http://antoniogoncalves.org/2014/05/25/switch-datasource-with-cdi-alternatives-and-stereotypes/
With CDI, is it possible to choose a database dynamically according to the running context, and not statically like in this article? For instance, choose a remote database if the computer is connected to the Internet or a local one if it is not connected?
Else, which solution would you advise?
Posted by Richard on November 03, 2014 at 05:59 PM CET #
Thanks for an answering my questions.
Regarding for question 4, you said these things on the 33rd degree conference video you uploaded.
I know you didn't have the time to show an example during the airhacks show but maybe now you can do a quick video on multi module project?
Posted by Eyal on November 05, 2014 at 08:25 AM CET #
Where can I watch this show now?
Posted by javaservant on November 05, 2014 at 11:02 AM CET #
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-23/segments/1685224643388.45/warc/CC-MAIN-20230527223515-20230528013515-00049.warc.gz
|
CC-MAIN-2023-23
| 6,227
| 56
|
http://www.horseforum.com/gaited-horses/saddlebreds-237322/page3/
|
code
|
Originally Posted by Palomine
DCA...how horrible...I had apparently only touched the tip.
When I think about all the stuff I KNOW goes on and all the stuff that's RUMORED to go on that I'm pretty sure is probably factual, then I have to wonder what the Hayell is going on that I DON'T know about? And just how gawd awful is it because some of the stuff I know about is pretty gawd awful.
And by the way, I love me some Saddlebreds and some Arabs and I wouldn't dream of doing any of the stuff I listed. It just sickens me that some people will go to that extreme, in any breed, just to win.
So, Palomine, can YOU tell which one is the Arab? And don't name names if you recognize the horse(s), I want to have a little fun with this.
|
s3://commoncrawl/crawl-data/CC-MAIN-2015-48/segments/1448399455473.15/warc/CC-MAIN-20151124211055-00320-ip-10-71-132-137.ec2.internal.warc.gz
|
CC-MAIN-2015-48
| 731
| 5
|
http://www.cyberpunkworld.com/still-confused-about-that-whole-higgs-boson-thingie/
|
code
|
The world has been in a big geekgasm mode the past two weeks. Higgs boson this. God particle that. I’m interested to know more about the topic but as a non-physicist and someone out of college for quite some time, I found the Wikipedia entry a bit hard to chew and digest.
Some smart people released videos and blog posts explaining the issue to us mere mortals. I checked out a few and the best one I’ve seen so far is this video from PhD Comics. It explains the Higgs boson in a way that can be understood but without overly simplifying things.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-09/segments/1518891817523.0/warc/CC-MAIN-20180225225657-20180226005657-00250.warc.gz
|
CC-MAIN-2018-09
| 550
| 2
|
https://docs.typo3.org/typo3cms/extensions/seminars/stable/DE/Konfiguration/SettingUpTheMultipleSeatsFeature/Index.html
|
code
|
This documentation is not using the current rendering mechanism and will be deleted by December 31st, 2020. The extension maintainer should switch to the new system. Details on how to use the rendering mechanism can be found here.
Setting up the “multiple seats” feature¶
In the default configuration, this extension allows each user to register only one seat per event. This can be changed if you need users to register more than one seat per registration (e.g. when you use this extension for a theater, or you would like companies to register all their attendees in one go).
Please note that this doesn’t enable users to register multiple times—it just allows them to enter the number of seats for their registration.
This is what needs to be changed:
- For the back-end user group managing the registrations, enable the excludefield Attendances: number of seats . If you would like the attendee to also enter the names of the other attendess, please also add Names of the attendees.
- Enable the seats field for the notification e-mail to the organizers by adding seats to plugin.tx_seminars.showAttendanceFieldsInNotificationMail . If you would like the attendee to also enter the names of the other attendess, please also add attendees_names .
- Enable the seats field in the online registration form by adding seats to plugin.tx_seminars_pi1.showRegistrationFields . If you would like the attendee to also enter the names of the other attendess, please also add attendees_names . Please note that this value also specifies the order of the form fields on the front end.
If the field seats is not filled in (ie. the registration is for 0 seats), the registration is counted as 1 seat.
Please note the the number of seats currently is not included in the automated e-mail to the user. This will be implemented in a later version of this extension.
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-45/segments/1603107879673.14/warc/CC-MAIN-20201022141106-20201022171106-00067.warc.gz
|
CC-MAIN-2020-45
| 1,861
| 10
|
https://paudio.com/product/rational-acoustics-smaart-rt/
|
code
|
Rational Acoustics SMAART RT
Smaart RT is a stand-alone version of the Real-Time Mode interface of Smaart Suite. RT includes all of the Real-Time mode features in Smaart Suite with no limitations or changes to the FFT-based measurement functionality. Any limitations in RT apply to IR measurement (there is no IR Mode), and SPL Measurement (there is no SPL Mode).
For a majority of Smaart users, Real-Time mode is what makes Smaart smart. The single channel Spectrum, and dual channel Transfer Function measurements are essential tools for professional sound engineers all around the world. Real-Time Mode is specifically designed for sound system engineers to be able to accomplish their alignment and optimization work quickly, efficiently, and effectively.
Smaart RT allows for the calibration of any and all inputs for SPL, and calibrated spectrum measurement. RT offers a single, read-only, SPL meter in the main interface for viewing common SPL values without all of the advanced SPL modes features like logging, reporting, alarms, etc.
Smaart RT vs Smaart LE
Both Smaart RT and Smaart LE offer the same multi-input, multi-output, multi-measurement capability. Where they differ is in the depth of settings and advanced user functions. RT is the exact same RT mode as Smaart Suite. LE is a stripped-down version of RT.
- Unlimited simultaneous RTA measurements and live average of RTA data
- Fractional-Octave banding up to 1/48th octave resolution
- Fractional Octave or Line view of RTA data
- View data as banded, lines, or both simultaneously
- View Peak Holds, Target Curve (including cinema X-curves), and THD
- Accurately display SPL levels per 1 and 1/3 octave bands with calibrated inputs
- A, C, X, and Inverse weighting options for live and stored data
- Fast, Slow, & Infinite data averaging selections, plus “none”
- Spectrum-over-time with amplitude represented by color
- User-definable dynamic range
- Scrollable line history
- Adjustable slice height resolution
- Full color or greyscale
Real-Time Mode: Transfer Function (dual channel)
- Magnitude, Coherence, Phase, Live Impulse Response (Live IR) graphs
- Unlimited simultaneous TF measurement and live average of TF engines
- MTW and single-size FFT data acquisition from 128-128K
- Up to 1/48th oct smoothing for magnitude and phase graphs
- Reference delay finder with frequency filtering
- Automatic reference delay tracking
- Progressive averaging selections of 1-10, plus infinite.
- A, C, X, and Inverse weighting options for live and stored data
- Supports AES-75
SPL (Sound Pressure Level)
- View 1 SPL metric at a time
- SPL A, C, & Unweighted Fast and Slow
- Peak C, Peak Z (unweighted)
- 1 user-definable Leq metric (A, C, Z, time integration from 1sec-24 hours)
- User-definable ‘traffic light’ meter display colors
- Read Only
- Multi-output; mono, multi-mono, stereo
- Independent output trim
- 10 programmable output presets
- Random, Pseudorandom, SMPTE, and speech-weighted noise
- Sine, Sweep, and File playback (.WAV .AIFF)
- Optional noise fade-in
- Unlimited simultaneous input and output channels
- ASIO, Wav, and CoreAudio driver support
- Input calibration for SPL
- Integrated gain and phantom power control with gain tracking for the Roland OctaCapture
The minimum system requirements for the Smaart v9 platform have changed from Smaart v8. Please read the requirements below carefully to ensure v9 is compatible with your system.
|OS Version||Windows 10 (64-bit only)||macOS 10.13 (High Sierra)|
|Processor / CPU||6th gen Intel Core i5 or similar/newer*||6th gen Intel Core i5 or similar/newer (2015 or newer)
Any Apple Silicon M series
|Memory / RAM||4GB||4GB|
|Graphics||Hardware supporting DirectX 12**||Any|
|Display||1024 x 768||1024 x 768|
|Sound||ASIO® or WAV/WDM drivers||Core Audio drivers|
Note: Minimum requirements are established to ensure reasonable performance when default settings are used. Consider a more powerful computer if you plan to use large FFT sizes, or run many measurements at the same time.
*Smaart does not support “Windows on ARM”
**Must support Feature Level 12 / WDDM 2.0+
Licensing Information: Perpetual + Upgrade
A Perpetual License does not expire. A Perpetual License is billed in full for the cost of the license at the time of purchase and remains valid indefinitely for the specific edition and version of the software you are licensed for.
Perpetual Licenses are delivered via email and must be registered to a Smaart License Management Account (either new or existing) in order to access the installers for your license.
A Perpetual License is refundable within 30 days of purchase as long as it has not been registered to Smaart License Management account or installed on a computer. Once it has been registered and installed, it is non-returnable and non-refundable.
Perpetual licenses of Smaart Suite and Smaart RT come with 2 installation seats and perpetual licenses of Smaart LE and Smaart SPL come with 1 seat. Once a license has been registered, you can purchase additional seats for it through your Smaart License Management Account.
Perpetual Licenses can be upgraded to different editions of Smaart within the same version cycle (i.e. upgrading from Smaart RT v9 to Smaart Suite v9), and to subsequent versions upon their release (i.e. upgrading from Smaart Suite v9 to Smaart Suite v10). You do not lose your previous license when you upgrade.
An internet connection is required for the initial activation of a Perpetual License and for receiving updates. Once activated, Smaart perpetual licenses can be operated offline.
Support, including updates and bug fixes, is provided at no cost for the duration of the license as long as the version of Smaart you are licensed for is the most current release.
Licensing Information: Subscription
An Annual Subscription License starts on the day payment is received and continues for a period of one year. Annual Subscription Licenses are billed in full for the entire year at the beginning of the subscription period. Auto-renew is automatically selected as the default setting for the subscription and at the end of the subscription period, you will automatically be billed for an additional one-year subscription at then-current pricing.
Annual Subscription Licenses are 1-install only and additional installs cannot be purchased for, or added to, Subscription Licenses. If you wish to run Smaart on more than one computer, you will need to purchase a separate Annual Subscription License for each computer.
Annual Subscription Licenses require a periodic internet connection for license validation and renewal. If the computer on which your software is running is not connected to the internet at least once per month, your software may cease to function.
You can cancel your subscription from within your Smaart License Management account any time up to 24 hours prior to the end of the current subscription period and you will not be billed for future subscription periods. You will not receive a refund for any portion of the fees paid for the current subscription period unless legally required. See our Cancellation & Refund Policy for further details.
If you cancel your subscription, your Annual Subscription License will remain active, and you will be able to use Smaart, until the end of the current subscription period. Once the subscription period has ended, your Annual Subscription License will expire and Smaart will cease to function. If you wish to continue using Smaart, you will need to purchase a new Subscription License.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679516047.98/warc/CC-MAIN-20231211174901-20231211204901-00050.warc.gz
|
CC-MAIN-2023-50
| 7,560
| 71
|
https://szndcs.szondicsaba.hu/berente-timea
|
code
|
v1.0.1 - 2022.03.04.Changed Improved picture viewer js.
Changed Improved the picture upload input for admins.
v1.0.0 - 2022.02.23.Added Added user's settings page. Users now can edit their details or delete themselves.
v0.7.0 - 2022.02.11.Added Started to implement the translations.
v0.6.0 - 2022.02.06.Changed Changed the site main color scheme and add modals to the footer.
v0.5.0 - 2022.02.04.Added Admins now can edit uploaded files' details.
v0.4.5 - 2022.02.01.Added Admins now can delete users, or uploaded files.
v0.4.0 - 2022.01.30.Added Created ui for admins to manage shared visuals.
v0.2.0 - 2022.01.28.Changed Modified the users' ui.
v0.1.0 - 2022.01.24.Added Created the site with login feature,
Added Added database structure,
Added Added a simple ui for users to view shared visuals.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296945376.29/warc/CC-MAIN-20230325222822-20230326012822-00520.warc.gz
|
CC-MAIN-2023-14
| 800
| 12
|
http://programming-homework-help19269.blog5.net/11934864/online-programming-assignment-service-an-overview
|
code
|
our very best quality services speak each and every corner of the whole world. We have now helped much more than one thousand+ learners, Programming Help seekers and a lot of additional. I am offering you the ideal eleven reasons to decide on us for Programming Homework Help.
The simplest solution to evaluate the scale of a system is usually to depend the traces. This is the oldest and most widely applied size metric.
I did not have more than enough time for you to do the perform myself. Once the very long hesitations, I last but not least chose to position an order. My friend suggested me this enterprise and that was incredibly helpful. I acquired an ideal essay and I had been quite content.This evaluate on Trustpilot
I had been panicking about my advertising and marketing plan homework that was because of on an incredibly quick deadline. I had been presented a sample from my professor, but I could not do everything constructive. Lastly, I discovered allassignmenthelp.com for my assignment help. Following checking a particular assessments on Australian Internet sites, I set my believe in in allassignmenthelp.
Q: My university student is at the moment open enrolled at a middle faculty. Do we need to open up enroll in that middle college’s feeder highschool?
On building, toss a ProductException In case the product or service quantity won't include 3 digits, if the worth is fewer than $0.01, or if the value is around $one,000. Help you save the class as Product.java. Publish an software that establishes not less than 4 Products objects with valid useful reference and invalid values. Show an ideal information when a Product item is established properly and when 1 is just not.
All the operate should be Employed in accordance with the appropriate policies and relevant rules. We have been employing Google Analytics to improve your working experience. No own facts is becoming tracked.
Strains = Quantity of strains This really is The only line rely. Each line ends with a line split, usually CR+LF. LINES counts each line, whether it is a code, a remark or an empty line.
You have till December 15th at 4:00pm to accept an open up enrollment present from a school through the EngagED dad or mum portal.
Java has often been a leading demanding language amongst the students. For Learn More Here anyone who is Personal computer science, folks, you should be learning Item Oriented Programming ideas.
Thank you so much for these kinds of an awesome position! click here for more I'd two times only to get ready the study and was trying to find the help. To inform the reality I'd concerns about the quality of the paper. After i obtained the paper, I realized that every thing was suitable. Nic... Display full evaluate on "Trustpilot"
2nd round open up enrollment is "initial arrive first served." Students requesting open enrollment only in the 2nd round are placed on the waitlist driving people who are at the moment around the waitlist from 1st spherical. Universities will ONLY achieve out to you when and if a place will become available.
A result in will also be altered. Following the upper illustration, the slave desires his Main individuality being Lively in a very minimal stimulating setting. Just before the electro shock gets initiated, a single should utilize the asked for cause like a stimulus.
Auspicious Conveyance: A because of date is a owing date to the C++ programming assignment professionals at Onlineassignmenthelp. We comprehend your notoriety for getting review an understudy relies on the opportune accommodation of the homework assignments and acquire right after rigorous because of dates as demands be.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376823817.62/warc/CC-MAIN-20181212091014-20181212112514-00003.warc.gz
|
CC-MAIN-2018-51
| 3,661
| 14
|
http://racestud.com/forums/topic/62287-hey-vicki-guess-what-we-won/page-2
|
code
|
You think! Lmao!
Jump to content
“Hey Vicki. Guess what. We won”
24 replies to this topic
Posted 16 July 2017 - 05:51 PM
All of the debate and looks like I was right, but I could have told you that already. If you cant beat em, cheat I suppose. Look forward to seeing how Rush handles this.
Edited by #TheTruth, 16 July 2017 - 05:54 PM.
Posted 16 July 2017 - 06:36 PM
looks like you were right . but why does the tire scrub boy on the 22 car care about crate racers at a dieing track ?
0 user(s) are reading this topic
0 members, 0 guests, 0 anonymous users
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-22/segments/1526794864999.62/warc/CC-MAIN-20180522225116-20180523005116-00404.warc.gz
|
CC-MAIN-2018-22
| 561
| 11
|
https://fry-electronics.com/propy-partners-with-abra-to-provide-crypto-backed-home-loans/
|
code
|
Propy partners with Abra to provide crypto-backed home loans
Blockchain real estate platform Propy has partnered with Abra to enable customers to obtain home loans with their cryptocurrency holdings, potentially expanding the financial use cases of digital assets.
Propy clients can now pledge digital assets as collateral for their property purchases through Abra Borrow, a cryptocurrency lending and borrowing service. Crypto-collateral pledged to Abra will be used to borrow US dollars, which can then be used for home purchases.
The Propy blockchain records the entire transaction process and serves as a technical and legal framework for buyers and sellers. According to Propy, the blockchain records the transaction, whether it’s in crypto, non-fungible tokens (NFT), or traditional fiat currency.
Abra is a crypto-focused wealth management platform that has been around since 2014. The platform allows users to generate income from their cryptos, borrow dollars against their holdings and trade digital assets. Abra has received backing from several major companies, including American Express’ venture capital arm, Amex Ventures, which contributed to its $55 million Series C funding round in September 2021.
While early crypto investors have amassed significant fortunes over the years, their access to traditional financial products like mortgages remains limited. Decentralized finance or DeFi applications are trying to fill the gap. As Cointelegraph reported, a new homeowner in Austin, Texas, recently purchased a property through a mortgage from USDC.homes, a crypto lending service based on Circle’s USD coin (USDC).
If you buy a home in the future, you will likely use NFTs. Here’s how crypto is transforming real estate in the meantime. https://t.co/jiLT9Uojvd
— Cointelegraph (@Cointelegraph) February 19, 2022
Related: Web3 solutions aim to make the American real estate market more accessible
Fintech startup Milo is also offering crypto mortgages to homebuyers looking to use their Bitcoin (BTC) as collateral. Meanwhile, in September 2021, decentralized mortgage lender Bacon Protocol launched a program that allows homeowners to exchange a lien on their property for an NFT, which represents a percentage of the property they purchase.
https://cointelegraph.com/news/propy-partners-with-abra-to-provide-crypto-backed-real-estate-loans Propy partners with Abra to provide crypto-backed home loans
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296949025.18/warc/CC-MAIN-20230329182643-20230329212643-00589.warc.gz
|
CC-MAIN-2023-14
| 2,429
| 11
|
http://doublesuited.blogspot.com/2005/02/its-been-while.html
|
code
|
i know I know and i have alot to say. so there should be alot of
posts coming fast.
- No matter your political affiliation, you should check out "Flying
Blind" by Michael Smerkonish. It reveals some scary things about how
political correctness is compromising airline security even after
9/11. I don't want to give anything away, but airlines are fined if
they search too many people of middle eastern descent (or any other
nationality) EVEN IF THEY HAVE A REASON TO DO SO.
- for those who don't know me that well, this Wednesday was one of my
favorite dates of the year-- the State of the Union. Even when I
don't like the President, I think it is a great time to reflect on
where we are going as a country. I congrats the President for having
the balls to demand change in social security and even politically
unattractive options like raising the retirement age. While I don't
believe completely in priviatization, I admire someone who speaks
their mind without worrying about polling data.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676591596.64/warc/CC-MAIN-20180720115631-20180720135631-00331.warc.gz
|
CC-MAIN-2018-30
| 993
| 16
|
http://pineviewfarm.net/2009/07/bonus-bozos/
|
code
|
Paul Collier in the Guardian:
The inherent problem facing shareholders is that incentive payments cannot go negative. However much damage a manager inflicts, wiping out both shareholders and depositors, the consequences cannot be remotely commensurate.
Faced with a corpse and a killer, police do not need to prove ill intent: manslaughter sets the hurdle lower than murder. It is enough to show the killer was irresponsible. That is the standard we need; we need a crime of managing a bank irresponsibly: in other words, bankslaughter.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710421.14/warc/CC-MAIN-20221210074242-20221210104242-00800.warc.gz
|
CC-MAIN-2022-49
| 536
| 3
|
https://cord.cranfield.ac.uk/articles/dataset/Data_underpinning_Green_scheduling_of_a_two-machine_flowshop_Trade-off_between_makespan_and_energy_consumption_/4902110/1
|
code
|
Data underpinning "Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption"
Sustainability considerations in manufacturing scheduling, which is traditionally influenced by service ori- ented performance metrics, have rarely been adopted in the literature. This paper aims to address this gap by incorporating energy consumption as an explicit criterion in shop floor scheduling. Leveraging the vari- able speed of machining operations leading to different energy consumption levels, we explore the potential for energy saving in manufacturing. We analyze the trade-off between minimizing makespan, a measure of service level and total energy consumption, an indicator for environmental sustainability of a two-machine sequence dependent permutation flowshop. We develop a mixed integer linear multi-objective optimization model to find the Pareto frontier comprised of makespan and total energy consumption. To cope with com- binatorial complexity, we also develop a constructive heuristic for fast trade-off analysis between makespan and energy consumption. We define lower bounds for the two objectives under some non-restrictive condi- tions and compare the performance of the constructive heuristic with CPLEX through design of experiments. The lower bounds that we develop are valid under realistic assumptions since they are conditional on speed factors. The Pareto frontier includes solutions ranging from expedited, energy intensive schedules to pro- longed, energy efficient schedules. It can serve as a visual aid for production and sales planners to consider energy consumption explicitly in making quick decisions while negotiating with customers on due dates. We provide managerial insights by analyzing the areas along the Pareto frontier where energy saving can be justified at the expense of reduced service level and vice versa.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679099942.90/warc/CC-MAIN-20231128183116-20231128213116-00294.warc.gz
|
CC-MAIN-2023-50
| 1,883
| 2
|
http://geothompson.co.uk/2012/
|
code
|
I'm all over the web, check me out!
I've been using Forrst
for the past year I post samples of the work I am doing, take a look. I use Twitter
, who doesn't right? Follow me.
Contact me via the contact form for live previews of my previous work and for quotes.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-34/segments/1502886109470.15/warc/CC-MAIN-20170821172333-20170821192333-00479.warc.gz
|
CC-MAIN-2017-34
| 260
| 5
|
https://community.particle.io/t/why-does-wire-use-single-threaded-section/19547
|
code
|
I am curious why SINGLE_THREADED_SECTION() is used throughout TwoWire, the class for I2C Wire. This seems to be one of the few places where SINGLE_THREADED_SECTION() is used in the system firmware.
Could someone explain why TwoWire needs SINGLE_THREADED_SECTION()?
I have written an I2C library, I2cMaster, that allows large I2C transfers and I also disabled scheduling in this class for I2C transfers.
I am would prefer to not disable scheduling since a 250 byte transfer at 100kHz could take about 25 ms.
I have written I2cMaster so delays should be OK for devices that allow SCL clock stretching.
It was added in response to this issue: https://github.com/spark/firmware/issues/698
I too would prefer not to have to disable task switching, but we didn’t see any other solution.
We’re open to suggestions if there is a way to keep I2C reliable as well as with task switching!
I happen to have several of the MCP23017 I/O Expander chips mentioned this issue.
I will experiment to see what I can find.
After a lot of experiments, I now think the problem is not task switching but a bug in not waiting for the stop condition to complete correctly in endTransmission().
SINGLE_THREADED_SECTION() insures a bit of delay between back-to-back endTransmission()/requestFrom() calls.
See this issue I added: https://github.com/spark/firmware/issues/854
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-21/segments/1652662562106.58/warc/CC-MAIN-20220523224456-20220524014456-00375.warc.gz
|
CC-MAIN-2022-21
| 1,349
| 13
|
https://www.gapmod.com/2018/10/pes-jogress-v35-iso-ppsspp-full.html
|
code
|
Download Pes Jogress v3.5 ISO PPSSPP Full Transfer 2019 - Link download updates for the Jogress PSP game on Android using the PPSSPP emulator available. Along with the information and surface, this entertainment is for Android PPSSPP, so remember to use the emulator. There are many variants of PES Jogress Evolution 2018 ISO PPSSPP the latest transfer patch updates. It would be ideal if you for individuals who need to try playing, joining can now be accessed at gapmod.com. Here are some screenshots that you can see before you download the game.
Pes Jogress v3.5 ISO PPSSPP Full Transfer 2019 League 1 Indonesia
- Name of File : Pes Jogress v3.5 ISO PPSSPP Full Transfer 2019 League 1 Indonesia
- Versions : 3.5
- Supported Android : 4.0 Up
- Size File : 590 Mb
- Credits to : Jogress Team
- More Info : Google Play
- Post Update : PES 2019 English Version V7 PPSSPP
How To Install [[ PLEASE READ ]]
- Download the Game, and then install and Play it.
- For a game that uses the Data/Obb in its game, don't forget to download the "Obb" files/"SD" file, before you play it.
- If the File is .zip or. rar files. Then, Extract the first File to your sdcard. (If asked for a password, enter: www.gapmod.com).
- Then move the extracted folder to the location: /sdcard/Android/obb or if it has not been successful, you can put it in: /phone/Android/obb.
- After that, you go to the game and play. Completed.
How to install the Textures PPSSPP:
- Download Textures Jogress v3 All Liga Update Transfer 2018
- Extract files using the RAR application (ZArchive, RAR, File Explorer or something else)
- Move the TEXTURE to Folder PSP -> TEXTURE
- Open the PPSSPP Mod texture application, open PES
Supported for Android version:
For Android: v4.0 – v4.0.4 [Ice Cream Sandwich], v4.1 – v4.3.1 [Jelly Bean], v4.4 – v4.4.4 [KitKat], v5.0 – v5.0.2 [Lollipop], v6.0 [Marshmallow], and UP.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038887646.69/warc/CC-MAIN-20210419142428-20210419172428-00464.warc.gz
|
CC-MAIN-2021-17
| 1,882
| 22
|
https://www.groundai.com/project/sustaining-the-internet-with-hyperbolic-mapping/
|
code
|
Sustaining the Internet with Hyperbolic Mapping
The Internet infrastructure is severely stressed. Rapidly growing overheads associated with the primary function of the Internet—routing information packets between any two computers in the world—cause concerns among Internet experts that the existing Internet routing architecture may not sustain even another decade. Here we present a method to map the Internet to a hyperbolic space. Guided with the constructed map, which we release with this paper, Internet routing exhibits scaling properties close to theoretically best possible, thus resolving serious scaling limitations that the Internet faces today. Besides this immediate practical viability, our network mapping method can provide a different perspective on the community structure in complex networks.
In the Information Age, the Internet is becoming a de facto public good, akin to roads, airports, or any other critical infrastructure Gehring (2004). More than a billion people are estimated to use the Internet every day to communicate, search for information, share data, or do business Internet World Stats (). On-line social networks are becoming an integral part of human social activities, increasingly affecting human psychology Lazer et al. (2009). Underlying all these processes is the Internet infrastructure, composed, at the large scale, of connections between Autonomous Systems (ASs). An AS is, roughly, a part of the Internet owned and administered by the same organisation Hawkinson and Bates (1996). ASs range in size from small companies, or even private users, to huge international corporations. There is no central Internet authority dictating to any AS what other ASs to connect to. Connections between ASs are results of local independent decisions based on business agreements between AS pairs. This lack of centralised engineering control makes the Internet a truly self-organised system, and poses many scientific challenges. The one we address here is the sustainability of Internet growth.
The Internet has been growing fast according to all measures Dhamdhere and Dovrolis (2008); Carpenter (2009). For example, the number of ASs increases by approximately every year Dhamdhere and Dovrolis (2008). Despite its growth, the Internet must sustainably perform its primary task—routing information packets between any two computers in the world. But can this function be really sustained? To route information to a given destination in the Internet today, all ASs must collectively discover the best path to each possible destination, based on the current state of the global Internet topology. As the number of destinations grows quickly, the amount of information each AS has to maintain becomes a serious scalability concern, endangering the performance and stability of the Internet Meyer et al. (2007). Worse yet, the Internet is not static. Its topology changes constantly due to failures of existing links and nodes, or appearances of new ones. Each time such a change occurs anywhere in the Internet, the information about this event must be diffused to all ASs, which have to quickly process it to recompute new best routes. The constantly increasing size and dynamics of the Internet thus leads to immense and quickly growing routing overheads, causing concerns among Internet experts that the existing Internet routing architecture may not sustain even another decade Meyer et al. (2007); Atkinson and Bennett (2009); Godfrey et al. (2009); Gammon (2010); parts of the Internet have started sinking into black holes already Katz-Bassett et al. (2008).
The scaling limitations with existing Internet routing stem from the requirement to have a current state of the Internet topology distributed globally. Such global knowledge is unavoidable since routing has no source of information other than the network topology. Routing in these conditions is equivalent to routing using a hypothetical road atlas, which has no geographic information, but just lists road network links, which are pairs of connected road intersections, abstractly identified. This analogy with road routing suggests that there are better ways to find paths in networks. Suppose we want to travel from one geographic place to another. Given the geographic coordinates of our starting point and destination, we can readily tell what direction brings us closer to our destination. We see that a coordinate system in a geometric space, coupled with a representation of the world in this space, simplify drastically our routing task. For simple and efficient network routing we thus need a map. Constructing such a map for the Internet boils down to assigning to each AS its coordinates in some geometric space, and then using this space to forward information packets in the right directions toward their destinations. Greedy forwarding implements this routing in the right direction: upon reading the destination address in the packet, the current packet holder forwards the packet to its neighbour closest to the destination in the space. This greedy strategy to reach a destination is efficient only if the network map is congruent with the network topology. In the analogy with road routing, for example, this congruency condition means that there should exists a road path that stays approximately close to the geographic geodesic between the trip’s starting and ending points. If the congruency condition holds, then the advantage of greedy forwarding is twofold. First, the only information that ASs must maintain is the coordinates of their neighbours. That is, ASs do not have to keep any per-destination information. Second, once ASs are given their coordinates, these coordinates do not change upon topological changes of the Internet. Therefore, ASs do not have to exchange any information about ever-changing Internet topology. Taken together, these two improvements essentially eliminate the two scaling limitations mentioned above.
In our recent work Boguñá et al. (2009); Boguñá and Krioukov (2009); Krioukov et al. (2009a); Papadopoulos et al. (2010) we have shown that greedy forwarding is indeed efficient in Internet-like synthetic networks embedded in geometric spaces, and that this efficiency is maximised if the space is hyperbolic. However, putting these ideas in practice needs a crucial piece of information: a map of the real Internet in a hyperbolic space. Here we present a method to find such a map.
Our method uses statistical inference techniques to find coordinates for each AS in the hyperbolic space underlying the Internet. Guided by the inferred coordinates, greedy forwarding in the Internet achieves efficiency and robustness, similar to those in synthetic networks. We also find that the method maps geo-politically close ASs close to each other in the hyperbolic space. This finding suggests that our mapping method can be used for soft community detection in real networks, where by soft communities we mean groups of geometrically close nodes.
Ii The model
To build a geographic map, one first has to model the Earth surface, e.g., by assuming that it is a sphere. Similarly, we also need a geometric model of the Internet space to build our map. The simplest candidate space is also a sphere, or even a circle, on which nodes are uniformly distributed, and connected by an edge with probability decreasing as a function of distance between nodes, conceptually similar to random geometric graphs Penrose (2003). However, this model fails to capture basic properties of the Internet topology, including its scale-free node degree distribution. In Serrano et al. (2008), we showed that to generate realistic network topologies in this geometric approach, we first have to assign to nodes their expected degrees drawn from a power-law distribution, and then connect pairs of nodes with expected degrees and with probability , where is distance rescaled by the product of the expected degrees, . We thus have a hybrid model that mixes geometry and topology—geometric characteristics, distances used in random geometric graphs, come in tandem with topological characteristics, expected degrees used in classical configuration models of random power-law graphs Chung and Lu (2002). If we associate the expected degree of a node with its mass, then the connection probability , which is a measure of the interaction strength between two nodes, resembles Newton’s law of gravitation. Therefore we call this model Newtonian. However, according to Einstein, we can treat gravity in purely geometric terms if we accept that the space is no longer flat, i.e., if it is non-Euclidean. Following this philosophy we showed in Krioukov et al. (2009b); Krioukov et al. (2010) that the Newtonian model is isomorphic to a purely geometric network model with node degrees transformed into a geometric coordinate making the space hyperbolic, i.e., negatively curved. We call this model Einsteinian.
The main property of hyperbolic geometry is the exponential expansion of space illustrated in Fig. 1. For example, the area of a two-dimensional hyperbolic disc of radius grows with as . Consequently, if we distribute nodes uniformly or quasi-uniformly over a hyperbolic disc, then from the Euclidean perspective their density will grow exponentially with the distance from the disc centre. We illustrate this effect in Fig. 2, where we visualise a small-size sample network generated by our Einsteinian model. In the model, nodes are indeed distributed (quasi-)uniformly within a hyperbolic disc of radius , which is a function of the network size. We see that the angular node density appears uniform, but the radial one does not—the number of nodes grows exponentially as we move away from the origin. The figure also shows a triangle connecting origin , and two nodes and by hyperbolic geodesics, i.e., hyperbolically straight lines. The two geodesics emanating from the origin , and , are radial straight lines, and their hyperbolic lengths are equal to the radial coordinates of and : and . However, the hyperbolic geodesic between nodes and does not appear as a Euclidean straight line, and its length is given by the hyperbolic law of cosines
where is the angle between and . (The same formula with can be used to compute and .) Upon distributing nodes over the disc as described, we form scale-free networks in the model by connecting each pair of nodes and located at hyperbolic distance with the connection probability
almost identical to the Fermi-Dirac distribution in statistical mechanics. It depends only on hyperbolic distances (link energies), hyperbolic disc radius (chemical potential), and parameter (temperature) controlling network clustering. This connection probability results in average node degrees exponentially decreasing with the distance from the origin, which we also observe in Fig. 2. The combination of an exponentially increasing node density and exponentially decreasing average degree yields a power-law node degree distribution in the network. See Appendix A for further details.
Iii The mapping method
As our goal is to build a realistic Internet map, ready for routing and other applications, we have to find for each AS its radial and angular coordinates maximising the efficiency of greedy forwarding. This specific task of maximising greedy forwarding efficiency calls for a mapping method different from existing techniques on embedding Internet distances and graphs Tang and Crovella (2003); Shavitt and Tankel (2004, 2008). In view of our previous findings Boguñá et al. (2009); Boguñá and Krioukov (2009); Krioukov et al. (2009a); Papadopoulos et al. (2010) that greedy forwarding is exceptionally efficient in Internet-resembling synthetic networks, and that this efficiency is maximised in the Einsteinian model, our strategy for the Internet map construction is to maximise the congruency between the map and the model. In statistical inference Cox (2006), this goal is equivalent to maximising the likelihood that the observed data, i.e., the Internet topology, has been produced by the model. This likelihood is given by
where the elements of the Internet adjacency matrix are equal to whenever there exists a connection between ASs and , and to otherwise. While the adjacency matrix represents the observed data, the connection probability depends via Eqs. (2,1) on the AS coordinates , which we try to infer. Our best estimate for these coordinates are then those maximising the likelihood in Eq. (3).
Although there are a plenty of methods to find maximum-likelihood solutions, e.g., the Metropolis-Hastings algorithm Newman and Barkema (1999), they perform poorly and do not scale well on large datasets with abundant local maxima, which is the case with the Internet. Therefore, as important as a maximisation method is a heuristic approach helping the maximisation algorithm to find the optimal solution in a reasonable amount of time and with reasonable computational resources. Our method is based on the following remarkable property of networks in our model; the same property holds for the Internet Serrano et al. (2008). Let be a given network with average degree and power-law degree distribution , and let be ’s subgraph composed of nodes with degree larger than some threshold , along with the connections among these nodes. The average degree in is then given by Serrano et al. (2008). In scale-free networks with exponent between and , this internal average degree is thus a growing function of , which implies that subgraphs made of high degree nodes almost surely form a single connected component. Using this property along with the statistical independence of the graph edges, it becomes possible to infer coordinates of ASs in ignoring the remainder of the AS graph. This property is practically important because the size of decreases very fast as increases, which speeds up likelihood maximisation algorithms tremendously. In a nutshell, our method starts with a subgraph small enough for standard maximisation algorithms being able to reliably and quickly infer the coordinates of ASs in . Once these are found, we gradually increase to iteratively add layers of lower-degree ASs. While doing so, we use the already inferred AS coordinates as a reference frame to assign initial coordinates to newly added ASs. This initial coordinate assignment significantly improves the convergence time of maximisation algorithms. All other details of our mapping method can be found in Appendix B.
Iv Mapping results
We apply our mapping method to the Internet AS topology extracted from the Archipelago project data Claffy et al. (2009) in June 2009 and described in Appendix C, and visualise the results in Fig. 3. We observe striking similarity between this visualisation and the synthetic Einsteinian network in Fig. 2. To confirm that the Internet map we have obtained is indeed congruent with the Einsteinian model, we juxtapose in Fig. 4 the empirical connection probability between ASs in the obtained Internet map against the theoretical one in Eq. (2). We observe a clear similarity between the two. Neither the sphere is a perfect model of the Earth, nor the Einsteinian model is an ideal abstraction of the Internet structure. Yet, the observed similarity between the empirical and theoretical connection probabilities in Fig. 4 suggests that hyperbolic metric spaces coupled with Fermi-like connection probabilities are reasonable representations of the real Internet space.
To investigate further the connections between the obtained map and Internet reality, we show in Fig. 3 the average angular position of all ASs belonging to the same country, while in Fig. 5 we draw the angular distributions of those ASs. Surprisingly, we find that even though our mapping method is completely geography-agnostic, it discovers meaningful groups or communities of ASs belonging to the same country. Furthermore, in Fig. 3 we find many cases of geographically or politically close countries placed close to each other in our hyperbolic map. The explanation of these surprising effects is rooted in the peculiar nature of our mapping method. If ASs belonging to the same country, geographic region, or geo-political or economic group are connected more densely to each other than to the rest of the world, then this higher connection density translates to a higher attractive force that tries to place all such ASs close to each other in our map. Indeed, the term in Eq. (3) corresponds to the attractive force between connected nodes, while the term is the repulsive force between disconnected ones. This peculiar interplay between attraction within densely connected regions, and repulsion across sparsely connected zones, effectively maps closely the ASs belonging to densely connected AS groups. These observations build our confidence that our mapping method provides meaningful results reflecting peculiarities of the real Internet structure, and suggest that the method can be adapted to discover the community structure Girvan and Newman (2002); Newman (2006); Danon et al. (2007) in other complex networks.
V Routing results
The obtained Internet map is ready for greedy forwarding. An AS holding a packet reads its destination AS coordinates, computes the hyperbolic distances between this destination and each of its AS neighbours using Eq. (1), and forwards the packet to the neighbour closest to the destination. To evaluate the performance of this process, we perform greedy forwarding from each source to each destination AS, and compute several performance metrics.
The first metric is success ratio, which is the percentage of greedy paths that successfully reach their destinations. Not all paths are expected to be successful as some might run into local minima. For example, an AS might forward a packet to its neighbour who sends the packet back to the same AS, in which case the packet will never reach the destination. We declare a path unsuccessful, if the packet is sent to the same AS twice. The average success ratio of simple greedy forwarding in our Internet map is remarkably high, , and more sophisticated greedy forwarding techniques, such as those described in Cvetkovski and Crovella (2009), can boost it to .
Given the discussed connections between our Internet map and geography, one may conjecture that greedy forwarding simply mimics geographic routing following the geographically shortest paths. However, this conjecture is not true. Geography is reflected in our map only along the angular coordinate, while the radial coordinate is a function of the AS degree, making the space hyperbolic, see Appendix A. The geographic space is not hyperbolic, and if we use it for greedy forwarding, we obtain a much lower success ratio of approximately . We also tested modified geographic routing that tries to intelligently use AS degrees, in spirit of our Einsteinian model. Nevertheless, this modification, although improving the success ratio to , still fails short compared to the results obtained using our hyperbolic map. The details of these experiments with geographic routing are in Appendix E.
The second metric is stretch, which tells us by how much longer the greedy paths are, compared to shortest paths in the Internet topology. The average stretch is low, . The average hop-wise length of the shortest paths between selected sources and destinations is , so that the average length of greedy paths is . The low value of stretch indicates that greedy paths are close to optimal, i.e., shortest paths. The shortest path between nodes and in Fig. 2, for example, is also the path found by greedy forwarding. Somewhat unexpectedly, the greedy stretch is asymptotically optimal, i.e., equal to , in scale-free, strongly clustered networks regardless what underlying space is used for greedy forwarding Boguñá and Krioukov (2009). Low stretch also implies that greedy forwarding causes approximately the same traffic load on nodes as shortest-path forwarding. Given that shortest-path forwarding does not lead to high traffic load in scale-free networks Gkantsidis et al. (2003), this finding allays concerns that hyperbolic forwarding may cause traffic congestion abnormalities Jonckheere et al. (2010). More details on this topic are in Appendix F.
The two metrics above characterise the performance of greedy forwarding in the static Internet topology. More important than that is how greedy forwarding performs in the dynamic topology, where links and nodes can fail. We randomly select a percentage of links and nodes, remove them from the mapped Internet, recompute the success ratio and stretch after the removal, and present the result in the top plots of Fig. 6. Even upon simultaneous failures of up to of AS links or nodes—catastrophic events never happened in the Internet history—we observe only minor degradation of the performance of greedy forwarding. That is, even catastrophic levels of damage to the Internet does not significantly affect the performance of greedy forwarding, even though no AS changes its position on the hyperbolic map.
A widely popularized feature of complex networks is their robustness with respect to random failures, and the lethality of failures of highest-degree hubs Albert et al. (2001); Jeong et al. (2001). As expected we observe in the bottom plots of Fig. 6 that removals of such hubs have a more detrimental effect on greedy forwarding as well. However, targeted removal of highest-degree ASs in the Internet is a rather unrealistic scenario since these large ASs consist of thousands of routers whose simultaneous failure is a very rare and unlikely event. The explanation for the surprising efficiency of greedy forwarding with respect to random failures lies in the unique combination of the following two properties exhibited by scale-free, strongly clustered networks: high path diversity Gkantsidis et al. (2003), and congruency between hyperbolic geodesics and topologically shortest paths Papadopoulos et al. (2010); Krioukov et al. (2009b); Krioukov et al. (2010). The latter is illustrated by the similar path patterns of the hyperbolic geodesic and topologically shortest path between nodes and in Fig. 2: they both first go to the high-degree core of the network, and then exit it in the appropriate direction to the destination. Due to high path diversity, there are many disjoint shortest paths between the same source and destination, and thanks to the congruency, they all stay close to the corresponding hyperbolic geodesics. Link and node failures affect some shortest paths, but others remain, and greedy forwarding can still find them using the same hyperbolic map.
Another form of Internet dynamics is its rapid growth over years Dhamdhere and Dovrolis (2008); Carpenter (2009); Pastor-Satorras and Vespignani (2004); Crovella and Krishnamurthy (2006). We show in Appendix G that if the existing ASs keep their hyperbolic coordinates fixed, while the ASs joining the Internet anew compute their coordinates using local information, then the performance of greedy forwarding does not significantly degrade, even at long time scales. In a nutshell, the existing AS coordinates are essentially static, as they can stay the same for years.
Existing Internet topology measurements including the Archipelago data Claffy et al. (2009) are known to be incomplete and miss some AS links. Therefore a natural question is how this missing information affects the quality of the constructed map, and the performance of greedy forwarding in it. Intuitively, since the performance of greedy forwarding is robust with respect to link removals, then we might expect it to be robust with respect to missing links as well. Moreover, if the constructed map is used in practice, then greedy forwarding will see and use those links that topology measurements do not see. We might thus also intuitively expect greedy forwarding to perform better in practice than we report in this section, simply because those missing links, when used by greedy forwarding, would provide additional shortcuts between potentially remote ASs. We confirm this intuition in Appendix H with experiments emulating the missing link issue. Therefore the routing results reported here should actually be considered as lower bounds for greedy routing performance that can be achieved in practice using the constructed hyperbolic Internet map.
We have constructed a hyperbolic map of the Internet, and release this map with this paper BoP (). The map can be used for essentially infinitely scalable Internet routing. The amount of routing information that ASs must maintain is proportional to the AS degree, which is theoretically best possible since ASs must always keep some information about their neighbours. Routing communication overheads are also minimised, since ASs do not exchange any routing information upon dynamic changes of the AS topology. The presented solution thus achieves routing efficiency close to theoretically optimal, and resolves serious scaling limitations that the Internet faces today.
The mapping method we have employed is generic, and can be applied to other complex networks with underlying metric structures and heterogeneous degree distributions. We showed in Serrano et al. (2008) that a good indicator for the presence of an underlying metric structure is self-similarity of clustering in the network, while in Krioukov et al. (2009b); Krioukov et al. (2010) we showed that as soon as a metric space is present, and the network has a heterogeneous degree distribution, the metric distances can be rescaled such that the underlying geometry is effectively hyperbolic. Roughly, self-similar clustering is responsible for the metric structure along the angular coordinate, while degree heterogeneity adds the radial dimension, and makes the space hyperbolic. Applied to other networks, our mapping method can provide a different perspective on the community structure in networks. Instead of trying to split nodes into discrete community sets Girvan and Newman (2002); Newman (2006); Danon et al. (2007), it would naturally yield a continuous measure of similarity between nodes based on hyperbolic distances. More similar nodes would be located closer to each other, and form zones of higher connectivity density. It would be then up to an experimenter to define communities, if needed, as histograms of the node density in the hyperbolic space. The spectrum of potential applications of this network-mapping geometrisation agenda is wide. Network mapping can reveal geometric forces effectively driving information signaling in the network; examples include the brain Bullmore and Sporns (2009) and cell signaling networks Charlebois (2009). One can then potentially predict what network perturbations drive these networks to failures, such as brain disorders or cancer. Other applications range from recommender systems Monroe (2009), where to have the right measure of similarity between consumers is a key, to epidemic spreading Meloni et al. (2009) and information theory of networks Bianconi et al. (2009).
We have shown that the Internet hyperbolic map is remarkably robust with respect to even substantial perturbations of the Internet topology, implying that this map is essentially static. It does not significantly depend on topology dynamics, and can thus be computed only once. This property is desirable in view of long running times intrinsic to likelihood maximisation algorithms. Our method improves their running times drastically, and the Internet map computations take approximately a day on a modern computer. However, for substantially larger networks the running times may still be prohibitive even for one-time mapping. Therefore, alternative methods for network mapping, not relying on likelihood maximisation, are highly desirable, and our work in this direction is underway.
Appendix A The Einsteinian and Newtonian models of complex networks
To synthesise a network with our Einsteinian model, one has first to specify any desired network size , average degree , average clustering , and exponent of the power-law distribution of node degrees , . Equipped with these target properties of the network topology, we first distribute quasi-uniformly nodes within a hyperbolic disc of radius , where is given by
and is a function of . In the hyperbolic plane, the quasi-uniform node density means that the node angular coordinates are distributed uniformly, while their radial coordinates are distributed with density
where . Once all nodes are in place specified by their assigned coordinates, the hyperbolic distance between each pair of nodes and located at and is computed using Eq. (1). Given these distances, each pair of nodes and is then connected by a link with probability given by Eq. (2). After each node pair is examined and connected with probability , the network is formed, and we can compute the average degree of nodes located at distance from the origin. The result is
Appendix B Mapping methods
To find our hyperbolic Internet map, we use the equivalence between the Einsteinian– Krioukov et al. (2009b); Krioukov et al. (2010) and the Newtonian– Serrano et al. (2008) models. This equivalence establishes a relationship in Eq. (7) between the expected degree of a node in the Newtonian– model, and its radial coordinate in the Einsteinian– model The angular coordinate is the same in both models. Thus, for a given node we aim to find its expected degree and angular coordinate, , that best match the Newtonian– model. We then use the -to- mapping to place nodes in the hyperbolic plane according to the Einsteinian– model.
Thanks to their equivalence, the Newtonian– and Einsteinian– models generate statistically the same network topologies. However, the efficiency of greedy forwarding in the Einsteinian– model is higher, because hyperbolic geodesics are exceptionally congruent with the topologically shortest paths in scale-free networks Krioukov et al. (2009b); Krioukov et al. (2010); Krioukov et al. (2009a). The reason for this congruency is that the effective distance used as an argument of the connection probability in the Newtonian– is actually hyperbolic Krioukov et al. (2009b); Krioukov et al. (2010), and the Einsteinian– model simply translates this effective distance to the real hyperbolic one. For these reasons we prefer the Einsteinian– model for routing purposes, although we use the Newtonian– one to find the Internet map. We could use directly the Einsteinian– model for this purpose, but the Newtonian– model is technically simpler since the statistical inference in it can be performed independently for the two variables and .
We first recall the Newtonian– model, which generates networks according to the following steps:
Distribute nodes uniformly over the circle of radius , so that the node density on the circle is fixed to
Assign to all nodes a hidden variable representing their expected degrees. To generate scale-free networks, is drawn from the power-law distribution
where is the minimum expected degree, and is the network average degree
Let and be the expected degrees of two nodes located at distance measured over the circle, where is the angular distance between the nodes. Connect each pair of nodes with probability , where the effective distance , and is a constant fixing the average degree.
The connection probability can be any integrable function. Here we chose the Fermi-Dirac distribution
where is a parameter that controls clustering in the network. With this connection probability, parameter becomes
The expected degree of a node with hidden variable is and, therefore, the degree distribution scales as for large .
To go from the Newtonian– to the Einstenian– models, we leave the angular coordinate unchanged, while the radial coordinate of a node with expected degree is given by
where the radius of the hyperbolic disk containing all nodes is
b.1 General theory behind likelihood maximization
We now fit the real AS graph to the model. Specifically, given the measured AS graph, we aim to find the set of coordinates , , that best match the Newtonian– model in a statistical sense. To do so, we use maximum likelihood estimation (MLE) techniques. Let us compute the posterior probability, or likelihood, that a network given by its adjacency matrix is generated by the Newtonian– model, . This probability is
where function within the integral is the joint probability that the model generates the adjacency matrix , and the set of hidden variables . Using Bayes’ rule, we find the likelihood that the hidden variables take particular values in the network given by its observed adjacency matrix
is the prior probability of the hidden variables given by the model,
is the likelihood of finding if the hidden variables are , and
The MLE values of the hidden variables are then those that maximize the likelihood in Eq. (15) or, equivalently, its logarithm,
where is independent of and .
b.2 MLE for expected degrees
The derivative of Eq. (20) with respect to expected degree of node is
The first term within the parenthesis is the expected degree of node , while the second term is its actual degree . Therefore, the value that maximizes the likelihood is given by
Since can be smaller than in the last equation, we set
We discuss a correction of this equation accounting for finite size effects is Section B.4.2.
b.3 MLE for angular coordinates
Having found the MLE values for expected degrees , we now have to maximize Eq. (15) with respect to angular coordinates . This task is equivalent to maximizing the partial log-likelihood
The first term in this equation involves only pairs of connected nodes, whereas the second term accounts for pairs of disconnected ones. Since the connection probability is a monotonously decreasing function of the effective distance , the first term in Eq. (24) is large if pairs of connected nodes are placed close to each other. In contrast, the second term is large if pairs of disconnected nodes are far apart. Therefore the optimal MLE solution will balance both effects, and place connected nodes as close as possible while keeping disconnected ones as far as possible.
Unfortunately, the maximization of Eq. (24) with respect to the angular coordinates cannot be performed analytically. We thus have to rely on approximations. At their core lie MLE algorithms, or kernels, which we discuss first. We present two such kernels, standard Metropolis-Hastings (SMH) Newman and Barkema (1999), and our “localized” version of it (LMH).
In the standard Metropolis-Hastings (SMH) algorithm, a node is
chosen at random, and given a new angular position chosen uniformly
in the interval . The change is accepted whenever the
likelihood in Eq. (24) computed after the change,
Our localized Metropolis-Hastings (LMH) algorithm is not MH per se. In fact it bears stronger resemblances to extremal optimization and genetic search algorithms than to MH. We first define the local contribution of node to the total log-likelihood in Eq. (24):
so that . We can interpret function as the fitness of node , which we can then use to maximize the total likelihood. Specifically, in LMH nodes are visited in rounds, and during each round all nodes are visited one by one. At each node visit, the node is moved to the angular position that maximizes its fitness , having fixed the positions of all other nodes at that particular node visit. An example of the log-likelihood landscape that a node sees during its move is shown in the top plot of Fig. 7. The total number of rounds of all-node visits needed for LMH to converge is of the order of the network average degree. Indeed, even though after each node move, the fitness of other nodes changes, the node fitness is mostly affected by changes of coordinates of the node neighbors, whose average number thus roughly determines the number of rounds. The maximization of the fitness of a node takes time, having fitness sampled at intervals with . Therefore for sparse graphs, the overall computational complexity of LMH is .
Applied to the real Internet and synthetic Internet-like networks below, both SMH and LMH yield similar good results. However, we prefer LMH since by its localized nature, it can be implemented in a distributed manner, an important property for deployment in the real Internet. Even more importantly, with LMH, new-coming ASs can compute their coordinates in a distributed manner without knowing the global Internet topology. Indeed, to compute its coordinates using Eq. (25), a new-coming AS has to know the status of connections only to its neighbors; the status of connections between any two ASs other than does not contribute to in Eq. (25). All results shown in this paper are for LMH.
First MLE wrapper
If we naïvly applied any MLE kernel to the Internet, we would have to wait forever for good results. We see in the top plot of Fig. 7 that the characteristic likelihood profile has abundant local maxima. Therefore an MLE kernel is not guaranteed to converge to the global maximum in a reasonable amount of time. It is thus imperative to find a heuristic procedure, i.e., an MLE wrapper, helping an MLE kernel to find its way towards the global maximum without being trapped in local maxima. This procedure is equivalent to using all available information to make an educated guess of the initial node coordinates.
Our MLE wrapping strategy is based on statistical independence of edges in our graphs. Thanks to this independence, the coordinates of a set of nodes can be inferred based only on the partial information contained in a subgraph formed by the nodes in the set, ignoring the rest of the network. Consider a small subgraph of the whole network, for our purposes made of high degree nodes, and remove all nodes and connections not belonging to this subgraph. Since edges in this subgraph are statistically independent of other edges, we can maximize the likelihood corresponding to the subgraph, and infer the coordinates of the nodes in it based only on this partial information. If the subgraph is small and dense enough, finding the optimal MLE solution is easy. Once this solution is found, we can add more nodes to the network, and use the previously inferred coordinates as the initial configuration for the new MLE problem. However, this method works only if the subgraph forms a single connected component. This property holds for synthetic networks in our model, and for the real Internet Serrano et al. (2008).
Formally, let , with , be a set of predefined degrees, and let , , be the subgraphs formed by all nodes of degrees larger or equal to , plus all connections among them. We thus have , forming a hierarchy of nested subgraphs. The main idea behind our MLE wrapper is to run the MLE kernel, either SMH or LMH, in iterations, starting with the smallest subgraph, and feeding the coordinates inferred at each iteration to the MLE kernel at the next iteration.
This idea must be implemented with care. First, subgraph is different from other subgraphs. Indeed, in scale-free
networks, all nodes of degrees larger than are
connected almost surely. Therefore all such nodes would appear
identical to the MLE kernel, which would thus place them all at the
same location, something that we have to avoid. To solve this
problem, we remove all connections among nodes of degree larger or
equal to and start the wrapper algorithm with the
iteration. Second, iterating from to
, we still need to specify the initial
coordinates of the nodes that belong to but not
We note that node uses information contained only in to get its initial coordinate. After all new nodes corresponding to a given iteration are introduced and assigned initial coordinates, we apply the MLE kernel to the resulting system. This heuristic MLE wrapping procedure is summarized in Alg. 1.
In the bottom plot in Fig. 7 we show the test results for this procedure wrapping the LMH kernel, applied to a synthetic Newtonian– network generated with the parameters similar to the real AS graph. We observe that the inferred coordinates are very close to the real ones, except for a global phase shift, which can take any value in due to the rotational symmetry of the model.
Second MLE wrapper
As mentioned above, it is not necessary to consider the full graph to infer the coordinates of the most connected nodes. We now use this observation to speed up the mapping process significantly. Specifically, we run our first MLE wrapper up to a subgraph of a certain size, and then add the rest of the nodes assigning to them their coordinates maximizing Eq. (26) without subsequent running the MLE kernel, see Alg. 2.
This modification speeds the overall mapping process because once the coordinates of the coordinates of a relative small number of high degree nodes are inferred, the rest of the process takes steps to complete. This improvement reduces the total running time of the Internet mapping to few hours on a standard computer. Another practically important feature of this second MLE wrapper is that new-coming ASs compute their coordinates without existing ASs changing their coordinates. In other words, once the AS coordinates are inferred, they stay static as the Internet grows.
We apply this procedure up to nodes of degree . Nodes of degree and must be analyzed separately since all nodes of degree , and of nodes of degree do not form any triangles. As a consequence, the MLE kernel cannot reliably infer their metric attributes, i.e., their coordinates. Therefore we assign to these nodes the angular coordinate of their (highest-degree) neighbors, which makes sense, especially for nodes of degree , since the only path to such nodes is via their neighbors. Forwarding to such nodes is thus equivalent to forwarding to their neighbors.
The test results of this second MLE wrapper are shown in Fig. 8. The top left plot shows the inferred vs. real coordinates in the same synthetic network for nodes with degrees using the first MLE wrapper. The other plots show the corresponding coordinates for nodes with degrees larger than or equal to using the second MLE wrapper with . That is, the MLE kernel is not run for these nodes. We observe that the inference quality does deteriorate for smaller degrees, but it is remarkable that even in the worst case a majority of coordinates are correctly inferred.
As an additional test, we show in Fig. 9 the empirical connection probability among nodes in each subgraph using the coordinates inferred by the second MLE wrapper, compared to the connection probability used to generate the network. We observe a good agreement for high degree subgraphs, which slightly deteriorates for low degree nodes located at large effective distances .
To map the AS graph, we used the LMH kernel wrapped with the second MLE wrapper with and the subgraph hierarchy defined by , , , , , , , , , , , , , , , , , , , , , .
b.4 Parameter estimation and finite size effect
Our model has three parameters: the exponent of the degree distribution, the average degree , and the exponent of the connection probability.
We estimate the exponent via the direct inspection of the degree distribution, yielding .
The estimation of and is more involved for two reasons. First, the Newtonian– model generates nodes of zero degree which are included in the computation of the average degree, . However, in the real Internet graph all nodes have non-zero degrees. Therefore we first have to estimate the number of nodes in the model, based on the number of nodes we observe in the real graph. The relationship between the two numbers is
where is the probability that a node has zero degree in the model.
The second complication is due to finite size effects. These effects are particularly important when the exponent is close to , which is the case with the Internet. Suppose we generate a finite size network of nodes with our Newtonian– model with parameters , , and . Since the network is finite, there is a cut-off value for the expected degree of a node, , which depends on the size of the network. The first moment of the distribution of expected degrees with this cut-off is
In the thermodynamic limit and . However, if is close to , the approach to these limits is slow, and we have to take care of finite size corrections.
Accounting for these corrections, the expected degree of a node with hidden variable becomes
with . This equation implies that the MLE of the hidden variable of a node of degree changes from Eq. (23) to
while the average degree including zero degree nodes in a finite size network becomes
If the average degree observed in the real Internet graph is , our estimate of the parameter is then
Therefore, in order to estimate the values of and for a finite network, we first have to estimate the values of and . One can check Serrano et al. (2008) that
where is the incomplete Gamma function. We can also relate the maximum degree observed in the real Internet to the expected degree cut-off via
To estimate , we first compare clustering in synthetic networks with different ’s to the clustering observed in the Internet, keeping all other parameters fixed. This procedure narrows down the possible values of to . We then generate Internet maps for different values of within this range, and perform hyperbolic greedy forwarding in them. Fig. 10 shows the success ratio of greedy forwarding as a function of in this region. We observe that the success ratio increases as decreases, and then sharply drops at . The value of maximizing the success ratio is , and we used this value in our final Internet map.
Appendix C The Archipelago Internet topology
We use the AS Internet topology of June 2009 extracted from the data collected by the Archipelago active measurement infrastructure (ARK) developed by CAIDA Claffy et al. (2009). The AS topology contains ASs and AS links, yielding the average AS degree . The maximum AS degree is . The average clustering measured over ASs of degree larger than is , yielding temperature , and hyperbolic disc radius . The exponent of the power-law AS degree distribution is . This Internet topology, along with the hyperbolic Internet map, are released with this paper BoP ().
Appendix D Mapping AS’s to countries
The AS-to-country mapping is taken from the CAIDA AS ranking project Dimitropoulos et al. (2007). It uses two methods for this task. The first method is IP-based. It splits the IP address space advertised by an AS into small blocks, and then maps each block to a country using Digital Envoy (). If not all IP blocks of an AS map to the same country, then the other, WHOIS-based method is used, which reports the country where the AS headquarters are located according to the WHOIS database WHOIS database (). Since large ASs have points of presence in many countries, they tend to map to multiple countries using the IP-based method. Therefore, if we did not apply the WHOIS-based method to them, they would no longer map to a single country. If we ignored such ASs, the angular distributions of the remaining ASs belonging to a given country would be even more localised, including the US, EU, and UK ASs. In our hyperbolic map data, we release the AS-to-country associations using both methods, IP+WHOIS-based and IP-based. The latter has no country information for many ASs with conflicting country mappings.
Appendix E Geographic routing
To perform standard geographic routing we first map each AS to a collection of geographic locations (characterised by their latitudes and longitudes) using the IP-based method, and then find the centre of mass for each collection. We thus obtain unique geographic coordinates for each AS. We then perform standard greedy forwarding over the AS topology, computing geographic distances between ASs using the spherical law of cosines. For hyperbolised geographic routing, we keep the AS angular coordinates equal to their geographic coordinates, but also, based on the AS degree, we assign to each AS a radial coordinate, according to the relationship between node degrees and radial positions in the three-dimensional Einsteinian model, and then perform greedy forwarding in this three-dimensional hyperbolic space.
Appendix F Traffic and congestion considerations
In this section we measure a proxy for the amount of traffic that ASs would have to handle under greedy forwarding.
In view of our finding that greedy forwarding follows almost always the shortest paths, we expect that the traffic load on an AS under greedy forwarding is essentially the same as under shortest path forwarding. We confirm this expectation in Fig. 11 where we juxtapose the normalized betweennesses corresponding to shortest path and greedy forwarding. To compute normalized betweenness, we select a large number of source/destination AS pairs chosen uniformly at random among all ASs. We then find two paths for each AS pair using shortest path and greedy forwarding. Normalized betweenness of a given AS is then the fraction of all paths going through this AS. We observe in Fig. 11 that the normalized betweennesses for shortest path and greedy forwarding are almost identical as expected. We also observe in the top plot, that in agreement with the previous studies on this subject, e.g. Barthélemy (2004), the normalized betweenness grows as a power law of the AS degree. This observation may create an impression that high-degree ASs may suffer from traffic congestion problems. However, this impression is wrong not only because of the results in Gkantsidis et al. (2003), but also because of the following considerations.
In the real Internet, ASs are not singular nodes but differently sized networks composed of (many) routers. The size of an AS, measured by the number of routers in it, is roughly proportional to the AS degree Tangmunarunkit et al. (2001); Huffaker et al. (2010). ASs of different size generate and consume different volumes of traffic. Also, a larger AS can handle larger transit traffic volumes without being congested. These two observations suggest the following modifications to the top plot in Fig. 11. First, we model traffic with the more realistic assumption that the amount of traffic an AS generates or consumes is proportional to the AS size. That is, instead of choosing source and destination AS pairs at random, we chose each AS with a probability proportional to the number of routers in the AS using the data from Huffaker et al. (2010). Second, we divide the normalized betweenness value for each AS by the number of routers in the AS, thus estimating the per-router traffic load. The result shown in the bottom plot of Fig. 11 demonstrates that the important large ASs are, in fact, less prone to congestion problems.
Appendix G Dealing with new-coming AS’s
In this section we show that if the existing ASs keep their hyperbolic coordinates fixed, while the ASs joining the Internet anew over years compute their coordinates in a localizing manner, i.e., using the LMH kernel (25), then the performance of greedy forwarding does not significantly degrade, even at long time scales.
To demonstrate this we perform the following experiment. We replay the AS Internet growth from January 2007 to June 2009 similar to Dhamdhere and Dovrolis (2008). Specifically, we obtain lists of ASs observed in the Internet at different dates as described in Dhamdhere and Dovrolis (2008). The AS lists are linearly spaced in time with the interval of three months: time corresponds to January 2007, is April 2007, and so on until , June 2009. We denote the obtained AS lists by . The number of ASs in is , while the numbers of new ASs in with , but not in are , , , , , , , , , and . We then take our Archipelago AS topology Claffy et al. (2009) of June 2009, and for each we remove from it all ASs and their adjacent links that are not in , thus obtaining a time series of historical AS topologies . We then embed using the SMH kernel (24), but for each subsequent embedding of with , we keep the hyperbolic coordinates of ASs in with fixed, and compute coordinates for the new ASs using the LMH kernel (25). That is, once an AS appears at some time and gets its coordinates computed, using either the SMH, , or LMH, , computations, the AS then never changes its coordinates for the rest of the observation period. In Fig. 12 we show the average success ratio and stretch for greedy forwarding in .
Remarkably, we observe only minor variations of success ratio and stretch over more than years of rapid Internet growth. The success ratio does decrease, but by less than . We thus conclude that greedy forwarding using our hyperbolic AS map is quite robust with respect to Internet historical growth. Existing ASs do not have to recompute their hyperbolic coordinates when new ASs join the Internet. Recomputations of all AS coordinates may be executed to improve the greedy forwarding performance, but the time scale for such recomputations exceeds the time scale of Internet historical evolution, i.e., years, thus exceeding by orders of magnitude the time scale of transient dynamics of failing AS links and nodes, i.e., seconds or minutes. That is why the existing AS coordinates are essentially static, and can stay the same for years.
Appendix H Sensitivity to missing links
It is widely known that the existing measurements of the Internet topology miss a number of AS links Lakhina et al. (2003); Dimitropoulos et al. (2007); Oliveira et al. (2010). However, in view of the robustness of greedy forwarding performance with respect to link removals, one could expect that its performance would be robust with respect to missing links as well. Furthermore, if our hyperbolic map is used in practice, then greedy forwarding will see and use those links that we do not see. Therefore one can intuitively expect that, in this case, the efficiency of greedy forwarding will be actually higher than we report in this paper, simply because these links that we miss but greedy forwarding would not miss, would provide additional shortcuts between potentially remote ASs. If so, the routing results presented in this paper should be considered as lower bounds.
To confirm this intuition, we perform the following experiment. It is known that the majority of missing links in the Internet are peer-to-peer links among provider ASs of moderate size Dimitropoulos et al. (2007); Oliveira et al. (2010). To emulate the missing link issue, we thus remove a fraction (ranging from to ) of links among nodes with degree above a certain threshold () from our AS graph. We then map these graphs with different numbers of emulated missing links to as described in Section B to find hyperbolic coordinates for each AS. Using these maps with missing information, we then consider two different greedy forwarding scenarios for each map:
In the first scenario, we navigate an AS graph mapped with a fraction of links removed, and compute the success ratio of greedy forwarding in the graph. This scenario tries to mimic the missing links issue directly. We have incomplete topology measurements of the real Internet, but we have no other option as to use these measurements to map the Internet to its hyperbolic space, and study navigability with this map, which we know miss some information.
In the second scenario, we use the hyperbolic map obtained with missing links, but we then add back those removed links, and navigate the complete graph. This scenario is motivated by the observation that even though our map is constructed with some links missing, these missing links will still be used by ASs attached to them to forward information if this map is used in practice.
The results of these two scenarios are shown in Fig. 13. As intuitively expected, our mapping is quite robust with respect to missing links: the success ratio decreases by less than even if up to of links are removed from the topology before we map it. Also as expected, the missing links, when added back, increase the success ratio. That is, even though the map has been constructed using partial information, navigability improves when missing links are considered. These results confirm that the routing results reported in this paper are in reality lower bounds for the success ratio that can be achieved if our map is used in practice. In fact, one may somewhat paradoxically expect that the more links are missed in the measured Internet topology we used for mapping, the better the success ratio would be in practice, since according to Fig. 13, the success ratio improvement due to re-adding of removed links tends to increase with the number of removed links.
Appendix I Comments on AS-level routing
Our approach belongs to a wide class of approaches proposing to reduce routing granularity to the level of Autonomous Systems Castineyra et al. (1996); Hinden (1996); Kastenholz (2002); Verkaik et al. (2004); Gummadi et al. (2004); Subramanian et al. (2005); Caesar et al. (2006); Krioukov et al. (2007); Oliveira et al. (2007); Massey et al. (2007); Zhang et al. (2009); Farinacci et al. (2009); Shue and Gupta (2010). The key difference between ours and the existing approaches in this class is that the latter require some form of routing on the dynamic AS graph. As soon as the AS topology changes, new AS routes must be recomputed, so that routing communication overhead is unavoidable in this case. In our case such recomputations are not needed since as we have shown, the efficiency of greedy forwarding sustains in presence of failing AS nodes and links, even though ASs do not exchange any information about topology modifications, and do not change their hyperbolic coordinates, i.e., even though they do not incur any communication overhead. A bulk of routing overhead in the Internet today is due to traffic engineering and multihoming in the first place Huston (2001, 2006). How the AS-level routing class of approaches helps to deal with and reduce this overhead is discussed in the literature cited above.
Acknowledgements.We thank M. Newman and M. Ángeles Serrano for many useful suggestions and discussions, M. Ángeles Serrano for suggesting the analogy with gravitation, A. Aranovich for help with Fig. 1, and Y. Hyun, B. Huffaker, and A. Dhamdhere for help with the data. M. B. acknowledges support from DGES grant No. FIS2007-66485-C02-02, Generalitat de Catalunya grant No. 2009SGR838, and NSF CNS-0964236. D. K. acknowledges support from NSF CNS-0722070 and CNS-0964236, DHS N66001-08-C-2029, and Cisco Systems.
- We chose the uniform distribution because we do not have any a priori preferred angular coordinate values, and thus expect the network to be isotropic.
- Note that the model generates nodes of zero degree that contribute to the total average degree.
- From now on we denote the log-likelihood in Eq. (24) by .
- Adding nodes in but not in , we check if they have at least two connections to nodes in . Otherwise we postpone introducing such nodes to the first iteration when they start satisfying this condition.
- V. Gehring, The Internet in Public Life (Rowman & Littlefield, Washington, 2004).
- Internet World Stats, http://www.internetworldstats.com/.
- D. Lazer, A. Pentland, L. Adamic, S. Aral, A.-L. Barabási, D. Brewer, N. Christakis, N. Contractor, J. Fowler, M. Gutmann, et al., Science 323, 721 (2009).
- J. Hawkinson and T. Bates, RFC1930 (The Internet Engineering Task Force, Fremont, 1996).
- A. Dhamdhere and K. Dovrolis, in IMC (2008).
- B. Carpenter, Comput Commun Rev 39, 6 (2009).
- D. Meyer, L. Zhang, and K. Fall, eds., RFC4984 (The Internet Architecture Board, Amsterdam, 2007).
- R. Atkinson and R. Bennett, The Future of the Internet and Broadband …and How to Enable It (Federal Communications Commission, Washington, 2009).
- P. Godfrey, I. Ganichev, S. Shenker, and I. Stoica, Comput Commun Rev 39, 111 (2009).
- K. Gammon, Nature 463, 602 (2010).
- E. Katz-Bassett, H. Madhyastha, J. John, A. Krishnamurthy, D. Wetherall, and T. Anderson, in NSDI (2008).
- M. Boguñá, D. Krioukov, and kc claffy, Nature Physics 5, 74 (2009).
- M. Boguñá and D. Krioukov, Phys Rev Lett 102, 058701 (2009).
- D. Krioukov, F. Papadopoulos, M. Boguñá, and A. Vahdat, ACM SIGMETRICS Perf E R 37, 15 (2009a).
- F. Papadopoulos, D. Krioukov, M. Boguñá, and A. Vahdat, in INFOCOM (2010).
- M. Penrose, Random Geometric Graphs (Oxford University Press, Oxford, 2003).
- M. Á. Serrano, D. Krioukov, and M. Boguñá, Phys Rev Lett 100, 078701 (2008).
- F. Chung and L. Lu, Proc Natl Acad Sci USA 99, 15879 (2002).
- D. Krioukov, F. Papadopoulos, A. Vahdat, and M. Boguñá, Phys Rev E 80, 035101(R) (2009b).
- D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguñá, Phys Rev E 82, 036106 (2010).
- L. Tang and M. Crovella, in IMC (2003).
- Y. Shavitt and T. Tankel, IEEE ACM T Network 12 (2004).
- Y. Shavitt and T. Tankel, IEEE ACM T Network 16 (2008).
- D. Cox, Principles of Statistical Inference (Cambridge University Press, Cambridge, 2006).
- M. E. J. Newman and G. T. Barkema, Monte Carlo Methods in Statistical Physics (Clarendon Press, Oxford, 1999).
- K. Claffy, Y. Hyun, K. Keys, M. Fomenkov, and D. Krioukov, in CATCH (2009), http://www.caida.org/projects/ark/.
- M. Girvan and M. E. J. Newman, Proc Natl Acad Sci USA 99, 7821 (2002).
- M. E. J. Newman, Proc Natl Acad Sci USA 103, 8577 (2006).
- L. Danon, J. Duch, A. Arenas, and A. Díaz-Guilera, Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science (World Scientific, Singapore, 2007), chap. Community Structure Identification.
- A. Cvetkovski and M. Crovella, in INFOCOM (2009).
- C. Gkantsidis, M. Mihail, and A. Saberi, in SIGMETRICS (2003).
- E. Jonckheere, M. Lou, F. Bonahon, and Y. Baryshnikov, Internet Math (to appear) (2010).
- R. Albert, H. Jeong, and A.-L. Barabási, Nature 406, 378 (2001).
- H. Jeong, A.-L. B. S. Mason, and Z. N. Oltvai, Nature 411, 41 (2001).
- R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: A Statistical Physics Approach (Cambridge University Press, Cambridge, 2004).
- M. Crovella and B. Krishnamurthy, Internet Measurement: Infrastructure, Traffic, and Applications (John Wiley & Sons, Ltd, West Sussex, UK, 2006).
- E. Bullmore and O. Sporns, Nat Rev Neurosci 10, 168 (2009).
- D. Charlebois, Nature 458, 811 (2009).
- D. Monroe, Commun ACM 52, 15 (2009).
- S. Meloni, A. Arenas, and Y. Moreno, Proc Natl Acad Sci USA 106, 16897 (2009).
- G. Bianconi, P. Pin, and M. Marsili, Proc Natl Acad Sci USA 106, 11433 (2009).
- X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, kc claffy, and G. Riley, Comput Commun Rev 37, 29 (2007).
- Digital Envoy, Netacuity, http://www.digital-element.net/ip_intelligence/ip_intelligence.html.
- WHOIS database, http://www.whois.net/.
- M. Barthélemy, Eur Phys J B 38, 163 (2004).
- H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, W. Willinger, and S. Shenker, Comput Commun Rev 31, 7 (2001).
- B. Huffaker, A. Dhamdhere, M. Fomenkov, and kc claffy, in PAM (to appear) (2010).
- A. Lakhina, J. Byers, M. Crovella, and P. Xie, in INFOCOM (2003).
- R. Oliveira, D. Pei, W. Willinger, B. Zhang, and L. Zhang, IEEE ACM T Network (to appear) (2010).
- I. Castineyra, N. Chiappa, and M. Steenstrup, The nimrod routing architecture, IETF, RFC 1992 (1996).
- R. Hinden, New scheme for Internet routing and addressing (ENCAPS) for IPNG, IETF, RFC 1955 (1996).
- F. Kastenholz, ISLAY: A new routing and addressing architecture, IRTF, Internet Draft (2002).
- P. Verkaik, A. Broido, kc claffy, R. Gao, Y. Hyun, and R. van der Pol, Technical Report TR-2004-1, CAIDA (2004).
- R. Gummadi, R. Govindan, N. Kothari, B. Karp, Y.-J. Kim, and S. Shenker, in HotNets (2004).
- L. Subramanian, M. Caesar, C. T. Ee, M. Handley, M. Mao, S. Shenker, and I. Stoica, in SIGCOMM (2005).
- M. Caesar, T. Condie, J. Kannan, K. Lakshminarayanan, I. Stoica, and S. Shenker, in SIGCOMM (2006).
- D. Krioukov, kc claffy, K. Fall, and A. Brady, Comput Commun Rev 37, 41 (2007).
- R. Oliveira, M. Lad, B. Zhang, and L. Zhang, in ICNP (2007).
- D. Massey, L. Wang, B. Zhang, and L. Zhang, in ACM SIGCOMM Workshop on IPv6 and the Future of the Internet (2007).
- B. Zhang, L. Zhang, and L. Wang, Evolution towards global routing scalability, IETF, Internet Draft (2009).
- D. Farinacci, V. Fuller, D. Oran, D. Meyer, and S. Brim, Locator/ID separation protocol (LISP), IETF, Internet Draft (2009).
- C. Shue and M. Gupta, Comput Netw (to appear) (2010).
- G. Huston, The Internet Protocol Journal 4 (2001).
- G. Huston, The Internet Protocol Journal 9 (2006).
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-26/segments/1560627998238.28/warc/CC-MAIN-20190616122738-20190616144738-00472.warc.gz
|
CC-MAIN-2019-26
| 64,766
| 199
|
https://bisite.usal.es/es/research/publications/2017/economic-evaluation-predictive-dispatch-model-mas-based-smart-home
|
code
|
This paper proposes a Predictive Dispatch System (PDS) as part of a Multi-Agent system that models the Smart Home Electricity System (MASHES). The proposed PDS consists of a Decision-Making System (DMS) and a Prediction Engine (PE). The considered Smart Home Electricity System (SHES) consists of different agents, each with different tasks in the system. A Modified Stochastic Predicted Bands (MSPB) interval optimization method is used to model the uncertainty in the Home Energy Management (HEM) problem. Moreover, the proposed method to solve HEM problem is based on the Moving Window Algorithm (MWA). The performance of the proposed Home Energy Management System (HEMS) is evaluated using a JADE implementation of the MASHES.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710941.43/warc/CC-MAIN-20221203212026-20221204002026-00303.warc.gz
|
CC-MAIN-2022-49
| 730
| 1
|
https://croissant.tripod.com/wakeup.html
|
code
|
Here, you can join the Mad Season mailing list entitled 'Wake Up'. It comes to you from The River
of Deceit and ONEList. It is not censored, so you can write anything you want in it. You can not,
under any circumstances, distribute SPAM mail, or advertise commercially on the list. There's no
problem with putting web site links and ads, as long as they are not a commercial business.
follow this link, or click on the button below:
Click to subscribe to wakeup
follow this link, or click the button below:
Click to view archives of wakeup
Ok, I've subscribed to the list, now how to I send email to it? To send email to this list, after subscribing, send all mail to email@example.com.
Enjoy the mailing list, and have fun doing what you're doing. Back home
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-23/segments/1685224653608.76/warc/CC-MAIN-20230607042751-20230607072751-00440.warc.gz
|
CC-MAIN-2023-23
| 758
| 10
|
http://forum.luminous-landscape.com/index.php?topic=61202.msg548084
|
code
|
Iím still on the lookout for a used Aptus back,
Aptus 5 (22mp)
Aptus II 5 (22mp)
Not particularly interested in the Aptus 65 or Aptus II 6 (28mp)
Let me know what you have and in what mount.
Seller need to accept payment via PayPal (Iíll pay the fees).
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-09/segments/1487501170708.51/warc/CC-MAIN-20170219104610-00386-ip-10-171-10-108.ec2.internal.warc.gz
|
CC-MAIN-2017-09
| 254
| 6
|
http://weblog.tetradian.com/2008/10/03/ba-frameworks/
|
code
|
Diana Stobart Wild’s other question on the LinkedIn business architecture forum was about frameworks:
What is Business Architecture? What does a Business Architecture Framework look like?
I think of Business Architecture as a subset of Enterprise Architecture that describes the business from the Strategy down to the enterprise business models (process, data, business rules, etc.). Business parts of the Zachman Framework? Thoughts? Comments?
My response was as follows:
I’d agree that Business Architecture is a subset of Enterprise Architecture, as long as you don’t fall for the TOGAF-style trap of thinking that enterprise-architecture is only about IT!
Business-architecture proper is the strategy layer (Zachman row-2 and upward, also bridging down into row-3).
The jumbled mess of what’s otherwise called ‘business architecture’ only exists because TOGAF and the other IT-centric ‘EA’ frameworks essentially used the term as a generic dumping-ground for ‘everything not-IT’. Instead, think of the remainder of what TOGAF calls ‘business architecture’ as two distinct layers: the logical or integration layer – the equivalent of TOGAF’s ‘Information Systems Architecture’, Zachman row-3 to row-4 – and the physical or implementation layer – the equivalent of TOGAF’s Technology / Infrastructure Architecture, Zachman row-4 to row-5.
Zachman’s structure of layers still works fairly well for this – the only essential change is an extra ‘row-zero’ for compatibility with the Vision layer of ISO-9000:2000. But it does need some serious rework on the columns: for a start, there’s an entire dimension missing, to handle distinctions between physical assets (things), virtual assets (data etc), relational (what your CRM is all about!), aspirational assets (morale and the like), and abstract (such as the financials that your business people do want in their models!); the same for locations (physical, virtual, relational etc) and so on. Still a month or a so away from finishing my book on this, “Bridging the Silos”, but see the ‘Framework’ chapters in the current draft at http://tetradianbooks.com/2008/04/silos/ .
One point that Zachman did get right, but most of the EA-toolset vendors seem to have forgotten, is the key distinction between primitives and composites. As Zachman says, architecture is about primitives (TOGAF’s ‘Architecture Building Blocks’, or ‘ABBs’), whilst solutions come from composites or patterns (TOGAF’s ‘Solution Building Blocks’, or ‘SBBs’). The Zachman Framework is a taxonomy of primitives – root-level entities, some of them fairly abstract; composites are structured collections of primitives that straddle the columns, making up patterns for re-use.
Composites are usable to the extent that they’re architecturally ‘complete’ – i.e. straddle all of the columns – but are re-usable to the extent that they’re incomplete: for example, a BPMN process-model says nothing about ‘Where’ or ‘Why’, so can be re-used in different locations and (in principle) for different purposes. At the mid-layer of the framework, you need to be able to describe a process in abstract terms, to identify KPIs and CSFs and so on; you’d define different SLAs as you go down towards different implementations – manual, machine, IT, etc, but they should all use the same KPIs etc. This is important because if you’re not able to anchor the detail-layer composites into their component sub-composites, all the way down to their root-primitives, you won’t be able to see options for redesign, such as for disaster-recovery or process-reengineering. Think of the classic IT-centric blunder of assuming that every problem must always have an IT-based solution… your only way to avoid that trap is to use a non-IT-centric framework that covers the true whole-of-enterprise space.
Over the past few years I’ve done quite a bit of work on a ‘service oriented enterprise’ framework, based on the classic Stafford Beer ‘Viable System Model’ – see the Wikipedia summary at http://en.wikipedia.org/wiki/Viable_System_Model . We extended this at Australia Post and elsewhere to include support for quality-systems, security-management and so on. Again, there’s still some way to go, and the book is probably at least six months away, but there’s a summary in my article on the service-oriented enterprise in the current itSMF “IT Service Management Global Best Practices” book (see http://www.vanharen.net ) and in my presentation to the TOGAF Glasgow conference back in April (see PDF at http://www.tetradian.com/download/togaf_ea-soe_apr08_FV.pdf ).
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233510219.5/warc/CC-MAIN-20230926175325-20230926205325-00156.warc.gz
|
CC-MAIN-2023-40
| 4,688
| 11
|
https://www.findbestopensource.com/product/edifabric
|
code
|
We have collection of more than 1 Million open source products ranging from Enterprise product to
small libraries in all platforms. We aggregate information from all open source repositories.
Search and find the best for your needs. Check out projects section.
Simple EDI reading\writing library + XmlReader over EDI data. Provides basic functionality sufficient to parse\read and write EDI streams. Currently X12 EDI only. Parser is general purpose, does not use maps\specifications, does not create XML hierarchy.
Edival is a simple EDI file parsing amp; validation library for the EDIFACT and X12 EDI standards. It is a stream-based parser in which an application defines event handlers for structures that the parser will find in a file, e.g. elements and segments.
EDIReader parses EDI input from ANSI X12 and EDIFACT, including documents for HIPAA compliance. It supports Java JAXP/SAX XML interfaces with a custom implementation of an quot;XMLquot; parser, allowing access to EDI data with XML tools.
EDI4J is a java toolkit to read, write and translate EDI files (X12, UN/EDIFACT, HL7). EDI4J uses XML template files representing the structure and composition of an EDI file to parse EDI files into an XML translation.
This is an open source .NET C# implementation of an X12 Parser. The parser allows for a specification of any X12 transaction set to create a generic X12 xml representation of the hierarchical data contained within the X12 document. No database integration is required by de...
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-05/segments/1516084886436.25/warc/CC-MAIN-20180116125134-20180116145134-00636.warc.gz
|
CC-MAIN-2018-05
| 1,503
| 8
|
http://forums.mtbr.com/europe/most-popular-amateur-mtb-race-croatia-reports-833395-print.html
|
code
|
Prepare for the next one in June 2013:
The date has been determined! It is Saturday June 22nd. Information and registrations at the organizer's site TZ Senj and firstname.lastname@example.org .
Results of the latest 4 races at : Wix.com MTBZavizanresults created by malojcic based on LONG left sm | Wix.com
Search Youtube for the keywords " uspon na zavižan " .
Nearby airports Zadar, Rijeka, Pula, Zagreb, Ljubljana, Split and Trieste .
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917123046.75/warc/CC-MAIN-20170423031203-00170-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 438
| 5
|
https://promitheasblog.com/web-scraping-tools-for-faster-scraping-of-google-docs/
|
code
|
Google is the most popular search engine in the world. Most people go to Google when searching for information. Google includes many other elements that can greatly increase your website traffic. One of those elements is the Google scrape, which allows you to obtain information such as website statistics, meta tags, link analysis, and even more.
Google scrape is a simple script that allows you to scrape Google search engine’s result pages. Google is by far the most popular search engine among all other search engines. To obtain this information, there are two ways. The first way is to use a free Google scrape tool such as the Google scrape helper or Google scratch. The second way is to use a commercial Google scraping script, which is available online.
If you want to use the Google scrape tool, there are some things you have to do. First, you need to sign up for an account. Once you sign up, you will get a Google page called “scraping google site” which you can then upload your scrape to. Next, you need to find a good Google scrape application such as the Google Local Business Information scraper, Google Maps scraper, or Google reviews scraper.
The Google Local Business Information scraper is a web-based MS Excel compatible database scraper that provides a simple and easy way to extract data from Google. To use this database scraper, you should visit the Google product website. Once you have signed up for a free trial version, you can then extract and analyze data from the website. On the Google site, you should also have an option to download a raw data file and convert it to a Google Spreadsheet.
The Google Maps scraper is a web scraper based on the Map scraper code originally developed by Rob Cook in 2004. The code was later inspired and extended by scraping expert Matt Cutts. To use this tool, you should visit the official Google website, which provides a series of scripts for retrieving street maps from Google. Once you have downloaded one of these scripts, all you need to do is install it onto your local computer. You will then be able to scrape locations of interest using the web scrapers at the same time.
Finally, the Google reviews scraper provides a simple and fast way to scrape review data. To start, you should visit the Google site and sign up for a free account. Once you have logged in, you should go to the “scraper settings” tab. Under” Crawler Options”, you should choose “Googlebot” and click “OK”. Then, you should enter the URL of the webpage you want to scrape and the title of the review you are going to write.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-31/segments/1627046151699.95/warc/CC-MAIN-20210725143345-20210725173345-00069.warc.gz
|
CC-MAIN-2021-31
| 2,595
| 6
|
http://biessaycxfr.ultimatestructuredwater.info/economics-and-marginal-cost-curve.html
|
code
|
Economics and marginal cost curve
Econ 150 beta site section 01 the supply curve of an individual producer is the marginal cost curve above avc demand reflects the willingness to pay by consumers and the supply curve reflects the marginal cost at the quantity produced, economic surplus which is the area of consumer. The cri is pleased to publish 'what are marginal costs and how to estimate them' as cri technical paper 13 a distinguished economist any excess of value over economic cost is an economic rent marginal cost marginal cost is an estimate of how economic cost would change if output changed. Marginal cost curve and the average total cost curve learn the different types of economic cost curves and the law of diminishing returns. Effects on equilibrium in the short and long run the supply curve for a competitive firm will be that part of the marginal cost curve which lies above the low point of the average cost curve if the market price falls below a firm's average total cost, the firm will incur economic losses. Microeconomics 2010 final, sec 300 fall 2009 (version 2) marginal revenue curve to the right of its marginal cost curve b) economic theory suggests that the firms that remain in the industry will earn a.
Economics 101 spring 2011 homework #5 due 4/12/11 in the short run, each firm's supply curve will be its marginal cost curve suppose we know that each firm will produce 6 units in the short run what is economics 101 author. Economics marginal cost and average cost curves -- average total cost is the sum of average variable cost and average fixed cost or we can say the marginal-cost curve crosses the average-total-cost curve at the efficient scale. The corresponding point on the supply curve measures marginal cost, the increase in total cost to the supplier for the corresponding unit of the good the price in equilibrium is determined by supply and demand in a perfectly competitive market. Study well: 1) the economics of imperfect competition by mrsjoan robinson, 2) early articles of sraffa and harrod, 3) read jacob viner's cost curves and supply curves.
If the output levels at which short-run marginal and average cost curves reach a minimum are listed in order from smallest to greatest, then the order would be. Number 1 resource for equilibrium of firm: by curves of marginal revenue and marginal cost economics assignment help, economics homework & economics project help & equilibrium of firm: by curves of marginal revenue and marginal cost economics assignments help. Marginal cost and marginal revenue marginal revenue c) demand and supply supply and cost curves for his firm in the long run, a firm in monopolistic competition earns zero economic profit and its. Practice questions and answers from lesson iii-1: inputs and costs the marginal cost curve is not affected if the variable costs do not change so the marginal cost curve remains at its initial position, mc c.
Theory of production: theory of production, in economics the average and marginal cost curves just deduced are the keys to the solution of the second-level problem, the determination of the most profitable level of output to produce in a given plant. Personal finance and economics marginal cost (mc) & average total cost (atc) total cost is variable cost and fixed cost combined. Economics(103h((fall(l2012:reviewquestionsfor( midterm(2((essay/graphingquestions( 1, explain the shape of the budget line 2 what shifts the budget line and why marginal cost curves explain the relationship between the marginal and total product. The upsloping portion of the marginal cost curve (above the average variable cost intersection) indeed, a firm determines in spite of its beneficial economic effect, perfect competition fails to - provide any correction for income distribution inequity.
Economics and marginal cost curve
Economic profit is an explicit cost, while normal profit is an implicit cost f average total cost, and marginal-cost curves would all shift upward why does the short-run marginal-cost curve eventually increase for the typical firm (c. This picture is called the dispatch curve, shown in system marginal cost is the marginal cost of the generating plant that meets the we can now calculate these cost measures for our example the economic dispatch of all power plants in the system is: colchester produces 100 mwh. An economics website then decreasing marginal returns and the onset of the law of diminishing marginal returns as marginal cost rises however, because the marginal cost curve is a plot of the slope of the total cost curve.
Graph/diagram: mc curve, can also be plotted graphicallythe marginal cost curve in fig (138) decreases sharply with smaller q output and reaches a minimum as production is expanded to a higher level, it begins to rise at a rapid rate. Chapter 7 costs short-run costs long lowering costs in the long-run 0 economic cost and accounting cost opportunity cost: the highest value of other alternative activities forgone corresponding point on the cost curve 2) marginal cost at a particular 1 is the slope of either. Economics 101 fall 2011 homework #6 due: 12/13/2010 in lecture marginal cost curve, and marginal revenue curve for this firm are shown in the picture below the government decides to regulate this market using marginal cost pricing. Why does the marginal cost curve slope upwards update cancel assuming costs are on the vertical axis and quantity is on the horizontal axis, marginal cost curves are usually positive, reflecting higher costs in economics, we usually start. Economics online store cost and revenue the ar curve is also the firm's demand curve marginal revenue the marginal revenue (mr) curve also slopes downwards, but at twice the rate of ar this means that when mr is 0 economics online. An economics website as marginal product (and marginal returns) increases for relatively small output quantities, marginal cost declines then as marginal product (and marginal returns) the marginal cost curve.
Now let's graph the number of loaves vs the marginal cost you'll notice it looks like a supply curve this graph shows marginal cost on the y-axis, but the supply curve has price on the y-axis. Start studying chapter 11: production and cost analysis 1 learn vocabulary, terms, and more with flashcards total cost (economics) the marginal cost curve intersects the average variable cost curve at the min point because once the marginal cost exceeds average variable costs. In the diagram, you can see that the marginal cost curve falls to start with and then begins to rise a-level » economics » costs and revenues register free costs and their curves. Profit maximization can be characterized with reference to the total revenue and total cost curves or the marginal revenue and marginal cost curves. In economics, a cost curve is a graph of the costs of production as a function of total quantity produced the production function determines the variable cost function it necessarily determines the shape and properties of marginal cost curve and the average cost curves.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676589892.87/warc/CC-MAIN-20180717183929-20180717203929-00123.warc.gz
|
CC-MAIN-2018-30
| 7,085
| 9
|
https://www.mpgh.net/forum/72-flaming-rage/321521-anime-perverts.html
|
code
|
Ok,first i want to say something:
Its not flaming,i just wanted to say this.
WHY THE MOST PEOPLE HAVE NAKED ANIMEDOLLS IN THEIR SIGNATURE!?
I mean,why not REAL humans,not internetmaked dolls.
Siriously,i dont hate it,but their are to mutch perverts.
over and out.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187824225.41/warc/CC-MAIN-20171020135519-20171020155519-00538.warc.gz
|
CC-MAIN-2017-43
| 263
| 6
|
https://pythoncircle.com/practice/python-multiple-choice-questions/331/
|
code
|
Blog available for sell
This blog is available for sale. Please 'contact us' if interested.
Advertise with us
Python Multiple Choice Questions
What is the use of tell() method in python?
A. tells you the current position within the file
B. tells you the end position within the file
C. tells you the file is opened or not
D. none of the mentioned
Explanation: The tell() method tells you the current position within the file; in other words, the next read or write will occur at that many bytes from the beginning of the file.
© 2022-2023 Python Circle
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296818468.34/warc/CC-MAIN-20240423064231-20240423094231-00044.warc.gz
|
CC-MAIN-2024-18
| 553
| 11
|
https://steemit.com/utopian-io/@amosbastian/the-utopian-history-quiz?sort=votes
|
code
|
A few days ago I was wondering some things about who has actually reviewed or submitted the most contributions and other things like that, and then it hit me: why not make a fun quiz about it? Luckily I had synced the old Utopian database (~58000 contributions) on my droplet and have access to the current one (~6000 contributions), so I combined both together and started thinking of questions!
Some of the data is missing for some contributions (like when a contribution was created or when it was reviewed), so this means it's possible that some of the answers might be a little bit inaccurate, but hopefully it's not too bad. If I recall correctly some scores might also be wrong or missing because there was an incident back in the day which caused some scores to be reset. Finally, there could be something wrong with the code that I used to generate the questions and answers, so no guarantees this is historically accurate!
So as I mentioned it uses the data from the previous database and the current one, so the posts range from 2017-09-26 to 2018-09-08. Because of this there could be some names you haven't seen before, but don't panic and take it easy - this is just for fun! Use the template below to post your answers in the comments and I will announce the winner(s) on one of the next few days (maybe Wednesday evening)!
- A small prize of 10 STEEM from me to whoever gets the most correct answers correct.
- @espoem has offered an amazing 30 STEEM to whoever gets ALL questions correct - however he gave the following condition: this is only available for people who aren't, or haven't been, Utopian moderators/managers/supervisors.
If there are multiple winners then the prize(s) will be split between them, of course.
|Question|Answer| |:-:|:-:| |A|| |B|| |C|| |D|| |E|| |F|| |G|| |H|| |I|| |J|| |K|| |L|| |M|| |N|| |O||
A. Which moderator has reviewed the most contributions?
B. Which moderator has reviewed the most contributions in a single day?
C. Who gives, or has given, the highest average score per contribution (minimum of 100 reviewed contributions)?
D. Who gives, or has given, the lowest average score per contribution (minimum of 100 reviewed contributions)?
E. Who has gone the most consecutive days with at least one review?
F. Who was the first person to review a contribution (besides @elear of course!)?
G. Who has contributed the most contributions so far?
H. Who has posted the most contributions in a single day?
I. Who receives the highest average score per contribution (minimum of 15 contributions)?
J. Who has gone the most consecutive days with submitting at least one contribution?
K. Who was the first person to submit a contribution (besides @elear of course!)?
L. Which category has received the most contributions?
M. Which category receives the highest average score per contribution?
N. Which project has received the most contributions?
O. Which project receives the highest average score per contribution?
Good luck to everyone participating!
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-04/segments/1547584518983.95/warc/CC-MAIN-20190124035411-20190124061411-00220.warc.gz
|
CC-MAIN-2019-04
| 2,998
| 23
|
http://www.bitz-qconsulting.com.au/2021/10/21/intro-to-programming-courses/
|
code
|
Online computer programming courses give people to be able to learn all they need to understand how the computer courses that run the everyday technology run. The information they are exposed to during these classes allows them to do the job independently as well as in groups with others within their career. Computer system programs and computer systems have become more complex over the years, making it necessary for everyone to acquire some knowledge of how they operate. Taking these types of courses is an efficient way for individuals to gain this knowledge.
As opposed to in-classroom computer-programming courses, on line courses are prepared for independent designers and budding professionals likewise. They give all of them a https://learn-to-program.net/loops/ chance to have the knowledge they need from the comfort that belongs to them home, at their own tempo, and in their particular time. Web based courses as well provide the flexibility that lots of busy experts need to get the career schooling they need. These courses come in a variety of forms so that no matter what level one is currently on, they can find the program that is right for them.
A person might take possibly an introductory course, which covers fundamental computer scientific disciplines topics, or maybe a more advanced course, which is created for those who wish to study more deeply about encoding. An initial course lets a person to begin learning how pc science concepts work and what terms is used. More complex courses lets a person to further their very own understanding of the field and learn about specific programming different languages as well as the types of programs they are many familiar with. No matter what type of developer a person is, there is an introductory course which is just perfect for them.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-05/segments/1642320305288.57/warc/CC-MAIN-20220127193303-20220127223303-00425.warc.gz
|
CC-MAIN-2022-05
| 1,812
| 3
|
http://www.hsufengko.com/notes/visitor-design-pattern-example
|
code
|
Visitor Design Pattern Example
Visitor pattern is a behavioral pattern that lets you define a new operation to apply toward classes of the elements (Element Class, a.k.a. Visitable Class) without changing the classes of the elements on which it operates. The new operations are grouped together each is called a separate Visitor class.
Visitor pattern lets you add a new operation to a structure of objects (Visitable/Elements) to be traversed through, without changing the Visitable/Element on which it operates.
Visitor class separates out would-be virtual functions into a Visitor class.
Each Visitable/Element should implement an accept(Visitor) function which delegate the request to the underlying Visitor class via calling visitor.visit(this) from accept(Visitor).
Each concrete Visitor class implements a set of visit(Object) functions that does the real work for the operation to be applied to the structure of objects. Each visit(Object) function takes in a different type of concrete Visitable/Element object. The Visitor can optionally maintain a context during a traversal.
Consider a compiler program that deals with an abstract syntax tree. Each node in the abstract syntax tree may be a variable, an assignment, arithmetic expression, etc. For each node element, you want to apply operations like type-checking, code optimization, pretty-formatting, etc.
One way of structuring the above is to have a node class hierarchy. Within node class hierarchy, for each different node class, you define its type-checking operation, code optimization operation, and pretty-formatting operation inside the node class. This has three potential drawbacks:
To avoid the above drawbacks, apply the Visitor pattern which defines two class hierarchies: one (the visitable Element hierarchy) for the nodes or data structure being operated on and one (the Visitor hierarchy) for defining operations to be applied to the elements. The delegation of the operation from an element class to a visitor class is through an accept(Visitor) function defined in the element class. Then in terms, calls into Visitor.visit(this). When you need to introduce a new type of operation, you'd create a new subclass in the Visitor hierarchy, without needing to modify the Element hierarchy.
visotor pattern code sample
The element/visitable interface simply defines an accept method to allow the visitor to run some action over that element - the ConcreteElement will implement this accept method.
// Element Interface
Delegate operation applied to an element to a corresponding visitor class.
Visitor class holds local state. In this case, to accumulate postage cost.
Request the result of the operation/computation/local state.
Visitor Pattern vs. Non-Visitor Pattern
when to use visitor pattern
Choose to use Visitor pattern if:
Leave a Reply.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-23/segments/1685224651815.80/warc/CC-MAIN-20230605085657-20230605115657-00585.warc.gz
|
CC-MAIN-2023-23
| 2,829
| 19
|
https://www.telerik.com/forums/radgridview-when-autogeneratingcolumn-column-itemtype-is-null
|
code
|
I am afraid that you can not use the ItemType property of GridViewColumn in AutoGeneratingColumn. However, you can use the GridView's Items property. In fact, the GridViewColumn.ItemType property is using a similar approach:
/// Gets the type of the item that the field belongs to.
>The type of the item.</
public virtual Type ItemType
if (this.DataControl != null)
However, ElementType is internal, so you can't use it directly.
Do you need help with upgrading your AJAX, WPF or WinForms project? Check the Telerik API Analyzer
and share your thoughts.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-47/segments/1510934806309.83/warc/CC-MAIN-20171121002016-20171121022016-00077.warc.gz
|
CC-MAIN-2017-47
| 553
| 8
|
https://forums.rockylinux.org/t/proof-of-concept-u-boot-aarch64-image-for-sbcs/2756
|
code
|
After the Proof of Cconcept for a image for the Raspberry PI explored the possibilities for a generic image for SBC’s too. Agian it is a replication of the work of the Fedora- (especially Peter Robinson) and the CentOS arm-sig (especially Pablo Greco) teams. Credits go there.
This still needs a lot of work, so much i hesitate to share the progression so far. Deiced to do it any way as after a bit tinkering it boots a RPI4, RPI3+ and a Odroid-c2 and have no more aarch64 boards to test on…
To name a few open challenges:
- 2 conflicting packages: besides the kernel the python3 wrappers of thee devicetree compiler (dtc) needed to build uboot-tools are not packaged in the upstream package
- Missing a cross-compiler needed for arm trusted firmware (ATF). Did rebuild something a bit matching from FC29 but am on shaky ground here as it supersedes my knowledge
- Even though uboot => 2021.04 should handle efivars better can not get it to find the grub2-efi stub in
EFI/rocky.Still need to copy this to the fallback (removable media) location
- Even though dracut creates a usable intiramfs it segfaults a few times doing so. To my understanding this is caused by some missing drivers and should be addressed in
049-127.git20210107( - install: string_hash_func should not be fed with NULL). For some reason aarch64 is still on
- SELinux: the newer kernel (5.10.x) and policies do not match on all acausions. SELinix is set to enforcing but it throws warnings about missing policies at boot.
- A known issue : boot takes a long time, uboot is single threaded so things seed up a bit after the kernel takes over. Meaning decompression of initramfs and the quite large generic kernel takes a long long time…
Uboot binaries or the RPI3, 3+ and 4 are in place (fat efi partition), it should boot out of the box. (Note it is a completely different setup compered to the socialized Rapsberry image)
- For other boards uboot need to be flashed to the SD-card.
- Precompiled uboot binaries are installed on the image in
/usr/share/uboot, these binaries carry a patch to let uboot look for dtb’s on other partitions then the efi partition.
- If you use a pristine upstream uboot copy the dtb of the board to the root of the efi partition.
- You may need to catenate these uboot binaries with some blobs from the vendor of the board (as with my Odroid-c2)
(ssh)root login is enabled:
user: root password: rocky
As said: A Proof of Concept nothing more!!
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964362589.37/warc/CC-MAIN-20211203030522-20211203060522-00015.warc.gz
|
CC-MAIN-2021-49
| 2,453
| 20
|
https://slitherio.online/hexanautio
|
code
|
Hexanautio and eat smaller Hexanauts to grow, or avoid being eaten by other players. This game is a multiplayer snake game where you control a hexagonal spaceship instead of a traditional snake. Each player takes on the role of an engineer on a starship that ran aground in the midst of an ion storm. You are the hexagonal pilot of an amazing plane that has fallen into a maze filled with other pilots, all trying to eat your tail before you can. As an engineer, your main goal is to repair the damaged ship so that it can return to space again. You do this by collecting power buttons from the center of the playing field, returning them to one of your three tools, and activating them. Your secondary goal is to be the last engineer to destroy all other players. Challenge your friends or anyone from around the world in this strategy puzzle game! Will you be able to eat your tail first?
How to play Hexanaut.io
Controls Move the mouse to navigate your character.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947476464.74/warc/CC-MAIN-20240304165127-20240304195127-00419.warc.gz
|
CC-MAIN-2024-10
| 966
| 3
|
https://lists.freebsd.org/pipermail/freebsd-ports/2006-June/033318.html
|
code
|
error while loading shared libraries:
/usr/X11R6/lib/libgtk-x11-2.0.so.0: ELF file OS ABI invalid
Alexander at Leidinger.net
Sun Jun 18 19:00:18 UTC 2006
Quoting Boris Samorodov <bsam at ipt.ru> (Sun, 18 Jun 2006 19:31:55 +0400):
> On Sun, 18 Jun 2006 10:15:17 -0500 David J Brooks wrote:
> > On Sunday 18 June 2006 09:59, David J Brooks wrote:
> > > I recently moved from linux_base-8 to linux_base-fc4 and now I am getting
> > > the following error whenever I try to run Acroread7:
> > >
> > > error while loading shared libraries: /usr/X11R6/lib/libgtk-x11-2.0.so.0:
> > > ELF file OS ABI invalid
> > >
> > > ... clearly I need to load the linux version of libgtk, but which port is
> > > it in?
> > Perhaps more to the point, why is acroread trying to
> > load /usr/X11R6/lib/libgtk-x11-2.0.so.0 instead
> > of /usr/compat/linux/usr/lib/libgtk-x11-2.0.so.0 ?
> > FWIW, both versions of libgtk-x11 are installed.
> Hard to say, there are too many variants. As for me, I didn't get such
> errors. Seems that rebuilding acroread7 and all ports it depends on is
> a best choice here.
If this doesn't help, I suggest "portupgrade -rf linux_base-fc\*"
(forcing a reinstall of everything which depends upon the linux base
I assume there's something wrong with ld.so.cache...
David, did you upgraded by using packages, or did you use the ports?
Selling GoodYear Eagle F1 235/40ZR18, 2x 4mm + 2x 5mm, ~130 EUR
you have to pick it up between Germany/Saarland and Luxembourg/Capellen
http://www.Leidinger.net Alexander @ Leidinger.net: PGP ID = B0063FE7
http://www.FreeBSD.org netchild @ FreeBSD.org : PGP ID = 72077137
More information about the freebsd-ports
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-18/segments/1555578531984.10/warc/CC-MAIN-20190421140100-20190421162100-00233.warc.gz
|
CC-MAIN-2019-18
| 1,653
| 31
|
https://jonic.cn/qa/?qa=12213/google-chrome-os-is-there-any-way-to-get-the-real-ip-of-a-chromebook-from-an-android-app
|
code
|
I have an Android app that needs the real IP of the device, not the virtual network IP. I don't want the the public IP unless the Chromebook is on a public IP, I just need the private one of the LAN, but right now I'm getting a virtual IP of what I'm guessing is a virtual network for Android apps.
Using both WifiManager and NetworkInterface.getNetworkInterfaces() all I get is the virtual IP. Calling an external server won't work because that would get me the public IP.
I know this has been asked in the past but I just want to check if anyone has found a way yet?
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679515260.97/warc/CC-MAIN-20231211143258-20231211173258-00343.warc.gz
|
CC-MAIN-2023-50
| 568
| 3
|
https://www.freelancer.com/projects/graphic-design-stationery-design/quotation/
|
code
|
I want to automate our quotation procedures, make the documents look profesional and polished, add data, specifications etc
We spend a lot of our time producing quotes for our trade customers. I want a template style form / word document that can easily be edited or docs, photos added etc. Want it to look more profesional than what we are currently using.
Need someone with excellent word doc template skills
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-09/segments/1518891811352.60/warc/CC-MAIN-20180218023321-20180218043321-00582.warc.gz
|
CC-MAIN-2018-09
| 410
| 3
|