//========= Copyright Valve Corporation, All rights reserved. ============//
//
// Purpose:
//
// $Workfile:     $
// $Date:         $
// $NoKeywords: $
//=============================================================================//

#ifndef CMDLIB_H
#define CMDLIB_H

#ifdef _WIN32
#pragma once
#endif

// cmdlib.h

#include "basetypes.h"

// This can go away when everything is in bin.
#if defined( CMDLIB_NODBGLIB )
	void Error( PRINTF_FORMAT_STRING char const *pMsg, ... );
#else
	#include "tier0/dbg.h"
#endif

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
#include <ctype.h>
#include <time.h>
#include <stdarg.h>
#include "filesystem.h"
#include "filesystem_tools.h"
#include "tier1/utlstring.h"

// Tools should use this as the read path ID. It'll look into the paths specified by gameinfo.txt
#define TOOLS_READ_PATH_ID "GAME"

// Tools should use this to fprintf data to files.
void CmdLib_FPrintf( FileHandle_t hFile, PRINTF_FORMAT_STRING const char *pFormat, ... );
char* CmdLib_FGets( char *pOut, int outSize, FileHandle_t hFile );

// This can be set so Msg() sends output to hook functions (like the VMPI MySQL database),
// but doesn't actually printf the output.
extern bool g_bSuppressPrintfOutput;

extern IBaseFileSystem *g_pFileSystem;

// These call right into the functions in filesystem_tools.h
void				CmdLib_InitFileSystem( const char *pFilename, int maxMemoryUsage = 0 );
void				CmdLib_TermFileSystem();	// GracefulExit calls this.
CreateInterfaceFn	CmdLib_GetFileSystemFactory();

#ifdef _WIN32
#pragma warning(disable : 4244)     // MIPS
#pragma warning(disable : 4136)     // X86
#pragma warning(disable : 4051)     // ALPHA

#pragma warning(disable : 4018)     // signed/unsigned mismatch
#pragma warning(disable : 4305)     // truncate from double to float

#pragma warning(disable : 4389)     // singned/unsigned mismatch in ==
#pragma warning(disable: 4512) // assignment operator could not be generated
#endif

// the dec offsetof macro doesnt work very well...
#define myoffsetof(type,identifier) offsetof( type, identifier )

// set these before calling CheckParm
extern int myargc;
extern char **myargv;

int Q_filelength (FileHandle_t f);
int	FileTime (char *path);

void	Q_mkdir( char *path );

char *ExpandArg (char *path);	// expand relative to CWD
char *ExpandPath (char *path);	// expand relative to gamedir

char *ExpandPathAndArchive (char *path);

// Fills in pOut with "X hours, Y minutes, Z seconds". Leaves out hours or minutes if they're zero.
void GetHourMinuteSecondsString( int nInputSeconds, char *pOut, int outLen );

int		CheckParm (char *check);

FileHandle_t	SafeOpenWrite ( const char *filename );
FileHandle_t	SafeOpenRead ( const char *filename );
void			SafeRead( FileHandle_t f, void *buffer, int count);
void			SafeWrite( FileHandle_t f, void *buffer, int count);

int		LoadFile ( const char *filename, void **bufferptr );
void	SaveFile ( const char *filename, void *buffer, int count );
qboolean	FileExists ( const char *filename );

int 	ParseNum (char *str);

// Do a printf in the specified color.
#define CP_ERROR	stderr, 1, 0, 0, 1		// default colors..
#define CP_WARNING	stderr, 1, 1, 0, 1
#define CP_STARTUP	stdout, 0, 1, 1, 1
#define CP_NOTIFY	stdout, 1, 1, 1, 1
void ColorPrintf( FILE *pFile, bool red, bool green, bool blue, bool intensity, PRINTF_FORMAT_STRING char const *pFormat, ... );

// Initialize spew output.
void InstallSpewFunction();

// This registers an extra callback for spew output.
typedef void (*SpewHookFn)( const char * );
void InstallExtraSpewHook( SpewHookFn pFn );

// Install allocation hooks so we error out if an allocation can't happen.
void InstallAllocationFunctions();

// This shuts down mgrs that use threads gracefully. If you just call exit(), the threads can
// get in a state where you can't tell if they are shutdown or not, and it can stall forever.
typedef void (*CleanupFn)();
void CmdLib_AtCleanup( CleanupFn pFn );	// register a callback when Cleanup() is called.
void CmdLib_Cleanup();
void CmdLib_Exit( int exitCode );	// Use this to cleanup and call exit().

// entrypoint if chaining spew functions
SpewRetval_t CmdLib_SpewOutputFunc( SpewType_t type, char const *pMsg );
unsigned short SetConsoleTextColor( int red, int green, int blue, int intensity );
void RestoreConsoleTextColor( unsigned short color );

// Append all spew output to the specified file.
void SetSpewFunctionLogFile( char const *pFilename );

char *COM_Parse (char *data);

extern	char		com_token[1024];

char *copystring(const char *s);

void	CreatePath( char *path );
void	QCopyFile( char *from, char *to );
void	SafeCreatePath( char *path );

extern	qboolean		archive;
extern	char			archivedir[1024];

extern	qboolean verbose;

void qprintf( PRINTF_FORMAT_STRING const char *format, ... );

void ExpandWildcards (int *argc, char ***argv);

void CmdLib_AddBasePath( const char *pBasePath );
bool CmdLib_HasBasePath( const char *pFileName, int &pathLength );
int CmdLib_GetNumBasePaths( void );
const char *CmdLib_GetBasePath( int i );
// Like ExpandPath but expands the path for each base path like SafeOpenRead
int CmdLib_ExpandWithBasePaths( CUtlVector< CUtlString > &expandedPathList, const char *pszPath );

extern bool g_bStopOnExit;

// for compression routines
typedef struct
{
	byte	*data;
	int		count;
} cblock_t;

#endif // CMDLIB_H


I have an Airport Express 2nd Generation (Version 7.6.8) that I'm using as an access point for my desktop PC.
My house has a Technicolor DPC3848VE modem and WiFi router with dual-band network.
I set the Airport express to connect to the 5GHz network (the networks have the same name + 2.4 or 5.0 for differentiating them).
All the connection is done without problems, but when I check the Network Icon in the Task Bar, the tooltip says I’m connected to the 2.4GHz network.
Just to be sure I did a factory reset and connected the router again and it still connects me to the 2.4GHz network.
How can I fix this/force the airport to only use the 5GHz network?


Supernova (SN) 2006gy was a hydrogen-rich core-collapse SN that remains one of the most luminous optical SNe ever observed. The total energy budget (>2 × 10$^51$ erg radiated in the optical alone) poses many challenges for standard SN theory. We present new ground-based near-infrared (NIR) observations of SN 2006gy, as well as a single epoch of Hubble Space Telescope (HST) imaging obtained more than two years after the explosion. Our NIR data taken around peak optical emission show an evolution that is largely consistent with a cooling blackbody, with tentative evidence for a growing NIR excess starting around day åisebox-0.5ex 130. Our late-time Keck adaptive optics NIR image, taken on day 723, shows little change from previous NIR observations taken around day 400. Furthermore, the optical HST observations show a reduced decline rate after day 400, and the SN is bluer on day 810 than it was at peak. This late-time decline is inconsistent with $^56$Co decay, and thus is problematic for the various pair-instability SN models used to explain the nature of SN 2006gy. The slow decline of the NIR emission can be explained with a light echo, and we confirm that the late-time NIR excess is the result of a massive (gsim10 M $_sun$) dusty shell heated by the SN peak luminosity. The late-time optical observations require the existence of a scattered light echo, which may be generated by the same dust that contributes to the NIR echo. Both the NIR and optical echoes originate in the proximity of the progenitor, i̊sebox-0.5ex 10$^18$ cm for the NIR echo and lsim10-40 pc for the optical echo, which provides further evidence that the progenitor of SN 2006gy was a very massive star.


You are given a multiset of points on the plane with integer coordinates. Find the maximum distance between two points from this multiset.


