/**
 * @file	httpUtil.c
 * @brief	HTTP Server Utilities
 * @version 1.0
 * @date	2014/07/15
 * @par Revision
 *			2014/07/15 - 1.0 Release
 * @author
 * \n\n @par Copyright (C) 1998 - 2014 WIZnet. All rights reserved.
 */

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "httpUtil.h"

uint8_t http_get_cgi_handler(uint8_t * uri_name, uint8_t * buf, uint32_t * file_len)
{
	uint8_t ret = HTTP_OK;
	uint16_t len = 0;

	if(predefined_get_cgi_processor(uri_name, buf, &len))
	{
		;
	}
	else if(strcmp((const char *)uri_name, "example.cgi") == 0)
	{
		// To do
		;
	}
	else
	{
		// CGI file not found
		ret = HTTP_FAILED;
	}

	if(ret)	*file_len = len;
	return ret;
}

uint8_t http_post_cgi_handler(uint8_t * uri_name, st_http_request * p_http_request, uint8_t * buf, uint32_t * file_len)
{
	uint8_t ret = HTTP_OK;
	uint16_t len = 0;
	uint8_t val = 0;

	if(predefined_set_cgi_processor(uri_name, p_http_request->URI, buf, &len))
	{
		;
	}
	else if(strcmp((const char *)uri_name, "example.cgi") == 0)
	{
		// To do
		val = 1;
		len = sprintf((char *)buf, "%d", val);
	}
	else
	{
		// CGI file not found
		ret = HTTP_FAILED;
	}

	if(ret)	*file_len = len;
	return ret;
}


Hi all! Running into an interesting problem where npm packages aren't being installed because the they are skipped. Looks like it has detected the package as already installed. Thought it was related to this issue: redguide/nodejs#50
But doesn't seem to be related because there are zero users that have the package installed. Any tips?


ImageMagick Compression Commands. Raw. // Must install ImageMagick first. //This compresses a. GitHub is where people build software. More than 28 million people use GitHub to discover, fork, and contribute to over 85 million projects. 25 Jun ImageMagick provides a fast, simple way to automate image resizing. .. PNG compression in ImageMagick can be configured with three.
|Published (Last):||19 June 2013|
|PDF File Size:||20.54 Mb|
|ePub File Size:||14.69 Mb|
|Price:||Free* [*Free Regsitration Required]|
This option enhances the intensity differences between the lighter and darker elements of the image. See -contrast-stretch for more details. A value of either 0 or results in a complete degree rotation of the image. Print a list of supported imagemagick compress for various options or settings.
Imzgemagick still the simple process of opening the image and saving it is something that just takes too imagemagick compress time. Note imagemagick compress at this time the same threshold dithering map is used imagemagick compress all color channels, no attempt is made to offset or rotate the map for different channels is made, to create an offset printing effect.
If more that the required number of coordinate pairs are given for a distortion, the distortion method is ‘least ckmpress fitted to produce the best result for all the coordinate pairs given.
The reason that we get a dual output result is because the frequency domain represents iagemagick image using complex numbers, which cannot be imagemagick compress directly. To ensure that it can do this it also ensures that the image has an alpha channel enabled, as per ” -alpha set “, for the imagemagick compress transparent colors, and does not require you to modify the -channel to enable immagemagick channel handling. Essentially -splice imagemagick compress divide the image into four quadrants, separating them by the inserted rows and columns.
Save time by transforming images in the command line
Large dots can be made to look better with a small amount of blurring after being created. It is possible imagemagick compress add -fuzz to make the trim more strict. All points are floating point values. Perform various imagemagick compress operation methods to a ordered sequence imagemagick compress images which may represent either a set of overlaid ‘image layers’, a GIF disposal animation, or a fully-‘coalesced’ animation sequence.
Images with fewer unique colors than specified by value will have any duplicate or unused colors removed.
image processing – Recommendation for compressing JPG files with ImageMagick – Stack Overflow
Use gamma correction to adjust for this color difference. The frames argument determine how many images to interpolate between each image. As such some colors may be merged together when they originally fell into the same ‘bin’. For example, assume you have a web imagenagick that processes images comprees imagemagick compress the Internet. That is how to determine the color of a point that falls between two, or even four different colored pixels.
A value of means no change, and any missing values are imagemagick compress to mean This can be used either for ‘super-sampling’ the image for a higher quality result, or for panning and zooming around the image with appropriate viewport changes, or imagemagick compress cropping and resizing.
It is equivalent to using the -gravity command-line option, except that it is imagemagick compress in scope to the -draw option in which it appears. ImageMagick uses standard filename globbing, so wildcard expressions may be used to remove more than one profile.
Use image to composite an image with another image. The process accumulates counts for every white pixel in the binary edge image imagemagick compress every possible orientation for angles from 0 imagemagick compress in 1 deg increments and distance from the center of the image to the corners in 1 px increments.
Any color that matches within -fuzz color distance of the given color argument, connected to that ‘seed point’ will imagemagick compress replaced with the current -fill color. In this way, imagemagick compress can obtain pieces of other windows that overlap the specified window, and more importantly, you can capture menus or other popups that are independent windows but appear over the specified window.
Though imagemagick compress is a lot faster, as it avoids all the filter processing of the image. Text is any UTF-8 encoded character sequence.
The quality-changing process is pretty good at imsgemagick space while maintaining apparent image quality. The argument to the -evaluate log typically is specified between and 10, depending upon the amount of detail that imagemagick compress wants to bring imagemagick compress in the spectrum. The skewX and skewY primitives skew them with respect to the origin of the main image or the region.
If this imagemagick compress is omitted, the JPEG library will comress its own default values. It then computes a new x,y centroid from those coordinates and a new mean.
It also does imagemagick compress work well for diagrams or cartoon like images. Larger imagemagick compress produce more visible detail. You can specify as many of these components as needed in any order e. This can also be used to convert a plain grayscale image into a one using the gradient of colors specified. The start and end points produced are then joined with a line segment and the resulting segment of an ellipse is filled. For example, if the value is 1, the effective period is simply the QuantumRange ; but imagemagick compress the value is 2, then the effective period is the half the QuantumRange.


/*
** EPITECH PROJECT, 2020
** my_ftp
** File description:
** TODO: add description
*/

#include "generic_list.h"

bool list_add_elem_at_back(list_t *front_ptr, void *elem)
{
    node_t *new = list_create_node(elem);
    node_t *temp = NULL;

    if (!new) return (false);
    if (list_is_empty(*front_ptr)) {
        *front_ptr = new;
        return (true);
    }
    for (temp = *front_ptr; temp->next; temp = temp->next);
    temp->next = new;
    return (true);
}


When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium intensity would be choosing a sufficiently large number of consecutive data points that seems as constant as possible and taking their average. Of course, with the usual sizes of data, it's nothing challenging — but why not make a similar programming contest problem while we're at it?

You're given a sequence of n data points a1, ..., an. There aren't any big jumps between consecutive data points — for each 1 ≤ i < n, it's guaranteed that |ai + 1 - ai| ≤ 1.

A range [l, r] of data points is said to be almost constant if the difference between the largest and the smallest value in that range is at most 1. Formally, let M be the maximum and m the minimum value of ai for l ≤ i ≤ r; the range [l, r] is almost constant if M - m ≤ 1.

Find the length of the longest almost constant range.


/*===================================================================

BlueBerry Platform

Copyright (c) German Cancer Research Center,
Division of Medical and Biological Informatics.
All rights reserved.

This software is distributed WITHOUT ANY WARRANTY; without
even the implied warranty of MERCHANTABILITY or FITNESS FOR
A PARTICULAR PURPOSE.

See LICENSE.txt or http://www.mitk.org for details.

===================================================================*/

#ifndef IWORKBENCHPARTSITE_H_
#define IWORKBENCHPARTSITE_H_

#include "berryIWorkbenchSite.h"

namespace berry {

struct IWorkbenchPart;

/**
 * \ingroup org_blueberry_ui_qt
 *
 * The primary interface between a workbench part and the workbench.
 *

 * This interface is not intended to be implemented or extended by clients.
 *

 * @noimplement This interface is not intended to be implemented by clients.
 */
struct BERRY_UI_QT IWorkbenchPartSite : public IWorkbenchSite
{

  berryObjectMacro(berry::IWorkbenchPartSite, IWorkbenchSite)

  ~IWorkbenchPartSite() override;

  /**
   * Returns the part registry extension id for this workbench site's part.
   *

   * The name comes from the id attribute in the configuration
   * element.
   *

   *
   * @return the registry extension id
   */
  virtual QString GetId() const = 0;

  /**
   * Returns the part associated with this site
   *
   * @return the part associated with this site
   */
  virtual SmartPointer<IWorkbenchPart> GetPart() = 0;

  /**
   * Returns the unique identifier of the plug-in that defines this workbench
   * site's part.
   *
   * @return the unique identifier of the declaring plug-in
   */
  virtual QString GetPluginId() const = 0;

  /**
   * Returns the registered name for this workbench site's part.
   *

   * The name comes from the name attribute in the configuration
   * element.
   *

   *
   * @return the part name
   */
  virtual QString GetRegisteredName() const = 0;

};

} // namespace berry

#endif /*IWORKBENCHPARTSITE_H_*/


Let's say you're trying to fit a model to a dataset that includes categorical variables, group (A or B) and treatment (1, 2, 3 or 4).
In R, your model formula would be DV ~ group * treatment (DV stands for dependent variable) and your model output will look like this:
(intercept) [...] groupB [...] treatment2 [...] treatment3 [...] treatment4 [...] groupB:treatment2 [...] groupB:treatment3 [...] groupB:treatment4 [...]
My question is how to interpret this kind of output. Below is what I believe is right for the interpretation of the main effects, and what puzzles me about the interaction parameters.
This the reference value, i.e. for treatment 1 in group A.
This is the difference between group A and group B for treatment 1 only.
This is the difference between treatment 1 and treatment 2, within group A only. It indeed still refers to the intercept value. Same logic for the two following estimates ("treatment3" and "treatment4").
Here is where I get puzzled. Is this testing if the difference between treatment1 and treatment2 is the same in groupB compared to groupA, or is it testing if if the difference between groupA and groupB is the same for treatment1 compared to treatment2.
I thought this question would be very basic, but I went through several R books with no luck and found inconsistent answers on here (see How to interpret 2-way and 3-way interaction in lmer? for support for the first idea and Interpreting the regression output from a mixed model when interactions between categorical variables are included for the other way).
If that matters, I'm working with the glmer function of the lme4 package.


