Foundations of Online Structure Theory II: The Operator Approach

We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We suggest a unifying approach using operators where we allow the input to be a countable object of an arbitrary complexity. We give a new framework which (i) ties online algorithms with computable analysis, (ii) shows how to use modifications of notions from computable analysis, such as Weihrauch reducibility, to analyse finite but uniform combinatorics, (iii) show how to finitize reverse mathematics to suggest a fine structure of finite analogs of infinite combinatorial problems, and (iv) see how similar ideas can be amalgamated from areas such as EX-learning, computable analysis, distributed computing and the like. One of the key ideas is that online algorithms can be viewed as a sub-area of computable analysis. Conversely, we also get an enrichment of computable analysis from classical online algorithms

A Phenomenological Study of Scripture-Based Ethical Principles Embedded Within Corporate Leadership Practices

The ethical treatment of others within the corporate working environment is essential for that corporation\u27s success. Ethical treatment of others applies to business transactions with customers and clients and engages the policies designed to formulate the ethical treatment of company employees. Although most major corporation documentation includes corporate code of conduct policies, the ethical principles used to define those policies and enact leadership based upon those policies are not always consistent. Four research questions defined the structure of this qualitative phenomenological study. The study’s purpose was to define the nature of Scripture-based ethics within the corporate environment. The theory guiding this study is Servant Leadership Theory as defined by Greenleaf (1977) and supported by Northouse (2019) as it identifies the critical nature of leaders acting as servants for their followers. The study utilized a purposeful sampling strategy to recruit 15 participants. The researcher collected data through recorded online video interviews and transcribed the data using the NVIVO software package. The research identified six main themes: (1) Corporate Foundations, (2) Beliefs, (3) Ethical Foundations, (4) Scriptural Foundations, (5) Life Experience, and (6) Doing the Right Thing. Theme analysis revealed that an ingrained sense of right and wrong resides within humanity, and that sense derives its nature from God’s moral character written on the hearts of humanity. Data analysis also revealed a lack of formal professional ethics training at the leadership level. Future research should deploy a research design that expands this study to additional leadership levels, other industries, and internationally

Factors Influencing Consumer Bidding Behavior in Online Auction (Consumer-to-Consumer)

According to the critical analysis of theoretical and empirical literature, there is a need to better understand and to examine the relationship between consumer bidding behavior in online auctions and the related influencing factors. Online auction is a relatively new field of study. It is important to further research the area of online auctions. The theoretical structure, research questions, research hypotheses, and the hypothesized research model are introduced. Theory of Reasoned Auction, Theory of Planned Behavior, and Technology Acceptance Model are used as theoretical foundations of this study. This study focuses on the relationship between consumer bidding behaviors in online auctions, and factors influencing those behaviors. The research is focused on the following influencing factors: customer satisfaction, ease of use of the web site, and demographic profile. A non-experimental, quantitative, correlational research design was conducted to study the relationship between influencing factors and consumer bidding behavior. The target population was people with online shopping experience with eBay who have current access to the Internet. After IRB approval, the researcher collected the date by a paper and pen questionnaire at a public beach in Boca Raton. The questionnaire was handed out to the eligible participants. The questionnaires were dropped in a closed box. The data for this study collected from at least 146 eligible participants using pen and paper questionnaire as an instrument. Findings helped to serve the online consumers and the vendors, as well as being a scholarly contribution to the study of online bidding. This study used SPSS software to analyze the collected data. Descriptive statistics, Cronbach alpha, Pearson r correlation, simple regression, and multiple regressions, were applied in this study. The study findings indicated that an individual\u27s bidding behavior is influenced positively by factors like consumer satisfaction and ease of use and bidding behavior is not influenced by demographic characteristics

End Games: The Challenge of Sustainability

Examines how funders and grantees approach the challenge of supporting the continued progress and survival of a community-based initiative, after the completion of the project. Offers insights and suggestions to funders and communities

New Perspectives on the Hole Argument

This special issue of Foundations of Physics collects together articles representing some recent new perspectives on the hole argument in the history and philosophy of physics. Our task here is to introduce those new perspectives

Hard Lessons about Philanthropy & Community Change from the Neighborhood Improvement Initiative