I gave the keynote at the NEURISA Day event (agenda and presentations) in 2011. (My coverage, Oct 2011) Also:
I spoke at the New York State Geospatial Summit 2011 (My coverage, June 2011) Also:
I offered the closing keynote at MidAmerica GIS Consortium - MAGIC - 2010 Symposium. (My coverage, my slides (pdf), April 2010)
I presented "Harnessing Geospatial Technology in Liberal Education," the keynote at Geospatial Technologies in the Liberal Arts. I was pleased to be accompanied by my Dad, Arnold. (My coverage, NITLE coverage, Sept. 2009)
I presented a keynote at the MetaCarta Public Sector User Group. (My coverage, May 2007.
I presented the keynote at the Pennsylvania GIS Conference. (My coverage, May 2006)
I presented the keynote at the GeoVue User Conference. (Dec 2006)
I spoke to NICS (National Infrastructure for Community Statistics) a group aiming to make statistics easier to access and use on the Web on Feb 16, 2005 at the Brookings Institution. I covered the commercial side of the geospatial industry. (My coverage, Feb 2005)
I spoke to a group of local (Massachusetts) town GIS managers. Said one in an e-mail, "Excellent presentation yesterday by Adena. We should try to have a few more meeting where a non-biased GIS professional (no consultants) is guest speaker." (Apr 2004)
I was an invited speaker at the 2004 Wisconsin Land Information Association Annual Conference. I provided a lunch time keynote titled "GIS: Too Much Information." The executive services manager, in a thank you letter noted, "You received excellent reviews!" (My coverage, Mar 2004).
I presented the keynote at the Ventura College (California) GIS Day conference in November 2003, at the invitations of GIS Monitor readers. From the thank you note: "I want to tell you again how pleased we were by your keynote speech and attendance at our event. In particular, I received many compliments on your talk from people with a wide variety of GIS knowledge and experience. You did an excellent job of providing us with the tools for discussing web mapping issues." - Paul Van Zuyle, one of the organizers. (My coverage, Nov 2003)
I spoke about GIS at the International Right of Way Association 49th Annual International Education Conference. (My coverage, June 2003)
I presented a keynote at the Laser-Scan's User and Partner Conference in Cambridge, England. From Laser-Scan's thank you note: "Yes, we had an excellent conference, there was definitely a buzz to the whole event and we're getting some good feedback too." (My coverage, July 2003)
I spoke at GIS User Forum in Dubai UAE, from 28 - 30 April, 2002. (My coverage, my travelogue, Apr 2002)
I presented the keynote address at the Illinois GIS Association 2001 Fall Conference. This is from the "thank you" note: "It certainly was an outstanding presentation - many of the conference attendees that I talked to felt that it was the best keynote address they had ever heard. I personally enjoyed your talk because it offered the best of what a keynote address should be: relevant to the audience's interests, but also challenging enough to provoke new insights." - Larry Gunderson, President, ILGISA. (Nov 2001)


Mr. F has $$$n$$$ positive integers, $$$a_1, a_2, \ldots, a_n$$$.

He thinks the greatest common divisor of these integers is too small. So he wants to enlarge it by removing some of the integers.

But this problem is too simple for him, so he does not want to do it by himself. If you help him, he will give you some scores in reward.

Your task is to calculate the minimum number of integers you need to remove so that the greatest common divisor of the remaining integers is bigger than that of all integers.


HTTPS clone URL
Subversion checkout URL
An HTML/CSS rendering engine for the Haxe language
fixes-for-openfl fullscreen-pseudo-class gh-pages layout-refactor master non-interactive-scrollbar refacto refactor-boxmodel refactor-embedded-block-layout update-samples
Nothing to show
Fetching latest commit...
Cannot retrieve the latest commit at this time.
|Failed to load latest commit information.|


So you think you’re ready to buy an Android device? There are a lot of options, and finding the right one is tricky if you don’t know what to look for. Consider these four points when picking an Android device, and you'll have no problem finding one that best suits your needs.
Recently I've got an e-mail from Handsetdetection.com with an interesting infographic. With their solution, they can help developres, to detect mobile devices, and redirect the mobile users, mobile customers to a proper landing page. Thanks to this, they have pretty good insights about the mobile usage of different countries. They've developed an infographic on Android usage - phone models, OS's and screen sizes - from 11 developing countries, including Brazil, China, India, Pakistan, South Africa and Vietnam. If you are a developer, I'm sure these are useful statistics to prepare your app for these target markets.


In Windows Vista, 7 or 8, my video is cut off / shifted, or my text is shifted. What do I do?
If the video on the remote display is being cut off or shifted, try the following:
Lower the resolution, wait a few seconds after the resolution change has taken effect, then adjust back to your desired resolution. This will force the screen to refresh itself and it should display normally.
If the image looks off and/or the text is offset, making certain features inaccessible, try the following:
- Right-click on the desktop and select Personalize.
- Click Display on the bottom left of the window.
- Ensure this is set to 100%. Setting this to 125% or 150% will cause the text in the software for this unit to shift, and not fit correctly.


Hi, I was wondering if anyone could advise? I am a freelance consultant (graduate, qual accountant) with a specialism in activity based costing, in financial services, working to quite a high level. Quite a small pond in terms of who is around. Up to now, I have worked through and intermediary associate consulting company and charges £550 / day to them but of course I know that I am charged out at more. I don't know my daily rate as the contracts with the main are done on results, not day by day and I am not privy to these. So I now have the opportunity to pitch for an interim mangement job in this specialism and am not sure what daily rate to pitch. I have been advised various figs between £600 & £800. I don't want to under sell, but also don't want to price myself out of the market. Any ideas?


In this tutorial, we give you all the necessary steps to know what are the commands to download and extract TAR file in Linux
What is TAR?
The tar command (Tape Archiver) is an official POSIX format through which it will be possible to execute tasks such as:
- Use with other commands for file compression
- Download multimedia elements
- Transfer files and much more.
How To Download & Extract Files using WGET
Wget or GNU Wget is a free software package that allows us to manage files using HTTP, HTTPS, FTP and FTPS protocols.
With Wget, we have a series of advantages like
- Recover failed downloads
- Manage files of different languages thanks to the fact that it is based on NLS
- Supports HTTP cookies and proxies
- It allows being executed in unattended mode.
In this first example, we will see how to download and unzip a rar file.
For this we will execute the following line:
wget -c http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz -O - | tar -xz
In this case, we will download the Geolite database utility.
If we wish we can list the content of the downloaded file:
We will break down that it has been executed in this line:
The parameter O indicates the file where the data are to be written, and when the – sign is prefixed, we suggest that you store it in standard output.
This parameter allows us to activate the extraction of files
Its function is to compress or unzip the selected file.
If we want to extract the content of the downloaded file in a different route, it will be necessary to add the parameter -C in the following way:
sudo wget -c http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz -O - | sudo tar -xz -C path
Wget is a tool that allows us to execute various actions; for example, if we want to download the file before its extraction we will run the following:
sudo wget -c http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz && tar -xzf GeoLite2-Country.tar.gz
We can see that in this case the file has been downloaded in tar.gz format but not uncompressed.
How To Download & Extract Files using CURL
This command has been developed as a command line utility or scripts to transfer data securely.
Curl supports protocols such as HTTP, HTTPS, IMAP, IMAPS, LDAP, LDAPS, POP3, POP3S, RTMP, RTSP and many more.
To download a file with the curl command and proceed to its immediate decompression, we will execute the following:
sudo curl http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz | tar -xz
We have used ls to list that the file has been decompressed.
As with wget, it is possible to specify a new path where the file must be extracted, for this we can use some of the following commands:
sudo curl http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz | sudo tar -xz -C path sudo curl http://geolite.maxmind.com/download/geoip/database/GeoLite2-Country.tar.gz && sudo tar -xzf GeoLite2-Country.tar.gz -C path
So we have understood how to use tar along with other commands for downloading and decompressing files in Linux.


currently we still use php 7.2 for webissues 1.1.5 .
Since php version 7.2 is no longer supported, we wanted to switch to php 8.1. Is this possible with the webissues version 1.1.5 and what is to be considered if necessary?
Or do we have to change to webissues 2.0.x for this? How would we have to proceed for an upgrade from 1.1.5 to 2.0.x?
Version 1.x of WebIssues is no longer supported, and will probably not work with PHP 8, so I recommend upgrading to version 2.0. See the documentation for more information about updating WebIssues to the latest version.


Ayush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.

The store contains k items. n customers have already used the above service. Each user paid for m items. Let aij denote the j-th item in the i-th person's order.

Due to the space limitations all the items are arranged in one single row. When Ayush receives the i-th order he will find one by one all the items aij (1 ≤ j ≤ m) in the row. Let pos(x) denote the position of the item x in the row at the moment of its collection. Then Ayush takes time equal to pos(ai1) + pos(ai2) + ... + pos(aim) for the i-th customer.

When Ayush accesses the x-th element he keeps a new stock in the front of the row and takes away the x-th element. Thus the values are updating.

Your task is to calculate the total time it takes for Ayush to process all the orders.

You can assume that the market has endless stock.


New answers tagged qt
You can find many examples from Qt's website: http://doc.qt.io/qt-4.8/all-examples.html QML examples: http://doc.qt.io/qt-4.8/qdeclarativeexamples.html
Simply install the same packages as for 64-bit, but append :i386 onto the package name. For example, libqt5webkit5:i386. To compile against the libraries, you'll also need the appropriate i386 version of the appropriate -dev packages.
If you are building a Qt project, Qt Creator tool may be of use -- it supports multiple Qt versions to be set as build kits, you just need to have the proper compiler installed and locate the qmake file of the desired Qt. If otherwise you are convinced to build something from command line (ex.: development is not the key goal), check the following: qmake ...
You will have to first download the source from here for qt 4.8.1. Then open a terminal(Ctrl+Alt+T) and goto the path where you have download the file. Install the required dependencies sudo apt-get install build-essential checkinstall Then extract the file using tar -xvzf qt-everywhere-opensource-src-4.8.1.tar.gz Then goto the extracted ...
This command helped me to start qtcreator without that error: export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:$HOME/tools/qtcreator-3.6.1/lib/Qt/lib where qtcreator-3.6.1 is the installation directory.
Top 50 recent answers are included


A contest contains $$$n$$$ problems and the difficulty of the $$$i$$$-th problem is expected to be at most $$$b_i$$$. There are already $$$n$$$ problem proposals and the difficulty of the $$$i$$$-th problem is $$$a_i$$$. Initially, both $$$a_1, a_2, \ldots, a_n$$$ and $$$b_1, b_2, \ldots, b_n$$$ are sorted in non-decreasing order.

Some of the problems may be more difficult than expected, so the writers must propose more problems. When a new problem with difficulty $$$w$$$ is proposed, the most difficult problem will be deleted from the contest, and the problems will be sorted in a way that the difficulties are non-decreasing.

In other words, in each operation, you choose an integer $$$w$$$, insert it into the array $$$a$$$, sort array $$$a$$$ in non-decreasing order, and remove the last element from it.

Find the minimum number of new problems to make $$$a_i\le b_i$$$ for all $$$i$$$.


RT @sherylchamb: Paul Maritz vision for cloud comes alive @gopivotal #emcworld keynote delivers
10:34 AM May 7th via Twitter for iPhone
RT @gopivotal: EMC's Pivot Point: the birth and vision of Pivotal @Forbes http://t.co/s43ALwwhxS @VMware @EMCcorp @CETAS @cloudfoundry
9:54 AM May 3rd via HootSuite
FOLLOW GREENPLUM: Facebook Twitter LinkedIn
EMC2, EMC, Greenplum, Greenplum Chorus, and where information lives are registered trademarks or trademarks of EMC Corporation in the United States and other countries. © 2009-2012 EMC Corporation. All rights reserved.


Integration with Microsoft Transaction Server
Microsoft Transaction Server (MTS) is a programming model that provides automatic support for transactions, thread management, database connection pooling, process isolation, and other mission critical programming functionality required for multiuser web server applications. MTS allows developers to capitalize on their existing knowledge of popular tools such as Microsoft Visual Basic, Microsoft Visual C++, Microsoft Visual J++ in creating desktop applications to create reliable and scalable data-driven web applications.
Process isolation enables applications to run in a separate memory space from the Web and other applications. This provides a higher level of reliability for organizations running Web applications because Process isolation prevents an unstable application from crashing the server.
Active Server Pages
Active Server Pages is an open, compile free application environment in which developers can combine the ease of HTML with familiar tools like Visual Basic scripting and reusable Microsoft Active X server components to create dynamic and powerful websites. ASP enables server side scripting for IIS with native support for both VBScript and JScript.
The integration of IIS with Microsoft Transaction Server allows Report Writer to run as a component in the MTS environment and to take advantage of capabilities such as process isolation, transactions and scalability.
Server Side Java Virtual Machine
Server Side Java Virtual machine is a high performance and reliable Virtual Machine for creating and running Java components on the server. It provides developers with an industry standard, high performance platform for building and deploying Java based applications.
Best Windows Servers Providers USA


Xbox Live is used by Windows and Xbox games for achievements, friend lists, and matches. Apparently, the Microsoft is looking to push Xbox Live cross-platform 'in a big way'.
A recent Microsoft job posting reveals some details about the plan.
"We will create a modern framework that is open-source, lightweight, extensible and scalable across various platforms including Windows Store, Windows Phone, iOS, and Android."
In order to get developers on-board, Microsoft will reportedly have fewer restrictions and offer better tools to help developers integrate the functionality into their games.


In this problem you have to solve a simple classification task: given an image, determine whether it depicts a Fourier doodle.

You are given a set of 50 images with ids 1 through 50. You are also given a text file labels.txt containing the labels for images with ids 1 through 20, which comprise the learning data set.

You have to output the classification results for images with ids 21 through 50 in the same format.


The role of software development is to produce software to solve a problem. The role of Agile software development is to learn as much about the solution as possible while developing, Agile does that mainly through ruthlessly begging for feedback, both on the product (e.g. sprint reviews, test-driven development and continuous delivery) and on the process (e.g. Scrum/Kanban boards, sprint retrospectives and standup). In between all these feedback sessions, you do ”normal” software development.
The role of user experience design (UX) is to produce a design to solve a problem (through user research and interaction design, of course). So, software development and user experience design go hand in hand, completing each other. Design and build.
The common misconception is that Lean UX also shall produce a design solution to a problem.
This is not the case. The role of Lean UX (and its progenitor Lean Startup) is to learn, but learn as much about the problem as possible. Lean UX does that through ruthlessly validating assumptions about the problem, the customer, their needs, the proposed solutions and the success metrics. Lean UX and Agile go hand in hand as well, learning about the problem and the solution, before, during and after development. In between all these validation sessions, you do ”normal” UX.
One situation where Lean UX is usually not used right due to the misconception is when you have had an ideation session and come up with possible solutions to a given problem. The Lean UX way of working would be to place those solutions in a risk vs. value matrix. For the solutions that end up in the high value and low risk corner, you do ”normal” UX since low risk means that you know enough about the assumptions around the solution. So you create a prototype and test that prototype with users to see if the workflow seems to solve the problem. For the solutions that end up in high value and high risk corner, you need to learn more and eliminate unknowns. In Lean UX, you create the smallest thing possible to mimic the intended experience of the solution (by creating a Riskiest Assumption Test, RAT, formerly known as MVP) to learn more about and (in)validate the solution. When you have learned enough, i.e. lowered the risk, you can do ”normal” UX again for that solution.Here’s an example: There’s a problem that people do not really use Lean UX as intended. One possible solution that lands in the high value high risk corner of the matrix would be to create a course for learning Lean UX. Instead of creating a prototype of the full course, detailing out different sections and exercises, you can create a nugget of teaching such as a five minute long YouTube clip or a blog post, and then ask some questions to see if they’ve learned the content. This would (in)validate the assumption that people can learn Lean UX in a course setting and reduces the risk of actually delivering one, such as Lean UX at Crisp, and getting feedback on that solution in production. 😀
It’s all about learning…


Evan Williams posts his list of rules for web startups here. These rules aren't just for startups though, they should be taken as general guidelines for building any sort of software.
Almost every software project, from a small feature addition to an existing product, to an entirely new idea, should be run with these same basic ideas. I can't understand people who still want to drop a big bang on the world with their projects. Rule #9, unless you're building pacemaker software, should be applied to all attempts at software creation. I've yet to come across a software project where anyone involved really know what they want at the start.
So don't spend time trying to cram everything in the world in to your software, just get it out the door, get some users on it, watch how they use it, and start refining. No one knows for sure how users will use their software until we actually put it in front of them. The rest of the rules will make sure that it gets where it needs to go from there.


/*
This code is from an open source platform BCOS, URL:https://github.com/bcosorg/bcos/tree/master/libpaillier
*/

#ifndef __HEADER_COMMON_H__
#define __HEADER_COMMON_H__

#include "bn.h"

#define GET_U32(n, b, i)                                                                                \
	{                                                                                \
		(n) = ((U32)(b)[(i)] << 24) | ((U32)(b)[(i) + 1] << 16) | ((U32)(b)[(i) + 2] << 8) | ((U32)(b)[(i) + 3]); \
	}

#define PUT_U32(n, b, i)                \
	{                                   \
		(b)[(i)] = (U8)((n) >> 24);     \
		(b)[(i) + 1] = (U8)((n) >> 16); \
		(b)[(i) + 2] = (U8)((n) >> 8);  \
		(b)[(i) + 3] = (U8)((n));       \
	}

#ifdef __cplusplus
extern "C"
{
#endif

	S32 ConvertHexChar(S8 ch, U8 *ch_byte);
	S32 CharToByte(const S8 *pCharBuf, S32 charlen, U8 *pByteBuf, S32 *bytelen);
	S32 ByteToBN(U8 *pByteBuf, S32 bytelen, U32 *pwBN, S32 iBNWordLen);
	S32 BNToByte(U32 *pwBN, S32 iBNWordLen, U8 *pByteBuf, S32 *bytelen);

	void U8_Print(U8 *pwSource, S32 len);
	S32 U8_JE(U8 *pwX, U8 *pwY, S32 len);

#ifdef __cplusplus
}
#endif

#endif


I know that you can use the shortform word little in the longer word Littleton. But what if (Littleton) is in parentheses? One braille translation program I use results in Little being contracted, the other program I use uncontracts it. I'm assuming this is due to various interpretations of Rule 10.9.3(c). which says that the shortform must begin the word. When they say "word" here, do they mean the start of the symbol sequence? Or, since parentheses do not affect stand alone status, is it okay to use the shortform?
According to 10.6.2, the beginning of a word is defined as the letters-sequence which follows a psace, hyphen or dash and which may be preceded by the punctuation and indicator symbols listed in 2.6.2 (which is the standing alone rule). The parentheses are listed in 2.6.2, so you CAN use the shortform for little in this instance.


You are given an array of $$$n$$$ positive integers $$$a_1, a_2, \ldots, a_n$$$. Your task is to calculate the number of arrays of $$$n$$$ positive integers $$$b_1, b_2, \ldots, b_n$$$ such that:

- $$$1 \le b_i \le a_i$$$ for every $$$i$$$ ($$$1 \le i \le n$$$), and
- $$$b_i \neq b_{i+1}$$$ for every $$$i$$$ ($$$1 \le i \le n - 1$$$).

The number of such arrays can be very large, so print it modulo $$$998\,244\,353$$$.


Innokenty is a president of a new football league in Byteland. The first task he should do is to assign short names to all clubs to be shown on TV next to the score. Of course, the short names should be distinct, and Innokenty wants that all short names consist of three letters.

Each club's full name consist of two words: the team's name and the hometown's name, for example, "DINAMO BYTECITY". Innokenty doesn't want to assign strange short names, so he wants to choose such short names for each club that:

1. the short name is the same as three first letters of the team's name, for example, for the mentioned club it is "DIN",
2. or, the first two letters of the short name should be the same as the first two letters of the team's name, while the third letter is the same as the first letter in the hometown's name. For the mentioned club it is "DIB".

Apart from this, there is a rule that if for some club x the second option of short name is chosen, then there should be no club, for which the first option is chosen which is the same as the first option for the club x. For example, if the above mentioned club has short name "DIB", then no club for which the first option is chosen can have short name equal to "DIN". However, it is possible that some club have short name "DIN", where "DI" are the first two letters of the team's name, and "N" is the first letter of hometown's name. Of course, no two teams can have the same short name.

Help Innokenty to choose a short name for each of the teams. If this is impossible, report that. If there are multiple answer, any of them will suit Innokenty. If for some team the two options of short name are equal, then Innokenty will formally think that only one of these options is chosen.


The average miner Vaganych took refresher courses. As soon as a miner completes the courses, he should take exams. The hardest one is a computer test called "Testing Pants for Sadness".

The test consists of n questions; the questions are to be answered strictly in the order in which they are given, from question 1 to question n. Question i contains ai answer variants, exactly one of them is correct.

A click is regarded as selecting any answer in any question. The goal is to select the correct answer for each of the n questions. If Vaganych selects a wrong answer for some question, then all selected answers become unselected and the test starts from the very beginning, from question 1 again. But Vaganych remembers everything. The order of answers for each question and the order of questions remain unchanged, as well as the question and answers themselves.

Vaganych is very smart and his memory is superb, yet he is unbelievably unlucky and knows nothing whatsoever about the test's theme. How many clicks will he have to perform in the worst case?


//
//  MainTabBarViewController.h
//  MixSeafoodDemo
//
//  Created by choushayne on 15/1/26.
//  Copyright (c) 2015年 ShayneChow. All rights reserved.
//

#import <UIKit/UIKit.h>

@interface MainTabBarViewController : UITabBarController

@end


Alle 121Watt Ahrefs Bloofusion Germany Crawling Monday Farbentour Google Search Central Moz Neil Patel RustyBrick Barry Schwartz Search Engine Roundtable searchmetrics SISTRIX DE SpaceХ Website Boosting
Small Business Ideas for Beginners (Low Cost / Low Risk)
In this video, you’ll learn five small business ideas for beginners that are cheap and easy to start.
Additional Small Business Resources
Complete SEO Course for Beginners: Learn to Rank #1 in Google ► https://www.youtube.com/watch?v=xsVTqzratPs
Affiliate Marketing for Beginners: Complete A-Z Tutorial ► https://www.youtube.com/watch?v=W-nbsnXtSZI
How to Find a Niche for your Online Business ► https://www.youtube.com/watch?v=rUjZ0GRIx6M
These ideas are easy to implement because they require little to no money and come with virtually no risk but your time.
The first idea is called “SaaSaaS.”
SaaS stands for Software as a Service and usually describes web-based software that companies create and license out to users. SaaSaaS stands for “Software as a Service … as a Service.” And this is when you sell services based around a SaaS tool.
Watch the video to learn more about this idea.
The next small business idea is to start a niche drone videography business. And there are three advantages to starting a drone videography business:
► It’s relatively cheap to start
► It’s easy to get halfway decent at basic drone videography
► You may charge quite a lot for this service.
Want to learn more about starting this niche business? Watch the video.
The third small business idea is to become a voiceover actor. It’s about doing voiceovers for budget ads, commercials, screencasts, or whatever. It has two advantages:
► Pretty much anyone can do it
► It can pay well in terms of time/earnings ratio
Watch the video to learn where to start here.
The next idea is to become a freelance content writer.
There are thousands of freelance content writers already. So the main question is: how do you build a freelance content writing business to make a six-figure budget per year? The oversimplified answer is to become a niche expert.
Watch the video to learn how to do it.
Another small business idea is to create a niche affiliate website. Affiliates promote another company’s products or services in exchange for a commission when you refer a sale. The best thing about this business model is the lowest risk and lowest cost online business idea you can start today.
Want to learn how to start your affiliate business? Watch the video.
0:08 Start the so-called "SaaSaaS" business
1:53 Start a niche drone videography business
3:49 Become a voiceover actor
5:43 Become a freelance content writer
7:43 Create a niche affiliate website
#smallbusinessideas #smallbusinessidea #smallbusiness
Be sure to subscribe for more actionable marketing and SEO tutorials.
Ahrefs ► https://ahrefs.com/
YouTube ► https://www.youtube.com/AhrefsCom?sub_confirmation=1
Facebook ► https://www.facebook.com/Ahrefs
Die letzten 10 YouTube Videos von Ahrefs
- 29.11.2023 - The Google Loophole That Created Overnight Millionaires
- 15.11.2023 - What Happens to SEO in a Recession (and How to Prepare)?
- 01.11.2023 - I Tried to Rank #1 on Google in 24 Hours to Prove a Point
- 18.10.2023 - Official Ahrefs Tutorial: How to use Ahrefs to Improve SEO
- 04.10.2023 - The SEO Strategy to BREAK into Competitive Niches
- 13.09.2023 - International SEO: Strategy to Boost Worldwide Traffic
- 30.08.2023 - These ChatGPT Hacks Make Digital Marketing WAY Easier
- 16.08.2023 - How I Would Learn Digital Marketing (If I Could Start Over)
- 09.08.2023 - Meet The Best Looking SEO Book
- 02.08.2023 - How to use HARO (And Alternatives)
Alle Videos auflisten


I’m stuck in the world between Apple and Microsoft. I would like to archive all of my work email from Outlook using Devonthink Office at home. I know there are several solutions to import an Outlook pst file into Apple Mail, but most are very cumbersome or another expense on top of my already escalating 3rd party software bill. My question is:
Is there a way to import mail messages from an Outlook pst file directly into Devonthink Office? This feature (or Applescript) would be a wonderful lure to get some of my friends to take a serious look at Devonthink as an information manager. Not to mention it would make my life easier.


Recently the Ubuntu newswires have been buzzing with the news that we have won our first smartphone partner.
Now, let’s get the elephant in the room out of the way – I am not telling you who it is. It is not my place here to share confidential details about business-to-business relationships such as this. Rest assured though, I know the folks working on these relationships and there is a tremendous amount of opportunity for Ubuntu in these discussions; OEMs, carriers, ISVs and more are very interested in exploring Ubuntu for future products.
This is…spoiler alert…fantastic news.
But what does this news really mean for Ubuntu, and to what extent do our community play a part? Let’s dig into this a little bit.


Well as said when i start or restart my pc, my pc just goes black for a few seconds then just goes straight to windows 10's loading screen without even showing up acers logo on the screen at first. (you know the screen where it displays your motherboards brand and some options to enter bios). Yeah it just skips that and just goes straight to windows 10. So yeah any way to like fix it? Thanks in advance.


#ifndef SERIALTEST_H_
#define SERIALTEST_H_

#include <sys/time.h>
#include <mavlink/common/mavlink.h>

/**
 * the file descriptor of the port that will be opened using open_port().
 */
extern int streamFD;
extern const char* RS232_DEVICE_const;

#define USART3 3
#define BAUDRATE B57600
#define RS232_DEVICE "dev/ttyUSB0"

/**
 * @brief      returns streamFD.
 */
int get_streamFD(void);

/**
 * @brief      Opens a port for serial communication.
 * @return     returns an int that's the file descriptor of the opened port.
 */
int open_port(void);

/**
 * @brief      gets one complete NMEA message from the GPS, through the serial port that its on.
 * @param[in]  fd      the file descriptor of serial port used for communication with the GPS
 * @param      buffer  the string buffer that the message will be written to.
 * @return     returns the number of characters that were read for this NMEA sentence.
 */
int fetch_sentence_from_gps(int fd, char* buffer);

/**
 * @brief      Blocking read of one byte from the serial port.
 *
 * @param[in]  i     Unused
 *
 * @return     The read byte.
 */
int usart_recv_blocking(int i);

/**
 * @brief      Open a serial connection on a specified port
 * @param[in]  portname  The name of the serial port
 * @return     -1 for error and 1 for success.
 */
int serial_start(const char* portname);

/**
 * @brief      Read one byte at a time from the MAVLink stream on the serial port
 *             and populate the mavlink message struct as new bytes arrive.
 *
 * @param      message  The MAVLink message struct which is populated with the
 *                      parse data that's received from the serial port.
 *
 * @return     1 if a complete MAVLink message could be read, 0 otherwise.
 */
int serial_read_message(mavlink_message_t* message);

/**
 * @brief      Write a mavlink message to the serial port.
 *
 * @param[in]  message  The MAVLink message to be written.
 *
 * @return     The number of bytes written to the serial port (the size of the message).
 */
int serial_write_message(const mavlink_message_t* message);

/**
 * @brief      Gets the number of seconds and milliseconds since epoch.
 *
 * @param      tv    the timeval struct (sys/time.h)
 * @param      tz    the timezone struct
 *
 * @return     0 for successful write to structs and -1 for failure.
 */
int get_time_sec(struct timeval *tv, struct timezone *tz);

#ifdef DEBUG
/**
 * @brief      Closes the opened serial ports.
 *             Used in the signal handler to allow peaceful termination when a SIGINT is received
 *
 * @return     The result of close()ing the opened ports (&&)
 */
int handle_quit_serial();
#endif

#endif /* SERIALTEST_H_ */


SIAM Presents Awards and Prizes, Honors New Class of Fellows at 2010 Annual MeetingSeptember 15, 2010
The following recipients of SIAM awards and prizes were honored in Pittsburgh on July 13, during the 2010 SIAM Annual Meeting:
I.E. Block Community Lecture. Dmitri Tymoczko, Princeton University; the lecture was titled "The Geometry of Music."
Julian Cole Lecture. John R. King, University of Nottingham, UK, with a lecture titled "Mathematical Modelling of Tissue Growth."
Richard C. DiPrima Prize. Colin B. Macdonald, Mathematical Institute, University of Oxford, UK, for his dissertation titled "The Closest Point Method for Time-Dependent Processes on Surfaces."
AWM–SIAM Sonia Kovalevsky Lecture. Suzanne Lenhart, University of Tennessee, Knoxville; the lecture was titled "Mixing It Up: Discrete and Continuous Optimal Control for Biological Models."
George Pólya Prize. Emmanuel Candès, Stanford University, and Terence Tao, UCLA.
W.T. and Idalia Reid Prize in Mathematics. John A. Burns, Virginia Polytechnic Institute and State University, who gave a prize lecture, "William T. and Idalia Reid: His Mathematics and Her Mathematical Family."
SIAM Awards in the Mathematical Contest in Modeling
Problem A, The Continuous Problem: "The Sweet Spot"
Solution: "An Optimal Model of the ‘Sweet Spot' Effect"
Students: Zhe Xiong, Qipei Mei, and Fei Han
Faculty Adviser: Liang Gao
HUST–Huazhong University of Science and Technology, PRC.
Problem B, The Discrete Problem: "Criminology"
Solution: "Following the Trail of Data"
Students: Joseph H. Gibney, Emily P. Meissen, and Yonatan Naamad
Faculty Adviser: Peter Kramer
Rensselaer Polytechnic Institute.
Student Paper Prizes
Bubacarr Bah (Co-Author, Jared Tanner), University of Edinburgh, UK, for "Improved Restricted Isometry Constant Bounds for Gaussian Matrices," submitted for publication in SIAM Journal on Matrix Analysis and Applications.
Russell Carden, Rice University, for "A Simple Algorithm for the Inverse Field of Values Problem," Inverse Problems, 25 (2009), 115019.
Karin Leiderman (Co-Author, Aaron L. Fogelson), University of Utah, for "Grow with the Flow: A Spatial-Temporal Model of Platelet Deposition and Coagulation under Flow," Mathematical Medicine and Biology, May 3, 2010, doi: 10.1093/imammb/dqq005.
SIAM Prize for Distinguished Service to the Profession. Martin Grötschel, Vice President, Konrad-Zuse-Zentrum für Informations-technik Berlin (ZIB), and Professor, Technische Universität Berlin, Institut für Mathematik, Germany.
The John von Neumann Lecture. Bernd Sturmfels, University of California, Berkeley; the lecture was titled "Algebra: From Linear to Non-Linear."
The members of the 2010 Class of SIAM Fellows are:
Uri M. Ascher, University of British Columbia
Andrea L. Bertozzi, University of California Los Angeles
Susanne C. Brenner, Louisiana State University
John C. Butcher, University of Auckland
Stephen L. Campbell, North Carolina State University
Carlos Castillo-Chavez, Arizona State University
Tony F. Chan, Hong Kong University of Science and Technology
Peter Constantin, University of Chicago
John E. Dennis, Jr., Rice University, Retired, and University of Washington
Iain S. Duff, Rutherford Appleton Laboratory, UK, and CERFACS, France
Paul G. Dupuis, Brown University
Bjorn E. Engquist, University of Texas, Austin
Donald Geman, Johns Hopkins University
John R. Gilbert, University of California Santa Barbara
Michael T. Heath, University of Illinois
T.C. Hu, University of California San Diego
George Karniadakis, Brown University
William L. Kath, Northwestern University
Ioannis G. Kevrekidis, Princeton University
Barbara Lee Keyfitz, Ohio State University
Randall J. LeVeque, University of Washington
Anders G. Lindquist, KTH---Royal Institute of Technology
Steve McCormick, University of Colorado Boulder
Carl D. Meyer, North Carolina State University
Jorge Nocedal, Northwestern University
Yousef Saad, University of Minnesota, Twin Cities
Fadil Santosa, University of Minnesota, Twin Cities
Robert Schreiber, Hewlett-Packard
Mitchell D. Smooke, Yale University
Danny C. Sorensen, Rice University
Gunther Uhlmann, University of Washington
Frederic Y.M. Wan, University of California Irvine
Michael I. Weinstein, Columbia University
Olof B. Widlund, Courant Institute of Mathematical Sciences, New York University.
Two fellows were added to the 2009 class after the initial announcement:
Robert B. Schnabel, Indiana University
Suresh P. Sethi, University of Texas, Dallas.
Newly named fellows gathered at the prize luncheon in Pittsburgh. Seated, left to right: Fred Wan, Suresh Sethi, Andrea Bertozzi, and Barbara Keyfitz. Standing, left to right: Carlos Castillo-Chavez, Mitchell Smooke, Carl Meyer, Michael Weinstein, Steve Campbell, Bill Kath, Uri Ascher, Michael Heath, Anders Lindquist, Randy LeVeque, Susanne Brenner, John Gilbert, Rob Schreiber, Peter Constantin, Gunther Uhlmann, Jorge Nocedal, and Danny Sorensen.
The recipients of the 2010 SIAM Student Paper Prizes, left to right, at the prize luncheon in Pittsburgh: Russell Carden (Rice University), Karin Leiderman (University of Utah), and Bubacarr Bah (University of Edinburgh, UK). The student paper prizes are given annually to recognize outstanding scholarship by students in applied mathematics or computing.
Colin Macdonald of the Mathematical Institute at the University of Oxford, UK, received the 2010 Richard C. DiPrima Prize, for research that contributed "new insights for computing numerical solutions to PDEs on general curved surfaces."
Tim Lewis of the University of California, Davis, and Jonathan E. Rubin of the University of Pittsburgh, co-chairs of the organizing committee for the 2010 SIAM Conference on the Life Sciences, paused for a photo at the reception that followed the I.E. Block Community Lecture. The life sciences meeting was held jointly with the 2010 SIAM Annual Meeting.


This group is locked. No changes can be made to the group while it is locked.
Date 1 - 1 of 1
Track And Trace, failed on step 2: Navigate to the grid directory and run docker-compose #cal-invite
NITCHEU MONKAM Junior
I am new on hyperledger Domain. Now I am trying to set up the Track And Trace example from https://github.com/hyperledger/grid-contrib/tree/master/track_and_trace.
On the second step I have the error "Service 'product-contract-builder' failed to build : Build failed" when I execute the command "docker-compose -f docker-compose.yaml -f ../grid-contrib/track_and_trace/docker-compose.yaml up --build"
Please How Can I solve this issue?, Can someone help me please?
|1 - 1 of 1|


Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.

The teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.

You've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.


Re: Activating vim color?
On -1502-Thu, Jun 26, 2003 at 01:36:49PM +0800, Miranda, Joel Louie M <email@example.com> spake thus,
> Im using vi and I switch to vim, I was wondering what r the syntax to active
> the color codes? Its just black n white. Im coding and I wasn hoping I can
> activate the colors.
You'll want to get into vim and type-
Put it in your ~/.vimrc and it'll come on each time. Also consider this-
Or even just-
If all else fails, firstname.lastname@example.org is the user mailing list for vim, and there is also a large archive of tips and scripts on www.vim.org.
Graphic Design // Web Design


Get a quick review of the user flow of the app to see where you are heading.
- [Voiceover] As we get started working on the stand-alone Task Book app, I think a review of the user flow is in order. Now that you have a firm understanding of the content model, data structures, and how tasks work on the back end of WordPress, the user flow of the stand-alone app will make a lot more sense, and most of what you see will map directly to what we've been working with up until this point. When a user first visits the Task Book app, they land on a Login page. This Login page, in turn, redirects them to WordPress for authentication, so there you'd log in just like you would any other WordPress site before you get redirected back to Task Book app, and here you land on the task list page.
The "Task list" page, or view, is the list of the 10 most recent tasks indexed by the current user. You remember in the previous chapter, we set up each task as a private task, so a user who logs in will only see their own tasks, and thanks to how we configured capabilities and how we configured the REST API, the user will in fact see all their tasks as an index. If the user has no tasks, or if they want to log a new task, they will click on "New task". This takes them to the "New task" view, and from here they fill out the same information that you would fill out on the WordPress back end.
Task title, the task description, then the prediction field, and the pre-stress level field. When the user clicks on "Create task", they are redirected back to the "Task list", and now the new task will appear at the top of the list, because it's the most recent task. The new task will be marked "In Progress", because so far, we've only filled out the prediction and pre-stress level fields, not the outcome field. To update the task, the user can now click on the task card here. They'll be directed to the "In progress task" view, where they can see the task title, the description, the prediction, and the pre-stress levels, and then they have the ability to fill out the actual outcome field and select the post-stress level field.
If this is filled out and they click "Update task", they are taken to the "Completed task" view, which is just a breakdown of the entire task, and now none of the content is editable anymore. And when they go back to the "Task list", they'll now see the task marked as "Completed" instead, so this is that status field we were talking about previously. On top of all this, we also have the "Review" view. In this view, we take the pre- and post-stress levels from each of the tasks and display them on a graph, so you can see the difference between pre- and post-stress levels over time.
Make sense? Alright, let's go.
- Planning the application
- Extending WordPress with a plugin
- Setting up the standalone application
- Configuring OAuth 2 in WordPress
- Building the task list view
- Building the new task view
- Creating a new task via the REST API
- Displaying conditional content
- Visualizing data using Graph.js


Jun 24, 2010 · A firewall is a protective system that lies, in essence, between your computer network and the Internet. When used correctly, a firewall prevents unauthorized use and access to your network. The job of a firewall is to carefully analyze data entering and exiting the network based on your configuration. It ignores information that comes from an ... 502. (a) It is the intent of the Legislature in enacting this section to expand the degree of protection afforded to individuals, businesses, and governmental agencies from tampering, interference, damage, and unauthorized access to lawfully created computer data and computer systems. The Legislature finds and declares that the proliferation of computer technology has resulted in a conco Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn When I try using the browser to connect to my server, it times out and says it can not connect to that address.In unraid shares through openvpn to unraid openvpn - · GitHub Mullvad VPN -client · Privileged: On access using VPN. - on DNS from your tab · Click Add up open vpn on container · Name: vpn Community Re: Local storage Reverse Proxy NextCloud Server. Linux Unraid Server Route VM Isolation Host Network - Send a WoL to would like to use using VPN.


11/365/2018 Blog by rutty is licensed under CC BY-NC-SA I love taking photos and I also like to blog, so each photo I take for my 365 subsequently gets stuck up as a post on..
10/1/2018 Darwin by rutty is licensed under CC BY-NC-SA This is the last of my Christmas beer, a present from my lovely Mum. She knows what makes me happy! The last time I got this..
Steve Watson has some thoughts about where the Testing Community should be concentrating its efforts in 2018: It’s the 1st of January 2018, and at 3pm the rain and grey skies have cleared, and a..


PointFire Translator version 220.127.116.11 is now available. Thank you to everyone who participated in the beta versions for the past year.
This is a major upgrade, which includes and requires a new version of the PointFire Translator app, also named version 18.104.22.168.
It makes it simple to translate Modern pages such as the ones in Communication and Teams sites and those produced by the Multilingual Page Publishing feature, as well as classic pages, documents, lists, and metadata. It has several interfaces, including via a SharePoint App, a web interface, scripting, and Power Automate.
If you were using version 1.2, the major change is that you do not need to install it on the workstation of the person carrying out the translation (although that is still supported), but it can be on a shared physical or virtual server. It runs under the identity of the person who called it via the app, it can also be called by Power Automate, and it supports the SharePoint Multilingual Page Publishing feature.
If you were using Beta 2, the major new feature is a PowerShell script to register the app and to create a Custom Connector for Power Automate
- PointFire Power Translator is now called PointFire Translator Server. The app is now called PointFire Translator App.
- Improved web interface, nicer and easier to use, separate scrollable areas for the results.
- AppReg.ps1 script to automate Azure Application Registration
- Creation of Custom Connector for Power Automate
- Support for Power Automate via new http interface
- Irish, Kazakh, European Portuguese and Brazilian Portuguese as separate languages
- Māori, Marathi, Gujarati, Punjabi, Malayalam, Kannada, Assamese, Northern Kurdish, Central Kurdish, Dari, Pashto, Odia, French (Canada) non-SharePoint languages
- Fixed 2 versions of Klingon: Klingon (Latin script) and Klingon (pIqaD script)
- Supporting Multilingual Pages feature: when translating a page in a page library, or a set of pages that match a wildcard, overwrite the page if it is an untranslated copy
- Supporting Multilingual Pages feature: translate original page title without the additional text for translators
- Supporting Multilingual Pages feature: do not re-translate if the source item changes, unless the translated document is more recent than the current translation
- Added changes to handle the documents parameter in translatedocument to include the folder structure.
- Translate folder name in a wildcard pattern
- ":o" parameter in the language to overwrite a document with its translation
- ":n" parameter in the language to use original document file name with a suffix rather than translating the document file name.
- If News webpart has Item Language filter, translate the filter condition
- Licensing: check that the username is one of the allowed usernames whatever the method of authentication.
- App feature: Select multiple documents or items
- App feature: Select subset of target languages
- Scripts to generate and install self-signed certificates for testing
- Exclude some strings from translating, or specify the translation
- Better handling of multiple exceptions in Parallel execution
- Added functionality to translate Multilingual Translations list.
- Single sign-on by obtaining access token, including configuration of Translator App
- Support https
- Can be hosted anywhere, not on localhost
- locally stored credentials optional
- locally stored credentials encrypted
- Multiple licensees, API key applies to group of licensees
- License key determines how many users can be licensed, whether domain wildcard is allowed
- Improved security
- Improved logging
- Adjust Office registry setting to prevent popup dialogs
- Improvements in MFA support
- Improved support for 2019 and vanity domains
- Retry after partial translation
- Handle API throttling, other errors
- Alternate API regional endpoints. Not extensively tested. Contact us for details.
Bug fixes and enhancements
PointFire Translator can translate individual items or entire libraries or lists in SharePoint Online. It includes the PoinFire Translator App which will use PointFire Translator Server as a default translation service, and fall back to SharePoint's Machine Translation Service if PointFire Translator is not available.
It can be downloaded here (login required)
Many thanks to the many testers who helped us get the product to this state.
For more information, contact firstname.lastname@example.org


In this talk we will present several new results regarding what invertible linear operators can do to frames. We will start by characterizing the operators which send a given frame to a frame with the same frame operator. This leads to a new definition of equivalence of frames. We then turn our attention to the following question: When can we find an invertible linear operator which sends some fixed frame to an equal norm frame. First we will characterize the frames for which such operators exist, then we proceed to characterize these operators. We will conclude by presenting a new characterization of Parseval frames.


BYTE/DEPT is looking for a Senior Lead Designer in New York, USA. Not an ordinary Senior Lead Designer but the kind of Senior Lead Designer that makes other Senior Lead Designers question their Senior Lead Designer-ness.
Designers at Byte/Dept® bring to life authentic ideas that capture the audiences’ attention. They work within many different formats and social platforms, leveraging the latest tech. They combine strategic thinking with design, illustration and motion to deliver innovative work.
Our office in New York is looking for a Senior Lead Designer to help lead, art direct and oversee our Spotify client in addition to possibly supporting a few other accounts. The design team is made up of art directors, illustrators, animators (2D + 3D), and video editors, which means each designer brings something different to every project. This role helps manage and guide the entire team alongside their Senior Lead peers.
A Senior Lead Designer represents BYTE/DEPT® New York by maintaining the highest quality of work while leading their team of creatives. They help more junior team members grow and achieve their goals by staying in touch with their ambitions and providing them with projects that are a healthy challenge. The Senior Lead Designer is a problem solver, delegator and always looking for ways to work smarter, not harder. As a team, the work you create should be thoughtful and set a high bar of excellence due to your collaborative efforts with each other.
The base compensation for this full-time position will be between $90,000 - $110,000. Salary will commensurate with the person's appropriate work experience.
Job Post Linkhttps://workingnotworking.com/unjobboard/11478-byte-dept-senior-lead-designer
2D, Adobe Illustrator, Art Direction, Content Strategy, Creative Direction, Design, Design Strategy, Motion, Project Management, Type Design
March 29, 2022
- Retirement Plan
- Generous Vacation
- Parental Leave
- Relocation Package
- Medical Benefits
- Sick Office Supplies


You are given a rectangular matrix of size $$$n \times m$$$ consisting of integers from $$$1$$$ to $$$2 \cdot 10^5$$$.

In one move, you can:

- choose any element of the matrix and change its value to any integer between $$$1$$$ and $$$n \cdot m$$$, inclusive;
- take any column and shift it one cell up cyclically (see the example of such cyclic shift below).

A cyclic shift is an operation such that you choose some $$$j$$$ ($$$1 \le j \le m$$$) and set $$$a_{1, j} := a_{2, j}, a_{2, j} := a_{3, j}, \dots, a_{n, j} := a_{1, j}$$$ simultaneously.

Example of cyclic shift of the first column

You want to perform the minimum number of moves to make this matrix look like this:

In other words, the goal is to obtain the matrix, where $$$a_{1, 1} = 1, a_{1, 2} = 2, \dots, a_{1, m} = m, a_{2, 1} = m + 1, a_{2, 2} = m + 2, \dots, a_{n, m} = n \cdot m$$$ (i.e. $$$a_{i, j} = (i - 1) \cdot m + j$$$) with the minimum number of moves performed.


Mauri Alligator Shoes Green Yellow Monk Strap Godfather 3051
If you love exotic and unique style crocodile shoes and boots, there is no reason not wear Mauri shoes and boots. Mauri makes all of their fine alligator shoes and boots in Italy for the man who wants unique style. These hunter green and ice color shoes are made of pure alligator and ostrich leg skin in a plaiin toe style that will certainly have people asking you questions. Hand made in Italy.


The electric polarization of a periodic solid can be expressed as a Berry phase, and computed from the occupied Bloch state overlap matrix between neighboring wavevectors on a grid sampling the Brillouin zone. The usual discretized expression for the electric polarization leads to slow convergence with respect to the number of wavevectors on the grid. In this work, we improve the integration scheme, and obtain a better accuracy without the need for a finer sampling. Our technique uses multi-step overlap matrices instead of only nearest-neighbor overlap matrices, and results in higher precision for almost no additional computation cost. We test the method on AlAs, confirm the theoretical convergence rate, and observe that medium-order multi-step formulas provide superior accuracy without fluctuation problems.
- Berry phase
- Density-functional theory


This is a little atrical from the BBC. It gives a fairly simple run down on reconising spam and it is farily basic but might give a starting poin t for some.
Full BBC report.
Anatomy of a spam e-mail
A daily chore of modern life for many is the morning trawl through a full inbox deleting spam email. But just where does it all come from and why do spammers use bizarre text, names and images in their emails?
To the expert eye a typical spam is laden with clues to its origin. Click on the links below to find out more
"Iverson Vernie": An implausible name that sounds human to computers if not people. This helps to offset the "spamminess" of the message. Plus it is in capital letters which also helps to bust the scoring systems often used to spot spam.


Senior Java Engineer
A leader in advertising, based in Sherman Oaks, is building their software development team and are looking to add a Senior Level Java Engineer to their small, tight knit team. Specifically, they are looking to add an expert Java master with experience in Spring, Hibernate, Restful Web Services, API, and MySQL. Experience with Big Data tools are a plus.
There are plenty of benefits to this opportunity. This opportunity is ground floor with a small company who will only be growing over the coming years, you will enjoy perks like full and comprehensive benefits, generous paid vacation, 401(k) with a matching, a relaxed and casual work environment and flexible scheduling, and a gym membership.
Required Skills & Experience
- Minimum 8 years in Java software engineering
- Big Data tools (Hadoop, MapReduce, Kafka)
- Database experience (Oracle, MySQL, SQL Server)
- Agile methodology
- Continous integration
- Unit Testing
Benefits & Perks
- Comprehensive benefit package including health, vision, and dental
- 401k with a match
- Generous PTO
- Unlimited growth opportunity
- Flexible schedule
- Casual work environment
- Startup culture!


#pragma once

#include <concepts>
#include <memory>

struct nullopt_t {};
inline constexpr nullopt_t nullopt{};

struct in_place_t {};
inline constexpr in_place_t in_place{};

namespace detail {

template <typename T, typename... Args>
concept Constructible = std::is_constructible_v<T, Args...>;

template <typename T>
concept TriviallyDestructible = std::is_trivially_destructible_v<T>;

template <typename T>
concept TriviallyCopyable = std::is_trivially_copyable_v<T>;

template <typename T>
concept CopyConstructible = std::is_copy_constructible_v<T>;

template <typename T>
concept MoveConstructible = std::is_move_constructible_v<T>;

template <typename T>
concept CopyAssignable = std::is_copy_assignable_v<T>;

template <typename T>
concept MoveAssignable = std::is_move_assignable_v<T>;

struct dummy_t {};

template <typename T, bool trivial>
struct destructor_optional_base {

  bool active{false};
  union {
    dummy_t dummy;
    T value;
  };

  constexpr destructor_optional_base() noexcept : dummy(dummy_t()) {}

  template <typename... Args> requires Constructible<T, Args...>
  constexpr destructor_optional_base(in_place_t, Args... args) noexcept(std::is_nothrow_constructible_v<T, Args...>)
      : active{true}, value(std::forward<Args>(args)...) {}

  constexpr destructor_optional_base(const T& value_) noexcept
      : active{true}, value(value_) {}

  constexpr destructor_optional_base(T&& value_) noexcept
      : active{true}, value(std::move(value_)) {}

  ~destructor_optional_base() noexcept(std::is_nothrow_destructible_v<T>) {
    reset();
  }

  void reset() noexcept(std::is_nothrow_destructible_v<T>) {
    if (active) {
      value.~T();
      active = false;
    }
  }
};

template <typename T>
struct destructor_optional_base<T, true> {

  bool active{false};
  union {
    detail::dummy_t dummy;
    T value;
  };

  constexpr destructor_optional_base() noexcept : dummy(dummy_t()) {}

  template <typename... Args> requires Constructible<T, Args...>
  constexpr destructor_optional_base(in_place_t, Args... args) noexcept(std::is_nothrow_constructible_v<T, Args...>)
      : active{true}, value(std::forward<Args>(args)...) {}

  constexpr destructor_optional_base(const T& value_) noexcept
      : active{true}, value(value_) {}

  constexpr destructor_optional_base(T&& value_) noexcept
      : active{true}, value(std::move(value_)) {}

  ~destructor_optional_base() noexcept = default;

  constexpr void reset() noexcept {
    active = false;
  }
};

template <typename T>
struct copy_optional_base : destructor_optional_base<T, TriviallyDestructible<T>> {
  using base = destructor_optional_base<T, TriviallyDestructible<T>>;
  using base::base;

  constexpr copy_optional_base() noexcept = default;

  constexpr copy_optional_base(const copy_optional_base&) noexcept requires(TriviallyCopyable<T>) = default;
  constexpr copy_optional_base(copy_optional_base&&) noexcept requires(TriviallyCopyable<T>) = default;
  constexpr copy_optional_base& operator=(const copy_optional_base&) noexcept requires(TriviallyCopyable<T>) = default;
  constexpr copy_optional_base& operator=(copy_optional_base&&) noexcept requires(TriviallyCopyable<T>) = default;

  constexpr copy_optional_base(const copy_optional_base& other) noexcept(std::is_nothrow_copy_constructible_v<T>) requires(!TriviallyCopyable<T>) {
    this->active = other.active;
    if (other.active) {
      new (&(this->value)) T(other.value);
    }
  }

  constexpr copy_optional_base(copy_optional_base&& other) noexcept(std::is_nothrow_move_constructible_v<T>) requires(!TriviallyCopyable<T>) {
    this->active = other.active;
    if (other.active) {
      new (&(this->value)) T(std::move(other.value));
    }
  }

  constexpr copy_optional_base& operator=(const copy_optional_base& other) noexcept(std::is_nothrow_copy_assignable_v<T>) requires(!TriviallyCopyable<T>) {
    if (this != &other) {
      if (this->active) {
        if (other.active) {
          this->value = other.value;
        } else {
          this->reset();
          this->dummy = dummy_t();
        }
      } else if (other.active) {
        new (&(this->value)) T(other.value);
      }
      this->active = other.active;
    }
    return *this;
  }

  constexpr copy_optional_base& operator=(copy_optional_base&& other) noexcept(std::is_nothrow_move_assignable_v<T>) requires(!TriviallyCopyable<T>) {
    if (this != &other) {
      if (this->active) {
        if (other.active) {
          this->value = std::move(other.value);
        } else {
          this->reset();
          this->dummy = dummy_t();
        }
      } else if (other.active) {
        new (&(this->value)) T(std::move(other.value));
      }
      this->active = other.active;
    }
    return *this;
  }
};

} // namespace detail

template <typename T>
class optional : detail::copy_optional_base<T> {
  using base = detail::copy_optional_base<T>;
  using base::base;

public:
  constexpr optional() noexcept = default;
  constexpr optional(const optional&) noexcept(std::is_nothrow_copy_constructible_v<T>) requires(detail::CopyConstructible<T>) = default;
  constexpr optional(optional&&) noexcept(std::is_nothrow_move_constructible_v<T>) requires(detail::MoveConstructible<T>) = default;
  constexpr optional& operator=(const optional&) noexcept(std::is_nothrow_copy_assignable_v<T>) requires(detail::CopyAssignable<T>) = default;
  constexpr optional& operator=(optional&&) noexcept(std::is_nothrow_move_assignable_v<T>) requires(detail::MoveAssignable<T>) = default;
  constexpr optional(nullopt_t) noexcept : optional() {};

  constexpr optional& operator=(nullopt_t) noexcept {
    reset();
    return *this;
  }

  template <typename... Args> requires detail::Constructible<T, Args...>
  constexpr void emplace(Args... args) noexcept(std::is_nothrow_constructible_v<T, Args...>) {
    reset();
    new (&(this->value)) T(std::forward<Args>(args)...);
    this->active = true;
  }

  bool has_value() const noexcept {
    return this->active;
  }

  constexpr T& operator*() noexcept {
    return this->value;
  }

  constexpr T const& operator*() const noexcept {
    return this->value;
  }

  constexpr T const* operator->() const noexcept {
    return &this->value;
  }

  constexpr T* operator->() noexcept {
    return &this->value;
  }

  constexpr explicit operator bool() const noexcept {
    return this->active;
  }

  constexpr void reset() noexcept {
    base::reset();
  }

  friend constexpr bool operator==(const optional<T>& lhs, const optional<T>& rhs) {
    if (bool(lhs) != bool(rhs)) {
      return false;
    }
    if (!lhs) {
      return true;
    }
    return lhs.value == rhs.value;
  }

  friend constexpr bool operator!=(const optional<T>& lhs, const optional<T>& rhs) {
    return !(lhs == rhs);
  }

  friend constexpr bool operator<(const optional<T>& lhs, const optional<T>& rhs) {
    if (!rhs) {
      return false;
    }
    if (!lhs) {
      return true;
    }
    return lhs.value < rhs.value;
  }

  friend constexpr bool operator<=(const optional<T>& lhs, const optional<T>& rhs) {
    return lhs < rhs || lhs == rhs;
  }

  friend constexpr bool operator>(const optional<T>& lhs, const optional<T>& rhs) {
    return !(lhs <= rhs);
  }

  friend constexpr bool operator>=(const optional<T>& lhs, const optional<T>& rhs) {
    return !(lhs < rhs);
  }
};


You want to perform the combo on your opponent in one popular fighting game. The combo is the string $$$s$$$ consisting of $$$n$$$ lowercase Latin letters. To perform the combo, you have to press all buttons in the order they appear in $$$s$$$. I.e. if $$$s=$$$"abca" then you have to press 'a', then 'b', 'c' and 'a' again.

You know that you will spend $$$m$$$ wrong tries to perform the combo and during the $$$i$$$-th try you will make a mistake right after $$$p_i$$$-th button ($$$1 \le p_i < n$$$) (i.e. you will press first $$$p_i$$$ buttons right and start performing the combo from the beginning). It is guaranteed that during the $$$m+1$$$-th try you press all buttons right and finally perform the combo.

I.e. if $$$s=$$$"abca", $$$m=2$$$ and $$$p = [1, 3]$$$ then the sequence of pressed buttons will be 'a' (here you're making a mistake and start performing the combo from the beginning), 'a', 'b', 'c', (here you're making a mistake and start performing the combo from the beginning), 'a' (note that at this point you will not perform the combo because of the mistake), 'b', 'c', 'a'.

Your task is to calculate for each button (letter) the number of times you'll press it.

You have to answer $$$t$$$ independent test cases.


#include "geminc.h"
#include "gemprm.h"

void utf_dvctr ( int shift_x, int shift_y, unsigned char *ptr, int *zd,
		 int *zt, int *zf, int *ipnt, int *jpnt, int *len,
		 int *add, int *iret )
/************************************************************************
 * utf_dvctr								*
 *									*
 * This function decodes the relative vector (C3) header in a UTF file.	*
 *									*
 * utf_dvctr ( shift_x, shift_y, ptr, zd, zt, zf, ipnt, jpnt, len, add,	*
 *	       iret )							*
 *									*
 * Input parameters:							*
 *	shift_x		int		X shift factor			*
 *	shift_y		int		Y shift factor			*
 *	*ptr		unsigned char	Position in buffer		*
 *									*
 * Output parameters:							*
 *	*zd		int		Zoom disable			*
 *	*zt		int		Zoom threshold			*
 *	*zf		int		Zoom factor			*
 *	*ipnt		int		I coordinate			*
 *	*jpnt		int		J coordinate			*
 *	*len		int		Number of words in this record	*
 *	*add		int		Total # of bytes in this record	*
 *	*iret		int		Return code			*
 *									*
 **									*
 * Log:									*
 * D. Keiser/GSC	12/96						*
 * M. Linda/GSC		10/97	Corrected the prologue format		*
 ***********************************************************************/
{
/*---------------------------------------------------------------------*/
    *iret = 0;
    ptr += 1;

/*
**  Decode zoom disable (bit 10 in the first word).
*/
    *zd = (*ptr >> 5) & 0x01;

/*
**  Decode zoom threshold (bit 11-12 in the first word).
*/
    *zt = (*ptr >> 3) & 0x03;

/*
**  Decode zoom factor (bit 13-15 in the first word).
*/
    if  ( ( ( *ptr & 0x20 ) != 32 ) || ( shift_x ) )
	*zf =  1;
    else
	*zf =  (((*ptr & 0x07) + 1) + 1) * (((*ptr & 0x07) + 1) + 1);
    ptr += 1;

/*
**  Decode I coordinate.
*/
    *ipnt = ((*ptr << 8) + *(ptr + 1)) << shift_x;
    ptr += 2;

/*
**  Decode J coordinate.
*/
    *jpnt = ((*ptr << 8) + *(ptr + 1)) << shift_y;
    ptr += 2;

/*
**  Decode length of record (# of words).
*/
    *len = (*ptr << 8) + *(ptr + 1);
    *add = *len * 2 + 8;

    ptr += 2;

}


Yesterday, Happy Prime owner and engineer Jeremy Felt released Shortnotes, a plugin for writing notes from the WordPress editor. The intention is for users to create short pieces of content, such as that found on Twitter, Instagram, and similar social networks. However, it does not come with a front-end posting interface, at least not in version 1.0.
The plugin works just like the post and page editor. It should be straightforward for most users.
While the Shortnotes plugin is relatively bare-bones for now, it serves as a foundation of something that could be more. Part of what makes social networks appealing is the ease of publishing quick content. Publishing notes through the plugin requires visiting the WordPress admin, clicking “Add New,” writing the content, publishing, and clicking a new link to view it on the front end. A quick-publishing interface either through a Dashboard widget or a front-end form would be a useful addition.
Note post type in the block editor.
Some new concepts that not all users may be familiar with are the “Reply to URL” and “Reply to name” fields. These are semantic fields for creating a note in reply to another post or person on the web. The plugin will automatically output this reply link on the front end.
The plugin integrates with the Webmention plugin. A Webmention is a standardized protocol for mentions and conversations across the web. The goal is a decentralized social “network” of sorts where everyone owns and controls their content. It is an alternative to what IndieWeb calls the “corporate” web in which large tech companies have control.
When entering a Reply to URL, Shortnotes will automatically send that URL through the Webmentions plugin system. It will also parse URLs in the post content as webmentions if they exist.
Users may also notice that the note title field is missing. This is intentional. The plugin automatically generates titles. They are needed for the
The idea is for titles to not appear as part of the theme layout. Because most themes are not coded to check for post-type support before displaying them, there is a high chance that a user’s theme will output the auto-generated title on the front end. For now, that means editing a bit of theme code for those who do not want them to appear. Felt has an example of how he modified this for his site’s custom Twenty Twenty-One child theme. In the long run, as more themes begin supporting the upcoming site editor, users will be able to make this customization directly in the WordPress admin.
With a few tweaks like removing the title and some minor CSS adjustments, I was able to create a clean Notes archive page using the Genesis Block theme:
Modified notes archive.
One of my interests in checking this project out was diving into a real-world example of a plugin that limited which blocks could be used with the editor. The notes post type only allows the Paragraph, Image, and Gallery blocks. Again, the idea is to replicate the feel of what you can do on social networks. Overall, this feature worked as it should, limiting the notes to a subset of blocks.
However, I ran across a bug with the block editor. All block patterns, regardless of what blocks they contained, appeared in the inserter. Clicking on one containing a disallowed block would not insert it into a post. However, the editor did add a pop-up note that it had. There is a GitHub issue for this bug that has seen little movement since it was opened in June 2020.
Felt created a plugin to solve this called Unregister Broken Patterns. It removes any patterns that contain blocks that a post type does not support. At best, it is a temporary measure and needs to be addressed in WordPress.


Hi everyone! I have recently applied for a role at JPM. I checked my job status yesterday and it says submission status'withrew'. The thing is that I never withdrew my application as I am really interested in the role. Could that be a mistake or I was just rejected. I guess if I was rejected I would probably have a 'rejected' status!? Does anyone know what that means? Thanks in advance!


Sun-EaterBack to Beasts Main > Sun-Eater
Real Identity: Sun-Eater
Powers/Skills: Solar Ingestion, Flight, and Survival in Space
Voiced By: Not Applicable
The Sun-Eaters were originally conceived as weapon of mass destruction by a race of beings known as the Controllers. It acted as an artifical black hole and compressed a star to a point it went supernova. The resulting release in thermal energy would empower the Sun-Eater further. With these weapons, the Controllers could greater exact their pro-active agenda to stop evil across the universe. There are some Sun-Eaters that develop into a sentient lifeform. Like wild animals, they possess instinctual navigation and migratory patterns.
Superman once found an infant Sun-Eater lost and wandering in orbit near Jupiter. He took it with him to his Fortress of Solitude's intergalactic zoo and cared for it ever since. Superman grew rather attached to it, and vice-versa, like a pet and fed it miniature suns created with the Cosmic Anvil. The Sun-Eater lived in a special gravity pen that required cleaning from time to time. Superman hoped to one day release it back onto its species' migration routes out past the Oort Cloud. During the battle with Solaris, the Sun-Eater appeared and attacked the Tyrant Sun. However, Solaris killed the Sun-Eater.


/*
// Copyright (c) 2017 Intel Corporation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//      http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
*/

///////////////////////////////////////////////////////////////////////////////////////////////////
#pragma once
#include "api/CPP/simpler_nms.hpp"
#include "primitive_inst.h"

namespace cldnn
{

template <>
struct typed_program_node<simpler_nms> : public typed_program_node_base<simpler_nms>
{
    auto& cls_score() const { return get_dependency(0); }
    auto& bbox_pred() const { return get_dependency(1); }
    auto& image_info() const { return get_dependency(2); }
};

using simpler_nms_node = typed_program_node<simpler_nms>;

template <>
class typed_primitive_inst<simpler_nms> : public typed_primitive_inst_base<simpler_nms>
{
    using parent = typed_primitive_inst_base<simpler_nms>;

public:
    struct anchor
    {
        float start_x;
        float start_y;
        float end_x;
        float end_y;

        anchor()
        {
            start_x = start_y = end_x = end_y = 0.0f;
        }

        anchor(float s_x, float s_y, float e_x, float e_y)
        {
            start_x = s_x;
            start_y = s_y;
            end_x = e_x;
            end_y = e_y;
        }
    };

    // indices of the memory objects used by the layer
    enum input_index {
        cls_scores_index,
        bbox_pred_index,
		image_info_index
    };

    // indices of the image info parameters inside the image_info memory object (the object
    // is an integer array of these parameters)
	enum image_info_size_index {
		image_info_width_index = 0,
		image_info_height_index = 1,
		image_info_depth_index = 2
	};

    static layout calc_output_layout(simpler_nms_node const& node);
    static std::string to_string(simpler_nms_node const& node);

public:
    typed_primitive_inst(network_impl& network, simpler_nms_node const& desc);

    const std::vector<anchor>& get_anchors() const { return _anchors; }

private:
    std::vector<anchor> _anchors;
};

using simpler_nms_inst = typed_primitive_inst<simpler_nms>;

}


How to use the WHOIS output?
The WHOIS search is a powerful tool. It gives a lot of valuable information for your domain research. It contains the following information:
- Allows you to determine if the given domain name is registered.
- Shows who is the sponsoring registrar.
- Provides information about the expiration of the domain name.
- Shows the status of the domain name.
- Gives a hint how to contact the current owner of the domain name.
Allows you to determine if the given domain name is registered.
Well, this one is pretty obvious. If the domain name is registered, then the WHOIS search for the particular name will return a full record for it. If there is no record, then the domain name is most likely available for registration.
Shows who is the sponsoring registrar.
The WHOIS search on our side for the most popular TLDs shows both the output from the TLD registrar, and from the Sponsoring Registrar. For example, Verisign is the TLD registry for .com domains, and many other registrars resell .com domain names on behalf of Verisign. These registrars are called Sponsoring Registrars, and they maintain WHOIS records for the names that are registered with them. The WHOIS output of the TLD registry shows who is the Sponsoring Registrar. Popular Sponsoring Registrars are Enom, GoDaddy, NameCheap, etc.
Provides information about the expiration of the domain name.
There is a section in the WHOIS output, which usually lists the date and time when the domain name was registered, the current expiration date, and the last time the information or the status of the domain name were modified.
Shows the status of the domain name.
There is a designated field in the WHOIS record, which lists the current status of the domain name. An example purpose of the status is to determine if a given domain name is unlocked for transfer or is it being transferred at the moment. A full list of the possible statuses is available at:
Gives a hint how to contact the current owner of the domain name.
The WHOIS records of the domain names used to contain sections with contact details for the Registrant, Administrative, Technical, and Billing contacts for the domain name. This information was very useful when searching about who is the actual domain owner. However, after the General Data Protection Regulation (GDPR) legislation of the European Union was introduced, all the registrars started to hide the personal information from the WHOIS records. The registrars still hold these records on their side, but the access to them is rather limited. It is available only to the other registrars. However, sometimes there are still some crumbs left in the WHOIS records of the Sponsoring Registrar, allowing the users to contact the domain owner. These specific records sometimes contain an email address entry, which forwards to the actual email address of the domain owner. As an alternative, the email entry may lead to a form that forwards to the owner. For example, the domain name of our web dig interface for DNS lookups website is SlimDig.com. The WHOIS lookup for this domain name in the Sponsoring Registrar Enom lists the following entry for the Registrant contact:
Registrant Email: https://tieredaccess.com/contact/9d81b8ed-78bd-43ef-909d-0610bc5353d5
The above address leads to an email form. If you use it to send a message, then it is going to be forwarded to the actual hidden Registrant contact.
For more information about the WHOIS query and response protocol, you can check the Wikipedia page at https://en.wikipedia.org/wiki/WHOIS.


A binary matrix is called good if every even length square sub-matrix has an odd number of ones.

Given a binary matrix $$$a$$$ consisting of $$$n$$$ rows and $$$m$$$ columns, determine the minimum number of cells you need to change to make it good, or report that there is no way to make it good at all.

All the terms above have their usual meanings — refer to the Notes section for their formal definitions.


Fedya and Sasha are friends, that's why Sasha knows everything about Fedya.

Fedya keeps his patience in an infinitely large bowl. But, unlike the bowl, Fedya's patience isn't infinite, that is why let $$$v$$$ be the number of liters of Fedya's patience, and, as soon as $$$v$$$ becomes equal to $$$0$$$, the bowl will burst immediately. There is one tap in the bowl which pumps $$$s$$$ liters of patience per second. Notice that $$$s$$$ can be negative, in that case, the tap pumps out the patience. Sasha can do different things, so he is able to change the tap's speed. All actions that Sasha does can be represented as $$$q$$$ queries. There are three types of queries:

1. "1 t s"  — add a new event, means that starting from the $$$t$$$-th second the tap's speed will be equal to $$$s$$$.
2. "2 t"  — delete the event which happens at the $$$t$$$-th second. It is guaranteed that such event exists.
3. "3 l r v" — Sasha wonders: if you take all the events for which $$$l \le t \le r$$$ and simulate changes of Fedya's patience from the very beginning of the $$$l$$$-th second till the very beginning of the $$$r$$$-th second inclusive (the initial volume of patience, at the beginning of the $$$l$$$-th second, equals to $$$v$$$ liters) then when will be the moment when the bowl will burst. If that does not happen, then the answer will be $$$-1$$$.

Since Sasha does not want to check what will happen when Fedya's patience ends, and he has already come up with the queries, he is asking you to help him and find the answer for each query of the $$$3$$$-rd type.

It is guaranteed that at any moment of time, there won't be two events which happen at the same second.


#pragma once

#include <nan.h>
#include <node.h>
#include <girepository.h>
#include <glib.h>
#include <cairo.h>

namespace GNodeJS {

namespace Cairo {

class TextCluster: public Nan::ObjectWrap {
  public:
    static Nan::Persistent<v8::FunctionTemplate> constructorTemplate;
    static Nan::Persistent<v8::Function>         constructor;
    static void Initialize(Nan::ADDON_REGISTER_FUNCTION_ARGS_TYPE target);
    static NAN_METHOD(New);
    static NAN_GETTER(GetLength);
    static NAN_GETTER(GetFlags);
    static NAN_INDEX_GETTER(IndexGetter);

    TextCluster(cairo_text_cluster_t* data, int64_t length, cairo_text_cluster_flags_t flags);
    ~TextCluster();

    cairo_text_cluster_t* _data;
    int64_t _length;
    cairo_text_cluster_flags_t _flags;
};

}; // Cairo

}; // GNodeJS


#include <Foundation/Foundation.h>
#include "timer.h"

void RemoveDispatchSource(void *t)
{
   dispatch_source_t mySource = *(dispatch_source_t *)t;
   dispatch_source_cancel(mySource);
   dispatch_release(mySource);
}

static dispatch_source_t CreateDispatchTimer(uint64_t interval,
              uint64_t leeway,
              dispatch_queue_t queue,
              dispatch_block_t block)
{
   dispatch_source_t timer = dispatch_source_create(DISPATCH_SOURCE_TYPE_TIMER,
                                                     0, 0, queue);
   if (timer)
   {
      dispatch_source_set_timer(timer, dispatch_time(DISPATCH_TIME_NOW, interval), interval, leeway);
      dispatch_source_set_event_handler(timer, block);
      dispatch_resume(timer);
   }
   return timer;
}

static dispatch_source_t at;

static void *MyStoreTimer(dispatch_source_t aTimer)
{
  at = aTimer;
  return &at;
}

void *MyCreateTimer(periodic_task_t MyPeriodicTask, uint64_t interval)
{
   dispatch_source_t aTimer = CreateDispatchTimer(interval,
                               (1ull * NSEC_PER_SEC)/100,
                               dispatch_get_global_queue(DISPATCH_QUEUE_PRIORITY_DEFAULT, 0),
                               ^{ (*MyPeriodicTask)(); });

   // Store it somewhere for later use.
    if (aTimer)
    {
        return MyStoreTimer(aTimer);
    }

    return NULL;
}


If you put x=y in the given equation it would make no change to the equation as y will take place of x only, Thus what you get will be
which is same as your given equation.
For finding a solution to any question the logic is to convert the question into general (predefined forms) which we have already learned.
The asked limit looks alot similar to the formula :
So, for converting the above format in this predefined format we put x+1=y
So we can write,
Here a=1, n=5 so the solution is


You are given two even integers $$$n$$$ and $$$m$$$. Your task is to find any binary matrix $$$a$$$ with $$$n$$$ rows and $$$m$$$ columns where every cell $$$(i,j)$$$ has exactly two neighbours with a different value than $$$a_{i,j}$$$.

Two cells in the matrix are considered neighbours if and only if they share a side. More formally, the neighbours of cell $$$(x,y)$$$ are: $$$(x-1,y)$$$, $$$(x,y+1)$$$, $$$(x+1,y)$$$ and $$$(x,y-1)$$$.

It can be proven that under the given constraints, an answer always exists.


SharePoint workflows are really powerful – but debugging any workflow can be a very challenging exercise. You, obviously, have to drive through the process pushing an item one step to the next. That can be difficult if there are mandatory delays, retries, etc. Most of those things are just painful but generally speaking pretty solvable. However, there are some things in workflow that are really hard to get to. I ran into another situation with workflow that was hard to find.
When we were doing some stress testing we managed to break one of my workflows. After some careful work we realized that it happened anytime the workflow got two events at the same time. The second event would disappear. Poof. It just wouldn’t get handled at all. The nastiness of this is that if the second event was a task SharePoint would have locked the task and so it was no longer possible to modify the task – and because of this the workflow would never be able to be moved to completion.
I’m happy to say that the fix for this issue is in the August 2010 Cumulative update for Windows SharePoint Services 3.0. I tested it with some really abusive situations. In my validation test, I put the thread to sleep for 30 seconds after getting an event. I can say that the events are eventually delivered. However, I should caution that events aren’t always processed in the order that they came in. If I have three events, 1, 2, and 3 I’ve noticed that event 1 is processed then the workflow waits for the timer job and event 3 is processed and after the workflow goes back to sleep again event 2 is processed.
The net of this is that you should try to avoid scenarios where you have to get events in a prescribed order even after you’ve applied this fix. However, at least your workflows won’t break if two events come in at the same time – like for instance if you are asking for approvals from many people as was the case in our situation.


Year In Review: 2017Posted on
2017 has been a great year for me in many ways, so I wanted to pull together some of my highlights in a quick post.
Writing & Research
Thanks to friendly nudges and support from colleagues, 2017 was the first year where I’ve started publicly sharing some of the R&D work I get to do alongside my day job. The initial catalyst was the reception to a tweet Chris put out about a piece of research we worked on together involving hourly rank tracking.
— Chris Green (@chrisgreen87) March 2, 2017
Given the evident community interest around this, I wrote up a bit more about our findings on the then newly released StrategiQ Medium blog, and went along to the talk Chris gave at Search London about it.
I just published “0% stability in SERPs — an experiment in hourly rank tracking” https://t.co/TcP8Okgndq
— simon (@simon_jthompson) March 9, 2017
Luckily, as a follow-up to this I was also able to write about a (perhaps obvious) side-effect of the hourly rank tracking which we’d noticed in Google Search Console.
I just published “Is rank tracking messing with our Google Search Console metrics?” https://t.co/5v62n9Wnh4
— simon (@simon_jthompson) August 2, 2017
And finally, I polished up and released something I’d been experimenting with for quite a while – a way to view referring Twitter users in Google Analytics.
I just published “How to view referring Twitter users as a Custom Dimension in Google Analytics” https://t.co/PzakC0WcRh
— simon (@simon_jthompson) October 4, 2017
2017 saw another full year at StrategiQ with a number of site launches which I’m particularly proud of. We’ve also made great strides with our development standards and hosting infrastructure, which is something I’m keen to share more about in 2018 to try and help other agencies put better processes in place too.
Open Source & Code
Mostly tied in with the blog posts above, I was able to release a few small open source projects over on GitHub. These were;
- ghks – A Node key/value store, which uses GitHub gists for persistent storage.
- twitlytics-server – A Node app which resolves a t.co referring URL to the original tweet / tweeter.
- WPVersion – A JS Module and PHP Class for detecting the version of WordPress being used on a given site.
I’ve also finished up Louise’s personal website, something we’ve wanted to do for ages now, so if you happen to be looking for Music Tuition in Witham, check out her site!
Plans for 2018
Whilst I’m not one for setting specific “New Year’s Resolutions”, I’m definitely hoping to share more blog posts both here and through work in 2018, plus start actually shipping a few of the side-projects I’ve had bubbling away – so watch this space!