One Must Fall: Battlegrounds Summary
22 February 2004 | By BCVlad
Well here I am again with a new game to review. From the box and info given, I saw I have some robot fighting ahead. After ripping open the box and loading the game I seem somewhat immersed into a Saturday morning cartoon.


Fedora 20 offers the newest version of Enlightenment. After over a decade of upstream development, the Enlightenment project has released the E17 desktop shell. a window manager and supporting suite of libraries.
Enlightenment can be configured as a fast, spartan window manager or as a visually appealing desktop environment with ample eye candy.
Enlightenment can be installed with the command
yum install @enlightenment and used by choosing it at login.
To learn more, read http://www.enlightenment.org/p.php?p=about&l=en
Fedora 20 features GNOME 3.10. This latest version of the GNOME desktop will have a number of new applications and features:
- New Feature: Fine grained scrolling when dragging the scroll bar handle, or scrolling while holding the shift key.
- New feature: Support for login and authentication with Smart Cards.
- New feature: Header bars: Header bars merge title bars and toolbars into a single element, giving more screen space to window content and improving presentation of application controls.
- Improved Magnifier with caret tracking, press F7 to activate caret.
- New Feature: Lock screen background customization
- New feature: Geolocation: A new geolocation framework allows features like automatic timezone updates when travelling and location detection in
- New feature:
GNOME Documentssupport for OwnCloud
- New feature: Drag and drop files between your computer and a
Boxesguest. Windows guests will need http://spice-space.org/download/windows/spice-guest-tools/ installed, and linux guests will need an updated version of spice-vdagent.
- New Feature:
Boxessupport for importing filesystem images
- Improved user interface for "Comtacts"
- Improved automatic scaling for high pixel density displays.
- Improved application selection in the shell Overview
- Flikr integration with GNOME Online Accounts allows access to Flikr content in GNOME Photos.
- Improved, integrated system status menu.
gnome-tweak-tool, with improved design, extension integration, and expanded functionality.
gnome-maps, A simple map application for the GNOME Desktop.
gnome-music, a streamlined application for playing and sharing music.
GNOME 3.10 also offers a technical preview of GNOME support for wayland. There is also preliminary support in this release for running GNOME-shell as a Wayland compositor, though Wayland may not be in the default packages for the final Fedora 20 release
GNOME in Fedora will offer a new, visually appealing application for browsing and installing applications. GNOME Software shows information relevant to users, such as descriptions, screenshots, reviews and more.
In support of this functionality, Fedora contributors have combined their efforts to offer assistance and patches to upstream projects to improve their presentation in Software. Applications describe themselves to
Software and other supporting tools using the AppData Specification
The older package management GUI, gpk-application, is still available.
To learn more about GNOME 3.10, check:
- Upstream release notes: https://help.gnome.org/misc/release-notes/3.10/
- New applications: https://help.gnome.org/misc/release-notes/3.10/more-apps.html
- User Experience updates: https://help.gnome.org/misc/release-notes/3.10/more-core-ux.html
- Internationalization notes: https://help.gnome.org/misc/release-notes/3.10/i18n.html
- Sysadmin/Developer Notes: https://help.gnome.org/misc/release-notes/3.10/developers.html
KDE Plasma Workspaces 4.11
KDE Plasma Workspaces 4.11 is a long term release of the popular, full featured desktop environment. Major changes have been made to user experience, personal information management, and performance aspects of the platform.
- Taskbar has been ported to QtQuick , providing more consistent and fluent behavior.
- Battery widget now supports keyboard brightness, and displays status for multiple batteries in peripherals, such as in mice and keyboards.
- Notification popups now have a configure button, allowing customization of the type of notification displayed.
- Kmix, the KDE sound mixer, performs better and more stably, in addition to adding media player controls to the widget
- Improved performance of Kwin, the KDE window manager.
- Improved user interface design in Kwallet.
- Kolourpaint, a simple painting application, now supports the WebP image format.
- PDF viewer Okular adds review tools and undo/redo support for annotations and forms.
- The JuK audio player and tagger adds support for playback and metadata editing of Ogg Opus format files.
- Improved Kontact Suite, including better archiving, scheduled mail sending, simple message filtering interface, better notifications, and scam detection in Kmail.
- Numerous optimizations to Dolphin reduce memory usage by up to 30%.
- Better indexing and various improvements to Nemopuk make searches up to 6x faster, adds indexing for ODF, docx and other document formats, and improves backup and restoration functionality.
- Note: Users upgrading to new versions of Nemopuk should expect their database to be automatically reindexed and upgraded. The conversion will consume more system resources than normal but will only occur on the first login after upgrading.
SDDM as Display Manager
The KDE Desktop environment will use SDDM instead of KDM as the designated display and login manager. SDDM is the successor to KDM, and adds support for QtQuick themes.
Some features may initially be missing from SDDM, such as VNC or multiseat support However, the SDDM development community is very active and regular additions to functionality are expected.
KDM, the previous display manager, is still available from the Fedora repositories. Install it with the command
yum install kdm and enable with the command
systemctl enable --force kdm.service
Plasma-nm Network applet
KDE in Fedora 20 includes Plasma-nm, a new applet for network management. It supports user-friendly creation and editing of all connection types from NetworkManager, including bridges, bonds, and VPNs, with a modern and intuitive interface.
In Fedora 20 the MATE desktop Bluetooth applet suffers compatibility issues with Bluez5. Users needing Bluetooth functionality should install the