Between 1996 and 2006, the William and Flora Hewlett Foundation invested over $20 million in the Neighborhood Improvement Initiative (NII), an ambitious effort to help three neighborhoods in the Bay Area reduce poverty and develop new leaders, better services, more capable organizations, and stronger connections to resources. On some counts NII succeeded, and on others it struggled mightily. In the end, despite some important accomplishments, NII did not fulfill its participants' hopes and expectations for broad, deep, and sustainable community change. In those accomplishments and shortcomings, and in the strategies that produced them, however, lies a story whose relevance exceeds the boundaries of a single initiative. Our goal is to examine this story in the context of other foundation sponsored initiatives to see if it can help philanthropy support community change and other types of long-term, community-based initiatives more effectively.As we began to review materials and conduct interviews, we learned of NII's accomplishments in each neighborhood, including new organizations incubated, new services stimulated, and new leaders helped to emerge. We also quickly discovered multiple, and often conflicting, perspectives on NII's design, implementation, and outcomes that were hard to reconcile. Some of this Rashomon effect is to be expected in a complex, long-term community change initiative that evolves over time with changing players. Some can also be attributed to the different dynamics and trajectories in each of the three sites.We have tried to describe all points of view as accurately as possible without favoring any one perspective. Moreover, we have tried to look beyond the lessons drawn exclusively from NII and to position all of these varied opinions within a broader field-wide perspective, wherever possible.The frustrations of NII's participants and sponsors are mirrored in many other foundations' major initiatives. Indeed, our reviewers -- who have been involved in many such initiatives as funders, evaluators, technical assistance providers, and intermediaries -- all underscored how familiar they were with the challenges and pitfalls described here, both those related specifically to community change efforts and those pertinent to other initiatives. Because the opportunity to discuss the frustrations candidly has been limited, however, they often are relegated to concerns expressed sotto voce. So it was particularly important throughout the review to solicit from our interviewees ideas or suggestions for improving their work together. We offer these along with our own observations as a way to stimulate further reflection and debate, because we believe that philanthropy has an important role to play in improving outcomes for poor communities and their residents. Few foundations have been willing to contribute to this level of honest and sometimes painful public dialogue. But by commissioning this retrospective analysis, the Hewlett Foundation demonstrates a desire to help the field learn and move forward, and we applaud that

On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter

Conditional lower bounds for dynamic graph problems has received a great deal of attention in recent years. While many results are now known for the fully-dynamic case and such bounds often imply worst-case bounds for the partially dynamic setting, it seems much more difficult to prove amortized bounds for incremental and decremental algorithms. In this paper we consider partially dynamic versions of three classic problems in graph theory. Based on popular conjectures we show that: -- No algorithm with amortized update time $O(n^{1-\varepsilon})$ exists for incremental or decremental maximum cardinality bipartite matching. This significantly improves on the $O(m^{1/2-\varepsilon})$ bound for sparse graphs of Henzinger et al. [STOC'15] and $O(n^{1/3-\varepsilon})$ bound of Kopelowitz, Pettie and Porat. Our linear bound also appears more natural. In addition, the result we present separates the node-addition model from the edge insertion model, as an algorithm with total update time $O(m\sqrt{n})$ exists for the former by Bosek et al. [FOCS'14]. -- No algorithm with amortized update time $O(m^{1-\varepsilon})$ exists for incremental or decremental maximum flow in directed and weighted sparse graphs. No such lower bound was known for partially dynamic maximum flow previously. Furthermore no algorithm with amortized update time $O(n^{1-\varepsilon})$ exists for directed and unweighted graphs or undirected and weighted graphs. -- No algorithm with amortized update time $O(n^{1/2 - \varepsilon})$ exists for incremental or decremental $(4/3-\varepsilon')$-approximating the diameter of an unweighted graph. We also show a slightly stronger bound if node additions are allowed. [...]Comment: To appear at ICALP'16. Abstract truncated to fit arXiv limit

Lower Bounds for Oblivious Near-Neighbor Search

We prove an $\Omega(d \lg n/ (\lg\lg n)^2)$ lower bound on the dynamic cell-probe complexity of statistically $\mathit{oblivious}$ approximate-near-neighbor search ($\mathsf{ANN}$) over the $d$-dimensional Hamming cube. For the natural setting of $d = \Theta(\log n)$, our result implies an $\tilde{\Omega}(\lg^2 n)$ lower bound, which is a quadratic improvement over the highest (non-oblivious) cell-probe lower bound for $\mathsf{ANN}$. This is the first super-logarithmic $\mathit{unconditional}$ lower bound for $\mathsf{ANN}$ against general (non black-box) data structures. We also show that any oblivious $\mathit{static}$ data structure for decomposable search problems (like $\mathsf{ANN}$) can be obliviously dynamized with $O(\log n)$ overhead in update and query time, strengthening a classic result of Bentley and Saxe (Algorithmica, 1980).Comment: 28 page