Tag Archives: November

Loading
loading..

“Stopping By Woods on a Snowy Evening”

Randall Thompson’s “Frostiana” is a choral cycle based on the poems of Robert Frost. The cycle consists of settings for mixed chorus and piano, and it was premiered in 1959. “Frostiana” was commissioned to celebrate the bicentennial of the town of Amherst, Massachusetts, and it features seven of Frost’s poems set to music by Thompson.

“Stopping by Woods on a Snowy Evening” is one of the poems included in the “Frostiana” cycle. The composition captures the reflective and contemplative mood of Frost’s poem, where the narrator pauses to admire the beauty of a snowy evening in a quiet forest. Randall Thompson’s musical setting adds another layer to Frost’s words, enhancing the emotional impact of the poem.

Thompson’s approach in “Frostiana” is characterized by its accessibility and tonal clarity. His settings aim to convey the meaning and atmosphere of Frost’s poetry through the expressive power of choral music. The entire “Frostiana” cycle is a celebration of both Thompson’s skill as a composer and Frost’s enduring contribution to American literature.

Acoustics

 

Can Voters Detect Malicious Manipulation of Ballot Marking Devices?

 

Can Voters Detect Malicious Manipulation of Ballot Marking Devices?

Matthew Bernhard, et. al

University of Michigan

 

Abstract:  Ballot marking devices (BMDs) allow voters to select candidates on a computer kiosk, which prints a paper ballot that the voter can review before inserting it into a scanner to be tabulated. Unlike paperless voting machines, BMDs provide voters an opportunity to verify an auditable physical record of their choices, and a growing number of U.S. jurisdictions are adopting them for all voters. However, the security of BMDs depends on how reliably voters notice and correct any adversarially induced errors on their printed ballots. In order to measure voters’ error detection abilities, we conducted a large study (N = 241) in a realistic polling place setting using real voting machines that we modified to introduce an error into each printout. Without intervention, only 40% of participants reviewed their printed ballots at all, and only 6.6% told a poll worker something was wrong. We also find that carefully designed interventions can improve verification performance. Verbally instructing voters to review the printouts and providing a written slate of candidates for whom to vote both significantly increased review and reporting rates-although the improvements may not be large enough to provide strong security in close elections, especially when BMDs are used by all voters. Based on these findings, we make several evidence-based recommendations to help better defend BMD-based elections.

 

IEEE provides this article for public use without charge.

Solidity

Solidity is a high-level, statically-typed programming language used for developing smart contracts on the Ethereum blockchain. Smart contracts are self-executing contracts with the terms of the agreement between buyer and seller written directly into lines of code. Solidity was specifically designed for the Ethereum platform, and it is the most widely used language for creating Ethereum-based smart contracts.

The code below shows how delegated voting can be done so that vote counting is automatic and completely transparent at the same time.

Photograph by Carol M. Highsmith. Library of Congress,

pragma solidity ^0.7.0;