- Security is a load of bullsh*t. There's nothing stopping someone from compiling their lua code with a standalone lua executable, and then loading it in via a widget. Just because so far nobody has bothered to do it and put it all in plain text, doesn't mean it cant be done.
It can't do much more than block Spring using an infinite loop or allocate infinite memory or so, whereas a native AI has full access to everything the user has access to, so it can wipe all your files, install trojans, etc.
Updates to the AI require a re-release of the entire game and a version bump
No reason a game would require a full re-release on an update to a Lua AI. The only real disadvantages here are:
- It's impossible to make an AI that, when installed, is only a single file. Not much native AIs have this property either, though (only KAIK?).
- It has a worse user experience when the AI is separate (Need to pick the AI mutator for the game to be able to add the AI...)
Bundling with an archive is anticompetitive
A half decent content developer packages his mod up in an installer, thus negating the advantage of bundling AIs in the archive
So both Lua AIs and native AIs are equally anticompetitive for half decent content developers. Additionally, when a native AI is bundled you need full re-release on an update to the native AI too. (except when it is self updating, but I've yet to see that implemented [in a safe and cross-platform way])
A third major advantage of Lua AIs is that they need no compiling and work on all platforms on which Spring works. This doesn't apply to native AIs.
I agree with the other points, although IMO adapting to custom game rules and implementing APIs and stuff other than those which apply to the target game(s) may be a waste of time if the goal is simply to make a reasonable AI in the shortest amount of time possible.


Once Vasya played bricks. All the bricks in the set had regular cubical shape. Vasya vas a talented architect, however the tower he built kept falling apart.

Let us consider the building process. Vasya takes a brick and puts it on top of the already built tower so that the sides of the brick are parallel to the sides of the bricks he has already used. Let's introduce a Cartesian coordinate system on the horizontal plane, where Vasya puts the first brick. Then the projection of brick number i on the plane is a square with sides parallel to the axes of coordinates with opposite corners in points (xi, 1, yi, 1) and (xi, 2, yi, 2). The bricks are cast from homogeneous plastic and the weight of a brick a × a × a is a3 grams.

It is guaranteed that Vasya puts any brick except the first one on the previous one, that is the area of intersection of the upper side of the previous brick and the lower side of the next brick is always positive.

We (Vasya included) live in a normal world where the laws of physical statics work. And that is why, perhaps, if we put yet another brick, the tower will collapse under its own weight. Vasya puts the cubes consecutively one on top of the other until at least one cube loses the balance and falls down. If it happens, Vasya gets upset and stops the construction. Print the number of bricks in the maximal stable tower, that is the maximal number m satisfying the condition that all the towers consisting of bricks 1, 2, ..., k for every integer k from 1 to m remain stable.


In the last Monday of the January they held the first meeting of industry applications society (IEEE IAS) in Jordan that organized by:(IEEE YP Jordan ),(IEEE IAS Jordan section) and (IEEE PUST).
The meeting include some issues ,the most important is :
1_ introduction by Dr.Ghaith abanda about IEEE jordan section .
2_ Presentation what is IAS for student chapter by Dr.peter Magyar.
3_ Technical workshop about smart Grid represented by prof. Wie jin lee.
The meeting gave the opportunity for student branch to veiw some of them achievements ,and submitted an award for previous society chair Tareq shnawer to thank hem for the hard work to development them society (PES/IAS).


I’m in a group called /dev/color, which is a professional development group for black engineers. I’ve been a member for the past three years, and I’m kicking off my fourth year in the program. Membership has impacted me in numerous ways, but I want to highlight one thing I’ve learned that is applicable beyond this specific network:
Ask for help.
/dev/color has a private Slack network, and in that network, there’s a channel called #askforhelp. It’s exactly what it sounds like. But it took me a while to being getting the most out of it. Turns out, it’s not so simple for me to ask for help.
Going it alone
I’ve come to realize that I have internalized a “figure it out myself” mindset. This probably derives from not feeling safe being publicly incorrect during my childhood, which in turn might come from anxiety and environment.
I grew up a black kid in a overwhelming white community. My family taught me that being black meant working twice as hard for opportunities and making a strong first impression to overcome the implicit assumption that I’m not as qualified—also known as prejudice. That taught me to come into new spaces knowing answers. Being informed and prepared has served me well as I have navigated adult life.
But sometimes, the strengths we lean on become maladaptive in certain situations. In my case, I advanced past the point where I could succeed on pure intuition. When I first became a engineering manager, I struggled with the transition. I came into my role with problems conceptualized and solutions planned. I led from the front, like a hero engineer, instead of focusing on setting my teammates up to drive the work forward. Deliverables went out on time, but my team wasn’t happy. I found myself having to work my way out of a rut.
Changing it up
Fortunately, /dev/color came to New York shortly thereafter. I joined and began finding ways to leverage the organization to help me in my career. I realized I didn’t have figure out everything on my own. Receive and applying wisdom from the group helped me come to grips with my new job.
Fast forward to the beginning of my second year in /dev/color. As both professional and personal development tasks came up, I realized I was doing too much in my own head before simply posting my issue to #askforhelp. Take, for example, the task of getting my household financial situation in shape. I floundered on my own for a year simply trying to figure out where to start before realizing I should reach out to my network for advice. I did so on January 22, 2018, which yielded a couple book recommendations that unblocked my progress. By February 11, I had the first entry in the Our Financial Planning Voyage series up, and I was off and running. At the end of the year, I felt like my family was in command of our financial plan. Who knows how much value was unlocked by simply asking for help.
It finally dawned on me that I’m programmed to ask for help as my last option. I realized I had more work to do to break out of this habit. I needed to change my mindset.
I now consciously try to override my tendency towards solitary struggle. I still do my independent research before I ask a question. After all, people help those who help themselves. But, I’m already planning to post my question in advance. My research is meant to help me craft a better question and be a good participant in the subsequent discussion. So there’s actually a little bit of nuance to the technique.
/dev/color is one of several networks I belong to that serves this purpose for me. These networks center around all sorts of identities, affiliations, and shared experiences. Shared contexts help create the emotional safety to publicly not know something. I’m in networks of shared former employers and networks of more-or-less random chains of acquaintances. This technique is applicable anywhere. If you’re brave, you might even have success asking in a public space, like Twitter.
Passing it on
My “ask for help” technique has helped me get better information faster, but it also has side benefits. First of all, it makes these networks stronger. I have noticed a virtuous cycle of help requested and given the more I participate. I realized I was contributing to an environment of psychological safety and knowledge sharing. Secondly, I’ve noticed that good questions lead to valuable discussions, with follow-up questions from others and productive tangents. Often, a lot of people end up getting helped from one initial question.
This all might seem obvious to some folks, but if you’re anything like me, maybe it’s actually a pretty big shift. It’s part of a broader shift I’m making towards being comfortable in vulnerability, but that’s a topic for another day.
I hope you, too, begin to find better answers, quicker.


I need some help to find some fossil records of Meteorus (Braconidae, Euphorinae). 1 year ago I found a nice list of fossil hymenoptera on the web, unfortunately I can't find it again. The list showed species, age, area of location etc...
Does anybody know something about this or maybe where else I can find this info?
I need fossil info to do some age analyses.


Vertical Scroll on Android is rare. https://www.tutlane.com/tutorial/android/android-scrollview-horizontal-vertical-with-examples has animation of one such scroll and Microsoft Outlook web application (old style) is another example. Both cases show that scrollbar is so narrow that it is impossible to use it for actual scrolling with this, it seems to me that these scrollbars are for indication only? So, is it true, that Android vertical scroll can be for the information only?
But how to handle the situation when the content is grid that is full with actionaly content? I can not just touch any spot in this content, becuase then field become editable, the popup menus or selection lists opens, etc. I have thought about adding very wide scrollbar to implement scorlling, but apparently this could be very strange. I can preserve the information narrow scroll, but I feel that I should be some non-hot are in my content that can be used for the touching and scrolling only.
Note, that my uses cases involves predetermined length list, no infinite scrolling.
Is all this really true about Android scroll UIX?


Re: RFS: picocli/3.5.2-1 [ITP] -- mighty tiny CLI library for JVM applications
> I'm willing to sponsor the picocli package since this is a dependency of
> JUnit 5.
Thank you for sponsoring picocli package!
I received notification with URL:
https://ftp-master.debian.org/new/picocli_3.5.2-1.html. I see, that
maintainer was changed to Debian Java Maintainers (no problem with
that). Is it standard for Java packages to have maintainer set to
Debian Java Maintainers? Or, is it standard for commonly used Java
> Do you plan to work on other Java packages after picocli?
Yes, I would like to. I have already following in mind:
* Google Auto (for AutoValue): https://github.com/google/auto
* gradle-apt-plugin: https://github.com/tbroyer/gradle-apt-plugin
* my work-in-progress Java CLI tool: https://github.com/kravemir/svg-labels
Or, do you have something else, specific, in mind?


Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.

You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m queries. Each query is described by a pair of integers li, ri (1 ≤ li < ri ≤ n). The answer to the query li, ri is the number of such integers i (li ≤ i < ri), that si = si + 1.

Ilya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.


Play YouTube Videos
Use an embedded player to play videos directly in your app and customize the playback experience.
Add YouTube Data
Let users search YouTube content, upload videos, create and manage playlists, and more.
Analytics & Reporting
Understand your users and how they interact with your channel and your videos.
Enable users to subscribe to your YouTube channel with one click.
Schedule live YouTube broadcasts and manage your broadcast video streams.


SAKE Lab member Fotis Kokkoras and final year student Thanos Pigadas participated in a hackathon event on open data exploitation, organized by Innovathens. They presented the web version of fuelGR, a family of applications built around the fuelGR API, which in turn is fed with prices of the Greek fuel market, provided by http://www.fuelprices.gr/. The application ranked at first place and received exceptional comments.
The Greek pages of the site are now available.
Please, feel free to provide feedback through the contact form.


I have never used any form of version control. The reason is because I just can’t figure out how to use one. Many times I have said to myself I need to be using some kind of version control, I try to set it up, fail, then continue to not use one. Last time I spent about an entire week researching SVN before I finally gave up. Now that voice in the back of my head is once again telling me I need to setup some kind of version control.
So first of all… which is the easiest to set up?
Is there a book/article/tutorial that takes you from having no knowledge at all to quickly being able to have one up and running on your website?
I would really like to be using one.


This application can easily manage the map to "Place where it wants to go".
GoogleMap to the place where it wants to open the screen and to go one-touch opens it soon.
In addition, the place can be taught the friend by transmitting the place with mail.
At the time of meeting Time when place where I am is taught
and delicious restaurant, etc.
When the place is taught the person, it is convenient.
About the registration of the place where it wants to go
It selects it from three below pushing an upper "Add New Map" button.
"Map": It is possible to register by doing the tap on the Google map screen.
"here from GPS": The present place is registered.
"write directly": Coordinates are personally input and registered.
About the edit of E-mail and data
It is long push in the screen of the start,
the following can be done.
"mail" The place can be transmitted with mail.
"delete" Data is deleted.
"edit name" It is name of data revokable.
Difference with pay version
20 maps can be registered.
The advertisement is inserted.
↓↓↓ webPage ↓↓↓


I am Julien Diener, currently living in Paris. This is my personal website
Download my CV
I have been coding since I am a kid. After a B.Sc. in Math at Heriot-Watt University (Edinburgh),
I got a Ph.D. in Computer Graphics at INPG (Grenoble). I then worked in several projects, with physicists, biologists,
and now with quants (the math part of finance).
So, on one hand, I think I am a good coder with strong math skill. And I consider my-self a Full-Stack Hacker:
- Full-Stack because I make decisions based on all involved components and efficiency of the development process
- Hacker because I like to find and take advantages from the subtleties-that-matter
And on the other hand, during my career working with many different people and topics, I became particularly proficient for
the design of numerical workflow in complex, interdisciplinary, projects. Also, I developed a strong managerial sense
based on two main principles:
- Honesty: to put it simply, the expectation of all collaborators, and clients, should be clear
- Short cycles and agility: every communication, development and test steps should be as short, frequent and
automatized as possible. Agile methods are here to help us.


/** @file
  Policy definition for PCIe Config Block

  Copyright (c) 2018 - 2019, Intel Corporation. All rights reserved.<BR>
  SPDX-License-Identifier: BSD-2-Clause-Patent

**/

#ifndef __PCIE_PREMEM_CONFIG_H__
#define __PCIE_PREMEM_CONFIG_H__

#include <GpioConfig.h>

///
/// SA GPIO Data Structure
///
typedef struct {
  GPIO_PAD      GpioPad;        ///< Offset 0: GPIO Pad
  UINT8         Value;          ///< Offset 4: GPIO Value
  UINT8         Rsvd0[3];       ///< Offset 5: Reserved for 4 bytes alignment
  UINT32        Active  :1;     ///< Offset 8: 0=Active Low; 1=Active High
  UINT32        RsvdBits0:31;
} SA_GPIO_INFO_PCIE;

///
/// SA Board PEG GPIO Info
///
typedef struct {
  SA_GPIO_INFO_PCIE  SaPeg0ResetGpio;    ///< Offset 0:  PEG0 PERST# GPIO assigned, must be a PCH GPIO pin
  SA_GPIO_INFO_PCIE  SaPeg3ResetGpio;    ///< Offset 12: PEG3 PERST# GPIO assigned, must be a PCH GPIO pin
  BOOLEAN            GpioSupport;        ///< Offset 24: 1=Supported; 0=Not Supported
  UINT8              Rsvd0[3];           ///< Offset 25: Reserved for 4 bytes alignment
} PEG_GPIO_DATA;

#endif /* __PCIE_PREMEM_CONFIG_H__ */


Ehab loves number theory, but for some reason he hates the number $$$x$$$. Given an array $$$a$$$, find the length of its longest subarray such that the sum of its elements isn't divisible by $$$x$$$, or determine that such subarray doesn't exist.

An array $$$a$$$ is a subarray of an array $$$b$$$ if $$$a$$$ can be obtained from $$$b$$$ by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.


Final week the Web Archive upped our bandwidth skill 30%, in step with increased usage and increased monetary toughen. Thanks.
This is our outbound bandwidth graph that has several tales to relate…
A year within the past, usage change into 30Gbits/sec. At the starting of this year, we were at 40Gbits/sec, and we were dealing with it. That is 13 Petabytes of downloads per 30 days. This has served tens of millions of customers to materials within the wayback machine, these listening 78 RPMs, these making an attempt digitized books, streaming from the TV archive, and heaps others. We were about the 250th most smartly-appreciated web device basically based fully totally on Alexa Web.
Then Covid-19 hit and quiz rocketed to 50Gbits/sec and overran our network infrastructure’s potential to accommodate it. A lot so, our network statistics probes had diagram back collecting data (hence the white spots within the graphs).
We supplied a 2d router with novel line cards, and received it put in and running (and none of this is easy during a plague), and increased our skill from 47Gbits/sec height to 62Gbits/sec height. And we’re dealing with it better, but it completely continues to be consumed.
Alexa Web now says we’re about the 160th most smartly-appreciated web device.
So now we’re making an attempt on the next steps up, that can also preserve extra instruments and is extra wizardry, but we’re engaged on it.
Thanks as soon as more for the toughen, and within the occasion you wish to donate extra, please perceive it will originate collections to attend tens of millions. https://archive.org/donate


Becoming a better software developer involves a combination of technical skills, personal growth, and professional development. Here are ten tips to help you improve as a software developer:
1. Continuously Learn and Stay Updated: Software development is a rapidly evolving field. Stay up to date with the latest technologies, programming languages, frameworks, and best practices. Read books, participate in online courses, attend conferences, and follow industry blogs and forums.
2. Practice Regularly: Coding is a skill that improves with practice. Dedicate regular time to coding exercises, personal projects, and challenges. By writing code consistently, you'll become more efficient, learn new techniques, and reinforce your knowledge.
3. Seek Feedback and Collaborate: Actively seek feedback from peers, mentors, and code reviews. Collaboration helps you learn from others and exposes you to different perspectives and approaches. Engage in discussions, participate in open-source projects, and be open to constructive criticism.
4. Master Fundamentals: Solidify your understanding of core computer science concepts like algorithms, data structures, and design patterns. Strong fundamentals enable you to solve complex problems efficiently and build scalable, robust software.
5. Write Clean and Maintainable Code: Strive for clean, readable, and maintainable code. Follow coding standards, adhere to naming conventions, and use appropriate design patterns. Write modular code, utilize comments effectively, and focus on code simplicity and clarity.
6. Embrace Testing: Write tests for your code to ensure it functions as intended and to catch bugs early. Familiarize yourself with different testing methodologies such as unit tests, integration tests, and automated testing frameworks. Writing testable code improves code quality and reduces future issues.
7. Version Control: Learn and use a version control system like Git. Version control helps track changes, collaborate with others, and revert to previous versions if necessary. Understand branching and merging strategies to manage code effectively.
8. Improve Problem-Solving Skills: Software development involves solving problems. Sharpen your problem-solving abilities by practicing algorithmic challenges, puzzles, and logical reasoning exercises. Develop the ability to break down complex problems into smaller, manageable steps.
9. Communication and Collaboration: Effective communication and collaboration are vital skills for software developers. Clear communication with team members, stakeholders, and clients helps to align expectations, gather requirements, and work together efficiently. Develop interpersonal skills and actively participate in team discussions and meetings.
10. Embrace Continuous Improvement: Software development is a continuous learning process. Embrace a growth mindset and strive for constant improvement. Reflect on your work, identify areas for growth, and seek opportunities to expand your knowledge and skill set.
Remember, becoming a better software developer is a journey that requires consistent effort and dedication. Embrace new challenges, learn from failures, and stay passionate about your craft.
better Software,Programmer,Top 10,Tips & Tricks,


Polycarp has guessed three positive integers $$$a$$$, $$$b$$$ and $$$c$$$. He keeps these numbers in secret, but he writes down four numbers on a board in arbitrary order — their pairwise sums (three numbers) and sum of all three numbers (one number). So, there are four numbers on a board in random order: $$$a+b$$$, $$$a+c$$$, $$$b+c$$$ and $$$a+b+c$$$.

You have to guess three numbers $$$a$$$, $$$b$$$ and $$$c$$$ using given numbers. Print three guessed integers in any order.

Pay attention that some given numbers $$$a$$$, $$$b$$$ and $$$c$$$ can be equal (it is also possible that $$$a=b=c$$$).


ISRO Ahmedabad office just informed me that the four episodes of the info-tainment series Digital Funda that I had written back in 2002-03 has already been aired on Doordarshan. And I missed them! Anyway, they at least saw the light of the day. It was a simple animated program explaining the little kids how the computer works. Better late than never.


The "Parmigiana di melanzane" is a typical Italian dish. Alessandro and Bianca have very different tastes when it comes to it: Alessandro loves to eat Parmigiana with seafood, but Bianca thinks it is an atrocity! To decide which ingredients to include in the dish they prepare, they play the following game.

There are $$$n$$$ possible ingredients, labeled from $$$1$$$ to $$$n$$$. The higher the label, the closer the ingredient is to being seafood. The ingredients are connected by $$$n - 1$$$ edges, in such a way as to form a tree. Alessandro and Bianca take turns, with Alessandro going first. They alternately choose a terminal ingredient $$$x$$$, that is an ingredient currently connected to at most one other ingredient, and remove it from the tree. If the terminal ingredient $$$x$$$ was chosen by Alessandro, it goes in the recipe; if it was chosen by Bianca, it is discarded.

The taste of the Parmigiana is measured as the maximum label of an ingredient in the recipe. Alessandro wants to maximize the taste, while Bianca wants to minimize the taste. If both play optimally, what is the taste of the Parmigiana?


In the previous level, we looked at enumeration, abbreviation and algorithmic encodings. But there are more kinds of encoding schemes.
A hierarchy partitions the set of values into disjoint categories, then partitions those categories into subcategories, and so forth until some final level is reached. Such schemes are shown either as nested sets or as tree charts. Each category has some meaning in itself and the subcategories refine meaning further.
The most common example is the Dewey Decimal Classification (DDC) system, used in public libraries in the English-speaking world. It is based on numeric ranges of decimal numbers. The 500 number series covers "Natural Sciences"; within that, the 510's cover "Mathematics"; finally, 512 deals with "Algebra" in particular. The scheme could be carried further, with decimal fractions for kinds of algebra.
Hierarchical encoding schemes are great for large data domains that have a natural hierarchy. They organize the data for searching and reporting along that natural hierarchy and make it very easy. But there can be problems in designing these schemes. First of all, the tree structure does not have to be neatly balanced, so some categories may need more codes than others and hence more breakdowns. Eastern and ancient religions were shortchanged in the original DDC, reflecting a prejudice toward Christian and Jewish writings. Asian religions were pushed into a very small set of codes. Today, the Library of Congress has more books on Buddhist thought than on any other religion on Earth.
Second, you might not have made the right choices as to where to place certain values in the tree. For example, in the original DDC, books on logic are in 164, a subcategory in the philosophy section, and not under the 510s, mathematics. In the nineteenth century, there was no mathematical logic. Today, nobody would think of looking for logic under philosophy – it is math. Dewey was simply following the conventions of his day. And like today's programmers, he found that the system specifications changed while he was working.
There are two ways to model these encoding schemes. The first is a simple list and the other is range pairs. The skeleton for Dewey might be:
CREATE TABLE Library_Catalog (ddc CHAR(7) NOT NULL PRIMARY KEY CHECK (ddc LIKE '[0-9][0-9][0-9].[0-9][0-9][0-9]'), ddc_name VARCHAR(35) NOT NULL, ..);
CREATE TABLE Library_Catalog (low_ddc CHAR(7) NOT NULL PRIMARY KEY CHECK (ddc LIKE '[0-9][0-9][0-9].[0-9][0-9][0-9]'), high_ddc CHAR(7) NOT NULL CHECK (ddc LIKE '[0-9][0-9][0-9].[0-9][0-9][0-9]'), ddc_name VARCHAR(35) NOT NULL, ..);
I prefer the range pair approach, since the description can be at the higher level. That is,
INSERT INTO Library_Catalog VALUES ('500.000', '599.999', 'Natural Sciences'), ('510.000', '510.999', 'Mathematics'), ('511.000', '511.999', 'Algebra'), etc ;
However, if the hierarchy is not large or deep, it might be better to use a simple list.
The worst possible way to do these encodings is to confuse a hierarchy and a hierarchical encoding. Yes, it actually happens! A posting by Westside2008, with narrative instead of DDL asked for a CTE to query a table that stores product categories. The table has three columns whose original names were not ISO-11179 standard, so I fixed them.
CREATE TABLE Product_Categories (product_cat INTEGER NOT NULL PRIMARY KEY, product_cat_name VARCHAR(20) NOT NULL, parent_product_cat INTEGER -–REFERENCES Product_
The request was to find the superior and subordinate categories given an input. The answer is the usual CTE pattern, one for each direction:
WITH Subordinate_CTE (product_cat, product_cat_name, parent_product_cat) AS (SELECT product_cat, product_cat_name, parent_product_cat FROM Product_Categories WHERE parent_id = @in_search_cat) UNION ALL SELECT P.product_cat, P.product_cat_name, P.parent_id FROM Product_Categories AS P. Subordinate_CTE AS S WHERE S.product_cat = P.parent_id) -- select from the cte SELECT product_cat, product_cat_name, parent_product_cat FROM Subordinate_CTE;
Compare this to the query for searching the Dewey Decimal Classification:
Here is with the simple list:
SELECT ddc, ddc_name FROM Library_Catalog WHERE ddc LIKE @in_ddc_pattern;
If I want to find all the math books, I use SET @in_ddc_pattern = '51_.%' and I am done. Since the ddc column is a key, it is indexed, there is no need for cursors and loops (which is what a recursive CTE is internally).
If I use the range pairs, the query becomes:
SELECT ddc, ddc_name FROM Library_Catalog WHERE @in_ddc BETWEEN low_ddc AND high_ddc;
A vector is made up of a fixed number of components. These components can be ordered or unordered, but are almost always ordered; they can be of fixed or variable length. The components can be dependent on or independent of each other, but the code applies to a single entity. The components of the vector can be determined by punctuation, symbol-set changes, or position within the code.
An example is the ISO code for tire sizes, which is made up of a wheel diameter (scaled in inches), a tire type (abbreviation code), and a width (scaled in centimeters). Thus, 15R155 means a 15-inch radial tire that is 155 millimeters wide, whereas 15SR155 is a steel-belted radial tire with the same dimensions. In spite of the mixed American and ISO units, this is a general physical description of a tire in a single code.
Vector schemes are very informative and allow you to pick the best scheme for each component. But they have to be disassembled to get to the components. Sorting by components is hard unless you want them in the order given; try to sort the tire sizes by construction, width, and diameter instead of by diameter, construction, and width.
Another disadvantage is that a bad choice in one component can destroy the usefulness of the whole scheme. Extending the code can be hard or easy. For example, if we invent a new kind of tire material, we jut add another abbreviation since this code is variable length.
But if the tire code had to be expanded to include thickness in millimeters, where would that measurement go? Another number would have to be separated by a punctuation mark. It could not be inserted into a position inside the code without giving ambiguous codes. The code cannot be easily converted to a fixed-position vector encoding without changing many of the database routines.
A concatenation code is made up of a variable number of components that are concatenated together. As in a vector encoding, the components can be ordered or unordered, dependent on or independent of each other, and determined by punctuation, symbol-set changes, or position.
A concatenation code is a cross between a hierarchy and a vector. The hierarchy is traversed by additions to the right. These are also known as facet codes in Europe. Or the code can be a list of features, any of which can be present or missing. The order of the components may or may not be important.
Concatenation codes were popular in machine shops at the turn of the 20-th century: a paper tag was attached to a piece of work, and workers at different stations would sign off on their parts of the manufacturing process. Concatenation codes are still used in parts of the airplane industry, where longer codes represent subassemblies of the assembly in the head (also called the root or parent) of the code.
Another type of concatenation code is a quorum code, which is not ordered. These codes say that (n) out of (k) marks must be present for the code to have meaning. For example, three out of five inspectors must approve a part before it passes.
The most common use of concatenation codes is in keyword lists in the header records of documents in document systems. The author or librarian assigns each article a list of keywords that describe the material covered by the article. The keywords are picked from a limited, specialized vocabulary that belongs to some particular discipline.
These codes could also be ambiguous if they were poorly designed. For example, is the head of 1234 the 1 or the 12 substring? When concatenation codes are used in databases, they usually become a set of "yes/no" check boxes, represented as adjacent columns in the file. This makes them Boolean vector codes, instead of true concatenation codes.
General Guidelines for Designing Encoding Schemes
These are general guidelines for designing encoding schemes in a database, not firm, hard rules. You will find exceptions to all of them.
Existing Encoding Standards
The use of existing standard encoding schemes is always recommended. The government or industry agency that provides these codes has someone who sat down and did nothing but work on this scheme. He probably did a better job than you could. In many cases he is also the trusted source for the data.
Allow for Expansion
Allow for expansion of the codes. The ALTER statement can create more storage when a single-character code becomes a two-character code, but it will not change the spacing on the printed reports and screens. Start with at least one more decimal place or position than you think you will need. Visual psychology makes "01" look like an encoding, whereas "1" looks like a quantity.
Use Explicit Missing Values to Avoid NULLs
Avoid the SQL general NULL as much as possible by putting special values in the encoding scheme instead. SQL handles NULLs differently from values and NULLs don't tell you what kind of missing value you are dealing with.
All-zeros are often used for missing values; all-nines, for miscellaneous values. For example, the ISO gender codes are 0 = Unknown, 1 = Male, 2 = Female, and 9 = Not Applicable. "Not applicable" means a lawful person, such as a corporation, which has no gender.
Keep the Codes in the Database
There should be a part of the database that has all of the codes stored in tables. These tables can be used to validate input, to translate codes in displays, and as part of the system documentation.
I was amazed to go to a major hospital in Los Angeles in mid-1993 and see the clerk still looking up codes in a dog-eared looseleaf notebook instead of bringing them up on her terminal screen. The hospital is still using a very old IBM mainframe system, which has "dumb" 3270 terminals, rather than a client/server system with workstations. There was not even a help screen available to the clerk.
The translation tables can be downloaded to the workstations in a client/server system to reduce network traffic. They can also be used to build picklists on interactive screens and thereby to reduce typographical errors. Changes to the codes are thereby propagated in the system without anyone having to rewrite application code. If the codes change over time, the table for a code should have to include a pair of "date effective" columns. This will allow a data warehouse to correctly read and translate old data.
Use One Table per Encoding
This should be obvious. But, there is a nightmare called the “One True Lookup Table” or OTLT. It is a relative of the EAV (Entity-Attribute-Value) design flaw. All the encodings are shoved into one table for the entire DB.
CHECK() constraints become impossible, the OTLT becomes huge, and it is constantly being locked for updates. Security becomes insanely complex.
Put Constraints on the Encodings
This should be obvious, too. It lets you define business rules one place, one way, one time and pass information. Without it, imagine adding CHECK() constraints on every table that uses, say, ZIP codes or telephone numbers.
Put VIEWs on the Encodings
This is not obvious. This tip usually is part of security. A Dentist should not be using medical procedure codes for heart surgeries. But it could be an honest typo by an input clerk. Even with the translation of the code on the screen, they might not recognize the technical terms and keep on going. The right way to do this is a VIEW of dental-only codes for the Dentist office. By keeping the whole encoding scheme in one place, instead of in CHECK() constraints, you guarantee consistency.
Translate Codes for the User
In some cases, you can display just the code to the end users. For example, most people do not need to see the two-letter state abbreviation written out in full in a street address. But if the encoding is obscure, you will want to inform the end user.


Little Petya is preparing for the first contact with aliens. He knows that alien spaceships have shapes of non-degenerate triangles and there will be exactly 4 ships. Landing platform for a ship can be made of 3 special columns located at some points of a Cartesian plane such that these 3 points form a triangle equal to the ship with respect to rotations, translations (parallel shifts along some vector) and reflections (symmetries along the edges). The ships can overlap after the landing.

Each column can be used to land more than one ship, for example, if there are two equal ships, we don't need to build 6 columns to land both ships, 3 will be enough. Petya wants to know what minimum number of columns will be enough to land all ships.


Recovering deleted text messages....
I have been looking all over the forums to find an answer to this, but I stupidly deleted a threat of very important messages from my phone, and I was wondering if there is anyway that I can recover these messages from my phone? I have a HTC Hero it is about 2 years old now.
Please if you know let me know, or perhaps point me in the right direction
One very concerned user


You are given a permutation $$$p$$$ of length $$$n$$$ — an array, consisting of integers from $$$1$$$ to $$$n$$$, all distinct.

Let $$$p_{l,r}$$$ denote a subarray — an array formed by writing down elements from index $$$l$$$ to index $$$r$$$, inclusive.

Let $$$\mathit{maxpos}_{l,r}$$$ denote the index of the maximum element on $$$p_{l,r}$$$. Similarly, let $$$\mathit{minpos}_{l,r}$$$ denote the index of the minimum element on it.

Calculate the number of subarrays $$$p_{l,r}$$$ such that $$$\mathit{maxpos}_{l,r} > \mathit{minpos}_{l,r}$$$.


Assignment to translate a text of 247 words from English to German. A text related to food, for an exclusive rent-a-chef-business. A great feeling for nuances in the German language is required.
25 freelanceria on tarjonnut keskimäärin %project_bid_stats_avg_sub_26% %project_currencyDetails_sign_sub_27% tähän työhön
Hi, I will complete this project within 12 hrs and I will provide you high quality human translation. Kindly award me this project please. Regards START-UP TRANSLATION


Oleg the bank client lives in Bankopolia. There are n cities in Bankopolia and some pair of cities are connected directly by bi-directional roads. The cities are numbered from 1 to n. There are a total of m roads in Bankopolia, the i-th road connects cities ui and vi. It is guaranteed that from each city it is possible to travel to any other city using some of the roads.

Oleg wants to give a label to each city. Suppose the label of city i is equal to xi. Then, it must hold that for all pairs of cities (u, v) the condition |xu - xv| ≤ 1 holds if and only if there is a road connecting u and v.

Oleg wonders if such a labeling is possible. Find an example of such labeling if the task is possible and state that it is impossible otherwise.


Nigerian Army latest news update 2020 on Job Recruitment. This page is about Nigerian Army latest job news 2020. I will be sharing relevant and current news on Nigerian Army recruitment portal, Nigerian Army recruitment shortlisted candidates, and so on. Find out latest news on Nigerian Army recruitment below.
This article will give Nigerian Army latest job news all for free. I guess you have some questions you want to ask or even make some enquiry. Please feel free to share your comments with us, using the comment box on this page at the end of this article.
Nigerian Army Recruitment Latest News
Nigerian Army was created with the aim to build capacity of Nigerian youths as well as reduce unemployment rate in the country. Currently, Nigerian Army recruitment form registration had ended and the new forms are not out yet. However, you can bookmark this page as the recruitment news for Nigerian Army registration will be updated on this page once the form is out.
For those of you seeking to know seeking to know when the form will be out, please be inform that the management of Nigerian Army has not announce the date yet, for the release of the application/registration form. Once the Nigerian Army form is out, this page will be updated immediately.
Nigerian Army Shortlist
Did you apply for Nigerian Army jobs recently? If yes, then this update will help you. Currently, Nigerian Army 2020 List of shortlisted candidates is not yet out. See details below on how to download the list of shortlisted candidates.
How to Check Nigerian Army List of Shortlisted Candidates
I will briefly show you how to check Nigerian Army shortlisted candidates list. Follow the steps below to check.
- Visit Nigerian Army portal via https://Nigerian Army.fmhds.gov.ng/
- Search for list of shortlisted candidates.
- Click on the PDF list.
- You can alternatively check your email, if you don’t see it, check your spam folder. Also check for Nigerian Army text message on your phone because selected candidates will be contacted through this means.
Note: The list for Nigerian Army shortlisted candidates is not yet out. However, keeping visiting Nigerian Army official portal at https://Nigerian Army.fmhds.gov.ng/ or bookmark this page as it will be updated once the list is out.
Nigerian Army Screening Date
Date has not yet be announced for the Nigerian Army exams. When the date is scheduled, this page will be updated. Endeavour to check your email frequently so you won’t miss out.
Related Nigeria Job News & Latest Update
- Nigerian Navy Latest Job News
- Nigerian Immigration Service Latest Job News
- Nigerian Customs Service Latest Job News
- Nigeria Police Force Latest Job News
- Civil Defence Latest Job News
- NDLEA Latest Job News
- NDDC Latest Job News
If you want to be notified about Nigerian Army latest news through email, then drop your email and whatsapp number in the comment session below.


This obviously relies on you having java and android installed, which I'd guess you have if you're upgrading an Android app
Step 1Download the latest zip file from http://cordova.apache.org/ and unzip it.
Step 2Install android if necessary and add it to the OS path. You need ANDROID_HOME set or the android executable on the path. I added both.
Make sure you have Android version 19 installed from Android's SDK manager
Step 3Install ant and add it to the OS path so that ant can be executed from the command line
Step 4Using a command line tool (cmd or bash, or whatever) change directory (cd) to the where you unzipped the cordova zip and cd into the package/framework directory
Run the following command
If you get the error message that you need to create 'local.properties' run the following command first (then run ant jar)
android update project -p .
This will create the jar file called cordova-<version>.jar
Step 5Copy these files from the unzipped cordova directory into your Android app directory structure:
- the created .jar file to your /libs directory (will be in the framework directory where you created it)
- cordova.js from the assets directory in the zip file to your app assets directory
That's all I needed to do. The settings all worked as before and now I've upgraded. I hope this helps someone and it isn't just me that doesn't want to have to use the Cordova tools :)


