Proper Hierarchy Research Articles

WELLNESS PROGRAMS AS AN INTEGRAL PART OF THE TOURIST OFFER ON CRUISE SHIPS

Cruise is a special type of tourist offer that includes a large market. Interests of guests - the structure of service users and their financial capabilities determine the content offered - entertainment, adventure, wellness or recreation, etc. One of the primary activities during long voyages are wellness procedures that are performed in order to preserve and improve the health of passengers. These procedures involve a multidisciplinary approach from several areas, of which tourism, medicine and physical culture stand out. The provision of services requires specific knowledge and skills, which have only recently taken their place in the nomenclature of јob titles, as well as a special direction of education. Successful effects require a proper hierarchy of treatment during procedures, but also a system of periodic evaluation. The paper presents a questionnaire with the results that was conducted on 102 guests on a cruise from Strasbourg to Köln, where passengers confirm the high quality and suitability of the program for users. The results especially emphasize the importance of the Wellness program for the quality and content of the trip itself. Training of personnel for these programs is possible and desirable in continental countries, whose graduates can find employment on one of the many cruises at sea, but also on larger passenger ships on continental navigation in the systems of rivers and canals of Europe.

Research on Hybrid Force Control of Redundant Manipulator with Reverse Task Priority.

This paper presents the reverse priority impedance control of manipulators with reference to redundant robots of a given task. The reverse priority kinematic control of redundant manipulators is first expressed in detail. The motion in the joint space is derived following the opposite order compared with the classical task priority–based solution. Then the Cartesian impedance control is combined with the reverse priority impedance control to solve the reverse hierarchical impedance controlled, so that the Cartesian impedance behavior can be divided into the primary priority impedance control and the secondary priority impedance control. Furthermore, the secondary impedance control task will not disturb the primary impedance control task. The motion in the joint space is affected following the opposite order and working in the corresponding projection operators. The primary impedance control tasks are implemented at the end, so as to avoid the possible deformations caused by the singularities occurring in the secondary impedance control tasks. Hence, the proposed reverse priority impedance control of manipulator can achieve the desired impedance control tasks with proper hierarchy. In this paper, the simulation experiments of the manipulator will verify the proposed reverse priority control algorithm.

The Component Hierarchy of Chain-free Cooperating Distributed Regular Tree Grammars Revisited

We denote by [Formula: see text] the class of tree languages generated by chain-free distributed regular tree grammars of [Formula: see text] components cooperating with terminal strategy. Dányi and Fülöp [2] showed that the hierarchy [Formula: see text], [Formula: see text] contains an infinite proper hierarchy. We improve their result showing that for each [Formula: see text], [Formula: see text].

ATHANASE JOJA – OUTSTANDING PERSONALITY OF THE ROMANIAN CULTURE

"Concerned with philosophy, history and logic alike, Athanase Joja has written a treatise on logic which is the fundamental landmark of the current logic research. The second half of the twentieth century is marked by the appearance of its four volumes of logic. The volumes include a history of logic, problems of systematic logic and logic of science, which reveals his logical vision, but also his philosophical one. He manages to develop a complex theory of the history of logic, capitalizing on the conceptions of classical and modern philosophers, through a proper hierarchy and interpretation, corresponding to an integrative conception. He gives ample space to some complex, vast and difficult-to-match problems. He has been questioning himself constantly and he sought pertinent answers to problems of logic, epistemology and ontology, in order to capture some generally valid truths. The history of ancient thought, Greek philosophy and especially Aristotelian thought were analysed, systematized and discussed in his own manner, a fact which led Constantin Noica to contribute to the publication of two of his History of Ancient Thought volumes. About him, Ion Ianoși stated that through his texts he proves a certain aesthetic sensitivity and receptivity to artistic values. The present study, based on a careful documentation, aims to configure an image as close as possible to the reality of the great thinker Athanase Joja. Particularly critical of his own writings, he provoked a relatively low cognitive interest in his research; this explains the fact that his work is insufficiently known and valued. However, the 21st century has begun with a globally manifest desire to capitalize on and reinterpret the knowledge of the forerunners. In this regard, we note the fact that his life and work were evoked, in 2004, on the occasion of the 100th anniversary of his birth. In the public life, he played an important role in promoting scientific values and contributed to the establishment of prestigious international scientific publications and events, which would capitalize on the results of Romanian scientific research. We consider that any attention paid to Athanase Joja’s work is an approach that is part of the global cultural trends of the 21st century."

