text:
China's Hainan launches air freight route to ROK
HAIKOU, Jan. 14 (Xinhua) -- Southern China's island province of Hainan has launched its first air freight route linking the provincial capital of Haikou with Seoul, capital of the Republic of Korea (ROK).
An outbound cargo flight carrying 13 tonnes of goods left Haikou Meilan International Airport for Incheon International Airport on Dec. 31, 2020. On Jan. 7, an inbound flight departed from Seoul for Haikou, carrying imported goods like cosmetics.
One flight via the air route is scheduled every week, and more flights are expected to be launched after China's Spring Festival in February.
In November 2020, Hainan launched its first intercontinental air freight route, linking Haikou with the Dutch capital Amsterdam, marking the Hainan free trade port's first step toward the construction of an international air cargo network and hub.
Chinese authorities on June 1, 2020 released a master plan for the free trade port, aiming to build the southern island province into a globally influential, high-level free trade port by the middle of the century.


River's End is conveniently located between Watkinsville and Madison, off of Highway 441.
From Madison – Take highway 441 north, toward Athens. Turn right at the Rainbow Food Store/ Citgo service station onto Lower Apalachee Road. Continue on Lower Apalachee Rd. For approximately 4 miles. The entrance to River's End will be on the left.
From Athens/Watkinsville/Bishop – Take Highway 441 south, toward Madison. Pass through downtown Bishop, and continue on Hwy. 441 for approximately 6 miles.
Just past the Oconee/Morgan County line, turn left at the Citgo service station onto Lower Apalachee Road. Continue on Lower Apalachee Rd. for approximately 4 miles. The entrance to River's End will be on the left.
We know that beginning the process of building your dream home can sometimes seem a bit overwhelming. With that in mind, we've put together some resources to help you navigate your way through your build as seamlessly as possible. We've carefully selected several outstanding and reputable professionals, each of whom has proven to exceed the expectations of even the most discerning client, time after time.
When you purchase your River's End homesite through AgSouth's Madison office, you'll find options for competitive, fixed-rate financing on smaller building lots for up to 15 years, and on larger acreage for up to 20 years. They also offer construction loans at competitive rates, with construction periods of 6, 9, or 12 months.
Ag South's Construction-to-Perm (C2P) program allows your family to finance the purchase of your River's End lot and the construction of your dream home in one loan, with one interest rate, and one closing. And, their flexible C2P program allows for construction periods of 6, 9, or 12 months. As a cooperative, AgSouth returns its profits to its members, an average of 25% of interest earned since 1991.
Visit AgSouthFC.com or call 706-342-2352 for more information.
We believe a true custom home should show the personality and lifestyle of its owners. It should integrate the interior and exterior spaces with the land and landscape that surrounds it. It all starts with an overall vision and good design. Powell Home Builders, Inc. believes in listening to clients in order to design and incorporate their dreams and desires in the building process.
Mark Wilkins has been building custom homes in Morgan County and the surrounding areas since 1998. Mark works one on one with his clients through the entire construction process.
Since 2003, JDCH has been providing superior craftsmanship in the Lake Oconee and surrounding areas. Joey Daniel Classic Homes, LLC's experience and passion in the building and remodeling industry allows us to provide projects and solutions that exceed our customers' expectations. We pledge to maintain open lines of communication and long-term relationships with our customers.
Piedmont Designs is an established Landscaping Services business offering complete solutions to clients throughout the local and surrounding areas. The company has built a reputation for outstanding design and installation services since it was established in 2001.
Whether you have .5 acres or 100 acres Precise will be happy to accommodate all of your needs. Landscaping and irrigation, grading, tree removal and underbrushing, constructing your dream home or dream farm. Also enjoy renovations to your home, landscape, or pool. Let us help you revamp your space!


text:
El Ministeri d'Estat (en grec:Υπουργός Επικρατείας) és un departament governamental de Grècia. El ministeri va ser creat el 10 de març de 2004, de l'antic Ministeri de Premsa i Mitjans de Comunicació.

Història
El ministeri té els seus orígens al Departament de Premsa i Turisme format el 29 d'agost de 1936. Fins a 1974, el Departament va funcionar en diverses formes d'organització, com a Direcció General de Premsa i Informació, Departament de Premsa i Informació, Ministeri de Premsa i Informació, ja sigui com un departament independent, o sota l'Oficina del Primer Ministre, de vegades com a part de la presidència del govern, i d'altres vegades sota el Ministeri de Relacions Exteriors.

De 1974 a 1994, va funcionar com la Secretaria General de Premsa i Informació, dependent del Ministeri de la Presidència. El 1994, en virtut del Decret Presidencial 181, es consolida com el Ministeri de Premsa i Mitjans de Comunicació.

L'any 2004, el Ministeri de Premsa i Mitjans de Comunicació es va dissoldre i dues Secretaries Generals en el marc del Primer Ministre es van establir: La Secretaria General de Comunicació i la Secretaria General de la Informació, que incorpora les funcions del ministeri desaparegut.

El 26 de maig de 2004, el primer ministre va posar les dues secretaries sota l'ègida del Ministeri d'Estat.

Llista de Ministres d'Estat

Referències

Vegeu també
 Govern de Grècia

Enllaços externs
Web oficial del Ministeri

Ministeris de Grècia

redpajama_set_name: RedPajamaWikipedia


text:
/* The main class takes as inputs various parameters and constructs the desired graph type with
   its specified parameters. The Graph class has methods to print the linear program with the
   specified graph type and the specified traffic matrix. You may add your own traffic matrices
   by following the example of All-to-all etc. in that file (Graph.java).
 */

package lpmaker;

import java.security.SecureRandom;
import java.util.*;
import java.io.*;

import lpmaker.graphs.*;

public class ProduceLP {

	// Make it so that there's only one source of randomness in all, so I can control it if need be.
	public static Random universalRand;

	public static int switches = 80; 	// # of switch
	public static int switchports = 8; 	// # of ports per switch
	public static int serverports = 1; 	// # of ports per switch that used to connect to servers
	public static int extended_switches = 0; // # switches added in expansion
	public static int nsvrs = 0;	// # of servers we want to support (this, if non-zero, overrides the server ports arguments.)