Welcome to our community.
To get a solution as fast as possible we recommend you always do a search on our website for the error message you get before posting a new question. This might help you find the solution in minutes instead of waiting for our next-day answer.
For example, in your case the solution seems to be the one described in this older post, It is a very easy small mistake with new users:
If this old thread doesn't help you please follow the recommendations from this page
when making a new post. It will allow our team to give you a faster answer.


I just swapped my intel core i5 for a Ryzen 3700x with the Gigabyte Aorus Elite x570 mb and I'm having some system instability issues. Specifically, my PC sometimes does not wake properly from sleep: the case and cpu fans will spin up and the motherboard will light up, but all of the i/o ports remain dead. My monitor, keyboard, mouse, etc. all think that the PC is still asleep and will not respond. What is odd is that I can always *initially* wake my PC with either the mouse or keyboard, and all my peripherals will respond at first, but then there is a lag of a few seconds before the system fully wakes up, and sometimes all the peripherals lose power and remain dead. Then I'm forced to hold the power button down.
I don't know what to do or what could be causing this. I am running the latest AMD chipset drivers (v. 2.03.12.657) and the latest BIOS update from Gigabyte. Currently running the Ryzen "High Performance" power plan. I have not tweaked any of my CPU's settings; the only thing I did was overclock my RAM to 3200 Mhz.
If anyone knows what could be going on here I would really appreciate the help.
EDIT #5 (Final edit): After 2 months of trouble shooting I think I finally found the issue, which I am posting here for any future users who encounter this same problem. The following resolved this issue:
1. wipe Windows and do a clean install
2. Update BIOS to f11
3. Disable Fast Boot
After I did these things I was able to put my PC to sleep and wake it back up a bunch of times without any issue. As a final "just in case" measure I decided to edit the Ryzen High Performance power plan by disabling all wake timer events....and suddenly the issue came back. So I went back in and...
4. (the real fix): re-enabled wake timers.
Since I re-enabled wake timers I haven't had any booting issues. TL;DR is it looks like there is something about this motherboard (or my system in particular) that needs the wake timers enabled. Else, it just fails to wake from sleep properly. If you're having an issue like this and you're also running the Aorus Elite x570, try making sure that wake timers are enabled.
Many usb peripherals can cause issues with sleep. After all these years it is amazing that Microsoft doesn't have this working right.
I was able to isolate it to radeon drivers, until 20.4.1 surfaced I was experiencing problems with standby and sleep
The odd thing is I've never experienced these problems before, and I've had my current desktop since 2016. I could plug in any device I owned--kindle, garmin watch, phone, bike lamp, etc.--and before I rebuilt my PC two weeks ago nothing ever gave me this issue. Now all of a sudden with a new mb, cpu, and psu this suddenly a problem? I don't get it.
Anyway, I tried disabling Windows ability to turn off the USB hubs and roots in Device Manager, so hopefully that helps. Though I'm still not convinced that USB is the sole issue; that wouldn't explain why my GTX 970 suddenly goes dead too and my monitor goes back to sleep just the same as my keyboard and mouse. It's almost like something prevents the entire system from coming out of sleep and Windows won't boot back up.
I get your frustration. I have a USB scanner if I leave it plugged in the computer won't sleep. I have a monitor that if I use the Windows plug and play driver that so many think is all you need, it won't sleep. I have to use the proprietary driver for the monitor. There are so many variables that can affect whether a computer thinks it is time to sleep. I wish that Windows would just have some time of override setting that regardless of what the OS sees it forces sleep or allows it to wake. I have had the same stuff with waking too before.
My X570 BIOS has a power menu item and I can adjust it to ignore USB or PS2 events etc.
the device manager can also help with power, check the power settings for you scanner etc and see if that helps
Same issue. I had to go into device manager and manually update drivers for the "AMD GPIO Controller" and all the "AMD PCI" line items.
AMD's chipset drivers would make it easier than doing that all manually.


