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://loighic.net/macro/AD_AS/
|
code
|
When put the aggregate demand curve and the aggregate supply curves together, we get a graph like the one shown in figure 1.
The point at which the aggregate demand (AD) and short-run aggregate supply (SRAS) curves intersect is the equilibrium. Given the way that the model is designed, it’s not possible to deviate from the equilibrium.1 The current real GDP just is the point where aggregate demand equals short-run aggregate supply. So, rather than being concerned with surpluses or shortages, the central issue now is the degree to which a particular equilibrium is benefiting society.
GDP, inflation, and unemployment
With the AD-AS model, we can represent changes to GDP, the price level, and unemployment. Since real GDP is on the horizontal axis, any change to aggregate demand or short-run aggregate supply that moves the equilibrium to the right will thereby increase GDP. Any change to aggregate demand or short-run aggregate supply that moves the equilibrium to the left will decrease GDP.
Changes to the price level (on the vertical axis) meanwhile indicate either inflation or deflation. Inflation occurs when the price level increases—for instance, if it changes from 100 to 103. And deflation occurs when the price level decreases.
Long-run aggregate supply is potential GDP, which is the point at which we have full employment (and all other economic resources are also fully engaged). Recall from Categories of unemployment that full employment is when there is frictional and structural unemployment, but no cyclical unemployment. Consequently, if the equilibrium is on the long-run aggregate supply curve—that is, all three curves intersect at one point—then there is zero cyclical unemployment. (See figure 1.)
Anytime the aggregate demand or aggregate supply curves shift such that the equilibrium moves to the left, unemployment increases. While anytime the equilibrium moves to the right, unemployment decreases.
Changes to AD and SRAS
If you recall demand and supply shifting in the supply and demand model, then the basic mechanics of aggregate demand or short-run aggregate supply increasing or decreasing will be familiar to you. But here, when such changes happen, we want to track the effects on GDP, inflation, and unemployment.
Remember, when we track these changes, the equilibrium occurs at the intersection of the aggregate demand (AD) and short-run aggregate supply (SRAS) curves. Where that intersection is relative to long-run aggregate supply (LRAS) matters, but, unless all three intersect at the same point, AD or SRAS intersecting with LRAS doesn’t mean anything.
Aggregate demand increases
When aggregate demand increases, the aggregate demand curve shifts to the right, and, as is shown in figure #, the equilibrium changes from point A to point B. This means that the following will happen. (1) The price level will increase; in this case, from 95 to 100. (2) Real GDP will increase; in this case, from $7 trillion to $8 trillion. And (3) although the equilibrium is still to the left of long-run aggregate supply (i.e., potential GDP), it is now closer to that line.
This means that (1) there is inflation, (2) GDP has increased, and (3) unemployment has decreased.
Aggregate supply decreases
When short-run aggregate supply decreases, the short-run aggregate supply curve shifts to the left, and, as is shown in figure #, the equilibrium changes from point A to point B. This means that the following will happen. (1) The price level will increase; in this case, from 100 to 105. (2) Real GDP will decrease; in this case, from $7.5 trillion to $6.8 trillion. And (3) the equilibrium is farther to the left of long-run aggregate supply than it was initially.
This means that (1) there is deflation, (2) GDP has decreased, and (3) unemployment has increased.
The AD-AS model
The AD-AS model is useful for understanding the macroeconomy and, to an extent, making predictions about the future. It will not always make precise predictions, however. We have accurate information about current GDP (real and nominal) and the price level, but that only gives us one point on the graph. The exact shapes of the aggregate demand and the short-run aggregate supply curve are estimates, as is the placement of the long-run aggregate supply curve. And predicting when and by how much the AD and SRAS curves will shift means anticipating how millions of people will react to economic changes such as increases or decreases in taxes, or to a rise or fall in energy prices.
If we are looking at supply and demand for a single market (like we did earlier), then we know that there will be a surplus when the quantity supplied is greater than the quantity demanded. In the AD-AS model, however, if suppliers produce extra inventory, it just gets counted in the investment portion of GDP, and so it is, by definition, part of the current aggregate demand. Hence, there can’t really be a surplus in this model. ↩
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817382.50/warc/CC-MAIN-20240419074959-20240419104959-00203.warc.gz
|
CC-MAIN-2024-18
| 4,953 | 19 |
http://mathhelpforum.com/statistics/38941-how-many-rectangles.html
|
code
|
How many rectangles can be made from 12 boxes......
Also how many rectangles can be made fro 15 or 11 boxes.
Not enough information, thus an infinite number.
Now, each box has six faces which are rectangles themselves. This gives you a total of 72 rectangles. Are we putting these boxes together to make rectangular shapes? If so, then there are + + + .... possibilities.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917120349.46/warc/CC-MAIN-20170423031200-00417-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 371 | 4 |
http://programmingprojecthelp48023.imblogs.net/9103757/python-project-help-no-further-a-mystery
|
code
|
Python makes it possible for boolean expressions with a number of equality relations inside a way that may be according to standard use in mathematics. By way of example, the expression a < b < c checks irrespective of whether a is below b and b is lower than c.
Archived from the original on 11 August 2010. we made three levels of equipment ... Another stage provides Python and XML guidance, permitting modders with much more practical experience manipulate the game globe and everything in it.
Rise up and managing with item-oriented programming by seeing our Python tutorials. Skilled-taught video clips on this open-source software package demonstrate how to write Python code, which include building features and objects, and offer Python illustrations like a normalized database interface along with a CRUD application.
The default Edition performs a memberwise copy, the place Each individual member is copied by its very own duplicate assignment operator (which may also be programmer-declared or compiler-created).
Nonetheless, the site is generally preserved by volunteers, we do not supply any distinct Support Stage Agreement, and as could possibly be predicted for a large distributed method, issues can and often do go Completely wrong. See our status web page for present-day and earlier outages and incidents. When you've got large availability demands in your bundle index, take into consideration both a mirror or A personal index. How can I add to PyPI?
user211037 3973711 two The usage of "from numpy import *" is a foul follow. It pollutes the global namespace. "import numpy as np" is healthier. When you have particular capabilities you use a whole lot, and you are Bored with creating np.
Your Digital Certification will probably be extra on your Accomplishments website page - from there, you may print your Certification or incorporate it to your LinkedIn profile. If You simply would like to read through and look at the course articles, you can audit the study course free of charge.
R is really a programming language and no cost application atmosphere for statistical computing and graphics supported through the R Basis for Statistical Computing. The R language is widely made use of among statisticians and information miners for developing statistical software[seven] and knowledge Evaluation.
CPython's public releases are available in a few forms, distinguished by which part of the Variation selection is incremented:
Python's growth team monitors the state in the code by jogging the massive device exam suite throughout growth, and utilizing the BuildBot continual integration system.
During this module you may set factors up in order to generate a knockout post Python applications. Not all routines With this module are expected for this course so make sure you read the "Applying Python With this Course" materials for information....
Cython is also accessible, which translates a Python script into C and makes immediate C-amount API calls into the Python interpreter.
The R & BioConductor guide supplies a basic introduction into the utilization of the R setting and its basic command syntax.
Congratulations on the release of your respective Python deal! Your code may well improve from these humble beginnings,
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376827963.70/warc/CC-MAIN-20181216165437-20181216191437-00348.warc.gz
|
CC-MAIN-2018-51
| 3,258 | 14 |
https://forum.mendix.com/link/space/security/questions/127618
|
code
|
I have Mendix application with a bound Xsuaa connector. Somewhere on my cloud environment it should store the secretKey to verify my oAuth tokens. Where is this key located?
I know verifying the bearer tokens is done automatically outside the mendix context when a user tries to sign in with SSO. So normally you wouldnt need to know this key. But i'm also using this token in a published Odataservice in another mendix application. I need the key here to unsign the token, to check if im really allowed to get this data in this application. I can see in the java code StartXsuaaIntegration.java that it tries to get some settings from the current environment the app is running on. This settings object is later used to getSecretKey(). "final XsuaaBindingSettings settings = XsuaaBindingSettings.importSettingsFromEnvironment();” But how do i acces these settings from the sprintr environment? It does not look like developers/technicaladmins have rights to see this?
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233506528.19/warc/CC-MAIN-20230923162848-20230923192848-00764.warc.gz
|
CC-MAIN-2023-40
| 970 | 2 |
http://copia.com/support/refmanual82/$voice_phone-fs.htm
|
code
|
Specify Phone Number for Voice Broadcast
This command identifies the voice phone number to call in a voice outbound (voice broadcast) application (which requires voiceout line operation enabled). This is a required command for this application and must not be used in the same file as $fax_phone. For fax server and broadcast operations, the phone number will be inserted by the client application, perhaps from a broadcast list or phone book.
The parameters on this command are used as follows:
|phonenum||voice phone number to call, enclosed in double quotes if it contains embedded spaces.|
|infobox||infobox to transfer to when the call is answered.|
Note that other commands starting $fax_... in the FS file have their usual functions even though no fax transmission is involved.
After processing the sequence of infoboxes needed for your voice outbound application, you should normally transfer control using $next_box to one of the three states VOICE_FAIL (S34), VOICE_RETRY (S156) or VOICE_EXIT (S155). If you fail to transfer to one of these states, the call is treated as successful and after hangup the FS file is moved to SENT.
The use of non-numeric characters in the dial string is described in the topic for $fax_phone.
Default: none (required entry for voice outbound)
$voice_phone "6306828898" 1234
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-04/segments/1547583656897.10/warc/CC-MAIN-20190116052151-20190116074151-00099.warc.gz
|
CC-MAIN-2019-04
| 1,315 | 10 |
https://mail.python.org/pipermail/mailman-users/2005-April/044256.html
|
code
|
[Mailman-Users] Listing bouncing addresses
mmm at nv.jakaranda.co.za
Fri Apr 22 14:44:50 CEST 2005
from a previous mail:
On Tuesday 19 April 2005 04:59 pm, Michael Loftis wrote:
> IS there any pre-built way of getting a list of users disabled for bouncing
> for a given list (CLI or web...)? Or am I just going to have to throw
> something together using withlist?
bin/list_members --nomail=bybounce [listname]
I did this on my list, but it does not give me the addresses with a bounce
score > 0.
How do I get a list of all the subscribers with a bounce score > 0 (and not
More information about the Mailman-Users
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-26/segments/1529267864110.40/warc/CC-MAIN-20180621075105-20180621095105-00158.warc.gz
|
CC-MAIN-2018-26
| 613 | 13 |
http://qaphui.blogspot.com/2015/04/final-day-of-information-skills.html
|
code
|
|Rouven & Gudrun, with some participants|
Google -- for most researchers -- has become the go-to place. However the engine doesn't have all the answers to questions a researcher has.
Participants were also advised to turn off instant results occasionally so as to get exactly what they were looking for.
This guide shows how one can apply some operators in their queries on Google Search to help them get better results. Additionally, one can also take this self-paced Google Search online course. I highly recommend it. ;-)
Here are some links one can use to augment the information Google has to offer:
- Crawli (in German)
- Twingly (for finding blogs)
- Metacrawler (this searches other search engines)
- Search Engine Guide
- ipl2 (Internet library good for academic research)
The 'perception' that an information found on the Internet must be correct needs to be watched. To test participants, Rouven gave a number of tasks on verifying information found online.
This. Was. Interesting.
Two resources one can consult to check domain ownership are WHOis.net and IANA WHOis Service.
Also read this blog post on how to verify a tweet.
This workshop has been fun, educative, and inspirational. It's my hope that my colleagues at the workshop -- and myself -- will go on to enrich our research careers, by applying all that we learnt.
As for you my fellow reader, I'm sure these posts of mine equip you as well to enrich your research approaches as well.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917121869.65/warc/CC-MAIN-20170423031201-00302-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 1,455 | 16 |
https://practicaldev-herokuapp-com.global.ssl.fastly.net/benoitpetit/deploy-your-own-database-with-supabase-and-docker-in-a-few-simple-steps-5g19?comments_sort=oldest
|
code
|
If you are looking for a powerful and easy-to-use NoSQL database solution, then Supabase might be the perfect choice for you. Supabase is an open-source database service that allows you to quickly create web and mobile applications using Firebase, but with the flexibility and power of a PostgreSQL database.
- A computer with Docker and Docker Compose installed
- A GitHub account (to retrieve configuration files)
The first step is to retrieve Supabase's configuration files from GitHub. To do this, go to the Supabase GitHub page (https://github.com/supabase/supabase) and download the configuration files by clicking on “Clone or download” and then “Download ZIP”.
Once you have downloaded the files, unzip them in a directory of your choice.
Before starting Supabase, you need to configure a few settings for your installation. Open the “docker-compose.yml” file and modify the following lines:
- POSTGRES_USER: replace “supabase” with your database's username
- POSTGRES_PASSWORD: replace “supabase” with your database's password
- PGDATA: replace “/var/lib/postgresql/data/pgdata” with the path where you want to store your database's data
Once you have configured the settings, you can now start Supabase using Docker. Open a terminal and navigate to the directory where you unzipped the configuration files. Then, type the following command:
docker-compose up -d
This will start Supabase in daemon mode (in the background) and you will be able to see the startup messages in the terminal.
Once Supabase is started, you can access the admin interface by accessing the URL “http://localhost:3000” in your browser. You will then need to log in with the username and password you configured in the “docker-compose.yml” file.
Once logged in, you can create tables, add data, and configure access permissions. You can also use the REST API to interact with your database from a front-end or back-end application.
In summary, setting up a self-hosted Supabase with Docker is a simple process that only requires a few configuration steps. This gives you the freedom to deploy Supabase on your own server or private cloud, with more flexibility and control over data and performance. Don't hesitate to explore Supabase's advanced features to fully benefit from its advantages.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233508959.20/warc/CC-MAIN-20230925083430-20230925113430-00130.warc.gz
|
CC-MAIN-2023-40
| 2,308 | 15 |
http://imaginatik.com/blog/what-crowd-imaginatik-global-forum
|
code
|
What a crowd at the Imaginatik Global Forum!!
Wish you could all be here for today's global forum. Here's a view of the audience. It is a very full house!!
[caption id="attachment_116" align="alignleft" width="225" caption="Full house here at the Global Forum.. Wish you were here!!"][/caption]
Here's the agenda.
If you'd like to attend our live webinar, please let me know. E-mail me at [email protected]
or follow us via our twitter hashtag: #IMTKForum
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917118831.16/warc/CC-MAIN-20170423031158-00319-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 455 | 6 |
https://android.stackexchange.com/questions/111345/edit-whatsapp-contact-name-in-samsung-galaxy-s3-neo
|
code
|
I wrongly saved one of my friend's name. Later renamed it with original name but when I searched contacts in WhatsApp I saw his name is still old one. I can't find a way to change name. I tried to edit via mobile contacts, but edit button in WhatsApp contact is disable. How to change WhatsApp contact that name in Samsung Galaxy S3 Neo?
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100518.73/warc/CC-MAIN-20231203225036-20231204015036-00656.warc.gz
|
CC-MAIN-2023-50
| 337 | 1 |
https://community.spotify.com/t5/Subscriptions/Showtime-not-linking-to-my-Student-Premium-Spotify-Account/td-p/5248475
|
code
|
Whenever I attempt to link my showtime account to my Spotify premium account, I get an error. The steps I use to activate my showtime account are:
1. Open my Spotify account page
2. Navigate to "Your Services"
3. Click the banner that says "Activate" under Showtime
4. Login with the SAME email as my Spotify
5. After logging in I receive the "Problem with your subscription" error and I am unable to access showtime content.
As you can imagine this is quite frustrating because I'm not getting the services I pay for. There was no firm solution on either of your websites and I was told to go to Spotify for help with this issue.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296943746.73/warc/CC-MAIN-20230321193811-20230321223811-00371.warc.gz
|
CC-MAIN-2023-14
| 630 | 7 |
https://snogssite.com/threads/ozzmodz-mark-all-conversations-paid.3846/
|
code
|
Bbeakernz Which exactly action?
Can you send me via PM your slow query log? (enable in MySQL configuration)
UPDATE/DELETE queries can be slow on large forums with millions conversations.
Your MySQL server must be configured for faster performance by experienced system administrator. I just can advise to increase the innodb_buffer_pool_size or move database to server with higher I/O.
There is nothing we can do about this on the add-on side. The operations is already performed through the job scheduler to reduce the impact on server performance.
Well it definitely works, it got several 1,000 of them. How long do you think it should take to do that many? I'm not a server guy so might be delays if i need to modify the server config and such to get some logs.
I have 8k unread conversations that I want to mark as read, when I click "mark all conversations" it loads for a while but then just stops / timesout... No error message or change on the page it just stops loading
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817382.50/warc/CC-MAIN-20240419074959-20240419104959-00670.warc.gz
|
CC-MAIN-2024-18
| 978 | 7 |
https://hardforum.com/threads/zalman-heatpipe-ramsinks-yes-no.709646/
|
code
|
Will the Zalman heatpipe (the 80C one - grey/silver) work with ramsinks? I ordered OCZ copper ramsinks (not the flower ones). Hoping I'll be able to fit them under there. If not, I'll have to sell the Zalman and get me a 1U cooler or something.
the copper heatsinks, are you talking about these ?
if its those, i think they wouldnt fit on the top side
there is only about 6 mm of clearence and the heatsinks are 9 mm high
unless you sand off some of the heatsinks, they wont fit
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780057303.94/warc/CC-MAIN-20210922011746-20210922041746-00040.warc.gz
|
CC-MAIN-2021-39
| 478 | 5 |
https://forum.uipath.com/t/element-appear/249689
|
code
|
I do the envoke VBA to refresh pivot table, however, when I run the envoke, it appears a window to ask to type the password to refresh data from data warehouse.
I try to use On element appear to type into password on the pop-up window, but it doesnt work.
Could you guide me with this?
If you expect it to really appear everytime, try to use “Element exists” to check if the pop up is there. And if it is there then go on to typing in the authentication details and click OK
@Li_Pham please check the pop up using element exists and if it exists you can use type into activity for entering username and password and use click activity to click ok button.
I have tried the element exists but because I use evoke vba to refresh, so nearly it cannot catch element exist when pop up appear.
I have tried the element exists to catch the pop up but it is not working.
I use the VBA belowed to refresh, could we add the password and username of sql server to the VBA code to refresh? Please help me.
Try to use a delay after the refresh before the element exists activity
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038072175.30/warc/CC-MAIN-20210413062409-20210413092409-00232.warc.gz
|
CC-MAIN-2021-17
| 1,068 | 9 |
https://bugzilla.xamarin.com/44/44713/bug.html
|
code
|
Notice (2018-05-24): bugzilla.xamarin.com is now in
Please join us on
Visual Studio Developer Community and in the
Mono organizations on
GitHub to continue tracking issues. Bugzilla will remain
available for reference in read-only mode. We will continue to work
on open Bugzilla bugs, copy them to the new locations
as needed for follow-up, and add the new items under Related
Our sincere thanks to everyone who has contributed on this bug
tracker over the years. Thanks also for your understanding as we
make these adjustments and improvements for the future.
Please create a new report on
Developer Community or GitHub with
your current version information, steps to reproduce, and relevant error
messages or log files if you are hitting an issue that looks similar to
this resolved bug and you do not yet see a matching new report.
I'm trying to compile a simple app for WatchOS 3 but both WatchAppInstalled and Paired properties appear to be missing from WatchConnectivity.WCSession class even though they appear in the documentation.
Can you confirm?
This is only available on the phone API, not watch API.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780057158.19/warc/CC-MAIN-20210921041059-20210921071059-00104.warc.gz
|
CC-MAIN-2021-39
| 1,111 | 19 |
https://joshuastuebner.com/projects/details/simple-stuff/
|
code
|
- Collection of mini projects - to please myself, mostly
- Tech stack
Every now and again I get these very small ideas, that I want to try or a simple joy in creating things. These ideas are often way to small to create a full website for them, so I created a place to collect them.
You can find pretty much everything from stupid jokes, generative art, animation and UI elements here.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296945242.64/warc/CC-MAIN-20230324020038-20230324050038-00528.warc.gz
|
CC-MAIN-2023-14
| 385 | 4 |
https://en.freedownloadmanager.org/Windows-PC/VC-In-Easy-Steps.html
|
code
|
Downloading VC++ In Easy Steps 2.2 from the developer's website was possible when we last checked. We cannot confirm if there is a free download of this software available. The most popular versions of the software 2.2, 2.0 and 1.0. This program is a product of KTS InfoTech.
The software relates to Education Tools. We cannot guarantee that the program is safe to download as it will be downloaded from the developer's website. Before launching the program, check it with any free antivirus software. The most frequent installer filename for the software is: TutorialManager.exe.
From the developer:
VC ++ In Easy Steps is a set of VC Tutorials which helps you to learn VC quickly, using real time short videos. Using this VC ++ In Easy Steps, anybody who has knowledge in basic object oriented concepts can easily master VC ++ . These VC ++ In Easy Steps tutorials are divided into 9 lessons. Each tutorial is explained in detail with examples containing both source code and video.
You may want to check out more software, such as VB.NET In Easy Steps, !Easy ScreenSaver Station or STEP-NC Machine, which might be similar to VC++ In Easy Steps.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100972.58/warc/CC-MAIN-20231209202131-20231209232131-00144.warc.gz
|
CC-MAIN-2023-50
| 1,147 | 5 |
https://ai6ua.net/blog/2020/02/04/20200204/
|
code
|
Apparently yesterday's journal entry was filed under today due to timezone differences (e.g. having written it on a machine in Finland). Shuffled that around and now here we are.
I kicked off the Nomad rewrite in Go this morning with Wally and Aaron. I'm at least going to start working on the database part.
I also want to express my appreciation and admiration for CSpace, Chris Siebenmann's blog. It's the kind of blog I'm trying to be able to write. Interestingly, I noticed today that because it's sort of a wiki, every page ends up being a tag... which is kind of what I'm going for with Kortex.
Now part of that is hard because I work at Google and Google has so many internal things that it's hard for me to know what I can write about - not just from a legal perspective but from a "what makes sense to talk about" perspective. Something to figure out.
I ran into a problem where a bunch of GTK apps would crash; emacs-gtk3 (but not emacs-gtk2!) would do it, firefox would if I tried to upload a file to bsd.network, kicad would crash if I tried to open a file dialog, all with the same error:
(kicad:50689): Gtk-WARNING **: 07:42:49.208: Could not load a pixbuf from icon theme. This may indicate that pixbuf loaders or the mime database could not be found. ** Gtk:ERROR:gtkiconhelper.c:494:ensure_surface_for_gicon: assertion failed (error == NULL): Failed to load /usr/local/share/icons/Adwaita/16x16/status/image-missing.png: Unrecognized image file format (gdk-pixbuf-error-quark, 3) Bail out! Gtk:ERROR:gtkiconhelper.c:494:ensure_surface_for_gicon: assertion failed (error == NULL): Failed to load /usr/local/share/icons/Adwaita/16x16/status/image-missing.png: Unrecognized image file format (gdk-pixbuf-error-quark, 3) zsh: abort (core dumped) kicad
Inspecting the core dumps leads to backtraces in g_assertion_message.
The problem was that my packages and and my kernel were out of date. It just so happened that I installed in the gap between updates, so when my kernel updated and I upgraded my packages, it was still out of date. The solution is to make sure that your kernel and packages are in sync.
Also note to self: dhclient.conf options need a semicolon at the end. The error message is next to useless, and I went through a lot of permutations before figuring out it needed a semi-colon. I didn't realise there were examples in /etc/examples, looking only in /usr/share/doc. That's something to keep in mind in the future.
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-16/segments/1585371606067.71/warc/CC-MAIN-20200405150416-20200405180916-00387.warc.gz
|
CC-MAIN-2020-16
| 2,449 | 9 |
https://www.webopedia.com/definitions/heap-sort/
|
code
|
1. Remove the topmost item (the largest) and replace it with the rightmost leaf. The topmost item is stored in an array.
2. Re-establish the heap.
3. Repeat steps 1 and 2 until there are no more items left in the heap.
The sorted elements are now stored in an array.
A heap sort is especially efficient for data that is already stored in a binary tree. In most cases, however, the quick sort algorithm is more efficient.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233509023.57/warc/CC-MAIN-20230925151539-20230925181539-00438.warc.gz
|
CC-MAIN-2023-40
| 420 | 5 |
http://www.gsp.com/cgi-bin/man.cgi?section=1&topic=cpaldjvu
|
code
|
|Specify the resolution information encoded into the output file expressed in dots per inch. The resolution information encoded in DjVu files determine how the decoder scales the image on a particular display. Meaningful resolutions range from 25 to 6000. The default value is 300 dpi.|
|Specify a maximum number of distinct colors for the color quantization algorithm. process. The default value is 256. Smaller values can produce much smaller files.|
|Cause the background layer to use the lightest quantified color instead of the dominant color.|
Display informational messages while running.
The color quantization might introduce severe degradation if the image contains photographic areas with a large number of very similar colors. Color quantization problems might be solved by pre-processing the input file with a different quantization program such as ppmquant. Avoid using the error diffusion dithering algorithm. This algorithm generates random dithering patterns that might be very costly to encode.
This program should be rewritten as a pre-processor for csepdjvu.
This program was initially written by L146;eon Bottou <[email protected]> and was improved by Bill Riemers <[email protected]> and many others.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376827639.67/warc/CC-MAIN-20181216095437-20181216121437-00246.warc.gz
|
CC-MAIN-2018-51
| 1,235 | 7 |
https://www.groundai.com/project/finite-element-approximation-of-the-laplace-beltrami-operator-on-a-surface-with-boundary/
|
code
|
Finite Element Approximation of the Laplace-Beltrami Operator on a Surface with Boundary
We develop a finite element method for the Laplace-Beltrami operator on a surface with boundary and nonhomogeneous Dirichlet boundary conditions. The method is based on a triangulation of the surface and the boundary conditions are enforced weakly using Nitsche’s method. We prove optimal order a priori error estimates for piecewise continuous polynomials of order in the energy and norms that take the approximation of the surface and the boundary into account.
Subject Classification Codes:
Laplace-Beltrami operator, surface with boundary, Nitsche’s method, a priori error estimates.
Finite element methods for problems on surfaces have been rapidly developed starting with the seminal work of Dziuk . Different approaches have been developed including methods based on meshed surfaces, , , , , and methods based on implicit or embedded approaches, , , , see also the overview articles and , and the references therein. So far the theoretical developments are, however, restricted to surfaces without boundary.
In this contribution we develop a finite element method for the Laplace-Beltrami operator on a surface which has a boundary equipped with a nonhomogeneous Dirichlet boundary condition. The results may be readily extended to include Neumann conditions on part of the boundary, which we also comment on in a remark. The method is based on a triangulation of the surface together with a Nitsche formulation for the Dirichlet boundary condition. Polynomials of order are used both in the interpolation of the surface and in the finite element space. Our theoretical approach is related to the recent work where a priori error estimates for a Nitsche method with so called boundary value correction is developed for the Dirichlet problem on a (flat) domain in . We also mention the work where the smooth curved boundary of a domain in is interpolated and Dirichlet boundary conditions are strongly enforced in the nodes.
Provided the error in the position of the approximate surface and its boundary is (pointwise) of order and the error in the normals/tangents is of order , we prove optimal order error estimates in the and energy norms. No additional regularity of the exact solution, compared to standard estimates, is required. The proof is based on a Strang lemma which accounts for the error caused by approximation of the solution, the surface, and the boundary. Here the discrete surface is mapped using a closest point mapping onto a surface containing the exact surface. The error caused by the boundary approximation is then handled using a consistency argument. Special care is required to obtain optimal order error estimates and a refined Aubin-Nitsche duality argument is used which exploits the fact that the dual problem is small close to the boundary since the dual problem is equipped with a homogeneous Dirichlet condition.
The outline of the paper is as follows: In Section 2 we formulate the model problem and finite element method. We also formulate the precise assumptions on the approximation of the surface and its boundary. In Section 3 we develop the necessary results to prove our main error estimates. In Section 4 we present numerical results confirming our theoretical findings.
2 Model Problem and Method
2.1 The Surface
Let, be a surface with smooth boundary , where is a smooth closed connected hypersurface embedded in . We let be the exterior unit normal to and be the exterior unit conormal to , i.e. is orthogonal both to the tangent vector of at and the normal of . For , we denote its associated signed distance function by which satisfies , and we define an open tubular neighborhood of by with . Then there is such that the closest point mapping assigns precisely one point on to each point in . The closest point mapping takes the form
For the boundary curve , let be the distance function to the curve , and be the associated closest point mapping giving raise to the tubular neighborhood . Note that there is such that the closest point mapping is well defined. Finally, we let and introduce .
Clearly we may take to be a surface that is only slightly larger than but for simplicity we have taken closed in order to obtain a well defined closest point mapping without boundary effects in a convenient way.
Our theoretical developments covers a smooth orientable hypersurface with smooth boundary in , also for .
2.2 The Problem
For each let and be the tangent and normal spaces equipped with the inner products and . Let be the projection of onto the tangent space given by and let be the orthogonal projection onto the normal space given by . The tangent gradient is defined by . For a tangential vector field , i.e. a mapping , the divergence is defined by . Then the Laplace-Beltrami operator is given by . Note that we have Green’s formula
Find such that
where and are given data. Thanks to the Lax-Milgram theorem, there is a unique solution to this problem. Moreover, we have the elliptic regularity estimate
since and are smooth. Here and below we use the notation to denote less or equal up to a constant. We also adopt the standard notation for the Sobolev space of order on with norm . For we use the notation with norm , see for a detailed description of Sobolev spaces on smooth manifolds with boundary.
2.3 The Discrete Surface and Finite Element Spaces
Let be a family of connected triangular surfaces with mesh parameter that approximates and let be the mesh associated with . For each element , there is a bijection such that , where is a reference triangle in and is the space of polynomials of order less or equal to . We assume that the mesh is quasi-uniform. For each , we let be the unit normal to , oriented such that . On the element edges forming , we define to be the exterior unit conormal to , i.e. is orthogonal both to the tangent vector of at and the normal of . We also introduce the tangent projection and the normal projection , associated with .
Geometric Approximation Property.
We assume that approximate in the following way: for all it holds
Note that it follows that we also have the estimate
for the unit tangent vectors and of and .
Finite Element Spaces.
Let be the space of parametric continuous piecewise polynomials of order defined on , i.e.
where is the space of polynomials of order less or equal to defined on the reference triangle defined above.
2.4 The Finite Element Method
Here is a parameter, and is extended from to in such a way that and
where for and for .
Note that in order to prove optimal a priori error estimates for piecewise polynomials of order we require and thus . For we have and for we require . Thus we conclude that (2.17) does not require any additional regularity compared to the standard situation. We will also see in Section 3.4 below that there indeed exists extensions of functions that preserve regularity.
3 A Priori Error Estimates
We derive a priori error estimates that take both the approximation of the geometry and the solution into account. The main new feature is that our analysis also takes the approximation of the boundary into account.
3.1 Lifting and Extension of Functions
For each function defined on we define the extension
to . For each function defined on we define the lift to by
Here and below we use the notation for any subset .
The derivative of the closest point mapping is given by
where and are the tangent spaces to at and to at , respectively. Furthermore, is the tangential curvature tensor which satisfies the estimate , for some small enough , see for further details. We use to denote a matrix representation of the operator with respect to an arbitrary choice of orthonormal bases in and .
Gradients of extensions and lifts are given by
where the gradients are represented as column vectors and the transpose is defined by , for all and .
We have the following estimates
We have the change of variables formulas
for a subset , and
for a subset . Here denotes the absolute value of the determinant of (recall that we are using orthonormal bases in the tangent spaces) and denotes the norm of the restriction of to the one dimensional tangent space of the boundary curve. We then have the estimates
Estimate (3.8) appear in several papers, see for instance . Estimate (3.9) is less common but appears in papers on discontinuous Galerkin methods on surfaces, see , , and . For completeness we include a simple proof of (3.9).
Verification of (3.9).
Let be a parametrization of the curve in , with some positive real number. Then , , is a parametrization of . We have
Here we estimated by first using the identity
(3.13) (3.14) (3.15) (3.16)
and then using the estimate , for , to conclude that
We define the norms
Here denotes the unit exterior conormal to ; that is, is a tangent vector to , which is orthogonal to the curve and exterior to . Then the following equivalences hold
Here and . Note that .
We will see that it is convenient to have access to the norms and , involving the boundary terms since that allows us to take advantage of stronger control of the solution to the dual problem, which is used in the proof of the error estimate, see Theorem 3.2, in the vicinity of the boundary.
Verification of (3.22).
Next we have the identity
and thus using the uniform boundedness of we obtain by changing domain of integration from to , using (3.9), and then splitting into components normal and tangent to ,
where is the tangent vector to and finally used an inverse estimate to bound the tangent derivative. Multiplying by we thus have
The converse estimate follows by instead starting from the identity
and then using similar estimates give
3.3 Coercivity and Continuity
provided is large enough. Furthermore, it follows directly from the Cauchy-Schwarz inequality that is continuous
Existence and uniqueness of the solution to the finite element problem (2.14) follows directly from the Lax-Milgram lemma.
3.4 Extension and Interpolation
Next, we briefly review the fundamental interpolation estimates which will be used throughout the remaining work.
We note that there is an extension operator such that
This result follows by mapping to a reference neighborhood in using a smooth local chart and then applying the extension theorem, see , and finally mapping back to the surface. For brevity we shall use the notation for the extended function as well, i.e., on . We can then extend to by using the closest point extension, we denote this function by .
We may now define an interpolation operator , where is the nodal Lagrange interpolation operator. Consequently, the following interpolation error estimate holds
Using the trace inequality to estimate the boundary contribution in ,
where is the diameter of element , we obtain
Note also that since we are concerned with smooth problems where the solution at least resides in and the surface is two dimensional it follows that the solution is indeed continuous from the Sobolev embedding theorem and therefore using the Lagrange interpolant is justified. We will use the short hand notation for the lift of the interpolant and we note that we obtain corresponding interpolation error estimates on using equivalence of norms. We refer to and for further details on interpolation on triangulated surfaces and for interpolation error estimates for the standard Lagrange interpolation operator.
3.5 Strang Lemma
In order to formulate a Strang Lemma we first define auxiliary forms on corresponding to the discrete form on as follows
Here the mapping is defined by the identity
Then we find that is a bijection since and are bijections. Note that , , and are only used in the analysis and do not have to be implemented.
In (3.42) the first term on the right hand side is an interpolation error, the second and third accounts for the approximation of the surface by and can be considered as quadrature errors, finally the fourth term is a consistency error term which accounts for the approximation of the boundary of the surface.
Proof. We have
Using equivalence of norms (3.22) and coercivity of the bilinear form we have
Next we have the identity
where in (3.45) we used the equation (2.14) to eliminate , in (3.46) we added and subtracted and , in
(3.47) we added and subtracted
, and rearranged the terms. Combining
(3.44) and (3.47) directly yields the
Strang estimate (3.42).
3.6 Estimate of the Consistency Error
In this section we derive an estimate for the consistency error, i.e., the fourth term on the right hand side in the Strang Lemma 3.1. First we derive an identity for the consistency error in Lemma 3.2 and then we prove two technical results in Lemma 3.3 and Lemma 3.4, and finally we give a bound of the consistency error in Lemma 3.5. In order to keep track of the error emanating from the boundary approximation we introduce the notation
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-43/segments/1570986693979.65/warc/CC-MAIN-20191019114429-20191019141929-00226.warc.gz
|
CC-MAIN-2019-43
| 12,893 | 88 |
https://www.tomshardware.com/reviews/fusion-hsa-opencl-history,3262-4.html
|
code
|
Scaling The Brick Wall
This AMD core team found itself with two fundamental problems, one technical and the other philosophical, and both had to be solved before anything could move forward.
"On a pure technology and transistor side, we had a conundrum on our hands," says AMD’s Macri. "What makes CPUs go really fast ends up burning a lot of power on a GPU. What makes GPUs go really fast will actually slow a CPU down incredibly. So the first thing we ran into was just getting them to live on the die together. We had the high-speed transistor combined with the very low-resistance metal stack that’s optimal for CPUs versus the GPU’s more moderate-speed transistor optimized around very dense metalization. If you look at the GPU’s metal stack, it looks like the letter T. It looks like the letter Z in a CPU. One’s low-resistance, one’s lower density, and so higher resistance. We knew we had to get these guys to live on the same die where they both perform very well, because no one’s going to give us any accolades if the CPU drops off or the GPU power goes up or performance falls. We needed to do both well. We very quickly discovered that wall."
Imagine the pressure on that team. With billions of dollars and the company’s future at stake, the group eventually realized that a hybrid solution couldn’t exist on the current 45 nm process. Ultimately, 45 nm was too optimized for CPU. Understanding that, the question then became how to tune 32 nm silicon-on-insulator (SOI) so that it would effectively play both sides of the fence. Of course, 32 nm didn’t exist outside of the lab yet, and much of what finally defined the 32 nm node for AMD grew from the Fusion pursuit.
Unfortunately, until the 32 nm challenge was solved, Fusion was at a standstill—and it took a year of work to reach that solution. Only then could design work begin.
Meanwhile, the Fusion team was also fighting a philosophical battle. With the transistor and process struggle, it was massive, but at least the team knew where it needed to go and what the finish line looked like. Even with the transistor challenge figured out, the question still remained of how to best architect an APU.
"One view was like, the GPU should be mostly used for visualization. We should really keep the compute on the CPU side," says Macri. "A second view said, no, we’ve gotta split the views across the two halves. We’ve got this beautiful compute engine on the GPU side; we need to take advantage of it. There were two camps. One said things should be more tightly coupled between the CPU and GPU. Another camp said things should be more loosely coupled. So we had to have this philosophical debate of deciding what we should treat as a compute engine. Through a lot of modeling, we proved that there was an enormous advantage to a vector engine when you have inherent parallelism in your code."
This might have seemed obvious from ATI’s prior work with Stream, but the question was how much work to throw at the GPU. Despite being highly parallel, GPUs remain optimized for visualization. They can process traditional parallel compute tasks, but this introduces more overhead. With more overhead comes more impact on visualization. With infinite available transistors on the die, one could just keep throwing resources at the problem. But, of course, there are only a few hundred million transistors to go around.
"Think of all the applications of the world as a bathtub," says Macri. "If you look at the left edge of the bathtub, we call those applications the least parallel, the ones with the least amount of inherent parallelism. A good example of that would be pointer chasing, right? You need a reference. You need to go grab that memory to figure out the next memory you gotta go grab. No parallelism there at all. The only way to parallelize is to start guessing–prediction. Then, if you go to the right edge of the bathtub, matrix multiply is a great example of a super-parallel piece of code. Everything is disambiguated very nicely, read and write stream is all separate, it’s just beautiful. You can parallelize that out the wazoo. For those applications, it’s very low overhead to go and map that into a GPU. To do the left side well, though, means building a low-latency memory system, and that would load all kinds of problems into a GPU that really wants a high-bandwidth, throughput-optimized memory system. So we said, 'How do we shrink the edges of the bathtub?' Because, the closer we could bring those edges, the more programs we could address in a very efficient way."
A big part of the philosophical debate boiled down to how much to shrink those bathtub edges while preserving all of AMD’s existing visualization performance. Naturally, though, while all of this debate was happening, AMD was getting hammered in the market.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233510179.22/warc/CC-MAIN-20230926075508-20230926105508-00681.warc.gz
|
CC-MAIN-2023-40
| 4,853 | 10 |
https://gist.github.com/martinthomson
|
code
|
The TLS key schedule looks like this:
QUIC effectively exports the various traffic secrets, so I had assumed that its use of the different base label in
HKDF-Expand-Label() would be limited to those uses that were after that export. I forgot key update when writing this up, but that was fixed in #1899.
However, in looking at what people implemented, it appears that the base label they use was used for the entirety of the TLS key schedule.
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-39/segments/1568514572980.56/warc/CC-MAIN-20190917000820-20190917022820-00407.warc.gz
|
CC-MAIN-2019-39
| 442 | 4 |
https://mail.scipy.org/pipermail/scipy-dev/2002-April/000897.html
|
code
|
[SciPy-dev] genetic algorithm, number theory, filterdesign,zerofinding
oliphant at ee.byu.edu
Thu Apr 11 14:57:34 CDT 2002
> Root finders are pretty basic. Looks like the standard call for all of them would be:
> with a (python) float return. a,b,xtol should be double, or converted to double. maxiter is integer, and f returns double to the C routine.
> There is a disagreement between say, fsolve and bisection, where one has the named argument xtol, and the other tol. How should this be resolved?
We should standardize here, but the problem is the different notions of
tolerance. xtol is some (relative) error on x while ftol is some error on
I'm happy with those.
But, sometimes you have a tolerance that is neither xtol nor ftol, but
some combination. Use tol in this case.
> I could probably just look at the wrapper for fsolve and make a few changes, eh?
If you are writing c-code, you don't have to use the extra args variable
in the C-code (that can be handled by the Python wrapper --- and is in
fact by f2py).
So, you can just have the c-function as
rootfind(void *func, double a, double b, double xtol, int maxiter)
for example. Then, the f2py wrapper would include an (extra_args)
argument and take a Python function instead of the void *func)
f2py is really cool, you should get to know it.
More information about the Scipy-dev
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187825141.95/warc/CC-MAIN-20171022041437-20171022061437-00508.warc.gz
|
CC-MAIN-2017-43
| 1,342 | 21 |
https://ageconsearch.umn.edu/record/103238
|
code
|
We describe a means of rejecting a null hypothesis concerning observed, but not deliberately manipulated, variables of the form H0: A -/-> B in favor of an alternative hypothesis HA: A --> B, even given the possibility of causally related unobserved variables. Rejection of such an H0 relies on the availability of two observed and appropriately related instrumental variables. While the researcher will have limited control over the confidence level in this test, simulation results suggest that type I errors occur with a probability of less than 0.15 (often substantially less) across a wide range of circumstances. The power of the test is limited if there are but few observations available and the strength of correspondence among the variables is weak. We demonstrate the method by testing a hypothesis with critically important policy implications relating to a possible cause of childhood malnourishment.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-10/segments/1614178375529.62/warc/CC-MAIN-20210306223236-20210307013236-00541.warc.gz
|
CC-MAIN-2021-10
| 913 | 1 |
https://www.onetrust.com/integrations/microsoft-azure-active-directory/
|
code
|
About Microsoft Azure Active Directory
The Azure Active Directory (Azure AD) enterprise identity service provides single sign-on, multifactor authentication, and conditional access to guard against 99.9 percent of cybersecurity attacks.
Microsoft Azure Active Directory and OneTrust
OneTrust's integration with Azure AD SAML 2.0 SSO ensures all access is controlled using existing corporate user credentials. Users will be provisioned just-in-time with the corresponding access level. Support for multi-factor and setup authentication login may be available from the identity provider.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947474660.32/warc/CC-MAIN-20240226130305-20240226160305-00787.warc.gz
|
CC-MAIN-2024-10
| 585 | 4 |
https://forums.macrumors.com/threads/this-latest-plist-hysteria.1354649/
|
code
|
"Furthermore, The Next Web has confirmed that the same issue affects Dropbox for iOS, similarly allowing a user to simply copy the .plist file from one device to another in order to gain access to the account." Isn't this how prefs/config files are supposed to behave? I am doing exactly the same thing in all of my applications on Mac/Win/iOS. I put stuff into some file and if you move that file to another device my applications will use that file as if it was created on that device. Every time I buy new Mac I drag a lot of files/folders from ~/Library/Preferences (and few other places) folder and I have everything set up on my new computer. Favorites/Bookmarks, cookies, even logins into web forums. Everything works as if I am using my old computer. In short, I use Dropbox iOS framework and I am using it the way everybody else does. The framework saves everything in user defaults - DBSession.m: Code: NSMutableDictionary *credentials = [NSMutableDictionary dictionaryWithDictionary:baseCredentials]; ... [[NSUserDefaults standardUserDefaults] setObject:credentials forKey:kDBDropboxSavedCredentials]; Username/mail and password are not saved, only OAuth token. What else should they do?
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-09/segments/1550247479838.37/warc/CC-MAIN-20190216024809-20190216050809-00221.warc.gz
|
CC-MAIN-2019-09
| 1,198 | 1 |
https://meta.m.wikimedia.org/wiki/Research:Subject_recruitment/vi
|
code
|
This page is kept for historical interest. Any policies mentioned may be obsolete. If you want to revive the topic, you can use the talk page or start a discussion on the community forum.
This page describes how to get support for research projects from the Wikimedia Foundation.
For other kinds of support, please refer to the Research FAQ
Scholarly research of Wikipedia is useful for understanding the encyclopedia's content, readers, editors, history, current state, and future. These results also yield important knowledge applicable to other open content communities. In addition to driving scholarly knowledge of such systems, this work can also give results that can improve Wikipedia itself. Much valuable research cannot be done without Wikimedia community members who volunteer to participate in studies. This page exists to describe a process by which researchers can obtain community approval to recruit research participants for surveys, interviews and experiments.
|WMF support code:|
Until an official policy is approved by the Wikimedia Research Committee regarding subject recruitment, individual requests can be submitted following these instructions.
Submitting a request for subject recruitment
The Research Committee can provide support to researchers seeking to recruit subjects or survey participants from the Wikimedia community. Until an official policy is published by the Committee, subject recruitment requests should be made by creating a project page on this wiki.
Please include the following information:
- a description of the sample of subjects needed for your research as well as the proposed recruitment method
- the motivation for your request
- a short description of your research project (including pointers if applicable)
- the name, affiliation and contact details of the applicant team
- the expected duration and timeline of the project
See this example. Once the page is created, please send the link to: Dario Taraborelli ([email protected]) and Aaron Halfaker ([email protected]) so your request can be reviewed by the RCom. Requests submitted to the RCom usually take 1-2 weeks to be reviewed.
Projects supported by the Wikimedia Research Committee for subject recruitment are expected to meet the following requirements:
|OA (Gold)||OA (Green)||Open licensed output||Open licensed data||Open source code||Reuse rights||Documentation|
- ↑ Survey data must be anonymized and cleared of privacy-sensitive information before being released
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296948673.1/warc/CC-MAIN-20230327154814-20230327184814-00408.warc.gz
|
CC-MAIN-2023-14
| 2,500 | 18 |
https://www.builtinboston.com/2020/03/12/boston-developer-tools-open-source
|
code
|
Performance analyzers, linkers, compilers, GUI designers, assemblers, code editors, debuggers — there are more software development tools on the market than you could shake an ergonomic keyboard at. In 2019, the DevOps market alone was worth $3.5 billion, and as software becomes more layered and complex, it creates problems for developers trying to manage multiple tools and systems running simultaneously — and often with imperfect integrations.
As companies build tools and services that leverage the latest coding techniques, many have come to rely on open-source technology. However, building business applications on open-sourced code can have its drawbacks — namely, hidden bugs and security vulnerabilities. Many companies have emerged in recent years to help businesses wring the benefits from open-sourced projects while protecting from the inherent risks, a number of which have opened offices in Boston.
The city has emerged as an engineering hub for international businesses building developer tools — particularly in the field of open source management. And as the city continues to attract the attention of VCs, Boston’s contributions to developer tool kits worldwide remain strong.
Used for: Identifying vulnerabilities in open-source code.
What it does: Open-source code is a fantastic resource for developers who aren’t looking to reinvent the wheel every time they start a project. However, building critical tools and services on community code can open businesses up to undetected vulnerabilities in the source. WhiteSource says its technology identifies vulnerabilities, prioritizes fixes based on each vulnerability’s relevance to a business’ operations and generates pull requests with suggested fixes. The company also offers open-source management tools for containerized applications.
Company background: Headquartered in Tel Aviv, WhiteSource was founded in 2011. The company has mainly chosen to rely on revenue over investments for cash, though it did raise a $35 million Series C in 2018 from Microsoft’s M12 VC firm and others. WhiteSource was an early player in the field of software composition analysis tools, which companies use to audit projects built on open-source code.
Used for: Monitoring, troubleshooting and securing applications built using Grafana and Elasticsearch, Logstash and Kibana, known together as ELK.
What it does: A growing number of companies increasingly rely on Grafana, an open-source analytics and visualization tool, as well as the combined stack known as ELK. The latter combines Elasticsearch, a search and analytics engine, Logstash, a server-side processing pipeline, and Kibana, a data visualization tool. However, the complexity of relying on the raw open-source code — with any number of hidden bugs and imperfections — can have heavy implications for businesses. Logz.io packages them for use in a business context and automatically scans for bugs and security issues in a company’s code.
Company background: Logz.io ranked on Built In Boston’s 50 Startups to Watch in 2018, and followed it up with a $52 million funding round last year. The company has offices in Boston, Tel Aviv and London.
Used for: Managing open-source code security management.
What it does: Snyk’s platform is another player in the field of open source vulnerability detection and response. The company maintains a database of known vulnerabilities, along with a tool designed to find and fix potential security compromises within a business’ open-source code. Snyk says its platform also prevents vulnerabilities from passing through build processes by adding an automated test within continuous integration or continuous development workflows.
Company background: Snyk works with companies like Intuit, Mastercard, Google and the BBC and raised a whopping $150 million Series C in January, propelling it to unicorn status. Meanwhile, Snyk claimed a 400 percent year-over-year revenue increase in 2019. The company is headquartered in London, with a large office in Boston.
Used for: Building applications for web, mobile and desktop, especially user interfaces.
Company background: Headquartered in Helsinki, Qt has been around since the mid-1990s. In addition to its integrated development environment, Qt’s Design Studio software puts developers and designers to work on a unified framework and language to reduce the time between iterations. Qt’s stateside offices are in Boston, Silicon Valley and Detroit.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500273.30/warc/CC-MAIN-20230205161658-20230205191658-00171.warc.gz
|
CC-MAIN-2023-06
| 4,492 | 14 |
https://www.chamberlaincarryingco.co.uk/shop/4580599285/horseshoes/7029909
|
code
|
Genuine used horseshoes from my local farrier.
These horseshoes come with 'Good luck' painted on them or just Roses/daisies and in roughly 3 size categories. Decorated in the traditional canal art style of Roses and Castles.
Small horseshoes ~ £11.75
Medium horseshoes ~ £12.75
Large horseshoes (eg. Hunter size horse) ~ £13.75
All prices include postage and packaging
Stock photo, design will vary slightly as hand painted to order. Please allow up to 10 days for delivery
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376832559.95/warc/CC-MAIN-20181219151124-20181219173124-00418.warc.gz
|
CC-MAIN-2018-51
| 476 | 7 |
https://forum.xda-developers.com/showthread.php?t=1515635
|
code
|
I have incredible, rooted, with cyanogenmod 7. it has been working as normal for months and months. the other day, it just got stuck in the boot animation. i hadn't changed anything, system tweaks, etc, right before this.
i hold volume down and press power, and it goes to bootloader mode. normally here, i can select RECOVERY, and then goes to the black screen, where i could do many things, drastic as wipe the phone, reinstall cyanogenmod, g-apps, etc.
whats my problem now, is that when i hold power down and power and get to the white recovery screen, if i select RECOVERY, it doesnt go where it used to. it goes to the OTHER white screen where choices are, REBOOT, POWER DOWN, etc. So i select to go into recovery mode (the black screen) but it never goes there now. Always did before. Just goes to that next white screen, letting me reboot and start the cycle over again. I've tried with no SC card, no difference.
I found a post someone giving specific directions to format sd card, put radio update only on card, and boot with that in phone. I did, and it successfully said it updated, but still nothing has changed.
I cant get into recovery mode, to reformat, wipe, run any updates, nothing. I've tried so many times i can't even guess. I think it has become a brick. But I finally posted here hoping i may find some advice.
Anyone have any ideas of what i can do, if i can get into recovery mode?
if this helps, this all the info on the white screen - holding power down and powering on:
Jul 23 2010, 10:06:51
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187825147.83/warc/CC-MAIN-20171022060353-20171022080353-00571.warc.gz
|
CC-MAIN-2017-43
| 1,520 | 8 |
https://stateof.greensoftware.foundation/en/insights/green-software-tech-ethics/
|
code
|
Green software is central to tech ethics
Some SOGS respondents referred to their interest in broader ethical questions about computing. One individual said, “I’d love to see green software principles expand beyond how we build things and into what we build. What is needed? What can we stop doing? How can we be more intentional about how ethical and ultimately useful our products and services are?” Software practitioners concerned about their work’s ethical implications might wonder why they are building particular technologies instead of others. And this especially applies to products that are likely to have a detrimental impact on the environment.
Another practitioner shared, “My last company had a ‘green committee.’ People from that committee said that we could not ask management to stop having customers from destructive and dirty industries. The green committee did not dare to ask for the big wins in carbon emission reductions.” Sustainability and other ethical considerations can conflict with business priorities. When competing priorities become a point of friction, software development teams feel less empowered to advocate for greener approaches. However, Gogoll et al. argue that while larger questions of what technology to build emerge from management decisions and business ethics, software development teams might have some control over the design of specific features, balancing, say, users’ privacy with business objectives.
The Karlskrona manifesto for sustainability design, published in 2015, is an early example of software practitioners and researchers coming together to advocate for sustainability as an ethical intervention. In it, Becker et al. call on software practitioners, researchers, professional associations, educators, customers, and users to come together to integrate sustainability design into software systems.
An analysis of AI ethics codes of conduct, published in Nature, shows that sustainability is part of the list of considerations software developers use when designing and building more ethically sound technologies, along with other factors such as transparency, fairness, security, and privacy. The ACM Code of Ethics states: “In addition to a safe social environment, human well-being requires a safe natural environment. Therefore, computing professionals should promote environmental sustainability both locally and globally.” But as Gogoll et al. articulate, codes of conduct are not a practical way of ensuring software developers build more ethical technologies because codes of conduct tend to group several diverse values without ranking or guidance on how to make decisions. In practice, developers have to make choices, and there are tradeoffs between different values, such as accessibility and sustainability. In their roadmap for ethics-aware software development, Aydemir and Dalpiaz argue that ethical considerations are often less of a priority than time-to-market constraints, and a general lack of awareness about sustainability in software engineering, for example, can make it more challenging to prioritize despite pressure from consumers and governments. They state, “We advocate for tools and methods to enable stakeholders to be aware of ethic issues, articulate their requirements, and use ethics as one of the criteria for choosing appropriate software.” Software practitioners tasked with and taking on the responsibility of creating green software applications require more concrete guidance and managerial support. Philosophical or ethical imperatives are not sufficient.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296818464.67/warc/CC-MAIN-20240423033153-20240423063153-00552.warc.gz
|
CC-MAIN-2024-18
| 3,589 | 5 |
https://forlincoln.com/collections/winter-sale/products/raw-gray-jacket
|
code
|
Clean and simple soft wool jacket. Minimalistic jacked designed for everyday use and made of carefully selected soft wool. Made by RAW.
- Fabric: 100% soft wool
- Lining: Cotton/Lycra
- Light Grey
- Two front patch pockets
- Designed and produced in Warsaw, Poland
The model is 5’8.5”, with a 31” bust, 25” waist, 36” hips. She is wearing a S/M.
Free Shipping for domestic orders over $50 and international orders over $200
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-22/segments/1558232256314.25/warc/CC-MAIN-20190521082340-20190521104340-00088.warc.gz
|
CC-MAIN-2019-22
| 433 | 8 |
http://napkc.com/error-correction/error-correction-code-calculator.php
|
code
|
Since each symbol represents % two bits, the receive delay for this object is twice the traceback length % of the viterbi decoder. Morelos-Zaragoza and S. The values in between these extremes represent less confident decisions. The decoder interprets what it receives, using the redundant symbols to detect and possibly correct whatever errors occurred during transmission. http://napkc.com/error-correction/error-correction-term-error-correction-model.php
Cipra, Reprinted from SIAM News, Volume 26-1, January 1993 Reed-Solomon (RS) codes Decoding the Berlekamp-Masssey (BM) algorithm, with error evaluation as explained in Lin and Costello's book. (Simon Rockliff, 1989) Reed-Solomon The correctable burst size, in bits, is three times the number of codewords interleaved. Assume we have four bit errors in a codeword. Decoder Example with Shortening, Puncturing, and Erasures.The following figure shows the decoder operating on the punctured, shortened codeword, while also correcting erasures generated by the receiver. http://www.robotroom.com/Hamming-Error-Correcting-Code-1.html
The Communications System Toolbox Reed-Solomon blocks can implement shortened Reed-Solomon codes.Effect of Nonbinary SymbolsOne difference between Reed-Solomon codes and the other codes supported in this product is that Reed-Solomon codes process As before, either circuit produces valid Golay checkbits. The system returned: (22) Invalid argument The remote host or network may be down. If the resulting checksum is nonzero, an error has occurred, and the transmitter should resend the message word.Open the Error Detection and Correction library by double-clicking its icon in the main
These are valid Golay codewords. If the received codeword has the right parity, the codeword is accepted, else it is rejected. ber = step(hErrorCalc, msg, decoded); ratio = ber(1) number = ber(2) RandStream.setGlobalStream(prevStream);The output is below.number = 5 ratio = 0.0013 Implement Soft-Decision Decoding Using Simulink.This example creates a rate 1/2 convolutional Error Correction Code Definition An excellent reference for iterative decoding.
Finally, the removal of the D symbol from the message vector accounts for the shortening and yields the original I1I2 vector.For additional information, see the Reed-Solomon Coding with Erasures, Punctures, and Error Correction Code Example For more details, see R.H. It illustrates the appropriate vector lengths of the code and message signals for the coding blocks. http://www.ecs.umass.edu/ece/koren/FaultTolerantSystems/simulator/Hamming/HammingCodes.html Simple checksums and cyclic redundancy checks (CRCs) are the most popular.
The rotations and trial bit bookkeeping make for a nontrivial looking routine for Golay error correction, correct(), shown below with its support routines. Error Correction Code Algorithm Use them at your own discretion! See www.aqdi.com for more information. Golay [24,12] Codeword Parity bit Check bits Information bits X XXX XXXX XXXX XXXX XXXX XXXX Before you trash all your old CRC based designs, be advised that there is a
Other values represent less confident decisions. The Golay code allows error correction in exchange for the data-doubling price. Hamming Code Error Correction Calculator Shannon, C.E., "A Mathematical Theory of Communication", Bell System Technical Journal, Vol. 27, July, 1948, pp. 379-423; October, 1948, pp. 623-656. Error Correction Code Flash Memory In this example, the puncturing operation removes the second parity symbol, yielding a final vector of I1I2P1P3P4.Decoder Example with Shortening and Puncturing.The following figure shows how the RS decoder operates on
First build a binary number representation as in step 1 above. click site Unlike block or convolutional codes, CRC codes do not have a built-in error-correction capability. Even if all goes well, there is 200ms of wasted time involved in a resend request. It uses a quantizer and the Viterbi Decoder block to perform soft-decision decoding. Error Correction Code Tutorial
Block CodesBlock-Coding FeaturesTerminologyData Formats for Block CodingUsing Block Encoders and Decoders Within a ModelExamples of Block CodingNotes on Specific Block-Coding TechniquesShortening, Puncturing, and ErasuresReed-Solomon Code in Integer FormatFind a Generator PolynomialPerforming Figure 2. Field names are case sensitive.In the nextStates matrix, each entry is an integer between 0 and numStates-1. news The program computes the generator polynomial of any binary BCH code, plus encoding and decoding using the BM algorithm. (Morelos-Zaragoza, 1994).
For example, to compute the element in the second row and third column, the leftmost and two rightmost elements in the second shift register of the diagram feed into the sum Error Correction Code In String Theory The final register value of Figure 1 is 10011110100, which agrees with the accompanying modulo-2 division remainder, when reversed. The seven-digit binary number 1111001 captures this information, and is equivalent to the octal number 171.
All error correcting codes have a limit to how many errors they can detect and how many they can correct. To accomplish this, the encoder transmits not only the information symbols but also extra redundant symbols. This circuit is equivalent to that calculation with input data of 555h. Error Correcting Code Found In String Theory We should get a couple of simple definitions out of the way to make what follows easier to digest.
Check also Phil's home page. (Phil Karn, 2002). However, there are only 12 information bits per codeword, so you must break your data down into 12-bit chunks and encode each as one codeword. If correct_mode is nonzero, error correction is attempted, with *errs set to the number of bits corrected, and returning 0 if no errors exist, or 1 if parity errors exist. More about the author The cause of the slowness is that the Atmel AVR microcontroller does not support multiple bit shifts per instruction.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-26/segments/1529267867055.95/warc/CC-MAIN-20180624195735-20180624215735-00278.warc.gz
|
CC-MAIN-2018-26
| 5,991 | 12 |
https://usb-safeguard.en.uptodown.com/windows
|
code
|
USB Safeguard is a program that can password protect the information on your USB Pen Drive. It can encrypt the information on using AES 256 bits encryption. That means data can be only accessed by people who know the password.
By this way, we can be sure our data is safe even if we loose the pen drive.
The interface of the program is simple but very effective. You'll need a password if you want to access your pen drive, so your data will be safer than ever.
Finally, not only does it encrypt your files, but it also features a 'Safe Internet Browsing' which removes all Internet traces like URL history, typed URLs, passwords, etc.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676593142.83/warc/CC-MAIN-20180722080925-20180722100925-00277.warc.gz
|
CC-MAIN-2018-30
| 635 | 4 |
http://thedigitalhippies.com/affiliate-disclaimer/
|
code
|
We believe in transparency on the web and so we are disclosing that this website contains endorsements for products and services, which means when you click on a link that we recommend, we may receive a commission at no additional cost to you.
Not every link is an affiliate link (one we get paid for), but some are. You should assume that any links leading you to products or services are affiliate links that we will receive compensation from just to be safe. We may also occasionally place banner ads on the site that will also result in commission. While there are millions of products and services on the web, we only promote those products or services that we truly feel deliver value to you. Examples would include the links for AWeber, HostGator, and the Sahifa theme (the current theme we are using).
If you have any questions regarding the above, please do not hesitate to contact us by using the contact page. It can be accessed on the menu above.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-09/segments/1518891813818.15/warc/CC-MAIN-20180221222354-20180222002354-00630.warc.gz
|
CC-MAIN-2018-09
| 958 | 3 |
https://necst.it/necstnews3/
|
code
|
At NECSTLab, we are happy for the new achievement: on 31 August, at the XILINX Open Hardware 2017, the project “N-BObbiDY boo: Magic Acceleration of N-Body Simulation” by Emanuele Del Sozzo, Marco Rabozzi, Marco Nanni, won the PhD category.
An abstract from this project: N-Body simulation is the process that describes the evolution of a system of forces that is composed of N particles. It is a highly important process in physics as it is as general that it can describe the behavior of multiple particles in fields that range from the astrophysics to molecular dynamics. The main problem with this algorithm is that its most accurate approach, called the All-Pairs method, is particularly compute intensive and pure software implementation on CPUs are inefficient both from a performance and power consumption point of view. An implementation on a hardware accelerator, such as an FPGA, would benefits in both these terms, exploiting a parallel execution at a relative low power profile. Moreover, it would also benefit faster methods with lower computational com- plexity, since many of them exploit different methodologies based on the All-Pairs approach to approximate the calculation of forces.
This work proposes a highly scalable, power efficient and high performance hardware architecture for the N-Body All-Pairs simulation problem. Our final im- plementation can scale up to systems with an arbitrary number of bodies thanks to a tiling approach that allows performance in the order of 4400 Mpairs/s, deliv- ering a speedup of 24X (5.7X) with respect to a single-threaded (multi-threaded) O3-optimized CPU implementation, as well as the best performance per watt ratio with respect to CPUs and GPUs implementations in the state of the art.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-21/segments/1652663006341.98/warc/CC-MAIN-20220527205437-20220527235437-00361.warc.gz
|
CC-MAIN-2022-21
| 1,756 | 3 |
https://joshpeak.net/posts/2018-03-21-scaling-lessons.html
|
code
|
# Scaling: Lessons about Startup Growth
After presenting my talk on scaling in 2017 I was invited to give the same presentation at the Hunter Business Chamber's monthly business development breakfast series for March 2018.
# Event LinksHunter Business Chamber Development Forum - March
# Slide Deck
You can tab through the slides in your own time. I have revised them from the originals presented on the night to better accommodate tabbing through in your own time.
There are 118 slides and the talk ran for 30 minutes. It's pretty fast paced and my favourite style of presentation. Any comments or feedback please get in touch with me via LinkedIn
If you haven't read The Lean Startup by Eric Ries, I highly recommend it as it also captures some of these ideas and lessons.
Follow the link above if you would like to get the audiobook version from Audible. Your first book is free. I also receive no commission or profit if you follow the link, I just liked the book that much.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233506329.15/warc/CC-MAIN-20230922034112-20230922064112-00545.warc.gz
|
CC-MAIN-2023-40
| 978 | 8 |
https://community.rstudio.com/t/installation-biblioshiny-in-rstudio/74646
|
code
|
I have one problem with the installation of Biblioshiny. I describe it that:
I use a MAC (High Sierra version)
I have installed Studio and Rstudio following the instructions: https://www.bibliometrix.org/Download.html#header3-2k. And also I have installed Bibliometrix package correctly.
But I can´t install Biblioshiny in the Rstudio. The message is: "Error in Biblioshiny"
Could you help me, please?
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038083007.51/warc/CC-MAIN-20210415035637-20210415065637-00224.warc.gz
|
CC-MAIN-2021-17
| 402 | 5 |
https://mail.scipy.org/pipermail/ipython-user/2008-January/005011.html
|
code
|
[IPython-user] readline and leopard revisited
Thu Jan 17 14:44:29 CST 2008
On Jan 17, 2008 12:29 PM, Barry Wark <[email protected]> wrote:
> This works beautifully for me as well. Now that the system python is
> fully useable, I don't see any reason not to stick with it. I'll
> update the IPython wiki (InstallationOSXLeopard). Can we host the egg
> on the scipy.org server somewhere (or upload to PyPI)? If not, I'll
> put it on our server. We can update the InstallationOSXLeopard page
> again with that link when it's available.
We can certainly host it. Is it just the zip file sent by Ludwig, or
should I put something else?
More information about the IPython-user
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-05/segments/1516084894125.99/warc/CC-MAIN-20180124105939-20180124125939-00700.warc.gz
|
CC-MAIN-2018-05
| 683 | 12 |
http://unix.stackexchange.com/questions/21377/how-to-trace-that-what-had-chmod-640ed-the-etc-passwd-file
|
code
|
On AIX 6100-05-02-1034, something is frequently changing the permissions of the
/etc/passwd file to 640. That's bad...
How could I trace that what is chmoding the file? There is no
history 1000 | fgrep -i chmod, I think a process is chmoding the file, but which one?
dtrace can do this? it's not on AIX
|
s3://commoncrawl/crawl-data/CC-MAIN-2016-30/segments/1469257824757.8/warc/CC-MAIN-20160723071024-00041-ip-10-185-27-174.ec2.internal.warc.gz
|
CC-MAIN-2016-30
| 302 | 5 |
https://cris.maastrichtuniversity.nl/en/publications/computational-modeling-and-numerical-methods-for-spatiotemporal-c
|
code
|
Intracellular calcium (Ca) cycling dynamics in cardiac myocytes is regulated by a complex network of spatially distributed organelles, such as sarcoplasmic reticulum (SR), mitochondria, and myofibrils. In this study, we present a mathematical model of intracellular Ca cycling and numerical and computational methods for computer simulations. The model consists of a coupled Ca release unit (CRU) network, which includes a SR domain and a myoplasm domain. Each CRU contains 10 Ltype Ca channels and 100 ryanodine receptor channels, with individual channels simulated stochastically using a variant of Gillespie's method, modified here to handle time-dependent transition rates. Both the SR domain and the myoplasm domain in each CRU are modeled by 5 x 5 x 5 voxels to maintain proper Ca diffusion. Advanced numerical algorithms implemented on graphical processing units were used for fast computational simulations. For a myocyte containing 100 x 20 x 10 CRUs, a 1-s heart time simulation takes about 10 min of machine time on a single NVIDIA Tesla C2050. Examples of simulated Ca cycling dynamics, such as Ca sparks, Ca waves, and Ca alternans, are shown.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947474661.10/warc/CC-MAIN-20240226162136-20240226192136-00631.warc.gz
|
CC-MAIN-2024-10
| 1,156 | 1 |
https://librepcb.discourse.group/t/schematic-only-components-in-project/488
|
code
|
Sometimes I like to place external parts on schematics that aren’t actually part of the PCB, they’re only here to illustrate how the main circuit is used/connected. For example, in one project I placed a symbol for a motor and its motor driver, including how to connect it to a connector. However, these two parts will not end up on the PCB.
Right now, the two components are listed as “unplaced” in the board editor. It would be nice if I could mark them as “schematic only” within the project. (There is already a “schematic only” checkbox in the component itself, but that would be applied globally.)
Suggestion on how this could be implemented:
- Add a checkbox “Schematic only” in the component properties dialog, in the “Board” section
- In the board editor, if component is not yet placed, hide it from the “Place devices” section and ignore it in the ERC
- In the board editor, if component is already placed, add a warning in the ERC
Additionally, in the board editor under “Place devices”, a right-click menu could offer the option “Ignore on board” which would trigger the checkbox. A confirmation dialog would probably need to be shown first, since once the entry is marked as “schematic only” it will disappear.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-40/segments/1664030335573.50/warc/CC-MAIN-20221001070422-20221001100422-00035.warc.gz
|
CC-MAIN-2022-40
| 1,264 | 7 |
https://www.turnkeylinux.org/forum/support/20090830/lamp-phpmyadmin-supports-innodb-no-need-edit-mycnf
|
code
|
I have been trying to figure out if I need to change my.cnf to enable INNODB from the LAMP appliance I have installed..
Any advice how to make it enabled? or alter the tables into INNODB instead of MyISIAM?
Currently I have set up some tables in MyISIAM. . .as I tried using INNODB - it generates error message. .
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917120878.96/warc/CC-MAIN-20170423031200-00577-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 313 | 3 |
http://signatures.cf/
|
code
|
CurveFever also known as Achtung, die Kurve! is a multiplayer round based game. Your goal is to survive as long as possible on a field with other players, controlling a snake that draws line. To help you outplay others powerups were introduced, now you can slow down, speed up or even frustrate opponents by reversing their keys. Click the image below to have fun!
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-04/segments/1484560281151.11/warc/CC-MAIN-20170116095121-00140-ip-10-171-10-70.ec2.internal.warc.gz
|
CC-MAIN-2017-04
| 364 | 1 |
https://techstalking.com/typeerror-string-argument-without-an-encoding/
|
code
|
Each Answer to this Q is separated by one/two green lines.
I want to upload compressed gzip of Json into Google Storage.
I have this code:
import datalab.storage as storage import gzip path = prefix + '/orders_newline.json.gz' storage.Bucket('orders').item(path).write_to(gzip.compress(bytes(create_jsonlines(source)),encoding='utf8'), 'application/json')
create_jsonlines(source) is a function that returns Json Newline Delimited.
Running this code gives:
TypeError: string argument without an encoding
The Python docs says the format is:
bytes([source[, encoding[, errors]]]) I’m not sure I understand it as there is no example of how to use it.
I tried also
This gives :
SyntaxError: invalid syntax
I’m running Python 3.5
You are not using the
bytes function correctly. Check this:
>>> a = "hi" >>> bytes(a, encoding='utf8') b'hi'
You can try:
encoding is the argument of the
bytes function, and you are using it outside of that function.
You are probably only one step away from the answer.
And it says:
The optional source parameter can be used to initialize the array in a
few different ways:
- If it is a string, you must also give the encoding (and optionally, errors) parameters; bytearray() then converts the string to bytes
- If it is an integer, the array will have that size and will be initialized with null bytes.
- If it is an object conforming to the buffer interface, a read-only buffer of the object will be used to initialize the bytes array.
- If it is an iterable, it must be an iterable of integers in the range 0 <= x < 256, which are used as the initial contents of the
Notice that the square bracket indicates that those parameters can be omitted, it is not an array type of python language.
So you should use
When you read any python function docs as
bytes([source[, encoding[, errors]]])
square brackets represent that those parameters are optional. multiple square brackets inside another mean they are next level of option params. For example
means we can call bytes as byes() itself as
[source] is optional here
bytes() -> empty bytes object
Here 22 is being passed as the source
read this for more details about bytes and its params
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104692018.96/warc/CC-MAIN-20220707124050-20220707154050-00135.warc.gz
|
CC-MAIN-2022-27
| 2,168 | 37 |
https://serverfault.com/questions/281379/mounting-linux-volume-on-second-disk
|
code
|
The disk on my Fedora 12 box was starting to fail, so I bought a new disk and installed Fedora 15. I kept the old disk connected, which still sort of works, hoping to copy over some important files.
In Fedora 15, the "Disk Utility" application lets me mount the /boot partition, but not the other volume on the old disk. "Disk Utility" shows the existence of that volume, but doesn't offer a way to mount it.
Here's what it says in the old /etc/fstab for the old root and /boot:
/dev/mapper/vg_flotsam-lv_root / ext4 defaults 1 1 UUID=f88eefec-a42f-4797-b704-bb1a426b8874 /boot ext4 defaults 1 2
How can I mount the old volume?
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-43/segments/1570987763641.74/warc/CC-MAIN-20191021070341-20191021093841-00148.warc.gz
|
CC-MAIN-2019-43
| 627 | 5 |
https://www.portablefreeware.com/forums/viewtopic.php?t=23338
|
code
|
FeaturesThis program belongs to class "Clipboard Manager". It captures many clipboard objects and allows user to select and paste one in any program.
Requires .Net Framework 4.52 (Windows Vista+/Server 2008+)
- Supports clipboard formats: text, html, rtf, file, image
- Captures data of supported types copied to clipboard (clips)
- Captures sender window title and process name for clip
- Shows source URL for HTML clip
- Filter by marks "Used (Pasted)" and "Favorite" with keyboard shortcuts
- Filter by clip type
- Hot (as you type) text filter for clip list
- Stores last used for paste text filters
- Marking used (pasted) clips
- Marking filter matches in text
- Marking hyperlinks in text and Alt+click to open them
- Marking END of clip text
- Marking filter matches in list
- Allows to paste clip as original or plain text selected or all
- Repeated copy of any previous clip raises it to top of list
- Max clip capture size and number of clips
- Global hotkey (default ALT+V) to show clip list
- Multilanguage UI (Russian, English)
- Searching back and forward filter text in text
- Ability to delete and move clips in list
- Text filter and clip list share key presses, no need to change focus
- History is stored encrypted on disk
- Incremental paste hotkey
- Switch "word wrap"
- Switch "move just pasted clip to top"
- Switch "show column with short visible size of clip"
- Edit clip title
- Edit clip text mode
- Mark/Unmark favorite clips
- Support for format "Clipboard Viewer Ignore" to respect password copy privacy
- Auto and manual check for new version and one click update
- Portable mode
- Auto position window on open near text input
- Window always on top mode
- Command to open clip as file
- Command to simulate char input (for windows isolated from clipboard)
- Support for sending paste and input to elevated windows
- Switch "Monitor clipboard"
- Switch "Monospaced font"
- Switch "Clear filters on window close"
- Filter ON indication in "Clear filter" button
- Full support for difficult windows in paste command (cmd.exe and RDP)
- Text position indicator shows offset, column and line number, selection length
- Clip list shows samples for picture clips
- Native formatting mode for HTML and RTF clips
- Switch "Show clip source icon column" (default OFF)
- Automatic window open after capture text clip from ABBYY Screenshot Reader
- Command "Text compare" with support for Beyond Compare, ExamDiff Pro, WinMerge, Araxis Merge, DiffMerge and custom application
- Command "Translate text"
- Target window title now is shown in window title after " >> "
- "Default font" in "Settings" window for customizing font of in list and clip text field
- Global hotket (default Alt+B) for open window with favorite clips only
- "Clear clipboard" command in Main/Window and tray icon context menus
- "Move to top" command in Main/List menu
- "Copy text in any window on Control+F3" in Settings
- "Hotkey to compare last clips" in Settings
Project Page - https://sourceforge.net/projects//
Download Page - https://sourceforge.net/projects//files/
History - https://sourceforge.net/p//blog/
Forum - https://sourceforge.net/p//discussion/
Publisher - https://sourceforge.net/u/tormozit/profile/
at AlternativeTo - https://alternativeto.net/software/-is- ... -tormozit/
Direct Download Link for version 1.14 (Clip Angel 1.14.zip) released on 2017.03.18.
- formatted text (source program and source web-site shown):
- image file:
- context menu - clips:
- context menu - text:
InstructionsNo actions required in addition to the system requirements for installing program. You can run program from any catalog, but the program will use single settings and database, stored in Windows user profile, in normal mode and in program catalog - in portable mode. To autostart program on user logon, you have to turn on appropriate checkbox in Settings window.
Portable.bat - runs application in portable mode, settings and database will be loaded/saved in the same catalog, where program is started.
- Download the ZIP package.
- Extract the archive to a folder of your choice.
- Either run Portable.bat file:
Code: Select all
start .exe /p
- Or start .exe with the following parameter:
Code: Select all
Windows Vista+/Server 2008+
.Net Framework 4.52
is licensed under GNU General Public License version 3.0 (GPLv3)
is in active development- the developer has released 10 versions for about a month (from 2017-02-12 to 2017-03-13).
File details for version 1.14 (released on 2017-03-18)
Name: Clip Angel 1.14.zip
File Size: 1473572 Byte(s) (1.41 MB)
Modified Date: 2017-03-18 23:00
File name: Clip Angel 1.14.zip
Detection ratio: 0 / 58
Analysis date: 2017-03-19 03:18:51 UTC
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100508.42/warc/CC-MAIN-20231203161435-20231203191435-00143.warc.gz
|
CC-MAIN-2023-50
| 4,687 | 89 |
https://www.terraelectronica.ru/rd/MAX/MAXREFDES64
|
code
|
MAXREFDES64#: 8-Channel, Digital-Input Micro PLC Card (MAXREFDES64)
Industry 4.01 marks the fourth industrial revolution, characterized by distributed, intelligent control systems. Breaking from a past with large, centralized programmable-logic controllers, Industry 4.0 allows for highly configurable, highly modular factories, which accept an ever increasing number of sensor inputs while operating at a higher output than ever before. The ultra-small PLC, or Micro PLC, lies at the heart of the Industry 4.0 factory, providing high performance with ultra-low power consumption, in an ultra-small package. The MAXREFDES64# is Maxim’s Micro PLC, octal-channel, digital input card.
The MAXREFDES64# reference design features 8-channel digital inputs with isolated power and data. The design integrates a 600VRMS data isolator (MAX14850); a STM32F1 microcontroller; a FTDI USB-UART bridge; a high-efficiency DC-DC converter (MAX17515); and isolated/regulated +24V and +5V power rails (MAX17498C). The entire system typically operates at less than 140mW and fits into a space roughly the size of a credit card. A block diagram of the system is shown in Figure 1.
Figure 1. The MAXREFDES64# reference design block diagram.
- Isolated power and data
- Micro PLC form factor
- Device drivers
- Example C source code
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-47/segments/1510934807344.89/warc/CC-MAIN-20171124085059-20171124105059-00467.warc.gz
|
CC-MAIN-2017-47
| 1,312 | 8 |
http://opensource.sys-con.com/node/2373977
|
code
|
|By Marketwired .||
|September 24, 2012 12:05 PM EDT||
BOSTON, MA -- (Marketwire) -- 09/24/12 -- Strategy Meets Action (SMA), a leading insurance strategic advisory firm, announced the winners of the SMA Innovation in Action Awards during its first annual SMA Summit at the Mandarin Oriental Hotel in Boston.
The 2012 winners in the insurer category are GuideOne Insurance and Great American Insurance Group, and SAS in the IT solution provider category for its SAS® Fraud Framework for Insurance solution.
"The quantity and quality of submissions in both the insurer and solution provider categories were indeed remarkable!" said Karen Furtado, SMA Partner. "This confirms that real innovation is occurring in the insurance industry, and much of that innovation is possible because insurers are actively leveraging next-generation technologies."
The SMA Innovation in Action Awards are presented each year to celebrate innovation in the insurance industry. SMA launched this award program to inspire, share, and recognize solutions that enable an insurance company to move beyond modernizing and optimizing to real innovation and transformation, ultimately creating differentiation and competitive advantage. The program spotlights both insurers and solution providers that have successfully implemented solutions that best leverage one or more of these five next-generation (next-gen) technologies: mobile, collaboration, analytics & big data, social media, and cloud.
SMA Innovation in Action Award winner GuideOne Insurance exemplifies what it means to be a data-driven company, where analytics and data enable the standardization and socialization of information, reporting, and metrics across the enterprise. Using the iPartners Insurance Scorecard business intelligence (BI) solution, GuideOne Insurance has created an environment for effective decision-making, thereby empowering executives to guide the business by analysis.
"Today, executives, actuarial, claims, underwriting, sales & marketing, and finance have immediate access to current data, reports, and dashboards for informed analysis and improved decision making," said Tom Fischer, SVP and CIO at GuideOne Insurance.
Great American Insurance Group received recognition as an SMA Innovation in Action Award winner for a suite of mobile apps they developed to give equine and trucking customers instant access to claims and billing processes, lists of approved service providers, and coverage verification. Great American was able to conjoin these mobile apps with a transformed, modern core system platform that includes in-house built solutions integrated with purchased packages including Guidewire BillingCenter® and Guidewire ClaimsCenter®.
"A flexible SOA infrastructure and up-to-date core solutions made the integration of these mobile apps much easier," said Jane Bracken, divisional SVP at Great American. "Great American has been able to proactively meet the special needs of our customers. The value extends beyond excellent customer service to competitive advantage."
SAS, the winner in the IT solution provider category, for SAS Fraud Framework for Insurance, provides a cutting-edge solution by combining key next-gen technologies to allow insurers to detect and prevent both opportunistic and organized claims fraud. The SAS Fraud Framework for Insurance supports proactive approaches to fraud detection, prevention, and management, and has successfully been implemented at leading insurers. By combining advanced analytics and social media data, the fraud solution provides insurers with the ability to process large amounts of data from multiple sources (including external social media networks) through a single system.
The insurance company award winners were selected by the partners at SMA. The SMA Insurer Forum, a community of over 200 insurance decision makers and influencers, selected the IT solution provider award winner. The SMA Summit, where participants were given a unique opportunity to experience and explore how next-generation technologies can be used to drive differentiation and value in insurance, provided a perfect time to distinguish those that have demonstrated exemplary innovation.
Inquiries for additional information about the award program or the 2012 winners should be directed to Karen Furtado, SMA Partner, at [email protected] or 978.239.2741.
About SMA Strategy Meets Action
Exclusively serving the insurance industry, Strategy Meets Action blends unbiased research findings with expertise and experience to deliver business and technology insights, research, and advice to insurers and IT solution providers. By leveraging best practices from both the management consulting and research advisory disciplines, SMA's services are actionable, business-driven, and research-based -- where strategy meets action -- enabling companies to achieve business success. For more information, please visit the SMA website at strategymeetsaction.com.
The Transparent Cloud-computing Consortium (abbreviation: T-Cloud Consortium) will conduct research activities into changes in the computing model as a result of collaboration between "device" and "cloud" and the creation of new value and markets through organic data processing High speed and high quality networks, and dramatic improvements in computer processing capabilities, have greatly changed the nature of applications and made the storing and processing of data on the network commonplace.
Sep. 29, 2016 04:00 AM EDT Reads: 1,204
Almost two-thirds of companies either have or soon will have IoT as the backbone of their business in 2016. However, IoT is far more complex than most firms expected. How can you not get trapped in the pitfalls? In his session at @ThingsExpo, Tony Shan, a renowned visionary and thought leader, will introduce a holistic method of IoTification, which is the process of IoTifying the existing technology and business models to adopt and leverage IoT. He will drill down to the components in this fra...
Sep. 29, 2016 04:00 AM EDT Reads: 1,802
SYS-CON Events announced today that ReadyTalk, a leading provider of online conferencing and webinar services, has been named Vendor Presentation Sponsor at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. ReadyTalk delivers audio and web conferencing services that inspire collaboration and enable the Future of Work for today’s increasingly digital and mobile workforce. By combining intuitive, innovative tec...
Sep. 29, 2016 03:30 AM EDT Reads: 3,027
I'm a lonely sensor. I spend all day telling the world how I'm feeling, but none of the other sensors seem to care. I want to be connected. I want to build relationships with other sensors to be more useful for my human. I want my human to understand that when my friends next door are too hot for a while, I'll soon be flaming. And when all my friends go outside without me, I may be left behind. Don't just log my data; use the relationship graph. In his session at @ThingsExpo, Ryan Boyd, Engi...
Sep. 29, 2016 03:30 AM EDT Reads: 1,374
SYS-CON Events announced today that Pulzze Systems will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. Pulzze Systems, Inc. provides infrastructure products for the Internet of Things to enable any connected device and system to carry out matched operations without programming. For more information, visit http://www.pulzzesystems.com.
Sep. 29, 2016 03:15 AM EDT Reads: 1,905
IoT offers a value of almost $4 trillion to the manufacturing industry through platforms that can improve margins, optimize operations & drive high performance work teams. By using IoT technologies as a foundation, manufacturing customers are integrating worker safety with manufacturing systems, driving deep collaboration and utilizing analytics to exponentially increased per-unit margins. However, as Benoit Lheureux, the VP for Research at Gartner points out, “IoT project implementers often ...
Sep. 29, 2016 03:15 AM EDT Reads: 3,571
There is growing need for data-driven applications and the need for digital platforms to build these apps. In his session at 19th Cloud Expo, Muddu Sudhakar, VP and GM of Security & IoT at Splunk, will cover different PaaS solutions and Big Data platforms that are available to build applications. In addition, AI and machine learning are creating new requirements that developers need in the building of next-gen apps. The next-generation digital platforms have some of the past platform needs a...
Sep. 29, 2016 03:00 AM EDT Reads: 1,861
If you’re responsible for an application that depends on the data or functionality of various IoT endpoints – either sensors or devices – your brand reputation depends on the security, reliability, and compliance of its many integrated parts. If your application fails to deliver the expected business results, your customers and partners won't care if that failure stems from the code you developed or from a component that you integrated. What can you do to ensure that the endpoints work as expect...
Sep. 29, 2016 02:45 AM EDT Reads: 1,717
As ridesharing competitors and enhanced services increase, notable changes are occurring in the transportation model. Despite the cost-effective means and flexibility of ridesharing, both drivers and users will need to be aware of the connected environment and how it will impact the ridesharing experience. In his session at @ThingsExpo, Timothy Evavold, Executive Director Automotive at Covisint, will discuss key challenges and solutions to powering a ride sharing and/or multimodal model in the a...
Sep. 29, 2016 02:30 AM EDT Reads: 515
Is your aging software platform suffering from technical debt while the market changes and demands new solutions at a faster clip? It’s a bold move, but you might consider walking away from your core platform and starting fresh. ReadyTalk did exactly that. In his General Session at 19th Cloud Expo, Michael Chambliss, Head of Engineering at ReadyTalk, will discuss why and how ReadyTalk diverted from healthy revenue and over a decade of audio conferencing product development to start an innovati...
Sep. 29, 2016 02:30 AM EDT Reads: 2,174
WebRTC adoption has generated a wave of creative uses of communications and collaboration through websites, sales apps, customer care and business applications. As WebRTC has become more mainstream it has evolved to use cases beyond the original peer-to-peer case, which has led to a repeating requirement for interoperability with existing infrastructures. In his session at @ThingsExpo, Graham Holt, Executive Vice President of Daitan Group, will cover implementation examples that have enabled ea...
Sep. 29, 2016 02:00 AM EDT Reads: 1,590
SYS-CON Events announced today that Numerex Corp, a leading provider of managed enterprise solutions enabling the Internet of Things (IoT), will exhibit at the 19th International Cloud Expo | @ThingsExpo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. Numerex Corp. (NASDAQ:NMRX) is a leading provider of managed enterprise solutions enabling the Internet of Things (IoT). The Company's solutions produce new revenue streams or create operating...
Sep. 29, 2016 01:45 AM EDT Reads: 2,057
Fifty billion connected devices and still no winning protocols standards. HTTP, WebSockets, MQTT, and CoAP seem to be leading in the IoT protocol race at the moment but many more protocols are getting introduced on a regular basis. Each protocol has its pros and cons depending on the nature of the communications. Does there really need to be only one protocol to rule them all? Of course not. In his session at @ThingsExpo, Chris Matthieu, co-founder and CTO of Octoblu, walk you through how Oct...
Sep. 29, 2016 01:00 AM EDT Reads: 2,306
"My role is working with customers, helping them go through this digital transformation. I spend a lot of time talking to banks, big industries, manufacturers working through how they are integrating and transforming their IT platforms and moving them forward," explained William Morrish, General Manager Product Sales at Interoute, in this SYS-CON.tv interview at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.
Sep. 28, 2016 11:30 PM EDT Reads: 3,971
According to Forrester Research, every business will become either a digital predator or digital prey by 2020. To avoid demise, organizations must rapidly create new sources of value in their end-to-end customer experiences. True digital predators also must break down information and process silos and extend digital transformation initiatives to empower employees with the digital resources needed to win, serve, and retain customers.
Sep. 28, 2016 09:15 PM EDT Reads: 376
In this strange new world where more and more power is drawn from business technology, companies are effectively straddling two paths on the road to innovation and transformation into digital enterprises. The first path is the heritage trail – with “legacy” technology forming the background. Here, extant technologies are transformed by core IT teams to provide more API-driven approaches. Legacy systems can restrict companies that are transitioning into digital enterprises. To truly become a lea...
Sep. 28, 2016 08:15 PM EDT Reads: 359
IoT is fundamentally transforming the auto industry, turning the vehicle into a hub for connected services, including safety, infotainment and usage-based insurance. Auto manufacturers – and businesses across all verticals – have built an entire ecosystem around the Connected Car, creating new customer touch points and revenue streams. In his session at @ThingsExpo, Macario Namie, Head of IoT Strategy at Cisco Jasper, will share real-world examples of how IoT transforms the car from a static p...
Sep. 28, 2016 07:00 PM EDT Reads: 1,631
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. 28, 2016 06:45 PM EDT Reads: 4,156
From wearable activity trackers to fantasy e-sports, data and technology are transforming the way athletes train for the game and fans engage with their teams. In his session at @ThingsExpo, will present key data findings from leading sports organizations San Francisco 49ers, Orlando Magic NBA team. By utilizing data analytics these sports orgs have recognized new revenue streams, doubled its fan base and streamlined costs at its stadiums. John Paul is the CEO and Founder of VenueNext. Prior ...
Sep. 28, 2016 06:30 PM EDT Reads: 3,133
One of biggest questions about Big Data is “How do we harness all that information for business use quickly and effectively?” Geographic Information Systems (GIS) or spatial technology is about more than making maps, but adding critical context and meaning to data of all types, coming from all different channels – even sensors. In his session at @ThingsExpo, William (Bill) Meehan, director of utility solutions for Esri, will take a closer look at the current state of spatial technology and ar...
Sep. 28, 2016 06:15 PM EDT Reads: 321
|
s3://commoncrawl/crawl-data/CC-MAIN-2016-40/segments/1474738661780.47/warc/CC-MAIN-20160924173741-00273-ip-10-143-35-109.ec2.internal.warc.gz
|
CC-MAIN-2016-40
| 15,642 | 55 |
https://cordis.europa.eu/project/id/QLRI-CT-2002-02773
|
code
|
Tropical pelagic species are known to aggregate around floating objects. The objective of this project is to define specifications and develop prototypes of
(1) autonomous buoys equipped with 360 sonars to observe aggregations, data loggers to detect individuals carrying electronic tags and satellite uplinks for both,
(2) new electronic tags with ecological sensors.
Also, a model of aggregation processes will be developed for interpreting data collected by currently available down-looking sonars mounted on buoys. Various field experiments will be conducted to assist in development of specifications for the autonomous sonars. The new-instrumented buoys will become observatories of pelagic ecosystems. They will reduce the dependence on research vessels and represent a major advance in fisheries research and the study of pelagic organisms.
Funding SchemeCSC - Cost-sharing contracts
20008 San Sebastian
35017 Las Palmas De Gran Canari
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780056656.6/warc/CC-MAIN-20210919005057-20210919035057-00046.warc.gz
|
CC-MAIN-2021-39
| 943 | 7 |
https://stat.ethz.ch/pipermail/r-help/2007-February/125697.html
|
code
|
[R] I can't compile Blacs for the RScaLAPACK on OSX
chrisgignoux at yahoo.com
Thu Feb 15 18:50:52 CET 2007
Hello, folks! I hope you can help a newbie out. I need to install the
parallel-R functionality for a software package I am trying to
download. I have been going through the steps in the install readme
but I cannot find the necessary "Bmake.inc" file to allow the file to
compile properly. I keep getting this error message:
( cd SRC/MPI ; make )
( cd INTERNAL ; make -f ../Makefile I_int "dlvl=/Users/Chris/BLACS" )
make: *** No rule to make target `BI_HypBS.o', needed by `I_int'. Stop.
make: *** [INTERN] Error 2
make: *** [MPI] Error 2
someone has the proper input file (the recommended one in the readme is
at a hyperlink that no longer exists) or something else that could help
me I would surely appreciate it.
TV dinner still cooling?
Check out "Tonight's Picks" on Yahoo! TV.
More information about the R-help
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-05/segments/1516084890991.69/warc/CC-MAIN-20180122034327-20180122054327-00412.warc.gz
|
CC-MAIN-2018-05
| 923 | 19 |
http://www.firmwares4u.com/2013/03/how-to-make-windows-7-as-genuine.html
|
code
|
How we can get that ?.
There are two options to get the genuine copy of Windows 7.
1. Buying from Microsoft ( Buy Windows 7 Genuine)
2. Or following our trick
Choose the way you need.
If you wish to follow us then follow our simple steps :
1. Press start key
2. Type cmd
3. Right click and run it as administrator.(refer the below image)
4. now you will get command-prompt.
5. now type the following command exactly.
6. now wait for 5-10 seconds
7. then you will get the following screen
8.All done. now you got your windows 7 as genuine.
9. Just restart your pc. There after you dont get message that your windows copy is not genuine.
If you liked our article then like us on FaceBook
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-39/segments/1505818690211.67/warc/CC-MAIN-20170924205308-20170924225308-00375.warc.gz
|
CC-MAIN-2017-39
| 685 | 16 |
https://ethw.org/Pramod_P._Khargonekar
|
code
|
Pramod P. Khargonekar
- IEEE Control Systems Award
H-infinity optimal control is considered one of most significant developments in control theory, and Pramod P. Khargonekar played a key role in developing its potential for robust control of critical processes in industries ranging from aerospace and automotive to processing and manufacturing. He realized that a new fundamental theory based on state-space representations was feasible and could provide engineers with a powerful, usable, computational framework for multivariable robust control synthesis compared to hard-to-implement methods based on transfer function theory. This would become known as the Doyle-Glover-Khargonekar-Francis (DGKF) method. He also helped introduce the benefits of multivariable control theory to semiconductor manufacturing, and his work on control algorithms and architectures for the power grid operations is aiding the development of smart grids with larger integration of renewable energy sources.
An IEEE Fellow, Khargonekar is a Distinguished Professor and Vice Chancellor for Research with the University of California, Irvine, CA, USA.
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-35/segments/1566027330800.17/warc/CC-MAIN-20190825194252-20190825220252-00447.warc.gz
|
CC-MAIN-2019-35
| 1,130 | 4 |
http://beta.certifiedondemand.com/objective/describe-how-progression-is-tracked-on-certifiedondemand-com/
|
code
|
- Describe how to navigate a CertifiedOnDemand.com course.
- Describe how progression is tracked on CertifiedOnDemand.com.
- Describe methods to effectively navigate CertifiedOnDemand.com.
- Describe how to mark and recall favorites on CertifiedOnDemand.com.
- Describe how to ask questions and provide feedback on CertifiedOnDemand.com.
- Describe what content can be accessed on CertifiedOnDemand.com based upon your on membership level.
- Create a practice environment, configured for CertifiedOnDemand.com.
- Getting Started – Module Checkpoint
Describe how progression is tracked on CertifiedOnDemand.com.
Objectives and resources may be marked complete. Completing an objective will not complete related resources.
Modules are not marked as complete, but instead reflect the percentage of completed objectives and resources within that module.
For example, when complete this objective, you will see the objectives progress bar increase in this module.
A grey CoD icon indicates incomplete; a full color icon indicates complete.
You must be logged in to track your progression.
Resources for this Objective
CertifiedOnDemand.com Site Overview
Video Must 4m CertifiedOnDemand.com
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817036.4/warc/CC-MAIN-20240416000407-20240416030407-00125.warc.gz
|
CC-MAIN-2024-18
| 1,186 | 17 |
https://www.mileshillier.com/contact
|
code
|
I build Identities with memorable logos, colors, etc. that resonate with your customers and set your company and product line apart from the rest.
I create intuitive, visually captivating interfaces that guide users seamlessly through a delightful digital experience which in return provides customers/users for life.
I have built high-performing, responsive websites in the past. This not only helps me to prepare designs but to also better communicate the needs to the engineering team.
I create, adapt, and expand design systems to support designers, developers and product teams. Keeping things easy to use with clear documentation and evangelizing systems is all apart of my specialty.
I holistically view a companies priorities and see how they scale and reduce redundancies across the board saving time, money, and headache.
From roadmap planning, team alignment to presenting ideas for stakeholder buy-ins, I have been and assisted in many duties of a Product manager in my career.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947474659.73/warc/CC-MAIN-20240226094435-20240226124435-00058.warc.gz
|
CC-MAIN-2024-10
| 989 | 6 |
https://www.kdnuggets.com/2019/11/news.html
|
code
|
2019 Nov News
All (88) | Courses, Education (1) | Meetings (1) | News (6) | Opinions (21) | Top Stories, Tweets (9) | Tutorials, Overviews (44) | Webcasts & Webinars (6)
- Three Methods of Data Pre-Processing for Text Classification - Nov 21, 2019.
This blog shows how text data representations can be used to build a classifier to predict a developer’s deep learning framework of choice based on the code that they wrote, via examples of TensorFlow and PyTorch projects.
- The Semiconductor Imperative for Driving Meaningful Innovation - Nov 20, 2019.
The fundamental fact is that more information than ever will need to be analyzed on millions of devices. And that’s where 5G will make accessing data dramatically faster and more efficient. At Samsung, we’re excited about what 5G can truly enable and to be a central player in the new 5G world.
- How to apply machine learning and deep learning methods to audio analysis - Nov 19, 2019.
Find out how data scientists and AI practitioners can use a machine learning experimentation platform like Comet.ml to apply machine learning and deep learning to methods in the domain of audio analysis.
- Python Workout / Practices of a Python Pro / Classic Computer Science Problems in Python - Nov 13, 2019.
Whether you’re a beginner or an expert, there’s always new ways you can improve your Python coding. Save 40% off this trio of Manning Python books today! Just enter the code nlpropython40 at checkout when you buy from manning.com.
- How to Extract Google Maps Coordinates - Nov 11, 2019.
In this article, I will show you how to quickly extract Google Maps coordinates with a simple and easy method.
- Meet Neebo: The Virtual Analytics Hub - Nov 6, 2019.
Neebo is a SaaS solution that enables analytics teams to connect to, find, combine and collaborate on trusted data assets in hybrid cloud landscapes, and provides a unified access point where they can more effectively leverage all their analytics assets and knowledge. In this blog, we will highlight some of the features of Neebo and how they can completely transform the way analytics teams operate.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500250.51/warc/CC-MAIN-20230205063441-20230205093441-00049.warc.gz
|
CC-MAIN-2023-06
| 2,116 | 14 |
https://evpntmph.web.app/vivyan87209zal/what-is-a-root-kit-cy.html
|
code
|
A BIOS-level rootkit attack, also known as a persistent BIOS attack, is an exploit in which the BIOS is flashed (updated) with malicious code. A BIOS rootkit is …
Rootkit definition is - a malicious piece of software that grants a remote operator complete access to a computer system. How to use rootkit in a sentence. What is a rootkit? | Rootkits defined | Avast Jan 16, 2020 What is Rootkit? - Definition - Trend Micro USA A rootkit is a program (or collection of programs) that installs and executes code on a system without end user consent or knowledge. It uses stealth to maintain a … What Is A Rootkit Infection? – What can we help you with? Breaking the term rootkit into the two component words, root and kit, is a useful way to define it.Root is a UNIX/Linux term that's the equivalent of Administrator in Windows. The word kit denotes programs that allow someone to obtain root/admin-level access to the computer by executing the programs in the kit -- all of which is done without end-user consent or knowledge.
10+ things you should know about rootkits - TechRepublic
Difference Between Virus and Rootkit Virus vs Rootkit. Summary: Difference Between Virus and Rootkit is that a computer virus is a potentially damaging computer program that affects, or infects, a computer negatively by altering the way the computer works without the user’s knowledge or permission. While a rootkit is a program that hides in a computer and allows someone from a remote location to take full control of the computer.
What actually is a rootkit? | G DATA
RootkitRemover | McAfee Free Tools McAfee RootkitRemover is a standalone utility used to detect and remove complex rootkits and associated malware. Currently it can detect and remove ZeroAccess, Necurs and TDSS family of rootkits. McAfee Labs plans to add coverage for more rootkit families in future versions of the tool. What is difference between rootkit and trojan? - Community Aug 30, 2014
- comment installer planet mma sur kodi
- essai gratuit de netflix sans carte de crédit
- rediffusions de boxe sur kodi
- l2tp iphone
- quelles sont les meilleures applications vpn gratuites pour ip _ quelle est la meilleure application
- fusion tv repo
- paramètres dns du chromebook
- meilleure application de confidentialité android
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780058589.72/warc/CC-MAIN-20210928002254-20210928032254-00532.warc.gz
|
CC-MAIN-2021-39
| 2,294 | 14 |
http://charlieslick.blogspot.com/2013_08_01_archive.html
|
code
|
I just finished designing a far more comprehensive portamento module but I'm waiting on a few parts in the mail to complete it. While that's brewing, I thought I'd take the time to show an extremely simple and awesome linear portamento circuit. It's similar to a portamento modules I worked out in an earlier blog post, this one has the proper resistors to give it a 100k input impedance and a 1k output impedance which I find ideal for modular synthesizers.
An overly simplified example: a C note might be represented by 1v and a D note might be represented by 1.5v. If we wanted to slide between these notes, we would alter the rate at which it the circuit could move from 1v to 1.5v. We do that with an RC Circuit. The R and C are resistor and capacitor.
The two main types of portamento circuits for modular synthesizers are exponential(logarithmic) and linear. For linear portamento, the slide time is dependent on the difference between the voltage(note) values. There is a longer slide time to get from C to G than from C to D.
In exponential portamento the slide time is not dependent on the difference between voltages(notes). The slide rate is based on internal resistance, so it is consistent no matter the distance between voltages(notes).
The circuit below is linear portamento. There is a potentiometer labeled 1M in the middle of the circuit. This is the main R in the RC circuit and determines the amount of portamento. The more resistance we add with this Potentiometer, the more portamento we get. By adding a switch and diodes, we give can voltage a path through a diode and around the potentiometer. The diodes allow either positive or negative voltage through dependent on it's orientation. This gives us the ability to have slide only on ascending notes or only on descending notes
The left side is the input and the right side is the output.
2 X 100k resistor
2 X 1k resistor
1 X 1m potentiometer
2-3uF non-polar capacitor
2 X diodes 1n914 variety or similar will work
1 X spdt (center off) switch
2 X op amps. either 2 X 741's or a single TL072 or half of a LM324 or whatever
I've tested this circuit on a breadboard and it works great but I didn't build a module based on it. It's simple enough that it could be easily done on prototyping board. ENJOY!
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187820930.11/warc/CC-MAIN-20171017072323-20171017092323-00484.warc.gz
|
CC-MAIN-2017-43
| 2,277 | 14 |
https://patriciamath.wixsite.com/patricia
|
code
|
Welcome to my webpage. I am a probabilist, working on the derivation of macroscopic laws as PDE's from microscopic stochastic dynamics.
Instituto Superior Técnico
Av. Rovisco Pais 1,
*** My previous webpage is
ERC - Starting Grant 2016
Hydrodynamic Limits and Equilibrium Fluctuations:
universality from stochastic systems.
More information can be seen
vICM 2022, July 6-14th.
My talk (live in front of an audience in Finland) is here:
*** I am very grateful to all my professors from FCUP where I started my bachelor's studies in maths.
I am deeply grateful to IMPA (all the professors and all the people that work there) where I did my Ph.D. for all the fantastic times that I lived while being a student there. I will never forget it!
My talk was dedicated to the memory of a fantastic woman (that on the 9th of June 2022 left us, at the age of 90 years old, but for me, it was still too early) who was an inspiring woman and a pillar in my life. Avó Alice, I really miss you a lot.
Albert Einstein (1879 - 1955),
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679102697.89/warc/CC-MAIN-20231210221943-20231211011943-00021.warc.gz
|
CC-MAIN-2023-50
| 1,018 | 14 |
https://gds.blog.gov.uk/author/davidrennie/
|
code
|
I have a spreadsheet on my computer at home with about 100 user names and passwords on it. I never have it to hand when I need it. Security experts tell me that I shouldn't note them down, especially with …
Related content and links
Government Digital Service
Government Digital Service (GDS) delivers platforms, products and services that help government to become joined-up, trusted and responsive to user needs.
How accessible is your website?
Public sector organisations have a legal duty to make websites accessible. Find out how your organisation is impacted at GOV.UK/accessibility-regulations
- The next steps for digital, data and technology in government 6 April 2021
- Podcast: GOV.UK Platform as a Service 31 March 2021
- What’s next for GOV.UK in 2021 to 2022 29 March 2021
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038917413.71/warc/CC-MAIN-20210419204416-20210419234416-00315.warc.gz
|
CC-MAIN-2021-17
| 790 | 9 |
https://community.filemaker.com/thread/174930
|
code
|
I am trying to do data entry using a Bluetooth Apple keyboard connected to my iPad, which is using FileMaker Go to connect to a database hosted on FMPA16. I've tested this with FM Go 14, 15, and 16.
On a new record, I can use tab navigation to navigate to a field that is formatted as a pop-up menu, checkbox, or radio set, however there is no way for me to navigate between and/or select the options.
I've attached a test file where this can be verified:
- Open in FMP, turn on sharing for the file
- Open in FM Go on iPad
- Connect Bluetooth keyboard to iPad
- New record (cursor automatically enters field A)
- Tab to field B (pop-up menu expands)
- I should be able to use the Bluetooth keyboard's arrow keys, letter keys, return/enter, spacebar, or something to select one of the options
- I should be able to tab out of the field using the keyboard
- FM becomes effectively unresponsive until I use my finger or a stylus to tap the screen (either to select a popover option or to tap outside the popover menu to close it)
- Pressing Tab will enter the field but will not enter it
- Pressing shift-tab will go to the next field instead of the previous field.
In addition to the frustration, I imagine this is also an accessibility problem, unless I'm missing something obvious.
I apologize if this is a duplicate report; I tried searching for similar reports but couldn't find any using the search parameters I tried.
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-09/segments/1550247482186.20/warc/CC-MAIN-20190217152248-20190217174248-00484.warc.gz
|
CC-MAIN-2019-09
| 1,422 | 15 |
https://answers.flexsim.com/questions/124166/how-to-consider-oee.html?childToView=124159#answer-124159
|
code
|
Machines don't work constant all the time, so I want to take into account OEE in % in process time.
I am looking to make the processor OEE to be 87%.
I know that OEE is calculated from availability %, performance% and quality %. But for now I want just that my process time is not 100 % all the time.
With which statistical distribution should I consider the percentage of OEE in process time. Additionally, I use a global table to set the processor's processing time.
My model: model10.fsm
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817729.87/warc/CC-MAIN-20240421071342-20240421101342-00875.warc.gz
|
CC-MAIN-2024-18
| 490 | 5 |
https://www.bleepingcomputer.com/forums/t/643952/wizardfromoz-banned/
|
code
|
I can scarcely believe my eyes !
One of the most friendly , informative , helpful and respectful members here appears to have been banned.
And his posts in the Linux forum were always entertaining to read ( in addition to the fine qualities mentioned above ).
His contributions were a major reason why I have visited here at least once a week , for many years .
One reason less now .
Does anyone know how to contact him ?
I would like him to know how much he will be missed here .
Edited by The Feet, 08 April 2017 - 04:25 AM.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-43/segments/1539583513844.48/warc/CC-MAIN-20181021094247-20181021115747-00504.warc.gz
|
CC-MAIN-2018-43
| 526 | 8 |
https://taukeke.com/posts/
|
code
|
There are many articles on Python’s dataclass so I’ll focus on my usage at work and personal projects. TLDR, embrace dataclass if you’re on Python 3.7 and newer! Most major animation suites that complies with VFX Platform 2020 should be using Python 3.7. What Went Wrong Previously, I used dict when I needed to store something to a variable. […]
My last project as an FX artist which is CR Devil May Cry 4 pachislot before I embarked my journey as a Python developer for financial technology industry!
Expecting another Nuke Tips? Nope this is the upcoming plan for Q4 2018 for this website.
Use the power of Python to retrieve the file path list for every Read nodes in Nuke. Very idiot-proof step-by-step included.
The Clamp Node is a relatively simple yet powerful node in controlling the min/max values of your compositing process. Read on to learn the usefulness of it in your everyday Nuke compositing.
Bookmark has a totally different meaning in Nuke. Learn how to bookmark nodes in Nuke!
Lengthy post on my experience in learning Houdini for Project DQ from a complete newbie! Might be useful or complete bollocks depending on your interest though.
Which motion blur nodes to use for FX elements? Kronos, MotionBlur, Oflow or VectorBlur? Read on to find out the difference between 3D motion blur or adding post motion blur in Nuke.
Trying to match Mantra Motion Blur with another renderer’s motion blur like Vray? Read on to learn the settings to match Mantra motion blur from another package.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817491.77/warc/CC-MAIN-20240420060257-20240420090257-00684.warc.gz
|
CC-MAIN-2024-18
| 1,512 | 9 |
http://doc.pypy.org/en/latest/glossary.html
|
code
|
PyPy, like any large project, has developed a jargon of its own. This
document gives brief definition of some of these terms and provides
links to more information.
- The component of the RPython toolchain that performs a form
of type inference on the flow graph. See the annotator pass
in the documentation.
- application level
- applevel code is normal Python code running on top of the PyPy or
CPython interpreter (see interpreter level)
- Code generator that converts an RPython program to a target
language using the RPython toolchain.
- In the context of the JIT, compile time is when the JIT is
generating machine code “just in time”.
- The “default” implementation of Python, written in C and
distributed by the PSF on http://www.python.org.
- external function
- Functions that we don’t want to implement in Python for various
reasons (e.g. they need to make calls into the OS) and whose
implementation will be provided by the backend.
- garbage collection framework
- Code that makes it possible to write PyPy’s garbage collectors
in Python itself.
- interpreter level
- Code running at this level is part of the implementation of the
PyPy interpreter and cannot interact normally with application
level code; it typically provides implementation for an object
space and its builtins.
- just in time compiler.
- Piece of code that is able to interpret flow graphs. This is very
useful for testing purposes, especially if you work on the RPython
- A C-like type model that contains
structs and pointers. A backend that uses this type system is also
called a low-level backend. The C backend uses this
- low-level helper
- A function that the RTyper can use a call to as part of implementing
some operation in terms of the target type system.
- mixed module
- a module that accesses PyPy’s interpreter level. The name comes
from the fact that the module’s implementation can be a mixture of
application level and interpreter level code.
- object space
- The object space (often abbreviated to
“objspace”) creates all objects and knows how to perform operations
on the objects. You may think of an object space as being a library
offering a fixed API, a set of operations, with implementations
that a) correspond to the known semantics of Python objects, b)
extend or twist these semantics, or c) serve whole-program analysis
- prebuilt constant
- In RPython module globals are considered constants. Moreover,
global (i.e. prebuilt) lists and dictionaries are supposed to be
immutable (“prebuilt constant” is sometimes abbreviated to “pbc”).
- JIT terminology. promotion is a way of “using” a run-time
value at compile-time, essentially by deferring compilation
until the run-time value is known. See if the jit docs help.
- Restricted Python, a limited subset of the Python language.
The limitations make type inference possible.
It is also the language that the PyPy interpreter itself is written
- RPython toolchain
- The annotator pass, The RPython Typer, and various
- Based on the type annotations, the RPython Typer turns the flow
graph into one that fits the model of the target platform/backend
using either the lltypesystem or the ootypesystem.
- In the context of the JIT, run time is when the code the JIT has
generated is executing.
- A way of controlling how a specific function is handled by the
annotator. One specialization is to treat calls to a function
with different argument types as if they were calls to different
functions with identical source.
- Technology that enables various forms of non conventional control
flow, such as coroutines, greenlets and tasklets. Inspired by
Christian Tismer’s Stackless Python.
- standard interpreter
- It is the subsystem implementing the Python language, composed
of the bytecode interpreter and of the standard objectspace.
- Code that modifies flowgraphs to weave in translation aspects
- In the context of the JIT, translation time is when the PyPy
source is being analyzed and the JIT itself is being created.
- Tool based on the PyPy interpreter which can translate
sufficiently static Python programs into low-level code.
- type system
- The RTyper can target either the lltypesystem or the ootypesystem.
- type inference
- Deduces either partially or fully the type of expressions as
described in this type inference article on Wikipedia.
The RPython toolchain‘s flavour of type inference is described
in the annotator pass section.
|
s3://commoncrawl/crawl-data/CC-MAIN-2013-48/segments/1386163053608/warc/CC-MAIN-20131204131733-00029-ip-10-33-133-15.ec2.internal.warc.gz
|
CC-MAIN-2013-48
| 4,444 | 86 |
https://showmax.engineering/articles/what-to-watch-recommendation-and-our-film2vec-model
|
code
|
“What to watch recommendation” and our Film2vec model
To deliver the best content to the right users we utilize asset metadata - movie or series features like genre, length, stars, etc. - but that has some limitations to it. The set of possible tags for assets is always finite, and adding extra data manually costs time and money.
To improve things further, we use viewing behavior to generate some more features for the assets - at virtually no extra cost. In fact, we created an algorithm that converts assets to vectors based solely on views, which gives us a new set of features to better describe them.
Our algorithm is based on the generic node2vec model that converts nodes in a graph into vectors. The idea is that nodes that are close to each other in the graph should be close to each other in the vector space. In many cases, the shortest path between two nodes could be a good definition of the closeness between them. In cases when the graph is so dense that almost every pair of nodes has an edge, one can use weights for edges - the higher the edge weight, the closer the nodes are.
One of the famous implementations of the node2vec models is the word2vec model presented by Tomáš Mikolov and associated researchers in 2013. The word2vec algorithm uses a neural network model to learn word associations from a large corpus of text, and represents each distinct word with a particular vector. The closeness of two words is given by the number of occurrences of the pair in the same context (within n words apart in the same text).
Most neural network models require structured data (e.g. matrices) for training , and graphs do not provide that. One way to overcome this - also, the one we decided to take - is to generate data points using random walk on the graph. One can start at a random node and, from there, sample an edge to get to an adjacent node. If the graph has weighted edges, the weights can be used to calculate transition probabilities.
That way, you generate a pair of origin and target nodes. To be able to train the model, you also need to generate some negative samples - randomly-selected nodes other than the two that have already been selected. You can then mix the target node with the negative samples. Note that this step is completely optional; sometimes we talk about neural networks in the context of artificial intelligence, but this network cannot even figure out that the target node is always the first one :).
The model input is the index of the origin node and indices of the target node together with the negative samples. The ground truth for output is an array with zeros on positions of the negative samples and one on position of the target node.
The inputs and outputs are fed into a neural network with just three layers. First is an embedding layer that is shared between the origin node and the other nodes. It’s literally just a matrix of weights from which the model takes the corresponding row (vector) for a given asset. The next layer calculates dot product between the origin node and all other nodes. The resulting array is fed to a softmax layer that produces numbers between 0 and 1 that are compared with the ground truth. The error is propagated back to the weights in the embedding matrix.
In our case, we don’t search for vectors representing words, we search for vectors representing each of the movies and series in our library. Another difference in our case is that our graph is bipartite. That means that we have two types of nodes - assets and users - with the edges between them representing the user watching the asset. That leads to two possible solutions for how to generate training data for the model.
The first one is to use the bipartite graph as it stands with a two step random walk. We start at a random asset and do a step to a random user that watched the asset. Then we do the second step to another asset that the user also watched (excluding the original asset). This leads to a straightforward generalization of the original idea. But the graph size is proportional to the product of number of users and number of assets which is too big for us to work with.
Another solution is to use a weighted graph with assets only. The edge weights are equal to the number of users that watched both of the assets. Then we can get back to the one-step random walk using probabilities proportional to the edge weights. The graph size is “only” quadratic in number of assets, which is much easier to work with. Both methods lead to very similar results, so we picked the one that fit into memory.
Using this method, we generate one data point. Obviously, we need much more. So we generate dozens or hundreds of data points that we use for multiple training epochs to maximize the utilization of the generated data. Then we can generate another dataset for the next season (that’s what we call epochs on the same training set), and repeat the process. After a few seasons, the embedding matrix contains vectors that represent the assets.
The vectors themselves cannot be used for any content recommendation, and require some model on top of them to be any useful. As we mentioned above, the vectors can be used as a set of extra features that can enhance assets in any existing recommendation engine. Apart from that, we came up with a few other applications:
- Calculate vectors for all users by aggregating vectors of assets that they watched — the users’ vectors in this case represent their taste or preferences. Then we can recommend assets to users based on dot products between their vectors and the vectors of the assets. Note that the vectors don’t tell much about the quality or popularity of the asset, so this should be done only with a pre-selected set of assets.
- We can use it to assign metadata to assets or find issues with existing metadata. For example, if an asset has neighbors (in terms of dot product between their respective vectors) that are all historical romances, it is expected that the asset itself is also a historical romance.
- Make clusters of similar assets that work both for content recommendations and further analyses — it greatly helps us understand the types of content we have on our platform.
We started this as a small and fun project just to see whether something like this was even possible. It turned out to be a great model, and whenever you enter the Showmax app you’ll see content that has been ordered by it. We’re still exploring other ways that it can help us with our daily tasks.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233508977.50/warc/CC-MAIN-20230925115505-20230925145505-00247.warc.gz
|
CC-MAIN-2023-40
| 6,544 | 18 |
https://community.reolink.com/topic/339/how-do-i-setup-patrol-path
|
code
|
Introducing Our New Forum and New Mods to You
Floodlight PoE/Wifi APP & Working Modes Tips
Duo 2 Firmware Update and Tips: Better AI Detection & Email Alerts
New Client with Time-Lapse Function and Hardware Decoding
15% OFF for RLK16-1200B8/D8
Hello! I have a RLC 423 camera with NVR. My front yard is too big to see everything without moving the camera. I tried setting up patrol path. The way I'd like to set it up is move it from left side to right side, and back to left and back to right again! But every time I set my patrol path, the camera moves to one side, and then instead going back (reverse), it makes a full circle. Is there a way to make it how I want it to (start from left side-->to right side-->left side-->right side, etc.)??
No help whatsoever? Found this video on YT, I'd like something like thishttps://www.youtube.com/watch?v=XGUUHuMCtxs
Hi there! Join the Commnunity to get all the latest news, tips and more!
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-40/segments/1664030337889.44/warc/CC-MAIN-20221006222634-20221007012634-00126.warc.gz
|
CC-MAIN-2022-40
| 933 | 8 |
https://help.misfit.com/hc/en-us/articles/360001447806-I-FORGOT-THE-PASSCODE-I-SET-TO-MY-SMARTWATCH-AND-AM-LOCKED-OUT-HOW-DO-I-FIX-THIS-
|
code
|
To regain access to your smartwatch, you will need to prompt a Factory Reset.
Follow these steps:
- Enter incorrect passwords until the watch locks you out. This can take a couple seconds, up to a minute. Please enter unique passwords (try not to repeat the same incorrect password).
- Wait 30 seconds (the watch will lock out any inputs for the next 30 seconds)
- Enter incorrect passwords until the watch locks you out again.
- A prompt should appear on the watch asking if you would like to reset their watch. Tap on the reset button, then tap OK.
- Once Factory Reset is complete, you will need to re-pair your smartwatch to your phone.
- Remove the device name from Bluetooth cache before pairing in app.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-25/segments/1623487598213.5/warc/CC-MAIN-20210613012009-20210613042009-00373.warc.gz
|
CC-MAIN-2021-25
| 709 | 8 |
https://docs.autonolas.network/open-autonomy/key_concepts/abci_app_async_behaviour/
|
code
|
The AsyncBehaviour class
For clarity, the snippets of code presented here are a simplified version of the actual implementation. We refer the reader to the Open Autonomy API for the complete details.
AsyncBehaviour class, introduced in the
Skill, is a mixin class that allows the AEA developer to use
asynchronous programming patterns in a
Behaviour implementation. Since it is usual that many of the tasks to be carried by the state behaviours are long-running, this is the base class from which FSM Behaviours will be typically derived from.
The Need for Asynchronous Behaviours
The main motivation behind the
AsyncBehaviour utility class
is that in idiomatic AEA behaviour development, the
cannot contain blocking code or long-running tasks, as otherwise
the AEA main thread that executes all the behaviours would get stuck.
For example, in order to interact with an external component through
a request-response pattern, e.g., sending a request to an HTTP server and waiting for its response, or
request the Decision Maker to sign a transaction. The usual approach in this case is to:
- Send the message from the
act()method and update the state into "waiting for the response" (e.g., by updating an attribute in the shared state or in the behaviour instance, or by using the state pattern), such that the next call to
act()can be intercepted and controlled by the developer.
- Receive the response in a concrete
Handlerobject that is registered to process messages of the response protocol.
- Handle the response in the handler's
handle()method according to the skill business logic and the current state behaviour, and notify the behaviour about the change of state (e.g. by updating an attribute in the shared state such that the next
actcall can read it and take a different execution path).
For large and complex skills, this development approach is quite error-prone and expensive in terms of maintainability, as the business logic does not reside in a single skill component (i.e., in a behaviour class), but also in several other skill components (i.e., in the handler classes, one for each interaction protocol required by the behaviour).
Asynchronous Programming to the Rescue
A well-known programming technique that turned out very useful in the web development community is asynchronous programming.
Informally, a programming language that supports asynchronous programming allows running blocking operations asynchronously: the operation is not run in the same thread where the call happened, but it is delegated to another executor, e.g., another thread/process, allowing the caller function execution being "suspended" until the operation has completed. Once the blocking operation has completed, the execution of the function can process the result and continue as usual. This lets the main thread to perform other tasks while the function is waiting for the result of the operation.
If the reader is not familiar with asynchronous programming concepts, we suggest reading the following resources:
- MDN Web Docs: Glossary: asynchronous
asynciostandard Python library documentation
The behaviour execution model of the AEA framework is the following.
At the AEA startup, the framework registers a periodic task, one for each
b, that executes the
b.act method. Such periodic
execution for behaviour
b is scheduled in the main thread loop,
with a tick interval
b.tick_interval and starting time
As mentioned above, the code in
act() should not be blocking,
as otherwise it would block the main thread execution, and
therefore it would prevent the execution of the other behaviours'
and the processing of incoming messages.
class SimpleBehaviour(Behaviour, ABC): """This class implements a simple behaviour.""" def act(self) -> None: """Do the action.""" # (...)
AsyncBehaviour utility class allows to wrap the execution
act() method allowing its execution to be "suspended"
and resumed upon the happening of certain events
(e.g. the receiving of a message, a sleep timeout etc.).
Currently, the crux of the implementation is the
Python built-in generator machinery:
- from the developer perspective, the execution can be suspended by using
yield fromexpressions. This will return a generator object to the framework, which can opportunely be stored in an object attribute;
- from the framework perspective, the execution can be resumed by "sending" a
value to the generator object, using the
send()method of the generator object. The value can be
None, or a message sent by another skill component.
class AsyncBehaviour(ABC): @abstractmethod def async_act(self) -> Generator: """Do the act, supporting asynchronous execution.""" @abstractmethod def async_act_wrapper(self) -> Generator: """Do the act, supporting asynchronous execution.""" # (...)
The abstract methods the developer should implement are called
The sequence diagram below gives the idea of what happens when the
act() method of an
AsyncBehaviour is called:
self.gen.send(None) note over AsyncBehaviour: state RUNNING else state == RUNNING note over AsyncBehaviour: self.gen.send(None) else StopIteration note over AsyncBehaviour: state READY end AsyncBehaviour->>Main loop: (return) end
In words, the first time the
act() method is called:
- first, it creates the generator object by calling the used-defined
- it triggers the first execution by sending the
- it returns the execution control at the first
- sets the state to
- returns to the caller in the main loop.
Any subsequent calls to the
act() method are redirected to the generator
whose execution was triggered by the first call, which invokes
A simple example
Consider a (one-shot) behaviour whose logic is to print a sequence of messages separated by a sleep interval:
class PrintBehaviour(OneShotBehaviour, AsyncBehaviour): def async_act_wrapper(self): yield from self.async_act() def async_act(self): print("First message") yield from self.sleep(1.0) print("Second message") yield from self.sleep(1.0) print("Third message")
AsyncBehaviour, one should take care of:
- remembering the "state" of the behaviour (i.e. what is the last message printed)
- handling the sleep interval by hand
This is a naive implementation
import datetime from aea.skills.behaviours import SimpleBehaviour class PrintBehaviour(SimpleBehaviour): def __init__(self, *args, **kwargs): super().__init__(*args, **kwargs) self.state = 0 # remember time of last printed message self.last_time = None # timedelta of 0 days, 1 second self.timedelta = datetime.timedelta(0, 1) def act(self): now = datetime.datetime.now() if self.state == 0: print("First message") self.state += 1 self.last_time = now return if self.state == 1 and now > (self.last_time + self.timedelta): print("Second message") self.state += 1 self.last_time = now return if self.state == 2 and now > (self.last_time + self.timedelta): print("Third message") self.state += 1 self.last_time = now return # do nothing
As explained above, one of the common tasks for a behaviour is
to interact with other services and/or agents via message-based
communication. In this section, we focus on a sequence of
request-response interactions through agent interaction protocols.
We consider the
fetchai/generic_buyer skill as an example (link to code).
The idiomatic approach
The idiomatic approach, implemented in the skill
is outlined in the sequence diagram below. The suffix
B is a shorthand
H is a shorthand for
DecisionMaker are internal components of the buyer AEA,
Ledger are external actors.
Follows the breakdown of each message exchange:
- The buyer starts by searching for seller of the desired data,
and the search behaviour (
SearchB) sends a search request to an agent discovery service (ADS);
- The search result of the ADS gets routed to the search handler (
SearchH), which selects one of the sellers, and sends a "call for proposal" (CFP) message to him. The CFP is the first message of a FIPA protocol interaction. See the AEA documentation on the AEA FIPA-like protocol.
- The seller replies with a "FIPA proposal" to the buyer. Such message
is handled by the
- Once the negotiation has completed (only the
FipaHis involved in the negotiation), the
FipaHhandler sends the payment transaction to the
TransactionBbehaviour such that it can be processed;
TransactionB, which was periodically listening for new transaction to process, reads the new transaction and sends a signing requests to the DecisionMaker. Note that a skill component does not have access to the crypto identity of an AEA, and it has to rely on the DecisionMaker for certain operations, such as the signing of transactions.
DecisionMakersends the response to the dedicated handler, the
SigningHsubmit the transactions to the
Ledger's response (the transaction hash) is handled by the
LedgerHhandler, which in turn sends the transaction hash to the
Seller, once the transaction has been validated, will send the bought data to the buyer with an FIPA "inform" message, which is handled by the
The business logic is spread across different skill components, behaviours and handlers, due to the "forced callback" mechanism that forces the developer to handle the message of an interaction protocol in the handler registered for that protocol.
The above example can be reimplemented in an
the following way (Python-pseudocode):
class GenericBuyerBehaviour(OneShotBehaviour, AsyncBehaviour): def async_act_wrapper(self): yield from self.async_act() def async_act(self): search_request = build_search_request(...) # send search request to the ADS # and (asynchronously) wait for the response response = yield from send(search_request) agents = response.result # pick the first agent in the result list seller = agents # send CFP to the seller # and (asynchronously) wait for the response cfp = build_cfp(...) response = yield from send(cfp, to=seller) # here there should be the buyer strategy # for the negotiation with the seller... # (...) # in case both parties accept the negotiation outcome: tx = build_tx(...) # send transaction to the decision maker # and (asynchronously) wait for the response signed_tx = yield from send(tx) # send transaction to the distributed ledger # and (asynchronously) wait for the response tx_hash = yield from send(signed_tx) # send transaction hash to the seller send(tx_hash, to=seller) # wait until the seller sends the data inform_message = yield from self.wait_for_message() print(inform_message.data) # done!
As you can see, the core business logic of the buyer resides in the
method. Many details of the implementation are omitted, like
the utility functions like
but they are conceptually similar to what is done in the handlers of the
wait_for_message method, uses the
send(...) method to wait for the
response, allowing it to wait for specific events triggered
by other components. In this case, each of the handlers will
dispatch the response to the requester component, whose request
is identified by the (dialogue) identifier
of the interaction.
However, note that the handler code in this case is skill-independent,
which means that they do not contribute to the business logic.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100258.29/warc/CC-MAIN-20231130225634-20231201015634-00467.warc.gz
|
CC-MAIN-2023-50
| 11,084 | 128 |
https://open.umn.edu/opentextbooks/textbooks?page=17&term=Solaire+Online+Gaming+sa+Cebu+%28%F0%9F%8C%90+promo.peraplay.xyz+%F0%9F%92%B0%29+Kumuha+ng+13po+na+bonus+sa+unang+deposito+%F0%9F%8E%B2+Peraplay+Gaming
|
code
|
Copyright Year: 2016
Publisher: University of Minnesota Libraries Publishing
License: CC BY-NC
Linear Regression Using R: An Introduction to Data Modeling presents one of the fundamental data modeling techniques in an informal tutorial style. Learn how to predict system outputs from measured data using a detailed step-by-step process to develop, train, and test reliable regression models. Key modeling and programming concepts are intuitively described using the R programming language. All of the necessary resources are freely available online.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947474663.47/warc/CC-MAIN-20240226194006-20240226224006-00822.warc.gz
|
CC-MAIN-2024-10
| 549 | 4 |
https://community.filemaker.com/thread/171398
|
code
|
Trying to do something simpler than a Virtual List (which is a little over my head at present) or using the modular MasterDetail, is there a way to click on a portal row and have the information displayed?
Table 1: User table
Table 2: Contacts table
In a User table layout I have a portal showing Contacts table names list (filtered via a search field).
I want the user to be able to click on a portal row and the Contact's additional info pops up. I think the trick is a button over the row with a Get ( ActivePortalRow ) but I'm not sure what to do with it.
Can I put the direct Contact table fields on the layout and somehow link a $ContactSelect variable with the Contact_ID? Should I setup globals for the info and then somehow pull the info in when the button is clicked?
Any guidance would be appreciated.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-43/segments/1539583512411.13/warc/CC-MAIN-20181019145850-20181019171350-00339.warc.gz
|
CC-MAIN-2018-43
| 812 | 7 |
https://www.telerik.com/forums/calendarengines-js-and-persian-calendar
|
code
|
These variables and the code inside the GetDatePart is used to calculate the proper year, day and month from ticks, taking into account the Leap Years:
So for example the num1 will give you the days since it is: ticks / this.TicksPerDay.
Then num2 will be used to keep how many of 400 years there are, to calculate further how many are the leap years, and co on. If you will rewrite the code, you don't actually need to keep this private variables.
GetDatePartDay is actually the reverse of the GetAbsoluteDate function. See the GetAbsoluteDate function, it is a bit more easier to understand. If the Persian calendar has different calculation of the leap years, you will need to rewrite both GetAbsoluteDate and GetDatePartDay functions.
On a side note, you said you bought the controls, but I don't see any license linked on your account, if you have any problems with your account and/or sending support tickets, you could contact to our sales department to figure out what is happened.
If you want to get updates on new releases, tips and tricks and sneak peeks at our product labs directly from the developers working on the RadControls for ASP.NET AJAX, subscribe to the blog feed
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187825575.93/warc/CC-MAIN-20171023035656-20171023055656-00699.warc.gz
|
CC-MAIN-2017-43
| 1,186 | 6 |
http://more104music.com/events/the-monster-who-ate-my-peas-presented-by-artspower-2/
|
code
|
Bad news, friends. You've reached a page that doesn't exist. Try searching below instead.
A woman started an act of kindness chain that lasted for hours at a Starbucks drive-thru in Florida.
The "Problem" collaborators are dominating the Billboard Hot 100 with three mentions apiece.
in Viral Videos
WATCH: A girl attempts the Ice Bucket Challenge immediately after having her wisdom teeth removed. It backfires miserably.
|
s3://commoncrawl/crawl-data/CC-MAIN-2014-35/segments/1408500816424.18/warc/CC-MAIN-20140820021336-00362-ip-10-180-136-8.ec2.internal.warc.gz
|
CC-MAIN-2014-35
| 422 | 5 |
https://www.millioncenters.com/delhi/east-of-kailash/dat-tutor
|
code
|
Tell us what you want to Learn
Get ₹20 Cash-Back on Delhi and Mumbai Metro card Recharge on paytm.com
only for new users, and use same number for registration to get the offer.
Holidays are a great time for students t ...read more
India is one of the ‘hardest&rsquo ...read more
“When was the last time ...read more
“Why learn a hobby?&rdqu ...read more
"Without Music, Life would be a Mistake" ...read more
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-39/segments/1568514571651.9/warc/CC-MAIN-20190915155225-20190915181225-00498.warc.gz
|
CC-MAIN-2019-39
| 415 | 8 |
https://communities.bmc.com/message/204646
|
code
|
1 of 1 people found this helpful
Do u know the exact use of appsubset Field which is present in the home page and whose ID is 1576.
I thought the appsubset field and the VUI keyword ll help u.
For deployable application we can display a subset of application and entry points to users by creating workflows.
In the default home page form installed with AR System, there is a hidden reserve field named AppSubset(Field ID 1576) . we only need to add the necessary workflow to use it.
1 of 1 people found this helpful
If u want to restrict the changes for the particular view then u just write an Active Link and in the Run If Qualification write the condition as $VUI$="particular view name". It ll reflect the changes for the particular view not for the whole form.
I found finally also the appsubset field
I have a form called "F01:XXX", it's not an application itself, but it's present on the Home Page.
I'm not getting the right sentence to fill the appsubset field:
servername.F01:XXX? or "servername.F01:XXX" or...
Once appsubset is loaded I do a PERFORM-ACTION-HOME-FIELD-REFRESH action.
The AL fires on windows open but I'm getting an error:
Error generating application list field content. (ARERR 1900)
you are right...the appsubset field is for setting the entry points for the particular application.
As "F01:XXX" is a form u dont have to use it in appsubset field. But according to ur query i just try the solution now.
Can u share the exact requirement of ur problem?
The form is a regular form or Display only form?
How many views associated with that form?
You said tha u want to hide the entry point for one view not to the entire view....so can we set entry point for different views?
This is my Home Page:
There's an entry point called Change Password, that opens this form:
Change password has been localized to several locales (a view for each locale).
I need to hide the entry point for only one locale and show it for all others.
BUT, entry points work at form level, and NOT at view level (unless I'm wrong)
So, how to achieve this? I found appsubset, but I'm focusing many problems to get the right syntax to populate the aforementioned field with the entry points I want to be shown for that specific view.
This is my problem and I think the only solution is using appsubset.
I'm testing right now with an AL that perform the Home Page refresh (I'm entering manualluy just one entry point, let's say servername.Change Password or servername.Change\ Password or "servername.Change Password",...
No results, only ARERR 1900.
Thanks for your help. Hope you get now my point of view, maybe I'm wrong and appsuset only works with deployable apps, but if I'm not wrong Approval Central or Change Password are NOT apps, are simply forms... Anyway if you try also with Application Administration Console, for example, I'm getting the same result.
a crude way to do this would be to create a "cover" for this application point such as a button that becomes un-hidden for this particular locale. You can then change the colours to be the same as the app list background. It would be assumed the entry point would be in the same location for all users for this to work. Crude but simple to implement.
Another way could be to make this into a Deployable app with the one (or more) forms, although it would probably require a lot more work to for this one requirement. Then you could utilise the functionality above.
The other options are all overkill, such as creating a separate view and manually built app list with Active Links to open the entry points, etc.
So, a few options but probably not the simple solution you were looking for.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-26/segments/1529267859817.15/warc/CC-MAIN-20180617213237-20180617233237-00421.warc.gz
|
CC-MAIN-2018-26
| 3,650 | 34 |
https://linustechtips.com/main/profile/107773-windows98se/
|
code
|
So I read this post a few hours ago, and let it sit and fester a bit so I don't fly off the handle while replying to you.
I've worked in IT for 15 years. If I get an infected machine, I have three steps I follow:
1. Full scan with Malwarebytes
if the machine still indicates it is infected, I've sank too much time into it and it's time to...
Your suggestions to the OP were complete overkill. Given the information in the original post and few subsequent posts, you can make safe assumptions that:
1) The BHO that was installed was likely the only malware installed
2) The BHO was likely disabled and/or uninstalled by the Microsoft cleanup tool
3) The add/remove entry is probably just damaged from #2 and won't go away because it can't close with a proper status code.
For sake of simplicity, I suggested Malwarebytes. By itself, Malwarebytes does a pretty solid job of cleaning up serious malware infections and it is smart enough to parse the registry and remove the bad add/remove program options.
Before you fire back with "BUT IT COULDVE COME WITH OTHER MALWARE!!!!!!!!!!!":
Let's assume the OP has an active malware infection and we have no idea what the scale of the infection is. From experience, I can deduce Malwarebytes can detect/clean about 95% of infections because it doesn't fair well with rootkits. I kick the scan off. It comes back and detects/cleans what it found. I reboot. I kick off Combofix. Let's say Combofix also has the ability to detect 95% of malware. However, you have to remember MB has already scanned and cleaned the machine, so the odds of infection are decreasing exponentially with each subsequent scan. But since no scanner has a detection rate of 100%, one can NEVER guarantee that a machine is clean.
After the first one or two scans, you are more or less just WASTING TIME. The overlap in the detection capability between scanners will rapidly approach 99% and you will theoretically never reach 100%.
So, to recap, the only way to guarantee a clean machine is to wipe the bastard. The OP indicated that he had a single toolbar infection and you recommended he run 8 tools and then reset his browsers. Complete. Overkill.
To steal your words:
Get off your high horse.
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-29/segments/1593655881763.20/warc/CC-MAIN-20200706160424-20200706190424-00440.warc.gz
|
CC-MAIN-2020-29
| 2,211 | 15 |
https://www.synergex.com/docs/lrm/lrmChap9SYNSETDIR.htm
|
code
|
Open topic with navigation
WTSupported in traditional Synergy on Windows
WNSupported in Synergy .NET on Windows
USupported on UNIX
VSupported on OpenVMS
status = %SYN_SETDIR(path)
Returns 1 if successful or 0 if unsuccessful. (n)
The path for the directory you want to set as the current directory. (a)
%SYN_SETDIR does not support relative paths (for example, ..\) or logicals.
On Windows, although changing a directory to a UNC path is valid, doing so restricts you from subsequently spawning any command that uses the command interpreter cmd.exe, because cmd does not support a default directory of anything other than a mapped or subst drive. For example, you would not be able to spawn (or do an open pipe) of a dir command or spawn a .bat command procedure.
If %SYN_SETDIR is not successful, the system error code can be retrieved using %SYSERR.
This example sets the current directory path to C:\mydir.
record sts ,i4 proc sts = %syn_setdir("C:\mydir") if (.not. sts) writes(1, "cannot change to required directory")
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-05/segments/1579250625097.75/warc/CC-MAIN-20200124191133-20200124220133-00428.warc.gz
|
CC-MAIN-2020-05
| 1,023 | 13 |
https://ioready.io/ReactDevelopment.html
|
code
|
Component-Based Architecture in React.js involves breaking down the user interface into reusable, self-contained components. These components encapsulate their logic and presentation, promoting code reusability, maintainability, and scalability in web applications, fostering a modular and organized development approach.
React uses a virtual representation of the DOM called the Virtual DOM. When data changes in a React application, it updates the Virtual DOM first, then calculates the difference between the current Virtual DOM and the previous one, and finally updates the actual DOM efficiently. This approach minimizes DOM manipulation, leading to improved performance.
Unidirectional Data Flow
Unidirectional Data Flow in React.js is a design pattern where data is managed in a single direction, typically from parent components to child components. This one-way flow ensures predictable data handling,and maintains application state by avoiding complex bidirectional data flows, resulting in more maintainable and predictable React applications.
The React.js ecosystem is a vast collection of libraries, tools, and resources that complement React. It includes state management solutions like Redux, UI component libraries such as Material-UI, build tools like Webpack, and various extensions for routing, testing, and more, fostering efficient and feature-rich development of React applications.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100057.69/warc/CC-MAIN-20231129073519-20231129103519-00145.warc.gz
|
CC-MAIN-2023-50
| 1,404 | 5 |
https://www.devarticles.com/c/a/Delphi-Kylix/Looking-at-the-Details-for-an-Invoicing-Application-in-Delphi/
|
code
|
Looking at the Details for an Invoicing Application in Delphi
In the previous article we discussed the requirements and purpose of the invoicing application that we are creating. We also listed the main application code. In this part of the article we are going to look at how to connect the database that we created earlier to the application code. We will also look at some of the code in detail.
The invoice application works by storing and retrieving its information in the database that we created earlier. When the application is first started, it loads certain application-specific settings from an ini file. See the code below:
The code shows the oncreate event of the first form in the application. This code loads the following information:
con – This string contains the path to the database and will be used throughout the application to connect to the database tables.
vat - This is the VAT rate that the application will use when it calculates the totals.
rav – This variable stores the path to the rave report file that contains the output designs of the invoice.
This method of storing and retrieving data increases the application’s portability. You can change these values in the ini file by clicking on the settings menu item, which will bring up a window for you to set new values. The next page has a screen shot of what that form looks like and also the code listing for the settings unit.
|
s3://commoncrawl/crawl-data/CC-MAIN-2019-04/segments/1547583658681.7/warc/CC-MAIN-20190117020806-20190117042806-00484.warc.gz
|
CC-MAIN-2019-04
| 1,417 | 8 |
http://research.omicsgroup.org/index.php/Computational_science
|
code
|
Computational science - Related Links
Open Access Articles- Top Results for Computational science
Journal of Theoretical and Computational SciencePreparation, Characterization, Spectroscopic (FT-IR, FT-Raman, UV and Visible) Investigation, Optical and Physico Chemical Property Analysis on In2O
Journal of Theoretical and Computational ScienceAn Inductive Approximation to the Solution of Systems of Nonlinear Ordinary Differential Equations in Pharmacokinetics-Pharmacodynamics
Journal of Theoretical and Computational ScienceHow Far Away From Nature are We? Analysis of Correlation Similarities between Descriptors of the Drug Bank and Tripeptides Molecules
Journal of Theoretical and Computational ScienceComputational Studies of 1,3-Dipolar [3 + 2]-Cycloaddition Reactions of Fullerene-C60 with Nitrones
Journal of Global Research in Computer SciencesMANAGEMENT LANGUAGE SPECIFICATIONS FOR DIGITAL ECOSYSTEMS
Computational science (also scientific computing or scientific computation) is concerned with constructing mathematical models and quantitative analysis techniques and using computers to analyze and solve scientific problems. In practical use, it is typically the application of computer simulation and other forms of computation from numerical analysis and theoretical computer science to problems in various scientific disciplines.
The field is different from theory and laboratory experiment which are the traditional forms of science and engineering. The scientific computing approach is to gain understanding, mainly through the analysis of mathematical models implemented on computers.
Scientists and engineers develop computer programs, application software, that model systems being studied and run these programs with various sets of input parameters. In some cases, these models require massive amounts of calculations (usually floating-point) and are often executed on supercomputers or distributed computing platforms.
Numerical analysis is an important underpinning for techniques used in computational science.
- 1 Applications of computational science
- 2 Methods and algorithms
- 3 Reproducibility and open research computing
- 4 Journals
- 5 Education
- 6 Related fields
- 7 See also
- 8 References
- 9 Additional sources
- 10 External links
Applications of computational science
Problem domains for computational science/scientific computing include:
Numerical simulations have different objectives depending on the nature of the task being simulated:
- Reconstruct and understand known events (e.g., earthquake, tsunamis and other natural disasters).
- Predict future or unobserved situations (e.g., weather, sub-atomic particle behaviour, and primordial explosions).
Model fitting and data analysis
- Appropriately tune models or solve equations to reflect observations, subject to model constraints (e.g. oil exploration geophysics, computational linguistics).
- Use graph theory to model networks, such as those connecting individuals, organizations, websites, and biological systems.
- Optimize known scenarios (e.g., technical and manufacturing processes, front-end engineering).
- Machine learning
Methods and algorithms
Algorithms and mathematical methods used in computational science are varied. Commonly applied methods include:
- Numerical analysis
- Application of Taylor series as convergent and asymptotic series
- Computing derivatives by Automatic differentiation (AD)
- Computing derivatives by finite differences
- Graph theoretic suites
- High order difference approximations via Taylor series and Richardson extrapolation
- Methods of integration on a uniform mesh: rectangle rule (also called midpoint rule), trapezoid rule, Simpson's rule
- Runge Kutta method for solving ordinary differential equations
- Monte Carlo methods
- Molecular dynamics
- Linear programming
- Branch and cut
- Branch and Bound
- Numerical linear algebra
- Computing the LU factors by Gaussian elimination
- Cholesky factorizations
- Discrete Fourier transform and applications.
- Newton's method
- Time stepping methods for dynamical systems
Programming languages and computer algebra systems commonly used for the more mathematical aspects of scientific computing applications include R (programming language), TK Solver, MATLAB, Mathematica, SciLab, GNU Octave, Python (programming language) with SciPy, and PDL. The more computationally intensive aspects of scientific computing will often use some variation of C or Fortran and optimized algebra libraries such as BLAS or LAPACK.
Computational science application programs often model real-world changing conditions, such as weather, air flow around a plane, automobile body distortions in a crash, the motion of stars in a galaxy, an explosive device, etc. Such programs might create a 'logical mesh' in computer memory where each item corresponds to an area in space and contains information about that space relevant to the model. For example in weather models, each item might be a square kilometer; with land elevation, current wind direction, humidity, temperature, pressure, etc. The program would calculate the likely next state based on the current state, in simulated time steps, solving equations that describe how the system operates; and then repeat the process to calculate the next state.
The term computational scientist is used to describe someone skilled in scientific computing. This person is usually a scientist, an engineer or an applied mathematician who applies high-performance computing in different ways to advance the state-of-the-art in their respective applied disciplines in physics, chemistry or engineering. Scientific computing has increasingly also impacted on other areas including economics, biology and medicine.
Computational science is now commonly considered a third mode of science, complementing and adding to experimentation/observation and theory. The essence of computational science is numerical algorithm and/or computational mathematics. In fact, substantial effort in computational sciences has been devoted to the development of algorithms, the efficient implementation in programming languages, and validation of computational results. A collection of problems and solutions in computational science can be found in Steeb, Hardy, Hardy and Stoop, 2004.
Reproducibility and open research computing
The complexity of computational methods is a threat to the reproducibility of research. Jon Claerbout has become prominent for pointing out that reproducible research requires archiving and documenting all raw data and all code used to obtain a result. Nick Barnes, in the Science Code Manifesto, proposed five principles that should be followed when software is used in open science publication. Tomi Kauppinen et al. established and defined Linked Open Science, an approach to interconnect scientific assets to enable transparent, reproducible and transdisciplinary research.
Most scientific journals do not accept software papers because a description of a reasonably mature software usually does not meet the criterion of novelty. Outside computer science itself, there are only few journals dedicated to scientific software. Established journals like Elsevier's Computer Physics Communications publish papers that are not open-access (though the described software usually is). To fill this gap, a new journal entitled Open research computation was announced in 2010; it closed in 2012 without having published a single paper, for a lack of submissions probably due to excessive quality requirements. A new initiative was launched in 2012, the Journal of Open Research Software.
Scientific computation is most often studied through an applied mathematics or computer science program, or within a standard mathematics, sciences, or engineering program. At some institutions a specialization in scientific computation can be earned as a "minor" within another program (which may be at varying levels). However, there are increasingly many bachelor's and master's programs in computational science. Some schools also offer the Ph.D. in computational science, computational engineering, computational science and engineering, or scientific computation.
- Computational archaeology
- Computational biology
- Computational chemistry
- Computational economics
- Computational electromagnetics
- Computational engineering
- Computational finance
- Computational fluid dynamics
- Computational forensics
- Computational geophysics
- Computational informatics
- Computational intelligence
- Computational law
- Computational linguistics
- Computational mathematics
- Computational mechanics
- Computational neuroscience
- Computational particle physics
- Computational physics
- Computational sociology
- Computational statistics
- Computer algebra
- Environmental simulation
- Financial modeling
- Geographic information system (GIS)
- High performance computing
- Machine learning
- Network analysis
- Numerical linear algebra
- Numerical weather prediction
- Pattern recognition
- Scientific visualization
Lua error in package.lua at line 80: module 'Module:Portal/images/aliases' not found.
- Computational science and engineering
- Comparison of computer algebra systems
- List of molecular modeling software
- List of numerical analysis software
- List of statistical packages
- Timeline of scientific computing
- Simulated reality
- National Center for Computational Science. Oak Ridge National Laboratory. Retrieved 11 Nov 2012.
- Mathematica 6 Scientific Computing World, May 2007
- Graduate Education for Computational Science and Engineering.Siam.org, Society for Industrial and Applied Mathematics (SIAM) website; accessed Feb 2013.
- Nonweiler T. R., 1986. Computational Mathematics: An Introduction to Numerical Approximation, John Wiley and Sons
- Steeb W.-H., Hardy Y., Hardy A. and Stoop R., 2004. Problems and Solutions in Scientific Computing with C++ and Java Simulations, World Scientific Publishing. ISBN 981-256-112-9
- Sergey Fomel and Jon Claerbout, "Guest Editors' Introduction: Reproducible Research," Computing in Science and Engineering, vol. 11, no. 1, pp. 5–7, Jan./Feb. 2009, doi:10.1109/MCSE.2009.14
- J. B. Buckheit and D. L. Donoho, "WaveLab and Reproducible Research," Dept. of Statistics, Stanford University, Tech. Rep. 474, 1995.
- The Yale Law School Round Table on Data and Core Sharing: "Reproducible Research", Computing in Science and Engineering, vol. 12, no. 5, pp. 8–12, Sept/Oct 2010, doi:10.1109/MCSE.2010.113
- Science Code Manifesto homepage. Accessed Feb 2013.
- Kauppinen, T.; Espindola, G. M. D. (2011). "Linked Open Science-Communicating, Sharing and Evaluating Data, Methods and Results for Executable Papers". Procedia Computer Science 4: 726. doi:10.1016/j.procs.2011.04.076.
- CameronNeylon.net, 13 December 2010. Open Research Computation: An ordinary journal with extraordinary aims. Retrieved 04 Nov 2012.
- Gaël Varoquaux's Front Page, 04 Jun 2012. A journal promoting high-quality research code: dream and reality. Retrieved 04 Nov 2012.
- The Journal of Open Research Software ; announced at software.ac.uk/blog/2012-03-23-announcing-journal-open-research-software-software-metajournal
- G. Hager and G. Wellein, Introduction to High Performance Computing for Scientists and Engineers, Chapman and Hall (2010)
- A.K. Hartmann, Practical Guide to Computer Simulations, World Scientific (2009)
- Journal Computational Methods in Science and Technology (open access), Polish Academy of Sciences
- Journal Computational Science and Discovery, Institute of Physics
- R.H. Landau, C.C. Bordeianu, and M. Jose Paez, A Survey of Computational Physics: Introductory Computational Science, Princeton University Press (2008)
- John von Neumann-Institut for Computing (NIC) at Juelich (Germany)
- The National Center for Computational Science at Oak Ridge National Laboratory
- Educational Materials for Undergraduate Computational Studies
- Computational Science at the National Laboratories
- Bachelor in Computational Science, University of Medellin, Colombia, South America
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-47/segments/1510934806455.2/warc/CC-MAIN-20171122031440-20171122051440-00081.warc.gz
|
CC-MAIN-2017-47
| 12,064 | 123 |
https://developers.wultra.com/products/mobile-token/2022-04/mtoken-sdk-android/Language-Configuration
|
code
|
Before using any methods from this SDK that call the backend, a proper language should be set. A properly translated content is served based on this configuration. The property that stores language settings is not persisted. You need to set
acceptLanguage every time that the application boots.
Note: Content language capabilities are limited by the implementation of the server - it must support the provided language.
IPushService contain an
acceptLanguage property that should be set to the user’s preferred language.
The default value is always
en. With other languages, we use values compliant with standard RFC Accept-Language.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104669950.91/warc/CC-MAIN-20220706090857-20220706120857-00145.warc.gz
|
CC-MAIN-2022-27
| 635 | 7 |
http://seal-7.blogspot.com/2011/06/take-look-at-that-gem.html
|
code
|
Attempting to upload an image to the refinerycms system yielded a stack trace returned to the user. In this case, refinery's images_controller is picking up an error in dragonfly.
When we try to upload an image in refinery, we get
Let's check out the top file
So it appears that the error has to do with the IO.popen. Since we know we wouldn't need that call if "use_filesystem" were true, and since line 9 suggests there is a configuration directive for this setting somewhere. We should try to find it.
So we go down the stack trace to the last known point the execution was in another gem. It turns out to be images_controller in the refinerycms gem.
Knowing the name of the controller , I tried some bash-fu and was presently suprised when it worked!
None the less. There did not appear to be any configuration in that file. I went to the refinery gem root's directory and did a "grep -R dragonfly ." to flesh out any config files. I noticed "lib/refinerycms-images.rb."
We check out the file and see the Dragonfly app initialization at line 22. We google around for the Dragonfly docs looking for a reference to where exactly the "use_filesystem" configuration directive must be set. Our search lands us on docs for Dragonfly::Analysis::FileCommandAnalyser
An example for the config is referenced which includes the directive we are looking for.
We then modify the source of lib-refinerycms.rb to include the modifications to the analyzer config.
We attempt the image upload again and the upload succeeds. Now, how do I get involved in the refinerycms repo to discuss the changes with the leads? Something like this? https://github.com/resolve/refinerycms/pull/738
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-26/segments/1529267864776.82/warc/CC-MAIN-20180622182027-20180622202027-00280.warc.gz
|
CC-MAIN-2018-26
| 1,669 | 11 |
https://blog.adafruit.com/2016/05/13/avr-gcc-binutils-avr-libc-avrdude-in-single-package-for-windows-or-linux-arduino/
|
code
|
AVR-GCC, Binutils, AVR-LibC, & AVRDUDE in Single Package, for Windows or Linux #Arduino
Hat tip to Zak Kemble for providing this single-package download for Windows 32/64 and a bash script file for building from source for GCC, Binutils, and LibC.
This is for those of you who like all the latest shiny things; GCC 6.1.0 was released just a few days ago (at time of writing), along with Binutils 2.26, AVR-LibC 2.0.0 and AVRDUDE 6.3 which were released a few months ago.
The binaries are built from source on an Arch Linux virtual machine with MinGW, apart from AVRDUDE where the pre-built binary was obtained from the official download area. Both 32 bit and 64 bit Windows binaries are provided. There’s probably no benefit from using the 64 bit stuff, but all the cool kids are doing it so why not.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-26/segments/1529267863259.12/warc/CC-MAIN-20180619232009-20180620012009-00355.warc.gz
|
CC-MAIN-2018-26
| 802 | 4 |
https://career.luxoft.com/job/data-engineer-with-java-experience/281046/
|
code
|
ASML is one of the world's leading manufacturers of semiconductor-chip-making equipment. A majority of the world's microchips receive their critical lithographic patterning in machines made by
ASML. In addition ASML produces metrology tools and advanced applications to analyze and optimize the performance of the customer production process. At Business Line Applications, they develop
Analytics & Control solutions that improve the accuracy of performance metrics (such as overlay, focus, critical dimension) as measured on the end product of a fab process (wafers with chip structures).
We are looking for an experienced Data Engineer to join the Analytics & Visualization team. We are interested in engineers with strong knowledge and experience in building Data Intensive Applications (DIA's) in an industrial/enterprise environment. You are expected to handle data from various data sources and determine how best to structure the data in order to provide data in a ready-to-use form to data analysts that are looking to run queries and algorithms against the information for predictive & prescriptive analytics through machine learning. You will design and implement robust scalable data pipelines on the ecosystems existing in ASML and at our customers. You are expected to write high quality, maintainable, and robust code in Java, and provide solutions for ensuring long-term quality and integrity of the data.
The vacancy aims at supporting the development of novel data analytics, visualizations and control solutions by cutting edge techniques from Machine Learning and Data Mining. Successful methodologies aim to be included in ASML customer applications.
• Design and implement Data Intensive Application's, realizing the product backlog defined by the Product Owner
• Ensure quality of own deliverables, this includes designing and implementing automated tests (a.o. on unit- and integration levels)
• Cooperate with other teams to ensure consistent implementation of the architecture, agree on interfaces and timing of cross-team deliveries
• Troubleshoot, analyze and solve integration issues, both from internal alpha and beta tests, as well as reported by our customers
• Write or update product documentation in accordance with company processes
• Suggest improvements to our technical solutions and way of working, and implement them in alignment with your team and their stakeholders
• M.Sc. or Ph.D. in Data Science, Computer Science, Electrical Engineering, Mathematics or Physics
• Experience in having build DIA's in an industrial/enterprise environment
• Experienced in software development (strong coding and testing skills) especially in Java
• IT related knowledge is considered a must
• Familiar languages include Java, Python etc.
• Familiarity with relational and non-relational (documen, columnar, graph) database architectures Experience with frameworks from the big data ecosystems (Spark, Kafka, HBase, etc)
• Experience with orchestration & containerization is a plus (Kubernetes, Docker, Mesos DC/OS)
• Strong ability to communicate and negotiate designs of data pipelines with Data Architects and Data Scientists
Nice to have
• Enthusiastic and intrinsically motivated, creative thinker
• Good & proactive communication in an international and multidisciplinary environment
• Taking responsibility, self-propelling
• Goal-oriented and flexible mindset, willing to acquire lithography and other semiconductor manufacturing knowledge
• Experience working on practical applications using real-world datasets
• Hands-on with different data formats (CSV, XML, ARVO, TXT, JSON, etc.)
• Familiarity with statistical languages like R and/or Matlab
• Handle, analyze and visualize complex, high-volume, high-dimensional data from varying sources
English: B2 Upper Intermediate
If needed, we can help you with relocation process. Click here for more information.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-25/segments/1623487613453.9/warc/CC-MAIN-20210614201339-20210614231339-00034.warc.gz
|
CC-MAIN-2021-25
| 3,938 | 30 |
https://www.groundai.com/project/rapid-bayesian-inference-of-global-network-statistics-using-random-walks/
|
code
|
Rapid Bayesian Inference of Global Network Statistics using Random Walks
We propose a novel Bayesian methodology which uses random walks for rapid inference of statistical properties of undirected networks with weighted or unweighted edges. Our formalism yields high-accuracy estimates of the probability distribution of any network node-based property, and of the network size, after only a small fraction of network nodes has been explored. The Bayesian nature of our approach provides rigorous estimates of all parameter uncertainties. We demonstrate our framework on several standard examples, including random, scale-free, and small-world networks, and apply it to the large-scale network formed by the links between Wikipedia pages.
Over the past few years, our lives have become increasingly dependent on large-scale networks, often available through our computers and smartphones. In addition to the original computer-based networks such as the World Wide Web and the Internet, many online social networks have emerged, notably Twitter and Facebook. Our professional and personal activities are influenced daily by knowledge-sharing online services such as Wikipedia and YouTube. More generally, complex networks describe a broad spectrum of systems in nature, science, technology, and society Albert2002 (). Many of these networks are large and constantly changing, making investigation of their statistical properties a challenging task. In particular, estimating the network size becomes non-trivial if the network is too large to resort to brute-force methods such as visiting every node. Consequently, predicting various network statistics, typically from random samples of limited size, has attracted considerable attention in the literature Newman2003 (); Lee2006 (); Yoon2007 (); Estrada2010 (); Gjoka2010 (); Cooper2012 (); Bliss2014 (); zhang2015 ().
Here we develop a Bayesian approach to network sampling by random walks (RWs) Yoon2007 (); Cooper2012 (). Unlike previous results, our framework can be used to build full posterior probability distributions for any network node-based quantity of interest. Our framework reproduces several previously known global network statistics estimators within a single formalism, and automatically removes statistical biases caused by RW sampling Yoon2007 (); Estrada2010 (). Surprisingly, accurate estimates of various network properties, including its size, are obtained after examining only a small fraction of all network nodes.
Consider a RW on a network of nodes with weighted edges: , where is the rate of transition from node to node . At each step the walker will transition to a neighboring node with a probability , where the sum is over all nearest neighbors of node . We subdivide all network nodes into sets based on the value of some property , such as the number of links connected to the current node, known as the node degree Albert2002 (); there are nodes in each set and distinct sets. We assume that the property in question is discrete; continuous properties can be discretized by binning. We focus on undirected networks with symmetric rates, . In this case, the stationary probability for the RW to occupy node , , can be determined using the steady-state master equation vanKampen2007 (); Krapivsky2010 ():
Equation (1) is satisfied if , where is the total outward rate. For unweighted graphs, the node’s stationary probability is simply proportional to its degree Noh2004 (). With normalization, the stationary probabilities become .
If the walker starts from a node with property , the average number of steps between subsequent visits to any node within the set , also known as the mean return time (MRT), is given by Condamin2007 ():
In the case of undirected networks,
where is the fraction of nodes with property , , and .
The probability of making steps between subsequent visits to , , is asymptotically exponential in arbitrary finite networks Bollt2005 ():
where is the hitting rate of the nodes within . We find empirically that an exponential ansatz for is sufficiently accurate for our purposes (Fig. 1(a)–3(a)), although our approach is not limited to it. The likelihood that during a single RW with steps the walker has visited the nodes in at intervals , and has not returned to for the remaining steps, is given by
This likelihood function is maximized by . Assuming a uniform prior for in the range, the posterior probability density for becomes
where is a normalization constant, and the approximation is valid in the limit. In this limit, Eq. (6) becomes a gamma distribution , which rapidly approaches a Gaussian limit as increases, with the mean and the standard deviation .
This result in combination with Eq. (3) yields a maximum likelihood estimate (MLE) and a standard error for the probability of the property :
If the property of the node is its total outward rate , Eq. (7) yields
where is the number of visits to nodes whose total outward rates lie within the bin , and is the total number of bins.
For an arbitrary node property , each set can be additionally subdivided by the binned value of , such that
where Eq. (8) was employed to compute . Here, is the number of visits to nodes with property and the total outward rates within the bin . Thus, the knowledge of , , and is sufficient to reconstruct the MLE of the distribution of any property , estimate the error in this reconstruction (Eq. (7)), and compute moments of arbitrary order. Note that the division by the outward rates in Eq. (9) naturally corrects for the bias known to be introduced by RW sampling Estrada2010 (); Yoon2007 (); Gjoka2010 (). For unweighted networks (), reduces to , the network degree distribution Albert2002 ().
The MLE of the average outward rate is given by
Let us suppose now that the network nodes are divided into two sets: randomly chosen nodes, which we will refer to as pseudotargets, and all the rest. The pseudotarget nodes are drawn prior to exploring the network, so that the average pseudotarget outward rate, , is known. Equations (3) and (5) can now be used to construct the posterior probability for the network size (assuming a uniform prior in the range, where denotes an upper limit on ):
where is the number of visits to pseudotargets. Note that using non-uniform priors in Eqs. (6) and (12) will not significantly affect the results, as long as and are sufficiently large. Similar to Eq. (6), we find that this posterior probability quickly becomes Gaussian as increases, with
Using Eq. (10), we obtain
Note that the error in can be reduced either through increasing or assigning highly-connected nodes (network hubs) to be pseudotargets. In the limit, Eq. (13) recovers the network size estimator found in Ref. Cooper2012 ().
We have implemented the above network statistics acquisition framework as follows: for each network, pseudotargets are randomly drawn, and their is computed. Commencing the RW from one of these pseudotargets, we record , , , and for a desired set of node properties . At each step in the RW, Eqs. (7)–(14) can then be used to find various network statistics.
We have used this algorithm to study three unweighted, undirected networks: an Erdős-Rényi (ER) random graph Erdos1961 (), a scale-free (SF) random graph Albert2002 (), and a small-world (SW) network Watts1998 (). Each network has nodes. The ER network was constructed by randomly assigning edges between nodes, the SF network by the preferential attachment method Albert2002 () with edges attached to new nodes, and the SW network as described in Ref. Newman2000 (), with the shortcut probability .
For each network, pseudotargets were randomly drawn and the network was subsequently explored with a random walk for steps, visiting at most 10% of all nodes. Besides network sizes and degree distributions, we have tracked posterior probabilities of the average degree of nearest-neighbor nodes,
the clustering coefficient Newman2003 (),
where is the total number of links shared by the nearest neighbors of node , and a measure of the degree inhomogeneity Estrada2010 ()
A summary of the ER system statistics is provided in Fig. 1. Fig. 1(a) shows that the exponential ansatz for the RT distribution, Eq. (4), is accurate for this system. Fig. 1(b) demonstrates the convergence of the average degree distribution and the network size to the exact values during 5 representative runs. The predicted degree distribution, , known to be Poisson Erdos1961 (), is shown in Fig. 1(c). Finally, in Fig. 1(d) we demonstrate evolution of the posterior distribution for the network size as more data is collected. Additional statistics for the ER, SF and SW systems are summarized in Table 1. Although the network topologies of these three systems are quite different, all network statistics we have considered are recovered accurately.
Next, we have constructed a generalized ER network with nodes and weighted edges. After placing all the edges as in the unweighted ER network, a loop was added to each node with probability . All loops and edges were then assigned a symmetric weight drawn from an exponential distribution with unit mean. For this system, we have collected statistics on each node’s total outward rate, , loop weight, (note that for nodes without loops), outward rate averaged over all nearest neighbors of node , , and average nearest-neighbor loop weight, .
We have explored the statistics of these quantities using a RW with steps and randomly drawn pseudotargets (final row of Table 1, Fig. 2). Note that the RT distribution for this system deviates from purely exponential since many returns occur after a single step due to loops (Fig. 2(a)). Nonetheless, all the network statistics we have considered are predicted accurately (Fig. 2(b)–(d)), except for the tail of the Fig. 2(d) distribution since those rare events were not observed. Thus our methodology is equally applicable to studies of weighted networks with loops.
Finally, we have examined the network formed by hyperlinks between English articles on Wikipedia. Links connecting an article to itself were disregarded, multiple links between articles were counted as one, and automatic redirects were disallowed, resulting in an unweighted, undirected, loopless network consisting of all English articles, redirect pages, and disambiguation pages WikiPage (). To assign pseudotargets, the first pages were drawn from Wikipedia’s static HTML dumps. A single randomly chosen link was then taken from each of these pages and the node it pointed to was designated as a pseudotarget, resulting in . This procedure increases the likelihood that the pseudotargets are hubs with a large number of links, facilitating collection of the network statistics since grows more rapidly Noh2004 (); Lee2006 (); Cooper2012 ().
We have focused on several statistics that facilitate comparison with known properties of Wikipedia: the size of each page in bytes, , and two variables representing whether a page is a redirect or a disambiguation page, respectively. The quantities , , , and then give the fraction of redirect pages, disambiguation pages, both redirect and disambiguation pages, and the average storage space in bytes of English articles (Wikipedia excludes redirect pages from its estimates of the number of articles WikiPage ()). The RW was run for steps, with the resulting predictions shown in Table 2 and Fig. 3.
We find that Wikipedia contains million pages, each of which is connected to other pages on average. The majority of Wikipedia pages, , are redirect pages, and are disambiguation pages. We estimate the total number of English articles (including disambiguation pages) to be million, and the total number of redirect pages to be million, within the confidence intervals of the values reported by Wikipedia: and million, respectively WikiPage2 (). We find the total size of English articles in Wikipedia to be gigabytes (GB), in reasonable agreement with the Wikipedia statement that text alone accounts for GB of the storage space of English articles WikiPage3 ().
Fig. 3(a) demonstrates that the assumption of the exponential RT distribution is reasonable for Wikipedia, with some enrichment for short RTs due to the choice of network hubs as pseudotargets. Fig. 3(b) shows how the estimate of the total number of Wikipedia pages evolves as increases. As in many other Internet-based networks Faloutsos1999 (), the degree distribution of Wikipedia pages is scale-free (Fig. 3(c)). In contrast, the distribution of page sizes is not scale-free, and the size of an average Wikipedia page is only kB (Fig. 3(d), Table 2).
In conclusion, we have presented a general Bayesian approach to collecting various network statistics, including the size of the network, using RWs that visit only a small fraction of all network nodes. Our approach works for both weighted and unweighted undirected networks, and remains accurate in the presence of loops. Our main assumption, that of the exponentiality of the RT distribution, appears to hold in all the cases we have examined explicitly, and can be relaxed if necessary. Our future work will focus on extending this methodology to directed and time-dependent networks.
- (1) R. Albert and A. L. Barabási. Statistical mechanics of complex networks. Rev Mod Phys, 74:47–97, 2002.
- (2) M. E. J. Newman. Mixing patterns in networks. Phys Rev E, 67:026126, 2003.
- (3) S. H. Lee, P.-J. Kim, and J. Hawoong. Statistical properties of sampled networks. Phys Rev E, 73:016102, 2006.
- (4) S. Yoon, S. Lee, S.-H. Yook, and Y. Kim. Statistical properties of sampled networks by random walks. Phys Rev E, 75:046114, 2007.
- (5) E. Estrada. Quantifying network heterogeneity. Phys Rev E, 82:066102, 2010.
- (6) M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. Walking in Facebook: A case study of unbiased sampling of OSNs. In Proc 29th Conf Inform Comm, INFOCOM’10, pages 2498–2506, Piscataway, NJ, USA, 2010. IEEE Press.
- (7) C. Cooper, T. Radzik, and Y. Siantos. Estimating network parameters using random walks. In 2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN), pages 33–40, Nov 2012.
- (8) C. A. Bliss, C. M. Danforth, and P. S. Dodds. Estimation of global network statistics from incomplete data. PLoS One, 9:e108471, 2014.
- (9) Y. Zhang, E. D. Kolaczyk, and B. D. Spencer. Estimating network degree distributions under sampling: An inverse problem, with applications to monitoring social media networks. Ann Appl Stat, 9:166–199, 2015.
- (10) N. G. van Kampen. Stochastic Processes in Physics and Chemistry. Elsevier, Amsterdam, 2007.
- (11) P. L. Krapivsky, S. Redner, and E. Ben-Naim. A Kinetic View of Statistical Physics. Cambridge University Press, 2010.
- (12) J. D. Noh and H. Rieger. Random walks on complex networks. Phys Rev Lett, 92:118701, 2004.
- (13) S. Condamin, O. Benichou, and M. Moreau. Random walks and Brownian motion: a method of computation for first-passage times and related quantities in confined geometries. Phys Rev E, 75:021111, 2007.
- (14) E. M. Bollt and D. ben-Avraham. What is special about diffusion on scale-free nets? New J Phys, 7:26–47, 2005.
- (15) P. Erdos and A. Renyi. On the evolution of random graphs. Bull Inst Internat Stat, 38:343–347, 1961.
- (16) D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature, 393:440–442, 1998.
- (17) M. E. J. Newman, C. Moore, and D. Watts. Mean-field solution of the small-world network model. Phys Rev Lett, 84:3201–3204, 2000.
- (18) https://en.wikipedia.org/wiki/Wikipedia:What_is_an_article?
- (19) https://stats.wikimedia.org/EN/TablesWikipediaEN.htm.
- (20) https://en.wikipedia.org/wiki/Wikipedia:Size_in_volumes.
- (21) M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. SIGCOMM Comput. Commun. Rev., 29:251–262, 1999.
|
s3://commoncrawl/crawl-data/CC-MAIN-2020-50/segments/1606141189038.24/warc/CC-MAIN-20201127015426-20201127045426-00613.warc.gz
|
CC-MAIN-2020-50
| 15,899 | 57 |
https://www.itninja.com/software/adobe/reader-6/8-1202?from=appdeploy.com
|
code
|
I tried out the new Adobe customization wizard. Basically it generates a transform that adds some new tables to the msi. Surprisingly it doesn't appear to change any properties of the original msi but just makes additions. The EnterpriseRegistries table contains the stuff you want to know to lock down Acrobat. Also this new customizer works on other adobe products as well.
In order to disable the Beyond Reader function. Include the bDowntown=0 value in the policies registry key.
Here is *where* to disable automatic updates. I'm still working on the *how* (other than a logon script). Adobe seems to love to make my life miserable.
C:\Documents and Settings\username\Local Settings\Application Data\Adobe\Updater5\AdobeUpdaterPrefs.dat
Another fix for the can't open pdf from the web error, Found that the removal of the "Reader_sl.exe" shortcut also caused this error.
Keep in mind that Joedown's reg edits to add toolbar items is only for the current user and does not apply to all users on a system.
You can run your Adobe Reader customized package with out initiating it through setup.exe. Within your workspace or the path where you saved you application package, make sure you only have in there the msi, mst and Data1.cab files.
Seems something changed between 8 and 8.1 because setting the Updater feature to level 0 in the 8.1 installer (see FTP link below) throws an error in the install process. I don't think it's necessary to remove that feature; if you lock out the updater via the registry (as above) you should be accomplishing the same purpose.
Having just deployed the SVG 3.03 viewer with a lot of pain, using the Adobe Customization Wizard (for Adobe 8 PRO, STD and Reader) greatly simplified my tasks, so I would recommend it to anyone trying to repackage Adobe before trying anything else.
It is possible to include per-machine toolbar/ui customization in an MST by exporting the customized settings in HKEY_CURRENT_USER\Software\Adobe\Acrobat Reader\8.0\AVGeneral then including the same path in the HKLM hive via an MST. (e.g. hklm\software\adobe\...)
After installing Adobe Reader 8.x you can find setup files (msi and Data1.cab) in C:\Program Files\Adobe\Reader 8.0\Setup Files\.
View inventory records anonymously contributed by opt-in users of the K1000 Systems Management Appliance.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233506399.24/warc/CC-MAIN-20230922102329-20230922132329-00828.warc.gz
|
CC-MAIN-2023-40
| 2,316 | 12 |
http://docplayer.net/15245229-Introduction-to-ms-windows-xp.html
|
code
|
1 Introduction to MS WINDOWS XP Mouse Desktop Windows Applications File handling
2 Introduction to MS Windows XP 2 Table of Contents What is Windows XP?... 3 Windows within Windows... 3 The Desktop... 3 The Taskbar... 4 The Start menu... 4 If you need help... 4 Using your mouse... 5 It all clicks into place... 5 Choosing or selecting?... 5 Practice exercise... 5 Logging in and out... 6 To log in... 6 To log out... 6 Practice exercise... 6 Working with windows... 7 Title bar... 7 Menu bar and viewing options... 7 Navigating inside a window... 8 Practice exercise... 8 Starting and exiting applications... 9 Using icons... 9 Using the Programs menu... 9 Practice exercise... 9 Working with multiple windows Moving between applications Arranging windows Cutting and pasting between applications Practice exercise...11 Using Windows Explorer Opening Windows Explorer Selecting folders or files Creating a new folder Saving a new file...14 Renaming folders or files Copying folders or files Moving folders or files Deleting folders or files Practice exercise...17 MS Windows Task Sheet MS Windows Task Sheet
3 Introduction to MS Windows XP 3 What is Windows XP? Windows XP is a computer operating system and graphical user interface (GUI), which enables you to work with a wide variety of programs on your computer, often simultaneously. Windows XP is itself a special computer program that communicates your instructions to the actual computer hardware, and displays the results. Some of the key features of Windows XP are: Windows within Windows A Window refers to a rectangular area of the screen, within which you may view program folders and files, or display file contents such as documents, spreadsheets, and graphic images. A window can occupy part of the screen, can be maximised to fill the entire screen, or can be minimised so that it is no longer visible but remains active and is easily reaccessed. The Desktop The Desktop gives you access to everything you need in Windows XP. It occupies the entire screen, and unlike a window, it can t be reduced in size. The desktop consists of a coloured or patterned background, containing small pictures called Icons that represent programs or data stores. Double-clicking on an icon opens the corresponding program or file inside a window. The icons that are visible on your desktop depend on choices made at installation. In the UCT labs, you will usually see icons for My Computer (the gateway to your computer s drives, or data storage areas) Recycle Bin (a temporary trashcan that holds files you want to delete)
4 Introduction to MS Windows XP 4 The Taskbar The Taskbar lies across the bottom edge of your screen. The Start button on the left provides access to all the programs, data files, and other features available on your computer. When you open a program or file, a corresponding rectangular icon will be displayed on your taskbar - even if the program has been minimised and is no longer visible on your screen. To access that program, you just need to click its icon on the taskbar! In this example, two windows are open; the Control Panel window (which is slightly darker in colour) is currently active. The Start menu When you click on the Start button, a set of menu options is displayed. The contents will vary depending on your computer setup and most frequently accessed programs. If you click on the All Programs option, you ll see a list of all the programs installed on your computer even those that don t have icons on the desktop. Press the [ESC] (escape) key to close the menu. If you need help One of the menu options displayed when you click the Start button, is labelled Help and Support. If you select this option, a Help window will open. To get help on a specific topic, type a word or phrase in the blank space at the top left of the window and then click the search arrow; alternatively, you can click to browse any of the Help topics listed in the window. Click the X in the top right corner to close the Help window.
5 Introduction to MS Windows XP 5 Using your mouse The mouse is your most useful tool when working with Windows! It allows you to quickly select and run programs by simply clicking a button. It all clicks into place You can use your mouse in a number of different ways in Windows: 1. Pointing Move your mouse so that the cursor points to an item on the screen. 2. Clicking Hold the mouse still, and click the left mouse button once. Clicking usually selects an object (highlighting it) or opens a menu or window. 3. Double-clicking Hold the mouse still and click the left mouse button twice in quick succession. Double-clicking is usually used to open a program or file, or to expand a folder so that you can see its contents. 4. Right-clicking Hold the mouse still, and click the right mouse button once. Rightclicking usually opens a context-sensitive menu that provides you with a set of relevant options. 5. Dragging Position your mouse on an object, hold down the left mouse button, and drag the object before releasing the button. Choosing or selecting? Selecting an item on your desktop means that you click on it once with the left mouse button, to highlight the object. Choosing an item means that you double-click it with the left mouse button, so that it is not only selected but also opened. You can achieve the same result by selecting the item and then pressing [ENTER] on the keyboard. Practice exercise With the Desktop visible: 1. Point to an item and click on it once. Notice how it becomes highlighted. 2. Drag one of your icons to a different point on the screen. 3. Point the mouse to a blank area of the desktop. Right-click to open a pop-up menu, and use your mouse to select the option for arranging icons by name. 4. Right-click on the My Computer icon to view its pop-up menu. Click an empty area on the screen or else press [ESC] on the keyboard to close the menu. 5. Double-click on the My Computer icon to open its window. Then click the X in the top right corner to close it again.
6 Introduction to MS Windows XP 6 Logging in and out All the computers in the UCT labs are linked to a network. You must log in before you use a computer this process identifies you as a legitimate user. After you ve logged in, you ll be able to access your files even if you created them using a different computer. To log in The login window should be visible on the screen. If the screensaver is currently active, then just move the mouse slightly to return the login window to view. 1. Type your login name (usually your student number) in the Username field of the dialog box. 2. Type your password on the Password field of the dialogue box. 3. Click on the OK button or else press [ENTER]. 4. The Windows XP desktop will appear. In some labs you may then have to click another button to show that you accept the lab rules (such as no food or drink, and no cell phones). To log out After you ve finished working, you must log out so that the next user of that computer won t be able to access your personal files and , or use your print credits. 1. Click on the Start button on the taskbar. You will see an option to Log Off, as well as an option to shut down (i.e. turn off) the computer. 2. Click on the Log Off button. The system will ask you to confirm that you are logging off. The network login box will then appear for the next user to log in. (Note: Don t use the Shut Down option, or the next user will have to wait for the computer to start up again, which can take some time.) Practice exercise 1. Log in to the network using your own user name and password. 2. Log out correctly. 3. Now log in again well done!
7 Introduction to MS Windows XP 7 Working with windows Let s start by identifying the various components of a typical window, and how they are used. Title bar The top line of the window is called the Title bar, and displays the name of the corresponding program or folder. You can move an open window to a different part of the screen by dragging its title bar. If more than one window is open on the screen, then clicking on the title bar (or inside the window) will make a window active - which is indicated by a darkened title bar. There are three control buttons at the right end of the title bar, which are activated by clicking on them: Minimise (on the left) keeps your program open, but reduces it to a rectangular icon on the taskbar. Restore / maximise (in the middle) reduces the size of a full-screen window, or maximises a window that is not full-screen. Close (on the right) closes the window or program. Menu bar and viewing options One row below the title bar is the Menu bar. If you click a word on the menu bar, a menu of additional choices appears. An arrow to the right of a menu option indicates that it has a submenu.
8 Introduction to MS Windows XP 8 Some menu options can also be activated though a keyboard shortcut, such as [CTRL] + [C] for Copy. In this case the shortcut will be shown on the right of the menu option. If you accidentally open a menu and wish to close it, simply click on the title bar; or on a blank space within the window; or press [ESC] on the keyboard. Navigating inside a window If you can t see all the information contained in a window, then use the Scrollbar at the bottom or right edge to view more. You can move the contents displayed in the window using the arrows at each end of a scroll bar: for example, clicking on the bottom arrow on the vertical scroll bar will reveal what lies below the bottom border of the window. Alternatively, you can drag the Scrollbox within the scrollbar to see hidden areas of the window. If a window is too big or too small for displaying the items it contains, then you can resize it. Hold your cursor over a border until it becomes a double arrow. Then drag the border to the size you want. Practice exercise 1. Open the My Computer window by double-clicking on its icon. 2. Move the My Computer window to a new position on the screen by dragging its title bar. 3. Click on the View menu to see the available options. 4. Change your View option to Details. Then change it back to Icons. 5. Practice maximising, restoring and closing your My Computer window.
9 Introduction to MS Windows XP 9 Starting and exiting applications An application is a program that you use to do work with your computer common examples are a spreadsheet, a word processor, or a database. There are two different ways that you can start up a Windows application: Using icons If the application you want to use has an icon, either on the desktop or inside a window, then you just need to double-click the icon and the program will start. An example is the My Computer icon on your desktop, used for viewing the drives and folders on your computer. Using the Programs menu Most of the applications on your computer probably won t have desktop icons associated with them the desktop would get too cluttered! So you need to be able to start applications using the Programs menu: 1. Click on the Start button 2. Point to the All Programs option on the Start menu. The Programs menu will appear. 3. Click the name of the application that you want to use, and the corresponding program will open in a new window. Note that some applications (such as MS Office) consist of several related programs which may be grouped together in a submenu. If this is the case, then the application name on the Programs menu will be followed by an arrow. Move the mouse pointer over the arrow to see the submenu, then click on the required program. Practice exercise 1. Click on the Start button. 2. Select All Programs. 3. Navigate your way to the Microsoft Word program. 4. Open Microsoft Word. 5. Close Microsoft Word.
10 Introduction to MS Windows XP 10 Working with multiple windows One of the most important features of Windows XP is its multitasking capability. This allows you to run more than one application at the same time. What s more, within one application you could have several files open, each in its own window. For example, you might have both MSWord and MS Excel open at the same time, and within MS Word you might be working on two different document files, each in its own window. Moving between applications Each open window (even if it has been minimised) is represented by a rectangular icon on the taskbar at the bottom of your screen. The icon for the currently active window usually appears darker, and looks as if it has been pressed in. To switch between open applications, just click on the taskbar icon for the application that you want to switch to, and Windows will display its window on top of anything else that may be on your screen. Arranging windows When you have multiple windows open, some of them may be hidden by others. Windows XP helps you to arrange them so that all your open windows are visible. Cascade Open windows lie on top of each other, with the title bar of each one visible. To access a window that is not at the top of the cascade, just click its title bar. Tile horizontally Windows are resized so that they fit one above the other on the screen. Tile vertically Windows are resized so that they fit side by side on the screen. To change the way your windows are arranged, right-click on a blank area of the taskbar and choose the option that you want. Cutting and pasting between applications Windows allows you to cut or copy material from one application and paste it into another. For example, you can copy text from a page displayed in your web browser, and paste it into a Word document. Similarly, you could copy an Excel chart into a report you are writing in Word. You would do it like this: 1. Open the application window from which you want to copy material, and select the text or data to be copied.
11 Introduction to MS Windows XP Choose the Copy command from the toolbar, the menu bar, or a pop-up menu. 3. Open the application window into which you want to copy the selected text or data. 4. Position the cursor where the copy should be inserted. 5. Choose the Paste command from the toolbar, the menu bar, or a pop-up menu. (Some applications also have a Paste Special option which lets you specify in more detail how the material should be pasted. If the Copy and Paste commands aren t available on a menu or toolbar, then you can use the following keyboard shortcuts: Copy : [CTRL] + [C] Cut : [CTRL] + [X] Paste : [CTRL] + [V] Practice exercise 1. Open both the Control Panel and My Computer. 2. Switch between the open windows. 3. Display them in vertically tiled view. 4. Close all the open windows.
12 Introduction to MS Windows XP 12 Using Windows Explorer Windows Explorer is the file management tool that comes with Windows XP. It gives you the ability to rename, copy, move or delete the folders and files on your computer s drives. Folders and files are displayed hierarchically within Windows Explorer. Folders can contain subfolders as well as files. Opening Windows Explorer To start Windows Explorer, find the My Computer icon on your desktop or the Start menu. Right-click to display the pop-up menu, and choose Explore. The window that opens will look similar to the example below. The title bar at the top of the window shows My Computer. All the drives and other storage devices associated with this computer are shown on in the right hand pane. Note that when you are working on the UCT network, you must NOT store your files on the C: drive. One of the network drives (usually the F: drive) will be identified by your student number, and has been allocated for your personal use. Because it is a network drive, it is accessible to you from any PC on the network. To navigate through the directory structure and locate files that you want to open, copy, move or delete, you would do as follows: 1. Double-click on the required drive or removable device (floppy disk or flash drive) to display its contents. 2. Within the selected drive or device, double-click on any folder to view the subfolders and files that it contains.
13 Introduction to MS Windows XP 13 The title bar at the top of the window will then display the name of the currently selected folder. On the left side of the window is a list of all the drives and folders on your computer. On the right side of the window is a list of all the folders and files located inside the drive or folder that is currently selected in the left pane. In the left pane: A plus sign + next to a folder indicates that it contains subfolders that are not currently visible. Clicking on the plus sign (or double-clicking on the folder name) will reveal the subfolders. A minus sign - next to a folder indicates that all its subfolders are currently visible. Click on the minus sign (or double-click on the folder name) to collapse the subfolders and hide them from view. Indentation levels in the left pane reflect the folder directory structure. You can drag the vertical line between the left and right panes to make them wider or narrower. If there are too many entries to be displayed in a pane, then you can use the vertical scroll bar to view the hidden entries. Selecting folders or files In the left pane, click on a drive or folder that you want to select. Its contents will be displayed in the right pane. Similarly, you would click on a file in the right pane to select it. To select a group of adjacent files or folders: Click on the first file (or folder) in the group that you want to select. It will become highlighted. Hold down the [SHIFT] key and click on the last file (or folder) in the group that you want to select. All the items between the first and the last file (or folder) selected will also be highlighted. Release the [SHIFT] key. To select separate files and folders: Click on the first file (or folder) that you want to select. It will become highlighted. Hold down the [CTRL] key and click on each of the other files (or folders) that you want to select. All the items that have been selected will be highlighted. Release the [CTRL] key.
14 Introduction to MS Windows XP 14 Creating a new folder To create a new folder in Windows Explorer: 1. In the left pane, highlight the folder within which you want to create a new folder. If you don t want the new folder to be a sub-folder of an existing folder, then select the Drive (such as F:) that the new folder should be in. 2. Select the File menu and hold the mouse pointer over the arrow on the right of the New command. Choose Folder from the sub-menu that appears. A highlighted folder icon called [New Folder] will appear at the bottom of the right pane. 3. Type the name that you want to give the new folder, and press [ENTER]. Your new folder has been created! Saving a new file Whenever you start a new task using an application such as Word or Excel, you ll need to save your work in a file. The process for saving a new file is basically the same for all Windows applications; the examples used here are based on Word. 1. At the top of the screen, click on the File menu, and then select the Save As option from the drop-down menu. (If your window shows a task bar with buttons, then you can click instead on the icon of a stiffy disk.) Note that in Office 2007, the File menu has been replaced by the Office Button. A dialogue box will open. 2. In the Save In field, use the drop-down arrow to select the drive and folder where you want your file to be stored. 3. In the File Name field, type the name that you want to give your new file. 4. Click the Save button. It s as easy as that!
15 Introduction to MS Windows XP 15 Renaming folders or files 1. Highlight the folder or file that you want to rename. 2. Select the File menu and choose the Rename command. Alternatively, you can rightclick on the current file name to get a pop-up menu, and then select Rename. 3. The current folder or file name is highlighted. Type the new name and press [ENTER]. Be careful when renaming files that you keep the appropriate file extension (such as.docx for an MS Word 2007 file). If you change or delete a file extension then you may not be able to re-open the file. If your file extensions are not visible then Windows will automatically retain them for you. Copying folders or files Within Windows Explorer, there are lots of different options for copying folders and files! Commonly used methods for doing this are: right-clicking, using a toolbar icon, using a menu, using the keyboard, and dragging with the mouse. Before you can copy, the file (or folder) that you want to copy must be selected. It s also a bit easier if your target folder is visible in the left pane. So I recommend that you first click on the folder containing the file to be copied, and ensure that the file you want is visible in the right pane. Then scroll through the folders in the left pane until the target folder is visible. Now you can see the file you want to copy on the right, and its target folder on the left. Right-clicking: 1. In the right pane, select the folders or files you want to copy. 2. Right-click to display the pop-up menu, and select Copy. 3. Move the mouse pointer to the folder in the left pane that you want to copy to. 4. Right-click and select Paste from the pop-up menu. Toolbar icon: 1. In the right pane, select the folders or files you want to copy. 2. Click the Copy To icon on the toolbar. 3. The Copy Items dialogue box will open.
16 Introduction to MS Windows XP Select the destination folder and click the Copy button. Menu bar: 1. In the right pane, select the folders or files you want to copy. 2. Click Edit on the menu bar, and choose Copy from the list of options. 3. Select the destination folder. Click Edit on the menu bar and then Paste. (Alternatively, you can choose Copy to Folder, which opens the dialogue box shown under the preceding Toolbar option.) Keyboard: 1. In the right pane, select the folders or files you want to copy. Press [CTRL] + [C] on your keyboard. 2. Select the destination folder. Press [CTRL] + [V] on your keyboard. Dragging: 1. In the right pane, select the folders or files you want to copy. Click and hold down the left mouse button. 2. If you are copying them to another location on a different drive, then drag them to the destination folder and release the mouse button. 3. If you are copying them to another location on the same drive, then hold down the letter [C] on the keyboard while you drag them to the destination folder. You can then release the letter [C] and the mouse button. Ensure that you drop the copied files exactly on the destination folder this will be highlighted as you drag over it. If you lose your files, it s a good idea to check in the folders above and below the destination folder, to see if the copied files landed there. Remember that you can use the Undo function to undo a command you have just executed, including copying files. Moving folders or files Using Windows Explorer, you can move folders and files using similar methods to those shown above for copying: Right-click, and select Cut (instead of Copy) followed by Paste. Use the Cut and Paste icons on the toolbar. Use the Cut and Paste options on the Edit menu. Use [CTRL]+[X] followed by [CTRL]+[V] on your keyboard Drag your files to the new location. If the new location is on a different drive then hold down the [SHIFT] key while dragging, otherwise Windows will make a copy, and you will still need to delete the original file. Again, your task will be easier if you first make the destination folder visible in the left pane before you select the files that you want to move from the right pane. So what is the difference between copying and moving a file? When you copy a file, the original file remains in the source folder, so you end up with two copies of the file, one in the source folder and another in the destination folder. When you move a file, the original
17 Introduction to MS Windows XP 17 disappears from the source folder, and you are left with only one copy of the file, in the destination folder. Deleting folders or files Deleting files and folders is dangerously easy! Here again, you have several options: Select the file or folder, and click the Delete icon on your toolbar. Select the file or folder, and click the [DEL] key on your keyboard. Click File on the menu bar and select Delete. Right-click the file or folder and select Delete from the pop-up menu. Select the file or folder and drag it to the Recycle bin on your desktop. When you delete a file or folder, Windows will ask you to confirm the deletion. Make sure that you have the right file before clicking Yes. Warning: It s not always possible to recover files that you have deleted, especially if they were deleted from a network drive. Be very careful not to delete files that you may need again in the future! Remember that when you delete a folder, you also delete any files in that folder. Practice exercise 1. Open Windows Explorer and identify your F: drive. 2. Create the folder F:\Test 3. Create the sub-folder F:\Test\Sub 4. Delete the folder and the sub-folder that you have just created.
18 Introduction to MS Windows XP 18 Introduction to PCs MS Windows Task Sheet 1 Answer the questions below, making your explanations as clear as possible. 1. What is the difference between Hardware and Software? 2. Name two input devices and two output devices. Input: Output: 3. Why do you need to log in to the computers in the UCT labs? 4. Your computer has a C: drive and an F: drive. Which of these should you use to save your files, and why? 5. What is a computer virus, and what precautions can you take to avoid infecting your computer? 6. When would you log off from a computer, and when would you use shut down?
19 Introduction to MS Windows XP 19 File management MS Windows Task Sheet 2 Log in to a PC in the lab, and complete the following exercises. Step Instruction Notes 1. Start Windows Explorer. See page Open your F: drive. 3. Create a new folder on your F: drive, called File Management. See page Create a second new folder on your F: drive called Exercise. 5. Now create a subfolder within the File Management folder, called Task Sheet. 6. Minimise the Windows Explorer window. See page 7 7. Use Start All Programs Accessories to open the Notepad program. See page 9 8. Type your name inside the Notepad window. 9. Save the Notepad file in the Task Sheet subfolder on your F: drive, with the name Identity. See page Close the Notepad window. See page Restore the Windows Explorer window. 12. Copy the Identity file from the Task Sheet subfolder to the Exercise folder. See page Rename the Identity file in the Exercise folder, to call it Identity Copy. 14. Delete the original Identity file in the Task Sheet subfolder. See page Delete both the Task Sheet subfolder and the File Management folder. 16. Close Windows Explorer. 17. Log out from your PC. Well done!
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-05/segments/1516084887414.4/warc/CC-MAIN-20180118131245-20180118151245-00378.warc.gz
|
CC-MAIN-2018-05
| 26,849 | 19 |
http://giftsforstrangers.org/
|
code
|
The official date for Gifts for Strangers has officially been announced, Saturday, December 21st, 2013. Save the date!
Last year 33 cities around the world participated in Gifts for Strangers. This year we hope to improve that number, by spreading the movement to even more cities across the world.
To find out more about participating OR running the event in your city, please continue here:
And to get a better idea of how the event works, check out the video from last year:http://youtu.be/
|
s3://commoncrawl/crawl-data/CC-MAIN-2014-41/segments/1410657123274.33/warc/CC-MAIN-20140914011203-00257-ip-10-196-40-205.us-west-1.compute.internal.warc.gz
|
CC-MAIN-2014-41
| 493 | 4 |
http://www.macworld.co.uk/how-to/mac-software/macworld-masterclass-use-css3-transitions-form-highlights-dreamweaver-cs6-3487766/
|
code
|
Step 1: Create a form
In a new document, create a typical web form with a few fields (or just load an existing site with a form). Go to Window > CSS Transitions to open the new panel. Click + to create a new transition and set Target Rule to ‘.highlight’ and ‘Transition On’ to ‘focus’.
Step 2: Define properties
Set ‘Duration’ to 1 and ‘Timing Function’ to ‘ease-in-out’. Click + under ‘Property’, choose ‘background-color’ and set ‘End Value’ to #ff9. Hit the Create Transition button. Select your form fields in turn and apply the new (.highlight) class to them. (If they already have a class, add ‘highlight’ in code after the original value.)
Step 3: Test your work
Use Live view in Dreamweaver and clicking inside the form fields. You should find they turn yellow. When a form field loses its focus, the yellow fades back to the original background colour. Experiment with further property values to create more complex transitions.
|
s3://commoncrawl/crawl-data/CC-MAIN-2014-10/segments/1394010707300/warc/CC-MAIN-20140305091147-00040-ip-10-183-142-35.ec2.internal.warc.gz
|
CC-MAIN-2014-10
| 978 | 6 |
https://www.aneddoticamagazine.com/simple-secret-sharing-social-decentralised-management-secrets/
|
code
|
Secrets can be used to split a secret text into shares to be distributed to friends. When all friends agree, the shares can be combined to retrieve the original secret text, for instance to give consensual access to a lost pin, a password, a list of passwords, a private document or a key to an encrypted volume.
Secret sharing can be useful in many different situations and this tool is a simple and well documented free and open source implementation available for anyone to use from this website, but also independently on an offline PC.
1) Have a secret
2) Trust a group of people
3) Paste the secret and distribute the shares
4) Explain to your peers what the secret is for
5) Peers decide that your condition is met
6) Peers meet to combine the shares
7) Your secret is revealed to your peers
Secrets is written in Clojure and is fully cross-platform: one can run it locally on a GNU/Linux machine, as well on Apple/OSX and MS/Windows.
|
s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710503.24/warc/CC-MAIN-20221128102824-20221128132824-00672.warc.gz
|
CC-MAIN-2022-49
| 941 | 10 |
https://www.courant.com/news/connecticut/hc-xpm-1994-08-23-9408230582-story.html
|
code
|
Steven Hamilton, a Roaring Brook Nature Center volunteer, owns 33 snakes.
That's 5.5 snakes for every year since he acquired his first one at the age of 15.
Hamilton, now 21, said he knows his reptiles may repel other people, but they are remarkable to him.
"Snakes draw me," he said. "It's how they get around. They are so adaptable; they've been on earth for so long without arms and legs."
Hamilton, a zoology major who will graduate from Ohio Wesleyan University in Delaware, Ohio, next spring, said there are many misconceptions about the sinuous creatures.
For example, people have told him they believe snakes can form a circle and roll like a wheel. People even say they shy away from snakes because of the one in the Garden of Eden, he said.
But Hamilton, a Simsbury resident, keeps trying to win converts.
When nature center visitors shrink in disgust at seeing snakes spiral like bracelets around his arms, he urges the visitors to study the reptiles and observe the beauty in their patterns and textures.
One success came earlier this month when he persuaded 16 nature center campers to pet his black rat snake -- even though the mothers of a few campers had sworn that their children would not go near snakes.
"I just told them that they could tell their friends they touched a cool snake," Hamilton said.
Jay Kaplan, the nature center's director, has watched Hamilton for years and said the young man is becoming adept at explaining snakes and their behavior.
"He was one of those students who come along once in a while with an interest in wildlife and natural history and who turn their interest into a lifelong love of herpetology," Kaplan said.
Hamilton's affection for the reptiles began at age 8 while attending the nature center camp. The more he fed the snakes, the more his affection grew, he said.
Even being bitten by a 6-foot boa constrictor didn't discourage him.
He also enjoyed seeing the hatchlings come out of their eggs. It made him want to breed them, he said.
And he did this year. His black rat snake laid seven eggs and all the hatchlings were born healthy. A corn snake was even more fertile, laying 14 eggs.
Others did not produce. He said that if they hibernate, they are guaranteed to breed, but fertility is uncertain the first time around.
From the age of 10, Hamilton began working at the nature center steadily on weekends and in the summertime. Now, he said, he is the main snake person there.
He feeds the snakes baby rats and mice. He even takes them out of their cages for a stretch.
"They are not like a dog that needs to be exercised," he said. "You can't take them for a walk. One woman even complained that their cages should be bigger."
But Hamilton said snakes have slow metabolisms. Even in the wild, they do not move much except to look for food -- and that's sometimes just once a month, he said.
The first snake he owned was a baby boa constrictor that had been left at the center, where the staff often adopts lost and injured wildlife. An H-shaped pattern on the snake inspired Hamilton to name him Hercules.
A year later, Penny, an albino gopher snake, joined his collection. At 2 weeks of age, Penny could stretch to 12 inches; now she unwinds to a length of 5 feet.
Hamilton said his 33 snakes live in cages on countertops in his bedroom.
The room has been designated "the snake center" by his family. "My family doesn't mind -- too much," he said.
Hamilton's mother, Ann, confirmed that. The snakes don't smell, she said. And they live in his room. But her son keeps mice in the freezer and thaws them in the bathroom sink -- a routine that does not appeal to her.
Ann Hamilton said once her son packed what he thought were frozen mice to take to college. When he unwrapped the package, he found he had taken frozen rolls instead. His mother said she had to send mice on ice through Express Mail.
The snakes also travel with him.
Before a trip, he slips his bigger snakes into pillowcases and socks and puts his little ones in plastic containers with holes punched in them. During one trip from Toledo to Delaware, Ohio, though, several little snakes popped the lids.
"I had to hold them in my lap while I was driving," he said. "I kept one hand on them so they wouldn't get away."
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376826686.8/warc/CC-MAIN-20181215014028-20181215040028-00260.warc.gz
|
CC-MAIN-2018-51
| 4,245 | 30 |
https://officetuts.net/excel/vba/get-value-from-listbox-using-vba/
|
code
|
With Excel and VBA especially, options for everyone are virtually limitless. In VBA, users can create Macros, UserForms, and ClassModules.
One of the most used and convenient options with UserForms is ListBoxes, which is an integral part of it.
In the example below, we will show how can get value from ListBox with VBA.
First things first, our mission is to create the UserForm. To do so, we open up the VBA by clicking ALT + F11 on our keyboard. In the Insert menu, or by right-clicking in the left window, we will choose UserForm:
We need to add a Toolbox to manipulate with UserForm. To do so, we will click on the View tab, and then choose Toolbox:
In the Toolbox, we will choose the ListBox option:
And we will create it in the middle of our UserForm:
We will now add the CommandButton from the Toolbox as well, to control the UserForm. We will then change the caption of UserForm to “Country”, and the caption of CommandButton to “Select A Country”:
Create a List in Listbox
Now we need to add some code to our UserForm. At this moment, it is very important to remember that the ListBox is a part of UserForm, so we need to change the code in UserForm. We will double-click on it, and then insert the following code:
Private Sub UserForm_Initialize()
'Creating and assigning the Array to the List Box
Dim mylist As Variant
mylist = Array("Argentina", "Brazil", "China", "Europe", "Russia", "USA")
ListBox1.list = mylist
This code creates a variable mylist as a variant and then defines it as an array containing several countries. Then it defines that this variable will be equal to our ListBox, meaning that these countries will appear when we run the code. This is what the code looks like in the VBA:
When we run this code by clicking F5 while in the VBA, this is what we will end up with:
Sadly, this code does not do anything with the UserForm, but rather just shows the list.
Get Value From Listbox
We need additional code to get the value into the workbook. For this, we will first create the table with students and the country they are from (this field is to be populated):
This is the code that we need for this:
Private Sub CommandButton1_Click()
Dim j As Long
'Loop through the whole list
For j = 0 To ListBox1.ListCount - 1
'Verify if anything was chosen
If ListBox1.Selected(j) Then
'Insert selected item in the sheet
Range("B" & Rows.Count).End(xlUp).Offset(1).Value = ListBox1.list(j)
This code is run when the command button is clicked. First, we define the “j” variable as long, then we use For Next Loop where we will define that the selected country ends up in column B, but only if a certain country from the list is selected.
When we execute the code by pressing F5 on the keyboard while in the VBA, we will get the same screen as before, but now, when we select any country on the list, it will be inserted in our table:
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100232.63/warc/CC-MAIN-20231130193829-20231130223829-00061.warc.gz
|
CC-MAIN-2023-50
| 2,862 | 31 |
https://ask.libreoffice.org/t/is-there-a-hidden-command-line-switch-to-find-text-or-bookmark/4616
|
code
|
I know I can jump to a bookmark in a LO text document from a LO calc document using a hyperlink to a URL like file:////filename.odt#bookmark
But I need to do other stuff as well, and there are thousands of such hyperlinks, so instead I hyperlinked to a target file that is associated with a .bat file. The .bat file in turn parses the filename passed to it by the hyperlink, stores various text using “set var=value” statements, and does some other command line stuff; so far so good.
But near the end of this process I need to open the .odt file, and jump to a place determined some of the already-known text or bookmark. But I can find no useful command line switches or any other way to achieve this.
I wasted days not knowing that I need to use the control key to click the hyperlink, so this time as I head down that same path again, I thought it might be more prudent to ask about this problem. All ideas would be appreciated.
In case it’s relevant, the .bat file is…
del .bak !a. !b.* !c.* !m.*
copy %1% !a.mid
MidiCopy -tracks !a.mid > !a.txt
copy !mute.txt !m.txt
d !a.txt !m.txt -lstrip.mac
miditrim !b.mid !c.mid
“c:\Program Files\LibreOffice 4.0\program\swriter.exe” !c.mid !Lyrics.odt#%FNam%
“c:\Program Files\Foobar2000\Foobar2000.exe” !c.mid
The end of the 2nd last line stuffs up (obviously) because it doesn’t like the #%FNam% on the end (borrowed from hyperlink format in a vain attempt). Midicopy.exe, d.exe, miditrim.exe are 16 bit DOS progs for which I don’t have 32 bit replacements. The purpose of all this is so I can click in one place in my master music list to both play the relevant .mid file and display the relevant lyrics (which are all in one big .odt file). Also, !mute.txt contains a list of MIDI track names corresponding to instruments that will be played live (at least the lead vocals, and often also some harmonies, backup vocals, and maybe bass, drums, keyboards and/or guitars). The little DOS programs strip out all of these parts before playing the file, regardless of their MIDI track numbers, and even if some of them span multiple tracks.
I’m using LO 4.04 under Win XP Pro SP3.
|
s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964362992.98/warc/CC-MAIN-20211204124328-20211204154328-00514.warc.gz
|
CC-MAIN-2021-49
| 2,146 | 15 |
http://blog.markstahler.ca/2008/12/self-hosting-sucks/
|
code
|
Self Hosting Sucks
I like to tinker with my computer. Since I was a wee teenager I played with Linux. At 15 I was given access to a Linux shell and charged with maintaining multiple Quake 2 servers running on a sweet sweet OC12 at Qwest and serving hundreds of players daily. During these years I thought it must have been the coolest job to get paid to tinker with servers all day. Since I have become enlightened in a number of ways…
For those that don’t personally know me, a few friends and I have started our own software project. We are several months into development and have setup and been working on our own development server. We are in a lucky position to have the hardware and internet connection supplied by our University. We are running Window Server 2008, SQL Server 2008, Visual SVN Server, CruiseControl.NET, IIS and probably more things I cant remember. Everything finally works after countless hours but it is was a nightmare. There are countless little issues or seeming trivial configuration options that take forever to solve.
Last month a Windows Update took down the server and it didn’t come back up. I wasn’t able to physically go to where it was hosted to revive it for several days. Our Vmware host has also crapped out before requiring some intervention. Well, the same thing happened again this month as I forgot to change the Windows Update settings. No idea what is going on as the server is unreachable as is the Vmware host. I have no idea what is up with Vmware and I don’t have time to play with it. We are already behind schedule running into other unexpected problems like a bug in the .NET compiler which caused us 2 weeks of lost time. The thing that scares me though is that we haven’t even run into any of the expected outages like hardware failure thankfully. Self hosting requires performing your own backups and upgrading/repairing your own hardware.
Without describing the plethora of other issues we have experienced I can simply say that a much larger portion of my time is devoted to maintenance than I had hoped. This isn’t even including things like hardware upgrades or setting up or maintaining infrastructure. The only benefit I can see from self hosting is some extra control over your system that you may not get at some hosts. SO WHAT! We live with a firewall we have no control over but find ways to make it work. You will to if you have no choice.
So if you are ever in a position to make a choice to self host or not, ask yourself do you want to pay a hosting company to do it who specialize in this sort of thing or do you want to take on the role of jack of all trades and do it all yourself? I don’t want the kind of pressure on my back if a configuration issue causes an outage for who knows how many people.
Update: it turns out that the network subnet we were running on was reallocated because it was believed no one was using it or they just forgot. So hopefully we get allocated an ip for our server soon or hardly any work will be done over the break. Ugh.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917119361.6/warc/CC-MAIN-20170423031159-00137-ip-10-145-167-34.ec2.internal.warc.gz
|
CC-MAIN-2017-17
| 3,044 | 7 |
http://www.toastandtesla.com/engineering/maths/good-friendship-requires-good-accounting/
|
code
|
Imagine the following problem: Amelia, Bill, Clemens, Dean and Eric are friends living together. Whenever they need to buy something to be used communally, one of them picks up the cost.
For a joint camping trip, Amelia pays £30 for food, Bill spends £45 on fuel, Clemens pays £10 for some cheap booze, Dean buys a tent for £35 and Eric gets some bug spray for £5.
Clearly, this isn’t fair. The friends could set up a joint account, and use it as an intermediate step to resolve all their debts, but it’s easier just to pay each other directly.
The problem is resolving the debt with the fewest transactions. I think I’ve come up with a solution, using quadratic programming, but I can’t prove its correctness.
First of all, let’s specify the problem more accurately. We want a set of transactions between the friends that will lead to them having spent the same amount of money. That amount of money is going to be the mean amount spent.
Let the balance, , be the difference between the amount spent and the goal value:
where is the amount spent by the Nth person, and N is the number of people in the group.
In our case, the average cost is £25, and:
Clearly, the optimal solution will only have transfer from people with negative balance to people with positive balance, so we split the friends into those who owe and those who are owed.
Another constraint we can add is that no one should pay more than they owe, and no one should receive more than they are owed. This makes the problem sound like a flow network.
In this flow network, all edges go from left to right, and their capacities are determined by the values .
This particular flow network corresponds to 5 inequalities:
If we make vectors out of the balances and the transaction values, we can write these inequalities as a matrix inequality:
With the further constraint that:
Our goal now is to find the solution to this inequality which has the most zero-value transactions. Up until here, I think everything I said was justified, but I’m going to make the following conjecture:
The solution to the inequalities that maximises the sum of squares of transactions (i.e ) will have the same number of zeros or fewer than any other solution.
This conjecture is based on the intuition that maximising the sum of squares will maximise the variance in transactions, and will do so by hitting as many boundaries as possible.
To test this conjecture out empirically, I used MATLAB’s GlobalSearch class, which attempts to optimise a problem by running an optimising algorithm from a random selection of starting points, picking the best local optimum found. Here’s some code. You’ll need the MATLAB Global Optimization Toolbox. Sorry about that.
Anyway, running the program on our sample data set produces the following output:
Clemens pays Amelia 5.00
Clemens pays Dean 10.00
Eric pays Bill 20.00
Which is a very acceptable solution. Trying out different numbers, I couldn’t come up with a counter example or a proof. Any ideas?
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-09/segments/1518891817523.0/warc/CC-MAIN-20180225225657-20180226005657-00521.warc.gz
|
CC-MAIN-2018-09
| 3,012 | 23 |
https://coderanch.com/t/204971/java/concpet-making-chat-java-net
|
code
|
concpet behind the making of chat through java.net?
posted 16 years ago
hi, can you explain me the the detail concept in the making of chat through java.net. questions are: 1-do the server needs a thread or multithread? or can be handle through java.util class like vector etc. 2- do client needs to have a thread to handle the response coming from the server.thread or multithread? i would be grateful if you give the answer in more details. thanking in advance nima lama.
|
s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187825510.59/warc/CC-MAIN-20171023020721-20171023040721-00003.warc.gz
|
CC-MAIN-2017-43
| 473 | 3 |
https://blog.jetbrains.com/go/2020/11/12/goland-2020-3-goes-beta/
|
code
|
GoLand 2020.3 Goes Beta!
GoLand 2020.3 Beta is out! :collision:
The Beta is quite stable in comparison to the Early Access Program builds, but please keep in mind that there may still be some rough edges here and there.
The Beta build is usually the last build in the EAP cycle that does not require a subscription to use (if you are using the EAP builds to test out GoLand).
The upcoming GoLand 2020.3 debugger and testing features have received some special attention. You can explore the goroutines goroutines dump, and stop a debug session using a Go Remote configuration. On the subject of testing, we’ve added support for table tests and expanded support for the Testify test framework. On top of that, you will find many new code editing features, including support for time package, smarter ways to handle packages, UI improvements, as well as many new features for web development and working with databases, and a new service from JetBrains for collaborative development and pair programming.
If you want to get an interactive introduction to the new features, the new What’s New in GoLand 2020.3 course is already available for you on the Welcome screen in the Learn IDE tab. But please note that not all the features are available there yet.
- Code inspections
- Code editing
- Code With Me
- UI improvements
- VCS updates
- More features
- Web development changes
- Work with databases
The new Dump Goroutines icon in the debugger lets you easily find goroutines that contain a specified string in the stack during the debug session. Simply click the icon to open a dump in a separate window.
To help you keep focus on information that matters there is the option to hide an individual goroutine or goroutines with the same stack. Right-click on a goroutine and select the desired action or just press delete to move it to a special Hidden section in the dump window where it won’t distract you.
Another enhancement made to the debugger in this release is the ability to stop a process with Go Remote configuration if no reattach is required. In your configuration settings you can specify the default behavior of the debugger on disconnect, you can choose Stop remote Delve processes, Leave it running, or have GoLand ask you how to proceed each time.
Support for table tests
You can run and navigate to individual table tests from the Run tool window.
There are some limitations:
- The test data variable must be a slice, an array, or a map. It must be defined in the same function as the call and must not be touched after initialization (except for range clauses in a for loop).
- The individual test data entry must be a struct literal. Loop variables used in a subtest name expression must not be touched before the call.
A subtest name expression can be a string field in the test data, a concatenation of test data string fields, and an
Expanded support for Testify
The IDE now recognizes the test function that starts a test suite, and provides a way to start an individual
suite.T().Run, as long as the subtest name is a string constant. In addition, it is possible to rerun a subtest from the Run tool window to avoid rerunning the entire top-level test.
GoLand can now run Testify suites with the same method name separately within a single test case.
Last but not least, when you complete a function or method that accepts
testing.T as the first argument, GoLand passes that argument automatically if possible. This works for functions and methods of
The Incorrect usage of Println/Printf like functions code inspection will warn you about potential problems in github.com/pkg/errors, github.com/sirupsen/logrus, and go.uber.org/zap packages. On top of that, we’ve added placeholder highlighting and folding, as well as the Add format string argument intention.
The context.CancelFunc not called code inspection reports potentially unsafe uses of context cancellation. This is especially useful when the ‘cancel’ function returned by
context.WithCancel (and similar functions) isn’t called on all execution paths. To learn more about this package please visit: https://golang.org/pkg/context/.
Support for time package
We’ve added support for the time package so you can work with time and duration more easily. GoLand will suggest elements of predefined layout via code completion(⌃Space on macOS and Ctrl+Space on Windows/Linux) as YYYY, MM, DD placeholders from ISO-8601.
Press ⌘+P on macOS or Ctrl+P on Windows/Linux on a token, and the IDE will show its meaning. There is also syntax highlighting for layout tokens. Code completion also suggests standard time layouts outside of the string literal.
Smarter package handling
The IDE is now smarter at prioritizing completion items for packages that you use frequently and that are explicitly declared in the go.mod file of your project. We’ve also added an option to exclude packages completely from your project import path and completion suggestions. You can do this via Alt+Enter or in the new Exclude for import and completion window in Settings/Preferences| Preferences | Go | Imports.
Support for variable shadowing
GoLand makes it easier to spot variable shadowing:
- The IDE shows variables that shadow any existing declaration in a different colour now.
- Navigate to shadowing declaration intention action lets you immediately switch to the shadowed declaration.
Supports Square Brackets in Type Parameters
We’ve followed updates from the design of generics by the Go team and added support for square brackets for the generics syntax instead of parentheses, as this was implemented in the previous proposal edition. Please note that the Enable generics (experimental support for type parameters) setting in Preferences/Settings | Go is selected by default in the Beta build, but will be turned off in the 2020.3 release version. You’ll need to explicitly select that checkbox to start using the feature.
When you type func in the test file, GoLand by default suggests
test Live Templates in the completion options.
When you type for inside the benchmark, the IDE suggests completing it with a for loop with
Improved spelling and grammar checkers
Suggestions now appear immediately in the dialog when you press Alt+Enter. In addition, a new version of the LanguageTool grammar checking engine features improved checks for English and adds support for 10 additional languages.
Code With Me
GoLand 2020.3 supports Code With Me (EAP) – a new service from JetBrains for collaborative development and pair programming. Code With Me enables you to share the project you currently have open in your IDE with others and work on it together in real time. Check out these posts to learn more about it.
Reworked Welcome screen
We’ve reworked the Welcome screen to give you immediate access to:
- Search for projects.
- Settings to customize your IDE.
- Plugins to expand the functionality of your IDE.
- Tutorials to learn more about your IDE’s features.
Sync IDE theme with your OS preference
Select the Sync with OS option in Settings/Preferences | Appearance & Behavior | Appearance | Theme to automatically switch your IDE theme to match your OS preferences.
Drag and drop tabs anywhere to split the editor
Split the main editor screen horizontally or vertically by dragging a tab to the desired position and dropping it there. When you are dragging a tab, the editor will highlight where you can drop it.
Project view updates
We’ve improved the UX when working with files from the Project view. Now when you open a file from the Project view, the focus is automatically placed on the editor to allow you to start working with your code right away. Press the spacebar and the IDE will show you a preview of the file in the Project view.
If you want to have several files open in the editor simultaneously, you can now do so with one simple shortcut. Select the file in the Project view and press Shift+Enter to have the IDE split the Editor window and open the file in the right-hand part of it.
Reworked VCS menu
The VCS menu now adapts to version control system that you are currently using, making it easier to access key VCS features as they are no longer hidden in a submenu.
Support for Git staging area
There is an awesome new Git staging area available! Please note that this functionality is only available for the Commit tool window.
Tick the Enable staging area checkbox in Preferences/Settings | Version Control | Git to turn it on. Once you do, support for changelists will be disabled.
In the commit UI, you will find staged and unstaged files. When you’re ready to stage a file, simply click the + icon next to it. The file will appear under the Staged node. To add your changes to the staging area you can also use the gutter icon or Show Diff.
Improved work with branches
Work with branches has been improved:
- The IDE now automatically corrects unaccepted symbols in the names of new branches, which helps you create branches in line with the accepted format.
- The IDE will now show you all the actions available for the currently selected branch, just like it would for other branches.
- For remote branches, we’ve renamed the Merge into Current and Rebase Current onto Selected actions to Pull into Current Using Merge and Pull into Current Using Rebase.
Plugins enabled per project
We’ve added the ability to enable plugins for the current project or for all projects by selecting Enable for Current Project or Enable for All Projects. In Settings | Preferences / Plugins, press the gear icon on the plugin you want to enable or disable and select the desired option.
System shortcut keymap for macOS
macOS system shortcut keymap (Preferences/Settings | Keymap) aims to provide you with an alternative macOS keymap that offers extended compatibility with system shortcuts and allows you to avoid using F-keys for essential actions.
Profiler – Flame Graph
We’ve improved the search mechanism of the Flame Graph in the Profiler and its visualization to let you find method metrics faster. You can click on the magnifying glass icon or type your search request inside the Flame Graph panel.
Also, we’ve added a search field, up/down arrows for fast navigation between search results, and the ability to search either in the whole Flame Graph or just in a specific subtree.
Web development changes
Create a React component from its usage
Courtesy of the WebStorm team, GoLand now has rich support for web development under the hood. One of the upcoming changes in this area is the ability to create a React component from an unresolved reference. Place the caret at an unresolved component, press Alt+Enter, and select the corresponding inspection.
Full support for pnpm
GoLand provides full support for the pnpm package manager, along with npm and yarn. When you open a project with a pnpm-lock file and have pnpm installed on your machine, GoLand will automatically change the package manager for this project to pnpm. The IDE also has a dedicated pnpm option in the list of package managers under Preferences/Settings | Languages and Frameworks | Node.js and NPM.
Basic support for multiple webpack configs
Work with databases
Thanks to our colleagues from the DataGrip team, GoLand has expanded its family of supported databases with a new member – Couchbase! Please note that the IDE supports the Couchbase Query service, not the Couchbase Analytics service.
Support for grants
GoLand knows about object grants and displays them in an object’s DDLs. This works for MySQL, PostgreSQL, Greenplum, Redshift, and SQL Server.
Separate editor for cell values
We’ve improved the separate editor for separate editor for cell values:
- It now displays the formatted value even if the value is not formatted properly.
- It’s possible to edit the value in the formatted view and update it with the original formatting in one-line XMLs and JSONs.
- If the width of the screen is crucial to your flow, you can move the cell value editor to the bottom of the data editor.
- This panel can now also display images!
Import/export for databases
We’ve added two new extractors to help make it easier for you to work with data:
- One-Row will help you copy a column to a comma-separated string.
- SQL-Insert-Multirow will generate a single INSERT statement with multiple new rows to be inserted.
In addition, there is now a new option in CSV format configuration: never quote values.
The GoLand team
Subscribe to Blog updates
Thanks, we've got you!
What’s next: GoLand Roadmap 2023.3
We are going to address some of the older issues and add some fancy features in 2023.3. Check out what's coming in the next GoLand release!
GoLand 2023.2 Reaches Beta!
The Beta provides all of the new features and improvements already announced during our current EAP cycle.
GoLand 2023.2 EAP #7: LSP API Support, and HTTP Client Improvements
This build includes support for LSP API and improvements for HTTP Client.
|
s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233506480.7/warc/CC-MAIN-20230923094750-20230923124750-00314.warc.gz
|
CC-MAIN-2023-40
| 12,946 | 111 |
https://www.automate.org/robotics/news/what-is-an-end-effector-and-how-do-you-use-one
|
code
|
What is an End Effector and How Do You Use One?
What’s even more confusing is that many end effectors look almost exactly the same but have hugely different specifications.
In this short guide, we’ll clarify some end effector basics and advice.
What is an End Effector?
An end effector is a peripheral device that attaches to a robot’s wrist, allowing the robot to interact with its task. Most end effectors are mechanical or electromechanical and serve as grippers, process tools, or sensors. They range from simple two-fingered grippers for pick-and-place tasks to complex sensor systems for robotic inspection.
The term “End of Arm Tooling” (EOAT) may also be used.
Basically, an end effector is the “business end of the robot.”
Without an end effector, most robots are practically useless. An articulated robotic arm can be programmed to a particular location within its workspace, but without some sort of end effector, it has no way to perform any operation.
The 3 Basic Types of End Effector
There are so many different types of end effector that it would be almost impossible (or at least unhelpful) to list all of them here. However, there are 3 basic types that you are likely to come across in most situations.
These types are:
The most common robot end effector is the humble gripper. It allows you to pick up and manipulate objects, which makes it best suited to tasks like pick-and-place, assembly, and machine tending.
There are possibly more different types of gripper than there are any other type of end effector. By far the most popular are fingered grippers, which come with 2, 3, 4, or 5 fingers — it is possible to use 6 fingers or more but it is rarely necessary.
Then, there are vacuum grippers, magnetic grippers, needle grippers, and there are amazing new gripper technologies being developed all the time.
2. Process Tools
A simplistic way to think of process tools is like a worker operating a power tool. While a gripper can only grasp the workpiece, a process tool actually changes the workpiece.
There are as many different process tools as there are different operations in manufacturing. Examples include, robot welding tools, robot machining tools, robot painting tools, 3D printing tools, and the list goes on and on.
If you can do it with a power tool, you can probably do it with a robot.
If you can do it with another automated machine, you might be able to do it with a robot.
You can also attach a sensor to use the robot as a programmable sensor-orientation device. This is particularly useful for applications like robotic inspection which reduce the amount of hands-on time that inspection engineers need to spend collecting data.
Many sensors can serve as an end effector, including ultrasonic sensors, laser scanners, 2D and 3D cameras, and infrared sensors (such as those used at NASA).
Extra: Tool Changers
Though not technically classed as end effectors themselves, tool changers also attach to the end of the robot — between the wrist and the end effector. They allow the robot to autonomously change between different tools.
Which End Effector is Right for You?
There are so many different end effectors available it can be quite confusing to know which is the best for your particular application.
Should you use a gripper? If so, which type is the best and what specifications does it need? Or, would you be better picking a process tool? Which one?
Unfortunately, the answer is really… it depends.
To determine which end effector is best suited to your application, you need to take a step back and ask yourself: What are we trying to achieve with this task?
Picking the Right End Effector
When you have refocused on the purpose of the task, follow these steps:
- Determine which actions the robot has to perform to achieve the task.
- Make a shortlist of the different types of end effector that could deliver these actions.
- Assess each type for cost, complexity, and any other relevant factors.
- Finally, pick the end effector that best suits the needs of this particular task.
There may be several ways to achieve the same task using different robot end effectors.
For example, think about a spray painting task.
On one hand, you could mount a spray painting end effector as a process tool onto the robot’s wrist, which would be simple to do.
On the other hand, you could use a gripper to grasp a spray gun, which would allow the robot to quickly move to another task and would not require a custom end effector.
Neither option is wrong, it just depends on what you need.
How to Use an End Effector With Your Robot
Every end effector is operated in a slightly different manner. They use different communication protocols, different programming interfaces, and require different levels of skill to get them up and running.
The basic steps for using any end effector with a robot are:
- Physically mount the end effector onto the robot’s wrist.
- Attach any power connections, e.g. electric, pneumatic, hydraulic.
- Attach any communication interfaces between the end effector and robot controller or computer.
- Incorporate the end effector programming into the robot’s program.
This last stage (programming) has often been the most challenging of these steps.
But, not any more!
Programming an end effector doesn’t need to be difficult. With the right robot programming software, you could have a version of any end effector working in only 5 minutes.
With RoboDK you can simply create a robot tool by loading the 3D model and drag and drop it to your robot within the tree. You can also self calibrate the tip of the tool by touching the same point with different orientations.
|
s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817398.21/warc/CC-MAIN-20240419110125-20240419140125-00626.warc.gz
|
CC-MAIN-2024-18
| 5,665 | 50 |
https://bugzilla.mozilla.org/show_bug.cgi?id=597806
|
code
|
I found recently that X rendering is not gonna work. Stuart's idea of rendering everything on X side, binding X surfaces to GL textures, and rendering plugins with X, this all will not work... because we are pushing too many rendering tasks on X side... and it is not possible to do fast scrolling on chrome side with X and prepare next content update at the same time because all these things happens in one "X" process. We should render everything locally with pixman or any other process bounded rasterizer ... and then just blt ready images to X.
Can you be more specific about what you did to arrive at this conclusion? Did you profile some workload and find that X is the bottleneck? What was the workload and what can you tell us about the profile?
Problem is that pixman is usually slow, and not optimized everywhere.... And we are trying to use on N900 Gtk Xorg pixman as primary rasterizer. With current fennec/remote layers(using X) we have problem with single threaded X server... We are using X-server (Xrender->pixman) to prepare shadowLayerChild content, and with this we are slowing down whole XServer process and see rendering lags screen... we've created multi-process environment and failing with single process rendering compositor. This problem not visible on Fennec Qt port (raster mode enabled by default on N900 and qt works with images), also this problem not visible on Android (only images used there), and MicroB browser on N900 rendering all content layout data with gfxImageSurface.... But problem visible on GTK N900 Fennec, where we are rendering all things with X/XRender and overloading Xorg process with content rendering operations. so for GTK we have two options: 1) render child with image and XSHmPuthimage to Parent process... and on parent process continue use X surfaces 2) Switch everything to Images, render all images(layers) to SHM memory (screen size image), and then do XSHMPutimage to GDK window (similar what microb does) and qt raster backend with option 1) we still can use X-HandleEvent for plugins... but that require Plugin-Show implementation across the processes (send plugin X-surface directly to Chrome process from plugin child process) with option 2) we must switch plugins to image rendering NPAPI (on maemo 5 use existing proposal), on maemo6 use new NPAPI image rendering. Please don't start here discussion about GL acceleration.... that will just make things even more complicated... and not gonna fix this problem.
How about XRender? Why don't these devices have any XRender acceleration?
I hate X bugs. (In reply to comment #2) > so for GTK we have two options: > 1) render child with image and XSHmPuthimage to Parent process... and on parent > process continue use X surfaces > 2) Switch everything to Images, render all images(layers) to SHM memory (screen > size image), and then do XSHMPutimage to GDK window (similar what microb does) > and qt raster backend > > with option 1) we still can use X-HandleEvent for plugins... but that require > Plugin-Show implementation across the processes (send plugin X-surface directly > to Chrome process from plugin child process) I'm not sure why that's needed. Can't the content process just set up an ImageLayer with an X surface, so we create a shadow layer for that in the chrome process? That shouldn't require the plugin process to talk directly to the compositor.
Yep, plugin will call just Show(new, back), and content forward this call to Chrome... and so "new" X-Surface will appear on Chrome process. But anyway for option 1, we need to make something to render content into image surface, and then push it into chrome X-Surface.... in this case we should allocate 3 surfaces (front, back X + temporary image)....
(In reply to comment #3) > How about XRender? Why don't these devices have any XRender acceleration? Because we are still in 21-st century... not in 23 or 24... ;)
Summary: Fennec should use X as less as possible → Fennec should use X as little as possible
Fennec has been switched to image rendering and don't use XRender anymore.
Status: NEW → RESOLVED
Last Resolved: 8 years ago
Resolution: --- → DUPLICATE
Duplicate of bug: 597336
You need to log in before you can comment on or make changes to this bug.
|
s3://commoncrawl/crawl-data/CC-MAIN-2018-47/segments/1542039742567.46/warc/CC-MAIN-20181115054518-20181115080518-00384.warc.gz
|
CC-MAIN-2018-47
| 4,253 | 14 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.