/* this file is created by silc_mgmtd_inst_func_source_gen.py */

#include "is_mgmtd_func_def.h"
#include "time.h"

#define IS_MGMTD_RADIUS_SERVER_CONFIG "/etc/pam_radius_auth.conf"

int is_mgmtd_system_check_hostname(char* hostname);

int is_mgmtd_radius_update_server_secret(silc_mgmtd_node* server_node)
{
	silc_mgmtd_node *p_secret_tmp = silc_mgmtd_memdb_find_sub_node(server_node, "secret-tmp");
	if(strlen(p_secret_tmp->value.val.string_val) > 0)
	{
		//secret is changed, set it to secret node and clear secret-tmp node
		silc_mgmtd_node* p_secret = silc_mgmtd_memdb_find_sub_node(server_node, "secret");
		silc_cstr new_secret = p_secret_tmp->value.val.string_val;
		silc_mgmtd_var_set_by_str(&p_secret->value, new_secret);
		silc_mgmtd_var_set_by_str(&p_secret_tmp->value, "");	//clear secret-tmp so it can't be seen when query
	}

	return 0;
}

int is_mgmtd_radius_write_server(FILE* fp, silc_mgmtd_node* server_node)
{
	silc_mgmtd_node* p_node;
	char *ip, *key;
	uint32_t port, timeout;

	p_node = silc_mgmtd_memdb_find_sub_node(server_node, "server-ip");
	ip = p_node->value.val.string_val;

	p_node = silc_mgmtd_memdb_find_sub_node(server_node, "server-port");
	port = p_node->value.val.uint32_val;

	p_node = silc_mgmtd_memdb_find_sub_node(server_node, "secret");
	key = p_node->value.val.string_val;

	p_node = silc_mgmtd_memdb_find_sub_node(server_node, "timeout");
	timeout = p_node->value.val.uint32_val;

	fprintf(fp, "%s:%d\t%s\t%d\n\n",
				ip, port, key, timeout);
	return 0;
}

int is_mgmtd_radius_server_apply(silc_mgmtd_node* new_node, char* path_del)
{
	silc_mgmtd_node *p_db_sub_node;
	silc_mgmtd_node *p_node;
	FILE* fp;
	time_t t;

	char path[256];

	fp = fopen(IS_MGMTD_RADIUS_SERVER_CONFIG".bak", "w");

	time(&t);
	fprintf(fp, "##\n"
				"## This file was AUTOMATICALLY GENERATED.  DO NOT MODIFY.\n"
				"## Any changes will be lost.\n"
				"##\n"
				"## Generated by %s at %s"
				"##\n", __func__, ctime(&t));

	fprintf(fp, "# server[:port]\tshared_secret\ttimeout (sec)\n");

	p_node = silc_mgmtd_memdb_find_node("/config/radius/server");
	silc_list_for_each_entry(p_db_sub_node, &p_node->sub_node_list, node)
	{
		if (path_del)
		{
			silc_mgmtd_memdb_get_node_path(p_db_sub_node, path);
			if (strcmp(path, path_del) == 0)
				continue;
		}

		if (p_db_sub_node->type == MEMDB_NODE_TYPE_DYNAMIC)
		{
			is_mgmtd_radius_write_server(fp, p_db_sub_node);
		}
	}
	/*
	if (new_node)
	{
		is_mgmtd_radius_write_server(fp, new_node);
	}
	*/

	fflush(fp);
	fclose(fp);

	rename(IS_MGMTD_RADIUS_SERVER_CONFIG".bak", IS_MGMTD_RADIUS_SERVER_CONFIG);

	return 0;
}

int is_mgmtd_radius_server_add_config(silc_mgmtd_node* p_node, void* conn_entry)
{
	USER_OP_LOG(conn_entry, "Radius server %u is added", p_node->value.val.uint32_val);
	is_mgmtd_radius_update_server_secret(p_node);
	is_mgmtd_radius_server_apply(p_node, NULL);
	return 0;
}

int is_mgmtd_radius_server_modify_config(silc_mgmtd_node* p_node, void* conn_entry)
{
	USER_OP_LOG(conn_entry, "Radius server %u is modified", p_node->value.val.uint32_val);
	is_mgmtd_radius_update_server_secret(p_node);
	is_mgmtd_radius_server_apply(NULL, NULL);
	return 0;
}

int is_mgmtd_radius_server_delete_config(silc_mgmtd_node* p_node, void* conn_entry)
{
	char node_path[256];
	silc_mgmtd_memdb_get_node_path(p_node, node_path);

	USER_OP_LOG(conn_entry, "Radius server %u is deleted", p_node->value.val.uint32_val);
	is_mgmtd_radius_server_apply(NULL, node_path);
	return 0;
}

int is_mgmtd_radius_server_check_req(silc_mgmtd_if_req_type type, silc_mgmtd_node* server_node, void* conn_entry)
{
	silc_mgmtd_node* p_node;
	silc_cstr hostname;
	uint32_t port;
	silc_bool server_changed = silc_false;

	p_node = silc_mgmtd_memdb_find_sub_node(server_node, "timeout");
	if (p_node->tmp_value.type != SILC_MGMTD_VAR_NULL)
	{
		uint32_t to = p_node->tmp_value.val.uint32_val;
		if (to < 1 || to > 60)
		{
			SILC_ERR("RADIUS server timeout should be 1-60");
			return IS_MGMTD_ERR_BASE_INVALID_PARAM;
		}
	}

	p_node = silc_mgmtd_memdb_find_sub_node(server_node, "server-ip");
	if (p_node->tmp_value.type != SILC_MGMTD_VAR_NULL)
	{
		hostname = p_node->tmp_value.val.string_val;
		int ret = is_mgmtd_system_check_hostname(hostname);
		if (ret)
			return ret;
		server_changed = silc_true;
	}
	else
		hostname = p_node->value.val.string_val;

	p_node = silc_mgmtd_memdb_find_sub_node(server_node, "server-port");
	if (p_node->tmp_value.type != SILC_MGMTD_VAR_NULL)
	{
		port = p_node->tmp_value.val.uint32_val;
		if (port == 0 || port > 65535)
		{
			SILC_ERR("Invalid Radius server port: %u", port);
			return IS_MGMTD_ERR_BASE_INVALID_PARAM;
		}
		server_changed = silc_true;
	}
	else
		port = p_node->value.val.uint32_val;

	if (SILC_MGMTD_IF_REQ_CHECK_ADD == type || server_changed)
	{
		silc_mgmtd_node* p_sub_node;
		p_node = silc_mgmtd_memdb_find_node("/config/radius/server");
		silc_list_for_each_entry(p_sub_node, &p_node->sub_node_list, node)
		{
			if(p_sub_node->type != MEMDB_NODE_TYPE_DYNAMIC)
				continue;
			if (p_sub_node->value.val.uint32_val != server_node->value.val.uint32_val &&
					0 == strcmp(hostname, silc_mgmtd_memdb_find_sub_node(p_sub_node, "server-ip")->value.val.string_val) &&
					port == silc_mgmtd_memdb_find_sub_node(p_sub_node, "server-port")->value.val.uint32_val)
			{
				SILC_ERR("Radius server %s:%u already exists", hostname, port);
				return IS_MGMTD_ERR_AAA_SERVER_DUPLICATED;
			}
		}
	}

	return 0;
}

int is_mgmtd_radius_server_config(silc_mgmtd_if_req_type type, void* p_db_node, void* conn_entry)
{
#ifndef SILC_MGMTD_LOCAL_DEBUG
	silc_mgmtd_node* p_node = (silc_mgmtd_node*)p_db_node;
	int ret = 0;

	if (silc_list_empty(&p_node->sub_node_list))
	{
		p_node = p_node->p_parent;
	}
	switch (type)
	{
		case SILC_MGMTD_IF_REQ_CHECK_ADD:
		case SILC_MGMTD_IF_REQ_CHECK_MODIFY:
		case SILC_MGMTD_IF_REQ_CHECK_DELETE:
			ret = is_mgmtd_radius_server_check_req(type, p_node, conn_entry);
			break;
		case SILC_MGMTD_IF_REQ_ADD:
			ret = is_mgmtd_radius_server_add_config(p_node, conn_entry);
			break;
		case SILC_MGMTD_IF_REQ_MODIFY:
			ret = is_mgmtd_radius_server_modify_config(p_node, conn_entry);
			break;
		case SILC_MGMTD_IF_REQ_DELETE:
			ret = is_mgmtd_radius_server_delete_config(p_node, conn_entry);
			break;
		default:
			break;
	}

    return ret;
#else
    return 0;
#endif
}


I recently started a new review website and am currently stuck trying to think of ways to get visitors to write reviews on it.
The purpose of the website is for users to write reviews (good or bad) on businesses in their area, websites online, or people they have dealt with or done business with.
I need help with suggestions/comments on what I can do to attract users to write reviews. I was thinking about revenue sharing or digg like environment, but need help.
Any ideas are appreciated!


I used to have the articles page as the home page, but there's not enough content being generated for that, so I reverted it to the forum list default which is working quite well.
The idea had been that the front page content would drive conversation, but it's hard coming up with articles every day, so all people end up seeing are an almost static articles page, making the site look dead. As it is now, there's movement every single day, even if it's just me creating a new thread or two, or replying, which has succeeded in me having a small, but dedicated community. Note that this is purely a hobby project and has no ads, so this level of activity is a success for me, if modest.
I've had the odd troll join too and start causing trouble with rants and unpleasantness, but they didn't last long. I don't want activity at any cost, that's for sure. NerdZone is a pleasant and welcoming place for everyone and will stay that way.