Your form’s design is updated in real time. The preview component is automatically launched with the Editor and gives you several tools to format your controls.
- Drag and resize multiple controls at once
- Right-click contextual menu allows:
- Add menus
- Aligning selected controls
- Center individual controls or groups of selected controls
- Clipboard operations
- Keyboard-enabled: the most common keyboard shortcuts will respond as you expect them to.


Sereja is interested in intervals of numbers, so he has prepared a problem about intervals for you. An interval of numbers is a pair of integers [l, r] (1 ≤ l ≤ r ≤ m). Interval [l1, r1] belongs to interval [l2, r2] if the following condition is met: l2 ≤ l1 ≤ r1 ≤ r2.

Sereja wants to write out a sequence of n intervals [l1, r1], [l2, r2], ..., [ln, rn] on a piece of paper. At that, no interval in the sequence can belong to some other interval of the sequence. Also, Sereja loves number x very much and he wants some (at least one) interval in the sequence to have li = x. Sereja wonders, how many distinct ways to write such intervals are there?

Help Sereja and find the required number of ways modulo 1000000007 (109 + 7).

Two ways are considered distinct if there is such j (1 ≤ j ≤ n), that the j-th intervals in two corresponding sequences are not equal.


Hi I dont want the extra bracket inside the list thats been outputted so how would I fix that?
This is the code:
def my_code(list1, list2, index): index = ['a','b','c'] list2 =  list1 = [1,2,3] list1.insert(2,index) return list1
and it returns:
[1, 2, ['a', 'b', 'c'], 3]
I dont want the brackets from inside!


