1,775 Matching Annotations
  1. Last 7 days
    1. 2023 haben Böden und Landpflanzen fast kein CO2 absorbiert. Dieser Kollaps der Landsenken vor allem durch Dürren und Waldbrände wurde in diesem Ausmaß kaum vorausgesehen, und es ist nicht klar, ob auf ihn eine Regeneration folgt. Er stellt Klimamodelle ebenso in Frage wie die meisten nationalen Pläne zum Erreichen von CO2-Neutralität, weil sie auf natürlichen Senken an Land beruhen. Es gibt Anzeichen dafür, dass die steigenden Temperaturen inzwischen auch die CO2-Aufnahmefähigkeit der Meere schwächen. Überblicksartikel mit Links zu Studien https://www.theguardian.com/environment/2024/oct/14/nature-carbon-sink-collapse-global-heating-models-emissions-targets-evidence-aoe

  2. Oct 2024
    1. if (dtc->wb_thresh < 2 * wb_stat_error()) { wb_reclaimable = wb_stat_sum(wb, WB_RECLAIMABLE); dtc->wb_dirty = wb_reclaimable + wb_stat_sum(wb, WB_WRITEBACK); } else { wb_reclaimable = wb_stat(wb, WB_RECLAIMABLE); dtc->wb_dirty = wb_reclaimable + wb_stat(wb, WB_WRITEBACK); }

      This is a configuration policy that does a more accurate calculation on the number of reclaimable pages and dirty pages when the threshold for the dirty pages in the writeback context is lower than 2 times the maximal error of a stat counter.

    2. static long wb_min_pause(struct bdi_writeback *wb, long max_pause, unsigned long task_ratelimit, unsigned long dirty_ratelimit, int *nr_dirtied_pause

      This function is an algorithmic policy that determines the minimum throttle time for a process between consecutive writeback operations for dirty pages based on heuristics. It is used for balancing the load of the I/O subsystems so that there will not be excessive I/O operations that impact the performance of the system.

    3. if (!laptop_mode && nr_reclaimable > gdtc->bg_thresh && !writeback_in_progress(wb)) wb_start_background_writeback(wb);

      This is a configuration policy that determines whether to start background writeout. The code here indicates that if laptop_mode, which will reduce disk activity for power saving, is not set, then when the number of dirty pages reaches the bg_thresh threshold, the system starts writing back pages.

    4. if (thresh > dirty) return 1UL << (ilog2(thresh - dirty) >> 1);

      This implements a configuration policy that determines the interval for the kernel to wake up and check for dirty pages that need to be written back to disk.

    5. limit -= (limit - thresh) >> 5;

      This is a configuration policy that determines how much should the limit be updated. The limit controls the amount of dirty memory allowed in the system.

    6. if (dirty <= dirty_freerun_ceiling(thresh, bg_thresh) && (!mdtc || m_dirty <= dirty_freerun_ceiling(m_thresh, m_bg_thresh))) { unsigned long intv; unsigned long m_intv; free_running: intv = dirty_poll_interval(dirty, thresh); m_intv = ULONG_MAX; current->dirty_paused_when = now; current->nr_dirtied = 0; if (mdtc) m_intv = dirty_poll_interval(m_dirty, m_thresh); current->nr_dirtied_pause = min(intv, m_intv); break; } /* Start writeback even when in laptop mode */ if (unlikely(!writeback_in_progress(wb))) wb_start_background_writeback(wb); mem_cgroup_flush_foreign(wb); /* * Calculate global domain's pos_ratio and select the * global dtc by default. */ if (!strictlimit) { wb_dirty_limits(gdtc); if ((current->flags & PF_LOCAL_THROTTLE) && gdtc->wb_dirty < dirty_freerun_ceiling(gdtc->wb_thresh, gdtc->wb_bg_thresh)) /* * LOCAL_THROTTLE tasks must not be throttled * when below the per-wb freerun ceiling. */ goto free_running; } dirty_exceeded = (gdtc->wb_dirty > gdtc->wb_thresh) && ((gdtc->dirty > gdtc->thresh) || strictlimit); wb_position_ratio(gdtc); sdtc = gdtc; if (mdtc) { /* * If memcg domain is in effect, calculate its * pos_ratio. @wb should satisfy constraints from * both global and memcg domains. Choose the one * w/ lower pos_ratio. */ if (!strictlimit) { wb_dirty_limits(mdtc); if ((current->flags & PF_LOCAL_THROTTLE) && mdtc->wb_dirty < dirty_freerun_ceiling(mdtc->wb_thresh, mdtc->wb_bg_thresh)) /* * LOCAL_THROTTLE tasks must not be * throttled when below the per-wb * freerun ceiling. */ goto free_running; } dirty_exceeded |= (mdtc->wb_dirty > mdtc->wb_thresh) && ((mdtc->dirty > mdtc->thresh) || strictlimit); wb_position_ratio(mdtc); if (mdtc->pos_ratio < gdtc->pos_ratio) sdtc = mdtc; }

      This is an algorithmic policy that determines whether the process can run freely or a throttle is needed to control the rate of the writeback by checking if the number of dirty pages exceed the average of the global threshold and background threshold.

    7. shift = dirty_ratelimit / (2 * step + 1); if (shift < BITS_PER_LONG) step = DIV_ROUND_UP(step >> shift, 8); else step = 0; if (dirty_ratelimit < balanced_dirty_ratelimit) dirty_ratelimit += step; else dirty_ratelimit -= step;

      This is a configuration policy that determines how much we should increase/decrease the dirty_ratelimit, which controls the rate that processors write dirty pages back to storage.

    8. ratelimit_pages = dirty_thresh / (num_online_cpus() * 32); if (ratelimit_pages < 16) ratelimit_pages = 16;

      This is a configuration policy that dynamically determines the rate that kernel can write dirty pages back to storage in a single writeback cycle.

    9. t = wb_dirty / (1 + bw / roundup_pow_of_two(1 + HZ / 8));

      This implements a configuration policy that determines the maximum time that the kernel should wait between writeback operations for dirty pages. This ensures that dirty pages are flushed to disk within a reasonable time frame and control the risk of data loss in case of a system crash.

    10. if (IS_ENABLED(CONFIG_CGROUP_WRITEBACK) && mdtc) {

      This is a configuration policy that controls whether to update the limit in the control group. The config enables support for controlling the writeback of dirty pages on a per-cgroup basis in the Linux kernel. This allows for better resource management and improved performance.

    1. if (si->cluster_info) { if (!scan_swap_map_try_ssd_cluster(si, &offset, &scan_base)) goto scan; } else if (unlikely(!si->cluster_nr--)) {

      Algorithmic policy decision: If SSD, use SSD wear-leveling friendly algorithm. Otherwise, use HDD algo which minimizes seek times. Potentially, certain access patterns may make one of these algorithms less effective (i.e. in the case of wear leveling, the swap is constantly full)

    2. scan_base = offset = si->lowest_bit; last_in_cluster = offset + SWAPFILE_CLUSTER - 1; /* Locate the first empty (unaligned) cluster */ for (; last_in_cluster <= si->highest_bit; offset++) { if (si->swap_map[offset]) last_in_cluster = offset + SWAPFILE_CLUSTER; else if (offset == last_in_cluster) { spin_lock(&si->lock); offset -= SWAPFILE_CLUSTER - 1; si->cluster_next = offset; si->cluster_nr = SWAPFILE_CLUSTER - 1; goto checks; } if (unlikely(--latency_ration < 0)) { cond_resched(); latency_ration = LATENCY_LIMIT; } }

      Here, (when using HDDs), a policy is implemented that places the swapped page in the first available slot. This is supposed to reduce seek time in spinning drives, as it encourages having swap entries near each other.

    3. /* * Even if there's no free clusters available (fragmented), * try to scan a little more quickly with lock held unless we * have scanned too many slots already. */ if (!scanned_many) { unsigned long scan_limit; if (offset < scan_base) scan_limit = scan_base; else scan_limit = si->highest_bit; for (; offset <= scan_limit && --latency_ration > 0; offset++) { if (!si->swap_map[offset]) goto checks; } }

      Here we have a configuration policy where we do another smaller scan as long as we haven't exhausted our latency_ration. Another alternative could be yielding early in anticipation that we aren't going to find a free slot.

    4. /* * select a random position to start with to help wear leveling * SSD */ for_each_possible_cpu(cpu) { per_cpu(*p->cluster_next_cpu, cpu) = get_random_u32_inclusive(1, p->highest_bit); }

      An algorithmic (random) policy is used here to spread swap pages around an SSD to help with wear leveling instead of writing to the same area of an SSD often.

    5. cluster_list_add_tail(&si->discard_clusters, si->cluster_info, idx);

      A policy decision is made to add a cluster to the discard list on a first-come, first-served basis. However, this approach could be enhanced by prioritizing certain clusters higher on the list based on their 'importance.' This 'importance' could be defined by how closely a cluster is related to other pages in the swap. By doing so, the system can reduce seek time as mentioned on line 817.

    6. if (unlikely(--latency_ration < 0)) { cond_resched(); latency_ration = LATENCY_LIMIT; scanned_many = true; } if (swap_offset_available_and_locked(si, offset)) goto checks; } offset = si->lowest_bit; while (offset < scan_base) { if (unlikely(--latency_ration < 0)) { cond_resched(); latency_ration = LATENCY_LIMIT; scanned_many = true; }

      Here, a policy decision is made to fully replenish the latency_ration with the LATENCY_LIMIT and then yield back to the scheduler if we've exhausted it. This makes it so that when scheduled again, we have the full LATENCY_LIMIT to do a scan. Alternative policies could grow/shrink this to find a better heuristic instead of fully replenishing each time.

      Marked config/value as awe're replacing latency_ration with a compiletime-defined limit.

    7. while (scan_swap_map_ssd_cluster_conflict(si, offset)) { /* take a break if we already got some slots */ if (n_ret) goto done; if (!scan_swap_map_try_ssd_cluster(si, &offset, &scan_base)) goto scan;

      Here, a policy decision is made to stop scanning if some slots were already found. Other policy decisions could be made to keep scanning or take into account how long the scan took or how many pages were found.

    8. else if (!cluster_list_empty(&si->discard_clusters)) { /* * we don't have free cluster but have some clusters in * discarding, do discard now and reclaim them, then * reread cluster_next_cpu since we dropped si->lock */ swap_do_scheduled_discard(si); *scan_base = this_cpu_read(*si->cluster_next_cpu); *offset = *scan_base; goto new_cluster;

      This algorithmic policy discards + reclaims pages as-needed whenever there is no free cluster. Other policies could be explored that do this preemptively in order to avoid the cost of doing it here.

    9. #ifdef CONFIG_THP_SWAP

      This is a build-time flag that configures how hugepages are handled when swapped. When defined, it swaps them in one piece, while without it splits them into smaller units and swaps those units.

    10. if (swap_flags & SWAP_FLAG_DISCARD_ONCE) p->flags &= ~SWP_PAGE_DISCARD; else if (swap_flags & SWAP_FLAG_DISCARD_PAGES) p->flags &= ~SWP_AREA_DISCARD

      This is a configuration policy decision where a sysadmin can pass flags to sys_swapon() to control the behavior discards are handled. If DISCARD_ONCE is set, a flag which "discard[s] swap area at swapon-time" is unset, and if DISCARD_PAGES is set, a flag which "discard[s] page-clusters after use" is unset.

    1. randomize_stack_top

      This function uses a configuration policy to enable Address Space Layout Randomization (ASLR) for a specific process if PF_RANDOMIZE flag is set. It randomly arranges the positions of stack of a process to help defend certain attacks by making memory addresses unpredictable.

    1. if (prev_class) { if (can_merge(prev_class, pages_per_zspage, objs_per_zspage)) { pool->size_class[i] = prev_class; continue; } }

      This is an algorithmic policy. A zs_pool maintains zs_pages of different size_class. However, some size_classes share exactly same characteristics, namely pages_per_zspage and objs_per_zspage. Recall the other annotation of mine, it searched free zspages by size_class: zspage = find_get_zspage(class);. Thus, grouping different classes improves memory utilization.

    2. zspage = find_get_zspage(class); if (likely(zspage)) { obj = obj_malloc(pool, zspage, handle); /* Now move the zspage to another fullness group, if required */ fix_fullness_group(class, zspage); record_obj(handle, obj); class_stat_inc(class, ZS_OBJS_INUSE, 1); goto out; }

      This is an algorithmic policy. Instead of immediately allocating new zspages for each memory request, the algorithm first attempts to find and reuse existing partially filled zspages from a given size class by invoking the find_get_zspage(class) function. It also updates the corresponding fullness groups.

    1. 1

      This is a configuration policy that sets the timeout between retries if vmap_pages_range() fails. This could be tunable variable.

    2. if (!(flags & VM_ALLOC)) area->addr = kasan_unpoison_vmalloc(area->addr, requested_size, KASAN_VMALLOC_PROT_NORMAL);

      This is an algorithmic policy. This is an optimization that prevents duplicate marks of accessibility. Only pages allocated without VM_ALLOC (e.g. ioremap) was not set accessible (unpoison), thus requiring explicit setting here.

    3. 100U

      This is an configuration policy that determines 100 pages are the upper limit for the bulk-allocator. However, the implementation of alloc_pages_bulk_array_mempolicy does not explicitly limit in the implementation. So I believe it is an algorithmic policy related to some sort of optimization.

    4. if (!order) {

      This is an algorithmic policy determines that only use the bulk allocator for order-0 pages (non-super pages). Maybe the bulk allocator could be applied to super pages to speed up allocation. Currently I haven't seen the reason why it cannot be applied.

    5. if (likely(count <= VMAP_MAX_ALLOC)) { mem = vb_alloc(size, GFP_KERNEL); if (IS_ERR(mem)) return NULL; addr = (unsigned long)mem; } else { struct vmap_area *va; va = alloc_vmap_area(size, PAGE_SIZE, VMALLOC_START, VMALLOC_END, node, GFP_KERNEL, VMAP_RAM); if (IS_ERR(va)) return NULL; addr = va->va_start; mem = (void *)addr; }

      This is an algorithmic policy that determines whether to use a more efficient vl_alloc which does not involve complex virtual-to-physical mappings. Unlike the latter alloc_vmap_area, vb_alloc does not need to traverse the rb-tree of free vmap areas. It simply find a larger enough block from vmap_block_queue.

    6. VMAP_PURGE_THRESHOLD

      The threshold VMAP_PURGE_THRESHOLD is a configuration policy that could be tuned by machine learning. Setting this threshold lower reduces purging activities while setting it higher reduces framentation.

    7. if (!(force_purge

      This is an algorithmic policy that prevents purging blocks with considerable amount of "usable memory" unless requested with force_purge.

    8. resched_threshold = lazy_max_pages() << 1;

      The assignment of resched_threshold and lines 1776-1777 are configuration policies to determine fewer than which number of lazily-freed pages it should yield CPU temporarily to higher-priority tasks.

    9. log = fls(num_online_cpus());

      This heuristic scales lazy_max_pages logarithmically, which is a configuration policy. Alternatively, machine learning could determine the optimal scaling function—whether linear, logarithmic, square-root, or another approach.

    10. 32UL * 1024 * 1024

      This is a configuration policy that decides to always returns multiples of 32 MB worth of pages. This could be a configurable variable rather than a fixed magic number.

  3. Sep 2024
    1. if (lruvec->file_cost + lruvec->anon_cost > lrusize / 4) { lruvec->file_cost /= 2; lruvec->anon_cost /= 2; }

      It is a configuration policy. The policy here is to adjust the cost of current page. The cost means the overhead for kernel to operate the page if the page is swapped out. Kernel adopts a decay policy. Specifically, if current cost is greater than lrusize/4, its cost will be divided by 2. If kernel has no this policy, after a long-term running, the cost of each page is very high. Kernel might mistakenly reserve pages which are frequently visited long time ago but are inactive currently. It might cause performance degradation. The value (lrusize/4) here has a trade-off between performance and sensitivity. For example, if the value is too small, kernel will frequently adjust the priority of each page, resulting in process's performance degradation. If the value is too large, kernel might be misleaded by historical data, causing wrongly swapping currently popular pages and further performance degradation.

    2. if (megs < 16) page_cluster = 2; else page_cluster = 3;

      It is a configuration policy. The policy here is to determine the size of page cluster. "2" and "3" is determined externally to the kernel. Page cluster is the actual execution unit when swapping. If the machine is small-memory, kernel executes swap operation on 4 (2^2) pages for each time. Otherwise, kernel operats 8 (2^3) for each time. The rational here is to avoid much memory pressure for small-memory system and to improve performance for large-memory system.

    1. mod_memcg_page_state(area->pages[i], MEMCG_VMALLOC, 1);

      It is a configuration policy. It is used to count the physical page for memory control group. The policy here is one physical page corresponds to one count to the memory control group. If using huge page, the value here might not be 1,

    2. schedule_timeout_uninterruptible(1);

      It is a configuration policy. If kernel cannot allocate an enough virtual space with alignment, while nofail is specified to disallow failure, the kernel will let the process to sleep for 1 time slot. In this period, the process cannot be interrupted and quit the schedule queue of CPU. The "1" here is a configuration parameter, made externally to the kernel. It is not large enough for latency-sensitive process and is not small enough to retry frequently.

    3. if (array_size > PAGE_SIZE) { area->pages = __vmalloc_node(array_size, 1, nested_gfp, node, area->caller); } else { area->pages = kmalloc_node(array_size, nested_gfp, node); }

      It is an algorithmic policy and also a configuration policy. The algorithmic policy here is to maxmize the data locality of virtual memory address, by letting the space be in continuous virtual pages. If the demanded size of virtual memory is larger than one page, the kernel will allocate multiple continuous pages for it by using __vmalloc_node(). Otherwise, the kernel will call kmalloc_node() to place it in a single page. On the other hand, to allocate continuous pages, we should invoke __vmalloc_node() by declaring align = 1, which is a configuration policy.

    4. if (!counters) return; if (v->flags & VM_UNINITIALIZED) return;

      It is an algorithmic policy. The show_numa_info() is used for printing how the virtual memory of v (vm_struct) distributes its pages across numa nodes. The two if conditions are used for filtering the invalid v. The first if means the virtual memory has not been associated with physical page. The second if means the virtual memory has not been initialized yet.

    5. if (page) copied = copy_page_to_iter_nofault(page, offset, length, iter); else copied = zero_iter(iter, length);

      It is an algorithmic policy. The policy here is to avoid lock/unlock overhead by using copy_page_to_iter_nofault() function plus if-else branch. Because copy_page_to_iter_nofault() is based on no page fault, we need to check the physical page is still alive. So the kernel uses an if condition to guarantee copy_page_to_iter_nofault() without page fault. On the other hand, if the page is not valid, kernel chooses to fill the iter using zero value instead of returning an error. I think it is because it can make invocation more convenient. The caller does not need to do a verification of the return value and does not need further actions to handle it.

    6. if (base + last_end < vmalloc_start + last_end) goto overflow; /* * Fitting base has not been found. */ if (va == NULL) goto overflow;

      It is an algorithmic policy. The two if conditions are used for checking the feasibility of the allocation. The first if means the adress of the allocation is beyond the allowable address, causing overflow. In this case, since the base address is decided from higher one to smaller one, reducing base address cannot work. Note that the base address is dependent on the va. The second if means we don't find a valid va which has appropriate base address. So the policy here is going to overflow branch to re-allocate va list.

    7. if (base + start < va->va_start) { va = node_to_va(rb_prev(&va->rb_node)); base = pvm_determine_end_from_reverse(&va, align) - end; term_area = area; continue; }

      It is an algorithmic policy. It is used for checking whether the start address of current va is valid. The policy here is to change a new va, different from the solution of "end address check" (explained in my other annotation). The reason is that we find the base address from high address to low address. If we continue to reduce the base address, the if condition will be always wrong. Changing a new va with a lower start address is the only solution.

    8. if (base + end > va->va_end) { base = pvm_determine_end_from_reverse(&va, align) - end; term_area = area; continue; }

      It is an algorithmic policy. The outer loop is an endless loop until finding a vaild virtual memory space satisfying the requirements. The if condition here is used to guarantee the space in va is large enough. If not, we continue to scan the memory space from high address to low address while satisfying the alignment requirement. Specifically, tuning the base address to a lower address. And then, it will retry for verification.

    9. va = kmem_cache_zalloc(vmap_area_cachep, GFP_NOWAIT); if (WARN_ON_ONCE(!va)) continue;

      It is an algorithmic policy. The for loop is used for transferring the virtual memory managment by using from vm_struct (link list) to vm_area (tree?). Inside the for loop, if we cannot allocate a new vmap_area from vmap_area_cachep (va = NULL), the program will simply print a warning and skip current tmp, instread of retry or anything to guarantee the integrity.

    10. if (!spin_trylock(&vmap_area_lock)) return false;

      It is an algorithmic policy. The vmalloc_dump_obj() function is used for printing the information of specified virtual memory. Due to concurrency, before manipulating the critical state, we must obtain the lock. The policy here is spin_trylock. It only tries once. If fails, the function will simply returns false. I think the policy here is to avoid long-term waiting to improve the performance.

    1. static inline unsigned int calc_slab_order(unsigned int size, unsigned int min_order, unsigned int max_order, unsigned int fract_leftover) { unsigned int order; for (order = min_order; order <= max_order; order++) { unsigned int slab_size = (unsigned int)PAGE_SIZE << order; unsigned int rem; rem = slab_size % size; if (rem <= slab_size / fract_leftover) break; } return order; }

      Code to choose how many pages to allocate for a new slab to minimize wasted space from the remainder

    1. Der neue französische Premierminister Michel Barnier hat in seiner Zeit als Umweltminister wesentlich dazu beigetragen, das Vorsorgeprinzip und die finanzielle Verantwortung der Verschmutzenden für Schäden im Umweltrecht zu verankern. Obwohl er zu Amtsbeginn auch von der „ökologischen Schuld" gesprochen hat, erwarten NGOs und Thinktanks, deren Vertreter:innen die Libération befragt hat, allenfalls vorsichtige umweltpolitische Schritte und eine insgesamt restriktive Ausgabenpolitik von ihm.https://www.liberation.fr/environnement/le-premier-ministre-michel-barnier-est-il-vraiment-decide-a-payer-la-dette-ecologique-de-la-france-20240906_7BYVDVAUSJD2VN6M4V7DAI2N2E/

    1. in the 1990s and 2000s, the US government reduced its level of investment as interventionist policy fell out of vogue. This set the stage for Intel’s decline relative to firms like Taiwan Semiconductor Manufacturing Company, now the world’s dominant chip fabricator; and ASML, a Dutch company that is the sole manufacturer of the equipment needed to build state-of-the-art chips.

      I hadn’t realised this significance of the loss of subsidy in offshoring

    1. if (folio) { pgoff_t start; rcu_read_lock(); start = page_cache_next_miss(ractl->mapping, index + 1, max_pages); rcu_read_unlock(); if (!start || start - index > max_pages) return; ra->start = start; ra->size = start - index; /* old async_size */ ra->size += req_size; ra->size = get_next_ra_size(ra, max_pages); ra->async_size = ra->size; goto readit;

      Read ahead policy for marked folios

  4. Aug 2024
    1. if (hugetlb_cgroup_disabled())

      This probably not an interesting policy decision for ldos. It is a feature flag for the running OS. But if cgroups were decided by policy then this flag would be controlled by the cgroup decision.

    1. static long get_nr_to_scan(struct lruvec *lruvec, struct scan_control *sc, bool can_swap)

      figure out how many pages to scan.

    2. static void prepare_scan_control(pg_data_t *pgdat, struct scan_control *sc) {

      sets up the struct scan_control. Most of the value come from elsewhere but this function seems to bring it all together.

    1. ksm_thread_pages_to_scan

      how many pages to scan. This is what many of the other config values are trying to get at.

    2. function to compute a EWA for the number of pages to scan. Uses many of the config parameters from sysfs

  5. Jul 2024
    1. common goal to improve policy evaluations for the better.

      for - CECAN - goal - policy improvement

    1. static void scan_time_advisor(void)

      This function is calculating the pages to scan based on a other metrics such as cpu consumed. Seems like a good place for a learned algorithm.

    1. 26:30 Brings up progress traps of this new technology

      26:48

      question How do we shift our (human being's) relationship with the rest of nature

      27:00

      metaphor - interspecies communications - AI can be compared to a new scientific instrument that extends our ability to see - We may discover that humanity is not the center of the universe

      32:54

      Question - Dr Doolittle question - Will we be able to talk to the animals? - Wittgenstein said no - Human Umwelt is different from others - but it may very well happen

      34:54

      species have culture - Marine mammals enact behavior similar to humans

      • Unknown unknowns will likely move to known unknowns and to some known knowns

      36:29

      citizen science bioacoustic projects - audio moth - sound invisible to humans - ultrasonic sound - intrasonic sound - example - Amazonian river turtles have been found to have hundreds of unique vocalizations to call their baby turtles to safety out in the ocean

      41:56

      ocean habitat for whales - they can communicate across the entire ocean of the earth - They tell of a story of a whale in Bermuda can communicate with a whale in Ireland

      43:00

      progress trap - AI for interspecies communications - examples - examples - poachers or eco tourism can misuse

      44:08

      progress trap - AI for interspecies communications - policy

      45:16

      whale protection technology - Kim Davies - University of New Brunswick - aquatic drones - drones triangulate whales - ships must not get near 1,000 km of whales to avoid collision - Canadian government fines are up to 250,000 dollars for violating

      50:35

      environmental regulation - overhaul for the next century - instead of - treatment, we now have the data tools for - prevention

      56:40 - ecological relationship - pollinators and plants have co-evolved

      1:00:26

      AI for interspecies communication - example - human cultural evolution controlling evolution of life on earth

  6. Jun 2024
    1. In​ 1880 Britain could with some justification be called the ‘workshop of the world’: it produced more than 20 per cent of global industrial output and about 40 per cent of the world’s manufactured exports. In the nearly half-century since Samuel published his essay of that name, historians have done much to undermine the narrative of an ‘industrial revolution’ bookended by the invention of the spinning jenny in 1764 and the New Poor Law of 1834.

      There's an interesting linkage going on here between the industrial revolution (and thus possibly Capitalism) with the creation and even litigation of "the poor" classes in Britain.

      Did "the poor" exist in the same way they do today prior to the Industrial Revolution? What are the subtle differences? (Compare with Thompson, E. P. “Time, Work-Discipline, and Industrial Capitalism.” Past & Present, no. 38 (1967): 56–97.)

    1. /* * The larger the object size is, the more slabs we want on the partial * list to avoid pounding the page allocator excessively. */ s->min_partial = min_t(unsigned long, MAX_PARTIAL, ilog2(s->size) / 2); s->min_partial = max_t(unsigned long, MIN_PARTIAL, s->min_partial);

      A policy decision about how often we may have to go to the page allocator.

    2. /* * calculate_sizes() determines the order and the distribution of data within * a slab object. */ 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 static int calculate_sizes(struct kmem_cache *s) {

      computes a several values for the allocator based on the size and flags of the allocator being created.

    3. #ifndef CONFIG_SLUB_TINY static inline int alloc_kmem_cache_cpus(struct kmem_cache *s)

      Depending on the CONFIG_SLUB_TINY should ther be an active slab for each CPU?

    4. static inline int calculate_order(unsigned int size) { unsigned int order; unsigned int min_objects; unsigned int max_objects; unsigned int min_order; min_objects = slub_min_objects; if (!min_objects) {

      calculate the order (power of two number of pages) that each slab in this allocator should have.

    5. max_objects = max(order_objects(slub_max_order, size), 1U); min_objects = min(min_objects, max_objects); min_order = max_t(unsigned int, slub_min_order, get_order(min_objects * size)); if (order_objects(min_order, size) > MAX_OBJS_PER_PAGE) return get_order(size * MAX_OBJS_PER_PAGE) - 1;

      Policy calculation

    6. s->flags & __OBJECT_POISON

      apply policy

    7. s->flags & SLAB_RED_ZONE)

      debug plicy

    8. if (s->flags & __CMPXCHG_DOUBLE) {

      Config fastpath?

    9. if (s->flags & __CMPXCHG_DOUBLE) {

      Fast path config

    10. set the number of slabs per cpu

    1. int calculate_normal_threshold(struct zone *zone) { int threshold; int mem; /* memory in 128 MB units */ /* * The threshold scales with the number of processors and the amount * of memory per zone. More memory means that we can defer updates for * longer, more processors could lead to more contention. * fls() is used to have a cheap way of logarithmic scaling. * * Some sample thresholds: * * Threshold Processors (fls) Zonesize fls(mem)+1 * ------------------------------------------------------------------ * 8 1 1 0.9-1 GB 4 * 16 2 2 0.9-1 GB 4 * 20 2 2 1-2 GB 5 * 24 2 2 2-4 GB 6 * 28 2 2 4-8 GB 7 * 32 2 2 8-16 GB 8 * 4 2 2 <128M 1 * 30 4 3 2-4 GB 5 * 48 4 3 8-16 GB 8 * 32 8 4 1-2 GB 4 * 32 8 4 0.9-1GB 4 * 10 16 5 <128M 1 * 40 16 5 900M 4 * 70 64 7 2-4 GB 5 * 84 64 7 4-8 GB 6 * 108 512 9 4-8 GB 6 * 125 1024 10 8-16 GB 8 * 125 1024 10 16-32 GB 9 */ mem = zone_managed_pages(zone) >> (27 - PAGE_SHIFT); threshold = 2 * fls(num_online_cpus()) * (1 + fls(mem)); /* * Maximum threshold is 125 */ threshold = min(125, threshold); return threshold; }

      a "magic" formula for computing the amount of memory per zone.

    1. If a student either “never attended” or “stopped attending,” faculty should assign an “F” grade in Goldmine. For students that “stopped attending,” faculty should also provide the date of the last known active participation by the student in an instructional activity such as a response to discussion boards, study group, assignments, class lecture, lab, tests, etc. This does not include a student simply logging into the class as this is not considered “active participation.”

      unearned F -

    2. Faculty who suspect a student of plagiarism or some form of academic dishonesty must report the suspicion to the Dean of Students via The Office of Student Conduct and Conduct Resolution (OSCCR). OSCCR will investigate the allegation and determine the course of action. It is against Regents’ Rules and Regulations for faculty to make a determination independent of OSCCR. According to UTEP’s Handbook of Operating Procedures Section 4.14, “such action is a disciplinary penalty that violates the student’s right to due process and leaves the faculty member vulnerable to a student grievance petition, a civil lawsuit, and possible disciplinary action by the University.” More information is available in the HOOP.

      Faculty deciding themselves on academic dishonesty 1. violates student's right to due process 1. leaves faculty vulnerable to a student grievance petition, civil lawsuit....

    1. Proper Citation

      Citation styles - for web published citations

    2. Technology, Education and Copyright Harmonization (TEACH) Act. Signed into law by President Bush on November 2, the TEACH Act loosens the restraints created by the DMCA insofar as education is concerned

      TEACH Act - loosens DMCA in favor of fair use

    3. More importantly, the idea of Fair Use was effectively removed from Web-based education because of the DMCA

      Fair Use revoked b/c of DMCA

    4. Digital Millennium Copyright Act (DMCA) was passed in Oct. 1998 "to implement United States treaty obligations and to move the nation's copyright law into the digital age.

      Digital Millennium Copyright Act

    1. Resources for using video in online education

      Video resources for educaton

    2. Place the video in the context of the course, explaining why it was chosen and what it was intended to illustrate. Recontextualize the video when appropriate through the addition of background readings, study questions, commentary, criticism, annotation, and student reactions.

      Context for use with video is key

    1. Resources for using images in online education

      Image sources

    2. If copying an image, use the lowest image resolution possible to achieve your purpose.

      Interesting to consider resolution of images

    1. Note: Professor Meghani is making too much work for herself by scanning the text. Instead, she could direct her students to Project Gutenberg, which contains public domain titles available for download in multiple formats. In this case, the Marxists Internet Archive would also be a good sourc

      Project Gutenberg - has public domain titles for download.

    1. It is not necessary to prevailon each of the four factors for asuccessful fair use claim.

      You don't have to prove fair use in all 4 factors

    2. Fair use is a flexible standard andall four statutory factors areconsidered together.

      Fair use flexibility

    3. The US Constitution clearlystates that the purpose of theintellectual property system is to“promote the progress of science andthe useful arts

      Purpose of Intellectual property system

    4. ir use is a right explicitly recognizedby the Copyright Act.1 The SupremeCourt has recognized this right as a“First Amendment safeguard” becausecopyright law might otherwiseconstrict freedom of speech

      Fair Use is a right - I really don't understand this but Ok

    1. The Copyright Clearance Center can grant permission to digitize, display and transmit print works

      getting permission to digitize, display and transmit print works

    1. Using the Four Factors

      Four Factors Test for Fair Use

      Read about each factor (character of the use, nature of the work, amount used, effect upon the market)

      Answer each factor's question about your use See how the balance tips with each answer

      Make a judgment about the final balance: overall, does the balance tip in favor of fair use or in favor of getting permission?

    1. The TEACH Act checklist, summarizes the 22 (!) prerequisites. Nevertheless, we may be optimistic that, together with fair use, this statute will achieve Congress' goal of facilitating online education.

      TEACH Act checklist

    2. are a small subset of the uses of online resources educators may wish to make. It only covers in class performances and displays, not, for example, supplemental online reading, viewing, or listening materials. For those activities, as well as many others, we'll need to continue to rely on fair use. Remember, however, when relying on fair use, the fair use test is sensitive to harm to markets. This means that in general, where there is an established market for permissions, there will often be a narrower scope for fair use, and our reliance on fair use should be limited.
    3. The TEACH Act authorizes us to digitize works for use in online education, but only to the extent we are authorized to use those works in Section 110(2), and so long as they are not available digitally in a format free from technological protection.

      right to make digital copies

    4. The statute's complexity provides a new context within which to think about fair use: compared to the many conditions and limits contained in Section 110(2), the four factor fair use test seems simple and elegant.

      four factor fair use test

    5. The audiovisual works and dramatic musical works may only be shown as clips -- "reasonable and limited portions".

      reasonable and limited portions are allowed online

    6. The TEACH Act of 2002, expanded the scope of online educators' rights to perform and display works and to make copies integral to such performances and displays, making the rights closer to those we have in face-to-face teaching. But there is still a considerable gap between what the statute authorizes for face-to-face teaching and for online education.

      TEACH Act definition

    7. Copyright law provides educators with a separate set of rights in addition to fair use, to display (show) and perform (show or play) others' works in the classroom. These rights are in Section 110(1) of the Copyright Act and apply to any work, regardless of the medium.

      The TEACH Act

    1. Because your institution is likely to be liable, along with an accused individual, for the infringements of faculty, students and staff, most institutions advise such individuals not to use works for which required permission cannot be obtained.

      copyright infrindgement

    2. There truly may be no one who cares about what you do with a particular work, but the bottom line is that no amount of unsuccessful effort eliminates liability for copyright infringement. Copyright protects materials whether the owner cares about protection or not.

      unavailable authors

    3. If you are preparing a commercial product, you will need assurances of authority to grant permission because your publisher will expect those assurances from you.

      Creating commercial products

    4. question them about whether they retained copyright or whether they assigned it to their publisher.

      The author may not have the copyright

    5. If you know who the author and the publisher are, you can contact them directly. If you do not know who the publisher is, The Literary Marketplace (for books) or Ulrich's Web (for journals - requires login) may help you.  Once you know whom to ask, writing a letter, calling or emailing are all appropriate ways to initiate contact.

      Getting permission from authors - where to look

    1. Where fair use may be questioned, implied rights may be broader, but an express right to use is best - it's clear and reassuring. It's possible today to search Creative Commons licensed works by license type, or limit your search to be sure that your results include only materials intended for use by educators and students.

      Best way to find usable things with Creative Commons

    2. You can easily give your works an express license by attaching a Creative Commons license to the materials you post online. It's easy and it sends the message that you want your materials to be part of the flow of creativity. No one creates in a vacuum. Just as you build on others' works, others will build on yours.

      Great explanation of what "Creative Commons" is

    3. So, just by posting online, an author implies a limited license to use their work in this manner.

      This seems to be opposite of what the paragraph above states.

    4. Simply putting the fingers to the save key creates a copyrighted work. Once expression is committed to a tangible medium, copyright protection is automatic. So, postings of all kinds are protected the same as published printed works.

      Interesting. This is very helpful.

    1. A gyrotron uses high-power, linear-beam vacuum tubes to generate millimeter-length electromagnetic waves. Invented by Soviet scientists in the 1960s, gyrotrons are used in nuclear fusion research experiments to heat and control plasma. Quaise has raised $95 million from investors, including Japan’s Mitsubishi, to develop technology that would enable it to quickly and efficiently drill up to 20 km deep, closer to the Earth’s core than ever before

      Fusion power tech adapted to ease geothermal power. IMO a good example of remixing knowledge from one domain to another. And, for example, if you think fusion isn't worth pursuing, then we might not get this cross-cutting adaptation that's valuable for advancing renewable energy.

    1. o the creator or originator of that record in order to verify authenticity without the student’s permis

      You can verify authenticity of records wo permission

    2. Example Scenarios

      Great example cases

    1. provide a letter of recommendation for a student that includes grades unless you have received written consent from the student to release this information for this explicit purpose.

      Can't put grades in a Letter of Recommendation without written consent

    2. provide anyone outside the college with lists of students enrolled in classes;

      Class rosters are protected

    1. If you teach several sections of the same course but the students do not interact with each other in a physical classroom or online, the courses cannot be merged in Carmen.

      if they are not combined in Colleague - they can't be in Canvas - good to know. It's not just an integration issue - its FERPA

    1. The teacher who saw the incident in-person can speak about it because FERPA is not a confidentiality law. It only protects what’s in a student’s education record.

      Interesting - only what is in records is protected.

    2. If a school denies access to student records to a parent of a student under the age of 18, that’s a FERPA violation

      this is good to know parents of kids under 18 must have access to records

    3. One is that, generally, higher education institutions can choose to release a students’ education records to both parents, provided that at least one parent claims the student as a dependent for tax purposes.

      INteresting - Baylor won't do this.

    4. “It should be clear that [the data] belongs to the school, not to the vendor, and that the vendor’s responsibility is to process it for the benefit of the school and its students, and not for the vendor’s own benefit,” McDonald says.

      FERPA and 3rd party Vendors

    1. “Law enforcement unit records” (i.e., records created by the law enforcement unit, created for a law enforcement purpose, and maintained by the law enforcement unit) are not “education records” subject to the privacy protections of FERPA. As such, the law enforcement unit may refuse to provide a parent or eligible student with an opportunity to inspect and review law enforcement unit records, and it may disclose law enforcement unit records to third parties without the parent or eligible student’s prior written consent

      Law enforcement records is not FERPA protectd

    1. Schools may disclose, without consent, "directory" information such as a student's name, address, telephone number, date and place of birth, honors and awards, and dates of attendance. However, schools must tell parents and eligible students about directory information and allow parents and eligible students a reasonable amount of time to request that the school not disclose directory information about them.

      Definition of Directory Information : name address phone date & place of birth honors and awards dates of attendance.

      Students can "opt out" of directory information.

    2. schools must have written permission from the parent or eligible student in order to release any information from a student's education record. However, FERPA allows schools to disclose those records, without consent, to the following parties or under the following conditions (34 CFR § 99.31): School officials with legitimate educational interest; Other schools to which a student is transferring; Specified officials for audit or evaluation purposes; Appropriate parties in connection with financial aid to a student; Organizations conducting certain studies for or on behalf of the school; Accrediting organizations; To comply with a judicial order or lawfully issued subpoena; Appropriate officials in cases of health and safety emergencies; and State and local authorities, within a juvenile justice system, pursuant to specific State law.

      Who you can release information to without student consent.

    3. The Family Educational Rights and Privacy Act (FERPA) (20 U.S.C. § 1232g; 34 CFR Part 99) is a Federal law that protects the privacy of student education records. The law applies to all schools that receive funds under an applicable program of the U.S. Department of Education.

      FERPA definitions

    4. These rights transfer to the student when he or she reaches the age of 18 or attends a school beyond the high school level.

      Parent's rights end with 18 and / or college and transfers to students

    1. For students and educators alike, it's important to think about academic integrity as a learned concept.

      Academic integrity is a learned concept

    2. Whether in history, social studies, science, or literature, most East Asian students are discouraged from producing original work in an academic setting and instead advised to remember and repeat the ideas of the masters in those subject areas as a form of respect.

      Interesting that individual work is not the goal....

    3. nursing students, for example, are focused on the concept of caring for others and illustrate collectivist culture, in both academic study and clinical practice. It is often natural for nursing students to project caring for patients to helping at-risk cohorts in the form of academic collusion.

      Interesting take on nursing students

    4. Students that grow up with this perspective may not understand why citations at the end of a research paper are important; furthermore, citations might even make them feel uncomfortable, as they recognize individual authors above the community as a whole.

      This is a different view of authorship - elevating 1 above the many

    5. A collectivist culture is one that prioritizes the goals and desires of the whole over the needs of the individual. Often in East Asian countries like South Korea, Japan, and China, ideas that are beneficial to and shared by the community are not individually attributed, but rather recognized as universal knowledge.

      Interesting take on east asian culture. it really makes sense if the collective owns the information - you don't have to cite authorship.

    1. But that practice fails to recognize that students are responsible for their own computer access and stable internet connection.  Although the District-sponsored Learning Manage System will, from time to time, have problems, students need to accept responsibility for their own actions, actions that might be conveniently blamed on an impersonal component of technology.

      This really holds students responsible for being proactive and not waiting until the last minute with work.

    2. It is a violation of the academic honesty and intellectual integrity policies of SBVC to log in to someone else's account and pretend to be that person.

      I like that it holds both students in bad standing. The one doing the work and the one not doing the work

    1. heating includes giving information, materials, or work to another person in or

      I really explaining that giving information to another student makes the "giver" dishonest as well as the reciever

    1. it learned of the possibility that one student admitted to Georgetown may have engaged in inappropriate transfer of online credits.

      pay for credit scandal - where identity was not confirmed.

    1. State Issued Driver’s License, State Identification Card, Military Identification Card, Passport/Visa, Permanent Residence Card

      Valid Ids shown and compared to student school ids - you ight could fake this but it would take effort

    2. Method: Instructors use check-ins and/or office hours to discuss content, previous assignments, and progress on existing assignments.   Process: Instructors ask for identification and/or confirm student identity via official UConn photo in StudentAdmin.

      This is an interesting way to verify student identity. Required check-ins. but it also makes the professor feel more "real"

    1. Instructors should check student identity by verifying IDs in a one-on-one online meeting prior to the presentation.

      I didn't realize that instructors had to verify student identity via ID.

    2. Federal Regulation §602.17: Application of Standards in Reaching Accreditation Decisions requires that all public universities have processes in place through which the institution establishes that a student who registers in any course offered via distance education or correspondence is the same student who academically engages in the course or program; and makes clear in writing that institutions must use processes that protect student privacy and notify students of any projected additional student charges associated with the verification of student identity at the time of registration or enrollment. Please see the Electronic Code Federal Regulations for more information.

      regulation about identify verification of students in Online courses

    1. The ethical standards outlined above apply throughout the academic community.  These guidelines apply to faculty and research assistants in their possible use of students’ and colleagues’ research and ideas, as well as to students’ use either of source materials and authorities or of other students’ ideas and work.

      Great statement to teach students how to refer to each other's work.

    2. others result from sloppy scholarship or failure to follow proper format for crediting sources.  For example:

      I like the "sloppy" description of non-intentional plagerism

    3. Plagiarism is taking credit for someone else’s ideas, work, or words.

      plain definition of plagerism

    4. All academic relationships ought to be governed by a sense of honor, fair play, trust, and a readiness to give appropriate credit to the intellectual endeavors of others where such credit is due. Since the academic community expects that the process of intellectual and creative endeavor is beneficial to a student, the student's original work, created in response to each assignment, is normally expected. The following rules and guidelines are intended not to replace an atmosphere of trust and cooperation in the pursuit of knowledge, but rather to assure due process and to provide guidelines for action in those instances where the proper relationships and attitudes have broken down.

      I like that the guidelines are not intended to replace atmosphere of trust .....

    1. If plagiarism is suspected, students might be asked to defend or verify their work as their own in one of the following ways: Present notes, drafts, or works cited Produce an on-demand work sample Present an oral defense of work in question

      Ways to verify work by students - I really like this.

    2. malpractice outlined by the IB Organization as behavior that results in, or may result in, the candidate or any other candidate gaining an unfair advantage in one or more assessment components. The following definitions are helpful in understanding our complete definition of malpractice: Plagiarism is taking credit for someone else’s words, work or ideas without giving them credit. Collusion is letting someone copy from you or letting someone turn in your work as theirs. Duplication of work is turning in the same assignment for two or more classes. Misconduct during an assessment is copying someone’s answers, letting someone copy your work, looking up answers, bringing answers into the test room, or using tools/material that the teacher has not approved. Confidentiality is not sharing assessment content, question, or answers with students who have not yet taken the assessment.

      Definition of dishonesty

    1. The author made an observation that it is possible to draw a link between plagiarism and the concept of "loyalty" (based on Sykes and Matza 1957) that can be exploited to explain students’ attitudes and improper academic practices. The author believes that the interviewed students commit plagiarism not because of their unethical or immoral intentions, but rather due to specific hierarchy of values that they follow.

      Hierarchy of values rather an unethical or immoral intentions is interesting

    1. t is the student’s responsibility to provide for supervision of his/her children while they are on campus for class, in a virtual class,

      Addressing children in virtual classroom is great!

    2. Disruptive behavior in the physical classroom or the virtual classroom is not permitted. Students will receive a warning and may be asked to leave the classroom if necessary.

      general statement about virtual classroom - disruptive behavior - but that's not defined

    1. Cheating, plagiarism Conduct that jeopardizes health and safety Tardiness Profanity Pornography Children or pets in class Private conversations or inappropriate displays of affection Uncooperativeness Continually leaving one’s seat Eating and drinking Reading unrelated materials Use of all unauthorized electronic devices, such as walkmans, phones, beepers, pagers, ipods, and music players. Soliciting of funds and/or signatures

      some of these seem mild - but it could be great if they were enforced. Students need to learn how to behave professionally.

    2. Disruptive behavior includes behavior that interferes with the legitimate instructional, administrative, or service functions of the college.  However, should any behavior threaten the personal safety of any student, faculty member, staff, or administrator, or be displayed with such emotional intensity that it causes fear or concern in others, at that point such behavior is classified as a CRISIS and will necessitate a call to Campus Safety (925) 424-1699.

      distinguishes between disruption and crisis

    1. If online class, faculty can moderate and/or temporarily disable LMS functions to prevent the student from further activity until a resolution is determined.

      disable LMS access....not sure how we could do that.

    2. Talking when the instructor or others are speaking

      while I agree, I don't see this enforced much

    1. The following behaviours do not constitute bullying.(a) A single incident of unreasonable behaviour. However, single or one-offincidents of unreasonable conduct can also cause a risk to health and safetyand may breach other University policies and should not be ignored.(b) Reasonable management practices.(c) Low-level conflict as defined in subclause 8(3).(2) Reasonable management practices include (but are not limited to):(a) a direction to carry out reasonable duties and instructions;(b) a direction to comply with University rules, protocols, policies andprocedures;(c) setting reasonable goals, standards and deadlines;

      Now this makes sense and defining "not bullying" is a great idea to protect people against false accusations.

    1. The public’s attitudes diverge in similarways on some of the more severe behaviors in the scenario. Most prominently, 85% of Americansthink that Julie experiences online harassment when she begins to receive vulgar messages abouther looks and sexual behavior. But substantially fewer (although still a majority at 66%) think thatthe social media platform has an obligation to step in and address that behavior.

      So this explains it more people see it as harassment, but not all think the platform should step in, but they should if the student asks them to.

      So should we have a policy stating students cannot copy discussion board entries outside of the LMS without student permissions

    2. The public has a higher threshold for behaviors thatconstitute “online harassment” than for behaviors that necessitate a responsefrom social media platforms

      Not sure I completely understand this, I think if a post is shared publicly without the original people in the incident being asked, there should be grounds for a Civil suit and much of this would stop.

    3. Again,majorities agree that the platforms should step in to address behaviors such as threateningmessages.

      platforms are responsible to police

    4. ave found that online harassment is a common phenomenon in thedigital lives of many Americans, and that a majority of Americans feel harassment online is amajor problem.

      prevalence of online harassment

    1. Project Teams serve several purposes:

      Could easily be translated to online environment

    2. the program provides a combination of traditional instruction and the enhancement of nontraditional instruction and learning that takes place within a Project Team.

      These policies could many times apply to online teams - most of this is outdated info since there are no inperson AGOS courses anymore

    3. The classrooms, student center, and project team locations are places to learn, to socialize and to grow. Each person must be recognized to have certain rights which do not conflict with the Community Expectations nor infringe upon the rights of others in the spirit of the University motto “to served, and not be served.”  These rights include the following: The right to study without distraction. The right to personal privacy. The right to study in a clean environment. The right to be treated with respect and dignity. The right to hold different values. The right to redress grievances. The right to serve the community.

      Online environments are not listed here but should be.

      Right to be treated with respect and dignity

    4. Academic Misconduct/Honor Code violations are related to a student’s class work, the appropriate response is vested in the professor.

      Professor has to judge on academic misconduct / honor code violation

    5. All communication between students and other students, or between students and faculty, must be conducted in a manner that is respectful, using language that is professional.

      BU's 2 lines on student to student communication

    1. Degrees of Disciplinary Sanctions:

      8 levels before permeant dismissal

    2. The use of mobile devices (cellphones, beepers, tablets and other smart devices) in the classroom is determined by the faculty member’s mobile device use guidelines for that class. Adhere to the expectations communicated by the faculty member for that course.

      phone use can be against policy if faculty state it is

    3. . Computer and Network Abuse

      Interesting the tech conduct is in the general conduct policy now.

    4. any act that constitutes violent behavior and any other behavior that adversely affects the College or its educational programs or mission.  Attempts to commit acts prohibited by the Code may also be addressed through the conduct process. All members of the College community, students, faculty and staff, have the responsibility to report nonacademic misconduct.

      Everyone is a reporter

    5. If a disruptive student refuses to leave when told, the faculty member will contact SCF Public Safety to remove the student.

      explicit statement about having students removed by security

    1. Violation of Student Code of Conduct ReportStudent's Name: _______________________________________________________________Student Identification Number: __________________________Instructor’s Name: ________________________________ Office Phone #: ________________Instructor’s E-mail Address: ______________________________________________________Course Title: _________________________________________________________________Course Number: _________________________ Section Number: ________Description of Incident (use additional pages if necessary)__________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________Describe the instructions that were given to the student:______________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________Was the student asked to leave the class? Yes _____ No_____N/A_________Did the student leave voluntarily? Yes _____ No _____Were the police contacted? Yes ____ No ____If yes, officer’s name: _____________________ Officer’s Department: ____________________Action taken by Police (list report number and whether arrest occurred):______________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________Faculty Member’s Signature_____________________________________Date: ____________Submit copy of form electronically to: student, department chair, and to Student Judicial Programs (who will sharewith Student Development Office) at tp-sheridan@wiu.edu or via fax to 309-298-1203

      form sample

  7. May 2024
    1. the United States was suppressing Democratic movements around the world because if an authoritarian if a communist can win an 00:13:59 election fairly one time that's the end of free and fair elections

      for - key insight - why US geopolitics installed dictatorships - progress trap- US foreign policy that shaped modernity

      key insight - why US geopolitics installed dictatorships - This was the US's rationale to justify the geopolitical mess it created this century: - If you allow democracy in the age of Communism - people might vote for communism, then - kill all the rich people, then - take their stuff, then - redistribute it - You can get a majority support for that in an impoverished country and that was perceived as a threat - So the United States was suppressing Democratic movements around the world - because if an authoritarian if a communist can win an election fairly one time, - that's the end of free and fair elections - So for decades, the US foreign policy agenda was to install dictators to suppress the threat that democracy could produce communism. - But after "communism was defeated" - all these installed dictators around the world that are the direct result of the pathological US foreign policy posed a new, unexpected quagmire - The decades of US foreign policy had created an enormous progress trap that we are all living through now - The US now had to normalize relations with the new world of dictators it had helped created out of its own fears<br /> - A new US foreign policy rule emerged to deal with this fiasco - Stay in your own country - If you want to kill, imprison, brutalize or subjegate your own people, it is fine with the US government as long as it is done within your own state borders - As long as a nation state abuses their own people, the US will continue to: - buy your oil - trade with you - show up at the UN - even have an occasional State event for you - However, Russia broke that rule

    1. mapsize = PAGE_ALIGN(mem_section_usage_size()) >> PAGE_SHIFT;

      Policy application: choosing map size for page usage?

    1. Der Guardian nennt die Stimmung der meisten von der Zeitung zu ihren Zukunfterwartungen befragten IPCC-Klimawissenschaftlerinnen düster; viele sind deprimiert. Viele der Forschenden, die die Zeitung als die am besten über die Zukunft Informierten bezeichnet, erwarten Hungersnöte, Massenmigration und Konflikte. https://www.theguardian.com/environment/ng-interactive/2024/may/08/hopeless-and-broken-why-the-worlds-top-climate-scientists-are-in-despair

  8. Apr 2024
    1. Die Wirtschaftsminister Deutschlands, Frankreich und Italiens, die sich an Montag in Brüssel getroffen haben, sind sich in der Forderung nach einer gemeinsamen europäischen Industriepolitik einig. Die Energiewende spielt darin eine entscheidende Rolle. Bei vielen damit verbundenen Fragen, z.B. nach der Subventionierung der Solarindustrie, besteht aber Uneinigkeit. In ihrem Bericht bezieht sich die Repubblica vor allem auf eine Analyse des Thinktanks Bruegel.

      Bruegel-Analyse: https://www.bruegel.org/first-glance/smart-solar-strategy-europe

  9. Mar 2024
    1. Georgia also instituted a policy of keeping the land “tail-male,”which meant that land descended to the eldest male child. This feudal rulebound men to their families. The tail-male provision protected heirs whosepoor fathers might otherwise feel pressure to sell their land.53
    2. History of the United States (1834)

      1834 was also interesting with respect to this thesis as Britain was working at the "principles of 1834" which Beatrice Webb focused on and debunked in English Poor Law Policy (1910).

      see: https://hypothes.is/a/NLJSJAe7Ee2xvIeHyTL7vQ

      Would this 1832 work in Britain have bleed over to a similar set of poverty principles in the United States in the same era? Could this have compounded issues in America leading to greater class divisions in the decades before the Civil War?

  10. Feb 2024
    1. Fachleute rechnen damit, dass ein Sieg Trumps bei den Präsidentschaftswahlen zu einem Rollback bei den Projekten für saubere Energie führen würde, die die Biden-Administration eingeleitet hat. Der Inflation Reduction Act hat bereits zu Investitionen von etwa 200 Milliarden Dollar in solche Projekte geführt. Wie weit der Rollback gelingen würde, ist unklar, zumal besonders republikanisch dominierte Regionen von den Projekten der aktuellen Administration profitieren. https://www.nytimes.com/2024/02/19/us/politics/inflation-reduction-act-republican-attacks.html

    1. Die New York Times analysiert den Auftritt von Sultan al-Jaber, Ölminister der Emirate und Präsident der COP28, beim „Peterberger Klimadialog“.Er unterscheidet zwischen Fossilen Brennstoffen und fossilen Emissionen. Viele Beobachter:innen interpretieren seine Statements optimistisch – sie sind aber deutlich auf eine Legitimation der Fossilindustrie ausgerichtet. https://www.nytimes.com/2023/05/03/climate/un-climate-oil-uae-al-jaber.html

    1. for - 2nd Trump term - 2nd Trump presidency - 2024 U.S. election - existential threat for climate crisis - Title:Trump 2.0: The climate cannot survive another Trump term - Author: Michael Mann - Date: Nov 5, 2023

      Summary - Michael Mann repeats a similiar warning he made before the 2020 U.S. elections. Now the urgency is even greater. - Trump's "Project 2025" fossil-fuel -friendly plan would be a victory for the fossil fuel industry. It would - defund renewable energy research and rollout - decimate the EPA, - encourage drilling and - defund the Loss and Damage Fund, so vital for bringing the rest of the world onboard for rapid decarbonization. - Whoever wins the next U.S. election will be leading the U.S. in the most critical period of the human history because our remaining carbon budget stands at 5 years and 172 days at the current rate we are burning fossil fuels. Most of this time window overlaps with the next term of the U.S. presidency. - While Mann points out that the Inflation Reduction Act only takes us to 40% rather than Paris Climate Agreement 60% less emissions by 2030, it is still a big step in the right direction. - Trump would most definitely take a giant step in the wrong direction. - So Trump could singlehandedly set human civilization on a course of irreversible global devastation.

    2. The GOP has threatened to weaponize a potential second Trump term

      for - 2nd Trump term - regressive climate policy

  11. Jan 2024
    1. Nach der Invasion der ganzen Ukraine durch Russland wurde russisches Gas in Europa vor allem durch LNG-Importe aus den USA ersetzt. Damit tauscht man eine Abhängigkeit durch eine andere ein, statt die Erneuerbaren entschiedener auszubauen. Ausführlicher Bericht von Bloomberg über die damit verbundenen Risiken. Als erstes Zeichen für Schwierigkeiten wird die Verzögerung der Genehmigung von CP2 gewertet. https://www.energyconnects.com/news/gas-lng/2024/january/gas-addicted-europe-trades-one-energy-risk-for-another/

  12. Dec 2023
    1. you can see it all the time it's 00:41:37 unbelievably it's unbelievably painful we look at all the our institutions
      • for: polycrisis - entrenched institutional bias, examples - entrenched institutional bias - bank macro economic policy - lobbyist

      • paraphrase

        • James provides two examples of major institutional bias that has to be rapidly overcome if we are to stand a chance at facilitating rapid system change:
          • Bank of England controls macroeconomic policies that favour elites and not ordinary people and
            • these policies are beyond political contestation
          • In the normal political system, lobbyists through the revolving door between the top levels of the Civil Service and the corporate sector bias policies for elites and not ordinary citizens
    1. Warning: Do not accept plain user IDs, such as those you can get with the GoogleUser.getId() method, on your backend server. A modified client application can send arbitrary user IDs to your server to impersonate users, so you must instead use verifiable ID tokens to securely get the user IDs of signed-in users on the server side.