|By Business Wire||
|February 26, 2013 09:10 AM EST||
VMTurbo, the leading provider of software-defined control for cloud and virtualized environments, today announced that Clifford Chance, one of the world’s leading law firms, has deployed VMTurbo Operations Manager to control its VMware virtual infrastructure.
VMTurbo Operations Manager controls virtualized and cloud environments by assuring application performance while utilizing the infrastructure as efficiently as possible. The product’s software-defined control offloads and automates decision-making from operational staff instead of just collecting data and providing alerts.
Stewart Cooke, virtualization specialist at Clifford Chance commented, “Our virtual environment is growing rapidly to support our business and, as it does, it becomes more and more complex to manage. VMTurbo Operations Manager enables me to continuously optimize the environment to meet business requirements. It immediately identifies resource contention and tunes the environment to prevent performance issues.”
With VMTurbo Operations Manager, Clifford Chance has experienced several benefits, most notably time savings in controlling the environment. The automated decision-making in VMTurbo Operations Manager prevents performance issues from occurring, alleviating “firefighting” activities by the team. Further, resources are automatically allocated to drive higher utilization and take the guesswork out of planning for future requirements.
“VMTurbo Operations Manager is a product that actually delivers solid recommendations, ones that IT can take back to the business. It also can be automated to control the environment in a healthy state and provides us considerable cost savings,” stated Cooke.
“We are excited to be working with innovative customers like the team at Clifford Chance,” stated Andrew Mallaband, managing director for the UK and Northern Europe at VMTurbo. “As virtualization and cloud adoption grows, these complex environments require a new approach to controlling the infrastructure and maintaining the desired state. Progressive IT teams like Clifford Chance are adopting our software-defined control system to ensure performance, automate resource allocation, and improve utilization across applications and infrastructure alike – driving down the cost of compute and freeing up operational resources.”
Read the full case study here.
About VMTurbo Operations Manager
VMTurbo Operations Manager is the only solution on the market that understands application performance, resource utilization and capacity constraints in a virtualized data center, and is able to automatically adjust allocation to ensure service based on priority. Since its initial release, more than 9,000 cloud service providers and enterprises worldwide have deployed the VMTurbo Software-Defined Control platform to gain greater control and prevent performance issues across their virtual infrastructure. To download VMTurbo Operations Manager 3.3, visit www.vmturbo.com/download.
For the latest news and information, engage with VMTurbo via:
VMTurbo delivers a Software-Defined Control platform for cloud and virtualized environments. The Company’s solutions utilize its Economic Scheduling Engine to dynamically adjust configuration, resource allocation and workload placement to meet service levels and business goals. It is the only technology on the market capable of closing the loop in IT operation by automating the decision-making process to maintain the environment in the desired state. The VMTurbo platform first launched in August 2010 and since that time more than 9,000 cloud service providers and enterprises worldwide have deployed the platform, including British Telecom, Omnicare and L-3 Communications. Using VMTurbo, our customers ensure that applications get the resources they need to operate reliably, while utilizing infrastructure and human resources in the most efficient way. For more information, visit www.vmturbo.com.
Without lifecycle traceability and visibility across the tool chain, stakeholders from Planning-to-Ops have limited insight and answers to who, what, when, why and how across the DevOps lifecycle. This impacts the ability to deliver high quality software at the needed velocity to drive positive business outcomes. In his general session at @DevOpsSummit at 19th Cloud Expo, Eric Robertson, General Manager at CollabNet, will discuss how customers are able to achieve a level of transparency that e...
Oct. 21, 2016 09:30 PM EDT Reads: 607
Effectively SMBs and government programs must address compounded regulatory compliance requirements. The most recent are Controlled Unclassified Information and the EU’s GDPR have Board Level implications. Managing sensitive data protection will likely result in acquisition criteria, demonstration requests and new requirements. Developers, as part of the pre-planning process and the associated supply chain, could benefit from updating their code libraries and design by incorporating changes.
Oct. 21, 2016 09:30 PM EDT Reads: 1,577
SYS-CON Events announced today that Roundee / LinearHub will exhibit at the WebRTC Summit at @ThingsExpo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. LinearHub provides Roundee Service, a smart platform for enterprise video conferencing with enhanced features such as automatic recording and transcription service. Slack users can integrate Roundee to their team via Slack’s App Directory, and '/roundee' command lets your video conference ...
Oct. 21, 2016 09:15 PM EDT Reads: 1,973
SYS-CON Events announced today that Enzu will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. Enzu’s mission is to be the leading provider of enterprise cloud solutions worldwide. Enzu enables online businesses to use its IT infrastructure to their competitive advantage. By offering a suite of proven hosting and management services, Enzu wants companies to focus on the core of their online busine...
Oct. 21, 2016 09:15 PM EDT Reads: 1,188
SYS-CON Events announced today that SoftNet Solutions will exhibit at the 19th International Cloud Expo, which will take place on November 1–3, 2016, at the Santa Clara Convention Center in Santa Clara, CA. SoftNet Solutions specializes in Enterprise Solutions for Hadoop and Big Data. It offers customers the most open, robust, and value-conscious portfolio of solutions, services, and tools for the shortest route to success with Big Data. The unique differentiator is the ability to architect and...
Oct. 21, 2016 08:15 PM EDT Reads: 312
Why do your mobile transformations need to happen today? Mobile is the strategy that enterprise transformation centers on to drive customer engagement. In his general session at @ThingsExpo, Roger Woods, Director, Mobile Product & Strategy – Adobe Marketing Cloud, covered key IoT and mobile trends that are forcing mobile transformation, key components of a solid mobile strategy and explored how brands are effectively driving mobile change throughout the enterprise.
Oct. 21, 2016 07:15 PM EDT Reads: 1,606
In past @ThingsExpo presentations, Joseph di Paolantonio has explored how various Internet of Things (IoT) and data management and analytics (DMA) solution spaces will come together as sensor analytics ecosystems. This year, in his session at @ThingsExpo, Joseph di Paolantonio from DataArchon, will be adding the numerous Transportation areas, from autonomous vehicles to “Uber for containers.” While IoT data in any one area of Transportation will have a huge impact in that area, combining senso...
Oct. 21, 2016 07:15 PM EDT Reads: 232
@ThingsExpo has been named the Top 5 Most Influential Internet of Things Brand by Onalytica in the ‘The Internet of Things Landscape 2015: Top 100 Individuals and Brands.' Onalytica analyzed Twitter conversations around the #IoT debate to uncover the most influential brands and individuals driving the conversation. Onalytica captured data from 56,224 users. The PageRank based methodology they use to extract influencers on a particular topic (tweets mentioning #InternetofThings or #IoT in this ...
Oct. 21, 2016 07:00 PM EDT Reads: 8,101
"Matrix is an ambitious open standard and implementation that's set up to break down the fragmentation problems that exist in IP messaging and VoIP communication," explained John Woolf, Technical Evangelist at Matrix, in this SYS-CON.tv interview at @ThingsExpo, held Nov 4–6, 2014, at the Santa Clara Convention Center in Santa Clara, CA.
Oct. 21, 2016 07:00 PM EDT Reads: 8,923
The IoT has the potential to create a renaissance of manufacturing in the US and elsewhere. In his session at 18th Cloud Expo, Florent Solt, CTO and chief architect of Netvibes, discussed how the expected exponential increase in the amount of data that will be processed, transported, stored, and accessed means there will be a huge demand for smart technologies to deliver it. Florent Solt is the CTO and chief architect of Netvibes. Prior to joining Netvibes in 2007, he co-founded Rift Technologi...
Oct. 21, 2016 06:45 PM EDT Reads: 2,812
What are the new priorities for the connected business? First: businesses need to think differently about the types of connections they will need to make – these span well beyond the traditional app to app into more modern forms of integration including SaaS integrations, mobile integrations, APIs, device integration and Big Data integration. It’s important these are unified together vs. doing them all piecemeal. Second, these types of connections need to be simple to design, adapt and configure...
Oct. 21, 2016 06:45 PM EDT Reads: 1,857
For basic one-to-one voice or video calling solutions, WebRTC has proven to be a very powerful technology. Although WebRTC’s core functionality is to provide secure, real-time p2p media streaming, leveraging native platform features and server-side components brings up new communication capabilities for web and native mobile applications, allowing for advanced multi-user use cases such as video broadcasting, conferencing, and media recording.
Oct. 21, 2016 06:15 PM EDT Reads: 3,011
Kubernetes, Docker and containers are changing the world, and how companies are deploying their software and running their infrastructure. With the shift in how applications are built and deployed, new challenges must be solved. In his session at @DevOpsSummit at19th Cloud Expo, Sebastian Scheele, co-founder of Loodse, will discuss the implications of containerized applications/infrastructures and their impact on the enterprise. In a real world example based on Kubernetes, he will show how to ...
Oct. 21, 2016 05:15 PM EDT Reads: 2,814
@DevOpsSummit has been named the ‘Top DevOps Influencer' by iTrend. iTrend processes millions of conversations, tweets, interactions, news articles, press releases, blog posts - and extract meaning form them and analyzes mobile and desktop software platforms used to communicate, various metadata (such as geo location), and automation tools. In overall placement, @DevOpsSummit ranked as the number one ‘DevOps Influencer' followed by @CloudExpo at third, and @MicroservicesE at 24th.
Oct. 21, 2016 04:30 PM EDT Reads: 3,796
Established in 1998, Calsoft is a leading software product engineering Services Company specializing in Storage, Networking, Virtualization and Cloud business verticals. Calsoft provides End-to-End Product Development, Quality Assurance Sustenance, Solution Engineering and Professional Services expertise to assist customers in achieving their product development and business goals. The company's deep domain knowledge of Storage, Virtualization, Networking and Cloud verticals helps in delivering ...
Oct. 21, 2016 04:15 PM EDT Reads: 921


/**
 * (C) 2007-2019 XiYouF4 Holding Limited
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 *
 * Version: 1.0: xv_th_pool.c 08/11/2019 $
 *
 * Authors:
 *   hurley25 <liuhuan1992@gmail.com>
 */

#include "xv_th_pool.h"

#include <stdlib.h>
#include <pthread.h>