CS475 Lab 5: Wavefront Parallelization
ObjectivesThis lab is intended to give you an hands-on experience on wave-front parallelization.
The objectives are
- To analyze and draw the data-dependencies in the given program.
- Redraw the dependence graph from the given iteration space to time and processor iteration space.
- Re-write the loop body for the transformed iteration space.
- Verify the functionality of your transformed program.
- Insert parallel pragmas for OpenMP parallelization of the transformed program.
- Measure the performance(speed-up on 1-8 processors) of the parallel code to that of the given code on State-capital machines.
Download the Lab5.tar file. It contains the following files.
Comment out the lines to compile the necessary files after performing wavefront-parallelization.
It is the same program as we saw in lecture. The sequential code is provided.
Complete the code for the transformation:
(i,j->p,t) = (i,j->i,i+j-1) by figuring out i,j in terms of p and t. In the given transformed code, t refers to the outer loop and p refers to the inner loop.
- timer.c and timer.h
Complete the code to perform Wavefront parallelization. In your lab report,
Last Modified: 9/27/2017
- Show the transformed loop body and dependences.
- Explain, how you compute the values for i,j in the trandformed code and why it is correct.
- Speed-up on 1-8 processors for N=200,2000,20000 on a state capital machine.


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
How to write time duration correctly
Within a user manual, I need to convey the maximum time period allowed as "365 days 23 hours 59 minutes 59 seconds" - are commas expected between each component? Is the word "and" expected before the ...
Oct 17 '12 at 22:58
newest time technical-writing questions feed
Hot Network Questions
Why does Spotlight give a wrong value for `cos(pi/2)`?
Could one obtain an object to destroy a Horcrux in the Room of Requirements?
What is "the d20 bust," and what does "post-d20 game" mean?
Is it OK to use while ((line = r.readLine()) != null) construct?
Page Numbering: Prime Numbers
Source code of the screens of debian-installer
Are airlines legally obligated to feed passengers without charging?
What to claim when we don't reject the null?
Why do I stop eating corpses? Should I keep eating them anyway?
Is an infinite line the same thing as an infinite circle?
Join Collection to table
Why are commerical flights not equipped with parachutes?
Why is Quicksort described as "in-place" if the sublists take up quite a bit of memory? Surely only something like bubble sort is in-place?
Birthday paradox with a (huge) twist
check webpage repeatedly over and over
Would such polynomial identity exist? (related to sum of four squares)
Why can't I use renice to increase a process' nice value?
Word for a person who loses or has lost faith?
BBWC: in theory a good idea but has one ever saved your data?
What type of solver does Mathematica use in LinearSolve
Custom indexOf() without String methods
Writing a letter of recommendation as a graduate student
How to compute impulse response from transfer function
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 Overflow
Stack Overflow Careers
site design / logo © 2014 stack exchange inc; user contributions licensed under
cc by-sa 3.0


I have experimented, learned & implemented a breakthrough style based on a theory of the universal impact of sound on human.
Rati Makeup Artist
If you want to produce an array from two seperate arrays on their intersects, here you go produce an array from two seperate arrays on their intersects, here you go
Rati Makeup Artist1
Rati Makeup Artist2
Rati Makeup Artist4
Mauris mauris ante, blandit et, ultrices a, suscipit eget, quam. Integer ut neque. Vivamus nisi metus, molestie vel, gravida in, condimentum sit amet, nunc. Nam a nibh. Donec suscipit eros.


Vasya has a grid with $$$2$$$ rows and $$$n$$$ columns. He colours each cell red, green, or blue.

Vasya is colourblind and can't distinguish green from blue. Determine if Vasya will consider the two rows of the grid to be coloured the same.


People threatened, worried, or offended in any way by 3D models need to really reasses their priorities in life.
I'm not too surprised, as Sony seems to really try hard to cater to a Western audience despite being a Japanese company, and the Western world seems to be growing extremely puritanical of late in a variety of areas.
Frankly I never understood the argument against sexualizing women in video games, the same way I wouldn't understand any argument against sexualizing MEN in games.. Appreciating the beauty of the female form in absolutely no way is disempowering women, it's the opposite! Then there's the argument that it's "objectifying".. Umm, in what way? And according to who exactly? What about the women who enjoy these depictions as well?
And showing sexualized female figures in video games (or anywhere else) in no way discounts the fact that she could ALSO have personality, depth, intelligence, etc.. You can appreciate someone's physical appearance while ALSO appreciating their personality characteristics can you not? Physical beauty and depth/personality are not mutually exclusive, and it baffles me that some seem to think it is.. I dunno, maybe I'm the crazy one? Am I missing something here?
Last edited by DarthMetalliCube - on 18 April 2019


You are given a string $$$s$$$ consisting of lowercase English letters.

Rearrange the characters of $$$s$$$ to form a new string $$$r$$$ that is not equal to $$$s$$$, or report that it's impossible.


Given a set of integers (it can contain equal elements).