/// @title Voting with delegation.
contract Ballot {
    // This declares a new complex type which will
    // be used for variables later.
    // It will represent a single voter.
    struct Voter {
        uint weight; // weight is accumulated by delegation
        bool voted;  // if true, that person already voted
        address delegate; // person delegated to
        uint vote;   // index of the voted proposal
    }

    // This is a type for a single proposal.
    struct Proposal {
        bytes32 name;   // short name (up to 32 bytes)
        uint voteCount; // number of accumulated votes
    }

    address public chairperson;

    // This declares a state variable that
    // stores a `Voter` struct for each possible address.
    mapping(address => Voter) public voters;

    // A dynamically-sized array of `Proposal` structs.
    Proposal[] public proposals;

    /// Create a new ballot to choose one of `proposalNames`.
    constructor(bytes32[] memory proposalNames) {
        chairperson = msg.sender;
        voters[chairperson].weight = 1;

        // For each of the provided proposal names,
        // create a new proposal object and add it
        // to the end of the array.
        for (uint i = 0; i < proposalNames.length; i++) {
            // `Proposal({...})` creates a temporary
            // Proposal object and `proposals.push(...)`
            // appends it to the end of `proposals`.
            proposals.push(Proposal({
                name: proposalNames[i],
                voteCount: 0
            }));
        }
    }

    // Give `voter` the right to vote on this ballot.
    // May only be called by `chairperson`.
    function giveRightToVote(address voter) public {
        // If the first argument of `require` evaluates
        // to `false`, execution terminates and all
        // changes to the state and to Ether balances
        // are reverted.
        // This used to consume all gas in old EVM versions, but
        // not anymore.
        // It is often a good idea to use `require` to check if
        // functions are called correctly.
        // As a second argument, you can also provide an
        // explanation about what went wrong.
        require(
            msg.sender == chairperson,
            "Only chairperson can give right to vote."
        );
        require(
            !voters[voter].voted,
            "The voter already voted."
        );
        require(voters[voter].weight == 0);
        voters[voter].weight = 1;
    }

    /// Delegate your vote to the voter `to`.
    function delegate(address to) public {
        // assigns reference
        Voter storage sender = voters[msg.sender];
        require(!sender.voted, "You already voted.");

        require(to != msg.sender, "Self-delegation is disallowed.");

        // Forward the delegation as long as
        // `to` also delegated.
        // In general, such loops are very dangerous,
        // because if they run too long, they might
        // need more gas than is available in a block.
        // In this case, the delegation will not be executed,
        // but in other situations, such loops might
        // cause a contract to get "stuck" completely.
        while (voters[to].delegate != address(0)) {
            to = voters[to].delegate;

            // We found a loop in the delegation, not allowed.
            require(to != msg.sender, "Found loop in delegation.");
        }

        // Since `sender` is a reference, this
        // modifies `voters[msg.sender].voted`
        sender.voted = true;
        sender.delegate = to;
        Voter storage delegate_ = voters[to];
        if (delegate_.voted) {
            // If the delegate already voted,
            // directly add to the number of votes
            proposals[delegate_.vote].voteCount += sender.weight;
        } else {
            // If the delegate did not vote yet,
            // add to her weight.
            delegate_.weight += sender.weight;
        }
    }

    /// Give your vote (including votes delegated to you)
    /// to proposal `proposals[proposal].name`.
    function vote(uint proposal) public {
        Voter storage sender = voters[msg.sender];
        require(sender.weight != 0, "Has no right to vote");
        require(!sender.voted, "Already voted.");
        sender.voted = true;
        sender.vote = proposal;

        // If `proposal` is out of the range of the array,
        // this will throw automatically and revert all
        // changes.
        proposals[proposal].voteCount += sender.weight;
    }

    /// @dev Computes the winning proposal taking all
    /// previous votes into account.
    function winningProposal() public view
            returns (uint winningProposal_)
    {
        uint winningVoteCount = 0;
        for (uint p = 0; p < proposals.length; p++) {
            if (proposals[p].voteCount > winningVoteCount) {
                winningVoteCount = proposals[p].voteCount;
                winningProposal_ = p;
            }
        }
    }

    // Calls winningProposal() function to get the index
    // of the winner contained in the proposals array and then
    // returns the name of the winner
    function winnerName() public view
            returns (bytes32 winnerName_)
    {
        winnerName_ = proposals[winningProposal()].name;
    }
}

Time & Frequency Services

The National Institute of Standards and Technology is responsible for maintaining and disseminating official time in the United States. While NIST does not have a direct role in implementing clock changes for daylight saving time, it does play an important role in ensuring that timekeeping systems across the country are accurate and consistent.

Prior to the implementation of daylight saving time, NIST issues public announcements reminding individuals and organizations to adjust their clocks accordingly. NIST also provides resources to help people synchronize their clocks, such as the time.gov website and the NIST radio station WWV.

In addition, NIST is responsible for developing and maintaining the atomic clocks that are used to define Coordinated Universal Time (UTC), the international standard for timekeeping. UTC is used as the basis for all civil time in the United States, and it is the reference time used by many systems, including the Global Positioning System (GPS) and the internet.