#include "xv.h"
#include "xv_log.h"
#include "xv_queue.h"

// ----------------------------------------------------------------------------------------
// xv_worker_thread_t
// ----------------------------------------------------------------------------------------
struct xv_worker_thread_t {
    xv_concurrent_queue_t *task_queue;
    xv_loop_t *loop;
    xv_async_t *async;
    pthread_t id;
    int start;
};

typedef struct xv_task_t {
    void (*cb)(void *);
    void *args;
} xv_task_t;

static void worker_async_cb(xv_loop_t *loop, xv_async_t *async)
{
    xv_log_debug("worker thread run worker_async_cb");

    xv_worker_thread_t *thread = (xv_worker_thread_t *)xv_async_get_userdata(async);
    while (xv_concurrent_queue_size(thread->task_queue) > 0) {
        if (xv_curr_log_level == XV_LOG_DEBUG) {
            xv_log_debug("worker thread running task, task count: %d", xv_concurrent_queue_size(thread->task_queue));
        }
        xv_task_t *task = (xv_task_t *)xv_concurrent_queue_pop(thread->task_queue);
        if (task && task->cb) {
            task->cb(task->args);
            xv_free(task);
        }
    }
    if (!thread->start) {
        xv_log_debug("worker thread stopped, break loop");
        xv_loop_break(loop);
    }
}

static void *worker_entry(void *args)
{
    xv_worker_thread_t *thread = (xv_worker_thread_t *)args;
    while (thread->start) {
        xv_log_debug("thread->start is %d, will call xv_loop_run", thread->start);
        xv_loop_run(thread->loop);
    }
    xv_log_debug("loop break, worker thread exit");

    return NULL;
}

xv_worker_thread_t *xv_worker_thread_init(void)
{
    xv_log_debug("worker thread init");

    xv_worker_thread_t *thread = (xv_worker_thread_t *)xv_malloc(sizeof(xv_worker_thread_t));
    thread->task_queue = xv_concurrent_queue_init();
    thread->loop = xv_loop_init(1024);
    thread->async = xv_async_init(worker_async_cb);
    xv_async_set_userdata(thread->async, thread);
    thread->start = 0;

    return thread;
}

void xv_worker_thread_destroy(xv_worker_thread_t *thread)
{
    xv_log_debug("worker thread will destroy");

    xv_worker_thread_stop(thread);
    xv_async_send(thread->async);

    int ret = pthread_join(thread->id, NULL);
    if (ret != 0) {
        xv_log_errno_error("pthread_join");
    }

    xv_async_stop(thread->loop, thread->async);
    xv_async_destroy(thread->async);
    xv_loop_destroy(thread->loop);
    xv_concurrent_queue_destroy(thread->task_queue, xv_free);
    xv_free(thread);
}

int xv_worker_thread_start(xv_worker_thread_t *thread)
{
    if (thread->start) {
        xv_log_warn("worker thread already started!");
        return XV_ERR;
    }
    thread->start = 1;
    xv_memory_barriers();

    int ret = xv_async_start(thread->loop, thread->async);
    if (ret != XV_OK) {
        xv_log_error("worker thread xv_async_start failed!");
        return XV_ERR;
    }
    ret = pthread_create(&thread->id, NULL, worker_entry, thread);
    if (ret != 0) {
        xv_log_errno_error("pthread_create");
        return XV_ERR;
    }

    xv_log_debug("worker thread start");

    return XV_OK;
}

int xv_worker_thread_stop(xv_worker_thread_t *thread)
{
    thread->start = 0;
    xv_memory_barriers();

    xv_log_debug("worker thread stop");

    return XV_OK;
}

int xv_worker_thread_push_task(xv_worker_thread_t *thread, void (*cb)(void *), void *args)
{
    xv_task_t *task = (xv_task_t *)xv_malloc(sizeof(xv_task_t));
    task->cb = cb;
    task->args = args;
    xv_concurrent_queue_push(thread->task_queue, task);
    xv_async_send(thread->async);

    xv_log_debug("worker thread push task: %p, args: %p, weak up worker thread", cb, args);

    return XV_OK;
}

int xv_worker_thread_task_count(xv_worker_thread_t *thread)
{
    return xv_concurrent_queue_size(thread->task_queue);
}

// ----------------------------------------------------------------------------------------
// xv_thread_pool_t
// ----------------------------------------------------------------------------------------
struct xv_thread_pool_t {
    xv_worker_thread_t **threads;
    int thread_count;
    int start;
};

xv_thread_pool_t *xv_thread_pool_init(int thread_count)
{
    xv_thread_pool_t *pool = (xv_thread_pool_t *)xv_malloc(sizeof(xv_thread_pool_t));
    pool->threads = (xv_worker_thread_t **)xv_malloc(sizeof(xv_worker_thread_t *) * thread_count);
    for (int i = 0; i < thread_count; ++i) {
        pool->threads[i] = xv_worker_thread_init();
    }
    pool->thread_count = thread_count;
    pool->start = 0;

    return pool;
}

void xv_thread_pool_destroy(xv_thread_pool_t *pool)
{
    xv_thread_pool_stop(pool);
    for (int i = 0; i < pool->thread_count; ++i) {
        xv_worker_thread_destroy(pool->threads[i]);
    }
    xv_free(pool->threads);
    xv_free(pool);

    xv_log_debug("task pool destroy");
}

int xv_thread_pool_start(xv_thread_pool_t *pool)
{
    if (pool->start) {
        xv_log_error("thread pool already started!");
        return XV_ERR;
    }
    for (int i = 0; i < pool->thread_count; ++i) {
        xv_worker_thread_start(pool->threads[i]);
    }

    xv_log_debug("task pool start");

    return XV_OK;
}

int xv_thread_pool_stop(xv_thread_pool_t *pool)
{
    for (int i = 0; i < pool->thread_count; ++i) {
        xv_worker_thread_stop(pool->threads[i]);
    }

    xv_log_debug("task pool stop");

    return XV_OK;
}

int xv_thread_pool_push_task(xv_thread_pool_t *pool, void (*cb)(void *), void *args, int hashcode)
{
    int index = hashcode % pool->thread_count;
    xv_log_debug("task push to worker thread index: %d, pool->thread_count: %d", index, pool->thread_count);
    return xv_worker_thread_push_task(pool->threads[index], cb, args);
}

int xv_thread_pool_task_count(xv_thread_pool_t *pool)
{
    int count = 0;
    for (int i = 0; i < pool->thread_count; ++i) {
        count += xv_worker_thread_task_count(pool->threads[i]);
    }

    return count;
}


You are given an integer $$$k$$$ and a string $$$s$$$ that consists only of characters 'a' (a lowercase Latin letter) and '*' (an asterisk).

Each asterisk should be replaced with several (from $$$0$$$ to $$$k$$$ inclusive) lowercase Latin letters 'b'. Different asterisk can be replaced with different counts of letter 'b'.

The result of the replacement is called a BA-string.

Two strings $$$a$$$ and $$$b$$$ are different if they either have different lengths or there exists such a position $$$i$$$ that $$$a_i \neq b_i$$$.

A string $$$a$$$ is lexicographically smaller than a string $$$b$$$ if and only if one of the following holds:

- $$$a$$$ is a prefix of $$$b$$$, but $$$a \ne b$$$;
- in the first position where $$$a$$$ and $$$b$$$ differ, the string $$$a$$$ has a letter that appears earlier in the alphabet than the corresponding letter in $$$b$$$.

Now consider all different BA-strings and find the $$$x$$$-th lexicographically smallest of them.


/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   list_popleft.c                                     :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: akharrou <akharrou@student.42.fr>          +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2019/02/22 19:31:05 by akharrou          #+#    #+#             */
/*   Updated: 2019/03/04 13:17:20 by akharrou         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

/*
**    NAME
**         list_popleft -- removes the first element of a list and returns
**                         the item it contains.
**
**    SYNOPSIS
**         #include <../libft.h>
**
**         void *
**         list_popleft(t_list **head);
**
**    PARAMETERS
**
**         t_list **head          Pointer to a pointer to the first
**                                element of a list.
**
**    DESCRIPTION
**         Removes and frees the first element of the list, that (*head)
**         points to, updates (*head) to point to the new first element of
**         the list and returns the item that the first element contained.
**
**         If the list had a single element, (*head), after popping the
**         first element, will be made to point to NULL.
**
**    RETURN VALUES
**         If successful returns the item from the popped element of the
**         list; otherwise NULL.
*/

#include "../Includes/stdlib_42.h"
#include "../Includes/list.h"

void		*list_popleft(t_list **head)
{
	void	*item;
	t_list	*tmp;

	if (head && (*head))
	{
		item = (*head)->item;
		tmp = (*head);
		(*head) = (*head)->next;
		free(tmp);
		return (item);
	}
	return (NULL);
}


Today at the lesson Vitya learned a very interesting function — mex. Mex of a sequence of numbers is the minimum non-negative number that is not present in the sequence as element. For example, mex([4, 33, 0, 1, 1, 5]) = 2 and mex([1, 2, 3]) = 0.

Vitya quickly understood all tasks of the teacher, but can you do the same?

You are given an array consisting of n non-negative integers, and m queries. Each query is characterized by one number x and consists of the following consecutive steps:

- Perform the bitwise addition operation modulo 2 (xor) of each array element with the number x.
- Find mex of the resulting array.

Note that after each query the array changes.


You are given an integer $$$n$$$ and three strings $$$a, b, c$$$, each consisting of $$$n$$$ lowercase Latin letters.

Let a template be a string $$$t$$$ consisting of $$$n$$$ lowercase and/or uppercase Latin letters. The string $$$s$$$ matches the template $$$t$$$ if the following conditions hold for all $$$i$$$ from $$$1$$$ to $$$n$$$:

