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://invisioncommunity.com/news/invision-community/9697-ips4-pre-release-available-for-testing/ | code | If you like living on the edge and testing new products we would love your help in testing IPS Community Suite 4.0!
We now have pre-release versions available for download if you are an active Community Suite license holder.
Pre-Release vs. Beta
This is a pre-release which means we are not quite done adding/changing some areas of the Suite. It also means that you cannot upgrade between each pre-release. Once we reach Beta stage you will be able to upgrade from Beta 1 to Beta 2 and so on.
- This is a preview of unfinished software. Do not install this on a live server or attempt to upgrade your current community. Please.
- You cannot upgrade between pre-release builds so you will have do a clean install each time we update this package. This will change when we reach proper beta stage.
- Only download this preview if you are comfortable testing software with known issues and want to provide bug reports and feedback.
- We provide no support for these pre-release builds.
Please post any bugs you find in the bug tracker and feedback/questions on the preview site. We are getting close to a public beta and the final, supported release of IPS Community Suite 4.0 and appreciate your help getting there!
Download Pre-Release Now
Note that Nexus, Content, and Chat are not yet available for download but will show up on our preview site soon. | s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296943471.24/warc/CC-MAIN-20230320083513-20230320113513-00420.warc.gz | CC-MAIN-2023-14 | 1,351 | 11 |
https://linuxtv.org/pipermail/linux-dvb/2005-May/002012.html | code | [linux-dvb] Kworld V-Stream Xpert DVB-T PCI card: installing
soyeb at btinternet.com
Sun May 15 19:49:43 CEST 2005
> I've download
> and built the kernel and v4l source (I had to copy the v4l modules
> into the right place). When I run the modprobe script in the previous
> message many modules do get loaded but I get the following errors:
> FATAL: Error inserting cx88xx
> (/lib/modules/184.108.40.206.20050514/v4l2/cx88xx.ko): Unknown symbol in
> module, or unknown parameter (see dmesg)
Hmm, it seems things aren't compiled properly. Rather than
investigating what went wrong there (I don't really have the time at the
moment), I could just answer your second question that is yes, the
default SuSE 9.3 kernel does have everything to use a KWorld DVB card.
Just load the modules as described in a previous email.
More information about the linux-dvb | s3://commoncrawl/crawl-data/CC-MAIN-2018-47/segments/1542039741510.42/warc/CC-MAIN-20181113215316-20181114000554-00021.warc.gz | CC-MAIN-2018-47 | 853 | 16 |
http://bicycles.stackexchange.com/questions/tagged/race?sort=unanswered&pageSize=15 | code | to customize your list.
more stack exchange communities
Start here for a quick overview of the site
Detailed answers to any questions you might have
Discuss the workings and policies of this site
tag has no wiki summary.
2015 Time Collection
I'm a usa cycling road racer and I recently won a Time ZXRS frame in a team raffle. I'm very excited, and I know this makes me sound really spoiled, but every time I've looked on the Time website I ...
Oct 26 '14 at 0:35
recently active race questions feed
unanswered question tagged
Hot Network Questions
How do I find the average color of an image?
"Epicycles" (Ptolemy style) in math theory?
Should the cross (or 'X' ) button do something other than close (e.g. minimize or hide)?
Why doesn't light affect a compass?
How to typeset a radio button?
Faulty plot of logarithmic function
Will military jets be scrambled when radio communication with a commercial aircraft is lost?
Where to catch Post event?
Are there commercial airplanes that are still steerable without any electricity?
In circular motion, with a constant distance, why does the mass of the orbitting object have no effect on its revolution at all?
How do I tell my supervisor his idea is incorrect?
Why is Worf in The Undiscovered Country?
MySQL - How to check whether all values of a given SELECTed row are equals?
What did Jon Arryn mean?
Is using "while true" to keep a script alive a good idea?
Why is Gimli allowed to travel to Valinor?
Is it more efficient to perform a range check by casting to uint instead of checking for negative values?
Uncommon Term for an Excellent Orator?
Convert a list of hexadecimal numbers to decimal
If magic is real, can it be true that rational scientific thought should exclude it?
How to display duration (HH:MM) so it isn't confused with clock time
What happened to Sirius Black's vault after he left all his money to Harry?
Using Loop function with arcpy.Exists()?
Why don't popular web services mask the CVV?
more hot questions
Life / Arts
Culture / Recreation
TeX - LaTeX
Unix & Linux
Ask Different (Apple)
Geographic Information Systems
Science Fiction & Fantasy
Seasoned Advice (cooking)
Personal Finance & Money
English Language & Usage
Mi Yodeya (Judaism)
Cross Validated (stats)
Theoretical Computer Science
Meta Stack Exchange
Stack Overflow Careers
site design / logo © 2015 stack exchange inc; user contributions licensed under
cc by-sa 3.0 | s3://commoncrawl/crawl-data/CC-MAIN-2015-14/segments/1427131300464.72/warc/CC-MAIN-20150323172140-00105-ip-10-168-14-71.ec2.internal.warc.gz | CC-MAIN-2015-14 | 2,404 | 54 |
https://nextgentools.me/jasper | code | Jasper is a content platform that assists you in developing, marketing, and measuring material that resonates with your audience. It uses NLP and GPT-3 AI to generate custom-tailored content in seconds, whether it be web copy, blog posts, or full marketing campaigns. With Jasper, you may produce high-quality content that is SEO-friendly, captivating, and data-driven. You may include multiple language support, lots of templates, and even Boss Mode, which is renowned for being able to automate your writing process. Because of the data-driven nature of Jasper’s content, marketers and authors may automate their writing process with Boss Mode.
- You can create content directly from the browser using the Jasper Chrome Extension.
- Starter Mode uses templates to help you quickly generate SEO-friendly content.
- You may use commands to create content in bulk using Boss Mode.
- Generate AI Art and visuals for your blog posts or web copy, or even modify existing ones.
- You may create content in more than 20 languages to reach a global audience.
- Surfer SEO integrates with the Jasper Chrome Extension to provide the most out of your content.
Jasper offers the following pricing plans:
- Starter: $42/month+
- Boss Mode: $82/month+
- Business: Custom plans are available
- Content creators can produce search-friendly web content and blog posts with no problem. – Data-driven content may be produced to improve your campaigns.
- Social media managers may create engaging visuals for social media posts with automation.
- Agencies will use Japer to produce content and optimize campaigns for multiple customers.
- SEO Specialists might use Jasper to create automatically in order to rank higher in search results.
- Larger Corporations might use Jasper for automated content creation workflows.
- Jasper has difficulties with very technical topics
- No plagiarism detection
- Has it’s own API | s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100476.94/warc/CC-MAIN-20231202235258-20231203025258-00460.warc.gz | CC-MAIN-2023-50 | 1,904 | 19 |
https://www.papercall.io/events?keywords=tags%3A+azure | code | Learn how Microsoft Azure’s cloud services can accelerate your cloud app development process: we support the tools and languages you already use, security and management services are built-in, ML/AI capabilities are quickly callable from your app, and you can retain full control on how (and where) you deploy your code.
I'm Attending!May 29, 2019May 31, 2019Riga Dev Days 2019 - Cinema Kino CitadeleUTC###About the event
RigaDevDays - is a tech conference and the annual meeting point for developers in Baltic States. **29-31 May in Riga**. We bring together rockstar speakers from around the world and developers from Europe for **3 days of workshops, talks and networking**.
###What to expect?
- Two full conference days with 4 parallel tracks with Java, DevOps, Cloud, SQL Databases, .NET topics.
- One pre-conference workshop day with full-day trainings from top-experts. Sessions are held in small groups.
All of speakers have previous public speaking background, published a book, or actively contribute in development of open source community. At least 50% or our speakers are invited directly.
In 2018 we have received over 400 public submissions. Program Committee - are developers with over 15 years of experience, who thoroughly manage speaker selection process.
###Only hands-on presentations
Riga Dev Days is well known for practical sessions and updates about the most recent changes in technology areas. You will benefit from the content, and will have a direction for improving your technical career and current project.
###Huge Cinema Screens
The event is taking place in the largest Cinema theater in Baltics. The keynotes will be presented on Scape screen, which is one of the largest in Northern Europe.
The venue will be packed with sponsors of different kinds. We will help them arranging fun and interactive activities for the visitors.
###Networking and party
Talk to speakers, meet your former colleagues, find new co-minders! There will be a spectacular networking event during the conference.
I'm Attending!September 10, 2019September 12, 2019CloudyConUTC**Who will attend CloudyCon?**
CloudyCon will deliver real word stories, expertise, and inspiration for and by FinOps leaders and practitioners - all aimed at helping the community member and their teams become better at cloud financial management.
**Who are we looking for?**
FinOps is about breaking down silos between the formerly disparate groups who now need to work together to manage cloud spend efficiently. As such, we are looking for a diverse group of FinOps practitioners, technology leaders, business executives, technical procurement, cloud financial analysts, cloud economists, and finance operations professionals who have played a role in their organizations journey in adopting the cloud.
**Who puts on CloudyCon?**
CloudyCon is a conference put on by Cloudability as the first FinOps conference in the world. Cloudability is partnering with the FinOps Foundation to drive FinOps best practices content for the event. It has also invited the FinOps Foundation to provide a vendor-agnostic certification on FinOps at the conference. Burlingame, CA
I'm Attending!October 02, 2019October 04, 2019DevOps Unicorns 2019UTCDevOps Unicorns (previous name DevOpsDays Riga) is both a technical conference and a conference focusing on culture, processes and structure within organizations. We encourage both technologists and business people to attend, learn and share experiences. DevOpsUnicorns is a three day conference, first day for workshops, next 2 days of conference, starting at 9am till evening, including talks, ignites and evening networking events each day.
DevOps Unicorns 2019
October 2-4, 2019; 09:00-17:00
Park Inn by Radisson Riga Valdemara, Krogus iela 1, RigaRiga, Latvia
I'm Attending!June 21, 2019June 21, 2019ServerlessDays Milano 2019UTC# ServerlessDays Milano 2019
Serverless is a recent addition to the long list of technologies that promise to accelerate software delivery, reduce the cost of compute ownership and provide unicorns and rainbows for all. And like all industry buzzwords, it generates enthusiasm and skepticism in equal measure – how to move beyond the hype?
ServerlessDays started life as JeffConf, a tongue in cheek conference in the spirit of Paul Johnston’s blog post, “Serverless is just a name. We could have called it Jeff”, an attempt to move beyond the Serverless buzzword and focus on the practical use of function as a service platforms and the value they provide. It is a one day, community-focused, single track event centered on real-world Serverless based solutions. It’s about fostering a community and helping all of us learn from each other as we embrace a new way of building applications.
ServerlessDays Milano 2019 is an evolution of the previous JeffConf Milan in 2017 and the proud confirmation of ServerlessDays Milano in 2018, and we look forward to building on the success of the previous ServerlessDays events around the world and learning from where we could do better. Our focus is on building a community through sharing of experiences, accessible without a large commitment of time or money (tickets start from just €35).Milano, Italy
I'm Attending!September 05, 2019September 06, 2019DevOpsDays Cape Town 2019UTCThank you for considering a submission for the fourth edition of DevOpsDays Cape Town.
To increase your chance of having your talk, ignite or workshop selected, please consider the following topics. These subjects have been chosen to fit this year’s theme.
- Knowledge gained on a particular technology
- What is the next frontier for DevOps?
- Organizational changes (management and engineering)
- War stories (successes and failures are equally important to us!)
Should you have a topic in mind, that is not listed above; please reach out to the organizers at [email protected].
For reference, here is the duration of a session: - ignite talks: 5 minutes - talk: 30 minutes - workshop: 2.5 hours
Workshops are hands-on sessions in a classroom setting.South Africa, Cape Town | s3://commoncrawl/crawl-data/CC-MAIN-2019-22/segments/1558232256426.13/warc/CC-MAIN-20190521142548-20190521164548-00307.warc.gz | CC-MAIN-2019-22 | 6,081 | 38 |
https://www.lawnsite.com/threads/research-question.179628/ | code | So... I'm in the process of becoming licensed for liquid pest/herb applications. I just spent the last hour searching and reading posts on this subject. I don't want to bore anyone with all the beginner questions, save one... What is the recommended reading (books, articles, websites, etc.) on this subject? My certification procedures don't begin for a few more weeks and I'd like to do some reading before hand to at least have a basic grasp of the equipment and chemicals, their use and applications. Thanks in advance guys. | s3://commoncrawl/crawl-data/CC-MAIN-2018-05/segments/1516084886979.9/warc/CC-MAIN-20180117212700-20180117232700-00424.warc.gz | CC-MAIN-2018-05 | 528 | 1 |
https://docs.microsoft.com/en-us/answers/questions/302788/version-settings-for-xamarinandroid-solutions-amp.html | code | This is probably a question for which I dug my own hole, but here it is. Somewhere along the line after attempting to add a Class Library Project to my Solution (which previously contained only a single Xamarin.Android Project) I ended up changing some settings that give me the following error:
Project XXX is not compatible with monoandroid 10.0 (MonoAndroid, Version=v10.0). Project XXX supports: netcoreapp3.1 (.NETCoreApp, Version=v3.1)
My app does not use any complex or recently added features, so what version I make it right now is not of high significance, although I do plan on updating & compiling it for the latest versions of .NET & Android when Android 11 is released near the end of 2021. What do I need to do to make the version settings in the Class Library & Xamarin.Android App work well together? Thanks. | s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038057476.6/warc/CC-MAIN-20210410181215-20210410211215-00346.warc.gz | CC-MAIN-2021-17 | 825 | 3 |
https://www.theanswerbank.co.uk/Technology/Question159460.html | code | Crosswords9 mins ago
No best answer has yet been selected by caramba22242. Once a best answer has been selected, it will be shown here.For more on marking an answer as the "Best Answer", please visit our FAQ.
You may find that Real Player is playing it in low quality because the video IS low quality.
Anyway, open Media Player then choose the Tools menu then Options (it can difficult to find the Tools menu, one way is to maximize the window).
Chose the File Types tab, and select the fle types you want to use Media Player (or press Select All).
Choose OK then close Media Player. | s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104683020.92/warc/CC-MAIN-20220707002618-20220707032618-00024.warc.gz | CC-MAIN-2022-27 | 583 | 6 |
https://backdrift.org/man/tru64/man1/xdm.1X.html | code | xdm - X Display Manager with support for XDMCP, host chooser
xdm [-config configuration_file] [-nodaemon] [-debug debug_level] [-error error_log_file] [-resources resource_file] [-server server_entry] [-session session_program]
All of these options, except
values that can also be specified in the configuration file as resources.
Names the configuration file, which specifies resources to
control the behavior of
is the default. See the section
Specifies ``false'' as the value for the
resource. This suppresses the normal
daemon behavior, which is for
to close all file descriptors,
disassociate itself from the controlling terminal, and put itself in the background
when it first starts up.
Specifies the numeric value for the
resource. A non-zero value causes
to print lots of debugging statements to the terminal; it also
to run synchronously. To interpret
these debugging messages, a copy of the source code for
is almost a necessity. No attempt has been made to rationalize or standardize
Specifies the value for the
resource. This file contains errors
as well as anything written to stderr by the various
scripts and programs run during the progress of the session.
Specifies the value for the
resource. This file is loaded using
to specify configuration parameters for the authentication
Specifies the value for the
resource. See the section
for a description of this resource.
Specifies the value for the
resource. This sets the port-number
will monitor for XDMCP requests. As XDMCP uses
the registered well-known UDP port 177, this resource should not be changed
except for debugging.
Specifies the value for the
resource. This indicates the program
to run as the session after the user has logged in.
Allows an arbitrary resource to be specified, as in most X
The xdm program manages a collection of X displays, which may be on the local host or remote servers. The design of xdm was guided by the needs of X terminals as well as the X Consortium standard XDMCP, the X Display Manager Control Protocol. xdm provides services similar to those provided by init, getty and login on character terminals: prompting for login name and password, authenticating the user, and running a ``session.''
A ``session'' is defined by the lifetime of a particular process; in the traditional character-based terminal world, it is the user's login shell. In the xdm context, it is an arbitrary session manager. This is because in a windowing environment, a user's login shell process does not necessarily have any terminal-like interface with which to connect. When a real session manager is not available, a window manager or terminal emulator is typically used as the ``session manager,'' meaning that termination of this process terminates the user's session.
When the session is terminated, xdm resets the X server and (optionally) restarts the whole process.
When xdm receives an Indirect query via XDMCP, it can run a chooser process to perform an XDMCP BroadcastQuery (or an XDMCP Query to specified hosts) on behalf of the display and offer a menu of possible hosts that offer XDMCP display management. This feature is useful with X terminals that do not offer a host menu themselves.
Because xdm provides the first interface that users will see, it is designed to be simple to use and easy to customize to the needs of a particular site. xdm has many options, most of which have reasonable defaults. Browse through the various sections of this reference page, picking and choosing the things you want to change. Pay particular attention to the Session Program section, which will describe how to set up the style of session desired.
In handling a user's login to the X display,
records the login in the
file, the same
way that a normal, non-X login does. This allows the
commands to show the user logged in to the X display.
Actually, xdm is designed to operate in such a wide variety of environments that typical is probably a misnomer.
First, the xdm configuration file should be set up. Make a directory (usually /usr/var/X11/xdmr or /usr/lib/X11/xdm) to contain all of the relevant files. Here is a reasonable configuration file, which could be named xdm-config:
XDM-AUTHORIZATION-1 MIT-MAGIC-COOKIE-1 DisplayManager._0.setup: /usr/var/X11/xdm/Xsetup_0 DisplayManager._0.startup: /usr/var/X11/xdm/GiveConsole DisplayManager._0.reset: /usr/var/X11/xdm/TakeConsole DisplayManager.local_0.authorize: true DisplayManager.local_0.authName: \
XDM-AUTHORIZATION-1 MIT-MAGIC-COOKIE-1 DisplayManager.local_0.setup: /usr/var/X11/xdm/Xsetup_0 DisplayManager.local_0.startup: /usr/var/X11/xdm/GiveConsole DisplayManager.local_0.reset: /usr/var/X11/xdm/TakeConsole DisplayManager*resources: /usr/var/X11/xdm/Xresources DisplayManager*session: /usr/var/X11/xdm/Xsession DisplayManager*authComplain: false DisplayManager*chooser: /usr/bin/X11/chooser DisplayManager*keymaps: /usr/var/X11/xdm/Xkeymaps !DisplayManager*language: C
Note that this file mainly contains references to other files. Note also that some of the resources are specified with ``*'' separating the components. These resources can be made unique for each different display, by replacing the ``*'' with the display-name, but normally this is not very useful. See the RESOURCES section for a complete discussion.
The first file, /usr/var/X11/xdm/Xservers, contains the list of displays to manage that are not using XDMCP. Most workstations have only one display, numbered 0, so the file will look something like this:
:0 Local local /usr/bin/X11/X :0
This will keep /usr/bin/X11/X running on this display and manage a continuous cycle of sessions.
The file /usr/var/X11/xdm/xdm-errors will contain error messages from xdm and anything output to stderr by Xsetup_0, GiveConsole, Xsession, or TakeConsole. When you have trouble getting xdm working, check this file to see if xdm has any clues to the trouble.
GiveConsole assigns ownership of the console to the user. Here is an example GiveConsole file:
# Assign ownership of the console to the invoking user.
# By convention, both xconsole and xterm -C check that the
# console is owned by the invoking user and is readable before
# attaching the console output. This way, a random user can
# invoke xterm -C without causing serious problems.
# However, don't give up ownership of the console if the
# alternate console is in use, that is, if the graphics
# display device is not the console.
case `/usr/sbin/sizer -wc` in
chown $USER /dev/console
TakeConsole assigns ownership back to root. Here is an example TakeConsole file:
# Reassign ownership of the console to root -- this
# should disallow assignment of console output to any
# random users's xterm
chmod 622 /dev/console
chown root /dev/console
The next configuration entry, /usr/lib/X11/xdm/Xresources, is loaded onto the display as a resource database using xrdb. Since the authentication widget reads this database before starting up, it usually contains parameters for that widget.
The most interesting script is Xsession. It establishes the default login session for all users of the workstation. Here is an example Xsession file:
if [ -d $HOME -a -w $HOME ]
exec > $HOME/.xsession-errors 2>&1 else
echo "Xsession: $HOME directory not writable by $USER" \
exec dxterm -geometry 80x40+0+0
# exec xterm -geometry 80x24+0+0 fi
case $# in
case $1 in
exec dxterm -geometry 80x40+0+0
# exec xterm -geometry 80x24+0+0
if [ -f $startup ]; then
if [ -x $startup ]
exec /bin/sh $startup
if [ -f $resources ]; then
xrdb -load -retain $resources
# Motif/DECWindows Version
# MIT/Athena Version
# For a MIT/Athena version,
# uncomment the following lines and comment the Motif
# lines above
# xconsole -geometry 480x130-0-0 -daemon -notify -verbose \
# -fn fixed -exitOnFail
# twm &
# exec xterm -geometry 80x24+10+10 -ls fi
The preceding version of the Xsession script recognizes the special ``failsafe'' mode, specified in the translations in the Xresources file above, to provide an escape from the ordinary session. Failsafe mode enables you to start a dxterm even when your Xsession or $HOME/.xsession script is faulty. To enter failsafe mode, enter your username and password at the login prompt and then press either the F1 key or the F2 key, instead of pressing the carriage return key. This sequence initiates a dxterm session, enabling you to edit the faulty Xsession or $HOME/.xsession file. Also, if you do not have a login directory or if your login directory is not writable (as in the case of a login directory that belongs to someone else), failsafe mode is invoked and brings up a dxterm session to allow you to make adjustments.
The file /usr/var/X11/xdm/Xkeymaps defines the keymaps that are loaded into the Xserver for the various languages and keyboards. These keymaps are loaded by the Xsetup_0 script using the xmodmap command. The table in the following file defines the correspondence between the value of the console's language variable, the keyboard types, and the default keymaps loaded into the Xserver:
# # This file defines the language-keymap mapping # # # The first line contains the name of the # link to be created to the default keymap. # /usr/var/X11/xdm/keymap_default # # This is the directory where the keymap files are to be found. # /usr/lib/X11/keymaps/ # # The following lines must contain: # <number> <language> <keymap-filename> # # The <number> field is a 2-byte hex value where the first byte # represents the keyboard type and the second byte is the value of the # console's language variable. The values for the keyboard types are: # LK401 0 # PCXAL 1 # LK201 2 # LK421 3 # LK443/4 4 # LK411 5 # # Don't put any 8-bit characters in the language names or the # isspace() function used in parsing this may think they're spaces # causing the lines to be parsed incorrectly. # # If the <keymap-filename> field is blank, this has the special # meaning that no keymap_default link will be created, nor will any # existing keymap_default be modified. # # The keymap specified for the "fallback" lines is used for any # language value missing from the table for the corresponding # keyboard type. # 000 fallback us_lk401aa.keymap 030 Dansk danish_lk401ad_tw.keymap 032 Deutsch austrian_german_lk401ag.keymap 034 Deutsch(Schweiz) swiss_german_lk401al_tw.keymap 036 English(American) us_lk401aa.keymap 038 English(British/Irish) uk_lk401aa.keymap 03a Espanol spanish_lk401as_tw.keymap 03c Francais belgian_french_lk401ap_tw.keymap 03e Francais(Canadien) canadian_french_lk401ac_tw.keymap 040 Francais(SuisseRomande) swiss_french_lk401ak_tw.keymap 042 Italiano italian_lk401ai_tw.keymap 044 Nederlands dutch_us_lk401ah.keymap 046 Norsk norwegian_lk401an_tw.keymap 048 Portugues portuguese_lk401av.keymap 04a Suomi finnish_lk401af_tw.keymap 04c Svenska swedish_lk401am_tw.keymap 04e Vlaams flemish_lk401ab_tw.keymap
100 fallback us_pcxalka.keymap
130 Dansk danish_pcxalkd.keymap
132 Deutsch austrian_german_pcxalkg.keymap
. 14c Svenska swedish_pcxalma.keymap 14e Vlaams belgian_pcxalkb.keymap
200 fallback us_lk201re.keymap
230 Dansk danish_lk201ld_tw.keymap *
232 Deutsch austrian_german_lk201lg_tw.keymap *
. 24c Svenska swedish_lk201lm_tw.keymap * 24e Vlaams flemish_lk201lb_tw.keymap
300 fallback us_lk421aa.keymap 336 English(American) us_lk421aa.keymap 338 English(British/Irish) uk_lk421aa.keymap
400 fallback us_lk443aa.keymap
430 Dansk danish_lk444kd.keymap
432 Deutsch austrian_german_lk444kg.keymap
. 44c Svenska swedish_lk444ma.keymap
. 500 fallback us_lk411aa.keymap 530 Dansk danish_lk411ad.keymap 532 Deutsch austrian_german_lk411ag.keymap
. 54c Svenska swedish_lk411am.keymap 54e Vlaams belgian_lk411ab.keymap
At many stages the actions of xdm can be controlled through the use of its configuration file, which is in the X resource format. Some resources modify the behavior of xdm on all displays, while others modify its behavior on a single display. Where actions relate to a specific display, the display name is inserted into the resource name between ``DisplayManager'' and the final resource name segment.
For local displays, the resource name and class are as read from the Xservers file.
For remote displays, the resource name is what the network address of the display resolves to. See the removeDomain resource. The name must match exactly; xdm is not aware of all the network aliases that might reach a given display. If the name resolve fails, the address is used. The resource class is as sent by the display in the XDMCP Manage request.
Because the resource manager uses colons to separate the name of the
resource from its value and dots to separate resource name parts,
substitutes underscores for both dots and colons when generating
the resource name. For example,
is the name of the resource which defines the startup shell
file for the ``expo.x.org:0'' display.
This resource either specifies a file name full of server
entries, one per line (if the value starts with a slash), or a single server
entry. See the section
for the details.
This resource indicates the UDP port number which
uses to listen for incoming XDMCP requests. Unless you need
to debug the system, leave this with its default value of 177.
Error output is normally directed at the system console.
To redirect it, set this resource to a file name. A method to send these
should be developed for systems which
support it; however, the wide variety of interfaces precludes any system-independent
implementation. This file also contains any output directed to
files, so it will contain descriptions of problems in those scripts as well.
If the integer value of this resource is greater than zero,
reams of debugging information will be printed. It also disables daemon mode,
which would redirect the information into the bit-bucket, and allows non-root
users to run
xdm, which would normally not be useful.
attempts to make itself into
a daemon process unassociated with any terminal. This is accomplished by forking
and leaving the parent process to exit, then closing file descriptors and
releasing the controlling terminal. In some environments this is not desired
(in particular, when debugging). Setting this resource to ``false'' will
disable this feature.
The filename specified will be created to contain an ASCII
representation of the process-id of the main
also uses file locking on this file to attempt to eliminate
multiple daemons running on the same machine, which would cause quite a bit
This is the resource which controls whether
uses file locking to keep multiple display managers from running amok. On
System V, this uses the
library call, while on BSD
This names a directory in which
authorization files while initializing the session. The default value is
This boolean controls whether
the configuration, servers, access control and authentication keys files after
a session terminates and the files have changed. By default it is ``true.''
You can force
to reread these files by sending a SIGHUP
to the main process.
When computing the display name for XDMCP clients, the name
resolver will typically create a fully qualified host name for the terminal.
As this is sometimes confusing,
will remove the domain
name portion of the host name if it is the same as the domain name of the
local host when this variable is set. By default the value is ``true.''
XDM-AUTHENTICATION-1 style XDMCP authentication requires that
a private key be shared between
and the terminal.
This resource specifies the file containing those values. Each entry in the
file consists of a display name and the shared key.
To prevent unauthorized XDMCP service and to allow forwarding
of XDMCP IndirectQuery requests, this file contains a database of hostnames
which are either allowed direct access to this machine, or have a list of
hosts to which queries should be forwarded to. The format of this file is
described in the section
XDMCP ACCESS CONTROL.
A list of additional environment variables, separated by white
space, to pass on to the
This resource is the name of the loadable greeter library.
The greeter is the component that displays the login box, collects the username
and password from the user, and authenticates the user. The default value
for this resource is
which is the Motif login interface. The
library contains the Athena-style login interface.
A file to checksum to generate the seed of authorization keys.
This should be a file that changes frequently. The default is
Number of seconds to wait for display to respond after user
has selected a host from the chooser. If the display sends an XDMCP IndirectQuery
within this time, the request is forwarded to the chosen host. Otherwise,
it is assumed to be from a new session and the chooser is offered again. Default
This resource specifies the name of the file to be loaded
as the resource database onto the root window of
screen 0 of the display. The
program, the Login
will use the resources set in this
file. This resource data base is loaded just before the authentication procedure
is started, so it can control the appearance of the login window. See the
AUTHENTICATION WIDGET, which describes the various
resources that are appropriate to place in this file. There is no default
value for this resource, but
is the conventional name.
Specifies the program run to offer a host menu for Indirect
queries redirected to the special host name CHOOSER.
is the default. See the sections
XDMCP ACCESS CONTROL
This resource specifies the program used to load the resources.
This specifies a program which is run (as root) before offering
the Login window. This may be used to change the appearance of the screen
around the Login window or to put up other windows. For example, you may
want to run
here. By default, no program is run.
The conventional name for a file used here is
See the section
This resource specifies a program which is run (as root) after
the authentication process succeeds. By default, no program is run. The
conventional name for a file used here is
See the section
This resource specifies the session to be executed (not running
as root). By default,
is run. The
conventional name is
Xsession. See the section
This specifies a program which is run (as root) after the
session terminates. Again, by default no program is run. The conventional
TakeConsole. See the section
These numeric resources control the behavior of
when attempting to open intransigent servers. The
resource is the length of the pause
(in seconds) between successive attempts. The
resource is the number of attempts to make. The
resource is the amount of time to
wait while actually attempting the open (that is, the maximum time spent in
system call). The
resource is the number of times this entire process is done
before giving up on the server. After
attempts have been made, or if
seconds elapse in any particular attempt,
terminates and restarts the server, attempting to connect again.
This process is repeated
times, at which point the display is declared dead and disabled. Although
this behavior may seem arbitrary, it has been empirically developed and works
quite well on most systems. The default values are 5 for
openDelay, 5 for
and 4 for
To discover when remote displays disappear,
occasionally pings them, using an X connection and
time (in minutes) between each ping attempt,
specifies the maximum amount of time (in minutes)
to wait for the terminal to respond to the request. If the terminal does
not respond, the session is declared dead and terminated. By default, both
are set to 5 minutes. If you frequently use X terminals which can become
isolated from the managing host, you may wish to increase this value. The
only drawback is that sessions will continue to exist after the terminal has
been accidentally disabled.
will not ping local displays.
Although it would seem harmless, it is unpleasant when the workstation session
is terminated as a result of the server hanging for NFS service and not responding
to the ping.
This boolean resource specifies whether the X server should
be terminated when a session terminates (instead of resetting it). This option
can be used when the server tends to grow without bound over time, in order
to limit the amount of time the server is run. The default value is ``false.''
environment variable for the session to this value. It
should be a colon separated list of directories; see
for a full
description. ``:/bin:/usr/bin:/usr/X11R6/bin:/usr/ucb'' is a common setting.
The default value can be specified at build time in the X system configuration
file with DefaultUserPath.
environment variable for the startup and reset scripts to
the value of this resource. The default for this resource is specified at
build time by the DefaultSystemPath entry in the system configuration file;
``/etc:/bin:/usr/bin:/usr/X11R6/bin:/usr/ucb'' is a common choice. Note the
absence of ``.'' from this entry. This is a good practice to follow for root;
it avoids many common Trojan Horse system penetration schemes.
environment variable for the startup and reset scripts
to the value of this resource. It is
If the default session fails to execute,
will fall back to this program. This program is executed with no arguments,
but executes using the same environment variables as the session would have
had (see the section
SESSION PROGRAM). By default,
To improve security,
grabs the server
and keyboard while reading the login name and password. The
resource specifies if the server should be held for
the duration of the name/password reading. When ``false,'' the server is
ungrabbed after the keyboard grab succeeds, otherwise the server is grabbed
until just before the session begins. The default is ``false.'' The
resource specifies the maximum time
will wait for the grab to succeed. The grab may fail if some
other client has the server grabbed, or possibly if the network latencies
are very high. This resource has a default value of 3 seconds. You should
be cautious when raising it, as a user can be confused by a look-alike window
on the display. If the grab fails,
kills and restarts
the server (if possible) and the session.
is a boolean resource which controls whether
and uses authorization for the local server connections. If authorization
is a list of authorization
mechanisms to use, separated by white space. XDMCP connections dynamically
specify which authorization mechanisms are supported, so
is ignored in this case. By default,
is ``MIT-MAGIC-COOKIE-1,'' or, if XDM-AUTHORIZATION-1 is available,
This file is used to communicate the authorization data from
to the server, using the
line option. It should be kept in a directory which is not world-writable
as it could easily be removed, disabling the authorization mechanism in the
server. If this resource is not specified, unique file names are generated
and written into the directory specified by the
This resource specifies the number of the signal
sends to reset the server. See the section
THE SERVER. The default is 1 (SIGHUP).
This resource specifies number of the signal
sends to terminate the server. See the section
THE SERVER. The default is 15 (SIGTERM).
The original implementation of authorization in the sample
server reread the authorization file at server reset time, instead of when
checking the initial connection. Because
the authorization information just before connecting to the display, an old
server would not get up-to-date authorization information. This resource causes
to send SIGHUP to the server after setting up the file, causing
an additional server reset to occur, during which time the new authorization
information will be read. The default is ``false,'' which will work for all
is unable to write to the usual
user authorization file ($HOME/.Xauthority), it creates
a unique file name in this directory and points the environment variable
at the created file. It uses
This resource defines the default keymap that the local Xserver
uses and maps the value of the console's language variable to a keymap name.
This resource applies only to local displays.
This resource defines the value of the
environment variable. If this resource is defined, the
variable will be set for the
process controlling the display as well as for the user's X
First, the xdm configuration file should be set up. Make a directory (usually <XRoot>/lib/X11/xdm, where <XRoot> refers to the root of the X11 install tree) to contain all of the relevant files. In the examples that follow, we use /usr/X11R6 as the value of <XRoot>.
Here is a reasonable configuration file, which could be named xdm-config:
Note that this file mostly contains references to other files. Note
also that some of the resources are specified with ``*'' separating the components.
These resources can be made unique for each different display, by replacing
the ``*'' with the display-name, but normally this is not very useful. See
section for a complete discussion.
The database file specified by the DisplayManager.accessFile provides information that xdm uses to control access from displays requesting XDMCP service. This file contains three types of entries: entries which control the response to Direct and Broadcast queries, entries which control the response to Indirect queries, and macro definitions.
The format of the Direct entries is simple, either a host name or a pattern, which is distinguished from a host name by the inclusion of one or more meta characters (`*' matches any sequence of 0 or more characters, and `?' matches any single character) which are compared against the host name of the display device. If the entry is a host name, all comparisons are done using network addresses, so any name which converts to the correct network address may be used. For patterns, only canonical host names are used in the comparison, so ensure that you do not attempt to match aliases. Preceding either a host name or a pattern with a `!' character causes hosts which match that entry to be excluded.
An Indirect entry also contains a host name or pattern, but follows it with a list of host names or macros to which indirect queries should be sent.
A macro definition contains a macro name and a list of host names and other macros that the macro expands to. To distinguish macros from hostnames, macro names start with a `%' character. Macros can be nested.
Indirect entries can also specify to have xdm run chooser to offer a menu of hosts to connect to. See the section CHOOSER.
When xdm checks the access for a particular display host, each entry is scanned in turn and the first matching entry determines the response. Direct and Broadcast entries are ignored when scanning for an Indirect entry and vice-versa.
Blank lines are ignored, `#' is treated as a comment delimiter causing the rest of that line to be ignored, and `\newline' causes the newline to be ignored, allowing indirect host lists to span multiple lines.
Here is an example Xaccess file:
# # Xaccess - XDMCP access control file #
# # Direct/Broadcast query entries #
!xtra.lcs.mit.edu # disallow direct/broadcast service for xtra
bambi.ogi.edu # allow access from this particular display
*.lcs.mit.edu # allow access from any display in LCS
# # Indirect query entries #
%HOSTS expo.lcs.mit.edu xenon.lcs.mit.edu \
extract.lcs.mit.edu xenon.lcs.mit.edu #force extract to contact xenon
!xtra.lcs.mit.edu dummy #disallow indirect access
*.lcs.mit.edu %HOSTS #all others get to choose
For X terminals that do not offer a host menu for use with Broadcast or Indirect queries, the chooser program can do this for them. In the Xaccess file, specify ``CHOOSER'' as the first entry in the Indirect host list. Chooser will send a Query request to each of the remaining host names in the list and offer a menu of all the hosts that respond.
The list may consist of the word ``BROADCAST,'' in which case chooser will send a Broadcast instead, again offering a menu of all hosts that respond. Note that on some operating systems, UDP packets cannot be broadcast, so this feature will not work.
Example Xaccess file using chooser:
extract.lcs.mit.edu CHOOSER %HOSTS #offer a menu of these hosts
xtra.lcs.mit.edu CHOOSER BROADCAST #offer a menu of all hosts
The program to use for chooser is specified by the DisplayManager.DISPLAY.chooser resource. For more flexibility at this step, the chooser could be a shell script. Chooser is the session manager here; it is run instead of a child xdm to manage the display.
Resources for this program can be put into the file named by DisplayManager.DISPLAY.resources.
When the user selects a host,
host chosen, which is read by the parent
xdm, and exits.
closes its connection to the X server, and the server resets
and sends another
remembers the user's choice (for
seconds) and forwards the request
to the chosen host, which starts a session on that display.
The resource DisplayManager.servers gives a server specification or, if the values starts with a slash (/), the name of a file containing server specifications, one per line.
Each specification indicates a display which should constantly be managed and which is not using XDMCP. This method is used typically for local servers only. If the resource or the file named by the resource is empty, xdm will offer XDMCP service only.
Each specification consists of at least three parts: a display name, a display class, a display type, and (for local servers) a command line to start the server. A typical entry for local display number 0 would be:
:0 local /usr/bin/X11/X
The display types are:
local local display: xdm must run the server
foreign remote display: xdm opens an X connection to a running server
The display name must be something that can be passed in the -display option to an X program. This string is used to generate the display-specific resource names, so be careful to match the names (for example, use ``:0 Sun-CG3 local /usr/X11R6/bin/X :0'' instead of ``localhost:0 Sun-CG3 local /usr/X11R6/bin/X :0'' if your other resources are specified as ``DisplayManager._0.session''). The display class portion is also used in the display-specific resources, as the class of the resource. This feature is useful if you have a large collection of similar displays (such as a corral of X terminals) and would like to set resources for groups of them. When using XDMCP, the display is required to specify the display class. The manual for your particular X terminal should document the display class string for your device. If it does not, you can run xdm in debug mode and look at the resource strings that it generates for that device. One of these strings is the class string.
To use the Shared Memory Transport as the default transport for communication between the X server and local clients, specify the local display as local:0, in which case the entry in the Xservers file might read as follows:
local:0 local /usr/bin/X11/X
starts a session, it sets up authorization
data for the server. For local servers,
passes ``-auth filename'' on the server's command line to point
it at its authorization data. For XDMCP servers,
the authorization data to the server via the
This login widget is used when the greeter library, /usr/lib/X11/xdm/libXdmGreet.so, is specified as the value of the DisplayManager.greeterLib resource.
Note that you cannot use the Athena-style greeter if you have enabled enhanced security on your system. The Athena-style greeter does not use the necessary security mechanisms. See secsetup(8).
The authentication widget reads a name/password pair from the keyboard. Nearly every imaginable parameter can be controlled with a resource. Resources for this widget should be put into the file named by DisplayManager.DISPLAY.resources. All of these resources have reasonable default values, so it is not necessary to specify any of them. The geometry of the Login widget is normally computed automatically. If you wish to position it elsewhere, specify each of these resources. The color used to display the typed-in user name. The font used to display the typed-in user name. A string that identifies this window. The default is ``X Window System''. When X authorization is requested in the configuration file for this display and none is in use, this greeting replaces the standard greeting. The default is ``This is an unsecure session''. The font used to display the greeting. The color used to display the greeting. The string displayed to prompt for a user name. The xrdb utility strips trailing white space from resource values. To add spaces at the end of the prompt to make it more readable, add spaces escaped with backslashes. The default is ``Login: ''. The string displayed to prompt for a password. The default is ``Password: ''. The font used to display both prompts. The color used to display both prompts. A message that is displayed when the authentication fails. The default is ``Login incorrect''. The font used to display the failure message. The color used to display the failure message. The number of seconds that the failure message is displayed. The default is 30. This resource specifies the translations used for the login widget. Refer to the X Toolkit documentation for a complete discussion of translations. The default translation table is:
The actions which are supported by the widget are:
Erases the character before the cursor.
Erases the character after the cursor.
Moves the cursor backward.
Moves the cursor forward.
(Apologies about the spelling error.) Moves the cursor to
the beginning of the editable text.
Moves the cursor to the end of the editable text.
Erases all text after the cursor.
Erases the entire text.
If the cursor is in the name field, proceeds to the password
field. If the cursor is in the password field, checks the current name/password
pair. If the name/password pair is valid,
session. Otherwise, the failure message is displayed and the user is prompted
Terminates and restarts the server.
Terminates the server, disabling it. This is a rash action
and is not accessible in the default configuration. It can be used to stop
when you are shutting the system down or using
Resets the X server and starts a new session. This action
can be used when the resources have been changed and you want to test them
or when the screen has been overwritten with system messages.
Inserts the character typed.
Specifies a single word argument that is passed to the session
at startup. See the sections
Disables access control in the server. This action can be
used when the
file cannot be created by
xdm. Use this action with caution; you should probably disconnect
the machine from the network before using this action.
This login widget is used when the greeter library, /usr/lib/X11/xdm/libXdmDecGreet.so, is specified as the value of the DisplayManager.greeterLib resource.
The authentication widget reads a name/password pair from the keyboard.
Many parameters can be controlled with resources. Resources for this widget
should be put into the file named by
DisplayManager.DISPLAY.resources. All these resources have reasonable default values, so it is
not necessary to specify any of them.
The coordinates in pixels of the upper left corner of the
logo displayed on the login screen. A value of -1 for
causes an appropriate default to be
The foreground color of the logo displayed across the top
of the login screen. The default color is rgb:8182/0604/2c28.
The logo background color. The default is White.
The foreground color of the logo on monochrome systems. The
default is Black.
The logo background color on monochrome systems. The default
If set to True, the root window will be painted the specified
solid color and, when the login widget is destroyed, the root window will
be restored to its default pattern. The default value is True.
The root window color in the login screen. The default value
The name of the file containing a bitmap in X bitmap format
that is displayed in place of the default Digital logo.
The name of the file containing the shape mask bitmap to use
when displaying the logo.
The color of the text displayed in a message box on a failed
The greeting text displayed as a title in the login box.
The default value is "Tru64 UNIX on CLIENTHOST". 'CLIENTHOST' is a macro
replaces with the name of the
The greeting text displayed as a secondary (smaller) title
in the login box. The default value is "formerly \D\E\C OSF/1". 'DEC' must
be escaped or else the
treat it as a macro.
The color of the greeting text in the login box. The default
The color of the text of the prompt strings in the login box.
The default is Black.
The color of the response text in the login box. The default
The font used to display the greeting text in the login box.
The default is '*-new century schoolbook-bold-i-normal-*-240-*'.
The font used to display the strings in the login box. The
default is '*-new century schoolbook-medium-r-normal-*-180-*'.
The font used to display the response text in the login box.
The default is '*-new century schoolbook-medium-r-normal-*-180-*'.
The program named in the DisplayManager.DISPLAY.setup resource is run after the server is reset, but before the Login window is offered. The file is typically a shell script. It is run as root, so you should be careful about security. This is the place to change the root background or bring up other windows that should appear on the screen along with the Login widget.
In addition to any specified by DisplayManager.exportList, the following environment variables are passed: Sets the associated display name. Sets the value of DisplayManager.DISPLAY.systemPath. Sets the value of DisplayManager.DISPLAY.systemShell. May be set to an authority file.
Note that since
grabs the keyboard, any other
windows will not be able to receive keyboard input. However, they will be
able to interact with the mouse, so check for potential security holes here.
will not be able to connect to the display
at all. Resources for this program can be put into the file named by
The Xresources file is loaded onto the display as a resource database using xrdb. As the authentication widget reads this database before starting up, it usually contains parameters for that widget:
xlogin*login.translations: #override\ Ctrl<Key>R: abort-display()\n\ <Key>F1: set-session-argument(failsafe) finish-field()\n\ <Key>Return: set-session-argument() finish-field() xlogin*borderWidth: 3 xlogin*greeting: CLIENTHOST #ifdef COLOR xlogin*greetColor: CadetBlue xlogin*failColor: red #endif
Please note the translations entry; it specifies a few new translations for the widget which allow users to escape from the default session (and avoid troubles that may occur in it). Note that if #override is not specified, the default translations are removed and replaced by the new value, not a very useful result as some of the default translations are quite useful (such as ``<Key>: insert-char ()'' which responds to normal typing).
This file may also contain resources for the
The program specified by the DisplayManager.DISPLAY.startup resource is typically shell script. It is run as root and needs to be careful about security. This is the place to put commands that add entries to /etc/utmp (the sessreg program may be useful here), mount users' home directories from file servers, display the message of the day, or abort the session if logins are not allowed.
In addition to any specified by DisplayManager.exportList, the following environment variables are passed: Sets the associated display name. Sets the initial working directory of the user. Sets The user name. Sets the value of DisplayManager.DISPLAY.systemPath. Sets the value of DisplayManager.DISPLAY.systemShell. May be set to an authority file.
No arguments are passed to the script. xdm waits until this script exits before starting the user session. If the exit value of this script is non-zero, xdm discontinues the session and starts another authentication cycle.
The sample Xstartup file shown here prevents login while the file /etc/nologin exists. Thus this is not a complete example, but simply a demonstration of the available functionality.
Here is a sample Xstartup script:
# This program is run as root after the user is verified
if [ -f /etc/nologin ]; then
sessreg-a-l $DISPLAY-x /usr/X11R6/lib/xdm/Xservers $USER
The Xsession program (specified by the DisplayManager.DISPLAY.session resource) is the command that is run as the user's session. It is run with the permissions of the authorized user.
In addition to any specified by DisplayManager.exportList, the following environment variables are passed: Sets the associated display name. Sets the initial working directory of the user. Sets the user name. PATH sets the value of DisplayManager.DISPLAY.userPath. Sets the user's default shell (from getpwnam). XAUTHORITY may be set to a non-standard authority file. KRB5CCNAME may be set to a Kerberos credentials cache file.
At most installations, Xsession should look in $HOME for a file .xsession, which contains commands that each user would like to use as a session. Xsession should also implement a system default session if no user-specified session exists. See the section Typical Usage.
An argument may be passed to this program from the authentication widget using the `set-session-argument' action. This can be used to select different styles of session. One good use of this feature is to allow the user to escape from the ordinary session when it fails. This allows users to repair their own .xsession if it fails, without requiring administrative intervention. The example following demonstrates this feature.
This example recognizes the special ``failsafe'' mode, specified in the translations in the Xresources file, to provide an escape from the ordinary session. It also requires that the .xsession file be executable so we do not have to guess what shell it wants to use.
# This is the program that is run as the client
# for the display manager.
case $# in
case $1 in
exec xterm -geometry 80x24-0-0
if [ -f "$startup" ]; then
if [ -f "$resources" ]; then
xrdb -load "$resources"
xman -geometry +10-10 &
exec xterm -geometry 80x24+10+10 -ls
The user's .xsession file might look something like this example. Do not forget that the file must have execute permission.
# no -f in the previous line so .cshrc gets run to set $PATH
xrdb -merge "$HOME/.Xresources"
emacs -geometry +0+50 &
xbiff -geometry -430+5 &
xterm -geometry -0+50 -ls
Symmetrical with the startup program, the program specified by the DisplayManager.DISPLAY.startup resource is run after the user session has terminated. Run as root, it should contain commands that undo the effects of commands in Xstartup, removing entries from /etc/utmp or unmounting directories from file servers. The environment variables that were passed to the startup program are also passed to the program specified by the DisplayManager.DISPLAY.startup resource.
A sample Xreset script:
# This program is run as root after the session ends
sessreg-d-l $DISPLAY-x /usr/X11R6/lib/xdm/Xservers $USER
xdm controls local servers using POSIX signals. SIGHUP is expected to reset the server, closing all client connections and performing other cleanup duties. SIGTERM is expected to terminate the server. If these signals do not perform the expected actions, the resources DisplayManager.DISPLAY.resetSignal and DisplayManager.DISPLAY.termSignal can specify alternate signals.
To control remote terminals not using XDMCP,
searches the window hierarchy on the display and uses the protocol request
KillClient in an attempt to clean up the terminal for the next session. This
may not actually kill all of the clients, as only those which have created
windows will be noticed. XDMCP provides a more sure mechanism; when
closes its initial connection, the session is over and the terminal
is required to close all other connections.
xdm responds to two signals: SIGHUP and SIGTERM. When sent a SIGHUP, xdm rereads the configuration file, the access control file, and the servers file. For the servers file, it notices if entries have been added or removed. If a new entry has been added, xdm starts a session on the associated display. Entries which have been removed are disabled immediately, meaning that any session in progress will be terminated without notice and no new session will be started.
When sent a SIGTERM, xdm terminates all sessions in progress and exits. This can be used when shutting down the system.
attempts to mark its various sub-processes for
by editing the command line argument list in place. Because
cannot allocate additional space for this task, it is useful to
with a reasonably long command line (using the
full path name should be enough). Each process which is servicing a display
You can use xdm to run a single session at a time, using the 4.3 init options or other suitable daemon by specifying the server on the command line: xdm -server ":0 SUN-3/60CG4 local /usr/X11R6/bin/X :0"
Suppose you might have a file server and a collection of X terminals. The configuration for this is identical to the preceding example, except the Xservers file would be as follows:
extol:0 VISUAL-19 foreign exalt:0 NCD-19 foreign explode:0 NCR-TOWERVIEW3000 foreign
to manage sessions on all three
of these terminals. See the section
for a description of using signals to enable and disable these terminals in
a manner similar to
program does not coexist well with other
Default configuration file Default access file, listing authorized displays Default server file, listing non-XDMCP servers to manage User authorization file where xdm stores keys for clients to read Default chooser Motif loadable greeter Athena-style loadable greeter Default resource database loader Default server Default session program and failsafe client Default location for authorization files Kerberos credentials cache
<XRoot> refers to the root of the X11 install tree.
X Display Manager Control Protocol
Keith Packard, MIT X Consortium | s3://commoncrawl/crawl-data/CC-MAIN-2017-39/segments/1505818688158.27/warc/CC-MAIN-20170922022225-20170922042225-00163.warc.gz | CC-MAIN-2017-39 | 45,870 | 541 |
http://math.stackexchange.com/questions/155083/why-proof-by-induction-fails-for-goldbachs-conjecture/155108 | code | Can anyone clarify why induction method fails for this conjecture?
Let's prove the conjecture by induction.
Claim: For every even number $n≥4$, there exist primes $p$ and $q$ such that $p+q=n$.
Base case: $n=4$. Let $p=q=2$.
Induction step: Say that we know that the claim is true for every even number $k ≤ n$. We would like to prove that it is true for $n+2$ as well.
We have available for each even number $k≤n$ two primes, $p(k)$ and $q(k)$, with $p(k)+q(k) = k$. We need to find prime numbers $p$ and $q$ with $p+q = n+2$.
At this point I do not know how to proceed. Please help me out. How can I construct the desired $p$ and $q$ here?
Perhaps it can be done. But as far as I know nobody has yet thought of a way to do it. | s3://commoncrawl/crawl-data/CC-MAIN-2016-30/segments/1469257830091.67/warc/CC-MAIN-20160723071030-00191-ip-10-185-27-174.ec2.internal.warc.gz | CC-MAIN-2016-30 | 734 | 8 |
https://www.learn2crack.com/2016/09/android-automated-ui-testing-with-espresso.html | code | We are not going to create entire project from Scratch. We are using existing project and write UI testing code for it.
We are going to test 4 use cases on the Registration Screen.
- Check whether Registration is success.
- Check whether the system allows duplicate Registration.
- Check Registration with Invalid email id.
- Check Registration with empty fields. | s3://commoncrawl/crawl-data/CC-MAIN-2017-09/segments/1487501171664.76/warc/CC-MAIN-20170219104611-00318-ip-10-171-10-108.ec2.internal.warc.gz | CC-MAIN-2017-09 | 363 | 6 |
http://woc.brawlersavenue.net/sorr_metalslug.htm | code | Metal Slug SE is an SORMaker Mod designed by XRainmakerRSX in 2013.
Please note, if you do not use the original colours of this mod some effects of camouflage and thematic art of enemies will be distorted, scenarios such as Vehelits inside the wall in the alien stage for example.
Download Metal Slug SE (ZIP archive, 180MB)
1. Extract the 'SOR Metal Slug SE' folder from the zip file into your SORR 'mods/games' directory.
2. Go to your SORR 'palettes' directory, and rename the 'enemies' and 'chars' folders to something else, like 'enemiesbackup' and 'charsbackup' (unless you're happy to overwrite the original game data.
3. Move the contents of the 'palettes' folder from the Metal Slug SE directory into the main SORR 'palettes' directory.
4. You can start the game by selecting 'SORMAKER' on the main menu of Streets of Rage Remake, then choosing the appropriate mod from the list.
comments powered by Disqus | s3://commoncrawl/crawl-data/CC-MAIN-2018-09/segments/1518891813571.24/warc/CC-MAIN-20180221063956-20180221083956-00480.warc.gz | CC-MAIN-2018-09 | 915 | 8 |
http://soa.sys-con.com/node/2406423 | code | |By Andreas Grabner||
|October 20, 2012 11:15 AM EDT||
Thanks to the great guys who help our customers with their application performance problems we can share some of their stories in this article. We hope you - responsible for application performance in your own organization - can leverage these findings in order to prevent these common problem patterns we see out there in the real world.
I want to highlight some typical problems in web applications that can easily be identified through load testing and can lead to significant improvements in throughput and performance. In this case a 94% faster transaction performance was achieved and throughput could be tripled. It was all possible by fixing deployment problems on the Web Server. Here is story on how they did it!
Challenge: Is End User Response Time Unacceptable or Not? If So - Where Is the Problem?
Load tests are great. They tell you whether your application can handle the simulated load by staying within the acceptable response times for the tested transactions. When just looking at the average response time as measured on the web servers it will be hard to tell:
- Do we have a performance problem at all?
- How can we improve the performance?
Figure 1 shows a typical graph you get from a load testing tool or by analyzing your web server logs. The test that was executed simulated constant load after a short warm-up period. The results show that Average Transaction Response Time increased slightly over time with one outlier up to 3 seconds. The throughput of the system (Transaction Count) on the other side went slightly down. This can be expected when response time goes up. The question is - is this a problem? Is an average of 1.5s bad User Experience?
Figure 1: Declining Transaction Performance on both web servers also leads to less throughput
Do Not Trust Average Values: Focused analysis is required to identify problems!
One lesson that all of our customers have learned is that you do not want to analyze your performance by looking at the average execution time of all of your simulated transactions. This would give a wrong picture as certain transactions will always be fast because they are optimized where others are slow because there really is a problem. If you look at all of them at once - and then just at averages - it is very likely that you never find that you actually have a problem as it will hide behind the statistically calculated values.
Therefore you need to focus your analysis on individual transaction types that you test. Figure 2 shows a performance breakdown of the individual tested transactions. Figure 1 shows that certain transactions have a significant increase in response time where others only have a slight increase. On average the application is not performing too badly - but it is these individual transactions under load that are the real problem for the end users. Even worse if these are the transactions that are critical to your application:
Figure 2: Different transaction types perform differently. Looking at overall averages would not reveal these problems
The breakdown by tested transaction shows us that there are at least two transactions that showed spikes of up to 21s to execute. One of them is the Login transaction that is very critical to the application. Now it's time to focus our next analysis step on these transactions in order to get rid of the "statistical noise" of the other transactions that actually ran fine.
Look at the End-to-End View: It shows you where your problems are
The next step in the problem analysis is to look beyond the measured response time on the web server. Analyzing the full end-to-end view reveals which component in the infrastructure contributes the most to the overall performance. This allows you to attack the problem where it happens without trying to improve components that may actually work really well. Figure 3 shows the Transaction Flow Visualization of each individual request that was generated during the load test for the one transaction type we are focused on. Instead of just showing response as perceived by the end user (or virtual simulated user) it shows which component along the transaction execution contributed how much to the response time. It is easy to spot that this problem is not related to the 4 Java Application Server but can be found on the two load balanced Web Servers where 87% of the time is spent:
Figure 3: Analyzing the flow of the tested transaction reveals the component we need to focus our performance analysis on
Typical Problem Patterns on the Web Server
I recently wrote about the typical deployment problems that happen when moving an application from test to production: In the case of this blog it was a combination of misconfigured Web Server Settings (Max Connections and Misconfigured Modules). Other problems we typically see are oversized web pages leading to too much load on the web server to deliver that content.
Improvement: 3x Throughput and 94% Performance Gain
After fixing the problem the customer can now run about up to 30,000 transactions per Web Server instead of 10,000. The average response time also went down from ~1.19s to ~68ms. Not only is this great for the end-user experience but it also means that the existing hardware can be much better leveraged and supports many more users than originally anticipated. Figure 4 shows the final charts and transaction flow visualization of a test that was re-ran after all problems identified could be addressed:
Figure 4: Much Higher and Constant Throughput and Performance after fixing the identified performance problems
There Is More: Browser, CNDs, Network, Web Servers, Application Servers, Databases...
- Approaches to Testing Modern Web Applications
- Top 8 Performance Problems on Top 50 Retails Sites before Black Friday
- To Load Test or Not to Load Test: That is not the question
- How to manage performance of 1000+ JVMs
If you have your own stories that you want to share feel free to contact us.
SYS-CON Events announced today that the "Second Containers & Microservices Expo" will take place November 3-5, 2015, at the Santa Clara Convention Center in Santa Clara, CA. Containers and microservices have become topics of intense interest throughout the cloud developer and enterprise IT communities.
Aug. 4, 2015 05:30 PM EDT
The Software Defined Data Center (SDDC), which enables organizations to seamlessly run in a hybrid cloud model (public + private cloud), is here to stay. IDC estimates that the software-defined networking market will be valued at $3.7 billion by 2016. Security is a key component and benefit of the SDDC, and offers an opportunity to build security 'from the ground up' and weave it into the environment from day one. In his session at 16th Cloud Expo, Reuven Harrison, CTO and Co-Founder of Tufin,...
Aug. 4, 2015 03:00 PM EDT Reads: 573
Container technology is sending shock waves through the world of cloud computing. Heralded as the 'next big thing,' containers provide software owners a consistent way to package their software and dependencies while infrastructure operators benefit from a standard way to deploy and run them. Containers present new challenges for tracking usage due to their dynamic nature. They can also be deployed to bare metal, virtual machines and various cloud platforms. How do software owners track the usag...
Aug. 4, 2015 01:00 PM EDT Reads: 292
Our guest on the podcast this week is JP Morgenthal, Global Solutions Executive at CSC. We discuss the architecture of microservices and how to overcome the challenge of making different tools work together. We learn about the importance of hiring engineers who can compose services into an integrated system.
Aug. 4, 2015 12:45 PM EDT
Alibaba, the world’s largest ecommerce provider, has pumped over a $1 billion into its subsidiary, Aliya, a cloud services provider. This is perhaps one of the biggest moments in the global Cloud Wars that signals the entry of China into the main arena. Here is why this matters. The cloud industry worldwide is being propelled into fast growth by tremendous demand for cloud computing services. Cloud, which is highly scalable and offers low investment and high computational capabilities to end us...
Aug. 4, 2015 12:00 PM EDT Reads: 221
You often hear the two titles of "DevOps" and "Immutable Infrastructure" used independently. In his session at DevOps Summit, John Willis, Technical Evangelist for Docker, covered the union between the two topics and why this is important. He provided an overview of Immutable Infrastructure then showed how an Immutable Continuous Delivery pipeline can be applied as a best practice for "DevOps." He ended the session with some interesting case study examples.
Aug. 4, 2015 11:30 AM EDT Reads: 300
One of the ways to increase scalability of services – and applications – is to go “stateless.” The reasons for this are many, but in general by eliminating the mapping between a single client and a single app or service instance you eliminate the need for resources to manage state in the app (overhead) and improve the distributability (I can make up words if I want) of requests across a pool of instances. The latter occurs because sessions don’t need to hang out and consume resources that could ...
Aug. 4, 2015 11:00 AM EDT Reads: 284
Microservices has the potential of significantly impacting the way in which developers create applications. It's possible to create applications using microservices faster and more efficiently than other technologies that are currently available. The problem is that many people are suspicious of microservices because of all the technology claims to do. In addition, anytime you start moving things around in an organization, it means changing the status quo and people dislike change. Even so, micr...
Aug. 4, 2015 08:45 AM EDT
"We've just seen a huge influx of new partners coming into our ecosystem, and partners building unique offerings on top of our API set," explained Seth Bostock, Chief Executive Officer at IndependenceIT, in this SYS-CON.tv interview at 16th Cloud Expo, held June 9-11, 2015, at the Javits Center in New York City.
Aug. 3, 2015 11:00 PM EDT Reads: 705
SYS-CON Events announced today that HPM Networks will exhibit at the 17th International Cloud Expo®, which will take place on November 3–5, 2015, at the Santa Clara Convention Center in Santa Clara, CA. For 20 years, HPM Networks has been integrating technology solutions that solve complex business challenges. HPM Networks has designed solutions for both SMB and enterprise customers throughout the San Francisco Bay Area.
Aug. 3, 2015 06:45 PM EDT Reads: 551
Take the Long View with Digital Transformation By @IoT2040 | @ThingsExpo #IoT #M2M #API #Microservices #InternetOfThings
Digital Transformation is the ultimate goal of cloud computing and related initiatives. The phrase is certainly not a precise one, and as subject to hand-waving and distortion as any high-falutin' terminology in the world of information technology. Yet it is an excellent choice of words to describe what enterprise IT—and by extension, organizations in general—should be working to achieve. Digital Transformation means: handling all the data types being found and created in the organizat...
Aug. 2, 2015 06:00 PM EDT Reads: 1,145
Aug. 2, 2015 02:00 PM EDT Reads: 331
Approved this February by the Internet Engineering Task Force (IETF), HTTP/2 is the first major update to HTTP since 1999, when HTTP/1.1 was standardized. Designed with performance in mind, one of the biggest goals of HTTP/2 implementation is to decrease latency while maintaining a high-level compatibility with HTTP/1.1. Though not all testing activities will be impacted by the new protocol, it's important for testers to be aware of any changes moving forward.
Aug. 2, 2015 09:45 AM EDT Reads: 207
This week, I joined SOASTA as Senior Vice President of Performance Analytics. Given my background in cloud computing and distributed systems operations — you may have read my blogs on CNET or GigaOm — this may surprise you, but I want to explain why this is the perfect time to take on this opportunity with this team. In fact, that’s probably the best way to break this down. To explain why I’d leave the world of infrastructure and code for the world of data and analytics, let’s explore the timing...
Aug. 1, 2015 07:45 PM EDT Reads: 428
[slides] Storage for Docker Containers By @OnModulus | @DevOpsSummit #DevOps #Docker #Containers #Microservices
Learn how to solve the problem of keeping files in sync between multiple Docker containers. In his session at 16th Cloud Expo, Aaron Brongersma, Senior Infrastructure Engineer at Modulus, discussed using rsync, GlusterFS, EBS and Bit Torrent Sync. He broke down the tools that are needed to help create a seamless user experience. In the end, can we have an environment where we can easily move Docker containers, servers, and volumes without impacting our applications? He shared his results so yo...
Jul. 31, 2015 11:45 PM EDT Reads: 807
Modern DevOps Tool Kit By @Logentries and @NewRelic | @DevOpsSummit #DevOps #Containers #Microservices
Auto-scaling environments, micro-service architectures and globally-distributed teams are just three common examples of why organizations today need automation and interoperability more than ever. But is interoperability something we simply start doing, or does it require a reexamination of our processes? And can we really improve our processes without first making interoperability a requirement for how we choose our tools?
Jul. 31, 2015 11:15 PM EDT Reads: 434
Cloud Migration Management (CMM) refers to the best practices for planning and managing migration of IT systems from a legacy platform to a Cloud Provider through a combination professional services consulting and software tools. A Cloud migration project can be a relatively simple exercise, where applications are migrated ‘as is’, to gain benefits such as elastic capacity and utility pricing, but without making any changes to the application architecture, software development methods or busine...
Jul. 31, 2015 10:00 PM EDT Reads: 1,362
The Internet of Things. Cloud. Big Data. Real-Time Analytics. To those who do not quite understand what these phrases mean (and let’s be honest, that’s likely to be a large portion of the world), words like “IoT” and “Big Data” are just buzzwords. The truth is, the Internet of Things encompasses much more than jargon and predictions of connected devices. According to Parker Trewin, Senior Director of Content and Communications of Aria Systems, “IoT is big news because it ups the ante: Reach out ...
Jul. 31, 2015 07:00 AM EDT Reads: 429
Where the Network Got Invited to the Party By @LMacVittie | @DevOpsSummit #DevOps #Docker #Containers #Microservices
At DevOps Summit NY there’s been a whole lot of talk about not just DevOps, but containers, IoT, and microservices. Sessions focused not just on the cultural shift needed to grow at scale with a DevOps approach, but also made sure to include the network ”plumbing” needed to ensure success as applications decompose into the microservice architectures enabling rapid growth and support for the Internet of (Every)Things.
Jul. 30, 2015 08:15 PM EDT Reads: 1,785
Designing the IT Architecture of the Future with Adrian Cockcroft | @DevOpsSummit #DevOps #Docker #Containers #Microservices
Our guest on the podcast this week is Adrian Cockcroft, Technology Fellow at Battery Ventures. We discuss what makes Docker and Netflix highly successful, especially through their use of well-designed IT architecture and DevOps.
Jul. 30, 2015 08:00 PM EDT Reads: 804 | s3://commoncrawl/crawl-data/CC-MAIN-2015-32/segments/1438042992543.60/warc/CC-MAIN-20150728002312-00101-ip-10-236-191-2.ec2.internal.warc.gz | CC-MAIN-2015-32 | 15,743 | 73 |
http://dontcodetired.com/blog/?tag=tdd | code | To compliment the release of my Testing .NET Code with xUnit.net 2 Pluralsight course, I’ve updated my original xUnit.net cheat sheet.
(To download just right-click, save-as)
xUnit.net allows the creation of data-driven tests. These kind of tests get their test data from outside the test method code via parameters added to the test method signature.
Say we had to test a Calculator class and check it’s add method returned the correct results for six different test cases. Without data-driven tests we’d either have to write six separates tests (with almost identical code) or some loop inside our test method containing an assert.
Regular xUnit.net test methods are identified by applying the [Fact] attribute. Data-driven tests instead use the [Theory] attribute.
To get data-driven features and the [Theory] attribute, install the xUnit.net Extensions NuGet package in addition to the standard xUnit.net package.
Creating Inline Data-Driven Tests
The [InlineData] attribute allows us to specify test data that gets passed to the parameters of test method.
So for our Calculator add test we’d start by defining the test method:
To help people get started with xUnit.net and as an accompaniment to my Pluralsight xUnit.net training course I thought I’d create a cheat sheet showing common assert methods and attributes. Hopefully will be of use :)
My latest Pluralsight course on the xUnit.net testing framework has just been released.
Learn the latest in unit testing technology for C#, VB.NET (and other .NET languages) created by the original inventor of NUnit.
xUnit.net is a free, extensible, open source framework designed for programmers that aligns more closely with the .NET platform.
You can check it out now on Pluralsight.com.
My newest Pluralsight course has just been published.
We shouldn't live in fear of our code
Long-term customer satisfaction, agility, and developer happiness are crucial. A quality suite of automated tests helps achieve this. This practical course covers how and what to test at the unit, integration, and functional UI levels; and how to bring them all together with TeamCity continuous integration build server.
The course helps to keep your software soft with the right automated tests at the right level.
If you’ve never used Pluralsight before you can sign up for the free trial and get started.
Just knocked up this quick and dirty video explaining how to set up MoqaLate in a Windows Store app solution.
You can find out more about MoqaLate on the MoqaLate project home page.
With Windows Store apps there are challenges getting traditional mocking frameworks such as Rhino and Moq working due to limited reflection support in the platform (presumably for security reasons).
I wrote a mocking solution when Windows Phone 7 first came out, it can also be used for Windows Store apps. I’ve updated the NuGet descriptions etc. to reflect this.
How To Do TDD with Mocking in Windows Store Apps
Create a new (C#/XAML) Windows Store app project in Visual Studio called “MyAwesomeApp”.
Create your test project “MyAwesomeApp.Tests” and reference your main app.
In the main app project, install the MoqaLate NuGet package. When the package is installed you will have a new folder in the main app solution called “MoqaLateCommandLine”:
(Inside this folder is a readmexxx.txt file with some additional info)
Whilst I love developing apps for Windows Phone 7, the testing aspect is hard! I'm a TDD-er by default and it's such a pain to have to hand roll my own mock objects.
So I created MoqaLate.
It's an alpha version but is usable now.
Not sure framework is the right term but it's something that generates mocks from your interfaces.
Add to existing project from NuGet:
PM> Install-Package MoqaLate
Read more about the project.
Download an example solution.
Read (currently very basic!) documentation.
View on NuGet.org
Awesome overview diagram :)
One thing that can quickly become messy when writing unit tests is the creation of test objects. If the test object is a simple int, string, etc then it's not as much of a problem as when you a list or object graph you need to create.
Even using object initializers you can end up taking a lot of lines of indented code, and gets in the way of the tests.
One solution is to use a 'builder' class which will construct the object for you.
For example, rather than lots of initializer code you could write:
_sampleData = new HistoryBuilder()
.WithTimer(false, 1, 1, new DateTime(2000, 1, 1))
.WithTimer(false, 1, 1, new DateTime(2000, 1, 1))
.WithTimer(true, 1, 1, new DateTime(2000, 1, 1))
You can multiple overloads of WithTimer (for example one which create adds a default Timer).
Implementation of HistoryBuilder:
public class HistoryBuilder
private readonly History _history;
_history = new History();
public HistoryBuilder WithTimer()
public HistoryBuilder WithTimer(bool completed, int internalInteruptions, int externalInteruptions,
Completed = completed,
InternalInteruptionsCount = internalInteruptions,
ExternalInteruptionsCount = externalInteruptions,
StartedTime = time
public History Build() | s3://commoncrawl/crawl-data/CC-MAIN-2021-10/segments/1614178372367.74/warc/CC-MAIN-20210305122143-20210305152143-00272.warc.gz | CC-MAIN-2021-10 | 5,118 | 59 |
https://ebookee.org/Dave-Thomas-Agile-Web-Development-with-Rails_1724437.html | code | Author: Dave Thomas, David Hansson, Leon Breedt, Mike Clark, James Duncan Davidson, Justin Gehtland, Andreas Schwarz
Publisher: Pragmatic Bookshelf
Posted on 2012-01-26, by LionFar.
|Title:Dave Thomas, "Agile Web Development with Rails"
Author:Dave Thomas, David Hansson, Leon Breedt, Mike Clark, James Duncan Davidson, Justin Gehtland, Andreas Schwarz
|Description:The definitive, Jolt-award winning guide to learning and using Rails is now in its Second Edition. Rails is a new approach to web-based application development that enables developers to create full-featured, sophisticated web-based applications using less code and less effort. Now programmers can get the job done right and still leave work on time.
NEW IN THE SECOND EDITION: The book has been updated to take advantage of all the new Rails 1.2 features. The sample application uses migrations, Ajax, features a REST interface, and illustrates new Rails features. There are new chapters on migrations, active support, active record, and action controller (including the new resources-based routing). The Web 2.0 and Deployment chapters have been completely rewritten to reflect the latest thinking. Now you can learn which environments are best for your style application, and see how Capistrano makes managing your site simple. All the remaining chapters have been extensively updated. Finally, hundreds of comments from readers of the first edition have been incorporated, making this book simply the best available.
Rails is a full-stack, open source web framework that enables you to create full-featured, sophisticated web-based applications with a twist...you can create a full Rails application using less code than the setup XML you'd need just to configure some other frameworks.
You'll see how easy it is to deploy Rails. You'll be writing applications that work with your favorite database (MySQL, Oracle, Postgres, and more) in no time at all.
Download Dave Thomas, "Agile Web Development with Rails"
Download from DEPOSITFILES
Download from FILEPOST
- Ebooks list page : 17245
- 2013-12-02Agile Web Development with Rails, 3rd Edition - eazydoc.com
- 2012-08-07Agile Web Development with Rails, Third Edition
- 2012-08-07Agile Web Development with Rails (Pragmatic Programmers) - Removed
- 2011-12-13David Heinemeier Hansson, "Agile Web Development with Rails"
- 2011-07-16Agile Web Development with Rails, Fourth Edition
- 2011-05-30Agile Web Development with Rails: A Pragmatic Guide (Pragmatic Programmers) - Removed
- 2011-05-22Agile Web Development with Rails, 4th Edition
- 2011-05-10Agile Web Development with Rails, Third Edition,Digital Beta
- 2010-11-25Agile Web Development with Rails,Fourth Edition
- 2009-06-20Agile Web Development with Rails A Pragmatic Guide
- 2012-01-26Dave Thomas, "Agile Web Development with Rails"(Repost)
- 2011-01-10am Ruby, Dave Thomas, David Heinemeier Hansson, "Agile Web Development with Rails"
- 2010-11-22Sam Ruby, Dave Thomas, David Heinemeier Hansson "Agile Web Development with Rails Fourth Edition"
- 2019-07-10Agile Web Development with Rails 5
- 2018-10-14Agile Web Development with Rails 3.2
- 2018-09-20Agile Web Development with Rails 5.1
- 2018-07-31Agile Web Development with Rails 5.1
- 2018-07-08Agile Web Development with Rails 5.1
- 2018-06-15Agile Web Development with Rails 5.1
- Download links and password may be in the description section, read description carefully!
- Do a search to find mirrors if no download links or dead links. | s3://commoncrawl/crawl-data/CC-MAIN-2019-35/segments/1566027315132.71/warc/CC-MAIN-20190819221806-20190820003806-00479.warc.gz | CC-MAIN-2019-35 | 3,479 | 34 |
https://deepai.org/publication/how-to-secure-matchings-against-edge-failures | code | An augmentation problem asks for a minimum-cost set of edges to be added to a graph in order to establish a certain property. We say that a bipartite graph is robust if it admits a perfect matching after the removal of any edge. Our goal is to make a bipartite graph robust at minimal cost and we study the complexity of the corresponding augmentation problem. We refer to this problem informally as robust matching augmentation. As a motivation, note that in many situations some kind of infrastructure is already available, so we may prefer upgrading it instead of designing robust infrastructure from scratch. Assume we have some assignment-type application, such as staff or task scheduling, so our infrastructure is given in terms of a bipartite graph. The application requires that we choose a perfect matching that assigns, say, tasks to machines. By buying additional edges, we would like to ensure that no matter which edge fails, the resulting graph has a perfect matching, i.e., the infrastructure remains useable. In such an application, buying edges may correspond for example to training staff or upgrading machines.
A complementary approach to creating robust infrastructure is captured by design problems. A design problem asks for a minimum-cost subgraph with a certain property, for instance a minimum-cost -edge-connected subgraph [11, 21]. Robust matching augmentation can be stated also as a design problem, where the given infrastructure is available at zero cost and the host graph is a complete bipartite graph. In fact, our problem is a special case of the bulk-robust assignment problem, a design problem introduced in . Bulk-robustness is a redundancy-based robustness concept proposed by Adjiashvili, Stiller and Zenklusen , which allows to specify a list of failure scenarios. The bulk-robust assignment problem is known to be -hard even if only one of two fixed edges may fail . Here we consider the setting that any single edge may fail.
A central theme in our algorithmic results is the occurrence of the classical strong connectivity augmentation problem, which asks for the minimal number of arcs that are needed to make a given digraph strongly connected. It was shown by Eswaran and Tarjan that this problem admits a polynomial-time algorithm, but its edge-weighted variant is -hard . We show that also for robust matching augmentation the weighted problem is much harder than its cardinality version. To this end, we give a -factor approximation algorithm for the cardinality version which is essentially tight and prove that the weighted problem admits no -factor approximation under standard complexity assumptions.
Recall that we call a graph robust if it admits a perfect matching after the removal of any single edge. For a bipartite graph , we denote by the edge-set of its bipartite complement. We provide algorithms and hardness results for several restrictions of the following problem.
Robust Matching Augmentation
instance: Undirected bipartite graph that admits a perfect matching.
task: Find a set of minimum cardinality, such that the graph is robust.
By a close relation of robust matching augmentation and connectivity augmentation, we provide a deterministic -factor approximation for Robust Matching Augmentation, as well as a fixed parameter tractable (FPT) algorithm for the same problem parameterized by the treewidth of the input graph. We also give a polynomial-time algorithm for instances on chordal-bipartite graphs, which are bipartite graphs without induced cycles of length at least six. Furthermore, we show that Robust Matching Augmentation admits no polynomial-time sublogarithmic-factor approximation algorithm unless , so our approximation guarantee is essentially tight.
Let us give an overview of the high-level ideas behind our algorithmic results and make some connections to other problems. We first show that we may restrict our attention to an arbitrary fixed perfect matching of the input graph. That is, it suffices to prevent the adversary from destroying a given fixed matching. From the input graph and the perfect matching we construct an auxiliary digraph. In this digraph we select certain sources and sinks which we connect using the Eswaran-Tarjan algorithm to obtain a strongly connected subgraph. It turns out that strong connectivity in the auxiliary digraph implies robustness in the original graph. We obtain an optimal solution to our Robust Matching Augmentation instance if the selection of sources and sinks was optimal.
We model the task of properly selecting sources and sinks as a variant of the Set Cover problem with some additional structure. Given an acyclic digraph, the task is to select a minimum-cardinality subset of the sources, such that each sink is reachable from at least one of the selected sources. We refer to this problem as Source Cover and remark that its complexity may be of independent interest, since it generalizes Set Cover but is a special case of Directed Steiner Tree. We give an FPT algorithm for the Source Cover problem parameterized by the treewidth of the input graph (ignoring orientations). This FPT algorithm is single exponential in the treewidth. As a by-product, we obtain FPT algorithms for the node-weighted and arc-weighted versions of the Directed Steiner Tree problem on acyclic digraphs, which are exponential in the treewidth and linear in the number of nodes of the input graph.
Finally, we relax the requirement of having a perfect matching to having a matching of cardinality at least . In fact, all of our algorithmic results for Robust Matching Augmentation generalize to the setting where we desire to have a matching of cardinality after deleting any single edge from a graph.
We refer by Weighted Robust Matching Augmentation to the generalization of Robust Matching Augmentation, where each edge has a non-negative cost . The task is to find a minimum-cost set , such that is robust. First, we show that the approximability of Weighted Robust Matching Augmentation is closely linked to that of Directed Steiner Forest. In particular we show that an -factor approximation algorithm for Weighted Robust Matching Augmentation implies an -factor approximation algorithm for Directed Steiner Forest, where is the number of terminal pairs. By a result of Halperin and Krauthgamer it follows that there is no -factor approximation for Weighted Robust Matching Augmentation, unless . On the positive side, we show that an -factor approximation for the Directed Steiner Forest problem yields an -factor approximation Weighted Robust Matching Augmentation. Hence, the algorithms from [9, 17] give an approximation guarantee of for Weighted Robust Matching Augmentation, for every .
Second, we prove a complexity dichotomy based on graph minors. Let be a class of connected graphs closed under connected minors. We show that Weighted Robust Matching Augmentation restricted to input graphs from is -complete if contains at least one of two simple graph classes, which will be defined in Section 5, and admits a polynomial-time algorithm otherwise. The polynomial-time algorithm for the remaining instance classes uses a reduction to the Directed Steiner Forest problem with a constant number of terminal pairs, which in turn admits a (slice-wise) polynomial-time algorithm due to a result by Feldman and Ruhl . The terminal pairs of the instance are computed by the Eswaran-Tarjan algorithm.
Adjiashvili, Bindewald and Michaels in proposed an LP-based randomized algorithm for the bulk-robust assignment problem. They claim an -factor approximation guarantee for their algorithm. Since the robust assignment problem generalizes Weighted Robust Matching Augmentation, an -factor approximation for our problem is implied. However, due to our inapproximability result for Weighted Robust Matching Augmentation, this can not be true, unless . The authors of agree that their analysis is incorrect.
A connectivity augmentation problem related to strong connectivity, but of a different flavor, is the tree augmentation problem (TAP). The TAP asks for a minimum-cost edge-set that increases the edge-connectivity of a given tree from one to two. In contrast to robust matching augmentation, the TAP admits a constant-factor approximation . The constant has recently been lowered to for bounded-weight instances [1, 18]. Similar to robust matching augmentation, the input graph is available at zero cost. Let us briefly remark that there is more conceptual similarity. The matching preclusion number of a graph is the minimal number of edges to be removed, such that the remaining graph has no perfect matching. Robust matching augmentation can be stated as the task of finding a minimum-cost edge-set that increases the matching preclusion number of a bipartite graph from one to two, while the TAP aims to increase connectivity from one to two. The matching preclusion number is considered to be a measure of robustness of interconnect networks [8, 10]. Determining the matching preclusion number of a graph is -hard [14, 24].
Robust perfect matchings with a given recovery budget were studied by Dourado et al. in . Our notion of robustness corresponds to 1-robust -recoverable in their terminology. They provide hardness results and structural insights mainly for fixed recovery budgets, which bound the number of edges that can be changed in order to repair a matching, after a certain number of edges has been removed from the graph.
Undirected and directed graphs considered here are simple. For sets , , we denote by their disjoint union. For an undirected bipartite graph with bipartition , we denote by the edge-set of its bipartite complement. Let be a directed graph. We refer by to the arcs not present in . That is, we let . By we refer to the underlying undirected graph of . For , we write for the graph . Simple paths in graphs are given by a sequence of vertices. For graphs we write if is a subgraph of . Recall that a graph is an induced minor of a graph if it arises from by a sequence of vertex deletions and edge contractions. Similarly, the graph is a minor of if we additionally allow edge deletion. Furthermore, the graph is a connected minor of if is connected and a minor of . In general, contractions may result in parallel edges or loops, which we simply discard in order to keep our graphs simple. Let be a class of graphs. We will refer to the restriction of (Weighted) Robust Matching Augmentation to instances where the graph is bipartite, admits a perfect matching, and belongs to the class as (Weighted) Robust Matching Augmentation on . Given a set of items and sets , the Set Cover problems asks for a minimum-cardinality subset , such that each is contained in some . The incidence graph of a Set Cover instance is an undirected bipartite graph on the vertex set that has an edge if and only if the item is contained in the set .
Organization of the Paper
The remainder of the paper is organized as follows. We illustrate the relation between robust matching augmentation and strong connectivity augmentation in Section 2. Algorithms for the Source Cover problem are given in Section 3. Based on the results from Sections 2 and 3, we present our results on robust matching augmentation with unit costs in Section 4. In Section 5 we give the complexity classification for the weighted version of the problem and Section 6 concludes the paper.
2 Robust Matchings and Strong Connectivity Augmentation
In this section we give some preliminary observations on the close relationship between robust matching augmentation with unit costs and strong connectivity augmentation. For this purpose, we fix an arbitrary perfect matching and construct an auxiliary digraph that is somewhat similar to the alternating tree used in Edmond’s blossom algorithm. We show that the original graph is robust if the auxiliary graph is strongly connected (but not vice versa). Furthermore, we show that there is an optimal edge-set making the given graph robust, that corresponds to a set of arcs connecting sources and sinks in the auxiliary digraph. Finally, if no source or sink of the auxiliary digraph corresponds to a non-trivial robust part of the original graph, then we may use the algorithm for strong connectivity augmentation by Eswaran and Tarjan to make the original graph robust. As a consequence, we have that Robust Matching Augmentation on trees can be solved efficiently by using the Eswaran-Tarjan algorithm. In Section 4, we will generalize this result.
Let be a bipartite graph that admits a perfect matching and let be an arbitrary but fixed perfect matching of . We call an edge critical if admits no perfect matching. Observe that an edge is critical if and only if it is not contained in an -alternating cycle. Furthermore, no edge in is critical. Since is perfect, each edge is incident to a unique vertex of . We consider the following auxiliary digraph , whose arc-set is given by
We first note that the choice of the bipartion of is irrelevant.
Let , where is a bipartition of . Then is isomorphic to .
Note that we may perform the reverse construction as well. That is, from any digraph we may obtain a corresponding undirected graph and a perfect matching of such that . In fact, augmenting edges to is equivalent to augmenting arcs to .
Let be the set of arcs that are not present in . Then there is a 1-to-1 correspondence between and .
An example of the correspondence mentioned in Fact 2 is shown in Figure 1. In order to keep our notation tidy, we will make implicit use of Fact 2 and refer to and interchangeably. Observe that for edges there is an -alternating path containing and in if and only if is connected to in . This implies the following characterization of robustness.
is robust if and only if each strongly connected component of is non-trivial, that is, it contains at least two vertices.
Let be a digraph. A vertex of is called a source (sink) if it has no incoming (outgoing) arc. We refer to the set of sources (sinks) of by (). Furthermore, we denote by the condensation of , that is, the directed acyclic graph of strongly connected components of . We call a source or sink of strong if the corresponding strongly connected component of is non-trivial. From Fact 3 it follows that a subgraph of that corresponds to a strong source or a strong sink is robust against the failure of a single edge. Furthermore, observe that the choice of the perfect matching of is irrelevant in the following sense.
Let and be perfect matchings of . Then is isomorphic to .
Fact 4 is of key importance for our algorithmic results, for which we generally assume that some fixed perfect matching is given. Next, we observe that for unit costs we may restrict our attention to connecting sources and sinks of in order to make robust. It is easy to check that this does not hold for general non-negative costs.
Let such that is robust. Then there is some of cardinality at most , such that is robust and connects only sinks to sources of .
We remark that the construction of given in the proof of Fact 5 can be performed in polynomial time.
We denote by the minimal number of arcs to be added to a digraph in order to make it strongly connected. Eswaran an Tarjan have proved the following min-max relation .
Let be a digraph. Then .
From the proof of Fact 6 it is easy to obtain a polynomial-time algorithm that, given a digraph , computes an arc-set of cardinality such that is strongly connected . We will refer to this algorithm by Eswaran-Tarjan. The following proposition illustrates the usefulness of the algorithm Eswaran-Tarjan for Robust Matching Augmentation, and at the same time its limitations.
Suppose that contains no strong sources or sinks. Then Eswaran-Tarjan computes a set of minimum cardinality such that is robust.
Fact 7 implies that Eswaran-Tarjan solves Robust Matching Augmentation on trees. If strong sources or sinks are present in , then we may or may not need to consider them in order to make robust. This is precisely what makes the problem Robust Matching Augmentation hard. We will formalize the task of selecting strong sources and sinks in terms of the Source Cover problem, which is discussed in the next section.
3 The Source Cover Problem
To present our algorithmic results in Section 4 in a concise fashion it will be convenient to introduce the Source Cover problem. Given an acyclic digraph, the Source Cover problem asks for a minimum-cardinality subset of its sources, such that each sink is reachable from at least one selected source. It is easy to see that Source Cover is a special case of the Directed Steiner Tree problem and that it generalizes Set Cover. We give a simple polynomial-time algorithm for Source Cover if the input graph is chordal-bipartite (ignoring orientations). Furthermore, we show that Source Cover parameterized by treewidth (again ignoring orientations) is FPT. As a by-product, we obtain a simple FPT algorithm for the arc-weighted and node-weighted versions of the Directed Steiner Tree problem on acyclic digraphs, whose running time is linear in the size of the input graph and exponential in the treewidth of the underlying undirected graph. To the best of our knowledge, the parameterized complexity of the general Directed Steiner Tree problem with respect to treewidth is open. For the corresponding undirected Steiner Tree problem, an FPT algorithm was given by Bodlaender et al. in .
The Source Cover problem is formally defined as follows.
instance: Weakly connected acyclic digraph with at least one arc.
task: Find a minimum-cardinality subset of the sources of , such that for each sink there is an --path in .
The assumptions that is connected and contains at least one arc are present only for technical reasons. By “flattening” the input digraph, we can turn an instance of Source Cover into a Set Cover instance as follows. Let be an acyclic digraph, where is given by
Then is the incidence graph of a Set Cover instance on , such that the feasible solutions of I and are in 1-to-1 correspondence.
As illustrated in Figure 2, useful properties of the input digraph may not be present in the corresponding flattened digraph. In particular, if has treewidth at most , then the treewidth of cannot be bounded by a constant in general. Furthermore, the graph is not necessarily balanced111A graph is called balanced if the length of each induced cycle is divisible by four. (or planar) if is. Therefore, we cannot take advantage of polynomial-time algorithms for Set Cover on balanced incidence graphs or incidence graphs of bounded treewidth. Motivated by the example in Figure 1(b) we leave as an open question, whether Source Cover on balanced graphs admit polynomial-time algorithms. By Theorem 11, the existence of such an algorithm implies a polynomial-time algorithm for Robust Matching Augmentation on balanced graphs.
3.1 Source Cover on Chordal Bipartite Graphs
We show that in contrast to the treewidth and balancedness, chordal-bipartiteness is indeed preserved by the flattening operation introduced above. From this we obtain the following result.
Source Cover on chordal-bipartite graphs admits a polynomial-time algorithm.
To prove the theorem, we show that if is chordal-bipartite, so is . The graph is the incidence graph of a Set Cover instance, whose optimal solutions correspond canonically to the optimal solutions of the Source Cover instance . It is known that Set Cover on chordal-bipartite incidence graphs (and more generally, balanced graphs) admits a polynomial-time algorithm: It is possible to use LP-methods and the fact that covering polyhedra of balanced matrices are integral, see [25, pp. 562-573]. Alternatively we can use a combinatorial algorithm by Hoffman et al. .
3.2 Source Cover on Graphs of Bounded Treewidth
We provide a fixed-parameter algorithm for Node Weighted Directed Steiner Tree on acyclic digraphs that is single-exponential in the treewidth of the underlying undirected graph and linear in the instance size. Since Source Cover is a restriction of Node Weighted Directed Steiner Tree on acyclic graphs, we have a polynomial-time algorithm for Source Cover parameterized by the treewidth of the underlying undirected graph. Let us first recall some definitions related to Steiner problems and tree decompositions.
Node Weighted Directed Steiner Tree
instance: Acyclic digraph , costs , terminals , root .
task: Find a minimum-cost subset , such that is connected to each terminal in .
Arc Weighted Directed Steiner Tree is the corresponding problem, where the costs are on the arcs of the graph. A tree decomposition of a graph is a tree as follows. Each node of has a bag of vertices of such that the following properties hold.
If and both contain a vertex , then the bags of all nodes of in the path between and contain as well. Equivalently, the tree nodes containing vertex form a connected subtree of .
For each edge in there is some bag that contains both and . That is, for vertices adjacent in , the corresponding subtrees have a node in common.
The width of a tree decomposition is the size of its largest bag minus one. The treewidth of is the minimum width among all possible tree decompositions of .
To solve the Node Weighted Directed Steiner Tree on acyclic digraphs, we use a simple dynamic-programming algorithm over the tree decomposition of the underlying undirected graph of the input digraph with vertices.
Node Weighted Directed Steiner Tree on acyclic digraphs can be solved in time if a tree decomposition of of width is provided.
Note that an optimal tree-decomposition of a graph can be computed in time by Bodlaender’s famous theorem . Our algorithm intuitively works in the following way and is similar to the dynamic programming algorithm for Dominating Set (see, e.g., [12, Section 7.3.2]). We interpret a solution to Node Weighted Directed Steiner Tree as follows: each vertex of may be active or not. Each active vertex needs a predecessor that is also active, unless it is the root. The cost to activate a vertex is given by the cost function of the Node Weighted Directed Steiner Tree instance. Starting with all terminals active, it is easy to see that Node Weighted Directed Steiner Tree on acyclic graphs is equivalent to the problem of finding a minimum cost active vertex set satisfying the above conditions. We compute an optimal solution in a bottom-up fashion using a so-called nice tree decomposition of the input graph.
By a simple reduction, we also obtain an -time algorithm for Arc Weighted Directed Steiner Tree on acyclic digraphs. We just subdivide each arc and assign the cost of the arc to the corresponding new vertex. Each old vertex receives cost zero. This transformation does not increase the treewidth.
Furthermore, we can reduce Source Cover to Node Weighted Directed Steiner Tree by adding a new vertex and connecting to each source by an arc. The sources have cost one, while all other vertices have cost zero. The root vertex is and the set of terminals is the set of sinks. By adding only one new vertex, the treewidth is increased by at most one. As a consequence of this reduction and Theorem 9, we obtain the following result.
Source Cover can be solved in time if a tree-decomposition of of width is provided.
4 Robust Matching Augmentation
In this section we present our main results on the problem Robust Matching Augmentation. Let us first redefine the problem in a slightly different way.
Robust Matching Augmentation
instance: Bipartite graph and perfect matching of .
task: Find a minimum-cardinality set such that is robust.
Fixing the perfect matching in the instance is just for notational convenience, since we can compute a perfect matching in polynomial time and our results do not depend on the exact choice of , according to the discussion in Section 2. The next theorem is our main technical result of this section. By combining the theorem with the results in Section 3 we obtain our algorithmic results.
There is a polynomial-time algorithm that, given an instance of Robust Matching Augmentation, computes two instances and of Source Cover such that the following holds.
and are induced minors of .
From a solution of and a solution of we can construct in polynomial time a solution of I of cardinality .
Let be an instance of Robust Matching Augmentation, where . Our goal is to obtain from solutions of the Source Cover instances a suitable selection of sources and sinks of , such that we can make robust by connecting the selected sources and sinks, using the algorithm Eswaran-Tarjan. Let us denote by the vertex in that is incident to an edge . Furthermore, let . We construct the Source Cover instance as follows. For each critical edge , we remove from each vertex , such that is reachable from in . Let be the resulting graph and let the Source Cover instance be given by . The construction of is as for , but with the arcs of reversed. This turns the sources of into sinks. Clearly, the acyclic digraphs of and are induced minors of , since they were constructed by deleting vertices of and contracting strong components. By Fact 3, the set of critical edges can be obtained efficiently by Tarjan’s classical algorithm for computing strongly connected components. In order to generate and , observe that and can both be obtained by applying a breadth-first search starting at each vertex of or , respectively. So it remains to prove Statement 2 and 3.
Let () be a solution to (). We show how to construct in polynomial time a solution of I of cardinality . Let be the set of vertices incident to critical edges. Moreover, let be the graph induced by the vertices of that are on -paths or on -paths in . Note that can be computed by a depth-first search applied on each source and sink. By running Eswaran-Tarjan on we obtain an arc-set such that is strongly connected. Hence, each is on some directed cycle in . From we can obtain in a straight-forward way an arc-set of the same cardinality, such that each is on some directed cycle of . For each , we add to an arc , where () is some vertex in the strong component () of . By the construction of , each is on some directed cycle of . By Fact 2 and 6 we have constructed a solution of I of cardinality . This completes the proof of Statement 3.
It remains to prove that . Suppose for a contradiction that . Without loss of generality, let attain the maximum. Due to Fact 5, we may assume that an optimal solution of I connects sources and sinks of . Let be the corresponding sources of . Then for each critical edge , the vertex must be reachable from some source . But then is a solution of of cardinality , a contradiction. ∎
As a first consequence of Theorem 11 we obtain a simple -factor approximation algorithm for Robust Matching Augmentation. We “flatten” the graph of the Source Cover instances as described in Section 3 to obtain Set Cover instances and then use the classic Greedy-Algorithm to achieve a -factor approximation.
Robust Matching Augmentation admits a polynomial-time -factor approximation algorithm, where is the number of vertices of the input graph.
In a similar fashion we obtain a polynomial-time algorithm on chordal-bipartite graphs by combining Theorems 11 and 8 and the observation that is chordal-bipartite if is. Furthermore, we give an FPT algorithm parameterized by the treewidth by combining Theorems 11 and Corollary 10 and the observation that treewidth is monotone under taking minors.
Robust Matching Augmentation admits a polynomial-time algorithm on chordal-bipartite graphs and an FPT algorithm parameterized by the treewidth of the input graph.
We now show that our algorithms are also applicable in the following more general setting. Suppose we would like to have a matching of a given cardinality in the graph, no matter which edge is deleted by the adversary.
Robust -Matching Augmentation
instance: Bipartite graph that admits a matching of size .
task: Find a minimum-cardinality set such that for , the graph admits a matching of size .
Note that if is not the size of a maximum matching, then is feasible due to the existence of a larger matching. We give a polynomial-time reduction from Robust -Matching Augmentation to Robust Matching Augmentation that increases the treewidth by at most two. On the other hand, chordal-bipartiteness of the input graph is not preserved However, the corresponding digraph contains no induced cycle of length at least six, so Theorem 8 is still applicable. By Proposition 14 and the previous corollaries, we obtain for Robust -Matching Augmentation a -factor approximation algorithm, a polynomial-time algorithm on chordal-bipartite graphs, and an FPT algorithm parameterized by the treewidth.
There is a polynomial-time reduction from Robust -Matching Augmentation to Robust Matching Augmentation, such that the following holds. Let be an instance of Robust -Matching Augmentation and let . Then
and from a solution of we can construct in polynomial time a solution of I such that .
If is chordal-bipartite then has no induced cycle of length at least six.
5 Weighted Robust Matching Augmentation
As shown above, Robust Matching Augmentation is tightly linked to Set Cover in terms of approximation. Our first result in this section shows that Weighted Robust Matching Augmentation is substantially more complicated, as its approximability is closely linked to Directed Steiner Forest. This problem is formally defined as follows:
Directed Steiner Forest
instance: Directed graph , terminal pairs , costs .
task: Find a minimum-cost subgraph such that for each , the vertex is connected to in .
Let be the number of vertices of the Weighted Robust Matching Augmentation instance and and be the number of vertices and terminals of the Directed Steiner Forest instance, respectively.
An -factor approximation algorithm for Weighted Robust Matching Augmentation implies an -factor approximation algorithm for Directed Steiner Forest. An - or an -factor approximation algorithm for Directed Steiner Forest imply an - or -factor approximation algorithm for Weighted Robust Matching Augmentation, respectively.
On the one hand this result implies an -factor approximation algorithm for Weighted Robust Matching Augmentation for every , due to [9, 17], who achieve a guarantee of , for every . On the other hand, an algorithm achieving a guarantee of or better for Weighted Robust Matching Augmentation implies a better approximation algorithm for Directed Steiner Forest, as the number of distinct terminal pairs is at most and the current best approximation factor in terms of is due to Berman et al. . Additionally, by a result of Halperin and Krauthgamer , the above proposition implies the following lower bound.
For every Weighted Robust Matching Augmentation does not admit a -factor approximation algorithm unless .
Given this negative result we proceed to the analysis of structural restrictions that make Weighted Robust Matching Augmentation more accessible. The main result of this section is a classification of the complexity of the problem Weighted Robust Matching Augmentation on minor-closed graph classes. In particular we show that the problem is -hard on a minor-closed class of graphs if and only if contains at least one of the two graph classes and , which we will define next. Let be the star graph with leaves and let be the path on vertices. For any graph let be the graph obtained by attaching a leaf to each vertex of . Then and . Note that each graph in and has a unique perfect matching. See Figure 3 for an illustration of the graphs and .
Weighted Robust Matching Augmentation is -hard on each of the classes and .
We complement Lemma 17 by showing that Weighted Robust Matching Augmentation on a class of graphs admits a polynomial-time algorithm if contains neither nor .
Let be a class of connected graphs that is closed under connected minors. Then Weighted Robust Matching Augmentation on admits a polynomial-time algorithm if and only if there is some such that contains neither the graph nor . The only if part holds under the assumption that .
In order to prove Lemma 17, we first show that Weighted Robust Matching Augmentation is -hard for graphs consisting only of a perfect matching by a reduction from Robust Matching Augmentation. The hardness of Weighted Robust Matching Augmentation on and follows from this result.
Before we give the proof of Theorem 18, we need the following key lemma. The polynomial-time algorithm described in the proof of the lemma uses the fact that Directed Steiner Forest can be solved in polynomial time if the number of terminal pairs is constant .
Let be constant and let be a class of perfectly matchable trees, each with at most leaves. Then Weighted Robust Matching Augmentation on admits a polynomial-time algorithm.
We remark that the running time of the algorithm given in Lemma 19 slicewise polynomial in the number of leaves of the input graph. We can now state the proof of our main result.
Proof of Theorem 18.
According to Lemma 17, Weighted Robust Matching Augmentation is NP-hard if completely contains the class or the class . Assuming , this proves the only if statement of the theorem.
To see the if statement, let us consider such that does not contain or . First we will reduce the problem to the case when contains only trees. For this, let be the class of all trees in that admit a perfect matching.
There is a polynomial time reduction of Weighted Robust Matching Augmentation on to Weighted Robust Matching Augmentation on .
The key idea for the proof is to define an equivalent instance on an arbitrary tree of on an adapted cost function. We may hence restrict our attention to Weighted Robust Matching Augmentation on the class . As the next claim shows, the relevant trees contained in have a bounded number of leaves.
There is some number depending only on such that every tree in has at most many leaves.
According to the above claims, there is a polynomial reduction of Weighted Robust Matching Augmentation on to Weighted Robust Matching Augmentation on a class of trees with a bounded number of leaves. Hence, Lemma 19 implies that Weighted Robust Matching Augmentation on can be solved in polynomial time. ∎
We presented algorithms for the task of securing matchings of a graph against the failure of a single edge. For this, we established a connection to the classical strong connectivity augmentation problem. Not surprisingly, the unit weight case is more accessible, and we were able to give a -factor approximation algorithm, as well as polynomial-time algorithms for graphs of bounded treewidth and chordal-bipartite graphs. For general non-negative weights, we showed a close relation to Directed Steiner Forest in terms of approximability and gave a dichotomy theorem characterizing minor-closed graph classes which allow a polynomial-time algorithm.
- David Adjiashvili. Beating approximation factor two for weighted tree augmentation with bounded costs. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2384–2399. Society for Industrial and Applied Mathematics, 2017. doi:10.1137/1.9781611974782.157.
- David Adjiashvili, Viktor Bindewald, and Dennis Michaels. Robust Assignments via Ear Decompositions and Randomized Rounding. In 43rd International Colloquium on Automata, Languages, and Programming, volume 55, pages 71:1–71:14, Dagstuhl, Germany, 2016. doi:10.4230/LIPIcs.ICALP.2016.71.
David Adjiashvili, Sebastian Stiller, and Rico Zenklusen.
Bulk-robust combinatorial optimization.Mathematical Programming, 149(1-2):361–390, 2015. doi:10.1007/s10107-014-0760-6.
- Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, and Grigory Yaroslavtsev. Approximation algorithms for spanner problems and directed steiner forest. Information and Computation, 222:93–107, 2013. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). doi:10.1016/j.ic.2012.10.007.
- Viktor Bindewald. Bulk-robust assignment problems: hardness, approximability and algorithms. PhD thesis, Fakultät für Mathematik, TU Dortmund University, 2018. doi:10.17877/DE290R-19108.
- Hans L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305–1317, 1996. doi:10.1137/S0097539793251219.
- Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, and Jesper Nederlof. Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Information and Computation, 243:86–111, 2015. doi:10.1016/j.ic.2014.12.008.
- Robert C. Brigham, Frank Harary, Elizabeth C. Violin, and Jay Yellen. Perfect-matching preclusion. Congressus Numerantium, 174:185–192, 2005.
- Chandra Chekuri, Guy Even, Anupam Gupta, and Danny Segev. Set connectivity problems in undirected graphs and the directed steiner network problem. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’08, pages 532–541. Society for Industrial and Applied Mathematics, 2008.
- Eddie Cheng and László Lipták. Matching preclusion for some interconnection networks. Networks, 50(2):173–180, 2007. doi:10.1002/net.20187.
- Joseph Cheriyan, András Sebő, and Zoltán Szigeti. Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph. SIAM Journal on Discrete Mathematics, 14(2):170–180, 2001. doi:10.1137/S0895480199362071.
- Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015.
Irit Dinur and David Steurer.
Analytical approach to parallel repetition.
Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, pages 624–633. ACM, 2014. doi:10.1145/2591796.2591884.
- Mitre C. Dourado, Dirk Meierling, Lucia D. Penso, Dieter Rautenbach, Fabio Protti, and Aline Ribeiro de Almeida. Robust recoverable perfect matchings. Networks, 66(3):210–213, 2015. doi:10.1002/net.21624.
- Kapali P. Eswaran and Robert E. Tarjan. Augmentation problems. SIAM Journal on Computing, 5(4):653–665, 1976. doi:10.1137/0205044.
- Jon Feldman and Matthias Ruhl. The directed steiner network problem is tractable for a constant number of terminals. SIAM Journal on Computing, 36(2):543–561, 2006. doi:10.1137/S0097539704441241.
- Moran Feldman, Guy Kortsarz, and Zeev Nutov. Improved approximating algorithms for directed steiner forest. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 922–931. Society for Industrial and Applied Mathematics, 2009.
- Samuel Fiorini, Martin Groß, Jochen Könemann, and Laura Sanità. Approximating weighted tree augmentation via chvátal-gomory cuts. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 817–831, 2018. doi:10.1137/1.9781611975031.53.
- András Frank and Tibor Jordán. Graph connectivity augmentation. In Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, chapter 14, pages 313–346. CRC Press, 2015.
- Greg N Frederickson and Joseph Ja’Ja’. Approximation algorithms for several graph augmentation problems. SIAM Journal on Computing, 10(2):270–283, 1981. doi:10.1137/0210019.
- Harold N. Gabow, Michel X. Goemans, Éva Tardos, and David P. Williamson. Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks, 53(4):345–357, 2009. doi:10.1002/net.20289.
- Eran Halperin and Robert Krauthgamer. Polylogarithmic inapproximability. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 585–594, 2003. doi:10.1145/780542.780628.
- Alan J. Hoffman, Anthonius W. J. Kolen, and Michel Sakarovitch. Totally-balanced and greedy matrices. SIAM Journal on Algebraic Discrete Methods, 6(4):721–730, 1985. doi:10.1137/0606070.
- Mathieu Lacroix, A. Ridha Mahjoub, Sébastien Martin, and Christophe Picouleau. On the np-completeness of the perfect matching free subgraph problem. Theoretical Computer Science, 423:25–29, 2012. doi:10.1016/j.tcs.2011.12.065.
- Laurence A. Wolsey and George L. Nemhauser. Integer and Combinatorial Optimization. Wiley Series in Discrete Mathematics and Optimization. Wiley, 1999.
Appendix A Omitted Proofs
a.1 Proofs Omitted from Section 2
Proof of Fact 4.
Let and be two distinct perfect matchings of . Then their symmetric difference is a sum of -alternating cycles. But each cycle is in some strong component of and , so both condensations must be isomorphic. ∎
Proof of Fact 5.
Let be an arc in . Let be a copy of , where the arc is replaced by an arc from a sink of reachable from to a source of from which is reachable. We show that is robust. Suppose for a contradiction that this is not the case. Then there is some edge , such that , , and is not on an -alternating cycle in . Equivalently, is not contained in a directed cycle of . However, since is robust, we have that and the arc are contained in some directed cycle of . That is, there are , such that , , and . Let () be a path connecting and ( and ). Then is a closed walk that contains a simple directed cycle visiting . This contradicts our assumption that is not on a directed cycle in . By iterating this argument we obtain an arc-set such that and is robust. By construction, contains only arcs that connect sources and sinks of . ∎
Proof of Fact 7.
By assumption, we have that contains no strong sources or sinks. Therefore, each source and each sink of corresponds to a critical edge of the matching . Let of minimum cardinality, such that is robust. By Fact 5, we may assume that connects only sinks to sources of . If , then at least one sink or at least one sources is not incident to an arc of . Therefore, the graph is not robust. ∎
a.2 Proofs Omitted from Section 3
Proof of Theorem 8.
Let be a Source Cover instance such that is connected, has at least one arc, and contains no induced cycle of length at least six. If is chordal-bipartite, then we can apply the polynomial-time algorithm for Set Cover on chordal-bipartite incidence graphs, see [25, pp. 562-573] and . It remains to show that is chordal-bipartite. Suppose for a contradiction, that contains an induced cycle , where and , and . In order to keep the notation concise, let .
Since is a cycle in connecting sources and sinks, we have that for , there are directed paths and in such that connects to and connects to . We now construct a cycle in and then show that is chordless and has length at least . Let be any shortest path from to in . Let us assume we already constructed the paths and for . We now define the paths and in the following way: is a shortest path from to in . If there exist more than one shortest path, then we pick the one whose endpoint is closest to on . We refer to this endpoint by . Similarly, is a shortest path from to in . If there is more than one shortest path, then we pick the one whose starting point is closest to on . We refer to this starting point by . Finally (= ) is a shortest path from to . Again, if there is more than one such shortest path, then we first pick the one whose starting point is closest to on and then whose endpoint is closest to on . We refer to these two vertices by and , respectively. Now let .
We have that is by construction a cycle in . Note that and , since otherwise were adjacent to or were adjacent to in . Therefore, is simple and has length at least . Now assume for a contradiction that has some chord . Observe that connects two distinct paths and (without loss of generality, and ) only if and or and , respectively, since otherwise is not chordless. On the other hand and contradicts the choice of the starting vertex of on . Similarly, and contradicts the choice of the endvertex of on . Therefore, is an induced cycle in of length at least , which contradicts our assumption that has no induced cycles of length . ∎
a.3 Source Cover on graphs with bounded treewidth
We now present the -time algorithm for Node Weighted Directed Steiner Tree on acyclic digraphs that is single-exponential in the treewidth of the underlying undirected graph and linear in the instance size. Let us first again recall some definitions. The problem node-weighted Directed Steiner Tree problem is defined as follows.
Node Weighted Directed Steiner Tree
instance: Acyclic digraph , costs , terminals , root .
task: Find a minimum-cost subset , such that is connected to each terminal in .
Our algorithm is presented best using a so-called nice tree decomposition. This kind of decomposition limits the structure of the difference of two adjacent nodes in the decomposition. Formally, consider a tree decomposition of a graph , rooted in a leaf of . We say that is a nice tree decomposition if every node is of one of the following types.
Leaf: has no children and .
Introduce: has exactly one child and there is a vertex of with .
Forget: has exactly one child and there is a vertex of with .
Join: has two children and such that .
Such a nice decomposition is easily computed given any tree decomposition of . We define to be the subtree of rooted in : the tree of all vertices not connected to the root in the forest , together with . By we denote the set of vertices contained in all bags of nodes in .
A coloring of a bag is a mapping , where the individual colors have the following meaning.
Active and already covered, represented by a 1, means that the vertex is active and that there is at least one predecessor of it that is either labeled 1 or .
Active and not yet covered, represented by a , means that the vertex is active but every predecessor is labeled 0.
Not active, represented by a , means that the vertex is not contained in the solution.
Note that there are colorings of the bag . For a coloring of we denote by the minimum cost222Here, a vertex has a cost if it is colored or and 0 otherwise. of a coloring satisfying the following conditions.
each vertex in is colored 1, or 0 according to .
every vertex of is colored 0 or 1.
each sink is colored either 1 or .
each with is either a source or at least one predecessor of in is colored either or .
To present the individual steps of the algorithm, assume that we are given a nice tree decomposition of our input graph. Let us say we are currently considering the node in and distinguish between the type of node .
Leaf: put if it is not the root.
Introduce: let be the unique child of and let such that . The value depends on the type of vertex is and on the coloring of . By definition, sinks have to be active and therefore the optimal value is if . The same is true for sources labeled in (those do not have predecessors and need to be labeled either 1 or 0). Finally, we set the cost to be if is labeled 1 in and not a source, but non of its predecessors is active in . Thus we set
where the pair is compatible to if the following conditions hold.
If , then . As the introduced vertex is not considered to be part of the solution, we can simply keep the coloring of the child node.
If , then , , and . This condition makes sure that the introduced vertex can only be labeled if none of its predecessors is labeled 1 or .
If , then , , and, moreover, or . This conditions says that the introduced vertex can only be labeled if at least one of its predecessors is labeled 1 or , unless it is a source.
Forget: let be the unique child of and let such that . Then we put
We do not allow a vertex labeled to be forgotten, as we can not assure to cover it in later bags. For the remaining cases we simply keep the optimal value.
Join: let and be the two children of the join node with . We put
where the minimum runs over all colorings of and of with and .
Root: as the graph is connected and the root node is a leaf, the root node is a forget node, where its child node contains exactly one vertex in its bag. The algorithm terminates with the output
where is the unique coloring of the empty bag .
Having presented the algorithm, we need to prove Theorem 10 by showing the correctness and bounding the running time of the algorithm.
Proof of Theorem 10.
We need to show that the algorithm works correctly and is fixed parameter tractable when parameterized by the treewidth of the underlying graph. Let be a nice tree decomposition of of width with nodes.
The algorithm correctly computes an optimal solution to Node Weighted Directed Steiner Tree in Acyclic Graphs.
We show the statement by a straight-forward inductive proof on the decomposition tree. The induction hypothesis states that is the minimum cost of a solution induced by the vertices of , satisfying the conditions (a)-(d) (see p. A.3). The base case are the leaf nodes where the hypothesis clearly holds. Now let the induction hypothesis be true for all descendants of . We distinguish between the remaining three node types and argue that the induction hypothesis holds in .
Introduce: let be the unique child of the introduce node and let such that . Clearly (a) holds and (b) holds by the induction hypothesis. By putting to if for a sink , (c) also holds.
For (d) observe that the notion of compatibility is defined correctly. If this is trivial. For observe that has to satisfy the condition that . Thus the condition (d) holds for . Now for a given coloring we have to check if is calculated correctly. This is true for the cases in which is set to . So it remains to show that we identify all compatible colorings for to calculate the minimum. The case is trivial. For the cases observe that has to satisfy and . Calculating the minimum over all pairs compatible to is hence correct. Finally it is clear that that we have to add to the minimum of all compatible colorings for if .
Forget: let be the unique child of and let such that . For a forget node we put . Clearly (a), (c) and (d) hold by the induction hypothesis. (b) also holds as we only allow colorings that satisfy . Finally it is easily verified that the calculation of is correct.
Join: let and be the two children of the join node with . By (2), a vertex may only be colored if it is colored 1 either in or . As the induction hypothesis holds for and , (a)-(d) also hold for . It remains to show that is calculated correctly. The considered colorings and of and have to satisfy | s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964358180.42/warc/CC-MAIN-20211127103444-20211127133444-00157.warc.gz | CC-MAIN-2021-49 | 50,389 | 197 |
https://de.coursera.org/learn/python-data/reviews?page=7 | code | Jul 19, 2019
This was a super-fun course! The materials were very easy to follow, and delivered in a very friendly and engaging manner. I highly recommend this course to anyone just getting started in programming.
Nov 10, 2017
I feel incredible that I knew almost nothing about programming just a month ago. Now I have done two of the courses of the specialization and I can actually understand other basic codes. Great course!
von KARANSINH J D•
Aug 03, 2019
It's such good course to study after completing first course of Python specialization .It will help you gain some beginner knowledge about Python language . Also the teacher of this course are really good . He will gives you all kind of information about this course . And the speech of teacher is really understable. hope you all like this course as me . Than you Coursera for having me as a part of this course.
von Ryan R•
Sep 19, 2017
Absolutely wonderful. I've learned so much over these past few weeks! Professor Severance's class structure, that's based off 'Think Python' by Allen Downey, is way more user friendly than it's "100% computer-science" counter-part; providing a thorough approach to learning the syntax needed to get you a solid grip on the fundamentals needed to learn actual computer programming theory; thanks again Professor!
von Gustavo N•
Nov 08, 2016
Really interesting course, I really enjoy the class with Dr. Chuck because he makes easy explanation of different concepts in programming that makes the excersices easy to solve. I have learned about data structures, a topic that I barely had knowledge and I hope I can apply this new knowledge in my future master course or at my future work... Keep doing videos Dr. Chuck, greetings from Caracas, Venezuela!
von Muhammad Z S L•
Apr 01, 2018
The course has been so well driven. Many thanks to the entire developers of such a lovely platform and especially my instructor Dr.Chuck(Sir. Charles R.Severance) who made this course an infinite loop of fun learning. You are best sir. Please Sir try I have only one request: Kindly made the assignments and quizzes more complex and some what more difficult. you are best and Coursera rocks. Thanks alot...:)
von Nihar P•
Jan 14, 2020
This course has been well structured and I must say all the programming assignments were too good to understand the basic concepts of Python Data Structures. Prof.Chuck is the best professor when it comes to teaching python. With the help of this course, it made my career transition from Mechanical to Computer Science smoothly. With this Course, it sparked me to go towards Algorithms and Data Structures.
von Rohit D•
May 25, 2019
One of the best Python courses I have taken. Loved Dr. Chuck's lectures as usual and the progression of this course is perfect for someone coming from the first course in this specialization. I would recommend not to rush through the course to get the certificate. It's important to make sure you understand each line of code in the exercises as this course is when you really start writing some cool code.
von Felipe A M•
Dec 15, 2016
Great, an excellent approach to Python in my case with no previous programming experience. It goes step by step incorporating new meaningful blocks of knowledge you can use and practice at the end of each week. Material really well developed and easy to understand and follow. Excellent experience as part of the whole Python specialization. Thanks for sharing this so well prepared course and knowledge.
Nov 09, 2015
Great Course for beginners, without any programming knowledge.
I am suggesting to take this course before you will do any other courses. This course helped me to learn on other python courses, which were overestimated as "for beginners" but needed already some programming knowledge. In this course all assignments are based on learned material (based on lecture). I am glad that I took this course first.
von James M B•
Sep 21, 2016
This is my 2nd course in the series and it steps up the game a little. You learn more about the capabilities of Python while causing you to think a bit more than the first course. I enjoyed it thoroughly and Dr. Chuck made it a worth while challenge. Thanks for another excellent course and I'm looking forward to the 3rd chapter of the series Course 3 - Using Python To Access Web Data. Thank You!!
Apr 16, 2020
Thank you so much, Chuck. I stronly agreed with what you said on the graduation ceremony. As a chemistry major graduate student, you know, only chemistry skills cannot give me enough competition on job market. I would really say thank you for you and this course. I hope after several years, I will get great job and can use the python skills you taught me, and after that, I will tell you. I promise!
von Ashwin S•
Feb 07, 2020
First of all a hearty thanks to Coursera and the University of Michigan for providing me with such an a wonderful opportunity to learn python data structures. File handling in C language always seemed to be a daunting task for me and i truly hated it. But thanks to professor Chuck and the amazing simplicity yet much more effective python language i was able to overcome this challenge data handling.
von Rajashree C•
Dec 10, 2015
Excellent course! I am also doing a course on bioinformatics algorithms and the code challenges in that course were very easy to program using Python as the language! It feels great to actually be writing programs that have some real-life impact! All thanks to Dr. Chuck for his wonderful way of teaching and his beautifully written book. I am definitely going in for the next course in this series!
von Kyle G•
Apr 10, 2020
Took Python Data Structures immediately following Python for Everybody. Loved both courses!! Even as a novice, you can knock each out in a couple of days. It felt really good to struggle through some of the coding exercises and finally reach an "aha!" moment, and then go back and improve my code with the skills I learned soon thereafter. If you are interested in coding at all, I highly recommend.
von Vikas V•
May 26, 2019
It was absolutely an amazing experiance learning from coursera as i can list down all the pros of enrolling in this course
i.e starting ,from short videos in different chunks to fitting quiz at the right time and
adding fun videos to get rid of boredness,it seems to have been most organized online learning platform I have ever interacted with.
Many thanks to the Coursera team...you guys rock !!
Feb 19, 2019
Very informative and nice course. With Dr Chuck learning never is a boring experience but it is fun learning. I did not find data structures that easy or may be requires more practice but Dr. Chuck made it very easy for me. Appreciate efforts taken by him and Coursera in bringing forth this course and making it easy for the entire learning community. Thank you very much Chuck Sir and Coursera!!!
von Aditya S J•
Mar 28, 2020
Learning a programming language could not be easier and enjoyable than this. Prof. Chuck, He is the best teacher I have ever got. The way he explains through the program is the best possible way to understand it clearly. I would really recommend everyone to take this course if you are still afraid of programming languages this course is for you. Thank you, Coursera and University of Michigan.
von ARJUN B•
Jun 01, 2020
I have never such a approach to teaching programming language. It is a best course series so far. Never seen learning prog. lang. can be so easy. I remember in my first semester of bachelor's degree, they taught me c programming which i found very complex to the newbie like me at that time. I think education system in India should take more flexible and dynamic approach to teach students.
von Maytat L•
Dec 10, 2019
This course is awesome for a total beginner of Python. The instructor was very enthusiastic, encouraging you to take on the challenges. His teaching was very simple and fun to follow. Each week only took 15-30 min to watch videos. The rest depended on how fast you could get the assignment completed. If you were struck with a problem and posted in the forum, the staff replied really fast.
von Xiaoya L•
Jul 29, 2017
The content taught in this course is more complicated than the first one - getting started. I did sometimes struggle with the assignments, since I didn't have the habit of reviewing the lectures and materials after each week. Have to pick up the book and work harder now! Although challenging, the course is still interesting to me, and I pretty enjoy the sense of accomplishment in the end!
von Janet L•
Apr 14, 2020
As a former Java Developer for BI apps who is transitioning to a Data Scientist/Data Analyst role, I would say Python definitely makes it easier and more efficient to develop BI/ETL apps. But equally important is an instructor who delivers the lessons in an easy-to-follow manner while focusing on the real world use cases. Thank you Dr. Chuck and your teaching assistants for a great job!
von Sergio B•
Oct 02, 2017
Excelente curso. El material visual es sencillo, bien diseñado y explicado de forma organizada y entendible. Charles imparte la materia con pasión y de manera creativa y simple, de forma que es fácil para programadores novatos comprender la materia. Programadores intermedios/avanzados quizás encuentren el curso un poco lento o repetitivo en ciertas etapas, pero interesante igualmente.
Sep 08, 2017
I really enjoy Dr.Chunk's courses.
I have no basic of programing,I am a radiologist,in order to be prepared for the AI times,I decided to learn someting about programing.
The certificate is much easy to get compared with the ML course,and I think it is a good fedback so that I can maintain my passion on learning the coureses.
All the best to Dr.Chunk! Keep learning my fellow classmates.
von Jason K•
Jan 08, 2017
Excellent course. It will take your newbie python skills to the next level and teach you lists, dictionaries and tuples (all python data structures). I found the assignments to be challenging but not hard. Spent about 2 to 3 hours per week (actually, I crushed the course over the Xmas holidays and did the whole thing in a week doing about 2 to 3 hours each day. Loved it!) Good luck!!
von Christopher V•
Jan 28, 2016
This class provides an introduction to all of the 'containers' used in Python to store and pass data. Charles Severance continues to provide excellent instruction on how these tools can be implemented and what they are capable of. Upon finishing this class, the student should know all of the basic commands used for building a program, along with simple techniques and implementations.
von Pronab D•
May 20, 2020
It was more challenging than the first course but well-paced. I may have to review some of the basic things I'm not clear about. So I would advice not to speed through the course if you are complete beginner. I had to rush because I'm using Coursera for campus for free and I need to learn so much more in short duration. If you have no reason to rush, please don't rush the course. | s3://commoncrawl/crawl-data/CC-MAIN-2020-24/segments/1590348493151.92/warc/CC-MAIN-20200605045722-20200605075722-00190.warc.gz | CC-MAIN-2020-24 | 11,075 | 82 |
http://forums.gbpvr.com/showthread.php?52113-Freeview-HD-UK-and-Popcorn-A110&p=438079 | code | I started again and added the N- PVR shared directory.
When I press the 4th Icon and then the HTML file and option 1 and 2 the program responds with "Request cannot be processed".
If I browse to the share select the HTML file and select the second option the screen goes black for about 20 seconds and then the NPVR menus appear and I can select the recording and play with sound !!.
Unfortunately the picture stutters.
So the problem may be the time delay when selecting from the share and some type of rendering issue.
Checking for mvpmc share on COOLMASTER
Checking GB-PVR.html links
C:\mvpmc \GB-PVR.html not found
NMT IP Address: 192.168.1.56 MAC 0006DC440E1A
GB-PVR previously uninstalled
N-PVR Installed C:\Users\Public\NPVR
<a href="http://localhost.drives:8883/NETWORK_SHARE/NETWORK_BROWSER/browser.cgi">N-PVR via Network Browser</a>
<a href="http://localhost.drives:8883/USB_DRIVE_A-1/mvpmc/usb_a.cgi">N-PVR via USB</a>
The remote server returned an error: (404) Not Found.
Checking NMT Version
Checking NMT Display
Calling NMT Source
Tv recordings lounge
smb://COOLMASTER/Recorded%20TV Username: Password Length: 0
smb://PLAYROOM-PC/films Username: Password Length: 0
smb://COOLMASTER/films Username: Password Length: 0
smb://COOLMASTER/mvpmc Username: Password Length: 0
Last edited by hansol123; 2012-04-29 at 09:57 AM.
It looks like you didn't follow the instructions correctly for installing the mvpmc share to the NMT setup completely. You were supposed to leave the sharename blank and let it default, instead you named it npvr. To fix this you can either remove the share from the NMT and readd it or edit the npvr.html file with a linux editor and change COOLMASTER:mvpmc to COOLMASTER:npvr
Changing between the share method and the browser method requires resetting the box with a power off.
The reason you are getting sound now is you probably powered off one or all of your HDMI devices causing a reset. The HDMI chain can be very fussy.
NextPVR streams via http which is faster than through a share. This might solve the stuttering problem.
Thanks Martin it is now working using the first menu option.
Live TV is more or less perfect but still some stuttering playing back H264 recordings.
A simpleton question, related to this thread
I am thinking of this TBS DVB-T2 tuner card so as to get HD, but my output from the Popcorn A110s is on composite video rather than HDMI. Does this mean that I would lose either HD video or sound on the PCHs?. i could go to HDMI, but I have already got three HDMI devices on my HDMI input and don't really want any more
I gave up on using the Popcorn A110 to play back the TS recordings with AAC HD sound produced using this card, and now stream to a Samsung Blu-ray player using Serviio .
Please note the Samsung will not play back the HD recordings unless they are converted to MP4 HD files, I cut and convert using Videoredo.
I also had to remove my Hauppauge DVB-T1 card from my PC before the TBS-6280 worked on dual card mode. However the TBS T2 card happily co-exists with my Hauppauge S2 card.
The composite output should work but is it probably less hassle to use a HDMI auto switch.
You won't lose any broacast sound that aren't losing today. Lossless audio requires HDMI, and AC3 requires digital audio passthrough. HE-AAC is downmixed to 2 channel PCM.
Originally Posted by StevHodge
On top of doing mp4 using VideoRedo will correct some major imperfections so I don't doubt it provides a better experience. I may be lucky that non of my NextPVR recordings require this. Serviio is really just a UPnP server and it doesn't add much to the mix.
Originally Posted by hansol123
The reason for using Serviio is that it works well with both the Samsung blu-ray player and my bedroom Sony smart TV.
The Samsung will not play HD TS files with AAC HD sound hence the reason for converting to MP4 also the time skip works on the MP4 files.
Many thanks, gentlemen, very helpful | s3://commoncrawl/crawl-data/CC-MAIN-2015-14/segments/1427131299515.96/warc/CC-MAIN-20150323172139-00236-ip-10-168-14-71.ec2.internal.warc.gz | CC-MAIN-2015-14 | 3,936 | 42 |
https://www.trustradius.com/reviews/netsuite-2015-05-05-18-28-27 | code | Increased efficiency over Oracle
Overall Satisfaction with NetSuite
Soligent uses NetSuite as our primary ERP system for three subsidiaries.
- NetSuite is very user friendly and easy for new employees to quickly get up to speed.
- Access on the cloud allows for faster user interface at remote locations. It also makes for easier access for employees on the road or working from home.
- Reports are easy to run and export to Excel cleanly and easily.
- It is easy to attach electronic supporting documents in NetSuite, e.g. journal entry support to journal entries, customer PO's to sales orders, vendor invoices to AP vouchers.
- Access permissions are too broad. In order to grant an employee functionality to do one task, they may be granted access to do other tasks that they don't do, or shouldn't.
- Some automatic processes in more sophisticated ERP systems, such as voided checks and purchase price variance, require journal entry posting in NetSuite.
- Demand planning and warehouse operations could be improved.
- More efficient order processing from beginning to end compared to our prior ERP system, Oracle
- More efficient monthly close compared to Oracle
- Better system up time and less errors compared to Oracle.
We selected NetSuite to replace Oracle. The number of people required to support Oracle both from and IT and user perspective were taxing company resources. Oracle system downtime at critical times of the month was also a problem, especially at month end being part of a multi-national public company that had tight close deadlines. NetSuite is more reliable and user friendly compared to Oracle and requires less IT resources (both people and hardware) and less users to operate efficiently.
It may not be well suited for companies that will generate a high volume of transactions over time, this tends to slow the system down. NetSuite also struggles with out of the ordinary type practices, such as consigned inventory. Assess any unique needs to your business and find out if NetSuite has a solution to address those needs during the selection process. | s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100518.73/warc/CC-MAIN-20231203225036-20231204015036-00556.warc.gz | CC-MAIN-2023-50 | 2,085 | 15 |
http://zolomon.com/2016/03/18/working-as-a-team-with-umbraco/ | code | Below is a quick summary on how to effectively work as a team with Umbraco CMS. If you have any suggestions or improvements, please leave a comment.
Create revisions with Umbraco Courier 2, store them in Git as well as your ASP .NET MVC solution containing your Umbraco CMS installation.
Developers can work in parallel as long as the
points to the same database.
Revision from Umbraco Courier 2, containing content,
can then be transferred from
Development environment to the
Staging environment for testing and verification.
Feature changes, that result in newly compiled .DLL files,
templates etc. should simply be copied over via
XCOPY or similar
constructs, preferably performed via automation.
For example, the
~/Views directories will
need to be manually copied over to the
Staging environment from the
Obvious but important to mention is that Feature changes also must be committed to the Git repository.
Once changes are approved and new content has been added by
non-developers, this content can be synchronised with the
Development environment again via Umbraco Courier 2.
To publish, synchronise content changes from the
Production environment using Umbraco Courier 2, or just
XCOPY the whole
Staging environment to
Make sure that you republish the whole site after copy so that new content changes will appear publicly.
The ASP.NET MVC solution containing the Feature changes will need to be redeployed via Project -> Publish into some folder. | s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446711221.94/warc/CC-MAIN-20221207221727-20221208011727-00541.warc.gz | CC-MAIN-2022-49 | 1,456 | 26 |
https://forum.edu.cospaces.io/t/i-deleted-the-building-by-mistake/3444 | code | I deleted the building by mistake. What should I do?
In Sharing, I clicked Update, but it’s the same.
If you haven’t yet left the scene after you removed your building, you can restore it by pressing the undo button.
If you left the scene since then, then your building is gone forever. Sorry for this!
I tried to delete it and press the “Return” button, but I couldn’t return it even if I pressed the “Return” button.
Can’t you restore to a history on the server? | s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710898.93/warc/CC-MAIN-20221202050510-20221202080510-00055.warc.gz | CC-MAIN-2022-49 | 480 | 6 |
https://www.hackingwithswift.com/example-code/naturallanguage | code | iOS gives us the ability to search for similar words for a term by using word embeddings, which are maps of strings created using machine learning that describe how similar various words are in terms of their meaning. This kind of thing is useful when handling user searches: you might have tagged a photo with “hat”, but your user searched for “sombrero” – word embeddings let us find similar words, and we can then use those variations for data searches.... Continue Reading >>
Sentiment analysis uses machine learning to tell us whether a piece of text is considered positive or negative, and it’s baked right in to iOS with the NaturalLanguage framework.... Continue Reading >>
This is part of the Swift Knowledge Base, a free, searchable collection of solutions for common iOS questions, all written for Swift 5.1.
Link copied to your pasteboard. | s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038078021.18/warc/CC-MAIN-20210414185709-20210414215709-00619.warc.gz | CC-MAIN-2021-17 | 863 | 4 |
https://www.coursehero.com/sg/college-algebra/polynomial-operations-and-theorems/vocabulary/ | code | coefficient of the first term of a polynomial written in standard form, which places the term with the highest degree first
function whose rule is a polynomial in one variable, which is a sum or difference of terms of the form , where is a real number and is a nonnegative integer
polynomial in one variable
sum or difference of terms of the form , where is a real number and is a nonnegative integer
process of long division of polynomials where only the coefficients and constants are recorded. The divisor must be a linear factor with a coefficient of 1. | s3://commoncrawl/crawl-data/CC-MAIN-2023-23/segments/1685224654016.91/warc/CC-MAIN-20230607211505-20230608001505-00231.warc.gz | CC-MAIN-2023-23 | 557 | 5 |
https://www.altera.com/products/intellectual-property/all-ip/interface-protocols/m-alt-ddr2_sdram.html | code | - Support for industry-standard DDR and DDR2 SDRAM devices and modules
- Including support for registered DIMMs
- Flexible, robust design
- 1, 2, 4, or 8 chip-select signals
- Configurable data width including data strobe (DQS) read postamble control logic and optional non-DQS read mode for side banks (Stratix® series FPGAs)
- Automatic or user-controlled refresh
- Data mask signals for partial write operations
- Bank management architecture, which minimizes latency
- Quick and easy implementation
- IP Toolbench-generated constraint script
- Top-level example design shipped as a deliverable with the intellectual property (IP) MegaCore® function
- IP functional simulation models used in Altera supported VHDL and Verilog HDL simulators
- Free clear-text data path for use with custom controller
- SOPC Builder ready to enable system-level design
The DDR and DDR2 SDRAM controllers handle the complex aspects of using DDR and DDR2 SDRAM—initializing the memory devices, managing SDRAM banks, and keeping the devices refreshed at appropriate intervals. The controllers translate read and write requests from the local interface into all the necessary SDRAM command signals.
Whether you use the IP Toolbench in SOPC Builder or the Quartus®II software, it generates an example design, instantiates a phase-locked loop (PLL), an example driver, and your DDR/DDR2 SDRAM Controller custom variation. The example design is a fully-functional example design that can be simulated, synthesized, and used in hardware. The example driver is a self-test module that issues read and write commands to the controller and checks the read data to produce the pass/fail and test complete signals.
You can replace the DDR/DDR2 SDRAM controller encrypted control logic in the example instance with your own custom logic, which allows you to use the Altera® clear-text data path with your own control logic.
Use the Altera OpenCore Plus Evaluation flow to test drive this IP core.
Typical expected performance and utilization figures for this MegaCore function are provided in the DDR and DDR2 SDRAM Controller Compiler User Guide (PDF).
Altera awards the I-Tested certification to MegaCore functions or Altera Megafunctions Partners Program (AMPPSM) IP cores that have been verified in an Altera FPGA on an evaluation board with the ASSPs, hardware components, or test equipment necessary to ensure interoperability according to the relevant protocols.
For more information, see MegaCore Verification in the DDR and DDR2 SDRAM Controller Compiler User Guide (PDF).
For technical support on this MegaCore function, please visit the Altera mySupport online issue tracking system. You may also search for related topics on this function in the Altera Knowledge Database.
For more information on the DDR/DDR2 SDRAM Controller MegaCore functions, refer to the following documents: | s3://commoncrawl/crawl-data/CC-MAIN-2015-27/segments/1435375096293.72/warc/CC-MAIN-20150627031816-00157-ip-10-179-60-89.ec2.internal.warc.gz | CC-MAIN-2015-27 | 2,869 | 23 |
https://www.shankhabasu.com/ | code | I am an Associate Professor of Marketing at the University of Leeds, UK. I have a PhD in Marketing from Nanyang Technological University, Singapore. Prior to the PhD, I worked in the banking and FMCG industries in India.
I have two broad areas of interest. First, I study how minor differences in the way options are framed or presented affect peoples decisions. Second, I am interested in understanding how the cultural context in which consumers make decisions influence their attitudes and behavior. In both these areas of research, my overarching goal is to help consumers make better decisions. My work has been published in journals such as Journal of Consumer Psychology, Organizational Behavior and Human Decision Processes, Psychological Science, Journal of Experimental Psychology: General, Journal of Experimental Social Psychology, and others.
I teach the introductory marketing module in the MSc Management program and Advanced Quantitative Methods to doctoral students. | s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764499801.40/warc/CC-MAIN-20230130034805-20230130064805-00032.warc.gz | CC-MAIN-2023-06 | 983 | 3 |
https://theshinyheadedprophet.com/2010/09/16/the-death-of-bloglines/ | code | I just picked this up by accident which I guess may have an effect on a number of bloggers. I have used a blog roll from Bloglines to highlight blogs that I regularly go to in my blog reader when they have been updated.
If you use google reader it is very easy to set up another blog roll – which I have just spent 5 minutes doing. The upshot is I now have a new blog roll in the sidebar at the bottom of this blog. Why not go check them out – they all write a lot more interesting stuff than me! | s3://commoncrawl/crawl-data/CC-MAIN-2023-23/segments/1685224656675.90/warc/CC-MAIN-20230609100535-20230609130535-00738.warc.gz | CC-MAIN-2023-23 | 500 | 2 |
https://stats.stackexchange.com/questions/233639/stopping-exploding-gradients-in-keras/360087 | code | I have a LSTM (Long-Short Term Memory) Neural Network that has this structure:
model = Sequential() model.add(Masking(mask_value=0.0, input_shape=(271,2))) adam = Adam(lr=.0000001, clipnorm = .001) model.add(LSTM(271, activation = 'linear', input_shape=(271,2))) #return_sequences = True #model.add(LSTM(3, activation = 'hard_sigmoid', inner_activation = 'hard_sigmoid')) #model.add(Dense(1, activation = 'linear')) model.compile(loss='mean_squared_logarithmic_error', optimizer=adam) model.fit(maskingreg, maskingresp, nb_epoch=50, batch_size=500, verbose=2)
As you can see, I am clipping gradients and making the learning rate minuscule. However when the activation is linear, the net returns NaNs for the loss at every training epoch but the first. Does anyone have any other ideas why this is happening or even if there were more in depth troubleshooters in Keras to figure out why the loss is NaN?
Additionally when I use a hard sigmoid activation so that the min and max is capped, the net doesn't spit out NaNs but does not perform well. Obviously, this is not the main usage of a hard sigmoid, which is why I would prefer to stick with linear activation.
One problem I considered is that I'm doing masking incorrectly and this is causing a very low rank tensor. I have 52 samples, 271 time steps, and 2 features. I assumed that if I set both of the two features along any time step and any sample to 0. (with mask_value = 0.0), it would skip those features, but would read other samples in the same time step and any features in previous or additional time steps along the same sample. I assumed this was right, but masking seemed pretty confusing so I'm not positive. | s3://commoncrawl/crawl-data/CC-MAIN-2020-24/segments/1590348493151.92/warc/CC-MAIN-20200605045722-20200605075722-00152.warc.gz | CC-MAIN-2020-24 | 1,676 | 5 |
https://www.thepurplechairhypnotherapy.com/how-to-pause-my-betterhelp-account/ | code | Better Help vs. Amwell . How To Pause My Betterhelp Account …
Amwell is an online healthcare platform that offers telemedicine services, including mental health services. Amwell’s mental health services are supplied by licensed therapists, however the platform does not specialize in psychological health like BetterHelp does. In addition, Amwell’s mental health services are just available in particular states, while BetterHelp is available nationwide.
Traditional In-Person Treatment
Traditional in-person therapy is still the most popular form of treatment. It includes meeting with a therapist in person at their workplace. Here’s how conventional in-person therapy compares to BetterHelp.
One of the greatest advantages of BetterHelp is convenience. With online therapy, you can access treatment from the comfort of your own home, at a time that suits you. In-person treatment, on the other hand, needs you to schedule appointments and commute to your therapist’s office.
The expense of treatment can be a barrier for lots of people. In-person therapy is usually more pricey than online treatment. BetterHelp provides more cost effective prices strategies compared to conventional in-person treatment.
When it comes to therapy, privacy is a concern for many people. With BetterHelp, you can access treatment from the convenience of your own home, which can provide a sense of privacy. In-person therapy, on the other hand, requires you to meet a therapist face-to-face at their office.
Your choices for therapists might be limited by your place when it comes to in-person treatment. With BetterHelp, you have access to a larger network of therapists, which means that you have a much better chance of discovering a therapist who is an excellent suitable for you.
In conclusion, BetterHelp treatment uses numerous advantages over conventional in-person therapy, consisting of therapist, convenience, and cost selection. While there are other online therapy platforms readily available, BetterHelp stands out for its large network of therapists and affordable rates plans. Eventually, the choice between online treatment and standard in-person therapy comes down to personal preference and individual needs.
Treatment can be advantageous for a large range of psychological health conditions. In this post, we’ll check out 10 different conditions that people might have and how treatment can help.
Anxiety is a common mental health condition that impacts millions of people worldwide. Therapy can help by providing a safe space to speak about your feelings and feelings. A therapist can assist you identify unfavorable idea patterns and behaviors and work with you to develop coping techniques and favorable routines.
Stress and anxiety How To Pause My Betterhelp Account
Stress and anxiety is another common psychological health condition that can be debilitating. Therapy can assist by teaching you relaxation techniques, such as deep breathing and mindfulness, and dealing with you to develop coping techniques to handle anxiety triggers.
PTSD, or post-traumatic stress disorder, is a mental health condition that can establish after experiencing or experiencing a traumatic occasion. Treatment can help by offering a safe space to process the injury and develop coping techniques to manage the symptoms of PTSD.
OCD, or obsessive-compulsive disorder, is a psychological health condition defined by intrusive ideas and compulsive habits. Treatment can assist by teaching you how to identify and manage these thoughts and behaviors, along with develop coping techniques to manage the symptoms of OCD.
Bipolar disorder is a psychological health condition characterized by extreme state of mind swings, varying from depressive episodes to manic episodes. Treatment can assist by supplying assistance and assistance in handling these state of mind swings, developing coping techniques, and enhancing interaction skills.
Eating disorders, such as anorexia and bulimia, are psychological health conditions that can have serious physical effects. Treatment can help by addressing the underlying mental and emotional problems that add to the eating disorder, as well as establishing strategies to handle the physical symptoms.
Drug abuse can be a difficult practice to break, but therapy can be an efficient tool in handling addiction. Treatment can help by resolving the underlying psychological and psychological problems that add to drug abuse, as well as establishing methods to manage cravings and activates.
Relationship issues, such as communication problems and dispute, can have a substantial impact on mental health. Therapy can help by supplying a safe space to go over these issues and establish methods to improve interaction and resolve dispute.
Sorrow and loss
Grief and loss can be a challenging experience to navigate, however therapy can assist by supplying support and assistance through the mourning process. A therapist can help you determine and handle the emotions associated with grief and loss, along with develop coping techniques to progress.
Stress is a typical experience for many individuals, but it can have unfavorable effect on mental health. Treatment can help by teaching relaxation strategies and establishing coping techniques to handle stress, along with determining and addressing the underlying emotional and mental concerns that add to tension.
In conclusion, treatment can be a reliable tool in managing a wide range of psychological health conditions, from anxiety and anxiety to drug abuse and relationship problems. If you are dealing with your psychological health, think about looking for the assistance and assistance of a certified therapist.
Seeing a therapist can have various benefits for an individual’s mental health and wellness. Here are some of the advantages of seeing a therapist from a mental point of view:
Among the primary advantages of seeing a therapist is increased self-awareness. A therapist can help you determine patterns in your ideas, habits, and emotions, in addition to the underlying beliefs and worths that drive them. By becoming more familiar with these patterns, you can get a much deeper understanding of yourself and your motivations, which can cause personal growth and advancement. How To Pause My Betterhelp Account
Improved psychological policy
Emotional regulation is the capability to handle and manage one’s emotions in a healthy and adaptive method. Seeing a therapist can help people learn and practice emotional guideline techniques, such as deep breathing and mindfulness, that can be helpful in managing challenging feelings and reducing stress. How To Pause My Betterhelp Account | s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947474361.75/warc/CC-MAIN-20240223053503-20240223083503-00533.warc.gz | CC-MAIN-2024-10 | 6,687 | 27 |
http://stackoverflow.com/questions/1223163/eagerly-load-recursive-relation/1901096 | code | I have a recursive one-to-many relationship that has the default lazy value of true. What code can I write against the NH API that will efficiently retrieve the ENTIRE tree AS IF I had lazy="false" on the SubCategories mapping?
Here's the recursive one-to-many relationship:
<class name="Category" lazy="false"> ... <list name="SubCategories" fetch="subselect"> <key column="ParentCategoryID"/> <index column="PositionInList"/> <one-to-many class="Category"/> </list>
I don't specify lazy="false" on the list since laziness is required in about half the queries I need to run. I have fetch="subselect" on the list as an optimization for when I do manage to retrieve the entire tree.
I've tried the ICriteria API:
session.CreateCriteria<Category>().SetFetchMode( "SubCategories", FetchMode.Eager ).Add( Restrictions.IsNull("ParentCategory") ).SetResultTransformer( CriteriaSpecification.DistinctRootEntity ).List<Category>();
but that only eagerly loaded only the first level in the hierarchy. | s3://commoncrawl/crawl-data/CC-MAIN-2014-52/segments/1418802770718.139/warc/CC-MAIN-20141217075250-00003-ip-10-231-17-201.ec2.internal.warc.gz | CC-MAIN-2014-52 | 992 | 7 |
https://www.tvassignmenthelp.com/universities/notre-dame | code | Disclaimer: TvAssignmentHelp is not sponsored or endorsed by this college or university.
- University :
- Country :
Assignment Task: Task: I need to write an essay of 1500 words on a topic in relation to a work in politics done by aristoles. I have attached the topic question, especifying what needs to be included including amount of references. Also I have … | s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964363309.86/warc/CC-MAIN-20211206163944-20211206193944-00410.warc.gz | CC-MAIN-2021-49 | 363 | 4 |
https://www.juniper.net/documentation/en_US/junos/topics/concept/security-service-contexts-gopher.html | code | Service Contexts: Gopher
The table displays the security context details for Gopher:
Table 1: Service Contexts: Gopher
Context and Direction
Matches the display string of a Gopher item.
Matches the contents of a Gopher item/file.
Matches the host and port used to get an item.
GOPHER Host Port
Matches the selector string of a Gopher item. | s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780056902.22/warc/CC-MAIN-20210919220343-20210920010343-00606.warc.gz | CC-MAIN-2021-39 | 339 | 9 |
http://forums.autodesk.com/t5/simulation-mechanical-and/simulation-and-manufacturing-tolerances/td-p/4480797?nobounce= | code | I apologize if this topic has already been discussed, but here is my dilemma.
My company manufactures components that are primarily weldments made from plate and structural steel. When these weldments are made, generally we design the components smaller than their actual size for fit-up. For instance, if a components exact measurement is supposed to be 96", we might detail it out at 95-15/16" so that our shop has room to fit the component up and weld it in place.
I am an engineer, so I am repsonsible for coming up with the designs and running the necessary simulations, and then I pass it off to one of our detail designers that will detail all the components and verify the BOM.
I'm curious as to how people are dealing with this situation. Ideally, I would like my work flow to be that I design the component how it needs to be (with the tolerances built in for manufacturing), and then one of our designers will do the detail drawings. On the flip side of things, we also have situations where a component might already be modeled in Inventor with appropriate manufacturing tolerances, but we need to do FEA after it was already designed.
In the case where I had a model made and had the manufacturing tolerances built in, I converted the model to a weldment and inserted welds between the components that had gaps. This does work, however I find that having all those welds really makes the model more complex than it needs to be, as it adds a considerable amount of time to both meshing and analysis. Overall, for what I was trying to accomplish I felt like this was a lot more cumbersome than it was worth. I think the primary issues were that I had to define contact sets for each component, instead of just defining the contact of the entire model "welded".
Likewise, I did another model where everything was designed to exact size, and the results were what I expected, and the model was a lot simpler in terms of it's meshing and whatnot. However, in this case the designer had to copy my design, and change all the components with all the manufacturing tolerances. I don't really like this method, because ideally I'd like to have all of my production models as ready as possible to run FEA on. As I said before, we also have models that are already designed that we may need to run FEA on, and I'd like to minimize the amount of work necessary to prepare the models for FEA. | s3://commoncrawl/crawl-data/CC-MAIN-2015-06/segments/1422121478981.94/warc/CC-MAIN-20150124174438-00226-ip-10-180-212-252.ec2.internal.warc.gz | CC-MAIN-2015-06 | 2,392 | 6 |
http://community.dynamics.com/gp/b/dynamicsgp/archive/2013/02/14/business-portal-5-0-and-5-1-hotfix-for-result-viewer-query-column-alignment-issues.aspx | code | Welcome to the Dynamics GP Support and Services Blog. This new blog is designed to provide you the insights, knowledge and challenges that our support engineers tackle every day.
A hotfix is now available for Business Portal 5.0 and Business Portal 5.1 to resolve the issue where data is not aligned with the column headings in result viewer queries. This issue appears in Internet Explorer 9.0 and later versions.
Click HERE to download the BP50_51_62253Hotfix.zip file! (PartnerSource or CustomerSource login required)
The hotfix does need to be applied to the web server where Business Portal is installed. There are also steps to complete at each client that accesses Business Portal as well.
Please refer to the Install_Instructions.txt file in the hotfix download.
Other Microsoft Sites
I'm a Customer
I'm a Partner
Follow Microsoft Dynamics | s3://commoncrawl/crawl-data/CC-MAIN-2014-15/segments/1398223202457.0/warc/CC-MAIN-20140423032002-00363-ip-10-147-4-33.ec2.internal.warc.gz | CC-MAIN-2014-15 | 847 | 9 |
http://www.itcuties.com/tools/apache-php-mysql-installation-on-ubuntu/?utm_source=rss&utm_medium=rss&utm_campaign=apache-php-mysql-installation-on-ubuntu | code | Apache, PHP, MySQL installation on Ubuntu
Today we are going to setup an environment where you will be able to host PHP/MySQL applications. This environment consists of the Apache2 HTTP Server with PHP support and MySQL database. This installation is performed on the Ubuntu Server.
# Install Apache 2 HTTP Server sudo apt-get install apache2 # Install PHP5 sudo apt-get install php5 # Install latest MySQL Server and client programs as well sudo apt-get install mysql-server # Install PHP5 module that allows to connect to MySQL database sudo apt-get install php5-mysql
During MySQL server and client installation you will be prompted for the
Apache 2 installation verification
To verify if the apache is installed correctly navigate to http://machine-ip-or-hostname. You should see the “It works!” page.
PHP 5, Apache 2 configuration verification
/var/www directory. Create a
phpinfo.php file with the given contents.
<?php phpinfo(); ?>
Navigate to this file in the browser – http://machine-ip-or-hostname/phpinfo.php. You should see the following page being displayed
MySQL installation verification
Login to your MySQL database using the password that you have provided during the installation process.
mysql -u root -p
When you log in check whether everything is ok with the installation, enter status command
You will see the MySQL server status. | s3://commoncrawl/crawl-data/CC-MAIN-2020-05/segments/1579250603761.28/warc/CC-MAIN-20200121103642-20200121132642-00132.warc.gz | CC-MAIN-2020-05 | 1,359 | 16 |
https://gomakethings.com/podcast/how-i-implement-location-based-pricing-for-my-courses-books-and-workshops/ | code | In today’s episode, I talk about how I implement location-based pricing for my courses, books, and workshops.
- Working with Hugo: https://gomakethings.com/series/hugo-and-static-site-generators/
- Easy Digital Downloads: https://easydigitaldownloads.com/
- Pricing Parity Plugin: https://github.com/cferdinandi/gmt-pricing-parity/
- GeoLite 2: https://www.maxmind.com/en/home
- My various product sites: https://gomakethings.com/resources/
- The PPP API: https://purchasing-power-parity.com/
Today, I’m talking about how I implement location-based pricing for my books and courses. If this topic is interesting to you, you can also head over to techeducatorschool.com, where I’m putting together a bunch of resources on how to do stuff like this. So let’s dig in.
For the last five years now, I’ve offered automatic location-based pricing adjustments on all of my courses, books, and workshops. Customers who live in countries where the exchange rate and local economy make my products more expensive relative to someone living in the U.S. can purchase them at a reduced price.
Today, I wanted to share how I actually implement this, including how I figure out what the adjustments for various countries should be. So why do I do this at all?
A few years ago, I got an email from someone in Africa who had been saving for months to purchase my course bundle. What would cost a student in the U.S. less than a day of work was going to cost this person the equivalent of over a week’s salary, and that felt deeply unfair. I’d heard of the concept of pricing parity from Wes Bos a year or two earlier, but this email is what really pushed me to implement it on my own products as well.
If you’re listening to this and you need a more selfish reason to offer location-based pricing, in the months after I implemented it, my revenue grew by about 50% as a massive amount of potential customers who couldn’t afford my products before suddenly could. The experience has been overwhelmingly positive, but that’s not why I started. I literally started because I realized someone was trying to buy my stuff in a way that just felt wildly unfair.
So here’s how I actually implement it. I’m going to first talk about how it works at a high level, and then I’ll explain my specific setup. I’ve talked to multiple people who have done something like this. We all have a slightly different setup. Everyone’s way of doing this is a little bit different, so I’m just explaining how it works for me. The first is I create an object of countries that should get a discount and how much of a discount they should get.
I use their requesting IP address to identify which country they’re browsing from. If that country is in the object of countries that should get a discount, I show them a message letting them know and apply that discount to their total at checkout. So from a high level, this is relatively straightforward.
And if there is, you can show it in the UI. So for me, I display a message up at the top of the page on the product sales page that says, looks like you are from country where this might be a bit expensive, a discount of, and then I keep all of my discounts stored as fractional percentages. So a 43% discount is going to be 0.43. That way I can do math with it when I’m going to calculate price totals.
So when I’m displaying that in the UI, I need to multiply it by 100 to get a proper percentage. So a discount of 43% or whatever it happens to be will be automatically applied to your cart at checkout to make the price more fair. And then finally, in your checkout system, you’ll need to apply that discount to the actual purchase price before charging their credit card or PayPal account or whatever. To do this, you multiply the price by the discount as a fraction and then subtract it from the regular price.
So, you know, I’d reset the value of the price by saying price minus and parentheses price times discount, and that’s going to give you the new price. So I use Easy Digital Downloads for my checkout and course management. I don’t use WordPress for anything else. My whole website is powered by Hugo, a static site generator, but the checkout system runs on WordPress with Easy Digital Downloads. And I chose this setup because I wanted to host my own checkout platform rather than using something third party.
WordPress is really extensible, so it’s easy for me to customize the experience to match the user experience I want for my customers, and it’s easy to add custom APIs for additional integrations. And this is how I provide access to the courses on an entirely separate portal. WordPress is literally just handling the checkout and then I’m using static site generators for everything else. So I wrote a WordPress plugin that extends Easy Digital Downloads, or EDD, with pricing parity support.
It adds a custom post type for pricing parity discounts that I can use to add discount details for various countries. And I also integrated the Geolight 2 data from MaxMind to detect the customer’s location and match against it. That database periodically needs to be updated, and if you were using like Cloudflare or something, they actually provide location data to you with every request. So you could theoretically rely on them instead.
Last time I talked to Wes Bos about this, that’s what he does on his end.
The plugin adds an API that I can use to get that discount information and display it on my various product sites. So all of my different products have their own websites and landing pages, and so I use this API to get that amount and display it on those pages. And then the plugin also automatically applies that discount to my checkout cart. So users will get a message at the top of the checkout page that specifically says, looks like here’s where you’re from, this discount has been automatically applied to the items in your cart.
So that’s kind of the technical bit of it, but one of the questions I get a lot around this is how I decide what the discount should be.
For years, I used a really basic formula. So I would take a typical web developer salary in the location I’m applying the discount for, divide it by what that same salary would be in the US, and then subtract that difference from one to give me the percentage off. So for example, the average web developer salary in Brazil, last time I looked, according to one site was about 25,000 Brazilian, forget the name of their currency, I apologize, BRL, which converts to, or at the time converted to about $5,000 USD.
And at the time that I was doing this, the typical mid-career web developer salary was $70,000. I think it’s closer to like 80, 85 now, but that’s what it was at the time. So I would take that 20 or that 5,000 USD, divide it by 70,000, and then subtract that amount from which would give me 0.93 or 93%.
The problem with this formula and the reason why I stopped using it is that it doesn’t account for various other economic factors like cost of housing, healthcare, food, and so on.
And this sometimes resulted in discounts for affluent European countries with lower salaries, but dramatically lower costs of living because they have more affordable housing, universal healthcare, whatever it happens to be. So I’ve looked into various calculators and third-party APIs and even tried to do my own math on the Big Mac index, but I never felt confident about the results. For a while, there was this really awesome pricing parity calculator that used data from the OECD and World Bank.
It was clear, simple, and I could reason about the math really, really well. The problem was it was built on Heroku and when they did away with their free plans, the app went away. It never came back. They never upgraded to a paid plan. So I now use the PPP or pricing power parity API. I’ll link to that in the show notes. It’s an endpoint you can call that spits out some information about the country and a recommended pricing parity multiplier.
Rather than using that API live, I periodically check against it and manually store those discounts using my easy digital downloads plugin. That also saves me from making a ton of API calls. It’s just baked right into my system, but I use that and I will every few months go in and check to see if any of those values have updated. So one other really common question I get about location-based pricing is about cheaters. Can’t someone just use a VPN to get a discount from a country they don’t live in?
And the answer is yes, they absolutely can do that. But there’s also a pretty good chance that that person wouldn’t have purchased it at regular price anyways. And I’m not going to punish all of my wonderful, honest customers because of a few shitty people.
I run my business from a place of trust. I think that’s a really important part of how I operate. I don’t worry about that sort of thing. I think it’s better for my customers, who I’m really focused on, people who are really going to pay me money for my stuff, to do with the way I do it. I know of at least one other person in the developer education space who restricts access to the country of purchase if you get a location-based discount.
So let’s say you’re in Brazil and you make a purchase and you get the From Brazil discount. You can only ever access that course with a Brazil-based IP address. So if you are traveling for work or you move at some point in the future, you can’t access that course anymore, which frankly I think is bullshit. What happens if you move? You have to buy the course again. What about if you’re traveling for work? You can’t learn on the road? What if IP addresses change and the system thinks you’re from a country you’re not? I’ve found that if you treat people like they’re honest, that’s generally how they’re going to act. There are two challenges with maintaining a system like this. First is economies are constantly in flux.
The discount amounts change over time and sometimes countries that have discounts today might not in the future or vice versa. Manually checking the shifting data is annoying and I don’t do it all that often. I wish I did it more.
And if I don’t, they can give discounts to people who live in nearby but not the country they’re actually from discounts or not give them one at all when they should get one. For example, I once had a student from Bangladesh get a looks like you’re from India message and while the discount amounts were similar because of the political history between India and Bangladesh, it was not particularly well received. Despite these rough edges, I recommend location-based pricing for anyone who runs an education product business.
I’ve been able to teach students from all over the world in countries where I otherwise never have been able to reach them. It’s been an amazing experience and I just cannot recommend it enough.
Now, if you enjoyed this episode and this topic, you should head over to techeducatorschool.com where I’m putting together a bunch of resources on how to create and sell your own books, courses and workshops, including stuff like this. Enter your email address and you’ll get updates as the project moves forward, sneak peeks of stuff that’s in the works and more. Anyways, that’s it for today. I will see you next time. Cheers. | s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296819847.83/warc/CC-MAIN-20240424174709-20240424204709-00780.warc.gz | CC-MAIN-2024-18 | 11,414 | 35 |
https://github.com/agentzh/ngx_openresty/commits/v1.2.6.5 | code | … core 1.2.6 and 1.3.7 by default. see http://mailman.nginx.org/pipermail/nginx-devel/2013-January/003275.html for details.
…omic=DIR, --with-md5=DIR, and --with-sha1=DIR, the build system could not find DIR at all. thanks LazyZhu for reporting it in github issue #21.
…the error message "ngx_slab_alloc() failed: no memory" from "crit" to "info".
… upstream_next is in action, nginx might hang. thanks Kindy Lin for reporting this issue. | s3://commoncrawl/crawl-data/CC-MAIN-2014-10/segments/1394678704953/warc/CC-MAIN-20140313024504-00074-ip-10-183-142-35.ec2.internal.warc.gz | CC-MAIN-2014-10 | 446 | 4 |
http://www.sevenforums.com/612852-post3.html | code | Quote: Originally Posted by Lil' Domii
Since it is a permission error, there are two things you can try.
In the start menu search, type in 'UAC', and press enter.
Drag slider to the top.
Now try to start the service. If that fails, try my next method.
In the start menu search, type in 'cmd', and press 'Ctrl' + 'Shift' + 'Enter'.
Click yes if prompted.
Type in the command prompt
net user administrator /active:yes
and press enter.
Close the cmd window.
Log off, and you should now have a new profile. Click on it to log in.
(This account gives you the highest privileges)
Now try to start the Security Center service again.
If LilDomii's advice does not work, but it should. Bite the bullet do a quick system restore and you will be back in business. I wish you luck with either suggestion | s3://commoncrawl/crawl-data/CC-MAIN-2016-44/segments/1476988720760.76/warc/CC-MAIN-20161020183840-00368-ip-10-171-6-4.ec2.internal.warc.gz | CC-MAIN-2016-44 | 791 | 15 |
http://howto.gumph.org/content/pxe-boot-a-laptop/ | code | PXE Booting a LaptopTurn an old laptop with a pcmcia network card into a thin client instead of thowing it out. They make ideal thin clients, as they are small, low power and can run quietly.
Available OptionsMost modern laptops with built in network cards already have support for network booting (using PXE), but older laptops usually only support booting from either disk,cd or floppy. This means that even if a pcmcia card supported PXE (and I've not yet found one that does), there would be not way for the computer bios to use it.
This means we need to use software to do the PXE stuff for us, which means booting from a floppy,cd or hard drive and kicking off a PXE boot from there. The ideal solution is to replace the hard drive with a compact flash card in a compact-flash to 2.5" ide converter, which would give a reliable, silent and low power boot device.
Etherboot's best feature is the rom-o-matic service, which is a website that creates the software package for your network card for you, without you needing build it yourself, and even better, supports creating DOS .com files , which gives you much more control over the boot process. Unfortunately Etherboot does not support pcmcia cards, which makes it no use for booting a laptop.
Netboot works similarly to etherboot, but provides no automated build website, so you have to install the software (on linux) yourself in order to build the boot package. Also Netboot only supports building ROM files (of no use to us) and floppy disk images. Floppy disk images we can use, even from a hard disk. The best feature of netboot is that it is not limited to a short list of supported network cards, but will support any card for which there is either a packet driver, or dos driver available.
Unfortunately many newer pcmcia network cards don't bother with dos or packet drivers any more, but plenty of older ones do. In this example I'm using a Netgear FA 410TX for which there are packet drivers available.
Getting Started with NetbootYou will need a linux box to build the boot software, so if you don't have one, either find someone who does, or download a vmware linux appliance, or a copy of coLinux.
Download and install the netboot software. I had problems getting the latest version (0.10.1) to install, so I downloaded a previous version (0.9.8) instead, which installed fine.
./configure make make install
Once you've got it installed, you need to grab a copy of either the dos or packet driver for your pcmcia card. I'm using the packet driver, called
FA410.COM. Copy the file to the correct netboot driver directory - packet drivers go in
/usr/local/lib/netboot/netdrvr/pktdrvr and then run the
makerom command, which builds the floppy image as well as a rom file (which we ignore).
Bootrom configuration program, Version 0.9.8 (netboot) Copyright (C) 1995-2003 G. Kuhlmann
Build bootrom for a processor older than 386 (y/n) [no] ? n Include support for old-style menus (not recommended) (y/n) [no] ? n Do you want the BIOS to look for boot disks (y/n) [no] ? n Do you want the bootrom to ask before booting from network (y/n) [no] ? n
List of known network cards: (0) unknown card with user supplied driver (1) 3Com 3C501 Etherlink ISA
Press <ENTER> to continue listing
(130) SMC StarCard Plus/A (WD8003ST/A) MCA (131) Znyx ZX312/314 EtherAction PCI
Select a network card (-1 to review the list) [-1]: 0
Known network card bus types: (1) ISA bus (including PnP) (2) EISA bus (3) MCA bus (4) PCI bus Select the bus type of your network card : 1 Enter PnP device ID string (maybe empty):
The following network driver interfaces are available: (1) Packet Driver Interface (PD) (2) Network Driver Interface Specification (NDIS) (3) Universal Network Driver Interface (UNDI) Select the interface you wish to use : 1 Enter path of packet driver ('*' for directory listing): fa410.com Enter command line for packet driver [0x%S]: Enter minimum execution size in bytes (-1 = default) (decimal): -1 Enter maximum execution size in bytes (-1 = default) (decimal): -1 Do you want to use the packet driver debugger (y/n) [no] ? n Do you want to specify an additional program (y/n) [no] ? n
Available output file types for rom image: (1) Raw binary (2) Intel hex (3) Motorola hex (4) Tektronix hex (5) Image for programming a FlashCard across the network Select the format you wish to use : 1
# ls image.* image.flo image.rom #
You should now have two files, a floppy disk image, and a rom image. We are only interested in the floppy disk image. Copy the image onto a floppy drive
# dd if=image.flo of=/dev/fd0From windows you can use rawrite (or rawritent) to copy the image to a floppy. Now try booting the laptop with the floppy disk, to check it works. You should see it load the packet driver, and then send a dhcp request. Assuming you have a setup PXE server, then it should connect and run whatever PXE configuration you have set up.
Tweaking the bootOne of the annoying things about netboot, is that it destroys the formatting on the disk it's copied to, so you can't use the disk for anything else. However, there is a solution for this. In order to be able to use netboot easily from either a floppy or hard disk, we will turn the small image.flo into a proper floppy image, and then use syslinux and memdisk to boot the floppy image instead. Although this adds a couple of steps to the boot procedure, it means you can boot from a FAT partition on a floppy, hard drive, or compact flash disk, without destroying the rest of data.
Download a copy of syslinux and memdisk, and install syslinux onto a floppy initially (before we mess with your hard drive) and copy memdisk onto the floppy. In order for memdisk to recognise the
image.flo as a floppy image, we need to pad it out to the size of a small floppy. The smallest floppy memdisk recognises is 368,640 bytes. So look at the size of the image file, and see how short it is, and create a padding file to append to the end. In this example
image.flo is 27284 bytes long, so we need to pad 341,356 bytes to the end
# ls -l image.* -rw-r--r-- 1 root root 27284 Sep 30 08:21 image.flo -rw-r--r-- 1 root root 32768 Sep 30 08:21 image.rom # dd if=/dev/zero of=image.pad bs=341356 count=1 1+0 records in 1+0 records out # cat image.flo image.pad > image.img # ls -l image.* -rw-r--r-- 1 root root 27284 Sep 30 08:21 image.flo -rw-r--r-- 1 root root 368640 Sep 30 08:42 image.img -rw-r--r-- 1 root root 341356 Sep 30 08:42 image.pad -rw-r--r-- 1 root root 32768 Sep 30 08:21 image.rom #
Now configure the
SYSLINUX.CFG file on your floppy to get memdisk to load the floppy image
LABEL NETBOOT KERNEL memdisk APPEND initrd=image.img
Now copy the
image.img file onto the floppy, so assuming you installed syslinux onto the floppy, and copied on the files you shoud have the following on the floppy disk.
SYSLINUX.COM SYSLINUX.CFG MEMDISK IMAGE.IMGNow boot with this floppy, if it works, syslinux, will load memdisk, which will load the floppy image, which will start the packetdriver and initialise a PXE boot.
If it worked from the floppy, then you can install syslinux onto a FAT partition on your hard drive, and copy over the other files, and do a PXE boot from your hard drive. Or, buy a small compact flash card, and compact flash to 2.5" ide converter, and install the setup on that. | s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100551.17/warc/CC-MAIN-20231205105136-20231205135136-00578.warc.gz | CC-MAIN-2023-50 | 7,311 | 37 |
http://blogs.msdn.com/b/ianm/archive/2007/01/09/software-for-launch-event-attendees-physical-event.aspx?Redirected=true | code | A number of people have been asking the following quite reasonable question: We know that we're giving away 1000 copies of Windows Vista and Microsoft Office for the online launch event, but what about people who are attending the physical event at Thames Valley Park? Are they getting the software too?
Originally we weren't going to say anything about this because if we said "come to our event and we'll give you free software" it would fill with people who were not developers, and were just coming along for the software. However, as the event filled very quickly we can't see any harm now in telling people that yes, if you come to the physical event, we plan to give you a choice of Windows Vista or the 2007 Microsoft Office system - but not both.
Also note that you won't get the software on the day, instead we'll ship it to you at a later date. This is because we won't actually have the software by then rather than for any other (more nefarious) reason.
So hopefully this is good news for you whether you're attending physically or virtually :-)
And to all of those people who emailed me with this question: Thanks for asking the question and I'm pleased that I'm now able to tell you openly.
Thanks for the info :)
Don't suppose you know what version's we will be offered, as I was already planning on buying office 2007 Pro.
Much as I'd hate to put you off buying a copy....it will be Office 2007 Pro. Note though that we're not able to absolutely guarantee your first choice so you *could* end up getting Windows Vista even if you ask for Office. It's unlikely to be the case, but there is a possibility.
Also note that it will be a while until you get it, so if you need it quickly this option won't be ideal for you.
Ah ok, does that mean it will be Vista Ultimate offered to us? As I can't wait to get these two running together especially after some of the stuff showed in Bill G's CES keynote.
Yes it will be Windows Vista Ultimate
Can't wait to get down there! :)
You rock! we get both from MSDN at work, but it'll be nice to have my own boxed copy :)
How about those attending the coding day, but not the first launch day, do they get copies as well?
Hi Ben, yes if you're only attending day 2 you get the same option ie copy of either Windows Vista or Microsoft Office. If you attend both days you only get one copy however :-) seems only fair. | s3://commoncrawl/crawl-data/CC-MAIN-2016-07/segments/1454701962902.70/warc/CC-MAIN-20160205195242-00169-ip-10-236-182-209.ec2.internal.warc.gz | CC-MAIN-2016-07 | 2,368 | 15 |
https://www.python-blue.com/blog/archives/03-2014 | code | Well, been going through lots of personal issues, which are not worth delving into, up until recently; hence, the relative lack of music making. Good news is that I've resumed, one example being a new original track that I'm going as far as to give away for free.
My latest EP is finally available for preorder from Future 80s!
Well, felt it best to update this blog again, this time, with another YouTube video in anticipation of "An Alien World" being released on Future 80s this Friday.
While this track will not be included on the EP, that does not mean that it won't be available on Bandcamp later on.
I also have finished my own remix for an upcoming remix album based on the album "Roboblokk" by Blokkmonsta. More details will be made available once I know the remix album is ready.
Official blog of Python Blue. Expect updates about music, synthesizer reviews, and more. | s3://commoncrawl/crawl-data/CC-MAIN-2021-31/segments/1627046154805.72/warc/CC-MAIN-20210804111738-20210804141738-00178.warc.gz | CC-MAIN-2021-31 | 878 | 6 |
https://gr.pinterest.com/polyhronidou/ | code | Marbled Paperweight DIY. These pretty rainbow rocks are perfect for brightening up your desk! With just some nail polish and water, you can transform an ordinary rock into your own marbled paperweight.
By km !!
Could do smaller twine with seashells attached for Christmas ornaments
La Bottega delle Fate: Tutorial: water effect with hot glue
Γ΄- Δ΄ ΤΑΞΗ ΤΟΥ 5ΟΥ ΔΗΜ. ΣΧ. ΒΕΡΟΙΑΣ: ΠΩΣ ΚΑΝΟΥΜΕ ΔΙΑΙΡΕΣΗ ΜΕ ΔΙΨΗΦΙΟ ΔΙΑΙΡΕΤΗ
ΓΡΑΜΜΑΤΙΚΗ ΓΙΑ ΤΗ Γ & Δ ΤΑΞΗ
Pallet bar. Most efficient use, looks like two paver pallets, wood shelves, wood bar top.
The Prettiest Organizational Hacks for Every Room in Your Home via Brit + Co. | s3://commoncrawl/crawl-data/CC-MAIN-2017-34/segments/1502886102819.58/warc/CC-MAIN-20170817013033-20170817033033-00132.warc.gz | CC-MAIN-2017-34 | 698 | 8 |
http://www.tomshardware.com/forum/237681-50-linux-compatible-sata-expansion-cards | code | I am actively searching for a Linux compatible SATA2 expansion card for my home server.
No need for RAID chip (I use mdadm);
4 Ports: SATA2 (3Gbps) & backward compatible with SATA1 (1.5Gbps)
No eSATA or other external connectors
No firewire/USB/IDE (PATA) or anything else;
No cooling fans (only passive cooling i.e. heat sink)
Support HDD's up to 3TB
Seems to support Linux, has a "OK" rating (3/5), I have no experience with this brand (SYBA)... and some comments from reviewers are scary... Apparently a flaky chipset.
********************* Koutech IO-PSA420 32-bit PCI SATA II (3.0Gb/s) Controller Card http://www.newegg.ca/Product/Product...82E16816104006
Again, seems to support Linux (not specified which distro), has a good rating (4/5), I have no experience with this brand (Koutech)... and again, some comments from reviewers are scary. Biggest reported problem seems to be data corruption. Apparently a flaky chipset as well.
Overall, my only goad is to simply add at least 4 SATA2 ports to my server.... Nothing else, nothing more. No raid or other crap that will just eventually fail.
I am not "tied" to newegg. I can buy other brands and from some other suppliers. If anybody has experience and can recommend based on your experience, please let us know. I am willing to spend up to $100 for this card as long as I can rely on it. My use is not "mission critical" but I will use this card to RAID (Mdadm) 4 HDD together (2 RAID 1 arrays) and I cannot afford to lose data because of a flaky chipset or bad / unreliable expansion card.
Basically, it's just a matter of checking that the chipset that's on the card (for example, the SIL3124 for the first card) is supported by the version of Linux you plan on using (to avoid needing to doing something more complex like building a newer kernel). Also, getting feedback on the reliability of the chipset is important as well, but you seem to be on top of that.
Until the Vantec card I purchased catch file and let me down (lets hope it wont happen), I think this is case solved.
I purchased a Vantec 6 ports SATA2 card (2 eSATA & 4 SATA2) and seems to work fine in Linux. No errors or strange messages in dmesg or kernel messages and seems to support hotplug (from 5.25 Vantec bays)
The cards that came with my 3TB WD Green drives work fine. Linux doesn't seem to know what it is (just says SATA controller: Device 1b4b:9125 (rev 11)), but I think the BIOS describes it as some kind of PCIe RocketRAID card when booting.
Edit: it's probably this one, which actually appears to be SATA3: | s3://commoncrawl/crawl-data/CC-MAIN-2014-23/segments/1404776435471.2/warc/CC-MAIN-20140707234035-00064-ip-10-180-212-248.ec2.internal.warc.gz | CC-MAIN-2014-23 | 2,547 | 17 |
https://forum.nomachine.com/topic/multiple-monitors-on-server-ubuntu-and-client-windows | code | I tried full screen on all monitors but that just stretched the current display across the 2 monitors in a very non-useful way. Is this possible with the free version?
The feature you need is planned. It will allow multi-monitors on the server side to be treated as separate windows on multiple monitors on the client side. In each of theses separate windows it will be possible to pply all the usual settings, like applying a different scaling factor, resizing the window to any size, sending the window to fullscreen and placing the window in any desired location. This will apply to connections to the physical desktop and to virtual desktops/custom sessions. The latter are available only in the Enterprise products.
In the current version it’s possible for virtual desktop sessions (Enterprise products only) to be spanned on all monitors or to a specific monitor. | s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296950247.65/warc/CC-MAIN-20230401191131-20230401221131-00407.warc.gz | CC-MAIN-2023-14 | 871 | 3 |
https://ellipsesolutions.com/community-summit-party/ | code | Summit '23 VIP Happy Hour for the Microsoft Dynamics User Group Community!
Will you be in Charlotte for this year's UG Summit? Don't miss out on this exclusive VIP Happy Hour for the Microsoft Dynamics user community!
The party will begin following Thursday night's expo, and will run from 7:00PM - 9:00PM ET. Come join us for fun conversation, refreshing cocktails, and valuable networking with your fellow Microsoft Dynamics users! | s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947474360.86/warc/CC-MAIN-20240223021632-20240223051632-00177.warc.gz | CC-MAIN-2024-10 | 433 | 3 |
http://mathforum.org/library/drmath/view/54285.html | code | Primes That Are the Sum of 2 Squares
Date: 09/17/1999 at 11:07:53 From: Blake Jennelle Subject: Proof - primes as the sum of squares I am unable to prove that every prime of the form 4m + 1 can be expressed as a sum of two squares. Can you offer any assistance?
Date: 09/18/1999 at 07:43:55 From: Doctor Floor Subject: Re: Proof - primes as the sum of squares Hi, Blake, Thanks for your question. We have to prove that if a prime number p == 1 (mod 4), then it can be written as the sum of two squares. Let's assume that p > 5, or consequently that p >= 13. We can do this because we know that 5 = 1^2 + 2^2. Because p == 1 (mod 4), -1 is a quadratic residue modulo p. And thus there is a number x such that x^2 == -1 (mod p). We fix this x. I assume you know this fact. If not, ask us for more explanation. Now consider the set of t such that: 1. t == ax (mod p) for a = 0, 1 , ..., N; where N = floor(sqrt(p)) 2. 0 <= t <= p-1 Here floor(n) is the integer part of n. So for example, floor(2.9) = 2, floor(pi) = 3 and floor(sqrt(2)) = 1. Then there are N+1 elements of this set. So if we divide the interval [0,p-1], in which all elements of the set are found, into N parts, there must be one of the parts that contains two elements. And those elements must be less than (p-1)/N, the length of the interval, apart. So we can find two numbers a < b < N, represented in the above set by v, w in [0,pi-1] such that v == ax (mod p) and w == bx (mod p), and the following holds: distance(v,w) < (p-1)/N < (p-1)/(sqrt(p)-1) = sqrt(p) + 1 ... Let c = b-a. Since a,b < N we have that 0 < c < sqrt(p). And in the residue class cx (mod p) there must be an element d in the interval [-sqrt(p)-1,sqrt(p)+1] because of . We find: c^2 + d^2 == c^2 + (cx)^2 == c^2(1+x^2) == 0 (mod p) The last step follows from x^2 == -1 (mod p). So c^2 + d^2 is divisible by p. But we have also found that |c| < sqrt(p) and |d| < sqrt(p) + 1 So c^2 + d^2 < p + p + 2sqrt(p) + 1 < 3p (since p >= 13) So either c^2 + d^2 = p, and we are done, or c^2 + d^2 = 2p. But, if c^2 + d^2 = 2p, then c and d are both odd or both even, and we find that ((c-d)/2)^2 + ((c+d)/2)^2 = (c^2+d^2)/2 = p does the job. And the theorem, first stated by Fermat, is proven. If you need more help, just write us back. Best regards, - Doctor Floor, The Math Forum http://mathforum.org/dr.math/
Search the Dr. Math Library:
Ask Dr. MathTM
© 1994- The Math Forum at NCTM. All rights reserved. | s3://commoncrawl/crawl-data/CC-MAIN-2018-05/segments/1516084889798.67/warc/CC-MAIN-20180121001412-20180121021412-00479.warc.gz | CC-MAIN-2018-05 | 2,437 | 6 |
https://community.broadcom.com/mainframesoftware/communities/all-discussions/viewthread?GroupId=1969&MID=805875&CommunityKey=b1472505-bd98-47a6-aed7-a494d48fc3ab&tab=digestviewer | code | I am part way through installing maintenance on a sandbox CV. I want to see if I have actually made any changes to my SYSGEN. I know there is a DCMT V DMCL VALIDATE and wondered if there was a similar command for SYSGEN (and DBTABLE).
I don't see such a command for SYSGEN but I see I can do DCMT D SYSGEN LINES, PROGRAMS, and STORAGE to see what has been change AND GENERATED since the last restart. Is this similar to the DMCL VALIDATE where the DMCL changes are not yet 'running' on my system yet? Or does the DISPLAY SYSGEN LINES show what is already active on my system even though I have not restarted the CV? Is there a way to see the changes made to the SYSGEN that have not yet been GENERATED?
Unfortunately at this time there isn't the functionality to do this.
An idea has been posted here to develop this functionality and it is currently under review. You may want to up vote it.
- Stephen Franzon
In batch there is a validate:
//SYSIPT DD *
MOD SYS 23.
But it will only point out errors
Technology Architect, Database Infrastructure Services
Technology Solution Services
123 East Main Street
Louisville, KY 40202
(502) 476-2538 or 407-7266
Excellent. 2015 predates my IDMS days, but it looks like I had up-voted that idea anyway. I'm not surprised that I had forgotten it had already been suggested. | s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104249664.70/warc/CC-MAIN-20220703195118-20220703225118-00162.warc.gz | CC-MAIN-2022-27 | 1,313 | 15 |
https://www.redmine.org/issues/6177 | code | "bignum too big to convert into `long'" in migrate_from_trac.rake
When importing from a sqlite3 trac database, I have tons of those issues, which the patch fixes.
Maybe this only happens for people using sqlite3 so the patch may need some cleanup but at least it's there.
diff was generated with `diff -u` on the redmine-1.0.0 release (but the file didn't change since 0.9)
Updated by Michalis Miatidis over 12 years ago
Beware that it is duplicate with #5764
Updated by Toshi MARUYAMA about 12 years ago
- Category set to Importers | s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296949107.48/warc/CC-MAIN-20230330070451-20230330100451-00628.warc.gz | CC-MAIN-2023-14 | 532 | 8 |
https://www.vcdx181.com/blogs/category/CloudNativeApplications/ | code | VMware Cloud Assembly - AWS Native Objects
With Cloud Assembly, VMware has grown from focusing on Virtual Machine only deployments to now providing the capability of interacting with Cloud Native primitives in Public Cloud. We’ve traded out our monolithic blueprints for Infrastructure as Code, and are embracing Multi-Cloud. Watch this video to see how we can take a standard deployment, and turn it cloud native by introducing Amazon EC2, Route 53 for DNS, and S3 for object storage. This is VMware Cloud Automation Services, Cloud Assembly - Re:invent edition! | s3://commoncrawl/crawl-data/CC-MAIN-2019-04/segments/1547583656665.34/warc/CC-MAIN-20190116031807-20190116053807-00473.warc.gz | CC-MAIN-2019-04 | 565 | 2 |
https://ocaml.janestreet.com/ocaml-core/108.00.02/doc/async_extra/ | code | finalize f x is like
Gc.finalise f x, except that the finalizer is guaranteed to
run as an Async job (i.e.
File_replaced occurs if the inode of the file changed and the file tail was
ignore_inode_change = false.
create file opens
file, creating it if it doesn't exist.
create ?message path tries to create a file at
path containing the text
pid if none provided.
Implements a value that is either in a file, or in memory, but not both.
A library for building asynchronous RPC-style protocols.
with_connection ~host ~port f looks up host from a string (using DNS as needed),
connects, then calls
f passing in a reader and a writer for the connected socket.
serve ~port () must be called before clients will be able to connect.
Unpack_sequence implements a way to take an
unpack_one function that can unpack a
value from a character buffer, and use it to unpack a sequence of packed values
coming via a string pipe into a pipe of upacked values.
Infrastructure code for managing RPCs which evolve over time to use different types at different versions
This module describes the type of a given direction of message flow. | s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947474690.22/warc/CC-MAIN-20240228012542-20240228042542-00571.warc.gz | CC-MAIN-2024-10 | 1,118 | 22 |
https://wordpress.org/support/topic/4th-featured-page/ | code | Support » Theme: Customizr » 4th featured page ?
2 years, 10 months ago
I was looking for it but I found 4 months old topics with no solution ?
I saw some websites with 4 featured pages… Is there any PHP code for adding it ?
Of course you can do it, the code source is open.
Probably if you saw those sites is ’cause they bought the plug-in for featured pages unlimited. | s3://commoncrawl/crawl-data/CC-MAIN-2017-09/segments/1487501171706.94/warc/CC-MAIN-20170219104611-00238-ip-10-171-10-108.ec2.internal.warc.gz | CC-MAIN-2017-09 | 376 | 6 |
https://www.xcede.com/job/data-engineer-31/ | code | £75000 - £80000 per annum
*Strong commercial experience with Data Warehousing.
*Strong commercial experience and exposure to Microsoft BI Stack (Azure SQL, Azure Data Lake & Azure Data Factory)
*Good commercial experience coding in Python and SQL.
*Commercial experience of Big Data Architecture.
If you are interested in this or other BI Development/Data Engineering roles, please contact Ross Wiltshire on [email protected] - +44 (0)2033019903 | s3://commoncrawl/crawl-data/CC-MAIN-2020-10/segments/1581875145897.19/warc/CC-MAIN-20200224040929-20200224070929-00316.warc.gz | CC-MAIN-2020-10 | 456 | 6 |
https://community.clearlinux.org/t/considering-clear-linux-for-a-production-server-vps/8350 | code | Hi there, I’m working on a project that requires selecting a bunch of rows with (slow)
LEFT JOIN calls from a large database and importing them into a different database. I’m running it on a very powerful VPS, but it’s still taking longer than I expected. So I’ve been looking at improving the raw performance. I’ve been testing this project with a Debian 11 host OS, and it basically just works and performance is acceptable, but still feels like it could be improved. So based on some of the Phoronix reviews that show Clear Linux pulling way ahead of other distros in pure raw computational speed I decided to give it a shot, and sure enough it’s running between 5% - 10% faster for the same tasks, which should shave off several hours from the time it will take to run the production database migration.
I’m used to the traditional server administration model of carefully configuring and tuning each and every aspect of the underlying OS and the server application stack, and for that usage scenario I preferred openSUSE Leap or Debian. But now the application I’m going to deploy mainly supports Docker deployments, so the versions and selection of available packages for the host OS aren’t really important. It just needs to have Docker and
docker-compose available in the main repos, as I don’t want to depend on Docker’s add-on repos. I like that the Clear Linux core is small and focused, it uses a clean “stateless” system design with the only files in
/etc/ being what the administrator has changed from the defaults in
/usr/ . The Clear Linux project seems to be serious about security, and automatic updates can be enabled. It has a sane and secure SSH policy out-of-the-box. Reboots are amazingly fast, taking just seconds. I like it enough to consider using Clear Linux on a production VPS that will host a Dockerized web app.
How many of you here are running Clear Linux on a production server workload? Any major pros and/or cons? Thanks! | s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764499468.22/warc/CC-MAIN-20230127231443-20230128021443-00279.warc.gz | CC-MAIN-2023-06 | 1,982 | 7 |
https://docs.wingarc.com.au/superstar/9.15/resource-considerations | code | When updating large databases you need to consider the following issues:
You need to make sure there is enough memory available to avoid running out of memory.
When using the 32 bit Java Virtual Machine, the maximum memory size available to SuperCHANNEL on Windows is approximately 1.6 GB.
|Paging can affect the database performance. If paging occurs then decrease the caching block size. For more information on the caching block size, use the sxv4drv.conf configuration file to set the cache size.
When working with large databases it is important that disk utilisation is efficient. It is recommended you use a tool to monitor the disk access.
You may need to configure the commit points for your database (see below).
Using Commit Points
Commit points specify the number of records channelled before changes are committed to the target database.
An interrupted build process can be recovered using specified commit points. You can also resume channelling from the last committed record.
Commit points affect the disk utilisation:
- More commit points allow better disk utilisation.
- When updating records, use commit points to decrease disk fragmentation.
- If you set the commit to a non-optimum size, the JVM will run out of memory.
- After the first update, keep the commit points value setting the same so that disk utilisation will remain the same.
- A table sorted by key does not require commit points.
To calculate the number of commits you need to consider the following:
- Number of records to be updated.
- Number of records to be channelled before the commit is performed.
CommitPoints = UpdateRecords / ChannelledRecords
30 = 150,000/5,000 | s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296816893.19/warc/CC-MAIN-20240414161724-20240414191724-00546.warc.gz | CC-MAIN-2024-18 | 1,658 | 20 |
http://www.geekstogo.com/forum/topic/286795-ms-works-suite-home-publishing-program/ | code | I wonder if anyone can help me with this. I have MS Works Suite with Home Publishing and have several files like labels, cards and flyers in .php format which for some reason will no longer print. I get an error message - A PRINTER IS NOT INSTALLED TO THIS COMPUTER. Up until a few weeks ago I could print them out from the program OK, but no more. Although everything else prints OK, i.e. Word and Excel without any problems. I have uninstalled and re-installed the program several times and have done the same for the printer which is a Canon IP4500 series. Has anyone had a similar problem, or offer any advice please.
Many thanks, Bill K | s3://commoncrawl/crawl-data/CC-MAIN-2018-22/segments/1526794870771.86/warc/CC-MAIN-20180528024807-20180528044807-00436.warc.gz | CC-MAIN-2018-22 | 641 | 2 |
https://heartsintohome.com/bluehost-john-crestani/ | code | Bluehost John Crestani
Finding a top quality cheap webhosting service provider isn’t very easy. Every web site will have different requirements from a host. Plus, you have to compare all the functions of a hosting firm, all while seeking the most effective deal possible.
This can be a great deal to type via, especially if this is your very first time acquiring holding, or building a website.
A lot of hosts will supply incredibly low-cost introductory pricing, just to raise those rates 2 or 3 times greater once your first contact is up. Some hosts will certainly supply free bonuses when you subscribe, such as a free domain name, or a complimentary SSL certificate.
While some hosts will certainly be able to provide far better performance and high levels of safety and security. Bluehost John Crestani
Listed below we dive deep right into the most effective low-cost webhosting plans out there. You’ll learn what core holding attributes are essential in a host as well as exactly how to examine your very own hosting requirements to make sure that you can choose from one of the most effective cheap holding suppliers listed below.
Disclosure: When you buy a host bundle via web links on this web page, we earn some commission. This helps us to keep this site running. There are no extra costs to you in all by using our links. The list below is of the very best affordable webhosting packages that I’ve directly made use of as well as checked.
What We Think about To Be Cheap Web Hosting
When we define a web hosting plan as being “Economical” or “Budget” what we imply is hosting that falls under the rate bracket in between $0.80 to $4 monthly. Whilst looking into inexpensive holding suppliers for this overview, we looked at over 100 various hosts that fell into that price variety. We then analyzed the quality of their most inexpensive holding package, worth for money and client service.
In this write-up, I’ll be reviewing this first-rate site hosting firm as well as stick in as much pertinent info as possible.
I’ll look at the functions, the pricing alternatives, and anything else I can think about that I assume might be of benefit, if you’re determining to subscribe to Bluhost and also obtain your internet sites up and running.
So without further ado, allow’s check it out.
Bluehost is among the biggest webhosting firms on the planet, getting both large advertising support from the company itself and associate marketing professionals that promote it.
It actually is a huge firm, that has been around for a very long time, has a big reputation, and also is definitely among the top options when it concerns web hosting (certainly within the leading 3, at the very least in my publication).
But what is it precisely, and also should you obtain its solutions?
Today, I will certainly answer all there is you require to know, offered that you are a blog writer or a business owner who is searching for a web host, and also doesn’t know where to get started, considering that it’s a great service for that audience in general.
Allow’s picture, you want to organize your websites and also make them visible. Okay?
You already have your domain (which is your website location or URL) and now you wish to “transform the lights on”. Bluehost John Crestani
You require some hosting…
To achieve every one of this, and also to make your internet site noticeable, you need what is called a “server”. A server is a black box, or device, that stores all your web site data (data such as pictures, texts, video clips, web links, plugins, and also various other details).
Now, this web server, needs to be on constantly and also it has to be linked to the web 100% of the time (I’ll be pointing out something called “downtime” later).
In addition, it likewise needs (without obtaining also elegant and right into details) a file transfer protocol commonly referred to as FTP, so it can show web internet browsers your website in its desired type.
All these points are either expensive, or call for a high level of technological skill (or both), to create and maintain. And also you can absolutely go out there and also discover these points by yourself as well as set them up … however what concerning instead of you buying and also maintaining one … why not just “renting out hosting” rather?
This is where Bluehost comes in. You rent their web servers (called Shared Hosting) and you launch a site using those web servers.
Because Bluehost keeps all your files, the company also enables you to set up your web content administration systems (CMS, for short) such as WordPress for you. WordPress is an extremely preferred CMS … so it just makes sense to have that choice offered (virtually every holding business now has this alternative also).
In other words, you no more need to set-up a web server and after that integrate a software program where you can construct your web content, independently. It is already rolled into one package.
Well … envision if your web server remains in your house. If anything were to take place to it in any way, all your documents are gone. If something fails with its inner processes, you need a specialist to repair it. If something overheats, or breaks down or gets corrupted … that’s no good!
Bluehost takes all these problems away, and also takes care of everything technical: Pay your server “rent”, and also they will look after every little thing. And also once you acquire the service, you can then begin concentrating on including content to your website, or you can place your effort into your marketing projects.
What Services Do You Receive From Bluehost?
Bluehost provides a myriad of different services, however the main one is hosting of course.
The hosting itself, is of different types by the way. You can rent a common server, have a specialized server, or likewise a virtualexclusive web server.
For the purpose of this Bluehost evaluation, we will concentrate on holding solutions and also various other solutions, that a blog writer or an on-line entrepreneur would need, rather than go unfathomable right into the bunny opening and also talk about the various other solutions, that are targeted at even more experienced people.
- WordPress, WordPress PRO, as well as shopping— these hosting services are the plans that permit you to host a web site making use of WordPress as well as WooCommerce (the latter of which permits you to do e-commerce). After purchasing any one of these plans, you can begin constructing your site with WordPress as your CMS.
- Domain name Industry— you can likewise acquire your domain name from Bluehost rather than other domain name registrars. Doing so will make it less complicated to direct your domain to your host’s name servers, given that you’re making use of the very same marketplace.
- Email— when you have acquired your domain name, it makes good sense to additionally obtain an email address connected to it. As a blog writer or on the internet entrepreneur, you should virtually never make use of a complimentary email solution, like Yahoo! or Gmail. An e-mail similar to this makes you look less than professional. Thankfully, Bluehost provides you one completely free with your domain.
Bluehost also provides specialized web servers.
As well as you may be asking …” What is a devoted web server anyway?”.
Well, the important things is, the standard webhosting bundles of Bluehost can only a lot website traffic for your site, after which you’ll require to upgrade your holding. The reason being is that the usual servers, are shared.
What this implies is that web server can be servicing 2 or even more internet sites, at the same time, one of which can be yours.
What does this mean for you?
It indicates that the single server’s resources are shared, and also it is doing multiple jobs at any kind of given time. When your website starts to strike 100,000 site check outs each month, you are going to require a dedicated server which you can additionally receive from Bluehost for a minimum of $79.99 monthly.
This is not something yous should worry about when you’re starting however you should maintain it in mind for certain.
Bluehost Pricing: How Much Does It Cost?
In this Bluehost testimonial, I’ll be focusing my interest mainly on the Bluehost WordPress Hosting bundles, because it’s one of the most prominent one, and highly likely the one that you’re looking for and that will certainly fit you the most effective (unless you’re a big brand, business or site).
The three readily available plans, are as complies with:
- Standard Plan– $2.95 monthly/ $7.99 normal cost
- Plus Strategy– $5.45 per month/ $10.99 routine price
- Selection Plus Plan– $5.45 per month/ $14.99 regular price
The first price you see is the rate you pay upon join, and also the second rate is what the expense is, after the very first year of being with the company.
So essentially, Bluehost is going to bill you on a yearly basis. As well as you can also choose the quantity of years you want to hold your site on them with. Bluehost John Crestani
If you choose the Basic plan, you will certainly pay $2.95 x 12 = $35.40 beginning today and by the time you enter your 13th month, you will currently pay $7.99 per month, which is additionally billed each year. If that makes any type of sense.
If you are serious about your site, you ought to 100% get the three-year alternative. This suggests that for the fundamental strategy, you will certainly pay $2.95 x 36 months = $106.2.
By the time you strike your 4th year, that is the only time you will pay $7.99 per month. If you think about it, this method will conserve you $120 throughout three years. It’s very little, however it’s still something.
If you wish to obtain more than one site (which I extremely advise, and if you’re major, you’ll probably be obtaining more eventually in time) you’ll wish to utilize the option plus plan. It’ll enable you to host unrestricted sites.
What Does Each Plan Deal?
So, when it comes to WordPress organizing strategies (which are similar to the shared organizing plans, however are extra tailored towards WordPress, which is what we’ll be focusing on) the attributes are as complies with:
For the Standard plan, you get:
- One site just
- Guaranteed web site by means of SSL certificate
- Maximum of 50GB of storage space
- Totally free domain for a year
- $ 200 marketing credit
Keep in mind that the domain names are purchased individually from the holding. You can get a cost-free domain name with Bluehost here.
For both the Bluehost Plus hosting and also Choice Plus, you obtain the following:
- Limitless number of internet sites
- Free SSL Certification. Bluehost John Crestani
- No storage or transmission capacity restriction
- Cost-free domain name for one year
- $ 200 advertising and marketing credit report
- 1 Office 365 Mail box that is complimentary for 30 days
The Choice Plus strategy has an included benefit of Code Guard Basic Alternative, a back-up system where your documents is conserved and replicated. If any type of crash happens and also your site information disappears, you can restore it to its original form with this feature.
Notice that even though both strategies set you back the same, the Selection Strategy then defaults to $14.99 each month, normal price, after the set amount of years you have actually chosen.
What Are The Advantages Of Using Bluehost
So, why choose Bluehost over other web hosting services? There are thousands of webhosting, much of which are resellers, but Bluehost is one select couple of that have actually stood the test of time, and also it’s possibly the most popular available (and completely factors).
Below are the three primary advantages of choosing Bluehost as your host company:
- Web server uptime— your internet site will not show up if your host is down; Bluehost has more than 99% uptime. This is very crucial when it concerns Google Search Engine Optimization and positions. The higher the much better.
- Bluehost rate— how your web server feedback identifies how quick your internet site reveals on a web browser; Bluehost is lighting quick, which indicates you will decrease your bounce rate. Albeit not the very best when it involves filling rate it’s still widely essential to have a rapid speed, to make individual experience far better and better your position.
- Endless storage space— if you obtain the Plus strategy, you need not worry about the amount of data you keep such as video clips– your storage space capability is endless. This is really crucial, because you’ll probably face some storage issues later on down the tracks, as well as you do not want this to be a problem … ever before.
Lastly, consumer assistance is 24/7, which suggests no matter where you are in the globe, you can get in touch with the support team to repair your web site concerns. Pretty standard nowadays, but we’re taking this for approved … it’s likewise really essential. Bluehost John Crestani
Additionally, if you’ve gotten a totally free domain name with them, then there will certainly be a $15.99 charge that will certainly be deducted from the quantity you originally purchased (I picture this is because it type of takes the “domain name out of the market”, not sure concerning this, however there probably is a hard-cost for registering it).
Last but not least, any demands after 30 days for a refund … are void (although in all sincerity … they need to possibly be rigorous here).
So as you see, this isn’t always a “no doubt asked” plan, like with some of the various other holding options around, so be sure you’re alright with the plans prior to proceeding with the organizing. | s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964363157.32/warc/CC-MAIN-20211205100135-20211205130135-00499.warc.gz | CC-MAIN-2021-49 | 13,809 | 82 |
http://bjdixon.com/posts/django-apps-and-extensions-for-all-occasions/ | code | A collection of my notes. Provided as is with no warranty of any kind expressed or implied.
I've used most of these and the others are highly recommended. I'll be using them when the need arises. Pretty much I update this list as I find better alternatives or discover new gems.
The descriptions are mostly not mine, but provide a good reminder for use-cases.
django-debug-toolbar: Gives you a running toolbar on all your pages when in development showing static contents, templates, context and a variety of other really cool things. Removes the need to debug from terminal.
django-mptt: Efficient DB storage and retrieval of hierarchical data. e.g. modelling nested sections of a website, navigation trees, or any other parent-child relationships.
django-fsm: Manage state and transitions, safely and effectively. Great for workflows. Any time you find yourself using boolean fields that are dependant and mutually exclusive, you probably need a state field.
django-crispy-forms: simple things like adding the necessary markup for bootstrap to forms is super-boring otherwise ; in general, it helps with custom form layout, which is usually a template maintenance hell
django-rest-framework: for making REST APIs - more customizable than tastypie
django-secure: to help improve any django project's security in a very simple way.
django-remote-forms: for working with django's forms in a purely RESTful way.
django-haystack: makes search really easy.
django-allauth: deals with a lot of the authentication flow for you, and supports a lot of oauth providers.
django-oauth2-provider: for easy-to-configure Oauth2 authentication in django. works nicely with tastypie and djangorestframework as an added bonus
django-taggit: a django tagging app and the autosuggest works with it to auto suggest tags that have already been used previously when you start typing.
django-braces: nice set of mixins. I'm pretty sure you have already written something similar, but these are better.
django mailer: provides a backend for sending email (EMAIL_BACKEND) which stores emails in a queue in the database, to be sent out later from a cronjob using your actual email backend.
Fabric: Run tests before committing
sorl-thumbnail: Makes it easy to process images and display thumbnails.
celery: this once was a django extension, but is still nice for delayed tasks.
selenium: for functional testing
http://www.reddit.com/r/django/comments/1ypfre/ask_rdjango_what_are_your_favourite_extensions/ https://news.ycombinator.com/item?id=7030994 Two Scoops of Django | s3://commoncrawl/crawl-data/CC-MAIN-2020-10/segments/1581875145676.44/warc/CC-MAIN-20200222115524-20200222145524-00430.warc.gz | CC-MAIN-2020-10 | 2,544 | 21 |
https://forum.framework7.io/t/preloader-dialogs-not-being-destroyed-and-prevent-click-interaction-with-elements-in-dom-behind-them/15113 | code | I am having this issue constantly: the preloaders dialogs are not correctly destroyed, and end up blocking dom elements “behind” them.
In this example we can not click anything behind them
I am using them natively
and then f7.dialog.close();
By the documentation, they are supossedly destroyed automatically, but doesn’t seem so.
I tried setting to true the ‘destroyPredefinedDialogs’ property in the dialog object at initialization, with no luck.
can not replicate it, you can even try it in Kitchen sink by calling in browser console:
so it seems maybe you are doing something else with it?
you can also just
to remove element from DOM
This did it. I have to call it after closing it.
There is something else going on for sure, I doesn’t always happen. I think it’s when the async call is too fast, and the f7.dialog.preloader(‘message’) and f7.dialog.close() are called almost immediately | s3://commoncrawl/crawl-data/CC-MAIN-2022-21/segments/1652663048462.97/warc/CC-MAIN-20220529072915-20220529102915-00151.warc.gz | CC-MAIN-2022-21 | 909 | 12 |
https://azure.microsoft.com/en-au/resources/templates/?resourceType=Microsoft.Eventhub | code | Azure Quickstart Templates
Deploy Azure resources through the Azure Resource Manager with community contributed templates to get more done. Deploy, learn, fork and contribute back.
What is Azure Resource Manager
Azure Resource Manager allows you to provision your applications using a declarative template. In a single template, you can deploy multiple services along with their dependencies. You use the same template to repeatedly deploy your application during every stage of the application lifecycle.
Showing all 20 templates. Refine results with search.
Creates an Azure storage account with ADLS Gen 2 enabled, an Azure Data Factory instance with linked services for the storage account (an the Azure SQL Database if deployed), and an Azure Databricks instance. The AAD identity for the user deploying the template and the managed identity for the ADF instance will be granted the Storage Blob Data Contributor role on the storage account. There are also options to deploy an Azure Key Vault instance, an Azure SQL Database, and an Azure Event Hub (for streaming use cases). When an Azure Key Vault is deployed, the data factory managed identity and the AAD identity for the user deploying the template will be granted the Key Vault Secrets User role.
The MedTech service is an optional service of the Azure Health Data Services designed to ingest health data from multiple and disparate Internet of Medical Things (IoMT) devices and normalizes, groups, transforms, and persists device health data in the Fast Healthcare Interoperability Resources (FHIR®) service within an Azure Health Data Services workspace.
This template enables you to deploy an Event Hubs Standard namespace, an Event Hub, and a consumer group.
This template enables you to create EventHubs Cluster, namespace and eventhub in cluster
This template enables you to create EventHubs Cluster and a namespace in cluster
Deploy Azure Data Explorer db with Event Hub connection.
This template allows you to deploy SQL MI and additional resources used for storing logs and metrics (diagnostic workspace, storage account, event hub).
This template enables you to deploy a EventHubs Standard namespace, an Event Hub, a consumer group and authorizationRules
This template enables you to deploy a Service Bus namespace with a Basic/Standard SKU.
This template enables you to deploy a Time Series Insights environment that is configured to consume events from an Event Hub.
The PubNub Realtime Gateway for Azure provides a realtime data stream bridge between the PubNub Data Stream Network and Azure Event Hubs. -- consider it a bi-directional bridge between PubNub and Azure!
This template enables you to deploy a Event Hubs Standard namespace with Virtual Network rule
This template enables you to deploy a Service Bus Premium namespace with IP Filter rule
This template enables you to deploy an Event Hubs Standard namespace, an Event Hub, and a consumer group.This template also turns on the auto-inflate feature on your namespace.
This sample shows how to use configure a virtual network and private DNS zone to access a Event Hubs namespace via a private endpoint.
This template allows you to deploy an Azure SQL server with Auditing enabled to write audit logs to Event Hub | s3://commoncrawl/crawl-data/CC-MAIN-2022-40/segments/1664030337803.86/warc/CC-MAIN-20221006092601-20221006122601-00325.warc.gz | CC-MAIN-2022-40 | 3,248 | 21 |
https://www.roblox.com/groups/group.aspx?gid=2627479 | code | A community of growing developers which would like to achieve our end goal of improving their skills and selling their work to other users in a safe environment. Also, our DC is a partnered server.
[DC Code]: "HD"
Send an application: https://twitter.com/HiddenDevs/status/961208808860213248
Google "Hidden Developers" and our site will come up.
Follow us and keep in touch on our Twitter!
All Staff Members:
Our weekly blogs:
Get involved in our events:
> Group Founded 21st of July 2015, 12:23 pm
Hidden Developers © 2018
Groups have the ability to create and sell official shirts, pants, and t-shirts! All revenue goes to group funds.
Are you sure you want to exile this user?
They will also be kicked from the Clan.
Also delete all posts by this user. (Please allow some time.)
Check Remember my choice and click in the dialog box above to join games faster in the future! | s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376825123.5/warc/CC-MAIN-20181214001053-20181214022553-00082.warc.gz | CC-MAIN-2018-51 | 877 | 15 |
https://simonwillison.net/2008/Jun/24/tailor/ | code | Tailor. “Tailor is a tool to migrate or replicate changesets between ArX, Bazaar, Bazaar-NG, CVS, Codeville, Darcs, Git, Mercurial, Monotone, Subversion and Tla repositories.”—written in Python.
- Weeknotes: Embeddings, more embeddings and Datasette Cloud - 17th September 2023
- Build an image search engine with llm-clip, chat with models with llm chat - 12th September 2023
- LLM now provides tools for working with embeddings - 4th September 2023
- Datasette 1.0a4 and 1.0a5, plus weeknotes - 30th August 2023
- Making Large Language Models work for you - 27th August 2023
- Datasette Cloud, Datasette 1.0a3, llm-mlc and more - 16th August 2023 | s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233506669.30/warc/CC-MAIN-20230924191454-20230924221454-00645.warc.gz | CC-MAIN-2023-40 | 654 | 7 |
https://conted.ox.ac.uk/tutors/20635 | code | She holds a Master's degree in Linguistics from Ca’ Foscari University of Venice, where she focused on theoretical linguistics, generative grammar, philology and cognitive linguistics, and started specializing in computational linguistics. After completing her studies Giulia moved to London where she has been working as a Document Automation Specialist at WallStreetDocs for over 2 years.
At WallStreetDocs, Giulia started specializing in coding and working as a PHP developer, and she’s currently involved in researching AI applications for document automation, translation and data extraction. She divides her time between London and Italy, where she manages the Italian team of Document Automation Specialists.
Her personal interests and research focus on Cognitive Linguistics and Neurolinguistics (specifically AI applications in the analysis of the cognitive activity involved in language processing, with a focus on syntactic processing within the framework of generative grammar, and categorization, diagnosis and treatment of language disorders) and Computational Philology.
She is implementing these models in Python and GPT-3 in applications that need multimodal analysis. | s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296816734.69/warc/CC-MAIN-20240413114018-20240413144018-00305.warc.gz | CC-MAIN-2024-18 | 1,189 | 4 |
http://nluacademiccomputing.blogspot.com/2010/08/action-mapping-what-is-it.html | code | Cathy Moore is the original author and owner of this concept. She explores the complexity of instructional problems and presents a holistic approach to designing instructional goals and activities for learning. Although her presentation uses the language and ID methodology for business, you will easily understand her intuitive design concepts for getting to the root of the learning problem.
Action Mapping Explained
To get a full perspective on Action Mapping Ms. Moore has provided a wonderful resource on her web site at http://blog.cathy-moore.com/2008/05/be-an-elearning-action-hero/ you can also view a short video clip where Cathy distills the process down to a more concise description here http://www.youtube.com/watch?v=azr2OFw6Woo .
Action Mapping is one way to brainstorm the activities and content that you want to include in your training without a lot of development expense. In terms of Instructional Design, this is typically a process for creating a design document.
The Traditional Course Design Process
This solution is called a design document; a road map describing an instructional problem, and the proposed solution(s) recommended by an Instructional Designer.
Design documents typically include the following:
- The integration and alignment of business and training goals to the actual instructional design solution
- An analysis and measurement of internal vs. external resources
- An in-depth timeline mapped to the resources and budget analysis
- The design, development and implementation process
- Recommendations for updates and evaluations
Is Action Mapping an Option?
Action mapping is action driven; which means it does not rely solely on measurable success based on a learner’s ability to successfully pass a test or participate in a discussion. Action Mapping also includes uses the following processes:
- Identify the Business Goal. In our case, this is the UCO which defines the administrative learning goals for the course. We convert the UCO into course level instructional goals.
- Identify what students need to DO, to achieve these instructional goals. These become those measurable tasks; activities, discussions and assignments, etc. in an online course.
- Design the tasks around the learning.
- Identify the information and resources learners need to complete the task
How it works for NLU
In OIT, our course design and development strategy uses a combination of both of these processes to assist faculty in the planning, design and development of their online courses and programs. Each opportunity provides us with a unique solution based on sound instructional design principles and practices.
Ms. Moore’s approach for analyzing an instructional problem and defining a learning strategy is called Action Mapping. As an instructional analyst, my job is to investigate and explore various methods of instructional design and development practice – the concept of Action Mapping is intriguing and when integrated with traditional instruction design practices, it provides a truly comprehensive and effective process for designing learning. | s3://commoncrawl/crawl-data/CC-MAIN-2018-26/segments/1529267864257.17/warc/CC-MAIN-20180621192119-20180621212119-00132.warc.gz | CC-MAIN-2018-26 | 3,095 | 21 |
http://together.fullerton.edu/about/demographics.aspx | code | While demographics do not tell stories of individual experiences at Cal State Fullerton, we want to provide information on the diverse collective demographics of our campus. Tracking our campus’s demographics year-to-year helps us evaluate our progress in recruiting and retaining a diverse student and workforce population. We strive to not only mirror the world around us, but to ensure that every member of the Titan community feels welcomed and supported.
For information specific to faculty retention, please see this
and the following dashboards:
Appearing below are demographic snapshots of our campus for Fall 2019, illustrating our past successes and opportunities for the future. | s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038082988.39/warc/CC-MAIN-20210415005811-20210415035811-00069.warc.gz | CC-MAIN-2021-17 | 691 | 4 |
http://www.danieljsinger.com/research/ | code | I research on many topics in Epistemology, Metaethics, and Social Epistemology (including where it intersects with Political Philosophy and Philosophy of Science). Here are some short descriptions of my major research projects. For more information about my research, see my CV or contact me.
There is a popular idea that epistemic norms all stem from the ultimate goal of having true beliefs and avoid false ones. This kind of epistemic consequentialism has been subject to many objections in the literature. I defend a version of truth-maximizing epistemic act-consequentialism that I term “Sophisticated Epistemic Consequentialism.” The view captures the intuitive motivation behind the truth-centered views, clarifies the place of objective and subjective epistemic oughts in theorizing, and takes seriously the complex structure of epistemic values and the intricacies of human motivation. This view is inspired by sophisticated consequentialist views in ethics, like the one given by Peter Railton. In “Sophisticated Epistemic Consequentialism” (in progress), I provide a general framework for thinking about sophisticated consequentialist views (in both ethics and epistemology). That paper clarifies what these views can account for and show why epistemic consequentialists ought to be sophisticated too.
“Permissible Epistemic Trade-offs” (under review)
“What Epistemic Reasons are For: Against the Belief-Sandwich Distinction” with Sara Aronowitz (under review)
The Source of Epistemic Normativity
I defend a constitutivist account of the truth norm (the norm that says we ought to have accurate beliefs and which is central in my epistemic consequentialism). I defend a simple account that says that we’re subject to the truth norm in virtue of two facts: (1) that being a believer is constitutive of agency, and (2) that the truth norm is constitutive of belief. This kind of account is similar to constitutive accounts of norms in ethics.
To defend that account, I show that the constitutivist view is simpler than it is typically taken to be, which means the view avoids many of the objections leveled against it in the literature, such as the objection that the view violates the is-ought gap (the nature of which I clarify in my “Mind the Is-Ought Gap” in the Journal of Philosophy). I also show constitutivist explanations of norms are formally on par with paradigmatic grounding explanations in science by the lights of our best theories of scientific explanation (in my “Some Virtues of Constitutivism as Metaphysical Explanation” in progress). Finally, I argue that constitutivists account avoid Enoch’s schmagency objection (in my “How to Ignore the Schmagency Objection,” in progress). By diagnosing a subtle equivocation, I show that Enoch’s objection at most applies to constitutivist views of the epistemology and authority of norms, not their metaphysics. So overall, I claim, the constitutivist offers a productive way to approach ethical questions using notions already familiar from our best theories of agency and action, and it’s one that can naturally be used to account for why we ought to believe the truth.
“Some Virtues of Constitutivism as Metaphysical Explanation” (under review)
“Mind the Is-Ought Gap” (2015 in the Journal of Philosophy)
Social Epistemology, Political Philosophy, and Philosophy of Science
Along with Patrick Grim, I direct the Computational Social Philosophy Lab, an interdisciplanary group of researchers that investiages questions of social epistemology, philosophy of science, and political philosophy using agent-based computer models and an eye toward empirical results. Our most recent research uses agent-based computer simulations to examine group deliberation and how group polarization can be produced, maintained, and destroyed by various mechanisms. Previous research has included using agent-based computer simulations to examine arguments for the value of diversity, epistemic democracy, the nature of information and information transfer, and how communication networks affect epistemic communities.
For related papers, see the Computational Social Philosophy Lab website. | s3://commoncrawl/crawl-data/CC-MAIN-2018-17/segments/1524125946597.90/warc/CC-MAIN-20180424100356-20180424120356-00183.warc.gz | CC-MAIN-2018-17 | 4,189 | 12 |
https://forums.opensuse.org/t/setting-the-default-browser-curiosity/121974 | code | I have opensuse 42.1 and I selected to install the xfce4 desktop. From the settings menu I changed the default browser from Firefox to seamonkey and it had no effect. I had a memory of something like this happening before, so I installed gnome-control-center and changed the default browser in that, and voila! it worked! So I am curious to know why this is? Maybe xfce4 should have a dependency for gnome-control-center instead of whatever it installs by default.
Certainly not because it has its own control center.
How did you install Seamonkey? From where? Usually if you use a third party repo then you can choose the default app in the settings menu from the drop down menu. Change to the correct path where you installed Seamonkey.
It is installed from the standard repository, vendor opensuse. I expect I typed zypper install seamonkey, that’s what I usually do, otherwise I used Yast2.
When I ran seamonkey it did ask me if I wanted it to be the default browser, but I said no, because I don’t know what changes it would have made, or how to reverse them. I have had similar problems with firefox making itself the default browser and then finding it impossible to stop it.
You say xfce4 has its own control center, but it didn’t work. Gnome-control-center didn’t quite work either.
Do you know where the changes go? I think it is in xdg-open somewhere, but it seems to depend on other factors like which desktops are in use or have been in use.
What I want is to have seamonkey as the default, but to be able to easily change it later if I want.
Strange. When I go to Xfce settings, preferred applications, I can select the default browser. I only have Firefox and Chrome so I cannot speak for Seamonkey.
What happens if you choose /usr/bin/seamonkey?
OK I have repeated the experiment to describe exactly what I do. At this point I am starting with seamonkey as my default browser, and I will attempt to change it back to firefox.
- So I go to settings -> preferred applications, and change the browser from seamonkey to firefox.
- I launch xfce4-terminal and type # http://bbc.com
- I move the cursor over the link, right click and select open link, and it opens it with seamonkey instead of firefox.
- I log out and log in again, repeat 2,3 and the same result.
- I launch gnome-control-center and go into “details” option (not a great name for an option, but never mind) and change the browser from seamonkey to firefox. I then repeat steps 2,3, and firefox now launches correctly.
So my conclusion is that xfce4 ignores the settings on the menu and honours the settings in gnome-control-panel.
It’s possible this only applies to xfce4-terminal as described, opening links from within thunderbird or seamonkey --mail is more complicated I think. | s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947475238.84/warc/CC-MAIN-20240301093751-20240301123751-00728.warc.gz | CC-MAIN-2024-10 | 2,773 | 18 |
http://gulfsite.info/watch/enenIERNC7Q | code | 70 Like 4 Dislike
Some friends and acquaintances have asked me how to use FreeCAD to create custom models for 3D printing, so I decided to make a 2 or 3 part tutorial about the different functions of the program for new users. This is my first instructional video; I have been using the program for about 1.5 years and I’ve included concepts in the tutorial that I have learned during that time. Apologies in advance if I have not mentioned any prevalent information in the video; the tutorial is based on my own use of the program. Feedback and comments are welcome, thanks for watching! Part 2: Part Design Workbench: https://youtu.be/PlLH0JtEZps Part 3: Creating/Editing/ Importing Images: https://youtu.be/VydZXMccfH4 Tutorial Part 1: The Part Workbench Intro: 0:00 Creating Primitive Objects: 1:01 Standard Views/Navigation: 2:04 Editing Primitive Objects & Appearance: 4:32 Editing Object Placement/Rotation: 6:32 Toggling Object Visibility/Renaming Objects: 7:20 Boolean Operations: 7:43 Copying/Pasting & Scaling Objects: 11:41 Creating Group Folders: 13:29 Edging Operations: Fillet & Chamfer: 14:07 Time Saving Tip for Multi-Object Rotation: 17:14
In this tutorial i'm modeling a spoon, and, after a thousand attempts, there's always the simplest one, hidden, somewhere... I've tried many attempts with sections, profiles and so on, but, this one had worked in a couple of minutes, successfully. Step by step instructions, and other details, i'll cover in tutorials with my voice included. I hope this tutorial will be helpful in learning. - - - - - - - - - - - - - - - - - Blog: https://tutorialfield.blogspot.com/ - - - - - - - - - - - - - - - - - music: Youtube_audio_library *** Leslie's Strut - John Deley and the 41 Players *** Stalling - Topher Mohr and Alex Elena *** Heading_West - Audionautix Heading West by Audionautix is licensed under a Creative Commons Attribution license (https://creativecommons.org/licenses/by/4.0/) Artist: http://audionautix.com/ #FreeCAD #Spoon
"The better the milk, the better the cheese. Everybody believes that." Beecher's Handmade Cheese: http://beechershandmadecheese.com/ 5 Spoke Creamery: http://www.5spokecreamery.com/ Check us out on Facebook! - facebook.com/buzzfeedtasty Credits: https://www.buzzfeed.com/bfmp/videos/64865
Check out http://3dshapeengineering.com for cool custom printed products and parts for your 3d printer! Check us out on Social Media: Minds: https://www.minds.com/mikethetinkerer Twitter: https://twitter.com/mikemadsci Instagram: https://www.instagram.com/mikethetinkerer Facebook: https://www.facebook.com/powerplayground
This is a small guide on how to map a sketch to a face, use invisible elements as guides, use the pocket function and use linear pattern to make a repeating cutout.
Download the Model + the FreeCAD file here: http://www.thingiverse.com/thing:1891623
FreeCAD Tutorial Playlist: https://www.youtube.com/playlist?list=PLMjfntGK5aY4qRy4QJr6YiAilvcR90qDj
Check out https://3dshapeengineering.com for cool custom printed products and parts for your 3d printer!
Check us out on Social Media: | s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376828501.85/warc/CC-MAIN-20181217091227-20181217113227-00128.warc.gz | CC-MAIN-2018-51 | 3,091 | 10 |
https://sourceforge.net/p/cedet/mailman/message/27926914/ | code | From: Eric M. Ludlam <ericludlam@gm...> - 2011-08-13 10:52:53
On 08/10/2011 08:00 AM, Alexey Uimanov wrote:
> semantic-complete-jump-local does not jump in python mode.
> How can i rebind C-c , j to senator-jump ? It does what i need.
I can get neither to work in the one python example file I have. Can
you send me a short example that should work as you describe? Thanks.
If you are using the bzr version of CEDET, then the easiest thing to do
is go into senator.el and override it.
If you don't want to do that, then you can do this in your .emacs:
(define-key km "j" 'senator-jump)
or if you are using the CEDET built into Emacs, then it is similar, but
I don't know the map name. It's in semantic.el on that version. | s3://commoncrawl/crawl-data/CC-MAIN-2017-39/segments/1505818687820.59/warc/CC-MAIN-20170921134614-20170921154614-00166.warc.gz | CC-MAIN-2017-39 | 721 | 12 |
https://www.br.freelancer.com/projects/php-visual-basic/ldap-mini-server/ | code | Using /nsoftware's ipdaemon, I need a small LDAP server using Visual Basic or VB.net.
I don't need a whole server.
I need the code to receive the request using ipDaemon on the "Server" side and the code to package the response and send it back to the client side.
No database support is needed...you may hardcode samples in it.
We will also require the source code so we may integrate it into our project.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
Windows using VB or VB.Net | s3://commoncrawl/crawl-data/CC-MAIN-2018-13/segments/1521257647671.73/warc/CC-MAIN-20180321160816-20180321180816-00374.warc.gz | CC-MAIN-2018-13 | 553 | 7 |
https://www.digitalocean.com/community/users/ia001 | code | I am very new to DigitalOcean and server management. I am planning on moving an existing vBulletin forum with more than 1m posts to DO. It is currently hosted on a dedicated server.
In future, we also plan to migrate ...
I would strongly recommend against attempting to run discourse and cPanel on the same server. cPanel/WHM is very specific about what software is on a server when it is installed. A fresh server is vital to ensuring ... | s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780053657.29/warc/CC-MAIN-20210916145123-20210916175123-00157.warc.gz | CC-MAIN-2021-39 | 439 | 3 |
https://www.eventscribe.com/2018/Informatics/fsPopup.asp?efp=U0RXQlVPUlA2MTk5&PresentationID=417984&rnd=5.538487E-02&mode=presinfo | code | Innovations and Novel Applications
Sharing Session - 90 Minutes
How can we, as data analysts, facilitate data use for those without formal training? In this session, speakers will discuss materials and events that help participants build data literacy in diverse populations to improve public health outcomes. Samples, templates, and tools will be provided. | s3://commoncrawl/crawl-data/CC-MAIN-2019-13/segments/1552912202588.97/warc/CC-MAIN-20190321234128-20190322020128-00050.warc.gz | CC-MAIN-2019-13 | 357 | 3 |
https://keele-repository.worktribe.com/output/421295 | code | Laura Jane Alexandra Scott
Convective boundary structure and mixing in stellar interiors
Scott, Laura Jane Alexandra
The treatment of convection remains one of the key uncertainties in stellar evolution. In particular, mixing processes at the boundaries of convective regions are complex and diffcult to define analytically. Therefore, hydrodynamic simulations are used to model fluid flow in convective regions and the neighbouring stable regions, allowing the convective boundary mixing to be characterised. Hydrodynamic simulations currently provide the most accurate modelling of convection and convective boundary mixing, but are limited to time-spans which are a negligible fraction of the stellar lifetime. One way of mitigating this limitation is to transfer the key results of hydrodynamic simulations into 1D evolution models, which are able to model the whole life of a star. This is the aim of this thesis, in which two forms of convective boundary mixing (turbulent entrainment and convective shear) have been implemented into the Geneva stellar evolution code.
The entrainment prescription has been used to compute a grid of models from 1.5M* to 60M* on the main sequence. These were compared both to standard 1D models and to observational limits on the main sequence width. The strength of mixing due to entrainment was found to increase with mass, in line with observational evidence. The convective boundaries in previously calculated hydrodynamic simulations of the carbon shell have been reanalysed and compared to 1D convective shear models. It was found that the boundary shapes seen in the hydrodynamic simulations can be better modelled using an additional layer of mixing above the shear layer. Finally, a more general, multi-layered boundary structure has been discussed and future work outlined.
|Publicly Available Date||May 30, 2023| | s3://commoncrawl/crawl-data/CC-MAIN-2023-50/segments/1700679100304.52/warc/CC-MAIN-20231201183432-20231201213432-00715.warc.gz | CC-MAIN-2023-50 | 1,862 | 6 |
http://people.csail.mit.edu/indyk/papers.html | code | J. Matousek, Embedding finite metric spaces into Euclidean spaces.
Lecture notes, 2000.
Embeddings of finite metrics into normed spaces (l_1 and l_infty).
Includes Bourgain's lemma.
N. Linial, E. London and Yu. Rabinovich,
The geometry of graphs and some of its algorithmic applications,
Combinatorica (1995) 15, pp. 215-245.
Application of Bourgain's lemma to approximating the sparsest cut.
Lots of other embedding results.
D.B. Shmoys. "[Approximation algorithms for] Cut problems and their application to divide-and-conquer". In: Approximation Algorithms for
NP-hard Problems, (D.S. Hochbaum, ed.) PWS, 1997, 192-235.
As above, more algorithmic angle.
Satish Rao, Small Distortion and Volume Preserving Embeddings for Planar
and Euclidean Metrics. Symposium on Computational Geometry 1999: 300-306.
Embeddings of planar graph metrics into l_1.
Approximating the bandwidth via volume respecting embeddings.
Journal of Computer and System Sciences, 60(3), 510--539, June 2000.
Y. Bartal, Probabilistic Approximation of Metric Spaces and its Algorithmic
Applications, Proc. of the 37th Ann. IEEE Symp. on Foundations of Computer Science,
Embeddings of finite metrics into probabilistic trees, part I.
Y. Bartal, Approximating Arbitrary Metrices by Tree Metrics. STOC 1998: 161-168.
Embeddings of finite metrics into probabilistic trees, part II.
S. DasGupta, A. Gupta, An elementary proof of the Johnson-Lindenstrauss lemma,
ICSI Technical Report.
Dimensionality reduction for l_2, simple proof.
S. DasGupta, Learning mixtures of Gaussians , FOCS'99.
An application of JL-lemma.
P. Indyk, Stable Distributions, Pseudorandom Generators, Embeddings and
Data Stream Computation, FOCS'00.
(Strange) dimensionality reduction for l_1, application of embeddings to space-bounded computation.
N. Alon, Y. Matias, M. Szegedy, The space complexity of approximating the
frequency moments, STOC'96.
The original paper on space-bounded computation. | s3://commoncrawl/crawl-data/CC-MAIN-2018-43/segments/1539583510998.39/warc/CC-MAIN-20181017044446-20181017065946-00125.warc.gz | CC-MAIN-2018-43 | 1,936 | 33 |
http://www.brainia.com/essays/Morality-Good-Neutral-Or-Evil/297737.html | code | Are We Good, Bad, or Neutral?
In John Steinbeck's The Grapes of Wrath, he discusses "the rights" of the farmers in the camps. He tells us that while "no one told them," they still learned these rights and learned which ones "were monstrous and must be destroyed." (194) His assertations imply that these rights were learned out of practical necessity and thus, that we are born morally neutral.
Steinbeck's idea that we are born morally neutral - with a blank slate - led to a discussion amongst the class. We debated back and forth, tossing various ideas into the air, whether we as humans were born morally good, evil, or morally neutral.
As I sat back in my seat, quietly listening to the different arguments for each side, I wondered what my answer to the question was. I thought some more and pondered through different ideas throughout the day and later did some research to see if I could find anything on the topic. I ended up coming across a few things and after reading through the articles, books, and research papers, I decided that there was a fourth argument to be made. I decided that we are essentially good, but tainted by evil.
At this point, the skeptic is liable to stop reading due to their perception that this is just a "middle of the road" argument with contradicting ideas. They believe that it's not possible; that it's only possible to be born completely good, completely evil, or with a blank slate. Keep in mind, however, that for thousands upon thousands of years, humans also thought it was impossible to set foot on the moon. We know now, though, that just because the common perception is that of impossibility, it's not necessarily impossible. For that reason, my fourth option is still possibly a valid one that will be elaborated on later. For now, though, let's see why options one, two, and three are all hardly logical.
I think the idea that we are born completely good is a bit of a stretch. Sure, it sounds good, and for the most part we see... | s3://commoncrawl/crawl-data/CC-MAIN-2017-13/segments/1490218189884.21/warc/CC-MAIN-20170322212949-00334-ip-10-233-31-227.ec2.internal.warc.gz | CC-MAIN-2017-13 | 1,985 | 6 |
https://www.veteranmadepod.com/post/momentum-is-more-valuable-than-motivation | code | I re-learned a valuable lesson – momentum is more valuable than motivation.
I have myriad excuses for why I missed two emails last week.
I was sick, my family and I moved to a new state, I sent, revised, and resent a moderately big proposal (which I lost) while also working on a couple of existing projects … but the hard truth to admit is that I didn't sustain my momentum. I mismanaged my time.
I can wallow in self pity, or I can pick up where I left off and do the work that's right in front of me and see what happens.
Terminal leave is too late. Do the work that's right in front of you, and see what happens.
✍🏼 My name is Carey Kight. I was a flight line weapons troop in the Air Force. Now I help veterans build ⚡️SKILLS⚡️ to successfully transition from service-to-civilian.
🎙️ LISTEN to Veteran Made
📷 FOLLOW Veteran Made | s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817153.39/warc/CC-MAIN-20240417110701-20240417140701-00430.warc.gz | CC-MAIN-2024-18 | 858 | 8 |
https://immutableblog.medium.com/automated-metadata-refresh-is-live-on-immutable-x-aa630097db32 | code | Immutable has been recognized as one of the best platforms for developers to build and launch web3 games, and it’s only getting better! We know how important it is for you to update game assets, improve the gameplay experience, and have a successful primary sale in a permissionless environment.
That’s why we’re excited to announce that our Automated Metadata Refresh feature is officially live! With this launch, developers will have self-serve access to refresh metadata whenever it’s necessary.
In the past, developers have had to contact the Immutable Support Team to request a metadata refresh, which slowed down the process and added additional room for error. However, we know developers need to be able to refresh their metadata without having to reach out to someone at Immutable. With this update, we’ve given you complete control over how and when changes to your assets’ metadata are made.
Metadata Refresh Use Cases
There are many reasons that a game would need to go through the metadata refresh process, but here are some example scenarios:
- Game rebalancing
- Copy / art updates
- Improving asset discoverability
- Core gameplay functionality
How It Works
Here is a breakdown of how the metadata refresh process functions:
- Send up to 5000 tokens to refresh an hour
- Immutable sends a receipt with instructions on how to check the refresh status
- Use the Refresh ID to check the status of the request
- If any errors have occurred, call the errors endpoint to viewed failed tokens
To dive deeper into Automated Metadata Refresh and learn more about the technical implementation process, please reference our documentation here.
Our team at Immutable is dedicated to ensuring developers’ needs are met — your feedback is critical throughout this journey. We already have even more improvements to metadata planned in the future and want to know how we can make life easier for you. Let us know here. | s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947473370.18/warc/CC-MAIN-20240221034447-20240221064447-00078.warc.gz | CC-MAIN-2024-10 | 1,935 | 17 |
https://johnnydeppnetwork.com/qa/what-is-a-git-commit-message.html | code | - How do I change commit message in Pushbucket?
- What’s the difference between a pull request and a branch?
- How do I pull code from Git?
- What is the use of commit in git?
- What is a good commit message?
- How add to previous commit?
- How do I add a commit message?
- How do you change commit message for a particular commit?
- How do you write a good message?
- What comes first staging with git add or committing with git commit?
- How can you temporarily switch to a different commit in git?
- What is a commit message?
- What is a commit?
- What does it mean to commit a file?
- How do you rebase an interactive?
- How do you commit?
- How do you stage a commit?
- Why commit messages are important?
- How do I edit a commit?
- What is git rebase?
- What happens when we commit in git?
- How do you commit a code?
- Can I push without commit?
- How do I resolve a commit message in git?
- How do you git add and commit?
- How can I commit without text?
- Can you change commit message after push?
- How do I change old commit messages?
How do I change commit message in Pushbucket?
3 Answersgit rebase -i HEAD~X (X=No of commit messages you want to change)Above command will open git file in editor.
There replace text ‘pick’ with ‘reword’ and save the file.It will open editor for every commit one by one, there you again change the commit message.At the end: git push -f..
What’s the difference between a pull request and a branch?
A branch is just a separate version of the code. A pull request is when someone take the repo, makes their own branch, does some changes, then tries to merge that branch in (put their changes in the other person’s code repository). (In the most general of terms.)
How do I pull code from Git?
PULL Request through Command Line.Fork the Repository. … Open your bash in your computer. … Make a new branch. … Make a change by using vim from bash or direct replacement from the original README file. … Adding and Committing a file to the repository. … Push the repository to the GitHub.More items…•
What is the use of commit in git?
The “commit” command is used to save your changes to the local repository. Note that you have to explicitly tell Git which changes you want to include in a commit before running the “git commit” command. This means that a file won’t be automatically included in the next commit just because it was changed.
What is a good commit message?
Separate subject from body with a blank line Though not required, it’s a good idea to begin the commit message with a single short (less than 50 character) line summarizing the change, followed by a blank line and then a more thorough description. … You’re better off writing the message in a proper text editor.
How add to previous commit?
You can modify the most recent commit in the same branch by running git commit –amend. This command is convenient for adding new or updated files to the previous commit. It is also a simple way to edit or add comments to the previous commit. Use git commit –amend to modify the most recent commit.
How do I add a commit message?
To write a git commit, start by typing git commit on your Terminal or Command Prompt which brings up a Vim interface for entering the commit message.Type the subject of your commit on the first line. … Write a detailed description of what happened in the committed change. … Press Esc and then type :wq to save and exit.
How do you change commit message for a particular commit?
Depending on the type of changes, you can perform the following if you need to change the:The author of the commit. Perform: git commit –amend –author=”Author Name
How do you write a good message?
Good messages:Are clear. Try to convey your meaning as simply as possible. Don’t over-write or use exorbitant language. … Are complete. Include all relevant information. Think about the situation from your readers’ perspective. … Are correct. Always proofread before sending any message.
What comes first staging with git add or committing with git commit?
First, you edit your files in the working directory. When you’re ready to save a copy of the current state of the project, you stage changes with git add . After you’re happy with the staged snapshot, you commit it to the project history with git commit .
How can you temporarily switch to a different commit in git?
First, use git log to see the log, pick the commit you want, note down the sha1 hash that is used to identify the commit. Next, run git checkout hash . After you are done, git checkout original_branch . This has the advantage of not moving the HEAD, it simply switches the working copy to a specific commit.
What is a commit message?
A commit message is attached to that change — not the code itself. Accordingly, when you write a commit message you are writing it as if it’s about to be applied, rather than about what you just did.
What is a commit?
to pledge (oneself) to a position on an issue or question; express (one’s intention, feeling, etc.): Asked if he was a candidate, he refused to commit himself. to bind or obligate, as by pledge or assurance; pledge: to commit oneself to a promise; to be committed to a course of action.
What does it mean to commit a file?
Commit the file means that it should be tracked in source control. If someone clones (or has a clone of) the repo, and the checkout a given version of your code, they should get the version of somefile. … Adding the file in the project (or not) is an IDE thing.
How do you rebase an interactive?
You can run rebase interactively by adding the -i option to git rebase . You must indicate how far back you want to rewrite commits by telling the command which commit to rebase onto. Remember again that this is a rebasing command — every commit in the range HEAD~3..
How do you commit?
Here’s what I’m learning about being more deeply committed:Take away choice. … Do it with your entire being. … Remember your deeper Why. … If you aren’t fully doing it, ask what’s holding you back. … Add commitments only slowly. … Get out of commitments you aren’t going to uphold.
How do you stage a commit?
Stage Files to Prepare for CommitEnter one of the following commands, depending on what you want to do: Stage all files: git add . Stage a file: git add example. html (replace example. … Check the status again by entering the following command: git status.You should see there are changes ready to be committed.
Why commit messages are important?
Commit messages are important means of communication between team members and for the lifecycle of the teams and projects since they include the context on which they were created. By inspecting the project history we can find out why some decisions were made when they were made. … Countless uninformative commit messages.
How do I edit a commit?
Here’s the workflow:git commit-edit
What is git rebase?
What is git rebase? Rebasing is the process of moving or combining a sequence of commits to a new base commit. Rebasing is most useful and easily visualized in the context of a feature branching workflow.
What happens when we commit in git?
Well, basically git commit puts your changes into your local repo, while git push sends your changes to the remote location. git push is used to add commits you have done on the local repository to a remote one – together with git pull , it allows people to collaborate.
How do you commit a code?
Git on the commandlineinstall and configure Git locally.create your own local clone of a repository.create a new Git branch.edit a file and stage your changes.commit your changes.push your changes to GitHub.make a pull request.merge upstream changes into your fork.More items…
Can I push without commit?
No, you must make a commit before you can push. What is being pushed is the commit (or commits).
How do I resolve a commit message in git?
On the command line, navigate to the repository that contains the commit you want to amend. Type git commit –amend and press Enter. In your text editor, edit the commit message and save the commit.
How do you git add and commit?
The basic Git flow looks like this:Create a new file in a root directory or in a subdirectory, or update an existing file.Add files to the staging area by using the “git add” command and passing necessary options.Commit files to the local repository using the “git commit -m
How can I commit without text?
This way we can commit the changes in Git without any commit message….Why we need to have commit messages?Open your Git Bash.Make some changes to the file we created above (harish.txt)Add the file to the staging area.Type the following command. git commit -a –allow-empty-message -m ‘ ‘Press enter and it is done.
Can you change commit message after push?
Changing the latest Git commit message If the message to be changed is for the latest commit to the repository, then the following commands are to be executed: git commit –amend -m “New message” git push –force repository-name branch-name.
How do I change old commit messages?
Amending the message of older or multiple commit messages Use the git rebase -i HEAD~n command to display a list of the last n commits in your default text editor. Replace pick with reword before each commit message you want to change. | s3://commoncrawl/crawl-data/CC-MAIN-2021-43/segments/1634323587606.8/warc/CC-MAIN-20211024204628-20211024234628-00029.warc.gz | CC-MAIN-2021-43 | 9,367 | 85 |
http://www.thestalkingdirectory.co.uk/showthread.php/109800-Reloading-crash-course-North-West-England | code | So, I found myself in need to reload my own ammunition for my .357 lever action, as it would help me remaining within the velocity restrictions of my club. I have heard as many different suggestions as to the kit I need to purchase, as people that I asked. I do not know what I need to buy, which 'recipe' to use, which brass, bullet heads and powder I need etc. In other words, I have no idea about reloading whatsoever. What I do know though is that I do not have the time to read book after book so I can inform myself. All I need is one set up, one 'recipe' of powder, bullet head, brass and primer to get me going. I know this might not get down well with some people, but I really do not have the time to spend on educating myself about the subject of reloading in general. I just want to know how to do one thing. I am smart enough and I will learn quick and learn to do it well. I decided I need to get some hands on experience reloading first before I decide on what to buy. Would someone in the north West of England be so kind as to spend an hour or so going through the process of reloading with me so I can at least get an idea if this is something I can/want to do before I commit on a reloading kit? I can travel to you (as a matter of fact I need to, as I do not have the hardware) and I will be at your debt if you could please help. Many thanks in advance! | s3://commoncrawl/crawl-data/CC-MAIN-2016-44/segments/1476988719877.27/warc/CC-MAIN-20161020183839-00413-ip-10-171-6-4.ec2.internal.warc.gz | CC-MAIN-2016-44 | 1,374 | 1 |
https://www.easyaccountancy.co.uk/contractor-jobs/senior-java-software-engineer/ | code | - Location: Bath, Somerset
- Rate: Up to 208.00
- Start Date: 16/08/2019
- Duration: NA
Senior Java Software Developer
Full time – Permanent
I am currently working with a client who is looking for an experienced Senior Java Developer to join their core Platform Development team. The role includes the design, development and testing of core services and components.
You will enjoy helping less experienced members of the team to improve their skills and develop professionally. You’ll need to be passionate about building amazing customer experiences. The ideal candidate I am looking for to join this leading company will be able to learn new technologies rapidly, build prototypes and deploy solutions.
To be successful within this role:
You must be able to write scalable Java code with a focus on code quality and performance. Work collaboratively with multiple development teams to design and execute on a given technical solution. You must have excellent English verbal and written skills as you will be documenting solutions and changes on a daily basis.
Experience and knowledge required:
- Python, PHP
- Scala, Kotlin
- Big Data, Hadoop, Spark, Hive
- Cloud Solutions – AWS, Azure, Docker, Kubernetes
A few of the companies’ benefits:
- Competitive salary
- 25 days annual leave
- Cycle to work scheme
- Flexible working hours
Apply to this Senior Java Software Engineer role now with your most recent and up to date CV, give me a call
If you know of anyone such as family members, friends or acquaintances who would be suited to this job then we offer a very pleasant referral scheme!
To find out more about Computer Futures please visit www.computerfutures.com
Computer Futures, a trading division of SThree Partnership LLP is acting as an Employment Agency in relation to this vacancy | Registered office | 1st Floor, 75 King William Street, London, EC4N 7BE, United Kingdom | Partnership Number | OC387148 England and WalesApply | s3://commoncrawl/crawl-data/CC-MAIN-2019-39/segments/1568514573759.32/warc/CC-MAIN-20190919224954-20190920010954-00055.warc.gz | CC-MAIN-2019-39 | 1,950 | 24 |
https://wpdev.uservoice.com/forums/110705-universal-windows-platform/suggestions/4328935-ability-to-manage-snapshots-in-wp-emulator | code | Ability to manage snapshots in WP emulator
The Windows Phone emulator should include the ability to manage VM snapshots for Windows Phone images. Developers should be able to create WP images that are tailored to be in a specific state, and manage those image snapshots.
Hyper-V is a powerful VM management tool, and it includes the ability to create new images and manage snapshots within them, allowing developers to save the current state of the VM (e.g., to manage particular testing scenarios such as upgrading the app when a good amount of custom data is in it, either for one app or multiple) or to roll the state back to a prior checkpoint marked in the VM.
Emulator image tooling should be expanded to include the following:
- Create a new developer VM image (from one of the base images)
- Delete a created developer VM image
- Be able to add/remove developer VM images from the Visual Studio device/emulator list
- Additional tooling in the emulator to allow for snapshot management of developer VM images
Under this suggestion, the developer should be unable to manage or modify the base/standard images, this suggestion is only for adding additional images.
Mark Allan commented
Yes, this would be useful so you don't have to switch from US to local culture and reboot the phone before starting.
Added this after a developer conversation this week | s3://commoncrawl/crawl-data/CC-MAIN-2019-39/segments/1568514573988.33/warc/CC-MAIN-20190920092800-20190920114800-00244.warc.gz | CC-MAIN-2019-39 | 1,360 | 12 |
http://www.apsis.ch/pound/pound_list/archive/2009/2009-05 | code | Pound Mailing List
Axis IP Cameras
/ "Maze, Jeffrey S." <JMaze(at)CO.GEAUGA.OH.US>
I installed Pound onto an openBSD 4.5 box and it works fine when
connecting to any internal websites. It was amazingly easy to setup and
get running. Thanks for a great product.
I noticed pound's memory usage slowly increasing over time so I've been
having a quick scan through the code. I've noticed the following section of
code (lines 883-893 of http.c) which I think is...
"Line too long" with 2.4
/ Eirik Øverby <eirik.overby(at)modirum.com>
I keep seeing 'Line too long' messages in my logs; am wondering
- are these error mesages (i.e. is the request being served normally
despite the message?)
- why is MAXBUF lower than in 2.3?...
Intermittent slow down problems
/ Kaye Ng <kng(at)objectmastery.com>
I'm running pound version 2.3.1 in production. Each day I seem to be
getting intermittent slowdowns. For example I have a page which normally
takes 4-5 seconds to load, but on occasion (around ...
change a c code in pound 2.4.4
/ Emilio Campos <emilio.campos.martin(at)gmail.com>
I use a 2.4.4 pound binary and i have a singular problem with backends in
iss, whith some urls the backend send to pound the port 10.000 or 20.000,
I know now thas is is a iis problem.
In my c...
Pound/SSL and Apache's HTTPS environment variable
/ Fili <fili(at)fili.nl>
I actually have three seperate questions concerning the pound load-balancer.
So here goes in order of importance:
1. Pound+SSL transparently passes https requests as http requests to
/ Robert Segall <roseg(at)apsis.ch>
I was away for a while, so I'd like to answer some of the pending posts
- error 0 in log files (from HKS): this usually means a time-out during
the data transfer or similar. Un...
Undefined Error: 0
/ "(private) HKS" <hks.private(at)gmail.com>
Pound 2.4.4 on OpenBSD 4.4.
I've been using Pound for a while and am generally very happy with it.
Our web app serves up a couple million page requests per day, and in
that pile we're seeing 20-30 of...
Pound does not start without working network connection
/ "Bollhalder, Andreas" <BollhalderAn(at)optimo-service.com>
I have a VM with Pound 2.3.2 running under Gentoo. When I does the
development of the VM, it is running on my local machine and it does not
have access to the network. In this case, I'm una...
Re: [Pound Mailing List] when backend hangs
/ Xiwen Cheng <xcheng(at)math.leidenuniv.nl>
A scenario this might occur is: Say webdata are served over NFS, but if the NFS
server becomes unresponsive, either it's a local(backend host) problem or
the NFS server. As a result requests c...
Quick SSL questions
/ "Youngblood, Luke" <Luke.Youngblood(at)McKesson.com>
Hello all, I'm looking into using Pound as a reverse proxy for my
SSL-enabled webservers, and I have a couple questions for you:
I know Pound can function very well as a reverse proxy in front of
What is this Pound =?UTF-8?Q?Error=3F=20=5BPound=20Mailing=20List=5D?=
/ Tim Dunphy <bluethundr(at)nylsd.com>
Can someone please explain to me why pound keeps printing this error to my
syslog? And how I can make it stop doing that?
"Apr 30 06:26:06 DNS pound: (b7b3fb90) connect_nb: error after gets... | s3://commoncrawl/crawl-data/CC-MAIN-2019-47/segments/1573496665809.73/warc/CC-MAIN-20191112230002-20191113014002-00073.warc.gz | CC-MAIN-2019-47 | 3,178 | 61 |
http://schtlab.ca/potential-graduate-students.php | code | Dr. Klest will be reviewing applications for graduate students for next fall. Her choice to take a student will depend on the quality of students who apply to work with her, the needs of other faculty and the quality of students who apply to work with them, and the needs of the program.
If you think you may be interested in applying to work in the Social Context, Health, and Trauma Lab, please take a look at current and recent projects and research topics and consider whether our lab might be a good fit for you.
Several other faculty members at the University of Regina study similar topics; you can find more information here. Information about the University of Regina graduate program in clinical psychology can be found here, including information about how to apply. General information about graduate studies at University of Regina can be found here. | s3://commoncrawl/crawl-data/CC-MAIN-2018-34/segments/1534221212910.25/warc/CC-MAIN-20180817202237-20180817222237-00354.warc.gz | CC-MAIN-2018-34 | 863 | 3 |
http://hvac-talk.com/vbb/showthread.php?58063-New-to-me-need-help&p=563698 | code | Ok, don't laugh too hard but there's a first time for everything.
Y'all know I do primarily residential but I am preparing a bid on a bigger than normal scale.
I know I've read this before but have forgot since I never use it......
The buildings are going to have a heat loss of several hundred thousand btu/h and I need to know the formula for sizing my gas line.
I prefer to use high pressure into the buildings with subregulators but I may have to size it, that is yet unknown.
All I know is either way I would like to know that formula again, and I'll write it down this time .
Thanks in advance. | s3://commoncrawl/crawl-data/CC-MAIN-2014-10/segments/1394010355709/warc/CC-MAIN-20140305090555-00078-ip-10-183-142-35.ec2.internal.warc.gz | CC-MAIN-2014-10 | 600 | 7 |
https://wiki.eclipse.org/Scout/Concepts/Type_of_Data | code | Notice: this Wiki will be going read only early in 2024 and edits will no longer be possible. Please see: https://gitlab.eclipse.org/eclipsefdn/helpdesk/-/wikis/Wiki-shutdown-plan for the plan.
Scout/Concepts/Type of Data
|Download • Git
|Forums • Blog • Twitter • G+
Scout contains several implementation of fields and columns to cover the most common types of data that are used in business application. These implementations provide formatting and parsing mechanisms (taking care of the locale settings). In some cases a picker is also associated to the field to improve the user experience.
For the developer of a scout application, this also enables to manipulate the value of the field with the corresponding Java Object (no need to cast and to parse the text input).
Time is store in a Java Date Object (Between 1970-01-01 00:00:00.000 and 1970-01-01 23:59:59.999).
The DateUtility class provides method to convert this value to a double in the interval [0.0, 1.0[ or to combine the time represented in the Date with a Date without any time.
This is not a Java Data type. Smart is a scout concept to designate a smart association realized with CodeType or LookupCall. The Key of type T can be any Serializable java Object (
String, …). We speak from a Smart association, because there is more than just a text (display text) associated to the key (Icon, Color, TooltipText...) | s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947475806.52/warc/CC-MAIN-20240302084508-20240302114508-00304.warc.gz | CC-MAIN-2024-10 | 1,393 | 10 |
https://www.mql5.com/zh/market/product/10897 | code | The utility downloads news from XE.com and dailyFX.com, saves them as .csv and draws them on the chart.
Displayed as vertical lines showing time of news release with brief description of this news.
Along with description it displays "P:","F:","A:" parameters meaning Previous, Forecast and Actual.
* symbol in description means that there are more than one piece of news at this specific point in time.
The number of * symbols indicate the number of pieces of news released at the same time.
A piece of news having the largest "importance" parameter (i.e. the most important one) is displayed on the chart.
The WebRequest() function is used to download news. Its operation requires the following:
- Open "Tools">"Options">"Expert Advisors".
- Check "Allow WebRequest for listed URL".
- Add http://www.xe.com/ec/CsvDownload and https://www.dailyfx.com/files/ to the URL list
The utility has following parameters:
- CalendarSource - Select dailyFX.com or XE.com as the news source
- RefreshMinutes - period of data updating: RefreshMinutes=5 - every 5 minutes;
- ShowAllNews - true: all news downloaded within this week are displayed; false: display only news related to the chart, for example only news related to GBP and USD are drawn on the GBPUSD chart
- ShowNewsDescriptions - if false, displays only the currency name the news is released on.
- OffsetHours - manual shift of news by the number of hours specified in OffsetHours. Calendar time is set automatically by the MetaTrader's server time. But you can shift news to the left or to the right if they fail in agree with the chart.
- LineStyle - style of vertical lines marking time of news release.
- LowImportanceColor - color of lines and description of news having "importance"="low";
- AverageImportanceColor - color of lines and description of news having "importance"="average";
- HighImportanceColor - color of lines and description of news having "importance"="high";
- FontName - name of font used for news description.
- FontSize - size of font used for news description.
- Angle - angle to display news description.
- FileName - name of file to save news.
2. Added parameter ShowNewsDescriptions - if false, displays only the currency name the news is released on. | s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917119356.19/warc/CC-MAIN-20170423031159-00518-ip-10-145-167-34.ec2.internal.warc.gz | CC-MAIN-2017-17 | 2,234 | 25 |
https://slack-chats.kotlinlang.org/t/450388/i-implemented-something-that-follows-quite-closely-the-spiri | code | I implemented something that follows quite closely the spirit of dagger2, but that could well be even better for simple use cases.
Often the Testcomponent needs to provide more types than Component, that's when the dagger2 pattern is more powerful
Still recently we simplified this. Because having a singleton means basically that you have a global variable with a reference to some object which is created when your classes are being loaded. So we replaced object with just a global top level declaration of variable and it looks like this. | s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233510219.5/warc/CC-MAIN-20230926175325-20230926205325-00639.warc.gz | CC-MAIN-2023-40 | 541 | 3 |
https://urop.ust.hk/projects/data-collection-and-cleaning-topics-health-and-sports-economics | code | In this project, we would need help from an RA on data collection and cleaning on (a subset of) the following:
4. Performance, salary, contract, transfer data of soccer players from major professional leagues
5. Results of National Games of the People's Republic of China
6. Transactions and ratings data from https://www.haodf.com/
Data collection and cleaning. Students with background training in Stata and/or R and knowledge of soccer are preferred.
Identifying data sources, assembling data, and asking preliminary research questions. | s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964364169.99/warc/CC-MAIN-20211209122503-20211209152503-00415.warc.gz | CC-MAIN-2021-49 | 539 | 6 |
https://emgrossman.com/video-and-animation-work/2018/6/19/pubnub-animation-n9pxs-g7cy7 | code | University of PubNub: Product Onboarding Courses
A One-Stop Shop for PubNub Wisdom
Project: A series 21 video lectures, all under ten minutes, that cover the basics of working with the PubNub API.
Target Audience: Developers integrating the PubNub API into their app, as well as developers exploring new features of the technology.
Goal: Provide clear, concise tutorials and best-practices straight from product and QA experts.
Role: Project manager, Concept/scripting, director/videographer.
After producing a few educational webinars featuring the CTO and QA lead, it became clear that the company needed a centralized, easy-to-understand body of knowledge that combined basic how-to’s with best practices, and general wisdom for how to best implement the product. I designed PubNub University as an answer to this need. In consultation with product managers, the QA team, and CTO, I planned each course, scheduled and carried out production, and was an advocate for the project to all levels of management from start to launch. | s3://commoncrawl/crawl-data/CC-MAIN-2019-43/segments/1570987763641.74/warc/CC-MAIN-20191021070341-20191021093841-00015.warc.gz | CC-MAIN-2019-43 | 1,032 | 7 |
https://www.splunk.com/en_us/blog/conf-splunklive/getwatchlist-getting-watchlists-into-splunk-quickly-and-easily-with-a-splunk-custom-search-command.html | code | As a Splunk partner specializing in Federal deployments, one question Aplura consultants are repeatedly asked by our clients is “Can I use Splunk to check our events for matches against a watchlist of IP addresses or domain names?”. Of course, the answer is “yes” watchlists can be configured, leveraging Splunk’s “lookup” functionality, and then used in searches to find and alert on matches. Splunk makes this pretty easy. Find more on lookups in the Splunk docs.
Implement Watchlists as Lookups in Splunk
For many of our clients, managing the lookup tables can be challenging The watchlist gets downloaded, perhaps reformatted, then uploaded to the Splunk server, where it can be used as a lookup table. In some situations, however, administrators aren’t comfortable giving their users direct access to upload files to the Splunk server and make the associated configuration changes. They are looking for another way to allow their users to save and update watchlists in Splunk, and preferably, keep those watchlists up to date in an automated fashion.
Extend Splunk Search with Custom Search Commands
After discussing the problem with a colleague, we came up with an idea. One of the great aspects of Splunk is its flexibility and extendability, which lead us to custom search commands. Custom search commands allow you to extend Splunk searches using the Python scripting language. Our solution to getting watchlists into Splunk is a custom search command called “getwatchlist”.
Getwatchlist allow Splunk users to retrieve delimited files from HTTP, HTTPS or FTP sources and then transform them into CSV output, which can easily be ingested by Splunk and saved as lookup tables. The lookup tables can then be used in searches to comb through events for hits. Usage is simple from the search bar or, for added convenience, through stored profiles in a configuration file. As getwatchlist is just using a Splunk search to populate the lookup table, scheduled searches can be configured to update the lists regularly, without requiring the types of access to the Splunk server that might make system administrators nervous.
Watchlists In Action (Using Splunk)
Note: Before proceeding with any of these examples, download and install the getwatchlist app from Splunkbase.
For example, let’s say an organization has a problem with users falling for phishing emails and clicking on the embedded links. Using Splunk and their web proxy events, we can use the PhishTank list to compare the URLs in our web proxy event to known phishing URLs.
First we need to pull down the latest copy of the PhishTank list using getwatchlist:
| getwatchlist http://data.phishtank.com/data/online-valid.csv delimiter=”,” relevantFieldName=url relevantFieldCol=2 referenceCol=3 dateCol=4 categoryCol=8 ignoreFirstLine=true isbad=true | outputlookup phishtank.csv
Now we compare the URLs in the lookup to the field in our events:
eventtype=webproxy [| inputlookup phishtank.csv | fields url]
If our administrator has been nice enough to configure phishtank as a lookup, we can also use this syntax to do the same as above, more simply:
eventtype=webproxy | lookup phishtank url | search isbad=true
The “isbad=true” at the end is a field and value which returns true for every column in the lookup (this is a custom field added by the getwatchlist command above).
So what about IP addresses? For example, let’s check our firewall logs for connections to known Command and Control servers using the AmaDa Malware Database.
Get (or update) the watchlist:
| getwatchlist http://amada.abuse.ch/blocklist.php?download=ipblocklist delimiter=# categoryCol=2 isbad=true | outputlookup amada.csv
And then check out events, matching the ip_address from the watchlist to the dest_ip field in the firewall events:
sourcetype=firewall [|inputlookup amada.csv | fields ip_address | rename ip_address as dest_ip]
sourcetype=firewall | lookup amada ip_address as dest_ip | search isbad=true
Another use would be for internal lists. If we have a list of terminated users, we can check our events to make sure these users aren’t logging in.
| getwatchlist http://192.168.1.104/bad_users.csv relevantFieldName=user isbad=true | outputlookup terminated_users.csv
The check our login events to make sure we don’t see any login activity:
tag=login |[inputlookup terminated_users.csv | fields user]
tag=login | lookup terminated_users user | search isbad=true
We were lucky enough to debut getwatchlist at the SplunkLiveDC! event hosted by Splunk Federal recently in Washington, DC. We were thrilled to see how excited people were about this, as well as their Splunk enthusiasm. See it again this week at #splunkconf. | s3://commoncrawl/crawl-data/CC-MAIN-2023-40/segments/1695233510528.86/warc/CC-MAIN-20230929190403-20230929220403-00719.warc.gz | CC-MAIN-2023-40 | 4,707 | 28 |
https://fluxsupportusa.com/pages/bitmap-engraving | code | Bitmap and vector are two different types of digital image files. Bitmap is an image type that consists of numerous square pixels. Bitmap files are rich in details that are mostly suitable for photography or digital applications. However, the quality is related to the resolution so the image can get jagged or blurry when resized. JPG and PNG are two commonly used bitmap format which are both compatible with Beam Studio.
The Engraving resolution can be set in Beam Studio by menu > Edit > Document Setting. Engraving resolution stands for the fineness and quality of the result. You will get more detailed results when the resolution is set to "High", "Low" means shorter working times while getting a rougher quality. The quality stands for the spacing of each line scanned by the laser which corresponds to 0.2mm /125 dpi, 0.1mm/250 dpi, and 0.05mm/500 dpi.
The exposure threshold value can be set when a bitmap image file is imported to Beam Studio. Find the "Shading" and "Threshold" option in the "Laser Config" label. When "Shading" is disabled, images will be transformed into monochromic, which is optimized for built-in "Monochromatic Engraving" parameters. When "Shading" is enabled, images will be transformed into greyscale, which is optimized for built-in "Shading Engraving" parameters.
The "Threshold" value can be adjusted when “Shading” is disabled. This function is based on the RGB color model which defines colors from 1 to 255. 1 stands for black and 255 stands for white. For example, setting the threshold value to 125 will turn all colors above 125 into white. | s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947473347.0/warc/CC-MAIN-20240220211055-20240221001055-00677.warc.gz | CC-MAIN-2024-10 | 1,591 | 4 |
https://www.tr.freelancer.com/projects/web-promotion/opt-email-address/ | code | We need opt in email address for USA. Please bid.
16 freelancers are bidding on average $73 for this job
Hi, I have a list of more than 20,000 (with name/email ids) consumers (1 year old). Let me know what price would you like to pay for each id. I can send across a sampl list for your reference. Regards
Hello Sir/Mam, We are interested in your project. Please send us the details as soon as possible. We will charge USD $0.25 cents per ID. Thank you. | s3://commoncrawl/crawl-data/CC-MAIN-2018-09/segments/1518891813109.8/warc/CC-MAIN-20180220224819-20180221004819-00560.warc.gz | CC-MAIN-2018-09 | 453 | 4 |
http://harmattan-dev.nokia.com/docs/ux/pages/Labels.html | code | There are two types of labels: Simple and rich. Their application and usage are described and illustrated below.
Simple labels should be used inside UI components such as buttons, header rows, titles or 'View menu' text where only one line of text is required without any special formatting.
Basic rules for Simple labels:
- Used for plain text on one line (e.g. device buttons)
- Does not wrap – if the label is too long, truncate it and add an ellipses "..." at the end of the label (a label must be at least 4 characters long to be eligible for truncation)
- Does not support any special interactions
Rich labels, on the other hand, support text formatting (e.g. bold or color) and wrapping rules. They should be used for long UI copy. They can also include links for more sophisticated interactions, including links to phone numbers, GPS locations, URLs and even other parts of the Nokia N9 UI.
Basic rules for Rich labels:
- Extends the behaviour of the label
- Used when text styling and formatting is desirable
- Can contain paragraphs (one or multiple lines with wrapping)
- Comes from separate graphical files (.css)
- Supports HTML tags for text formatting (e.g. bold, italics, color, etc)
- Supports highlighting for links and searchers | s3://commoncrawl/crawl-data/CC-MAIN-2013-48/segments/1386163056101/warc/CC-MAIN-20131204131736-00064-ip-10-33-133-15.ec2.internal.warc.gz | CC-MAIN-2013-48 | 1,249 | 14 |
https://www.hondacivicforum.co.uk/threads/bluetooth-adapter-for-mk8-2007-woes.85638/ | code | Hi. I've got a Bluetooth adapter that fits in the cd changer socket on the head unit but I'm having problems. When it's plugged in, I can pair my phone to the unit but the head unit won't switch to cd mode and it also mutes the audio. Any ideas? I can't tell if the unit is faulty or incompatible. Thanks guys. Andy. | s3://commoncrawl/crawl-data/CC-MAIN-2021-10/segments/1614178375096.65/warc/CC-MAIN-20210306131539-20210306161539-00636.warc.gz | CC-MAIN-2021-10 | 316 | 1 |
http://www.waterfall2006.com/gorman.html | code | Industry studies show a clear relationship between the maintainability of code and the expendability of developers. In your rush to deliver working software, there's always a danger that you might inadvertently introduce code "smiles". A code "smile" is some aspect of the code that makes other developers smile when they have to maintain it. Common code "smiles" include:
- Common sense naming conventions
- Cohesive and loosely coupled modules
- Elegant abstractions
- Lack of duplication
- A close resemblance to the application domain
Over time code "smiles" build up to create what is sometimes called maintainable code, more specifically, code that can be maintained by somebody other than the person that wrote it, and that means YOU!
Refuctoring is the process of taking a well-designed piece of code and, through a series of small, reversible changes, making it completely unmaintainable by anybody except yourself. Comprehensive regression testing guarantees that nobody will be any the wiser.
Years of experimentation has produced a set of refuctorings that can be applied to the code, to the development process, and to the people on your project. You will learn key refuctorings, including:
- Pig Latin (for naming conventions)
- Stating The Bleeding Obvious--comments that paraphrase the code (e.g., declare an integer called I with an initial value of zero)
- Module Gravity Well - find the biggest module and add all new code to that
- Unique Modeling Language - invent your own visual notations and explain them to nobody
- Treasure Hunt--Code should be made up largely of references to other code. Documents should reference other documents rather than have content of their own.
- Rainy Day Module--you should write spare code just in case somebody needs it later
- Developer Foxhole--if they don't know you're there, they can't ask you to explain your code...
Finally, you will be introduced to the Job Security Index, an industry standard metric for assessing how easily you can be replaced, which you can use to target your refuctoring efforts for maximum career value.
You can download the slides for this presentation. | s3://commoncrawl/crawl-data/CC-MAIN-2017-17/segments/1492917122933.39/warc/CC-MAIN-20170423031202-00266-ip-10-145-167-34.ec2.internal.warc.gz | CC-MAIN-2017-17 | 2,142 | 18 |
https://nycstartups.net/startups/vertical_search | code | Data as a service.
Simple, custom web scraping tools for researchers, growth hackers, marketing & sales teams.
Search engine for prospective college students
DegreeCast helps prospective college students find all their degree program options in one comprehensive search experience. The search engine crawls the web collecting information on as many relevant programs as possible and returns organized and filterable results. ... | s3://commoncrawl/crawl-data/CC-MAIN-2022-21/segments/1652662510117.12/warc/CC-MAIN-20220516104933-20220516134933-00698.warc.gz | CC-MAIN-2022-21 | 428 | 4 |
http://www.sex-lexis.com/Sex-Dictionary/shake%20the%20snake | code | The Language of Love, Lust, Sex
and All the Many-Splendored Things in Between in Teenspeak - Jockspeak - Menglish - Slanglish - Spanglish
Gaylese - Americanese - Britspeak - Ozslang - Funetic
Populo-Vulgar Speech - T-Shirt & Net Shorthand
Pompo-Verbosity & other Figurative Lingos
shake the snake:
To masturbate , said of males. See masturbation-male for synonyms.
See Also: bun-boogie, dew off the lily, go for a snake's hiss, one-eyed snake, shake, shake the dew off the lily, shake the peg, shake the sheets, shmok, snake, snake ranch, trouser snake, urination,
Dictionary of Sexual Terms - 24150 terms and expressions, 3500 quotes, 47000 synonyms
Dictionary of the F-Word - 865 terms and expressions 200 quotes, 2200 synonyms
Copyright © 2012 Technobusiness Ltd. | s3://commoncrawl/crawl-data/CC-MAIN-2015-40/segments/1443737913815.59/warc/CC-MAIN-20151001221833-00081-ip-10-137-6-227.ec2.internal.warc.gz | CC-MAIN-2015-40 | 767 | 11 |
http://maxtheitpro.blogspot.com/2008/08/where-is-64bit-flash-player.html | code | WELL, IT looks like 64-bit computing is starting to catch on over in the Windows camp with 64-bit version of Windows Vista picking up steam. The problem that's annoying the sh!t out of everyone is the super slooow release of a 64-bit Flash player from Macromedia (er Adobe). Looks like peeps have to use 32-bit Internet Explorer on 64-bit Vista whenever they're surfing pages with Flash content. That sucks!! I urge you folks to peek this very interesting Tech forum over at ZDNet.
So, have any of you gravitated to 64-bit computing yet? You do know you can get 64-bit versions of Linux and FreeBSD for free, right? :-)
Apple bytes into 64-bit computing...
Thank goodness the current version of Mac OS/X (aka Leopard) is fully 64-bit. And why shouldn't it be? After all, it's based on the rock solid BSD Unix and Mach architecture that's legendary in research circles. Anyhow, I'm more interested in 64-bit open source server products like MySQL, PostgreSQL, FirebirdSQL, TrixBox, Exim, Postfix et al. Since you have more addressing memory in a 64-bit operating system, programmers have the ability to create some truly POWERFUL software applications that will usher in a new era of computing. Apps dealing with encryption, sound, graphics, video, or querying large data sets will fly through the roof. This is the exciting part. Here's the kind of power Mac OS/X programmers are gonna have when developing native 64-bit apps using xcode 3.0:
- 64-bit addressing of up to 16 exabytes of virtual memory and 4 terabytes of physical memory
- Full 64-bit arithmetic
- 64-bit development tools
- 64-bit performance monitoring tools
- Seamless deployment
- LP64 data model
- Common source base support | s3://commoncrawl/crawl-data/CC-MAIN-2013-20/segments/1368696382560/warc/CC-MAIN-20130516092622-00096-ip-10-60-113-184.ec2.internal.warc.gz | CC-MAIN-2013-20 | 1,695 | 11 |
http://weblogs.asp.net/psteele/archive/2007/03/13/local-type-inference-anonymous-types-and-var.aspx | code | Local Type Inference, Anonymous Types, and var
Bill Wagner explains a bit about C# 3.0's local type inference:
Of all the features in C# 3.0, local type inference is generating the most questions and misunderstanding. You know, ‘var’. The fact is local type inference is not as scary as it seems. In fact, you’re not losing strong typing. It’s a simple time saver that is actually necessary to support anonymous types. | s3://commoncrawl/crawl-data/CC-MAIN-2013-20/segments/1368696384213/warc/CC-MAIN-20130516092624-00029-ip-10-60-113-184.ec2.internal.warc.gz | CC-MAIN-2013-20 | 426 | 3 |
https://pastaplus-core.readthedocs.io/en/latest/index.html | code | Welcome! Bienvenido! أهلا بك! 欢迎!
This is the official documentation tree of the PASTA data repository software. The PASTA software and related contents is owned and maintained by the Environmental Data Initiative (EDI). PASTA is a service oriented software system written in Java and uses Java Servlet containers for REST web-services. Services can be deployed on separate servers for performance or deployed onto a single server for simplicity, testing, and development. Deployments have been tested on Linux, OS X, and Windows. EDI utilizes PASTA in its operation of the EDI data repository.
Documentation is divided into the following categories:
About: A short history of the PASTA+ data repository software and how it is being used in EDI’s production environment.
Repository Design: Design documentation of the PASTA+ data repository software.
Standard Operating Procedures: Procedures for the general operation of the EDI data repository using the PASTA+ data repostiory software.
REST API: Documentation for the PASTA+ API and general information and suggestions for software developers who would like to build an application that interacts with the PASTA+ API.
Frequently Asked Questions: A list of the most commonly asked questions and their answers about the EDI Data Repository and PASTA+ data repository software. | s3://commoncrawl/crawl-data/CC-MAIN-2024-18/segments/1712296817729.0/warc/CC-MAIN-20240421040323-20240421070323-00003.warc.gz | CC-MAIN-2024-18 | 1,339 | 8 |
http://www.linuxjournal.com/article/9605?page=0,3&quicktabs_1=0 | code | A Look at Lua
Although taking a look at embedding and extending Lua is outside the scope of this article, I touch on a few concepts here. First, the Lua API is very straightforward. Its design eliminates the need for manual reference when embedded in C code (unlike Python's API). Like the language, Lua's C API (for embedding) is fairly minimalistic. If you need advanced functionality, you can use a secondary library that is primarily made up of preprocessor macros.
Second, C and C++ are not the only languages in which Lua can be embedded. Tao.Lua provides straight .NET and Mono bindings to Lua, and LuaJava allows scripts written in Lua to manipulate Java components. LuaJava allows Java components to be accessed from Lua with the same syntax that Lua uses for accessing its native objects. It also allows Java to use a Lua interface so that any interface can be implemented in Lua and passed as a parameter to any method. The method's result (when called in the Java program) is called in Lua, and the result is sent back to Java.
Lua is a flexible, powerful, compact language that can be used and extended in myriad situations. Its focus on simplicity makes for easy debugging and has attracted many users. Its simple, powerful syntax provides flexibility because of Lua's metamechanisms. The small, fast interpreter uses less resources than Python, and its syntax allows for easier code readability. Its simple C API makes embedding a breeze. Whether you are doing data processing, GUIs or game programming, you will find a use for Lua.
Joseph Quigley has been a Linux user for more than two years. He enjoys fiddling with different Linux distros and exploring new programming languages.
Practical books for the most technical people on the planet. Newly available books include:
- Agile Product Development by Ted Schmidt
- Improve Business Processes with an Enterprise Job Scheduler by Mike Diehl
- Finding Your Way: Mapping Your Network to Improve Manageability by Bill Childers
- DIY Commerce Site by Reven Lerner
Plus many more.
- diff -u: What's New in Kernel Development
- Giving Silos Their Due
- What's New in 3D Printing, Part III: the Software
- Server Hardening
- February 2016 Issue of Linux Journal
- 22 Years of Linux Journal on One DVD - Now Available
- Controversy at the Linux Foundation
- Don't Burn Your Android Yet
- New Products | s3://commoncrawl/crawl-data/CC-MAIN-2016-07/segments/1454701145751.1/warc/CC-MAIN-20160205193905-00321-ip-10-236-182-209.ec2.internal.warc.gz | CC-MAIN-2016-07 | 2,361 | 20 |
https://community.khronos.org/t/glbindtexture-problem/44527 | code | I am using glBindTexture in Windows, and I seem to have 2 problems:
- I cannot ask for new texture names after I got already some using glGenTextureNames. Do I have to unbind them all?
- After I changed the texture using glTexImage, I cannot change it any more. I thought that I was able to do as many as I want glTexImage after a glBindTexture. Where am I wrong?
Thanks a lot for the information! | s3://commoncrawl/crawl-data/CC-MAIN-2024-10/segments/1707947473735.7/warc/CC-MAIN-20240222061937-20240222091937-00321.warc.gz | CC-MAIN-2024-10 | 397 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.