You have to split it into two subsets $$$A$$$ and $$$B$$$ (both of them can contain equal elements or be empty). You have to maximize the value of $$$mex(A)+mex(B)$$$.

Here $$$mex$$$ of a set denotes the smallest non-negative integer that doesn't exist in the set. For example:

- $$$mex(\{1,4,0,2,2,1\})=3$$$
- $$$mex(\{3,3,2,1,3,0,0\})=4$$$
- $$$mex(\varnothing)=0$$$ ($$$mex$$$ for empty set)

The set is splitted into two subsets $$$A$$$ and $$$B$$$ if for any integer number $$$x$$$ the number of occurrences of $$$x$$$ into this set is equal to the sum of the number of occurrences of $$$x$$$ into $$$A$$$ and the number of occurrences of $$$x$$$ into $$$B$$$.


Here are the server specs are per support.dell.com via the Service Tag
POWEREDGE SC420 - SATA - CELERON 326, 2.
1512MB SINGLE RANK 533MHZ ECC MEMORY, (2X
1NO FLOPPY DRIVE
180GB SATA (7,200RPM) 1IN HARD DRIVE, 1ST
148X CD-ROM DRIVE
1DISPLAY : NOT INCLUDED
1NO KEYBOARD REQUIRED
1NO OPERATING SYSTEM.(N)
1OPENMANAGE SERVER SOFTWARE
1NO WARRANTY UPGRADE
11Y NBD (NEXT BUSINESS DAY)(NA)
1C1 SATA, 1 HARD DRIVE
What happened leading up to this? How many drives to you actually have in the server? Did you have RAID enabled in the BIOS / Integrated Devices and is it enabled now? Do you have a CTRL-A option during POST that you can enter? If so, what do you see?
I'm not sure but it was working until Monday evening but by Tuesday morning this message had appeared.
There is one physical drive in the server - so no RAID
There is a CTRL A option, am not in the same country as the server right now, but am awaiting that info and will post asap
There is only one hard drive, when the user presses CTRL+A nothing happens except 'SATA Primary hard disk drive 0 failure Strike the F1 key to continue, F2 to run the setup utility'
Hard Drive Diagnostics
Drive 0: WDC ROM MODEL-UNICORN-- - Error attempting diagnostics
Drive 1: No device
Drive 2: LITE-ON CD-ROM LTN-489S – Diagnostics not supported
Drive 3: No device
SATA Operation – SATA Operation is set to RAID Autodetect/ATA
RAID AUTODETECT/ATA – RAID if signed drives, otherwise ATA
RAID OFF – No RAID supported
RAID ON – SATA is configured for RAID on every boot
Well, it won't let you do RAID with the onboard controller with a single drive (some controllers would require a single-disk RAID 0 for a single drive). My diagnosis? Your drive failed - is dead. You can try and plug it into another system as a secondary drive to see if it powers up to the point of being able to see and copy your data, but if the drive is not operational, there isn't much you can do. At this point, if the data is crucial, call a data recovery pro.
I hope there is a tape backup so I can import the tapes into a different server and restore from there.
Can anyone tell me whether there will be an issue installing Windows Server 2003 on this server?
"Issues" ... there should not be any "issues", but you might run into some things you might consider issues. If you do, just let us know.
Thanks will do
I got no joy from the old hard drive.
I've setup Windows 2003 on a new drive and have the tape drive installed but cannot import or catalog any of the tapes.
Maybe I should open a new question but the drive is a USB HP Storeagework DAT 160 - can anyone suggest a free or trial program that will import or recognise the tapes?


To enable and setup webhooks, it's as simple as creating a new spreadsheet (or table in Airtable) called "webhooks":
And here is what the spreadsheet looks like:
A description of the fields:
The JSONata expression for the response field should evaluate to an object that looks like this:
"statusCode": 200, // can be any status code, just must be a number
... // any set of HTTP headers can be put here
"body": "" // can be string or JSON
After a synchronization occurs, you can retrieve the URL(s) for your new webhook(s) by issuing a GET request to the following endpoint with your admin user:
From there, you can send data to a webhook by using a POST request. Note that webhooks do not require any authorization to call. Anyone or any service that has the URL can push data into your datasets. The webhook id below will be whatever the internal SheetDream _id value is:
When you POST to that endpoint, SheetDream will recognize you're interacting with the special webhooks table. It will take the incoming data in the POST body, and will run your JSONata expression against it. It will then attempt to import the result into your specified target spreadsheet.
The expression field should evaluate to something that looks like this:
"Column 1": ..,
"Column 2": ..,
In other words: a flat JSON object with no nesting. Simple key/value pairs only. If you do not adhere to this format, SheetDream will simply throw out the result and will not import anything into the target table.
The response field has no restrictions on what it needs to evaluate to. It should evaluate to some sort of JSON result that the calling service expects the webhook to return.
If you want to test your JSONata expression, head on over to https://try.jsonata.org. You'll find a window very similar to the JSONata editor modals in the API Tasks section. You can paste in some example webhook data your third party API will be POSTing to SheetDream, and then work out the JSONata to get a result object that can be successfully imported into your spreadsheet.


I've got a fresh install of #! here, and right off the bat VLC has an issue with .mp4 files. It plays, you see the timeline progression, you can hear all the audio playing fine, but the place where video should be is just black. Has anyone else had this issue? Any ideas on a fix?


I’ve been wondering what I could do with this blog since I really don’t know enough about Christianity, theology or apologetics to teach anybody anything. I’m in total immersion mode, and learning a tremendous amount, but it’s going to be a long road. I’m thinking about getting some formal education, but I’m not sure how to best go about that. I have a four year degree and 20 years of work experience, but it’s all technical computer stuff. I haven’t done anything even remotely humanities related since my few required courses in college.
But one thing I do remember from English writing classes is to write what you know. And I do know the questions that I had to get answered before I came to the point where I am now. So I’m going to try to combine a couple of things here. First, I’m going to talk about the issues I had before I could recommit myself to Christ. I’m going to ask the question, and give the answer that made sense to me, but what’s more, is that I will try to make the answers more complete and based in theologies, reason, and evidence.
In many ways, I think my aptitude for my current career as a technical architect will prove valuable in apologetics. Most of what I do and what I am talented at is taking the theoretical and applying it in a practical way that people can use and understand. And what I’ve learned over time is that the best way to learn the practical application of the theoretical is to actually try and DO IT.
Since I know most of my readers know way more than I do, I invite you all to correct and guide me as I make these chicken scratchings. :)
It’s a little late in the evening to start one off, but I’m planning on starting with the issue of why I can’t open a newspaper without crying for all the horrifying things that are being done to innocent children. Yeah, that’s right. I like to give myself easy assignments. ;-)


Drazil and Varda are the earthworm couple. They want to find a good place to bring up their children. They found a good ground containing nature hole. The hole contains many rooms, some pairs of rooms are connected by small tunnels such that earthworm can move between them.

Let's consider rooms and small tunnels as the vertices and edges in a graph. This graph is a tree. In the other words, any pair of vertices has an unique path between them.

Each room that is leaf in the graph is connected with a ground by a vertical tunnel. Here, leaf is a vertex that has only one outgoing edge in the graph.

Each room is large enough only to fit one earthworm living in it. Earthworm can't live in a tunnel.

Drazil and Varda have a plan to educate their children. They want all their children to do morning exercises immediately after getting up!

When the morning is coming, all earthworm children get up in the same time, then each of them chooses the farthest path to the ground for gathering with others (these children are lazy, so they all want to do exercises as late as possible).

Drazil and Varda want the difference between the time first earthworm child arrives outside and the time the last earthworm child arrives outside to be not larger than l (otherwise children will spread around the ground and it will be hard to keep them exercising together).

Also, The rooms that are occupied by their children should form a connected set. In the other words, for any two rooms that are occupied with earthworm children, all rooms that lie on the path between them should be occupied with earthworm children too.

How many children Drazil and Varda may have at most in order to satisfy all conditions above? Drazil and Varda want to know the answer for many different choices of l.