- if the $$$i$$$-th letter of the template is lowercase, then $$$s_i$$$ must be the same as $$$t_i$$$;
- if the $$$i$$$-th letter of the template is uppercase, then $$$s_i$$$ must be different from the lowercase version of $$$t_i$$$. For example, if there is a letter 'A' in the template, you cannot use the letter 'a' in the corresponding position of the string.

Accordingly, the string doesn't match the template if the condition doesn't hold for at least one $$$i$$$.

Determine whether there exists a template $$$t$$$ such that the strings $$$a$$$ and $$$b$$$ match it, while the string $$$c$$$ does not.


1) What are the different applications of Data Structure?
2) What are the limitations of Linear Array?
3) Difference between:
a) Field, Record and File.
b) Merging and Contatenation.
c) Linear Search and Binary Search.
d) Linear and Non Linear Array.
e) Record and Array.
f) Program and Algorithm.
4) Define Asymptotic Notation.
5) Different types of data Structure.
6) How to represent the 3d array in Memory?
b) Jagged Array
c) Pointer Array
8. prepare the Algorithm to merge two Arrays.
9. Suppose Array X(1:3,4:18,6:20) is given with Base Address 200 and 2 word per memory. Find:
a) The length of Array X.
b) Effective Indices.
c) Location/Address of X(2,9,15) with Row Major and Coloum Major Order.


This is an interactive problem. This problem doesn't support hacks.

Sphinx's duty is to guard the city of Thebes by making sure that no unworthy traveler crosses its gates. Only the ones who answer her riddle timely and correctly (or get an acc for short) are allowed to pass. As of those who fail, no one heard of them ever again...

So you don't have a choice but to solve the riddle. Sphinx has an array $$$a_1, a_2, \ldots, a_n$$$ of nonnegative integers strictly smaller than $$$2^b$$$ and asked you to find the maximum value among its elements. Of course, she will not show you the array, but she will give you $$$n$$$ and $$$b$$$. As it is impossible to answer this riddle blindly, you can ask her some questions. For given $$$i, y$$$, she'll answer you whether $$$a_i$$$ is bigger than $$$y$$$. As sphinxes are not very patient, you can ask at most $$$3 \cdot (n + b) $$$ such questions.

Although cunning, sphinxes are honest. Even though the array can change between your queries, answers to the previously asked questions will remain valid.


Remember these? Well, you probably don’t remember all of them. Because I only just now added a bunch to the page, doubling the number of comics posted. Huge thanks to Saurus for providing the site with self-aware, self-satirizing comic relief! Anyway, that is all for now. But DotQ is on the upswing, and there will be more—of something—soon.


- Organized & all about details, details, details - Direct & clear communicator - Deadline oriented - Self starter- 360 hustle - think of ideas and work to implement them- Empathy- Adaptability/ comfortable interacting with different personalities
This innovation leader will help to guide the organization to develop, cultivate and pursue the most promising and disruptive transformation ideas, and will enhance our ability to test, learn and scale them. (For example, how can we grow our events, how can we reach more cities, how can we create amazing experiences using a small budget. . .how can we "fail fast")
Responsibilities- Create growth strategy for expanding the NAABW user network- Implement revenue driving programs (i.e. what should we sell, what should we do more of? )- Design and implement a digital online community for 3 major cities- Identify who our followers are, what they need in their lives, and how we can create additional products to meet those needs; operationalize new products (i.e. you decide we should start selling widgets, and they you work to design and launch and online widget store)- Align expansion with branding and messaging events & experiences
Additional Requirements (please read carefully!):
- Must create and SOLEY USE NAABW email account for external communications - Must create and SOLEY USE NAABW Slack account for internal communications - Must be plugged into team communications, responsive, and deadline oriented - Must dedicate 4 - 8 hours monthly (on average)- Must be be a part of one team conference call per month- Attention to detail - GOTTA BE A HUSTLER!!! This is a fast paced role, designed to help us grow from small bay area non-profit to larger national brand- In order to take NAABW to the next level, we need team members that are completely dedicated to serving our mission, and our community .If you're spread too thin, you won't be able to do your best work in this role. . .plus #selfcare.


A permutation of length n is an integer sequence such that each integer from 0 to (n - 1) appears exactly once in it. For example, sequence [0, 2, 1] is a permutation of length 3 while both [0, 2, 2] and [1, 2, 3] are not.

A fixed point of a function is a point that is mapped to itself by the function. A permutation can be regarded as a bijective function. We'll get a definition of a fixed point in a permutation. An integer i is a fixed point of permutation a0, a1, ..., an - 1 if and only if ai = i. For example, permutation [0, 2, 1] has 1 fixed point and permutation [0, 1, 2] has 3 fixed points.

You are given permutation a. You are allowed to swap two elements of the permutation at most once. Your task is to maximize the number of fixed points in the resulting permutation. Note that you are allowed to make at most one swap operation.


//
//  BlobTracker.h
//  kinectTCPServer
//
//  Created by maybites on 14.02.14.
//
//
#pragma once

#include "ofMain.h"
#include "ofxOpenCv.h"
#include "ofVec3f.h"
#include "ofxGuiExtended.h"
#include "ofConstants.h"
#include "Planef.h"
#include "Linef.h"
#include "OrthoCamera.h"

#include "BlobTracker.h"

#include <cmath>

#define N_MAX_BLOBS 20

class BlobFinder {

public:
    void setup(ofxGui &gui);
    void allocate();

    void captureBegin();
    void captureEnd();

    void update();

    void updateSensorBox(int & value);

    void drawSensorBox();
    void drawBodyBlobs2d(ofRectangle _rect);

    void drawBodyBlobsBox();
    void drawBodyBlobsHeadTop();
    void drawHeadBlobs();
    void drawEyeCenters();

    void drawGazePoint();

    vector <BlobTracker> trackedBlobs;

    ofVec2f captureScreenSize;

    ofVec3f kinectPos;

    ///////////////////
    // FBO CAPTURING //
    ///////////////////
    orthoCamera captureCam;

    //ofImage capturedImage;
    ofFbo captureFBO;

    /////////////////
    //COLOR CONTOUR//
    /////////////////

    ofPixels fbopixels;

    ofxCvColorImage colorImg;

    ofxCvGrayscaleImage grayImage; // grayscale depth image
    ofxCvGrayscaleImage grayEyeLevel; // the eyelevel thresholded image
    ofxCvGrayscaleImage grayThreshFar; // the far thresholded image

    ofxCvContourFinder contourFinder;
    ofxCvContourFinder contourEyeFinder;

    bool bThreshWithOpenCV;

    int nearThreshold;
    int farThreshold;

    //////////////
    //PROPERTIES//
    //////////////

    ofxGuiPanel *panel;

    ofParameterGroup sensorBoxGuiGroup;

    ofParameter<int> sensorBoxLeft;
    ofParameter<int> sensorBoxRight;
    ofParameter<int> sensorBoxTop;
    ofParameter<int> sensorBoxBottom;
    ofParameter<int> sensorBoxFront;
    ofParameter<int> sensorBoxBack;
    ofParameter<int> nearFrustum;
    ofParameter<int> farFrustum;

    ofParameterGroup blobGuiGroup;

    ofParameter<int> blobAreaMin;
    ofParameter<int> blobAreaMax;
    ofParameter<int> countBlob;

    ofParameterGroup blobEyeGroup;

    ofParameter<float> eyeLevel;
    ofParameter<float> eyeInset;

    ofParameter<ofVec3f> gazePoint;
    ofSpherePrimitive gazePointer;

    ofParameterGroup blobSmoothGroup;
    ofParameter<int> smoothOffset;
    ofParameter<float> smoothFactor;

    ofVboMesh sensorBox;

    ofVec3f normal;
    float p;

};


We’ve just launched the re-release of 3030 Deathwar!
The game is a 2D Top-Down Space RPG, featuring Open World exploration, boarding stations and derelicts, many diverse NPCs, tons of missions and an exciting plot!
The re-release adds higher resolution, massive balance and gameplay changes, a smoother tutorial and many other improvements!
2014 Version Changes
- Better visuals with increased Resolution
- Redesigned, modernized combat system
- Rebalancing of all ships, upgrades, weapons
- Overhauled and improved tutorial
- Rebalanced Open World Missions
- Improved useability with autosaving and simpler controls
- Tons of fixes and other improvements
You can download and play the game for free at


/*
 * Copyright (c) 2018 SignalWire, Inc
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

#pragma once

/* The method name for a protocol request */
static const char *BLADE_PROTOCOL_METHOD = "blade.protocol";

/* Flags for the command */
#define BLADE_PROTOCOL_FLAGS 0

/* Default time to live for protocol */
#define BLADE_PROTOCOL_TTL_MS	BLADE_DEFAULT_CMD_TTL_MS

static const char *BLADE_PROTOCOL_CMD_PROVIDER_ADD = "provider.add";
static const char *BLADE_PROTOCOL_CMD_PROVIDER_REMOVE = "provider.remove";
static const char *BLADE_PROTOCOL_CMD_PROVIDER_RANK_UPDATE = "provider.rank.update";
static const char *BLADE_PROTOCOL_CMD_CHANNEL_ADD = "channel.add";
static const char *BLADE_PROTOCOL_CMD_CHANNEL_REMOVE = "channel.remove";

typedef struct blade_protocol_rqu_s {
	const char *command;
	const char *protocol;
	ks_json_t *params;
} blade_protocol_rqu_t;

SWCLT_JSON_MARSHAL_BEG(BLADE_PROTOCOL_RQU, blade_protocol_rqu_t)
	SWCLT_JSON_MARSHAL_STRING(command)
	SWCLT_JSON_MARSHAL_STRING(protocol)
	SWCLT_JSON_MARSHAL_ITEM_OPT(params)
SWCLT_JSON_MARSHAL_END()

SWCLT_JSON_DESTROY_BEG(BLADE_PROTOCOL_RQU, blade_protocol_rqu_t)
	SWCLT_JSON_DESTROY_STRING(command)
	SWCLT_JSON_DESTROY_STRING(protocol)
	SWCLT_JSON_DESTROY_ITEM(params)