	public static void main(String args[]) throws IOException{
		long randSeed = Long.parseLong(args[20]);	// In case I want to control the randomness for replicability etc.

		if (randSeed == 0) universalRand = new Random();
		else {
			System.out.println("NEWSFLASH: USING YOUR RANDOM SEED -----------------------------------------------");
			universalRand = new Random(randSeed);
		}

		int NUMRUNS = Integer.parseInt(args[0]);
		int createLP = Integer.parseInt(args[19]);	// If 1, lp is created; otherwise, only the path lengths are analyzed
								// If 2, simplified LP is created
		switches = Integer.parseInt(args[4]);
		switchports = Integer.parseInt(args[5]);
		serverports = switchports - Integer.parseInt(args[6]);	// Pay attention to the arguments here!
		extended_switches = Integer.parseInt(args[7]);
		nsvrs = Integer.parseInt(args[8]);
		double fail_rate = Double.parseDouble(args[9]);

		int trafficMode = Integer.parseInt(args[3]); 	// 0: Server-level random permutation.
								// 1: All-to-all
								// 4: Longest matching
		//if (switches == serverports + 1) trafficMode = 1;

		int graphtype = Integer.parseInt(args[1]);

		int runs = 0;	// This and NUMRUNS used to be useful; not anymore.

		if(graphtype==0) // Vanilla Random Regular Graph
		{
			System.out.println("sw:" + switches);
			System.out.println("switchports:" + switchports);
			System.out.println("svr port:" + serverports);
			System.out.println("nsvrs" + nsvrs);
			Graph mynet = new RandomRegularGraph(switches,switchports, switchports - serverports, 1, extended_switches, nsvrs, fail_rate);

			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==1)	// Fat tree
		{
			System.out.println("FAT-SIZE = " + switchports);
			Graph mynet = new FatTreeSigcomm(switchports, fail_rate);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==2) //Dragonfly
		{
			int a = Integer.parseInt(args[4]); //# of switches in each group
			int p = Integer.parseInt(args[5]); //# of serverport per switch
			int h = Integer.parseInt(args[6]); //# of intergroup ports per switch
			int z = Integer.parseInt(args[7]); //the number of connection between a pair of groups
			// a = 2p = 2h    recommended value
			// z = 1, 2, or 3?
			// number of groups g = a*h/z+1
			// number of switches = a*(g+1) = a * (a*h/z+2)
			// # ports per switch = a+h+p-1
			// z < a to avoid multigraph
			// z has to be a divisor of (a*h)
			// if a=2p=2h and h is an even number, z can be set by 1, 2, or 4.

			// if z=1, a=2, p=2, h=2

			Graph mynet = new Dragonfly(a, p, h, z);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==5) // SWDC_hex
		{
			System.out.println("Start SWDC_hex Construction");
			Graph mynet = new SWDC_hex(switches,switchports-serverports);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==6) // SWDC_2torus
		{
			int gridSize = Integer.parseInt(args[7]);
			System.out.println("Start SWDC_2torus Construction");
			Graph mynet = new SWDC_2torus(switches,switchports, serverports, gridSize);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==7) // SWDC_ring
		{
			System.out.println("Start SWDC_ring Construction");
			Graph mynet = new SWDC_ring(switches,switchports);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==9) // Jellyfish Heterogeneous
		{
			int nh = Integer.parseInt(args[10]);
			int nl = Integer.parseInt(args[11]);
			int h  = Integer.parseInt(args[12]);
			int l  = Integer.parseInt(args[13]);
			int dh = Integer.parseInt(args[14]);          	// high network degree
			int dl = Integer.parseInt(args[15]);		// low network degree

			System.out.println("HETER: " + nh + " " + h + "-port; " + nl + " " + l + "-port; ");

			int netH = dh;
			int netL = dl;

			// Vary fhh, such that d_hh varies in a meaningful range
			double min_frac = (nh * netH - nl * netL) / (double)nh;
			int min_dhh = (nh * netH - nl * netL) / nh;
			if (min_dhh < min_frac) min_dhh += 1;

			if (min_dhh < 0) min_dhh = 0;
			if (dh < 10) min_dhh = 3;
			else if (dh < 13) min_dhh = 6;
			else if (dh < 17) min_dhh = 7;
			else min_dhh = 8;
			int range = netH - min_dhh;
			int increment = 1;

			int curr_dhh = min_dhh;
			while (curr_dhh < netH && curr_dhh < nh - 1) {
				Graph mynet = new HeterRandomGraph(nh, nl, h, l, dh, dl, curr_dhh);
				if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + curr_dhh + ".lp", trafficMode, 100);
				if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
	                        if (createLP == 1 && trafficMode == 4) {
        	                        mynet.printServerDistance("lpmaker/serverDist1.txt");
                	                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                        	        runCommand(cmd);
                                	mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        	}
				mynet.printPathLengths("pl." + curr_dhh);
				curr_dhh += increment;
			}
		}
		else if(graphtype==10) // Jellyfish Heterogeneous Server distribution
		{
			int nh = Integer.parseInt(args[10]);
			int nl = Integer.parseInt(args[11]);
			int h  = Integer.parseInt(args[12]);
			int l  = Integer.parseInt(args[13]);
			int dh = Integer.parseInt(args[14]);
			int dl = Integer.parseInt(args[15]);

			Graph mynet = new HeterServerGraph(nh, nl, h, l, dh, dl);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==13)	// VL2
		{
			int aggports = Integer.parseInt(args[10]);
			int aggsw = Integer.parseInt(args[11]);

			Graph mynet = new VL2(aggsw, aggports);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if (graphtype == 14){ // VL2 Compare
			int aggsw = Integer.parseInt(args[4]);		// di
			int aggports = Integer.parseInt(args[5]);	// da
			int tors = Integer.parseInt(args[6]);		// > da * di / 4

			Graph mynet = new RandVL2Compare(aggsw, aggports, tors);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==15) // Hypercube
		{
			Graph mynet = new Hypercube((int)(Math.log(switches)/Math.log(2)), serverports);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if (graphtype == 16) // Butterfly
		{
			Graph mynet = new FlattenedButterfly(1+serverports,1+((switchports-serverports)/serverports),switches);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==17) // LSPIIRamanujam
		{
			serverports = Integer.parseInt(args[6]);
			Graph mynet = new LSPRamanujanII(switchports, switches, serverports);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		else if(graphtype==18) // Jellyfish Heterogeneous Linespeeds
		{
			int nh = Integer.parseInt(args[10]);
			int nl = Integer.parseInt(args[11]);
			int h1 = Integer.parseInt(args[12]);
			int h2 = Integer.parseInt(args[13]);
			int l  = Integer.parseInt(args[14]);
			int dh = Integer.parseInt(args[15]);          	// high network degree i.e. out of h2, how many are network ports
			int dl = Integer.parseInt(args[16]);		// low network degree i.e. out of 'l' how many are network ports
			int capH = Integer.parseInt(args[17]);		// Higher line-rate i.e. either 10G or 40G
			int capL = Integer.parseInt(args[18]);		// Lower line-rate i.e. either 1G or 10G

			int netH1 = h1;
			int netH2 = dh;
			int netL = dl;

			// Vary conn_nl_nl in a meaningful range
			double min_frac = (nl * netL - nh * netH2) / (double)nl;
			int min_nl_nl = (nl * netL - nh * netH2) / nl;
			if (min_nl_nl < min_frac) min_nl_nl += 1;

			if (min_nl_nl < 0) min_nl_nl = 0;
			int range = netL - min_nl_nl;
			int increment = 1;

			int curr_nl_nl = min_nl_nl;
			while (curr_nl_nl < netL) {
				Graph mynet = new HeterLineSpeeds(nh, nl, h1, h2, l, dh, dl, capH, capL, curr_nl_nl);
				if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + curr_nl_nl + ".lp", trafficMode, 100);
				if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
	                        if (createLP == 1 && trafficMode == 4) {
        	                        mynet.printServerDistance("lpmaker/serverDist1.txt");
                	                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                        	        runCommand(cmd);
                                	mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        	}
				mynet.printPathLengths("pl." + curr_nl_nl);
				curr_nl_nl += increment;
			}
		}
		else if (graphtype == 20){ // Read graph from file, print linear program for both that graph, and equivalent random graph for comparison; graph file has lines of type "from <list of neighbors>"
			String graph_file = args[2];

			Graph mynet = new GraphFromFile(switches, graph_file);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }

			int[] degreeDist = new int[mynet.noNodes];
			for (int sw = 0; sw < mynet.noNodes; sw ++) {
				degreeDist[sw] = mynet.adjacencyList[sw].size();
			}
			Graph randCompare = new RandDegreeDist(switches, degreeDist);
			if (createLP == 1 && trafficMode == 0) randCompare.PrintGraphforMCFFairCondensed("randCompare." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("randCompare." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                randCompare.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                randCompare.PrintGraphforMCFFairCondensed("randCompare." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
			randCompare.printPathLengths("pl_randCompare." + runs);
		}

		else if (graphtype == 21){ // Read graph from file, print linear program for both that graph, and equivalent random graph for comparison; graph file has lines of type "from #servers-here <list of neighbors>"
			String graph_file = args[2];

			Graph mynet = new GraphFromFileServerDist(switches, graph_file);

			int[] degreeDist = new int[mynet.noNodes];
			int[] svrdist = new int[mynet.noNodes];

			for (int sw = 0; sw < mynet.noNodes; sw ++) {
				degreeDist[sw] = mynet.adjacencyList[sw].size();
				svrdist[sw] = mynet.weightEachNode[sw];
			}

			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1 && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }

			Graph randCompare = new RandDegreeDist(switches, degreeDist, svrdist);
			if (createLP == 1  && trafficMode == 0) randCompare.PrintGraphforMCFFairCondensed("randCompare." + runs + ".lp", trafficMode, 100);
			if (createLP == 1  && trafficMode == 1) mynet.PrintSimpleGraph("randCompare." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                randCompare.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                randCompare.PrintGraphforMCFFairCondensed("randCompare." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
			randCompare.printPathLengths("pl_randCompare." + runs);
		}
		else if (graphtype == 22){ // VL2 Compare Modified Switch Design
			int aggsw = Integer.parseInt(args[4]);		// di
			int aggports = Integer.parseInt(args[5]);	// da
			int tors = Integer.parseInt(args[6]);		// > da * di / 4

			int svrT = Integer.parseInt(args[7]);
			int svrC = Integer.parseInt(args[8]);
			int svrA = Integer.parseInt(args[9]);
			int corePortsMorphed = Integer.parseInt(args[10]);
			int aggPortsMorphed = Integer.parseInt(args[11]);
			int smallCorePorts = Integer.parseInt(args[12]);
			int smallAggPorts = Integer.parseInt(args[13]);

			Graph mynet = new RandVL2CompareMod(aggsw, aggports, tors, svrT, svrC, svrA, corePortsMorphed, aggPortsMorphed, smallCorePorts, smallAggPorts);
			if (createLP == 1 && trafficMode == 0) mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
			if (createLP == 1  && trafficMode == 1) mynet.PrintSimpleGraph("my." + runs + ".lp", trafficMode);
                        if (createLP == 1 && trafficMode == 4) {
                                mynet.printServerDistance("lpmaker/serverDist1.txt");
                                String cmd = "python lpmaker/maxWeight.py lpmaker/serverDist1.txt maxWeightMatch.txt";
                                runCommand(cmd);
                                mynet.PrintGraphforMCFFairCondensed("my." + runs + ".lp", trafficMode, 100);
                        }
			mynet.printPathLengths("pl." + runs);
		}
		System.out.println("Done Constructing Graph");
	}

 public static void runCommand(String cmd){
        Process p;
        try{
            p = Runtime.getRuntime().exec(cmd);
            BufferedReader br = new BufferedReader(new InputStreamReader(p.getInputStream()));
            String s = br.readLine();
            System.out.println(s);
            p.waitFor();
            p.destroy();
        } catch (Exception e) {}
    }
}

redpajama_set_name: RedPajamaGithub


text:
Q: Odd warning about iconv() function I am getting the following warning in mylog file:
PHP Warning:  iconv(): Charset parameter exceeds the maximum allowed length of 64 characters in /home/jnj/PlancakeEmailParser.php on line 283

The block in question (part of the getBody() function):
if (!$detectedContentType)
    {
        // if here, we missed the text/plain content-type (probably it was
        // in the header), thus we assume the whole body is what we are after
        $body = implode("\n", $this->rawBodyLines);
    }

    // removing trailing new lines
    $body = preg_replace('/((\r?\n)*)$/', '', $body);

    if ($contentTransferEncoding == 'base64')
        $body = base64_decode($body);
    else if ($contentTransferEncoding == 'quoted-printable')
        $body = quoted_printable_decode($body);

    if($charset != 'UTF-8') {
        // FORMAT=FLOWED, despite being popular in emails, it is not
        // supported by iconv
        $charset = str_replace("FORMAT=FLOWED", "", $charset);

        $bodyCopy = $body;
        $body = iconv($charset, 'UTF-8//TRANSLIT', $body);

        if ($body === FALSE) { // iconv returns FALSE on failure
            $body = utf8_encode($bodyCopy);
        }
    }

    return $body;
}

I am using PlancakeEmailParser.php to parse emails. I have Googled the error and nothing pops out at me. Anyone have any ideas of how or if I need to deal with this?

A: you say you are use PlancakeEmailParser.php class.
just search to line :-
$bodyCopy = $body;

and change to :-
$bodyCopy = quoted_printable_decode($body);

redpajama_set_name: RedPajamaStackExchange


You took the business from 0 users to 500, 2000, 5000… then growth starts stalling. Existing users are leaving. New ones are barely signing up. And you know 'no growth' is quite tantamount to 'dying'. What do you do? Do you need a new marketing strategy? Is there a problem with the product? Did you suddenly drop in the SERPs?
But regardless of why your growth has stagnated, what's most important is how you bounce back, and that's why today, we'll be looking at 4 accessible growth hacking techniques you can use to kickstart your business out of a funk.
New entrants or existing competitors often come up with new features your products don't have. And many times these features become the "wow factors" in your industry. But many companies ignore these factors and fall prey to growth stalls.
A study on the growth experiences of a number of top organizations reveals that a cycle of disdain, denial and rationalization keeps many teams from responding meaningfully to market changes.
But instead of ignoring these competitor-induced changes, adjusting your product ASAP may be your best bet to sustaining growth in any industry. That is, you look at those "wow factors" and learn from them. That's what your prospects want. If you don't give them what they want, they will move on to wherever they can get it, and your business will plateau.
Take Windows PC vendors, for example. They enjoyed the vast majority of market share for many years. From 2006 to 2013, Lenovo, HP, Acer, Dell, Asus, and Toshiba kept occupied the top 5 spots for personal computer sales.
Apple was barely even in the picture during those years, and the all of sudden, they snatched the 5th spot in 2014 and have held the spot ever since. Why? They identified two wow factors in their space – design and simplicity – and leveraged those factors to quickly gain market share.
Competitors caught on and adapted, and now you can find many different PC vendors offering products with Mac-inspired designs and features.
See how they all look like Macbooks?
But obviously, HP isn't the only PC brand protecting its share of the market from Apple. Other PC manufacturers that have withstood the test of time understand that looking out for wow factors and adapting to market changes keeps them relevant and in business.
If you are experiencing stagnation in your business, it might be time to adjust. Look at the fastest growing business in your space, and see what you can learn from them.
Growth doesn't always come from genius. Sometimes all it takes is common sense. If you've been doing the exact same thing, but it's stopped working, it might be time to simply try something new.
For example, PPC agency KlientBoost had spent over a year investing heavily in content marketing. They had pulled in some of the most prolific authors in the marketing space and were churning out well-received articles on a regular basis, but at the end of the day, their strategy wasn't bringing in leads.
They decided to change things up and doubled the length of all their content, producing 3,000-4,000 word blog posts instead of the usual 1,500-2,000, and over the next year, the company ballooned from $100k MRR to $300k MRR.
You don't always know if a new strategy will pan out. But guess what? You know EXACTLY how your current strategy is performing. If it's not working, try something new.
Is there anything available to you that you aren't taking advantage of?
Does your friend have a column on Entrepreneur.com, but you've never taken the time to work out a post featuring your business?
Does your quarterly webinar perform well, but you just haven't bothered to invest in setting up more webinars?
Do you know Facebooks ads work really well in your industry, but you just haven't gotten around to setting up a campaign yet?
These types of available resources are fine to ignore when business is growing and other strategies are working, but when growth is stagnating, it's time to maximize these resources before you even consider looking elsewhere.
These same posts could have been used as a tool to drive brand awareness and growth for Airbnb — if they were on topics that would attract new Airbnb users. But they weren't. However, Airbnb now seems to have recognized the value their blog can bring and have more recently begun publishing the types of content Benji suggested.
This is an example of a company maximizing an available resource.
Look around. What resources are you currently failing to fully utilize? What has worked for you in the past but you never followed up?
When growth is stagnating, it's time to start listening to the people you don't normally listen to – the people who AREN'T driving your current marketing direction.
Different people in your company bring different skills to the table. Engineers understand your product. Salespeople understand persuasion. Customer services reps know exactly what's on your customers' minds.
Instead of hunkering down on the same-old, same-old, look to bring in new perspectives and insights. Listen to everyone willing to offer feedback. Creativity is not exclusive to the field of marketing or growth hacking.
Collaboration is one of the best possible ways to kickstart growth.
Stagnating growth is nearly impossible to avoid, but it doesn't have to be permanent. As your marketing strategies begin to decline in ROI, use these 4 simple growth hacking techniques to kickstart growth and resume your climb.
Victor Ijidola is a content marketer and freelance business writer (for hire). He runs Premium Content Shop where he offers premium writing services that drive leads, and has been featured on sites like Inc.com, The Next Web, Kissmetrics and many more.


text:
Welcome Home Featured
Important anthology with powerful emotion
September 13, 2017 (Updated: September 15, 2017)
WELCOME HOME is a collection of stories about adoption from a number of perspectives, from teens who are meeting their birth parents for the first time to ones choosing whether or not to have their own children up for adoption. There is a wide variety of authors from C.J. Redwine to Eric Smith (also the editor of the collection) to Sangu Mandanna.
Anthologies are some of the hardest books to review, particularly in this case. The voices, genres, and perspectives range across the board, bound by the common theme of adoption. There is certainly a gap in the field from varying adoption perspectives, and WELCOME HOME provides a great opportunity for readers to find themselves represented. While I think the different genres included (contemporary, fantasy, scifi, etc.) are fascinating, sometimes the switch in genre between stories is jarring.
My favorite stories are C.J. Redwine's, which features a mother and newly adopted daughter bonding with both awkwardness and kindness; Julie Eshbaugh's, which brings up visible genetic attributes (webbed feet), something that can be a constant reminder of biological parents; and Eric Smith's story of weighing risk and consequences. Caela Carter's also features a strong voice and intriguing snapshot.
Without a doubt, those who read WELCOME HOME will find themselves eager for more from many of the writers and more stories of adoption and the many nuances within blood and chosen families.
Samantha Randolph, Promotions Manager Top 50 Reviewer 202 reviews
Yara's Spring
"Yara and her younger brother Saad are in a refugee camp in Jordan in 2016, waiting to hear what their..."
Cracked Up To Be
Jazmen Greene, Newsletter Manager
"Cracked up to be is an unsettling tale of a girl on the cusp of a mental breakdown for over..."
The Derby Daredevils: Kenzie Kickstarts a Team: (The Derby Daredevils Book #1)
"Kenzie and her best friend Shelley love roller derby, a sport in which they are interested because Kenzie's mother is..."
Nina Soni: Sister Fixer
"After Nina Soni, Former Best Friend, Nina is back, and this time is concerned that her little sister is a..."
King and Kayla and the Case of the Unhappy Neighbor
"King's friend Thor is in big trouble. His owner, Jillian, got a call from the grumpy Mr. Gary that Thor..."
Storm Dog
"Ariel has a difficult home life in her Blue Ridge Mountain home in Virginia. It's not because of economics; her..."
Wrong Way Summer
"Claire's father has always been evasive when it comes to answering questions about her mother, who left the family when..."
That's Not What Happened
Paige Cee, Staff Reviewer
"WHAT I LOVED: There have been countless school shootings in the United States and hundreds if not thousands of..."
Like Sisters on the Homefront
"Top 3 reasons to read LIKE SISTERS ON THE HOMEFRONT: 1.) The characters- Gayle, a NYC girl sent to..."
Zeus, Dog of Chaos
"Madden is getting used to living with his mother, an Army lieutenant, after having spent a lot of time with..."
How to be a Girl in the World
"Lydia lives in an apartment in New York with her mom and her cousin, Emma. Emma's mother, who was African-American,..."
The New David Espinoza
"David is the skinniest kid at high Florida high school, and he's taken his share of bullying about it. On..."
The Magnificent Mya Tibbs: Mya in the Middle
"Mya's exploits at school continue when her fourth grade class participates in an economics unit. The children get $25 from..."
Sabotage (Beatrice Zinker, Upside Down Thinker (3))
"Beatrice calls a meeting of Operation Upside with her friends Sam and Lenny, and they decide what the newest awards..."
I, Cosmo
"Cosmo is the "big brother" of Max and his young sister Emmaline, and is now 13 years old. He still..."
TBH, This is SO Awkward
Beth Rodgers, Staff Reviewer
"'TBH, This is SO Awkward: A Novel in Text' by Lisa Greenwald is quite interesting in that it is written..."
Look Both Ways
"I often hear it said that writers are bred, and sure you can breed some decent writers with whatever amount..."
"I feel like I've been asleep for the last 31 years and I just woke up. I am woke. ..."
Dog Days in the City
"In The Unlikely Story of a Pig in the City, Josie and her large family adopted Hamlet, a pig. When..."
Truest

redpajama_set_name: RedPajamaCommonCrawl


Although it's still only mid-September, time is running out on Saul "Canelo" Alvarez and his search for the perfect opponent for his December 6 return to the ring—especially if he wants to be in competition for the prestigious Fighter of the Year award.
Having already beaten Alfredo Angulo and Erislandy Lara this year, Alvarez's ideal third opponent of 2014 should be someone with name recognition, who is ranked in someone's top 10 and considered a legitimate test for the 24-year-old Mexican star. The problem is that as time advances, the pool of prospective foes is beginning to dry out as fighters lock in their plans for the rest of the year.
Another issue is whether the red-headed battler from Guadalajara will compete on HBO or Showtime now that Golden Boy founder, Oscar De la Hoya has mended fences with HBO.
As of right now, Miguel Cotto has already announced his plans to sit out the rest of the year and WBO junior middleweight titlist Demetrius Andrade has petitioned the WBO for a shot at the vacant WBO middleweight title. Rumored front runner, James Kirkland, is now being mentioned as a possible undercard attraction on the Bernard Hopkins-Sergey Kovalev broadcast.
Of the remaining options, former welterweight champ Joshua Clottey is now the favorite to get the opponent slot for December 6, but that would likely mean a lower-profile bout for a lower overall payday against the shopworn fighter from Ghana.
Surprises are still possible and a major showdown can still be booked, but time is running out on Team Canelo if their goal is to close out the year with a real bang.


text:
Q: Much of an impact She was too drunk for it to have much of an impact on her.

*

*Is "much of" natural in examples like this? Or would it only be natural if the sentence was something like: She was so drunk that it didn't have much of an impact on her.

*Would "much of an impact" as used in my example often mean that it had no impact on her at all?

A: Both of those expressions could be used, as could this one:
She was drunk enough that it didn't have much impact on her.
The expression "not much" means the impact was not great, and that includes the possibility that it had no impact on her at all, though it doesn't state that.
You cant conclude that it "often" means "no impact". It just doesn't say that.


text:
from flask import Flask
from redis import Redis
import os

# Add and initialize Datadog monitoring.
from datadog import initialize, statsd
initialize(statsd_host=os.environ.get('DATADOG_HOST'))

app = Flask(__name__)
redis = Redis(host='redis', port=6379)

@app.route('/')
def hello():
    # Increment the Datadog counter.
    statsd.increment('docker_compose_example.page.views')

    redis.incr('hits')
    return 'Ola! Este Site foi acessado %s vezes.' % redis.get('hits')

if __name__ == "__main__":
    app.run(host="0.0.0.0", debug=True)


text:
From COVID-19 to the Coup, Myanmar's Doctors Are Risking Their Lives
ASEAN Beat | Politics | Southeast Asia
Politically active medical professionals are managing to balance their activism with their commitment to the Hippocratic Oath.
By Adam Lalley for The Diplomat
Dr. Maung sits in the back of a makeshift ambulance that serves the group Mandalay Medical Cover.
Credit: Mandalay Medical Cover
In early February, COVID-19 vaccines had just begun to reach the arms of the general population when military and police forces in Myanmar seized control of the country, including its publicly owned hospitals.
Taking a page from former President Donald Trump's playbook, Myanmar's commander-in-chief declared, without evidence, that the loss of the military's proxy party in the November elections had stemmed from widespread voter fraud and irregularities caused by the pandemic. He detained election officials and members of parliament, then declared a one-year state of emergency until "fair" elections could be guaranteed.
Almost immediately, hundreds of thousands of garment workers, student activists, bankers and civil servants brought basic government operations to a halt by launching a nationwide strike. Frontline medical workers joined soon afterwards, effectively crippling state and federal healthcare infrastructure.
Before joining what has become known as the Civil Disobedience Movement (CDM), physicians in Yangon's government hospitals had to ensure that their patients would be safe, according to Dr. W., who asked to remain anonymous to protect herself and her family from military reprisals. It took days and a massive organizational effort to discharge all eligible patients to their homes, transfer others to private hospitals, establish mobile clinics, and postpone non-emergency surgeries. In doing so, they also negotiated agreements with private hospitals to deliver care for free or at minimal charge.
An infectious disease specialist from the central city of Mandalay, Dr. Maung explained the rationale behind healthcare workers joining the general strike. "If you don't have anyone working under you, you can't call yourself a legitimate government," he said.
To replace public hospitals, Maung helped to form Mandalay Medical Cover to continue caring for patients with chronic diseases and those who had been injured in the violent military crackdowns. Volunteers in his home town converted neighborhood pop-up COVID-19 treatment centers into general clinics offering free consultations and medications. For necessary tests like CT scans and MRIs, they have also partnered with private hospitals to transfer patients into their care.
"The people are not angry at us for closing the hospitals," Maung said. "They're angry at the military for creating this situation."
Win, a social media influencer who has joined the protests, said, "It was very encouraging to see doctors strike. Doctors are among the most highly regarded professionals in our culture. They're viewed as intellectuals, and it gave us strength to know they were with us."
Strikes by physicians are not uncommon and have occurred around the globe, including in the United States. But despite studies that have paradoxically shown either no change or a decrease in patient mortality during times of physician walk-outs, an ethical tension exists between a physician's desire to improve hospital working conditions and the risks of abandoning patients to join a picket line. But Myanmar's strike is different both in its widespread support and in the efforts taken not to abandon care but rather to wrest it from military oversight.
Delivering babies in a mobile clinic with limited supplies now comes with added risk, Dr. W. conceded, "but the people and the doctors are one and together. The people support us."
In mid-February, when the new regime threatened to detain doctors if they refused to staff a city hospital in Shan State, local civilians intervened, banging pots and pans to warn the medical staff of the military's approach, an echo of the support many urban dwellers expressed toward healthcare workers in the early days of the COVID-19 pandemic in the United States and Europe.
"One of my patients told me that she would rather die than be treated at a military hospital," Maung said. "We are living in the deadliest moments of our lives, but people are more scared of a future under military rule than they are of COVID-19."
Slightly smaller than the state of Texas but with nearly twice its population, Myanmar shares borders with India, China, and Thailand. It transitioned from military to semi-democratic rule almost 10 years ago, but in exchange for a series of reforms that included a modern constitution, the junta held onto a crucial block of seats in Parliament that are exempt from elections. It also retained its extensive financial connections to major national industries, such as mining and logging. Some feel that after enacting the new constitution the military expected to be voted back into power through democratic means and staged a coup only when a democratic victory seemed increasingly unlikely.
By now, dozens of unarmed protestors have been fatally wounded by police and military brutality, and graphic images of their deaths have circulated widely on the Internet. And though medical workers have marked their uniforms clearly with white flags or red crosses, they have also become targets.
Dr. Maung recounted a harrowing story of his thwarted attempt to treat multiple bone fractures in a cyclist rammed by a military vehicle in Mandalay. "We were trying to carry the patient into our ambulance when soldiers began firing live rounds. We were the only ones in the street, so we knew they were firing at us. We could hear the bullets hit the metal of our ambulance."
A separate video capturing a police assault on three volunteer medical workers exposed a brutal beating that led to severe head injuries for two members of an ambulance crew and the death of a third.
When military violence has erupted into mass casualties and overwhelmed mobile clinics, an organized cohort of doctors has managed to temporarily re-open the emergency departments of some government hospitals to treat the wounded. But at these times, Maung says, the military has kept track of which healthcare workers showed up, in some cases issuing arrest warrants. On March 7, police began occupying multiple hospitals in Yangon.
Dr. Maung himself has gone into hiding, living apart from his wife and two children for their protection. He agreed to speak with me on the condition that I use a pseudonym for his name.
"We are in a war zone," he said. "We went from the threat of COVID to the threat of being shot or detained." As an infectious disease specialist, he worries that the military may be hoarding more than a million recently donated vaccines for their own purposes, using the promise of COVID-19 immunity to recruit and retain new soldiers. In addition, millions of dollars donated by the International Monetary Fund to support a recovery from the coronavirus crisis is now likely in the hands of the junta. If the regime has reallocated that money to strengthen its own hold on power, the country's progress against COVID-19 may be reversed by the political crisis, with international implications.
"If we have another outbreak here," Maung says, "it could spread to the rest of the world. We're going to win or we're going to die."
Adam Lalley
Adam Lalley is a freelance writer and Emergency Medicine physician at Maimonides Medical Center in New York City.
Civil Disobedience Movement (CDM)
Myanmar coup
Myanmar COVID-19
Myanmar military
Myanmar protests
UN: 38 Died on Deadliest Day Yet for Myanmar Coup Opposition
The escalation in the violence has led to increased diplomatic efforts to resolve the political crisis — but there appear few viable ways forward.
Myanmar's Former Military Dictator Hospitalized Due to COVID-19
By Sebastian Strangio
Than Shwe's illness is paralleled by the collapse of the crafted system of semi-democracy that he engineered.
Myanmar Plunges Into Deadly Third COVID-19 Wave
By Naw Theresa
COVID-19 vaccination efforts have become fatally entangled in the hostilities unleashed by the February coup.
Amid Coup Crisis, COVID-19 Hits New Daily Highs in Myanmar
With health workers on strike and much of the public in open rebellion, a new wave of infections could prove devastating.


text:
IAC JV BOYS BASKETBALL: FAST START CARRIES UNBEATEN WAVERLY TO 68-34 WIN OVER WHITNEY POINT (2023-01-20)
WAVERLY — Waverly built a 10-point lead in the first quarter, then blew the game wide-open in the second quarter on its way to a 68-34 win over Whitney Point here Thursday night in IAC Large School boys basketball crossover action.
Bryce LaForest knocked down a trio of 3-pointers for nine points in the first quarter, and Ben Shaw added five points, including a 3-ball, as Waverly jumped out to a 16-6 lead after the first eight minutes.
LaForest pumped in 17 points, including a 3-pointer, in the second quarter, and Shaw added four points to fuel a 27-12 blitz that gave the junior Wolverines a 43-18 lead heading into the halftime intermission.
LaForest led Waverly with a career-high 28 points, three steals, and two assists, while Shaw had 11 points and three assists, and Lincoln Sharpsteen scored seven points.
Peyton Robinson had five points, three steals, and two assists in the win, while Carson Rockwell had four points and eight rebounds, Jerry Carnrike had four points and four rebounds, Ronin Ault added four rebounds and three assists, and J.T. Williams had four boards and two assists.


text:
Q: Upgrade Ubuntu LTS to a Version that supports MacBook retina I have Ubuntu LTS 14.04 with Gnome 3 as GUI installed on my MacBook ( it's a persent ) and some things don not work very well. Like Chromium is eye hurting small and my thunderbold interfaces do not work very well either.
I know that for Thunderbold support i would need at least Kernel 3.14 but my current Kernel is 3.13.something.
I also know that for Gnome to work with HiDPI desktops it'll need Gnome 3.12 but 3.10 is installed.
So my question is, what can i do to get newer Software while beeing aware that it is not that tested and might break.

A: To update your kernel you can use a guide like: https://wiki.ubuntu.com/Kernel/MainlineBuilds (but you could just google for it)
Installing upstream kernels
To boot into an upstream kernel you only need to download and install the image.deb package that corresponds to your architecture. In addition, if you need to build any external modules you also need the correspinding headers-_.deb and headers-_all.deb packages.
For example, let us use http://kernel.ubuntu.com/~kernel-ppa/mainline/v3.14.4-utopic/.
If you were testing i386, you would want those marked A.
If you were testing amd64, B.
(Use generic kernel unless you have a special need for lowlatency kernel, such as audio production.)
B  linux-headers-3.14.4-031404-generic_3.14.4-031404.201405130853_amd64.deb
A  linux-headers-3.14.4-031404-generic_3.14.4-031404.201405130853_i386.deb
linux-headers-3.14.4-031404-lowlatency_3.14.4-031404.201405130853_amd64.deb
linux-headers-3.14.4-031404-lowlatency_3.14.4-031404.201405130853_i386.deb
AB linux-headers-3.14.4-031404_3.14.4-031404.201405130853_all.deb
B  linux-image-3.14.4-031404-generic_3.14.4-031404.201405130853_amd64.deb
A  linux-image-3.14.4-031404-generic_3.14.4-031404.201405130853_i386.deb
linux-image-3.14.4-031404-lowlatency_3.14.4-031404.201405130853_amd64.deb
linux-image-3.14.4-031404-lowlatency_3.14.4-031404.201405130853_i386.deb
Once you have those downloaded they will need to be installed using dpkg:
sudo dpkg -i *.deb

When this process completes you should have a new entry on your boot menu representing the upstream kernel. This will appear as an entry like this:
Ubuntu Trusty, kernel 3.14.4-031404-generic

Updating Gnome to 3.12:
This step is taking from: http://linuxg.net/how-to-install-gnome-3-12-on-ubuntu-gnome-14-04-trusty-tahr/
$ sudo add-apt-repository ppa:gnome3-team/gnome3

$ sudo add-apt-repository ppa:gnome3-team/gnome3-staging

$ sudo apt-get update

$ sudo apt-get install bijiben polari gnome-clocks gnome-weather gnome-maps gnome-music gnome-photos gnome-documents gnome-contacts epiphany-browser gnome-sushi gnome-boxes gnome-shell-extensions

Now you should logout and log back in to Gnome 3.12.

A: Quick fix for chromium (or google chrome for that matter):
$ chromium --high-dpi-support=1 --force-device-scale-factor=2

should do the job.

A: About the DPI part, you can also try "normal" Ubuntu (Ubuntu Unity) which will have high DPI support by default (no need to use PPA or any other package).


Letter O never looked so big and round, or so juicy and yummy until this letter identification worksheet for the letter O. Pictured in an alphabet letter frame, this orange should be colored what color? Orange! Of course. But don't forget to find and circle all the o's first. There are 12 in the frame, three on each side. Do your kids see o's in the sentence, "Oranges are good."? They should circle those, too. And don't forget to look for the hidden sight word "yes" in the top part of the frame.


text:
Preventing Environmental Damage from Products
An Analysis of the Policy and Regulatory Framework in Europe
Eléonore Maitre-Ekern, Universitetet i Oslo
Carl Dalhammar, Lunds Universitet, Sweden
Hans Christian Bugge, Universitetet i Oslo
Hans Christian Bugge, Carl Dalhammar, Eléonore Maitre-Ekern, Michael Faure, Erling Eide, Beate Sjåfjell, Nicolas de Sadeleer, Ludwig Krämer, Jessika Luth Richter, Erika Machacek, Sahra Svensson, Naoko Tojo, Åke Thidell, Nertila Kuraj, Charlotte Leire
How to tackle environmental damage from the throwaway society is one of the defining questions of the twenty-first century. By establishing a circular economy, we can encourage and support sustainable production and consumption. These essays by an international group of leading scholars from a range of disciplines analyse policies and legal instruments and challenge mainstream assumptions, from the choice of a policy mix to the actual effect of imposing standards on the market, and from corporate objectives and priorities to the use of precaution in assessing particularly harmful substances. Each chapter contributes to a better understanding of the current policy and regulatory framework in Europe and identifies the challenges and opportunities ahead. The book breaks new ground by examining how product policies can contribute to important objectives and visions, such as the aims of the circular economy. It is a must-read for researchers as well as for policymakers and practitioners.
Explores a very topical but under-researched field
Opens new perspectives on environmental product regulation
Illustrates arguments with concrete examples from the law and from the practice
'This book is a welcome contribution to our understanding of product policy. It provides a systematic analysis of key elements of product policy - law, regulation, trade issues - and sophisticated exploration of the challenges to this approach to environmental policy. While product policy is most advanced in Europe, the integration of life-cycle thinking is growing worldwide. This book will be very useful to researchers, policy makers, and activists grappling with the many dimensions of product policy including eco-design, extended producer responsibility, chemicals in products, and eco-labels, and their many intersections.' Reid Lifset, editor of Journal of Industrial Ecology and Yale University, Connecticut
'The anthology contains a number of insightful analyses that provide new and refreshing perspectives on issues ranging from how to reduce the impact from different types of products, to the need for regulations due to market failures, and the vulnerability of markets to violations by powerful suppliers. All in all, the book brings the reader up-to-date on the complex issues related to environmental regulations for products and provides a unique overview of the area. Time well spent!' Mats Larsson, IUC Syd, author of Circular Business Models and The Business of Global Energy Transformation
'Every environmental lawyer needs this book. Too little attention goes to pollution from products. Yet from cars to plastics, making, using and disposing of products create some of today's biggest pollution problems. This book provides the most comprehensive discussion of these issues to date. The authors are leading experts and bring rigour and clarity to their work. If you use law to protect the planet, or simply want to understand the Herculean tasks we face, order your copy.' James Thornton, environmental lawyer and founding CEO of ClientEarth
'This book makes a compelling case for strengthening product design in order to minimise environmental impacts through the life cycle. From energy efficiency requirements to durability, reparability and recyclability standards, it explains how product-oriented environmental laws can help solve some of the most pressing issues of our time.' Jeremy Wates, Secretary General of the European Environmental Bureau
'This edited volume truly engages the reader with its thoughtful treatment of environmental product policies. The book skilfully interweaves topical legal and policy considerations in its exploration of major themes and cases in this field, which the circular economy discourse has brought (back) to the forefront of developments.' Harri Kalimo, Jean Monnet Professor, Institute for European Studies, Vrije Universiteit Brussel
contains: 11 b/w illus. 16 tables
1. Developing legislation to prevent environmental damage from products: Herculean but necessary task Hans Christian Bugge, Carl Dalhammar and Eléonore Maitre-Ekern
Part I. Structural Issues Associated with Regulating the Life-Cycle of Products:
2. Exploring the spaceship Earth: a circular economy for products Eléonore Maitre-Ekern
3. Principles for the design of a policy framework to address product life-cycle impacts Michael Faure and Carl Dalhammar
4. The harm of products and the need of information on inputs, production, use, and disposal Erling Eide
5. Redefining agency theory to internalize environmental product externalities. A tentative proposal based on life-cycle thinking Beate Sjåfjell
6. Environmental measures as an obstacle to free movement of goods in the internal market Nicolas de Sadeleer
Part II. Challenges Related to the Application of European Product Law:
7. Dieselgate and the protection of the environment by public authorities Ludwig Krämer
8. Energy efficiency regulations, market and behavioural failures, and standardization Carl Dalhammar, Jessika Luth Richter and Erika Machacek
9. Regulating recyclability under the Ecodesign Directive: how can we achieve synergies between waste and product policies for electric and electronic equipment in order to promote recycling? Sahra Svensson and Carl Dalhammar
10. Material recycling without hazardous substances – interplay of two policy streams and impacts on industry Naoko Tojo and Åke Thidell
11. Complexities and conflicts in controlling dangerous chemicals: the case of regulating endocrine disruptors in EU law Nertila Kuraj
12. Long-term market effects of green public procurement Charlotte Leire and Carl Dalhammar
Part III. Conclusion by the Editors:
13. Present and future challenges for Europe's environmental product policy Eléonore Maitre-Ekern, Hans Christian Bugge and Carl Dalhammar.
Eléonore Maitre-Ekern is a Ph.D. Candidate in the Department of Public and International Law at the Universitetet i Oslo, Norway.
Carl Dalhammar is Associate Professor in the International Institute for Industrial Environmental Economics (IIIEE) at Lunds Universitet, Sweden.
Hans Christian Bugge is Professor emeritus in Environmental Law in the Department of Public and International Law at the Universitetet i Oslo, Norway.
Health Economics, Policy and Law
International trends highlight the confluence of economics, politics and legal considerations in the health policy…
Transnational Environmental Law
NEWS - TEL has a new Impact Factor in the 2015 Thomson Reuters Journal Citation Report. Find out more here.Transnational…


text:
\section{Introduction}

For all  terms and definitions, not defined specifically in this paper, we refer to \cite{FH} and \cite{DBW} and for different graph classes, we refer to \cite{BLS}. Unless mentioned otherwise, all graphs considered here are simple, finite and have no isolated vertices.

The notion of a set-valued graph has been introduced in \cite{A1} as a graph, the labels of whose vertices and edges are the subsets of a given set. Since then, several studies have been done on set-valuations of graphs. The {\em sumset} of two non-empty sets $A, B$, denoted by  $A+B$, is defined as $A + B = \{a+b: a \in A, b \in B\}$. Using the terminology of sumsets of sets, the notion of an integer additive set-indexer of a given graph is introduced in \cite{GA} as follows.

Let $\mathbb{N}_0$ denote the set of all non-negative integers and $\mathcal{P}(\mathbb{N}_0)$ be its power set. An {\em integer additive set-indexer} (IASI, in short) of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(\mathbb{N}_0)$ such that the induced function $f^+:E(G) \to \mathcal{P}(\mathbb{N}_0)$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective.

The cardinality of the set-label of an element (vertex or edge) of a graph $G$ is called the {\em set-indexing number} of that element.

\smallskip

LEMMA 1.1. \cite{GS1} Let $A$ and $B$ be two non-empty finite sets of non-negative integers. Then, $\max(|A|,|B|) \le |A+B|\le |A|\,|B|$. Therefore, for any integer additive set-indexer $f$ of a graph $G$, we have $\max(|f(u)|,\, |f(v)|)\le |f^+(uv)|= |f(u)+f(v)| \le |f(u)|\, |f(v)|$, where $uv\in E(G)$.

\smallskip

DEFINITION 1.2. \cite{GS1} An IASI $f$ of a graph $G$ is said to be a {\em weak IASI} if $|f^+(uv)|=|f(u)+f(v)|=\max(|f(u)|,\,|f(v)|)$ for all $u,v\in V(G)$. A graph which admits a weak IASI is called a {\em weak IASI graph}. A weak  IASI $f$ is said to be {\em weakly $k$-uniform IASI} if $|f^+(uv)|=k$, for all $u,v\in V(G)$ and for some positive integer $k$.

\smallskip

If $A$ and $B$ are two non-empty sets of non-negative integers, then $|A+B|=|A|$ if and only if $|B|=1$ and $|A+B|=|B|$ if and only if $|A|=1$. Hence, we have

\smallskip

THEOREM 1.3. \cite{GS1}  A graph $G$ admits a weak IASI if and only if at least one end vertex of every edge of $G$ has a singleton set-label.

\smallskip

DEFINITION 1.4. \cite{GS3} A {\em mono-indexed element} (a vertex or an edge) of an IASI graph $G$ is an element of $G$ whose set-indexing number is $1$. The {\em sparing number} of a graph $G$ is defined to be the minimum number of mono-indexed edges required for $G$ to admit a weak IASI and is denoted by $\varphi(G)$.

\smallskip

THEOREM 1.5. \cite{GS3} An odd cycle $C_n$ contains odd number of mono-indexed edges and an even cycle contains an even number of mono-indexed edges.

\smallskip

THEOREM 1.6. \cite{GS3} The sparing number of an odd cycle $C_n$ is $1$ and that of an even cycle is $0$.

\smallskip

THEOREM 1.7. \cite{GS3} The sparing number of a bipartite graph is $0$.

\smallskip

THEOREM 1.8. \cite{GS3} The sparing number of a complete graph $K_n$ is $\frac{1}{2}(n-1)(n-2)$.

\smallskip

\noindent Now, recall the definition of graph powers.

\smallskip

DEFINITION 1.9. \cite{BM1} The $r$-th power of a simple graph $G$ is the graph $G^r$ whose vertex set is $V$, two distinct vertices being adjacent in $G^r$ if and only if their distance in $G$ is at most $r$. The graph $ G^2 $ is referred to as the {\em square} of $G$, the graph $ G^3 $ as the {\em cube} of G.

\smallskip

\noindent  The following is an important theorem on graph powers.

\smallskip

THEOREM 1.10. \cite{EWW} If $d$ is the diameter of a graph $G$, then $G^d$ is a complete graph.

\smallskip

\noindent The admissibility of weak IASIs by certain graph classes and graph powers and the determination of their corresponding  sparing numbers have been done in \cite{GS5}, \cite{GS6} and \cite{GS7}. The admissibility of weak IASIs by the graph operations and certain graphs associated with the given IASI graphs have been discussed in \cite{GS0} and \cite{GS4}. As a continuation to these studies, in this paper, we discuss the sparing number of a particular type of graphs obtained by adding some edges to the given graphs according to certain rules.

\section{Sparing Number of the $k$-Sieve of a Graph}

Motivated by the terminology of graph powers, we introduce the notion of a $k$-sieve of a given graph as follows.

\smallskip

DEFINITION 2.1. A {\em $k$-sieve graph} or simply a {\em $k$-sieve} of a given graph $G$, denoted by $G^{(k)}$, is the graph obtained by joining the non-adjacent vertices of $G$ which are at a distance $k$. A cycle obtained by joining two vertices of $G$, which are at a distance $k$ in $G$, is called a {\em $k$-ringlet} of the graph $G$.

\smallskip

Note that every $k$-ringlet of a graph is a cycle of length $k+1$. The number of $k$-ringlets in a graph $G$ is the number of distinct $k$-paths in $G$. The number of edges in $G^{(k)}$ that are not in $G$ is the number $k$-ringlets in $G$.

\smallskip

REMARK 2.2.  Note that $G^{(2)} \cong G^2$, the square of the graph $G$. But, for $k>2$, $G^{(k)}$ and $G^k$ are non-isomorphic graphs. The sparing number of the square of certain graphs are studied in \cite{GS7}. Hence, in this paper, we need to consider $k\ge 3$.

\smallskip

PROPOSITION 2.3. Let $l$  be the length of a maximal path in $G$. If $k>l$, then the sparing number of the $k$-sieve of $G$ is equal to the sparing number of $G$ itself.

\smallskip

PROOF. Given that $l$ is the length of a maximal path in $G$. Hence, for any pair of vertices $x,y$ in $G$, $d(x,y)\le l$. That is, there exists no vertex in $G$ which is at a distance $k$ from another vertex of $G$. Therefore, if $k>l$, then $G^{(k)}\cong G$. Hence, $\varphi(G^{(k)})=\varphi(G)$.

\smallskip

Invoking the above result, we need to consider the integral values between $3$ and $l$, including both, for $k$. If $k=l$, then the longest path of $G$ becomes a cycle of length $l+1$ in $G^{(k)}$.

\smallskip

We now proceed to determine the sparing number of the sieve graphs of certain other standard graphs. Let us begin with the path graphs.

\smallskip

THEOREM 2.4. Let $P_n$ be a path of length $n$. Then, for odd integers $k;~2<k\le n$, the sparing number of $P_n^{(k)}$ is $0$ and for even integer $k; ~2<k\le n$,  the sparing number of $P_n^{(k)}$ is
\begin{equation*}
\varphi(P_n^{(k)})=
\begin{cases}
2(lk+r)-3 & ~\text{if $(lk+r)k+s=n$ where $s\le r-2$ and $r\ge 2$}\\
2(lk+r)-2 & ~\text{if $(lk+r)k+s=n$ where $s=r-1$ and $r\ge 1$}\\
2(lk+r)-1 & ~\text{if $(lk+r)k+s=n$ where $s=r$ and $r\ge 0$}.
\end{cases}
\end{equation*}
where $l,k$ and $s$ are non-negative integers.

\smallskip

PROOF. Let $P_n$ be a path on $n+1$ vertices. Let $V=\{v_1,v_2,v_3,\ldots, v_n, v_{n+1}\}$ be the vertex set of $P_n$. The proof is developed considering various possible  cases as below.

\smallskip

\noindent {\em Case-1:} Let $n$ be an odd integer. Label the vertices of $P_n$ alternately by distinct singleton sets and distinct non-singleton sets. Then, each vertex $v_i$ is adjacent to $v_{i-1}, v_{i+1}$ and to the vertex $v_{i+k}$ in $P_n^{(k)}$. Then, we have the following subcases.

\smallskip

\noindent {\em Subcase-1.1:} If $k=n$, then by Proposition 2.3, $P_n^{(k)}=C_{n+1}$. Since $n$ is odd, $P_n^{(k)}$ is even cycle. Then, by Theorem 1.8, $P_n^{(k)}$ has no mono-indexed edges.

\smallskip

\noindent {\em Subcase-1.2:} Let $k<n$. Then, under the set-labeling we defined above, no two adjacent vertices simultaneously have singleton set-labels or non-singleton set-labels. Therefore, no edge in $P_n^{(k)}$ has no mono-indexed edges. Therefore, $P_n^{(k)}$ has no mono-indexed edges if $k\le n$ is an odd integer.

\smallskip

\noindent {\em Case-2:} Let $n$ be an even integer.

\smallskip

\noindent {\em Subcase-2.1:} If $k=n$, then by Proposition 2.3, $P_n^{(k)}=C_{n+1}$. Since $n$ is even, $P_n^{(k)}$ is odd cycle. Then, by Theorem 1.8, $P_n^{(k)}$ has at least one mono-indexed edge. That is, $\varphi(P_n^{(k)})=1$.

\smallskip

\noindent {\em Subcase-2.2:} Let $k<n$. Then, there exists two integers $r$ and $s$ such that $rk+s\le n$, where $0\le s< k$ and $r=0,1,2,\ldots$. We can label the vertices in such a way that no two adjacent vertices have non-singleton set-labels in the following way.

Label the vertices $v_1,v_3, v_5,\ldots, v_{k-1}$ of $P_n^{(k)}$ by distinct non-singleton sets and label $v_2,v_4,v_6,\ldots, v_k$ by distinct singleton sets. Since $v_{k+1}$ is adjacent to $v_1$, $v_{k+1}$ can be labeled only by a singleton set which is not used for labeling any one of the preceding vertices. Then, the edge $v_kv_{k+1}$ is a mono-indexed edge. If $n\le 2k$, then the only mono-indexed edge in $P_n^{(k)}$ is $v_kv_{k+1}$.

If $n>2k$, label the vertices $v_1, v_2,\ldots, v_{k+1}$ as mentioned above and proceed labeling $v_{k+2}, v_{k+4},\ldots, v_{2k}$ by distinct non-singleton sets, that are not used for labeling before, and the vertices $v_{k+2}, v_{k+4},\ldots, v_{2k}$ by distinct singleton sets that are not used before for labeling. Then, $v_{k+1}v_{2k+1}$ is a mono-indexed edge. Since, $v_{k+2}$ is adjacent to $v_{2k+2}$ must be mono-indexed. Therefore, $v_{2k+1}v_{2k+2}$ is also a mono-indexed edge. Proceeding in this way, we arrive at the following cases.

\begin{enumerate}
\item Let $s\le r-2$. Then, $r\ge 2$. Now, we can find a path $P':v_kv_{k+1}v_{2k+1}v_{2k+2}\\v_{3k+2}v_{3k+3}\ldots\ldots,v_{(r-1)k+(r-2)}v_{(r-1)k+(r-1)}$, all of whose elements have singleton set-labels, containing all the mono-indexed edges of $P_n^{(k)}$. The length of the path $P'$ is $2r-3$.
\item If $s=r-1$, then $r\ge 1$. Now, there exists a path $P'':v_kv_{k+1}v_{2k+1}v_{2k+2}v_{3k+2}\\v_{3k+3}\ldots\ldots, v_{(r-1)k+(r-1)}v_{rk+(r-1)}$, all of whose edges are mono-indexed, containing all the mono-indexed edges of $P_n^{(k)}$. The length of the path $P''$ is $2r-2$.
\item If $s=r$, then the path $P''':v_kv_{k+1}v_{2k+1}v_{2k+2}v_{3k+2}v_{3k+3}\ldots, v_{rk+(r-1)}v_{(r+1)k}$, all of whose edges are mono-indexed, containing all the mono-indexed edges in $P_n^{(k)}$. Therefore, the length of $P'''$ is $2r-1$.
\end{enumerate}

If $r=s=k$, then $rk+s=(k+1)k$ and if $r=lk$ and $s=k$, then $rk+s=(lk+1)k$ and hence we can proceed the labeling procedure in the same manner as explained above. Then, the result follows.

\smallskip

Figure \ref{G-Pn-k-Circ} illustrates a weak IASI for the $4$-sieve of the path of length $16$. The mono-indexed edges are represented in dotted lines.

\begin{figure}[h!]
	\centering
	\includegraphics[scale=0.35]{G-Pn-k-Circ}
	\caption{$4$-sieve of a path with a weak IASI defined on it.}\label{G-Pn-k-Circ}
\end{figure}

\smallskip

The above theorem arouses an interest in determining the sparing number of the $k$-sieve of a cycle. Here, note that a maximal path between any pair of vertices in a cycle $C_n$ is $\lfloor \frac{n}{2} \rfloor$. Therefore, a $k$-sieve exists for $C_n$ if and only if $n\ge 2k+1$. Moreover, $C_{n^(k)}$ is a $4$-regular graph. Then, we have the following results.

\smallskip

THEOREM 2.5. \label{T-Circ-Cyc-E} Let $C_n$ be a Cycle that admits a weak IASI. Then, for an odd integer $k$, $1<k\le l$,
\begin{eqnarray*}
		\varphi(C_n^{(k)})=
		\begin{cases}
			0 & \text{if $C_n$ is an even cycle}\\
			k+1 & \text{if $C_n$ is an odd cycle}.
		\end{cases}
\end{eqnarray*}
where $l$ is the length of a largest path in $G$.

\smallskip

PROOF. Let $k$ be an odd integer. Then, every $k$-subcycle of $C_n^{(k)}$, obtained by joining the vertices of $C_n$ which are at a distance $k$ in $C_n$, is an even cycle of length $k+1$. Let $C'$ be such an even  cycle of length $k+1$ in $C_n^{(k)}$, which has exactly one edge, say $e'$, which is not in $C_n$.

If $C_n$ is an even cycle, then by Theorem 1.6, it need not contain mono-indexed edges. Therefore, as a result of Theorem 1.5, $e'$ can not be mono-indexed. Therefore, $C'$ does not contain any mono-indexed edges.

If $C_n$ is an odd cycle, then by Theorem 1.6, it must have one mono-indexed edge. If $C'$ contains this mono-indexed edge of $C_n$, then as a result of Theorem 1.5, $e'$ must be mono-indexed. There exist such $k$ cycles containing this mono-indexed edge of $C_n$. Therefore, the sparing number of $C_n^{(k)}$ is $k+1$.

\smallskip

Figure \ref{G-Circ-k1} illustrates Theorem \ref{T-Circ-Cyc-E}. The first subfigure is the $3$-sieve of an even cycle with a weak IASI defined on it and the second subfigure  is  $3$-sieve of an odd cycle with a weak IASI on it. Mono-indexed edges in the second graph are represented by dotted lines.

\begin{figure}[h!]
	\centering
	\includegraphics[scale=0.4]{G-Circ-k1}
	\caption{$3$-sieve of $C_{12}$ and a $3$-sieve of $C_{12}$ with weak IASIs defined on them.}\label{G-Circ-k1}
\end{figure}

\smallskip

\noindent Next let us consider the case when $k$ is an even integer.

\smallskip

THEOREM 2.6 \label{T-Circ-Cyc-O} Let $C_n$ be a cycle of length $n$. For an even integer $k; ~2<k\le n$,  the sparing number of $C_n^{(k)}$ is
\begin{equation*}
	\varphi(P_n^{(k)})=
	\begin{cases}
	3 & ~\text{if}~~ $n=2k$\\
	2[(lk+r)-2\,\lfloor \frac{(l-1)k+(r-1)}{2} \rfloor] & ~\text{if}~~ n=lk+r\\
	2l & ~\text{if}~~ $n=l(k+1)$\\
\end{cases}
\end{equation*}
where $l,k$ and $r$ are non-negative integers such that $l\ge 2, r<l$.

\smallskip

PROOF. First let $n=2k$. Then , $C_n^{(k)}$ is a cubic graph. Let us begin the labeling process by labeling the first vertex $v_1$ by a non-singleton set and then label the following vertices alternatively by distinct singleton sets and distinct non-singleton sets. Then, the vertex $v_k$ is a mono-indexed vertex. Being adjacent to the vertex $v_1$, $v_{k+1}$ must also be mono-indexed. That is, the edge $v_kv_{k+1}$ is mono-indexed. Now, label the vertex $v_{k+2}$ by a non-singleton set and then label the following vertices alternatively by distinct singleton sets and distinct non-singleton sets. Here, the vertex $v_{2k-1}$ is mono-indexed. Since, $v_{2k}$ is adjacent to the vertex $v_1$, $v_{2k}$ must be mono-indexed. Therefore, the edge $v_{2k-1}v_{2k}$ is mono-indexed. Also, the edge $v_kv_{2k}$ is also mono-indexed. Therefore, the number mono-indexed edges in this case is $3$.

\smallskip

Note that if $n>2k$ the $k$-sieve of every cycle is a $4$-regular graph, for any integer $k$. Then we have the following cases.

\smallskip

\noindent {\em Case-1:} Assume that $n=lk+r;~r<l$, $l$ and $r$ being positive integers and $l\ge 2$. Then, the total number of edges in $C_n^{(k)}$ is $|E(C_n^{(k)})|=\frac{1}{2}\sum d(v)=2(lk+r)$. Now, label the vertex $v_1$ by a non-singleton set and then label the remaining vertices by distinct singleton sets and distinct non-singleton sets such that no two adjacent vertices have non-singleton set-labels. Then, the last $k+1$ vertices must be $1$-uniform, as each of them are adjacent to one vertex having a non-singleton set-label. Out of the remaining $(l-1)k+(r-1)$ vertices, $\lfloor \frac{(l-1)k+(r-1)}{2} \rfloor$ vertices have non-singleton set-label. The number of edges that are not mono-indexed is $4\,\lfloor \frac{(l-1)k+(r-1)}{2} \rfloor$. The total number of mono-indexed edges is $2[(lk+r)-2\,\lfloor \frac{(l-1)k+(r-1)}{2} \rfloor]$.

\smallskip

\noindent {\em Case-2:} Assume that $n=l(k+1)$, $l$ being a positive integer. Let $\mathfrak{C}$ be a partition of $V(G)$, where each set in $\mathfrak{C}$ contains exactly $k+1$ vertices. Therefore, each set in $\mathfrak{C}$ consists of exactly $\frac{k}{2}$ vertices have non-singleton set-labels and  $1+\frac{k}{2}$ mono-indexed vertices in $C_n^{(k)}$. Therefore, the number of vertices having non-singleton set-labels is $l\frac{k}{2}$. Therefore, the number of edges that are not mono-indexed is $2lk$. The number edges in $C_n^{(k)}$ is $|E(C_n^{(k)})|=\frac{1}{2}\sum d(v)=2l(k+1)$. Therefore, the number of mono-indexed edges in $C_n^{(k)}$ is $2l(k+1)-2lk=2l$.

\smallskip

Figure \ref{G-Cyc-k-Circ1} illustrates a weak IASI for the $4$-sieve of a cycle on $20$ vertices.

\begin{figure}[h!]
	\centering
	\includegraphics[scale=0.3]{G-Cyc-k-Circ1}
	\caption{$4$-sieve of $C_{20}$ which is a weak IASI graph.}\label{G-Cyc-k-Circ1}
\end{figure}

\smallskip

\section{Conclusion}
It can be observed that a complete graph $K_n$ can have a $k$-sieve graph as every vertex of $K_n$ is at a distance $1$ from all other vertices of $G$. Similarly, a complete bipartite graph $K_{m,n}$ (or a complete $r$-partite graph, $K_{n_1,n_2,\ldots,n_r}$, for $r>2$) also does have a $k$-sieve graph, for $k\ge 3$, as any two vertices in $K_{m,n}$ (or in $K_{n_1,n_2,\ldots,n_r}$)are at a distance at most $2$.

Let $k$ be an odd integer. If $G$ be a tree, then $G^{(k)}$ is a graph all of whose cycles are of length $k+1$, an even integer. Then, $G^{(k)}$ is a bipartite graph. Therefore, by Theorem 1.7, the number of mono-indexed edges in $G^{(k)}$ is also $0$.

If $G$ be a bipartite graph (containing cycles), then $G$ has no odd cycles. Then, since every $k$-ringlet of $G$ is an even cycle, every cycle in $G^{(k)}$ is of even length. Therefore, $G^{(k)}$ is also a bipartite graph, for odd $k$. Therefore, by Theorem 1.7, the number of mono-indexed edges in $G^{(k)}$ is also $0$.

But, for even integers $k$, to determine the sparing number of $G^{(k)}$, for a graph $G$ which is bipartite (cyclic or acyclic), we need to use Theorem 2.4, Theorem 2.5 and Theorem 2.6, for distinct paths and cycles in $G$.

Evaluating the sparing number of the $k$-sieves of bipartite graphs, Eulerian graphs, armed crown graphs etc. are some of the open problems in this area. Determining the sparing number of the $k$-sieves of graph operations and graph products are also worth for further exploration.

More properties and characteristics of weak IASIs, both uniform and non-uniform, are yet to be investigated. The problems of establishing the necessary and sufficient conditions for various graphs and graph classes to have certain IASIs still remain to be settled. All these facts highlight a great scope for further studies in this area.

\smallskip

\section*{Acknowledgement}

The authors gratefully acknowledge the critical comments and suggestions the anonymous referee, which helped to improve the quality of the paper.

redpajama_set_name: RedPajamaArXiv


During Real Madrid's 4-0 semifinal drubbing of Bayern Munich Tuesday, star winger Cristiano Ronaldo capped an historic Champions League season with a new world record. Scoring twice against Bayern, the Portuguese international now owns 16 goals in this year's competition. That breaks the record for most goals in a single Champions League/European Cup season. With still the final to be played at the end of May, Ronaldo nipped the record 14 held jointly by Lionel Messi for Barcelona in 2012 and Mizzola for Milan in 1963.
Not surprisingly, their talisman's top form has Madrid in record-breaking spirits, too. Real is into its first final since 2002 on the strength of a new record for the most consecutive Champions League games scoring a goal, at 34 straight matches from May 3, 2011, to April 2 in its 3-0 quarterfinal win over Borussia Dortmund.
There were a lot of great sports records both featured elsewhere on our site earlier this month or awarded many months ago that are certainly worth checking out if you haven't already.
Keeping it with soccer, São Paulo FC keeper Rogério Ceni was awarded three Guinness World Records achievements last November, but was finally able to be presented his official record-holder certificates just this month (there he is pictured above). Ceni owns the records for most football/soccer appearances for the same club at 1,100; most appearances as captain for the same club with 885; and most career goals scored by a keeper with 114.
Then here are two stories you may have missed earlier in April. First, Guinness World Records' partnership with the Virgin Money London Marathon continued, resulting in a number of awesome marathon records broken this year. From fastest in a wedding dress to fastest in nurse's uniform, check out all the competitors here.
He loves it when you call him Big Papi. H/T to Tater Trot Tracker, who revealed this month that Boston Red Sox slugger David Ortiz's home run stroll April 10 is the slowest home run trot on record. Watch all 32.91 glorious seconds here.
Bernard Hopkins continues to show at 49 years old that you're only as old as you punch, becoming the oldest boxer to unify two world titles with his split-decision win over Beibut Shumenov in Washington D.C. ...Knicks fans, remove palm from face: J.R. Smith broke the record for most 3s attempted in an NBA game this month, launching 22 against Houston. ...And we couldn't verify this record in time for the March Sports Blog, but the most consecutive football/soccer victories in a national top division by a female team is 80 by Apollon Ladies FC in the Cypriot First Division from April 22, 2009, to March 30 this year.
That wraps up April! We'll find out in May if Ronaldo can extend his Champions League record, if Luis Suarez can break a Premier League goals record, and if David Ortiz can possibly run any slower. See you next month!


This is the eleven in the series of thirteen paintings picturing the musical works of four Antonio Vivaldi's popular concertos: RV 269, RV 315, RV 293, RV 297, which together make up The Four Seasons. This huge artwork, over 17 feet in length, was tough to photograph, but I needed to document the visual progress, and this first photo fulfills that need. Turning around and looking at the real artwork, it is much prettier in person, and already presenting a dramatic image.
In the photograph you are not seeing the contrast between the stripping and the background where I first spread a light gray layer. Over that I then pulled across multiple thin layers of pure white. I am using an image of pure white snow, in this artwork, for we have received plenty of that, lately. My challenge, with this work, is to display this feeling of fresh snow cover across the entire seventeen feet of canvas that is Winter Allegro, creating diversity and multiple areas of interest.
Starting with a light gray background gives me the contrast to build up an image on white canvas. Somehow I will use this same technique for the rest of the bare canvas, and besides using gray, I will need to find ways to add color in the background. Lately, with my backgrounds I have used a lot of stripping for its musical effects and interest adding looks, and that should work here by using cold blues mixed with a lot of white. I have used so much white that I ran out of it, and had to pick up some locally, 40% off, of course.
The capturing of that winter feeling, for this artwork, is a lot easier to do while living in the season. Actually, I try to do that as much as I can with this series. For example my last Vivaldi was the last movement of Autumn, and now I am, of course, working on the first movement of Winter. When I compete this work, next up will be the first movement of Spring, followed by the final artwork in this series, the third movement of Summer, sometime this summer.
Up next, I am turning around getting up from my computer, putting on my apron, and hopefully before nights end covering up the rest of the white canvas with white paint.
~ by Scott Von Holzen on 01/18/2014.


text:
FORTMI
Information Arena
Most Dangerous Man In The World
Leave a Comment / Information Arena, Lifestyle / By Fortmi
10 Most dangerous people in the World: Natural disasters like earthquakes, flooding, volcanoes, storms, and other natural disasters aren't always the only risks. On the other hand, it can pose a danger to the safety of those around them.
Dangerous men appear from the middle of nowhere. He was a child influenced by changes in the environment and mental health.
Who would have thought that a sweet child would become one of the most dangerous men? In terms of becoming an individual rescuer, according to his criteria, A dangerous person has a remarkably high level of self-esteem. They are regarded as criminals. International penal institutions want them.
Harold Shipman, dubbed "Dr. Death" for the murder of 218 victims, is among the most savage people ever lived.
As a favored British doctor, a married husband could complete 218 murders credited as his own while working as one of the world's most deadly serial murderers.
If you're interested in learning more about this subject, check through this listing of the most dangerous individuals in the world.
World's Most Dangerous People 2022
1. Ayman al-Zawahiri: Co-founder of Al-Qaeda and the current leader of the border between Afghanistan and Pakistan. His goal and goals are to retaliate against Christian and Jewish crimes against Muslims throughout history and establish a single Islamic political system throughout the Arab world. Also, to force non-Muslims out of Saudi Arabia, where the holy places of Islam are.
In addition to promoting the killing of non-Muslims, the jihadist has recently dispatched soldiers to Syria and has tried to convince ISIS to join with other jihadists to fight the false coalition of America, Russia, Europe, Shiites, and Iran, as well as Bashar al-Alawite's Assad's repressive regime.
2. Cody Wilson: Cody Wilson has already made an image for himself by working on many of the most well-known digital projects. Wilson gained notoriety by creating the Liberator, the first 3D-printed pistol to be produced worldwide.
Most Dangerous People in the World
He would like to allow anyone, no matter where on the planet, to create a deadly plastic weapon with just a click.
Wilson could be investigated over the alleged illegal export of weapons, and if found guilty, the accused could face up to seven years in prison. The sentence could be increased if it can be proven that his actions caused grave danger for " US national and regional security interests."
3. Yaser Abdel Said: Said is a former driver of a cab in Egypt that is suspected of murder. Said was born on January 27th, 1957. He is an FBI wanted person to be charged with involvement in the deaths of two of his adolescent children on January 1st, 2008. He was within Irving, Texas, at the time of the incident.
See also Parliamentary System Of Government: Meaning, Features, Merits And Demerits
The most dangerous men currently.
Said was eluded for 12 years after the murders of his daughters Amina (18) and Sarah (17) in the early morning of January 1st, 2008. Their bodies were found in an abandoned taxi at the Omni Mandalay Hotel (now the Omni Las Colinas Hotel) in Irving, Texas.
Said was arrested immediately in Justin, Texas, on August 26th and August 26th, 2020. Justin, Texas. Northern District of Texas will be the location for his trial on charges of " Unlawful Flight to Avoid Prosecution."
4. Semion Mogilevich: Ukrainian-born criminal lord is believed as"the "boss of bosses" of the largest Russian Mafia syndicates operating across borders.
Their main goals of his are power and money. To get these, he indulges in drug trafficking, the trade in nuclear materials, contract killings, and international prostitution.
To make sure that money continues to flow To keep the money flowing, he's set up more than 100 front companies as well as bank accounts across 27 countries.
2008 was the first time Russian police detained Mogelivich for tax evasion of a cosmetics business, Arbat Prestige, using one of his many pseudonyms, Sergei Schneider. The fees were removed three years after. The FBI has him on its wanted list due to his involvement in a fraudulent $150 million scheme.
5. The Bomb-Maker Extraordinaire Ibrahim Al-Asiri is a Saudi fighter who is also al-Qaida's bomb maker. He uses PETN to create explosives that X-ray scanners cannot detect. In 2009, he was believed to have made the 'underwear' underwear bomb, which was used to strike a plane bound for the United States.
See also Leadership And Followership: Meaning, Types And Qualities
The most serious offense is that he's educating his al-Qaida-trained associates, which prompted authorities in the US to announce " credible threat" warnings in July 2014, resulting in increased security for every direct flight.
6. Abu Bakr Al-Baghdadi (Isis ): Leader of the Islamic State of Iraq and Syria. He wanted to establish the country's Islamic state (or Caliphate) across northern Syria and eastern Iraq and be known as Caliph Ibrahim. They isto which all Muslims will pledge their allegiance. Isis also has a 5-year " expansion plan" which covers the Middle East, the Arabian Peninsula, Northern Africa, Afghanistan, Pakistan, and India.
The most dangerous human being on the planet
Al-Qaida cut off its connections to Isis earlier this year due to the violence. However, the group has since taken over 50 percent of Iraq. It is enforcing the strict Wahhabi version that is the basis of Islam and implementing a strict version of Sharia law in these regions.
7. Joseph Kony: Former Lord's Resistance Army (LRA) commander. He wants an oligarchic state built in the Ten Commandments and the Alcholi tradition.
Government officials have claimed Kony directed the kidnapping and kidnappings of children to convert them into child soldiers and sexual slaves. Sixty-six thousand children enlisted in the army.
Between 1986 and 2009, two million people were forced to relocate internally. In 2009, the International Criminal Court in The Hague, Netherlands, accused Kony in 2005 of war crimes and crimes against humanity, but he's evaded his arrest.
The LRA has been repelled from The United States, and many of Kony's army has deserted the group. Kony is believed to be ill, and if the pressure to disband the LRA and negotiate his surrender remains, Kony will be arrested.
8. El Mayo Ismael Zambada (drug boss from the Sinaloa cartel ): His goal is to secure his status as the chief of a multibillion-dollar crime ring. He is involved in the trade of Narcos between the United States and Europe, money laundering, and an incredibly lucrative kidnapping smuggling sideline. The Sinaloa cartel's strength is enhanced by the gruesome mass executions of civilians and gangs of rivals to ensure loyalties.
See also Poem - I Know Why The Caged Bird Sings By Maya Angelou
According to the House Committee on Homeland Security, the cartel's communication network has been hacked. This is how the former cartel leader, Joaquin El Chapo Guzman, was rescued after 13 years of being on the run.
9. Matteo Messina Denaro Diabolik The Mafia leader is determined to correct the wrongs committed towards the weak and the marginalized and make a lot of cash.
It could be why this man is among the most dangerous people on earth And do you know how he manages to achieve this? He simply joins any profitable company, including food delivery services, wind farms, and agriculture. They're so big that it's hard to determine which part of the budget for western Sicily ends and the jurisdiction of his begins.
In the early 1990s, he participated in a bombing operation run in the early 1990s by The Sicilian mafia. This led to the deaths of onlookers and magistrates from Sicily, Rome, and Florence, along with fifty other people.
10. Mokhtar Belmokhtar Al-Qaida affiliated Al-Mourabitoun is run by an Algerian jihadist. He aims to transform al-Qaida into a global terrorist organization that can carry out attacks all over Western Europe and operates from coast to coast across Africa.
He is Mr. Marlboro recruits foreign jihadis returning from Syria to launch new terror attacks. The illegal tobacco trade funds these.
He is believed to be responsible for the attack that targeted an Algerian gas station in 2000, where 40 hostages were murdered, and an Eiffel Tower recently exposed as a terror plot.
After surviving a gunfight with counter-terrorism officers defending him, his supporters called the jihadist "The Uncatchable." "Similar attacks will be launched within Libyan borders, where Belmokhtar is believed to be," said Mokhtar Belhasinwho, an expert in jihadist movements.
Dangerous people always have a motive for doing the things they do. They think they are correcting injustices and reaching higher goals; however, in the final analysis, danger and crime are inextricably tied to financial aid in a chaotic society. If people with shaky minds and distorted beliefs are allowed to roam freely and roam around, they can harm society and the entire world.
Please Help Us By Sharing:
Copyright © 2023 FORTMI | Powered by Astra WordPress Theme
Afrikaans Amharic Arabic Bengali Bulgarian Catalan Chinese (Simplified) Czech Dutch English Filipino French Frisian German Greek Gujarati Hausa Hebrew Hindi Igbo Indonesian Italian Japanese Kannada Korean Latin Malay Malayalam Marathi Norwegian Persian Polish Portuguese Punjabi Romanian Russian Sinhala Spanish Swahili Tamil Telugu Thai Turkish Ukrainian Urdu Vietnamese Yoruba Zulu