(Drazil and Varda don't live in the hole with their children)


commandlinefu.com is the place to record those command-line gems that you return to again and again.
Delete that bloated snippets file you've been using and share your personal repository with the world. That way others can gain from your CLI wisdom and you from theirs too. All commands can be commented on, discussed and voted up or down.
You can sign-in using OpenID credentials, or register a traditional username and password.
First-time OpenID users will be automatically assigned a username which can be changed after signing in.
Every new command is wrapped in a tweet and posted to Twitter. Following the stream is a great way of staying abreast of the latest commands. For the more discerning, there are Twitter accounts for commands that get a minimum of 3 and 10 votes - that way only the great commands get tweeted.
Use your favourite RSS aggregator to stay in touch with the latest commands. There are feeds mirroring the 3 Twitter streams as well as for virtually every other subset (users, tags, functions,…):
Subscribe to the feed for:
Wow, didn't really expect you to read this far down. The latest iteration of the site is in open beta. It's a gentle open beta-- not in prime-time just yet. It's being hosted over at UpGuard (link) and you are more than welcome to give it a shot. Couple things:
Checks for syntax errors in PHP files modified in current working copy of a Git repository.
The sample command searches for PHP files replacing tabs with spaces.
-u NONE # don't use vimrc
one may pass
Look at this http://susepaste.org/69028693 also
M - current revision, N - older revision
Creates HTML code from PHP source
in Debian-based systems apt-get could be limited to the specified bandwidth in kilobytes using the apt configuration options(man 5 apt.conf, man apt-get). I'd quote man 5 apt.conf:
"The used bandwidth can be limited with Acquire::http::Dl-Limit which accepts integer values in kilobyte. The default value is 0 which deactivates the limit and tries uses as much as possible of the bandwidth..."
"HTTPS URIs. Cache-control, Timeout, AllowRedirect, Dl-Limit and proxy options are the same as for http..."
This form is used in patches, svn, git etc. And I've created an alias for it:
alias diff='diff -Naur --strip-trailing-cr'
The latter option is especially useful, when somebody in team works in Windows; could be also used in commands like
svn diff --diff-cmd 'diff --strip-trailing-cr'...
If colordiff utility installed, it is sometimes handy to call this command. Of course, you should create an alias for it. E.g. svndiff.
The command copies a file from remote SSH host on port 8322 with bandwidth limit 100KB/sec;
--progress shows a progress bar
--partial turns partial download on; thus, you can resume the process if something goes wrong
--bwlimit limits bandwidth by specified KB/sec
--ipv4 selects IPv4 as preferred
I find it useful to create the following alias:
alias myscp='rsync --progress --partial --rsh="ssh -p 8322" --bwlimit=100 --ipv4'
in ~/.bash_aliases, ~/.bash_profile, ~/.bash_login or ~/.bashrc where appropriate.


Yaroslav, Andrey and Roman can play cubes for hours and hours. But the game is for three, so when Roman doesn't show up, Yaroslav and Andrey play another game.

Roman leaves a word for each of them. Each word consists of 2·n binary characters "0" or "1". After that the players start moving in turns. Yaroslav moves first. During a move, a player must choose an integer from 1 to 2·n, which hasn't been chosen by anybody up to that moment. Then the player takes a piece of paper and writes out the corresponding character from his string.

Let's represent Yaroslav's word as s = s1s2... s2n. Similarly, let's represent Andrey's word as t = t1t2... t2n. Then, if Yaroslav choose number k during his move, then he is going to write out character sk on the piece of paper. Similarly, if Andrey choose number r during his move, then he is going to write out character tr on the piece of paper.

The game finishes when no player can make a move. After the game is over, Yaroslav makes some integer from the characters written on his piece of paper (Yaroslav can arrange these characters as he wants). Andrey does the same. The resulting numbers can contain leading zeroes. The person with the largest number wins. If the numbers are equal, the game ends with a draw.

You are given two strings s and t. Determine the outcome of the game provided that Yaroslav and Andrey play optimally well.


Michael and Joe are playing a game. The game is played on a grid with $$$n$$$ rows and $$$m$$$ columns, filled with distinct integers. We denote the square on the $$$i$$$-th ($$$1\le i\le n$$$) row and $$$j$$$-th ($$$1\le j\le m$$$) column by $$$(i, j)$$$ and the number there by $$$a_{ij}$$$.

Michael starts by saying two numbers $$$h$$$ ($$$1\le h \le n$$$) and $$$w$$$ ($$$1\le w \le m$$$). Then Joe picks any $$$h\times w$$$ subrectangle of the board (without Michael seeing).

Formally, an $$$h\times w$$$ subrectangle starts at some square $$$(a,b)$$$ where $$$1 \le a \le n-h+1$$$ and $$$1 \le b \le m-w+1$$$. It contains all squares $$$(i,j)$$$ for $$$a \le i \le a+h-1$$$ and $$$b \le j \le b+w-1$$$.

Possible move by Joe if Michael says $$$3\times 2$$$ (with maximum of $$$15$$$).

Finally, Michael has to guess the maximum number in the subrectangle. He wins if he gets it right.

Because Michael doesn't like big numbers, he wants the area of the chosen subrectangle (that is, $$$h \cdot w$$$), to be as small as possible, while still ensuring that he wins, not depending on Joe's choice. Help Michael out by finding this minimum possible area.

It can be shown that Michael can always choose $$$h, w$$$ for which he can ensure that he wins.


One day, Okazaki Tomoya has bought a tree for Furukawa Nagisa's birthday. The tree is so strange that every node of the tree has a value. The value of the i-th node is vi. Now Furukawa Nagisa and Okazaki Tomoya want to play a game on the tree.

Let (s, e) be the path from node s to node e, we can write down the sequence of the values of nodes on path (s, e), and denote this sequence as S(s, e). We define the value of the sequence G(S(s, e)) as follows. Suppose that the sequence is z0, z1...zl - 1, where l is the length of the sequence. We define G(S(s, e)) = z0 × k0 + z1 × k1 + ... + zl - 1 × kl - 1. If the path (s, e) satisfies $$G(S(s,e)) \equiv x (\bmod y)$$, then the path (s, e) belongs to Furukawa Nagisa, otherwise it belongs to Okazaki Tomoya.

Calculating who has more paths is too easy, so they want to play something more difficult. Furukawa Nagisa thinks that if paths (p1, p2) and (p2, p3) belong to her, then path (p1, p3) belongs to her as well. Also, she thinks that if paths (p1, p2) and (p2, p3) belong to Okazaki Tomoya, then path (p1, p3) belongs to Okazaki Tomoya as well. But in fact, this conclusion isn't always right. So now Furukawa Nagisa wants to know how many triplets (p1, p2, p3) are correct for the conclusion, and this is your task.


I've been working to assign ownership to the correct team for "unit tests" recently. While changing the team name that owns each test is straightforward in most cases, in some I had to step into the tests to determine exactly what was being validated. This is a great way for me to learn the code, by the way.
In any case, I soon discovered that some of the tests I had been thinking about as unit tests are actually integration tests. The difference between the two is what I want to mention today.
A unit test is the simples form of automated testing that we write. In a simple case, suppose I am writing a calculator application and want to multiply two whole numbers. I could write a function that looks something like this:
int multiply(int first, int second)
int result = 0;
for (int i=0;i<first;i++)
result = result + second;
Now when I write a unit test, I can pass in 8 and 4 and validate I get 32 as a result and also 0 and 2 to validate I get 0. Not much to this but that is the point of a unit test - it tests just one function. If it fails, I know the exact one function that now needs to be investigated.
Then suppose I add a power function to the calculator. Raising a number to a power is just multiplying the number by itself as many times as I want the power t be, so my function to this might be:
int power(number, power)
int result ;
for (int i=0;i<power;i++)
result = multiply(result, 1);
I just call my multiply command as part of my power command. Reusing code is always a goal.
But now when I test my power function, I have a challenge if the test fails. A failure might be in the part of the code that is unique to my power function, or it could also be in the multiply command. There could also exist a case in which both tests are failing for different reasons. So instead of quickly finding the one bit of ode I need to investigate, I now have 2 places to look and three investigations to complete.
Looking more at the calculator, if I added a "Compute compounded interest function" I would need to use the power function and the multiply function and possibly a few others as well. Now if a test fails I might have dozens of locations to investigate.
On the positive side, I might also discover a flaw in my code that only shows when one function calls another. This type of functionality is referred to as an integration test and is absolutely critical to shipping software. Read about the most famous example of not covering this here: a Mars satellite was lost because Lockheed Martin tested all their code with miles and everyone else tested all their code with kilometers. Very loosely speaking, the Lockheed code told the spacecraft it was "1,000,000" from earth it meant one million miles. When the satellite heard "1,000,000" it assumed kilometers and that was the root of the loss of the satellite. Integration tests should have been use to catch this type of error.
Eagle eyed readers will point out that my power function is useless without the multiply function. How can I isolate my unit tests to use only the code in that function instead of needing the multiply command as well? I'll cover that next time up.
Questions, comments, concerns and criticisms always welcome,


Cool Tensorflow Tutorial Without Keras 2022. Mechislav pugavko • 1 month ago. While you can use keras without tensorflow, keras is always.
This tutorial has been updated for tensorflow 2.2 ! In a regression problem, the aim is to predict the output of a continuous value, like a price or a probability. Is keras in tensorflow 2.0 as fast as tf?
Check Out Our Introduction To Keras For Researchers.
This tutorial will show you how to get started with using keras to build and It is made with focus of understanding deep learning techniques, such as creating layers for. Now that we know what nlp is and various tools that are used to increase the accuracy of the model, we’ll tackle a classicc nlp problem:
Many Git Commands Accept Both Tag And Branch Names, So Creating This Branch May Cause Unexpected Behavior.
Here are instructions on how to do this. In this keras and tensorflow tutorial, we'll be covering how to write a simple neural network that recognizes handwritten digits. Here's another tutorial going from basics (full keras) to full.
Tensorflow Is An Open Source Machine Learning Framework For All Developers.
Then the functions train_on_batch, predict, predict can be wrapped with decorators. Contrast this with a classification problem, where the aim is to select a class from. Tensorflow’s new 2.0 version provides a.
Are You A Beginner Looking For Both An Introduction To Machine Learning And An Introduction To Keras And Tensorflow?
While you can use keras without tensorflow, keras is always. In a regression problem, the aim is to predict the output of a continuous value, like a price or a probability. Photo by david dibert on unsplash.
Is Keras In Tensorflow 2.0 As Fast As Tf?
But in all comparisons of tensorflow (1.x) and keras, it has been mentioned that keras is much slower than tensorflow. So there are two questions: Image classification is one of the fundamental supervised tasks in the world of machine learning.


Hello there. Been a while since I was modding, so I decided to give it a try.
Hope you’ll like them!
Blaser R93 Tactical Hybrid:
EDIT: The link is now updated with the much shorter woosh.wav file.
- Baseball Bat
Thanks for reading (and downloading, of course) this.
P.S. All the weapons have sounds, but I would like if someone would make some sights for the guns.


Status: this preprint has been withdrawn by the authors.
A simple metabolic model of glacial-interglacial energy supply to the upper ocean
J. L. Pelegrí,R. Olivella,and A. García-Olivares
Abstract. We use a simple two-state two-box ocean to simulate the CO2 signal during the last four glacial-interglacial transitions in the earth system. The model is inspired by the similarity in spatial organization and temporal transition patterns between the earth and other complex systems, such as mammals. The comparison identifies the earth's metabolic rate with net autotrophic primary production in the upper ocean, sustained through new inorganic carbon and nutrients advected from the deep ocean and organic matter remineralized within the upper ocean. We view the glacial-interglacial transition as a switch of the upper ocean from a basal to an enhanced metabolic state, with energy supply initially relying on the remineralization of the local organic sources and the eventual steady state resulting from the increased advective supply of inorganic deep sources. During the interglacial-glacial transition the opposite occurs, with an initial excess of advective supply and primary production that allows the replenishment of the upper-ocean organic storages. We set the relative change in energy supply from the CO2 signal and use genetic algorithms to explore the sensitivity of the model output to both the basal recirculation rate and the intensity-timing of the maximum recirculation rate. The model is capable of reproducing quite well the long-term oscillations, as shown by correlations with observations typically about 0.8. The dominant time scale for each cycle ranges between about 40 and 45 kyr, close to the 41 kyr average obliquity astronomical period, and the deep-ocean recirculation rate increases between one and two orders of magnitude from glacial to interglacial periods.
This preprint has been withdrawn.
How to cite. Pelegrí, J. L., Olivella, R., and García-Olivares, A.: A simple metabolic model of glacial-interglacial energy supply to the upper ocean, Earth Syst. Dynam. Discuss., 2, 271–313, https://doi.org/10.5194/esdd-2-271-2011, 2011.
Received: 18 Feb 2011 – Discussion started: 22 Mar 2011