Local fairness in hedonic games via individual threshold coalitions

Hedonic games are coalition formation games where players only specify preferences over coalitions they are part of. We introduce and systematically study three local fairness notions in hedonic games called max-min fairness, grand-coalition fairness, and min-max fairness. To this end, we define suitable threshold coalitions for these three concepts. A coalition structure (i.e., a partition of the players into coalitions) is considered locally fair if all players' coalitions in this structure are each at least as good as their threshold coalitions. Based on this approach, we then introduce three specific notions of local fairness by suitably adapting fairness notions from fair division. We show that they form a proper hierarchy and how they are related to previously studied solution concepts in hedonic games. We also study the computational aspects of finding threshold coalitions and of deciding whether fair coalition structures exist in additively separable hedonic games, and we investigate the related price of local fairness.

Effective Domination and the Bounded Jump

We study the relationship between effective domination properties and the bounded jump. We answer two open questions about the bounded jump: (1) We prove that the analogue of Sacks jump inversion fails for the bounded jump and the wtt-reducibility. (2) We prove that no c.e. bounded high set can be low by showing that they all have to be Turing complete. We characterize the class of c.e. bounded high sets as being those sets computing the Halting problem via a reduction with use bounded by an ω-c.e. function. We define several notions of a c.e. set being effectively dominant, and show that together with the bounded high sets they form a proper hierarchy.

Effective localization number: Building k-surviving degrees

We introduce and study effective versions of the localization numbers introduced by Newelski and Roslanowski (Proceedings of the American Mathematical Society 117 (3) (1993 ), 823–831). We show that proper hierarchies are produced, and that the corre

O nurcie białoruskim w polskiej prozie emigracyjnej

Celem prezentowanego szkicu jest dostrzeżenie i wyróżnienie bardzo ważnego nurtu w polskiej powojennej prozie emigracyjnej. Nurt „powrotu do małych ojczyzn”, bardzo istotny w polskiej prozie powojennej, zaowocował wieloma dziełami wspomnieniowymi. Najważniejsze z nich poświęcone zostały ziemiom ukraińskim i białoruskim. Wspomnienia i powieści na temat życia na ziemiach białoruskich włączane są zwykle do nurtu litewskiego z powodu ich historycznej przynależności do Wielkiego Księstwa Litewskiego. Prezentowany szkic stanowi próbę ustanowienia właściwej hierarchii. Autorowi tekstu zależy na oddaniu ważności kultury białoruskiej dla polskiej literatury emigracyjnej, ale także na ujawnieniu budzenia się białoruskiej tożsamości narodowej. Albowiem w nurcie białoruskim napięcie między polskością i białorosyjskością odgrywa ważną rolę. I ten aspekt nie może zaginąć w refleksjach nad literackimi wspomnieniami polskiego życia na ziemiach białoruskich.

Subjectivity in education in the sense of personalization

Although the inclusion of the subjectivity of the individual seems to be the principle of education today, the term „subjectivity” is understood in different ways, which gives rise to contradictory models of education. It happens so in the case of influential and contrary models of subjectivity, presented by the widely understood antipedagogy and Catholic personalism, which ascribe a strong connotation to it. The analysis of this problem in this article will determine the reflection on the understanding of subjectivity and the characteristics of postmodernity in this context. The aim of this article is to demonstrate that personalism not only protects the subjectivity of the pupil but also does not give up education as it happens in antipedagogy. The role of personalistic education is, in no case, to underestimate the subjectivity of young people but to support the process of preferences and to affirm their proper hierarchy of values, without which their fullness of humanity will not materialize.

Analysing the barriers of lean in Indian coal mining industry using integrated ISM-MICMAC and SEM