SWCLT_JSON_DESTROY_END()

SWCLT_JSON_PARSE_BEG(BLADE_PROTOCOL_RQU, blade_protocol_rqu_t)
	SWCLT_JSON_PARSE_STRING(command)
	SWCLT_JSON_PARSE_STRING(protocol)
	SWCLT_JSON_PARSE_ITEM_OPT(params)
SWCLT_JSON_PARSE_END()

/* The params definition for BLADE_PROTOCOL_CMD_PROVIDER_ADD */
typedef struct blade_protocol_provider_add_param_s {
	blade_access_control_t default_method_execute_access;
	blade_access_control_t default_channel_subscribe_access;
	blade_access_control_t default_channel_broadcast_access;
	ks_json_t *methods;
	ks_json_t *channels;
	int rank;
	ks_json_t *data;
} blade_protocol_provider_add_param_t;

SWCLT_JSON_MARSHAL_BEG(BLADE_PROTOCOL_PROVIDER_ADD_PARAM, blade_protocol_provider_add_param_t)
	SWCLT_JSON_MARSHAL_INT(default_method_execute_access)
	SWCLT_JSON_MARSHAL_INT(default_channel_subscribe_access)
	SWCLT_JSON_MARSHAL_INT(default_channel_broadcast_access)
	SWCLT_JSON_MARSHAL_ITEM_OPT(methods)
	SWCLT_JSON_MARSHAL_ITEM_OPT(channels)
	SWCLT_JSON_MARSHAL_INT(rank)
	SWCLT_JSON_MARSHAL_ITEM_OPT(data)
SWCLT_JSON_MARSHAL_END()

SWCLT_JSON_DESTROY_BEG(BLADE_PROTOCOL_PROVIDER_ADD_PARAM, blade_protocol_provider_add_param_t)
	SWCLT_JSON_DESTROY_INT(default_method_execute_access)
	SWCLT_JSON_DESTROY_INT(default_channel_subscribe_access)
	SWCLT_JSON_DESTROY_INT(default_channel_broadcast_access)
	SWCLT_JSON_DESTROY_ITEM(methods)
	SWCLT_JSON_DESTROY_ITEM(channels)
	SWCLT_JSON_DESTROY_INT(rank)
	SWCLT_JSON_DESTROY_ITEM(data)
SWCLT_JSON_DESTROY_END()

SWCLT_JSON_PARSE_BEG(BLADE_PROTOCOL_PROVIDER_ADD_PARAM, blade_protocol_provider_add_param_t)
	SWCLT_JSON_PARSE_INT_OPT_DEF(default_method_execute_access, BLADE_ACL_SYSTEM)
	SWCLT_JSON_PARSE_INT_OPT_DEF(default_channel_subscribe_access, BLADE_ACL_SYSTEM)
	SWCLT_JSON_PARSE_INT_OPT_DEF(default_channel_broadcast_access, BLADE_ACL_SYSTEM)
	SWCLT_JSON_PARSE_ITEM_OPT(methods)
	SWCLT_JSON_PARSE_ITEM_OPT(channels)
	SWCLT_JSON_PARSE_INT_OPT_DEF(rank, 1)
	SWCLT_JSON_PARSE_ITEM_OPT(data)
SWCLT_JSON_PARSE_END()

/* The params definition for BLADE_PROTOCOL_CMD_PROVIDER_ADD */
typedef struct blade_protocol_provider_rank_update_param_s {
	int rank;
} blade_protocol_provider_rank_update_param_t;

SWCLT_JSON_MARSHAL_BEG(BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_PARAM, blade_protocol_provider_rank_update_param_t)
	SWCLT_JSON_MARSHAL_INT(rank)
SWCLT_JSON_MARSHAL_END()

SWCLT_JSON_DESTROY_BEG(BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_PARAM, blade_protocol_provider_rank_update_param_t)
	SWCLT_JSON_DESTROY_INT(rank)
SWCLT_JSON_DESTROY_END()

SWCLT_JSON_PARSE_BEG(BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_PARAM, blade_protocol_provider_rank_update_param_t)
	SWCLT_JSON_PARSE_INT_OPT_DEF(rank, 1)
SWCLT_JSON_PARSE_END()

/**
 * CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC
 * Creates a command which holds and owns the request json for a protocol provider add
 * request, also takes owner of the provider data and channels json passed in
 */
#define CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC(...)	__CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC(__FILE__, __LINE__, __PRETTY_FUNCTION__, __VA_ARGS__)
static inline swclt_cmd_t __CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC(
	const char *file, int line, const char *tag,
	swclt_cmd_cb_t cb,
	void *cb_data,
	const char *protocol,
	blade_access_control_t default_method_execute_access,
	blade_access_control_t default_channel_subscribe_access,
	blade_access_control_t default_channel_broadcast_access,
	ks_json_t **methods,
	ks_json_t **channels,
	int rank,
	ks_json_t **data)
{
	swclt_cmd_t cmd = KS_NULL_HANDLE;
	ks_status_t status;
	ks_json_t *params;
	ks_json_t *request;
	ks_pool_t *pool;

	if (ks_pool_open(&pool))
		return cmd;

	if (!(params = BLADE_PROTOCOL_PROVIDER_ADD_PARAM_MARSHAL(pool,
															 &(blade_protocol_provider_add_param_t){
																 default_method_execute_access,
																 default_channel_subscribe_access,
																 default_channel_broadcast_access,
																 methods ? *methods : NULL,
																 channels ? *channels : NULL,
																 rank,
 																 data ? *data : NULL}))) {
		ks_log(KS_LOG_WARNING, "Failed to allocate protocol request params");

		/* Since provider_data and channels was at the end of the macro declartaion, it will have
		 * not touched it and we will not indicate we've taken ownership of it */
		ks_pool_close(&pool);
		return cmd;
	}

	/* We have taken ownership of the provider_data and channels from here on out */
	if (data) *data = NULL;
	if (channels) *channels = NULL;

	if (!(request = BLADE_PROTOCOL_RQU_MARSHAL(
			pool,
			&(blade_protocol_rqu_t){
				BLADE_PROTOCOL_CMD_PROVIDER_ADD,
				protocol,
				params}))) {
		ks_log(KS_LOG_WARNING, "Failed to allocate protocol request");

		/* Since params is allocated in the same pool, nothing to worry about with ownership */
		ks_json_delete(&params);
		ks_pool_close(&pool);
		return cmd;
	}

	/* Now hand it to the command, it will take ownership of it if successful
	 * and null out our ptr */
	if ((status = swclt_cmd_create_ex(
			&cmd,
			&pool,
			cb,
			cb_data,
			BLADE_PROTOCOL_METHOD,
			&request,
			BLADE_PROTOCOL_TTL_MS,
			BLADE_PROTOCOL_FLAGS,
			ks_uuid_null()))) {
		ks_log(KS_LOG_WARNING, "Failed to allocate protocol cmd: %lu", status);

		/* Safe to free this or at least attempt to, cmd will have set it to null if it
		 * took ownership of it */
		ks_json_delete(&request);
		ks_pool_close(&pool);
		return cmd;
	}

	/* Phew, successfully allocated the command */
	return cmd;
}

static inline swclt_cmd_t CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD(
	const char *protocol,
	blade_access_control_t default_method_execute_access,
	blade_access_control_t default_channel_subscribe_access,
	blade_access_control_t default_channel_broadcast_access,
	ks_json_t **methods,
 	ks_json_t **channels,
	int rank,
	ks_json_t **data)
{
	return CREATE_BLADE_PROTOCOL_PROVIDER_ADD_CMD_ASYNC(
		NULL,
		NULL,
		protocol,
		default_method_execute_access,
		default_channel_subscribe_access,
		default_channel_broadcast_access,
		methods,
		channels,
		rank,
		data);
}

/**
 * CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC
 * Creates a command which holds and owns the request json for a protocol provider add
 * request, also takes owner of the provider data and channels json passed in
 */
#define CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC(...)	__CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC(__FILE__, __LINE__, __PRETTY_FUNCTION__, __VA_ARGS__)
static inline swclt_cmd_t __CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC(
	const char *file, int line, const char *tag,
	swclt_cmd_cb_t cb,
	void *cb_data,
	const char *protocol)
{
	swclt_cmd_t cmd = KS_NULL_HANDLE;
	ks_status_t status;
	ks_json_t *request;
	ks_pool_t *pool;

	if (ks_pool_open(&pool))
		return cmd;

	if (!(request = BLADE_PROTOCOL_RQU_MARSHAL(
			pool,
			&(blade_protocol_rqu_t){
				BLADE_PROTOCOL_CMD_PROVIDER_REMOVE,
				protocol,
				NULL}))) {
		ks_log(KS_LOG_WARNING, "Failed to allocate protocol request");

		/* Since params is allocated in the same pool, nothing to worry about with ownership */
		ks_pool_close(&pool);
		return cmd;
	}

	/* Now hand it to the command, it will take ownership of it if successful
	 * and null out our ptr */
	if ((status = swclt_cmd_create_ex(
			&cmd,
			&pool,
			cb,
			cb_data,
			BLADE_PROTOCOL_METHOD,
			&request,
			BLADE_PROTOCOL_TTL_MS,
			BLADE_PROTOCOL_FLAGS,
			ks_uuid_null()))) {
		ks_log(KS_LOG_WARNING, "Failed to allocate protocol cmd: %lu", status);

		/* Safe to free this or at least attempt to, cmd will have set it to null if it
		 * took ownership of it */
		ks_json_delete(&request);
		ks_pool_close(&pool);
		return cmd;
	}

	/* Phew, successfully allocated the command */
	return cmd;
}

static inline swclt_cmd_t CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD(const char *protocol)
{
	return CREATE_BLADE_PROTOCOL_PROVIDER_REMOVE_CMD_ASYNC(
		NULL,
		NULL,
		protocol);
}

