Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Lester Embree Indo-Pacific Journal of Phenomenology , 2003, Abstract: Information from a book (by Lancaster and Stillman, 2002 – see later) about generational gaps and conflicts in American companies is used to show that there is a generational dimension to the socio-cultural lifeworld. In relation to that, some indications are offered about how attitudes toward one’s own as well as other generations can be reflectively analyzed. Other societies probably have similar differences between generations. Indo-Pacific Journal of Phenomenology, Volume 3, Edition 1, November 2003
 Computer Science , 2010, Abstract: Deadlock detection scheduling is an important, yet often overlooked problem that can significantly affect the overall performance of deadlock handling. Excessive initiation of deadlock detection increases overall message usage, resulting in degraded system performance in the absence of deadlocks; while insufficient initiation of deadlock detection increases the deadlock persistence time, resulting in an increased deadlock resolution cost in the presence of deadlocks. The investigation of this performance tradeoff, however, is missing in the literature. This paper studies the impact of deadlock detection scheduling on the overall performance of deadlock handling. In particular, we show that there exists an optimal deadlock detection frequency that yields the minimum long-run mean average cost, which is determined by the message complexities of the deadlock detection and resolution algorithms being used, as well as the rate of deadlock formation, denoted as $\lambda$. For the best known deadlock detection and resolution algorithms, we show that the asymptotically optimal frequency of deadlock detection scheduling that minimizes the overall message overhead is ${\cal O}((\lambda n)^{1/3})$, when the total number $n$ of processes is sufficiently large. Furthermore, we show that in general fully distributed (uncoordinated) deadlock detection scheduling cannot be performed as efficiently as centralized (coordinated) deadlock detection scheduling.
 ？lter üNLüKAPLAN Dogus University Journal , 2009, Abstract: In this study, the theoretical background of generational accounting, the importance of the concept of “generational account” and “fiscal balance rule” have been explained by putting forward that budget deficit is not a suitable indicator to assess intergenerational effects of the fiscal and debt policy. The last part of the study contains presentation of generational accounting studies for selected countries.
 Computer Science , 2007, Abstract: A model of MPI synchronization communication programs is presented and its three basic simplified models are also defined. A series of theorems and methods for deciding whether deadlocks will occur among the three models are given and proved strictly. These theories and methods for simple models' deadlock detection are the necessary base for real MPI program deadlock detection. The methods are based on a static analysis through programs and with runtime detection in necessary cases and they are able to determine before compiling whether it will be deadlocked for two of the three basic models. For another model, some deadlock cases can be found before compiling and others at runtime. Our theorems can be used to prove the correctness of currently popular MPI program deadlock detection algorithms. Our methods may decrease codes that those algorithms need to change to MPI source or profiling interface and may detects deadlocks ahead of program execution, thus the overheads can be reduced greatly.
 Yakasah Wehyee Open Journal of Political Science (OJPS) , 2015, DOI: 10.4236/ojps.2015.53021 Abstract: This paper examines some of the leading theories around the generation question. Using data gathered from the Survey Documentation and Analysis-Frequencies/Cross Tabulation Program, this paper analyzes generational responses to three issues: job security, traditional class division, and the American dream. The purpose of this research is to arrive at which theory of generation more accurately explains generational behavior.
 Marla J. Weston Online Journal of Issues in Nursing , 2006, Abstract: Although nurses from four different generations work closely together, tension may occur as the different generational perspectives result in misinterpretation and misunderstanding. Learning to create integrated and collegial relationships with people from different generations is a critical skill for nurses who work in multigenerational teams. This article will begin with a review of the historical perspective of the four generational cohorts currently in the workplace. This review will set a foundation for understanding each generation’s unique set of work and personal values. Then the article will discuss various sources of multigenerational misunderstandings and conclude with a discussion of approaches to strengthen intergenerational work teams. The article will emphasize that learning to appreciate the diverse points of view, leverage the strengths, and value the differences in colleagues from various generations can enable individuals to form creative, adaptable, and cohesive work groups.
 International Journal of Networking and Computing , 2011, Abstract: Modern multiprocessor architectures have exacerbated problems of coordinating access to shared data, in particular as regards to the possibility of deadlock. For example semaphores, one of the most basic synchronization primitives, present difficulties. Djikstra defined semaphores to solve the problem of mutual exclusion. Practical implementation of the concept has, however, produced semaphores that are prone to deadlock, even while the original definition is theoretically free of it. This is not simply due to bad programming, but we have lacked a theory that allows us to understand the problem. We introduce a formal definition and new general theory of synchronization. We illustrate its applicability by deriving basic deadlock properties, to show where the problem lies with semaphores and also to guide us in finding some simple modifications to semaphores that greatly ameliorate the problem. We suggest some future directions for deadlock resolution that also avoid resource starvation.
 Mircea Dutu Theoretical and Applied Economics , 2006, Abstract: The offensive of “total capitalism” and the worsening of global ecological problems sharpen the concern to identify and promote new development directions capable to make compatible its four essential dimensions: economic, social, environmental, and cultural. In front of the announced failure of the “sustainable development” concept due to the conversions of its meanings, a concept stated with great expectations of success more than a quarter of a century ago, new perspectives are sought to overcome the deadlock. The thesis of a society of decrease (which requires exit-ting the capitalism) or that of sustainable decrease (made possible by mitigating the over-consumption and over-production trends) are among the radical approaches. In order to solve this problem in the context of maintaining the capitalistic project, three other concepts are put forward: the sustainable adaptability, the eco-compatible capitalism, and the society of moderation. Eventually, the most radical option is formulated by E. Morin: to abandon the “development” term and to overcome its imperfections by assuming two fundamental ideas: a policy of humanity combined with another one of planetary civilization. Anyhow, a new paradigm of evolution is absolutely necessary.
 Computer Science , 2013, Abstract: Deadlock detection in recursive programs that admit dynamic resource creation is extremely complex and solutions either give imprecise answers or do not scale. We define an algorithm for detecting deadlocks of "linear recursive programs" of a basic model. The theory that underpins the algorithm is a generalization of the theory of permutations of names to so-called "mutations", which transform tuples by introducing duplicates and fresh names. Our algorithm realizes the back-end of deadlock analyzers for object-oriented programming languages, once the association programs/basic-model-programs has been defined as front-end.
 Mowafak Hassan Abdul-Hussin Journal of Computer and Communications (JCC) , 2015, DOI: 10.4236/jcc.2015.37001 Abstract: For responsiveness, in the Petri nets theory framework deadlock prevention policies based elementary siphons control are often utilized to deal with deadlocks caused by the sharing of resources in flexible manufacturing system (FMS) which is developing the theory of efficient strict minimal siphons of an S3PR. Analyzer of Petri net models and their P-invariant analysis, and deadlock control are presented as tools for modelling, efficiency structure analysis, control, and investigation of the FMSs when different policies can be implemented for the deadlock prevention. We are to show an effective deadlock prevention policy of a special class of Petri nets namely elementary siphons. As well, both structural analysis and reachability graph analysis and simulation are used for analysis and control of Petri nets. This work is successfully applied Petri nets to deadlock analysis using the concept of elementary siphons, for design of supervisors of some supervisory control problems of FMS and simulation of Petri net tool with MATLAB.
 Page 1 /100 Display every page 5 10 20 Item