PurposeThe purpose of this paper is to develop and validate a model for key barriers to lean implementation in the Indian coal mining industry.Design/methodology/approachInterpretive structural modeling (ISM) has been used to develop a proper hierarchy and contextual relationship of key barriers to lean implementation in the Indian coal mining industry through literature review and expert opinion which is followed by the classification of barriers using Matrice d’ Impacts Croisés-Multiplication Appliquée á un Classement (MICMAC) and questionnaire-based survey to validate the ISM model using structural equation modeling (SEM).FindingsIn this study, 14 key barriers to lean implementation in the Indian coal mining industry have been identified, modeled and analyzed. The lack of top management commitment, financial constraints and lack of inter-departments co-ordination are found to be the most important barriers to lean implementation in the mining industry. The ISM-based model is validated using the SEM.Research limitations/implicationsThe analysis of data represents that relatively more participants were from the mines located in eastern India and the maximum participants were managers and executives holding different levels (lower, middle or upper), although key participants in different mines were encouraged to distribute the survey to other employees also.Practical implicationsThis model on lean barriers would help the decision makers, researchers and practitioners to anticipate potential barriers to lean implementation and support the existing academic research on lean. Accordingly, the focus on the lean barriers can be prioritized for the better utilization of the available resources for eliminating or minimizing the barriers.Originality/valueThis paper is an original contribution of analysis of the lean barriers in Indian mining industry using the integrated ISM–MICMAC and SEM approach.

Heteroscedasticity and Model Selection via Partitioning in Fisheries Data

Selecting a proper model for a data set is a challenging task. In this article, an attempt was made to answer and to find a suitable model for a given data set. A general linear model (GLM) was introduced along with three different methods for estimating the parameters of the model. The three estimation methods considered in this paper were ordinary least squares (OLS), generalized least squares (GLS), and feasible generalized least squares (FGLS). In the case of GLS, two different weights were selected for improving the severity of heteroscedasticity and the proper weight (s) was deployed. The third weight was selected through the application of FGLS. Analyses showed that only two of the three weights including the FGLS were effective in improving or reducing the severity of heteroscedasticity. In addition, each data set was divided into Training, Validation, and Testing producing a more reliable set of estimates for the parameters in the model. Partitioning data is a relatively new approach is statistics borrowed from the field of machine learning. Stepwise and forward selection methods along with a number of statistics including the average square error testing (ASE), Adj. R-Sq, AIC, AICC, and ASE validate along with proper hierarchies were deployed to select a more appropriate model(s) for a given data set. Furthermore, the response variable in both data files was transformed using the Box-Cox method to meet the assumption of normality. Analysis showed that the logarithmic transformation solved this issue in a satisfactory manner. Since the issues of heteroscedasticity, model selection, and partitioning of data have not been addressed in fisheries, for introduction and demonstration purposes only, the 2015 and 2016 shrimp data in the Gulf of Mexico (GOM) were selected and the above methods were applied to these data sets. At the conclusion, some variations of the GLM were identified as possible leading candidates for the above data sets.

Diving into the queue

We introduce and study the model of diving queue automata which are basically finite automata equipped with a storage medium that is organized as a queue. Additionally, two queue heads are provided at both ends of the queue that can move in a read-only mode inside the queue. In particular, we consider suitable time constraints and the case where only a finite number of turns on the queue is allowed. As one main result we obtain a proper queue head hierarchy, that is, two heads are better than one head, and one head is better than no head. Moreover, it is shown that the model with one queue head, finitely many turns, and no time constraints as well as the model with two queue heads, possibly infinitely many turns, and time constraints is captured by P and has a P-complete membership problem. We obtain also that a subclass of the model with two queue heads is already captured by logarithmic space. Finally, we consider decidability questions and it turns out that almost nothing is decidable for the model with two queue heads, whereas we obtain that at least emptiness and finiteness are decidable for subclasses of the model with one queue head.

Turing Machines with One-sided Advice and Acceptance of the co-RE Languages

We resolve an old problem, namely to design a ‘natural’ machine model for accepting the complements of recursively enumerable languages. The model we present is based on Turing machines with ‘onesided’ advice, which are Turing machines with advice with a restricted scenario for the use of their advice during computations. We show that Turing machines with one-sided advice accept precisely the co-RE languages, even though the advices can be arbitrary. We prove that Turing machines with one-sided advice are not less powerful than their unrestricted version: for all languages L ∈ co-RE, L is accepted by an ordinary Turing machine with advice f if and only L is accepted by a Turing machine with one-sided advice f . We show that co-RE filters into an infinite proper hierarchy, based on the complexity (‘length’) of the advice f(n) a one-sided Turing machine needs for accepting a language. The model and the results dualise to the ordinary RE-languages.