/**
 * CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC
 * Creates a command which holds and owns the request json for a protocol provider rank update request
 */
#define CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC(...)	__CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC(__FILE__, __LINE__, __PRETTY_FUNCTION__, __VA_ARGS__)
static inline swclt_cmd_t __CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC(
	const char *file, int line, const char *tag,
	swclt_cmd_cb_t cb,
	void *cb_data,
	const char *protocol,
	int rank)
{
	swclt_cmd_t cmd = KS_NULL_HANDLE;
	ks_status_t status;
	ks_json_t *params;
	ks_json_t *request;
	ks_pool_t *pool;

	if (ks_pool_open(&pool))
		return cmd;

	if (!(params = BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_PARAM_MARSHAL(pool, &(blade_protocol_provider_rank_update_param_t){ rank }))) {
		ks_log(KS_LOG_WARNING, "Failed to allocate protocol request params");

		/* Since provider_data and channels was at the end of the macro declartaion, it will have
		 * not touched it and we will not indicate we've taken ownership of it */
		ks_pool_close(&pool);
		return cmd;
	}

	/* We have taken ownership of the provider_data and channels from here on out */
	if (!(request = BLADE_PROTOCOL_RQU_MARSHAL(
			pool,
			&(blade_protocol_rqu_t){
				BLADE_PROTOCOL_CMD_PROVIDER_RANK_UPDATE,
				protocol,
				params}))) {
		ks_log(KS_LOG_WARNING, "Failed to allocate protocol request");

		/* Since params is allocated in the same pool, nothing to worry about with ownership */
		ks_json_delete(&params);
		ks_pool_close(&pool);
		return cmd;
	}

	/* Now hand it to the command, it will take ownership of it if successful
	 * and null out our ptr */
	if ((status = swclt_cmd_create_ex(
			&cmd,
			&pool,
			cb,
			cb_data,
			BLADE_PROTOCOL_METHOD,
			&request,
			BLADE_PROTOCOL_TTL_MS,
			BLADE_PROTOCOL_FLAGS,
			ks_uuid_null()))) {
		ks_log(KS_LOG_WARNING, "Failed to allocate protocol cmd: %lu", status);

		/* Safe to free this or at least attempt to, cmd will have set it to null if it
		 * took ownership of it */
		ks_json_delete(&request);
		ks_pool_close(&pool);
		return cmd;
	}

	/* Phew, successfully allocated the command */
	return cmd;
}

static inline swclt_cmd_t CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD(
	const char *protocol,
	int rank)
{
	return CREATE_BLADE_PROTOCOL_PROVIDER_RANK_UPDATE_CMD_ASYNC(
		NULL,
		NULL,
		protocol,
		rank);
}


You are given three integers $$$n$$$, $$$k$$$ and $$$f$$$.

Consider all binary strings (i. e. all strings consisting of characters $$$0$$$ and/or $$$1$$$) of length from $$$1$$$ to $$$n$$$. For every such string $$$s$$$, you need to choose an integer $$$c_s$$$ from $$$0$$$ to $$$k$$$.

A multiset of binary strings of length exactly $$$n$$$ is considered beautiful if for every binary string $$$s$$$ with length from $$$1$$$ to $$$n$$$, the number of strings in the multiset such that $$$s$$$ is their prefix is not exceeding $$$c_s$$$.

For example, let $$$n = 2$$$, $$$c_{0} = 3$$$, $$$c_{00} = 1$$$, $$$c_{01} = 2$$$, $$$c_{1} = 1$$$, $$$c_{10} = 2$$$, and $$$c_{11} = 3$$$. The multiset of strings $$$\{11, 01, 00, 01\}$$$ is beautiful, since:

- for the string $$$0$$$, there are $$$3$$$ strings in the multiset such that $$$0$$$ is their prefix, and $$$3 \le c_0$$$;
- for the string $$$00$$$, there is one string in the multiset such that $$$00$$$ is its prefix, and $$$1 \le c_{00}$$$;
- for the string $$$01$$$, there are $$$2$$$ strings in the multiset such that $$$01$$$ is their prefix, and $$$2 \le c_{01}$$$;
- for the string $$$1$$$, there is one string in the multiset such that $$$1$$$ is its prefix, and $$$1 \le c_1$$$;
- for the string $$$10$$$, there are $$$0$$$ strings in the multiset such that $$$10$$$ is their prefix, and $$$0 \le c_{10}$$$;
- for the string $$$11$$$, there is one string in the multiset such that $$$11$$$ is its prefix, and $$$1 \le c_{11}$$$.

Now, for the problem itself. You have to calculate the number of ways to choose the integer $$$c_s$$$ for every binary string $$$s$$$ of length from $$$1$$$ to $$$n$$$ in such a way that the maximum possible size of a beautiful multiset is exactly $$$f$$$.


A colored stripe is represented by a horizontal row of n square cells, each cell is pained one of k colors. Your task is to repaint the minimum number of cells so that no two neighbouring cells are of the same color. You can use any color from 1 to k to repaint the cells.


I decreased logical volume
lv_postgres size for a 5G. then redistributed free space to other lv
lv_home, but didn't do resize2fs for the decreased volume
lv_postgres'. At the next boot i fall into emergence mode and
resize2fs lv_postgres dont't do the task saying "Please run
e2fsck -f" and the last one say "Either the superblock or pt is likely to be corrupt" if i continue then on pass 5 get "error reading block while reading inode and block bitmaps"
the fs size according to superblock is 2564096 blocks
the physical size of device is 1253376 blocks
i want to reduce volume from 9.78G to 4.78G to match required size
Which is a right way to correct size for volume?


I am modifying a design and have done the following per the instructions.
Each of these is a folder.
In the index folder I put a file called styles.post.tpl
inside the styles.post.tpl it shows
I then created a css file called styles.css in the following folder
So the styles.post.tpl is in the index folder and styles.css is in the my_changes folder.
I tried so any combinations of placing files in folders but just can't seem to make the change happen. All I want to do is be able to update the CSS from another stylesheet so when the time comes to upgrade the site doesn't get affected.
Any ideas? Advice? Anything


Vanya and his friend Vova play a computer game where they need to destroy n monsters to pass a level. Vanya's character performs attack with frequency x hits per second and Vova's character performs attack with frequency y hits per second. Each character spends fixed time to raise a weapon and then he hits (the time to raise the weapon is 1 / x seconds for the first character and 1 / y seconds for the second one). The i-th monster dies after he receives ai hits.

Vanya and Vova wonder who makes the last hit on each monster. If Vanya and Vova make the last hit at the same time, we assume that both of them have made the last hit.


If necessary you can run an SQL command in Rock Gym Pro. However, running the wrong SQL command can destroy your Rock Gym Pro database. DO NOT RUN a SQL command unless you know exactly what you are doing or have received the SQL command directly from the Rock Gym Pro developer.
- In the Data Entry main window click Manage, select Maintenance and then select Execute SQL Command.
- Enter the command and click Run SQL Command.
- Click Close to exit.


Polycarpus plays with red and blue marbles. He put n marbles from the left to the right in a row. As it turned out, the marbles form a zebroid.

A non-empty sequence of red and blue marbles is a zebroid, if the colors of the marbles in this sequence alternate. For example, sequences (red; blue; red) and (blue) are zebroids and sequence (red; red) is not a zebroid.

Now Polycarpus wonders, how many ways there are to pick a zebroid subsequence from this sequence. Help him solve the problem, find the number of ways modulo 1000000007 (109 + 7).


What did JoeW eat for breakfast?
Okay, more serious question, do we have any information anywhere about the materials the Voxola radio is made of? I'm going to build a replica (yes, -Variant , I haven't forgotten!) and I'm trying to get as much to work with, as possible
(Edit: how the heck do I turn a member name into a link so they can see it?)


To those familiar with the syntax...
Could you please help me in setting up an expression for the function preg_match_all which is parsing a file named "file.txt":
Every line from that file has to be in different <TR> of a table.
There are 7 couples of words on each line of the file which are all seperated by a TAB space. Every one of these couples of words has to be located on a separate <TD> of that <TR>
what should the expression be in order to have such an effect..?


You are given $$$n$$$ arrays $$$a_1$$$, $$$\ldots$$$, $$$a_n$$$. The length of each array is two. Thus, $$$a_i = [a_{i, 1}, a_{i, 2}]$$$. You need to concatenate the arrays into a single array of length $$$2n$$$ such that the number of inversions$$$^{\dagger}$$$ in the resulting array is minimized. Note that you do not need to count the actual number of inversions.

More formally, you need to choose a permutation$$$^{\ddagger}$$$ $$$p$$$ of length $$$n$$$, so that the array $$$b = [a_{p_1,1}, a_{p_1,2}, a_{p_2, 1}, a_{p_2, 2}, \ldots, a_{p_n,1}, a_{p_n,2}]$$$ contains as few inversions as possible.

$$$^{\dagger}$$$The number of inversions in an array $$$c$$$ is the number of pairs of indices $$$i$$$ and $$$j$$$ such that $$$i < j$$$ and $$$c_i > c_j$$$.

$$$^{\ddagger}$$$A permutation of length $$$n$$$ is an array consisting of $$$n$$$ distinct integers from $$$1$$$ to $$$n$$$ in arbitrary order. For example, $$$[2,3,1,5,4]$$$ is a permutation, but $$$[1,2,2]$$$ is not a permutation ($$$2$$$ appears twice in the array), and $$$[1,3,4]$$$ is also not a permutation ($$$n=3$$$ but there is $$$4$$$ in the array).


A new entertainment has appeared in Buryatia — a mathematical circus! The magician shows two numbers to the audience — $$$n$$$ and $$$k$$$, where $$$n$$$ is even. Next, he takes all the integers from $$$1$$$ to $$$n$$$, and splits them all into pairs $$$(a, b)$$$ (each integer must be in exactly one pair) so that for each pair the integer $$$(a + k) \cdot b$$$ is divisible by $$$4$$$ (note that the order of the numbers in the pair matters), or reports that, unfortunately for viewers, such a split is impossible.