Overall, while NIST does not have a direct role in implementing clock changes for daylight saving time, it plays an important role in ensuring that timekeeping systems across the country are accurate and consistent, which is essential for the smooth implementation of any changes to the system.

CLICK IMAGE to access complete document

More

Time Realization and Distribution

Horologiorum

Aaron Copland “Our Town”

Azusa Pacific University Symphony Orchestra | Susanna Cervantes, Graduate Conductor

Recorded Nov. 10, 2018 at the Haugh Performing Arts Center, Glendora CA

Copland wrote the score to the film version of Thornton Wilder’s play in 1940. Comparable to Copland’s other orchestral suite, Appalachian Spring, Our Town is smaller in scale, but holds the same traditional Copland characteristics: the sunrise wake up call in the beginning, the call and response, exploiting the reflective quality of the woodwinds, brass chorales, and the desperately aching sounds of the strings.

He explained, “For the film version, they were counting on the music to translate the transcendental aspects of the story. I tried for clean and clear sounds and in general used straight-forward harmonies and rhythms that would project the serenity and sense of security of the story.” It is dedicated to Leonard Bernstein.

Su Jin Susanna Cervantes is professional freelancer actively working in the greater Los Angeles area. As a cellist, Susanna has played in multiple ensembles such as Hollywood Youth Orchestra, USC Thornton Symphony, and APU Symphony Orchestra.

She has also performed in multiple chamber groups performing works by Barber, Brahms, Borodin, Franck, Mendelssohn, Rachmaninoff, and many more. She has performed in masterclasses with Daniel Hoffman, Lynn Harrell, and Alisa Weilerstein. In addition, she frequents in collaboration with singer-songwriters such as Sleeping At Last, whose hits are featured on ABC’s Grey’s Anatomy; grammy-nominated artist, Michelle Bloom; British Christian singer-songwriter, Matt Redman; and singer/actress, Jackie Tohn.

Susanna is an academic instructor at Orange County School of Arts, teaching String Literature and Music History. She is also a strings coach for the Symphony Orchestra at San Marino High School. Since 2011, Susanna has been a pianist and a music associate at First Baptist Church of Glendale, facilitating services and contracting musicians for the church. Susanna has been teaching cello privately throughout Southern California since 2010.

Susanna has received her BM in Cello Performance from Azusa Pacific University, and is currently studying with Professor Christopher Russell at Azusa Pacific University and will receive her MM in Instrumental Conducting in May of 2019.

Audio and Music Engineering

Standards November: Libraries

ΒΙΒΛΙΟΘΗΚΕΣ

Westfälische Wilhelms-Universität Münster

University of Notre Dame | St. Joseph County Indiana

“Boar Lane Leeds by Lamplight” 1881 John Atkinson Grimshaw

University of St Andrews | County Fife

Iowa State University

University of Virginia | Albemarle County

Time Synchronization of Medium Voltage Substations

 

Time Synchronization of Medium Voltage Substation IEDs Using Modbus and Python

Joseph Owusu, et. al

 

Abstract:  Energy demand and supply all over the world is increasing in size and complexity. Anomalous conditions caused by failures in electrical components, human errors and environmental conditions result in electrical faults that can interrupt electricity flow. Substation automation requires precise time synchronization for a variety of Intelligent Electronic Devices for fault diagnosis. The quest for accurate and sequential time stamping of events compels power utility companies to adopt various techniques of time synchronization with an accuracy of a millisecond or a microsecond. Some works adopt the use of time synchronization techniques using protocols such as Network Time Protocol, Precision Time protocol, Simple Network Time Protocol and many more. This work presents time synchronization of IEDs using Modbus protocol and python programming language for a local substation. The system records the output data into a database and displays it on an application software. The time synchronization system was successful alternative for off network systems.

 

Related:

Time Synchronization in the Electric Power System

Layout mode
Predefined Skins
Custom Colors
Choose your skin color
Patterns Background
Images Background
error: Content is protected !!
Skip to content