Leadership Innovation and Implement Organizational Change and Lead a New Initiative through Adoption of the Innovation and Change Management Practices for Shiraz Industries Private Limited Company: A Survey from Pakistan

Top management plays a pivotal role in adding value to the company by using smartly designed strategies, which can help strengthening the company’s position. In this report main emphasis is placed on leadership, innovation and change practices in Shiraz Industries private limited. This report identifies the problematic areas and suggests workable and doable solutions to solve the problems. To analyze and understand the company’s current position SWOT analysis is undertaken to identify the strengths and weaknesses internally of the company, and opportunities and threats externally of the company. Two models of innovation and change are used to propose and implement organizational change through adoption of the innovation and change management practices and lead a new initiative. The company top management has a bureaucratic style of doing the things in the company. The company has not proper structure and hierarchy especially no formal marketing department. By using the innovation Genome Framework, which gives the top management the clear understanding that they should give employees more freedom and the team, act should be more autonomous. And within the organization they should create sense of cohesion amongst the employees. Top management should look for measures of improvement not just the task accomplishment and goals. The Pentathlon Framework model of innovation is used to see the company innovation strategy and give the idea, prioritization and the implementation of complete process. The role of innovation, services and business process must be communicated to the workforce by the top management. Managers need to look at the things with and operate from a broader perspective especially when generating ideas, improving processes, products and services. Customers demand and need should be focused on and given priority. Goals can be achieved faster by effective cross-functional development testing and prototyping. Kotter’s change model and its implication can cater for the company’s sense of urgency, and, top management should take the pulse of their company employees. True leaders and key stakeholders in the company are to be identified for change. Create a powerful vision and to communicate amongst the masses, and people anxieties and concerns to be properly addressed. Top management should plan and create the short-term wins. McKinsey 7s models of change for what should be the company strategy and how the structure and system should be for the proper check and balance and exact job description for the work place. The shared values, style, staff and skilled and focused to achieve the desired goals. If the company applies all the above models strategy and implement, it is hopes that the company will definitely improve its performance.

Alternation Is Strict For Higher-Order Modal Fixpoint Logic

We study the expressive power of Alternating Parity Krivine Automata (APKA), which provide operational semantics to Higher-Order Modal Fixpoint Logic (HFL). APKA consist of ordinary parity automata extended by a variation of the Krivine Abstract Machine. We show that the number and parity of priorities available to an APKA form a proper hierarchy of expressive power as in the modal mu-calculus. This also induces a strict alternation hierarchy on HFL. The proof follows Arnold's (1999) encoding of runs into trees and subsequent use of the Banach Fixpoint Theorem.

On the hierarchy of generalizations of one-unambiguous regular languages

A regular language is lookahead (resp. block) deterministic if it is specified by a lookahead (resp. block) deterministic regular expression. These two subclasses of regular languages have been respectively introduced by Han and Wood for lookahead determinism and by Giammarresi et al. for block determinism, as a possible extension of one-unambiguous languages defined and characterized by Brüggemann-Klein and Wood.In this paper, we study the hierarchies and inclusion links of these families. We first show that each block deterministic language is the alphabetical image of some one-unambiguous language. Moreover, we show that deciding the block determinism of a regular language from its minimal DFA does not only require state elimination. Han and Wood state that there is a proper hierarchy in block deterministic languages, but prove it using this erroneous requirement. However, we prove their statement by giving our own parametrized family. We also prove that there is a proper hierarchy in lookahead deterministic languages by studying particular properties of unary regular expressions. Finally, using our valid results, we confirm that the family of block deterministic languages is strictly included in the one of lookahead deterministic languages by showing that any block deterministic unary language is one-unambiguous.

The genus of regular languages