Burenka really likes such performances, so she asked her friend Tonya to be a magician, and also gave him the numbers $$$n$$$ and $$$k$$$.

Tonya is a wolf, and as you know, wolves do not perform in the circus, even in a mathematical one. Therefore, he asks you to help him. Let him know if a suitable splitting into pairs is possible, and if possible, then tell it.


/*
 * mmt_lib.h
 *
 *  Created on: Oct 14, 2016
 *  Created by: Huu Nghia NGUYEN <huunghia.nguyen@montimage.com>
 */

#ifndef SRC_LIB_MMT_LIB_H_
#define SRC_LIB_MMT_LIB_H_

#include "base.h"
#include "linked_list.h"
#include "mmt_log.h"
#include "mmt_alloc.h"
#include "mmt_dbl_linked_list.h"
#include "mmt_map_t.h"
#include "mmt_array_t.h"
#include "mmt_utils.h"
#include "system_info.h"
#include "mmt_hash64.h"
#include "mmt_hash.h"
#include "mmt_bit.h"
#endif /* SRC_LIB_MMT_LIB_H_ */


2017 - ACM Fellow For contributions to die-stacking technologies in computer architecture
2014 - ACM Distinguished Member
2009 - ACM Senior Member
His primary scientific interests are in Embedded system, Parallel computing, Cache, Dram and Static random-access memory. His research in the fields of Microarchitecture and Routing overlaps with other disciplines such as Stacking. His study in Parallel computing is interdisciplinary in nature, drawing from both Computer architecture, System on a chip, Central processing unit and Translation lookaside buffer.
His study involves Pipeline burst cache and Cache algorithms, a branch of Cache. Gabriel H. Loh combines subjects such as Random access memory, Memory controller, Flat memory model, Memory management and Multi-core processor with his study of Dram. Within one scientific family, Gabriel H. Loh focuses on topics pertaining to Universal memory under Static random-access memory, and may sometimes address concerns connected to Memory rank.
His primary areas of investigation include Parallel computing, Computer hardware, Cache, Embedded system and Interleaved memory. His work in Parallel computing tackles topics such as Scalability which are related to areas like Interconnection. His work deals with themes such as Dram, Multi-core processor and Static random-access memory, which intersect with Embedded system.
His studies deal with areas such as Random access memory and CAS latency as well as Dram. His Interleaved memory study incorporates themes from Registered memory, Extended memory, Memory map and Uniform memory access. His study focuses on the intersection of Cache coloring and fields such as Page cache with connections in the field of Cache-oblivious algorithm.
His primary scientific interests are in Cache, Parallel computing, Operating system, Page table and Computer network. His research on Cache focuses in particular on CPU cache. His study ties his expertise on General-purpose computing on graphics processing units together with the subject of Parallel computing.
His Scheduling study deals with Quality of service intersecting with Embedded system. His study in the fields of Field-programmable gate array under the domain of Embedded system overlaps with other disciplines such as Design process. In his research, Dram is intimately related to Electrical engineering, which falls under the overarching field of Memory bandwidth.
Gabriel H. Loh focuses on Memory management, Parallel computing, Memory bandwidth, Interleaved memory and Page table. His Memory management study combines topics in areas such as Dram, Non-volatile memory, Multi-core processor and Virtualization. His research in Dram intersects with topics in Supercomputer, Random access memory, Shared memory, Embedded system and Computer network.
His Speedup study, which is part of a larger body of work in Parallel computing, is frequently linked to Interrupt, bridging the gap between disciplines. His research investigates the link between Interleaved memory and topics such as Distributed shared memory that cross with problems in Memory map and Computer architecture. His biological study spans a wide range of topics, including Bottleneck, Virtual address space, Scheduling and SIMD.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
3D-Stacked Memory Architectures for Multi-core Processors
Gabriel H. Loh.
international symposium on computer architecture (2008)
Die Stacking (3D) Microarchitecture
Bryan Black;Murali Annavaram;Ned Brekelbaum;John DeVale.
international symposium on microarchitecture (2006)
Design space exploration for 3D architectures
Yuan Xie;Gabriel H. Loh;Bryan Black;Kerry Bernstein.
ACM Journal on Emerging Technologies in Computing Systems (2006)
Use ECP, not ECC, for hard failures in resistive memories
Stuart Schechter;Gabriel H. Loh;Karin Strauss;Doug Burger.
international symposium on computer architecture (2010)
Processor Design in 3D Die-Stacking Technologies
Gabriel H. Loh;Yuan Xie;Bryan Black.
IEEE Micro (2007)
PIPP: promotion/insertion pseudo-partitioning of multi-core shared caches
Yuejian Xie;Gabriel H. Loh.
international symposium on computer architecture (2009)
Staged memory scheduling: achieving high performance and scalability in heterogeneous systems
Rachata Ausavarungnirun;Kevin Kai-Wei Chang;Lavanya Subramanian;Gabriel H. Loh.
international symposium on computer architecture (2012)
Efficiently enabling conventional block sizes for very large die-stacked DRAM caches
Gabriel H. Loh;Mark D. Hill.
international symposium on microarchitecture (2011)
Thermal analysis of a 3D die-stacked high-performance microprocessor
Kiran Puttaswamy;Gabriel H. Loh.
great lakes symposium on vlsi (2006)
3D-MAPS: 3D Massively parallel processor with stacked memory
Dae Hyun Kim;Krit Athikulwongse;Michael Healy;Mohammad Hossain.
international solid-state circuits conference (2012)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:


/*************************************************************************
    > File Name: remove-duplicates-from-sorted-list.c
# File Name:    remove-duplicates-from-sorted-list.c
# Author:       mist-river
# https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list/
# Created Time: 2021年04月16日 星期五 21时01分49秒
 ************************************************************************/
#include <stdio.h>
#include <stdlib.h>

struct ListNode {
  int val;
  struct ListNode *next;
};

struct ListNode* deleteDuplicates(struct ListNode* head){
    if (head == NULL) {
        return head;
    }
    struct ListNode *temp;
    temp = head;
    while (temp->next != NULL) {
        if (temp->val == temp->next->val) {
            temp->next = temp->next->next;
        } else {
            temp = temp->next;
        }
    }
    return head;
}

int main() {
    int i;
    //初始化链表
    struct ListNode * head, * temp;
    head = (struct ListNode *)malloc(sizeof(struct ListNode));
    temp = head;
    for (i=1; i<8; i++) {
        struct ListNode *n = (struct ListNode *)malloc(sizeof(struct ListNode));
        n->val = i/2 + 1;
        n->next = NULL;
        temp->next = n;
        temp = temp->next;
    }
    head = deleteDuplicates(head->next);
    //遍历链表
    temp = head;
    while (temp != NULL) {
        printf("%d\n", temp->val);
        temp = temp->next;
    }
}


...controller at the top. Author: Christopher Veltri Title: Suburban Legend Back of Book Copy: A deadly book, a vicious videogame, and a quiet suburban town. When bookish Ralph Marker moves back to Wilhelmina to live with his father, a dark videogame finds its way into his hands. As Ralph’s obsession grows, deadly creatures begin stirring in the quiet town
Hi, I have a very old DOS program that is used to work with a old marker/printing machine. The problem checks for a PARALLEL port dongle on start as a security measurement. The program is over 20 years old, so no support, no vendor, nothing. I would like to know if it is possible to decompile the program, find the routine that checks for the dongle
Hi, I'm in the housing developer company and having an apartment project which need total 5 pcs of hand drawn marker pen/ water color illustration on the exterior of the building as well as some interiors of the apartment. Please see the attached file and contact me if this is something you are good with. Thanks!
Hi, we are using Elementor Pro CreaMaps CodeCanyone Plugin Ultimate Addons PowerPack Addons We must Link a Google Maps Marker to a Elementor Section via Modal or Popup, the content is already in place we just need to make the Custom Code to make it work. Further instructions on PM, please must start now and finish with the next 4-6 hrs. Thank you
Hello. There is Augmented Reality app created for us. Its for a business card. When app is installed the user can open it, scan the businesscard, marker then is recognised and it triggers the video presentation of the owner of the businesscard. It was made in Unity. The app for android works already. Now we need to compile the build for IPHONE.
name is All American we are a patriotic Company We are a commercial builder We do repair, construction. i like the use of my up loaded pic i like the use of construction, roofs, building i like the use of red,white and blue
I am making an app for finding places with GoogleMaps, what i need is a markerClickerOnListener that shows the ...is a markerClickerOnListener that shows the detailed information of that place. Stuff like: Phone Number, website, images and rating. what i want is that when i click on a marker, opens a new activity just like the on the image i've sent.
...publishing company based in Scotland. Our business aim is to create quality learning materials in minority languages, many of which do not currently exist in English. Our social mission is to help preserve and expand the usage of minority languages. We are looking for freelancers who can help us expand our portfolio. We ideally want to develop long-term
...us build a POC app within a month or two. The app may utilize geolocation and we I would like to add that either ARCore or ARKit would work for us. The AR may use of both- Markerless and Marker based AR. You are more than welcome to suggest any other possible technologies-APIs. We already have the clickable, prototype designed in an Adobe XD document
I have a login system done (design, database, php code) all done but I dont know why it is not working needed a fix
Blog Website with content in a flipbook style The book marker ‘menu’ should take the user to the Chapter Page The Chapter page gives the user an option to select a chapter to read, or to page forward to read. This style [kirjaudu nähdäksesi URL:n] When the user selects one chapter they go to a double page on the PC and Ipad The page
...community of people that want to use social media and landing pages as a recruiting tool instead of the old school cold calling and hotel meetings. This book is to set the tone, expectation and rough outline of how to be a more modern network marketer. The premise of the book is to teach network marketers how to use social media to recruit people for their
...demo application. Without going into much details now, this is what I need: 1. A page showing a Google map with some markers on it. Input: a json string holding marker coordinates and marker info. Output: a map showing these markers with info. The map is interactive in the usual way. 2. A page showing a Google maps Place autocomplete search field with
Need new letterhead for a new company " National Verification Services" black ink is fine. Want the letterhead to be different. Use your imagination. The attachment is from a tax verification business i used to own.
I simply need a search engine. I will give more details after bidding.
...script to play video fullscreen based on the vuforia core samples 7.5 image targets. Based on the vuforia 7.5 core samples, there's an image target named fissure 1. I need the marker to play a fullscreen video streamed from a web server when the user click on the play button 2. It needs to work on both ios and android 3. Development needs to be on the latest
We are looking for experience in creating wordpress plugins (since we use plugins). We need something like skin for the plugin. We need good people with PROFESSIONAL The product is intended for a bank so it must be formal but at the same time user "friendly"
I need 10 Seo I wou...say that the grade received is unfair and doesn't represent what has been provided to other students. There is clearly a lack of effort and focus in the process and that the marker just lazily skimmed through the project and hasn't put sufficient effort into it Articles. Topics will be related to health, fitness, wellness etc.
I need a logo designed. i need it to complete it as faster as possible with in time limit . dont bit if you cannot complete it dont wast the time of us
my brand name is "Gline",could you please help to design one logo for me?We are focus on doing self adhesive stickers for h...design one logo for me?We are focus on doing self adhesive stickers for home decor line,I'd like my brand logo with unique shape and my brand name together. Pls don't use free logo marker,i've checked several of them. Thanks.
I need to develop an app for Android and Ios to view a 360 video through the recognition of a Marker (Image Target Vuforia). This project must work on Unity3d 2017 and Vuforia
...which we can render simple AR gaming experience. • We will require a web page , upon opening of same we would ask to get user's camera access. Once we get that we will need Marker less AR experience. • AR experience side - we will require a 3D model where Coins are pouring from clouds and with camera movement user can have gamification by collecting
should give a pop up whenever the website is opened, also website is dynamic in nature
I need e-comerce website (advertisments) where people will be able to pay a fixed amount of ...their advertisments after the payment will be confirmed. Also there will be a need to work with maps api (here maps)...where each of registered users will be able to put a marker on the map for everyone else to see! Also, SQL injection is a real threat...
...entry with more than 20 fields. Data needs to be stored in back-end. One of the data point contains address. 2. On a screen with Google Maps embedded, it should plot the pin/marker based on the information given in point 1 above. 3. With say a 'trace' mode on, the screen should highlight the pin/markers in the specified radius (e.g. 1 Km). 4. The points
financial analysis using Excel and discussion, needs someone with finance knowledge Finance project $20, need in 4 hours, dont bid if you cant do in $20
financial analysis using Excel and discussion, needs someone with finance knowledge Finance project $20, need in 5 hours, dont bid if you cant do in $20
I need to review the installation and correct the database, I need my site to work
...con markers y detecte cuando el usuario haga clic en un marker, y me devuelva a una url pasando por json el id del marker donde el usuario hizo clic ademas en un panel de la izq, vaya armando visualmente al usuario, todos los puntos donde hizo clic, con el nombre y el monto de cada marker clickeado Visualmente la pantalla deberá tener 2 paneles
Book Front / Back cover for a novel. Illustration / graphic like the attached. Same colors. Same Font (Marker Felt) Silhouette. 2 young women facing each other in profile. Woman on L. has short Afro, polo type shirt, jeans. Can only see the outline of the clothes, facial features are similar to image Facial profile somewhat but not exactly similar
We are looking for someone who can illustrate similar to below: [kirjaudu nähdäksesi URL:n] [kirjaudu nähdäksesi URL:n] If you have the skills to do similar
I need to calculate the distance with google distance matri...places autocomplete with 2 inputs: COLLECTION and DESTINATION (THIS WORKS right now) -> send values to another page -> At the top: show a google map with the distances (marker, route) show the distance value in km at a certain position. ONLY FOR FREELANCER WITH GOOGLE API EXPERIENCE.
I have a black chalkboard wall, and I’d like to have someone decorate it with white chalk/marker for the holidays. Calligraphy, subway art/text, with graphics. Example - Christmas song lyrics, Christmas tree, poinsettia, wreaths, etc.
Just need some help wrapping up a project with a few remaining issues. 1. Cannot seem ...seem to be the map markers to bounce on click 2. Need user message for any Google Maps API failures as images not being available or API key is bad 3. When i click the map marker and close and reopen the same one the state is not returning to be able to re open it
dont bid if you cant work through team viewer and don't waste my time . things to do reduce width of ag-grid and align data in ag-grid cell by applying unique css classes so it wont bother other grid and last one is caret alignment . if you are are scss pro we can complete in 2-3 hours .
...select a virtual model and give returns (automatically or accelerometer), and in the case of AR could change their orientation with respect to translation or coordinate system marker). 3. Navigation (to move the camera to the virtual environment) 4. Ability to modify the virtual lighting and material properties assigned to objects. Additional information:
...uploaded to Firebase Storage -> Current location coordinates get tracked -> Url of recording and coordinates get pushed to the Firebase Realtime DB. User pushes on location marker -> Audio recording get's pulled from the Firebase Storage and played. Following Cocoapods are currently installed: Firebase (all Package incl. Storage),Mapbox-iOS SDK. Coded
Hello There I dont recieve emails, can only send.. Servertype: Ubuntu 18 Hosted: At linode and dns at linode also Looking for someone expirence in iredadmin, too check dns and iredadmin log for mistake and make the server work.
i am looking for an android native developer who can add a feature in my current application 1) add coordinates (lat,long) on camera Like Augmented Reality ( everything i...on camera Like Augmented Reality ( everything is ready you just have to read the code and call the api on for lat and longs and show locations make a click listner for every marker
I need help with formatting my upcoming novel (fiction) to Kindle and Createspace (Amazon), help with publishing and promote on Amazon/social media. Please bid only if you have relevant experience. Best Regards Sri
...their camera on their phone or computer to play the content. (not via an app). Additionally, I'd like to not have to use a QR code. IF this works well, I'd like to build a backend to this so we could upload our own markers and content to use in the future as we need. my ultimate plan will be to add on to this so we can upload other markers to be scanned
wix blog you have to kano very well wix,
...a mobile app with a page having a leaflet map and markers ontop of it. Clicking in any marker should popup react native popup message having the marker name. Something like in this example ([kirjaudu nähdäksesi URL:n]) but I want to use this custom ESRI ArcGIS basemap instead ([kirjaudu nähdäksesi URL:n]
...Display POI markers in the map - Search bar to search for POI code with storing POI data offline to view markers/search when their is no internet - Click in POI search result or marker in the map to view 'Direction' button to open direction in other existing map applications (Google Map, osmand etc.) that is in addition to a backend for the following: -
For use on a Joomla 3 website i want an implementation of this library as tooltip system. [kirjaudu nähdäksesi URL:n] The tooltip is primarily used to display a piece of text. But the text comes from the database and may contain html with class names for presentation. On devices with a mouse the tooltip should appear on hover. On devices


Background: Diagnosing epileptic seizures using electroencephalogram (EEG) in combination with deep learning computational methods has received much attention in recent years. However, to date, deep learning techniques in seizure detection have not been effectively harnessed due to sub-optimal classifier design and improper representation of the time-domain signal. Methods: In this study, we focused on designing and evaluating deep convolutional neural network-based classifiers for seizure detection. Signal-to-image conversion methods are proposed to convert time-domain EEG signal to a time-frequency represented image to prepare the input data for classification. We proposed and evaluated three classification methods comprising of five classifiers to determine which is more accurate for seizure detection. Accuracy data were then compared to previous studies of the same dataset. Results: We found our proposed model and signal-to-image conversion method outperformed all previous studies in the most cases. The proposed FT-VGG16 classifier achieved the highest average classification accuracy of 99.21%. In addition, the Shapley Additive exPlanations (SHAP) analysis approach was employed to uncover the feature frequencies in the EEG that contribute most to improved classification accuracy. To the best of our knowledge, this is the first study to compute the contribution of frequency components to target seizure classification; thus allowing the identification of distinct seizure-related EEG frequency components compared to normal EEG measures. Conclusions: Thus our developed deep convolutional neural network models are useful to detect seizures and characteristic frequencies using EEG data collected from the patients and this model could be clinically applicable for the automated seizures detection.
A deep convolutional neural network method to detect seizures and characteristic frequencies using epileptic electroencephalogram (EEG) data https://www.embs.org/jtehm/wp-content/themes/movedo/images/empty/thumbnail.jpg 150 150 IEEE Journal of Translational Engineering in Health and Medicine (JTEHM) //www.embs.org/jtehm/wp-content/uploads/sites/17/2022/06/ieee-jtehm-logo2x.png


You are given an array $$$a$$$ of $$$n$$$ positive integers. Determine if, by rearranging the elements, you can make the array strictly increasing. In other words, determine if it is possible to rearrange the elements such that $$$a_1 < a_2 < \dots < a_n$$$ holds.


After changing release artist (http://musicbrainz.org/edit/14469027) I had to change each track artist credits manually! http://musicbrainz.org/edit/14469028
Isn't this a duplicate of MBS-2041?
Probably. But I wonder if - besides some automatic guess - a manual action through a button couldn't be useful too.
The checkbox seems a bit disconnected with what it actually does, moving it to the tracklist tab and making it a button could be a good idea.
New test case, and me getting more angry about RE:
http://musicbrainz.org/release/34800f8a-8ee5-4e6a-a2a7-12eed779be39 and http://musicbrainz.org/edit/14681621 doing nothing.
merged into master, commit 15852797db52e55c48e6b41655b776f9d4b367b7 .