The paper defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, an FSA can be seen as a graph for which the notion of genus arises. At the same time, an FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus. After we introduce and justify the the notion of the genus for regular languages, the following questions are addressed. First, depending on the size of the alphabet, we provide upper and lower bounds on the genus of regular languages: we show that under a relatively generic condition on the alphabet and the geometry of the automata, the genus grows at least linearly in terms of the size of the automata. Second, we show that the topological cost of the powerset determinization procedure is exponential. Third, we prove that the notion of minimization is orthogonal to the notion of genus. Fourth, we build regular languages of arbitrary large genus: the notion of genus defines a proper hierarchy of regular languages.

Timed recursive state machines: Expressiveness and complexity

The paper proposes a temporal extension of Recursive State Machines (RSMs), called Timed RSMs (TRSMs), which consists of an indexed collection of Timed Automata, called components. Each component can invoke other components in a potentially recursive manner. Besides being able to model procedure calls and recursion, TRSMs are equipped with the ability to suspend the evolution of time within a component when another component is invoked and to recover it when control is given back at return time. This mechanism is realized by storing clock valuations into an implicit stack at invocation time and restoring them upon return. Indeed, TRSMs can be related to an extension of Pushdown Timed Automata, called EPTAs, where an additional stack, coupled with the standard control stack, is used to store temporal valuations of clocks. The expressiveness and computational properties of the resulting model are analyzed, showing that it can be used to recognize timed languages exhibiting context-free properties not only in the untimed “control” part, but also in the associated temporal dimension. The reachability problem for both TRSMs and EPTAs is investigated, showing that the problem is undecidable in the general case. However, the problem becomes decidable for two meaningful subclasses, called I-TRSM and L-TRSM, obtained by suitably constraining the set of clocks to reset at invocation time and to restore at return time. The considered subclasses are compared with the corresponding EPTAs subclasses through bisimulation of their timed LTSs. The complexity of the reachability problem for L-TRSM and I-TRSM is proved to be EXPTIME-complete and PSPACE-complete, respectively. Moreover, we prove that such classes strictly enhance the expressive power of Timed Automata and of Pushdown Timed Automata, forming a proper hierarchy.

3N-AHP Model, the New Multiactor Multicritera for the Selection of Optimal Corridors of the Line Infrastructure Facilities

In this paper is developed a complex model for the evaluation and selection of the optimum spatial solutions of the corridor line infrastructural facility, which is characterized by multiactor and multicriteria approach. The model is based on the multiactor multicriteria analysis methodology (MAMCO - The Multi Actor Multi Criteria Analysis Methodology) where the relevant decision-making actors, verified by stakeholder analysis (The Stakeholdes analysis), based on the criteria of evaluation that are sorted in the proper hierarchy and whose relevance is confirmed by the factor analysis (the Factor analysis) using the evaluation and ranking of alternatives of the AHP method (the Analityc Hierarchy Process), which was selected by intelligent access with the help of decision tree (decision Tree), offered from a set of alternatives to choose the optimum solution, and the accuracy of their selection check by sensitivity analysis (sensitivity analisys).

Relativizing small complexity classes and their theories

Existing definitions of the relativizations of NC1, L and NL do not preserve the inclusions $${{\bf NC}^1 \subseteq {\bf L}, {\bf NL}\subseteq {\bf AC}^1}$$NC1⊆L,NL⊆AC1. We start by giving the first definitions that preserve them. Here for L and NL we define their relativizations using Wilson's stack oracle model, but limit the height of the stack to a constant (instead of log(n)). We show that the collapse of any two classes in $${\{{\bf AC}^0 (m), {\bf TC}^0, {\bf NC}^1, {\bf L}, {\bf NL}\}}$${AC0(m),TC0,NC1,L,NL} implies the collapse of their relativizations. Next we exhibit an oracle ? that makes ACk(?) a proper hierarchy. This strengthens and clarifies the separations of the relativized theories in Takeuti (1995). The idea is that a circuit whose nested depth of oracle gates is bounded by k cannot compute correctly the (k + 1) compositions of every oracle function. Finally, we develop theories that characterize the relativizations of subclasses of P by modifying theories previously defined by the second two authors. A function is provably total in a theory iff it is in the corresponding relativized class, and hence, the oracle separations imply separations for the relativized theories.