Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Interesting Paths.
Artykuły w czasopismach na temat „Interesting Paths”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Interesting Paths”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.
1
COQUEREAUX, R., i A. O. GARCÍA. "ON BIALGEBRAS ASSOCIATED WITH PATHS AND ESSENTIAL PATHS ON ADE GRAPHS". International Journal of Geometric Methods in Modern Physics 02, nr 03 (czerwiec 2005): 441–66. http://dx.doi.org/10.1142/s0219887805000582.
Pełny tekst źródłaStreszczenie:
We define a graded multiplication on the vector space of essential paths on a graph G (a tree) and show that it is associative. In most interesting applications, this tree is an ADE Dynkin diagram. The vector space of length-preserving endomorphisms of essential paths has a grading obtained from the length of paths and possesses several interesting bialgebra structures. One of these, the Double Triangle Algebra (DTA) of A. Ocneanu, is a particular kind of quantum groupoid (a weak Hopf algebra) and was studied elsewhere; its coproduct gives a filtrated convolution product on the dual vector space. Another bialgebra structure is obtained by replacing this filtered convolution product by a graded associative product. It can be obtained from the former by projection on a subspace of maximal grade, but it is interesting to define it directly, without using the DTA. What is obtained is a weak bialgebra, not a weak Hopf algebra.
2
Lai, Pao Lien, Kao Ling Hu i Hong Chun Hsu. "Two Systematic Methods for Generating Paths in Twisted Cube Networks". Applied Mechanics and Materials 411-414 (wrzesień 2013): 2047–50. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.2047.
Pełny tekst źródłaStreszczenie:
The twisted cubeTQnis an alternative to the popular hypercube network and some interesting properties of aTQnwere investigated recently. The problem of how to embed paths into a host graph has attracted a great attention in recent years. However, there are few systematic methods proposed to generate the desired paths in aTQn. In this paper, we provide two kinds of systematic methods of embedding paths into aTQn.
3
He, Xiujun. "Fictive Motion and Its Rhetorical Effect in Chinese Novels". Theory and Practice in Language Studies 12, nr 2 (1.02.2022): 362–66. http://dx.doi.org/10.17507/tpls.1202.19.
Pełny tekst źródłaStreszczenie:
Fictive motion is to represent stability by motion; it is first put forward by Talmy, who divided the fictive motion into five categories, that is to say, “emanation,” “pattern paths,” “frame-relative motion,” “advent paths,” “access paths,” and “coextension paths.”. Fictive motion is not only used in English, but also widely used in Chinese, especially in Chinese literary works, in which fictive motion has an intimate relationship with the figure of speech. The use of fictive motion and figure of speech make the works vivid and interesting. This paper intends to discuss the fictive motion and its rhetorical effect in Chinese novels.
4
Bollen, Erik, Rik Hendrix, Bart Kuijpers, Valeria Soliani i Alejandro Vaisman. "Analysing River Systems with Time Series Data Using Path Queries in Graph Databases". ISPRS International Journal of Geo-Information 12, nr 3 (24.02.2023): 94. http://dx.doi.org/10.3390/ijgi12030094.
Pełny tekst źródłaStreszczenie:
Transportation networks are used in many application areas, like traffic control or river monitoring. For this purpose, sensors are placed in strategic points in the network and they send their data to a central location for storage, viewing and analysis. Recent work proposed graph databases to represent transportation networks, since these networks can change over time, a temporal graph data model is required to keep track of these changes. In this model, time-series data are represented as properties of nodes in the network, and nodes and edges are timestamped with their validity intervals. In this paper, we show that transportation networks can be represented and queried using temporal graph databases and temporal graph query languages. Many interesting situations can be captured by the temporal paths supported by this model. To achieve the above, we extend a recently introduced temporal graph data model and its high-level query language T-GQL to support time series in the nodes of the graph, redefine temporal paths and study and implement new kinds of paths, namely Flow paths and Backwards Flow paths. Further, we analyze a real-world case, using a portion of the Yser river in the Flanders’ river system in Belgium, where some nodes are equipped with sensors while other ones are not. We model this river as a temporal graph, implement it using real data provided by the sensors, and discover interesting temporal paths based on the electric conductivity parameter, that can be used in a decision support environment, by experts for analyzing water quality across time.
5
Ghosh, Subir. "Particle on a torus knot: Anholonomy and Hannay angle". International Journal of Geometric Methods in Modern Physics 15, nr 06 (8.05.2018): 1850097. http://dx.doi.org/10.1142/s0219887818500974.
Pełny tekst źródłaStreszczenie:
The phenomenon of rotation of a vector under parallel transport along a closed path is known as anholonomy. In this paper, we have studied the anholonomy for noncontractible loops — closed paths in a curved surface that do not enclose any area and hence Stokes theorem is not directly applicable. Examples of such closed paths are poloidal and toroidal loops and knots on a torus. The present study is distinct from conventional results on anholonomy for closed paths on [Formula: see text] since in the latter case all closed paths are contractible or trivial cycles. We find that for some nontrivial cycles the anholonomy cancels out over the complete cycle. Next, we calculate Hannay angle for a particle traversing such noncontractible loops when the torus itself is revolving. Some new and interesting results are obtained especially for poloidal paths that is for paths that encircle the torus ring.
6
Hou, Songming. "Designing paths for box shapes using a Rubik’s Snake". International Robotics & Automation Journal 8, nr 2 (23.08.2022): 66–68. http://dx.doi.org/10.15406/iratj.2022.08.00246.
Pełny tekst źródłaStreszczenie:
A Rubik’s Snake is a toy that was invented over 40 years ago together with the more famous Rubik’s Cube. It starts with a straight ruler and could be twisted into many interesting shapes. One important type of shapes is a box shape. Many complicated shapes can be constructed as a combination of box shapes. Therefore it is a fundamental problem to study the box shape. We constructed a path for a general box shape and derived a counting formula. Some other properties and application were also discussed.
7
Vernold Vivin, J., K. Kaliraj i M. M. Akbar Ali. "Equitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths". International Journal of Mathematics and Mathematical Sciences 2011 (2011): 1–5. http://dx.doi.org/10.1155/2011/279246.
Pełny tekst źródłaStreszczenie:
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interesting results regarding the equitable chromatic number for the total graph of complete bigraphs , the central graph of cycles and the central graph of paths .
8
Saha, Arkaprava, Ruben Brokkelkamp, Yllka Velaj, Arijit Khan i Francesco Bonchi. "Shortest paths and centrality in uncertain networks". Proceedings of the VLDB Endowment 14, nr 7 (marzec 2021): 1188–201. http://dx.doi.org/10.14778/3450980.3450988.
Pełny tekst źródłaStreszczenie:
Computing the shortest path between a pair of nodes is a fundamental graph primitive, which has critical applications in vehicle routing, finding functional pathways in biological networks, survivable network design, among many others. In this work, we study shortest-path queries over uncertain networks, i.e., graphs where every edge is associated with a probability of existence. We show that, for a given path, it is # P -hard to compute the probability of it being the shortest path, and we also derive other interesting properties highlighting the complexity of computing the Most Probable Shortest Paths (MPSPs). We thus devise sampling-based efficient algorithms, with end-to-end accuracy guarantees, to compute the MPSP. As a concrete application, we show how to compute a novel concept of betweenness centrality in an uncertain graph using MPSPs. Our thorough experimental results and rich real-world case studies on sensor networks and brain networks validate the effectiveness, efficiency, scalability, and usefulness of our solution.
9
Nagy, Benedek, i Bashar Khassawneh. "On the Number of Shortest Weighted Paths in a Triangular Grid". Mathematics 8, nr 1 (13.01.2020): 118. http://dx.doi.org/10.3390/math8010118.
Pełny tekst źródłaStreszczenie:
Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its dual, the triangular grid, paths between triangle pixels (we abbreviate this term to trixels) are counted. The number of shortest weighted paths between any two trixels of the triangular grid is discussed. For each trixel, there are three different types of neighbor trixels, 1-, 2- and 3-neighbours, depending the Euclidean distance of their midpoints. When considering weighted distances, the positive values α, β and γ are assigned to the ‘steps’ to various neighbors. We gave formulae for the number of shortest weighted paths between any two trixels in various cases by the respective weight values. The results are nicely connected to various numbers well-known in combinatorics, e.g., to binomial coefficients and Fibonacci numbers.
10
Laas, Tony, Ü. Ugaste i J. Priimets. "Thermodynamic Aspects of Diffusion Paths in Ternary Systems". Defect and Diffusion Forum 263 (marzec 2007): 135–40. http://dx.doi.org/10.4028/www.scientific.net/ddf.263.135.
Pełny tekst źródłaStreszczenie:
Description of diffusion paths is one of the most interesting and topical problems in experimental investigations of interdiffusion in multicomponent systems and, particularly, in ternary systems. The relationship between effective interdiffusion coefficients and diffusion paths in ternary systems has been discussed earlier but the specific influence of the mobility and thermodynamic properties of components on the characteristics of the diffusion path is still unclear. In this paper an attempt is made to clarify the separate influences of mobility and thermodynamics on the behavior of diffusion paths in ternary systems and the corresponding correlation is found. It is shown that in most cases the deviation of the diffusion path from linearity (an ideal system) is related to the deviation of the thermodynamic properties from the ideal. The results obtained are analyzed on the basis of thermodynamic data for the ternary system Cu-Fe-Ni.
11
Mennucci, Andrea C. G. "On Asymmetric Distances". Analysis and Geometry in Metric Spaces 1 (11.06.2013): 200–231. http://dx.doi.org/10.2478/agms-2013-0004.
Pełny tekst źródłaStreszczenie:
Abstract In this paper we discuss asymmetric length structures and asymmetric metric spaces. A length structure induces a (semi)distance function; by using the total variation formula, a (semi)distance function induces a length. In the first part we identify a topology in the set of paths that best describes when the above operations are idempotent. As a typical application, we consider the length of paths defined by a Finslerian functional in Calculus of Variations. In the second part we generalize the setting of General metric spaces of Busemann, and discuss the newly found aspects of the theory: we identify three interesting classes of paths, and compare them; we note that a geodesic segment (as defined by Busemann) is not necessarily continuous in our setting; hence we present three different notions of intrinsic metric space.
12
Luca, Liliana, i Iulian Popescu. "Paths and Laws of Motion of a Mechanism with Two Successive Conductive Elements and a Triad". Applied Mechanics and Materials 772 (lipiec 2015): 344–49. http://dx.doi.org/10.4028/www.scientific.net/amm.772.344.
Pełny tekst źródłaStreszczenie:
It starts from a structural scheme of a mechanism with a triad and two successive conductive elements, and a kinematic scheme with ternary element and another element with void lengths is made. The relations to calculate the positions by contour method are written and the nonlinear algebraic system is solved by the method of successive elimination of the unknowns. There are determined the successive positions, the paths of some points and the variations of lifts, for different correlations between the laws of motion of the two conductive elements. It appears that there result paths and interesting laws.
13
Coffman, E. G., i Aleksandr Stolyar. "Continuous Polling on Graphs". Probability in the Engineering and Informational Sciences 7, nr 2 (kwiecień 1993): 209–26. http://dx.doi.org/10.1017/s0269964800002874.
Pełny tekst źródłaStreszczenie:
Past research on polling systems has been quite restricted in the form of the paths followed by the server. This paper formulates a general, continuous model of such paths that includes closed walks on graphs. Customers arrive by a Poisson process and have general service times. The distribution of arrivals over the path is governed by an absolutely continuous, but otherwise arbitrary, distribution. The main results include a characterization of the stationary state distribution and explicit formulas for expected waiting times. The formulas reveal an interesting decomposition of the system into two components: a fluid limit and an M/G/1 queue.
14
Sellami, Zeineb. "The typology of progressive constructions in Arabic dialects". STUF - Language Typology and Universals 75, nr 4 (1.11.2022): 555–82. http://dx.doi.org/10.1515/stuf-2022-1063.
Pełny tekst źródłaStreszczenie:
Abstract This paper describes and compares the strategies used in Arabic dialects to encode the progressive aspect, in order to show their similarities and what sets them apart from one another, as well as to situate them within cross-linguistic tendencies. Drawing on a wide variety of data, the paper shows the different ways the progressive aspect was (or is being) grammaticalized in Arabic dialects in light of the typologically common paths of grammaticalization. These paths involve for some dialects the reorganization of their aspectual categories, and thus provide an interesting perspective to look at the evolution of aspectual systems in Arabic varieties.
15
Mahyuddin, A. I., H. Nahvi, K. Farhang i A. Midha. "Approximate Circular and Straight-Line Path Generation With High-Performance Function-Generating Linkages". Journal of Mechanisms, Transmissions, and Automation in Design 111, nr 2 (1.06.1989): 188–94. http://dx.doi.org/10.1115/1.3258982.
Pełny tekst źródłaStreszczenie:
Certain manufacturing industries, including the semiconductor industry, are now moving toward very high-speed machinery requiring very small yet precise motions. The total path of a coupler point on harmonic motion-generating linkages, with relatively small input cranks, has been shown to be an approximate ellipse. Such linkages have been described to possess superior performance qualities for high speed machine application. Two special cases of the elliptical path are circular and linear paths. An investigation of the kinematic equations, which govern the motion of a coupler point, reveal the nonexistence of such exact paths, prompting the two theorems with proofs forwarded herein. Linkages are synthesized in an effort to find coupler points which trace “near-circle” and “near-straight-line” entire paths. Some interesting results are obtained in studying the motion behavior of coupler points on such linkages.
16
MISIRPASHAEV, T. SH. "TO THE TOPOLOGY OF KRAMERS-WANNIER DUALITY". International Journal of Modern Physics A 09, nr 16 (30.06.1994): 2755–72. http://dx.doi.org/10.1142/s0217751x94001126.
Pełny tekst źródłaStreszczenie:
We show that for an even-dimensional hypercubic lattice one can modify the construction of a dual lattice to have the correspondence edge-edge instead of the conventional correspondence edge-(d−1)-dimensional face. This gives a straightforward generalization of Kramers-Wannier duality for an even-dimensional Ising model. In the same way as the partition function for the 2D Ising model is related to a sum over paths on a torus, higher-dimensional models involve sums over paths on Riemannian surfaces of higher genus. The critical temperature can be located only in the d=2 case in which all topological effects disappear from the thermodynamic limit. The duality in higher dimensions, however, being weak, leads nevertheless to some interesting relations for sums over paths on Riemannian surfaces, which can be considered as a topological characteristic of a critical point.
17
Gutiérrez Casas, Marco Vinicio, i Diego A. Monsalve Sánchez. "Diseño de una aplicación móvil que actualiza procesos de enseñanza aprendizaje permitiendo la adquisición de conocimientos en capacidades físicas condicionales y deportes". Reflexiones 6 (1.12.2016): 89–104. http://dx.doi.org/10.18041/2011-5768/reflexiones.0.2016.4352.
Pełny tekst źródłaStreszczenie:
This article shows how ninth grade students from Eduardo Umaña Mendoza school in Bogotá, find dynamic and interesting paths in the teaching-learning process when comparing the results of a pre and post survey that inquiries about physical capacities and sports. The intervention is an implementation of a mobile application that proposes interactive and current paths in the educational process. The results are compared with quantitative statistical methods and it is concluded that the application affects efficiently the acquisition of knowledge in physical capacities and sports of ninth grade students, compared to a control group, and that the implementation of a mobile application has more significance than the traditional model.
18
Gawrysiak-Zabłocka, Aleksandra. "THE SLOVENIAN REGULATION ON MOUNTAIN TRAILS". Zeszyty Prawnicze 22, nr 3 (19.10.2022): 257–73. http://dx.doi.org/10.21697/zp.2022.22.3.11.
Pełny tekst źródłaStreszczenie:
2022 marks the centenary of the institution of the Knafelc Blaze (Svn. Knafelčeva markacija), one of the symbols of Slovenian mountaineering. This is a good opportunity to take a look at current Slovenian regulations regarding hiking trails. The Slovenian Mountain Paths (Trails) Act (Svn. Zakon o planinskih poteh) covers many aspects of the subject, such as the construction, maintenance and marking of mountain paths and the conditions for their safe use. This regulation can be an interesting contribution to the discussion which has been going on for many years in Poland, on the need for, and way to regulate issues relating to hiking trails.
19
Eboli, Laura, Carmen Forciniti, Gabriella Mazzulla i Maria Grazia Bellizzi. "Establishing Performance Criteria for Evaluating Pedestrian Environments". Sustainability 15, nr 4 (14.02.2023): 3523. http://dx.doi.org/10.3390/su15043523.
Pełny tekst źródłaStreszczenie:
(1) Background: Promoting pedestrian mobility represents a strategy for achieving a sustainable transportation system, where problems such as traffic congestion, air and noise pollution are minimized. For this aim, it becomes fundamental to identify pedestrian environments that can facilitate and encourage making trips by walking. The objective of this paper is to provide a practical methodology that can assist the analyst in identifying the best alternative among some pedestrian paths with different characteristics. (2) Methods: To this aim, subjective, objective and mixed indicators were proposed to measure the performance criteria adopted for evaluating the alternatives. A multi-criteria analysis was applied as a tool of evaluation. (3) Results: The findings of the work suggest that pedestrians seem to appreciate the tree-lined paths and prefer to keep bike lines separated from pedestrian paths. Number of crosswalks is relevant in the evaluation of pedestrian paths, especially when there are shops along the path. Aspects related to the conditions of the pavement and to comfort and environment are less relevant. (4) Conclusions: The use of both subjective and objective indicators allows consideration of some different aspects and discovery of more interesting findings. Management strategies could be oriented to make the paths more delightful and serviceable for the users.
20
Raussen, Martin. "Strictifying and taming directed paths in Higher Dimensional Automata". Mathematical Structures in Computer Science 31, nr 2 (luty 2021): 193–213. http://dx.doi.org/10.1017/s0960129521000128.
Pełny tekst źródłaStreszczenie:
AbstractDirected paths have been used by several authors to describe concurrent executions of a program. Spaces of directed paths in an appropriate state space contain executions with all possible legal schedulings. It is interesting to investigate whether one obtains different topological properties of such a space of executions if one restricts attention to schedulings with “nice” properties, e.g. involving synchronisations. This note shows that this is not the case, i.e. that one may operate with nice schedulings without inflicting any harm. Several of the results in this note had previously been obtained by Ziemiański in Ziemiański (2017. Applicable Algebra in Engineering, Communication and Computing28 497–525; 2020a. Journal of Applied and Computational Topology4 (1) 45–78). We attempt to make them accessible for a wider audience by giving an easier proof for these findings by an application of quite elementary results from algebraic topology; notably the nerve lemma.
21
Jiang, Yunjiang, i Weijun Xu. "On the Number of Turns in Reduced Random Lattice Paths". Journal of Applied Probability 50, nr 2 (czerwiec 2013): 499–515. http://dx.doi.org/10.1239/jap/1371648957.
Pełny tekst źródłaStreszczenie:
We consider the tree-reduced path of a symmetric random walk on ℤd. It is interesting to ask about the number of turns Tn in the reduced path after n steps. This question arises from inverting the signatures of lattice paths: Tn gives an upper bound of the number of terms in the signature needed to reconstruct a ‘random’ lattice path with n steps. We show that, when n is large, the mean and variance of Tn in the asymptotic expansion have the same order as n, while the lower-order terms are O(1). We also obtain limit theorems for Tn, including the large deviations principle, central limit theorem, and invariance principle. Similar techniques apply to other finite patterns in a lattice path.
22
Wheatcroft, John. "A search for new paths in Chinese industrial relations". Human Resource Management International Digest 24, nr 4 (13.06.2016): 35–37. http://dx.doi.org/10.1108/hrmid-03-2016-0036.
Pełny tekst źródłaStreszczenie:
Purpose Collective bargaining (CB) in China is perceived as inadequate, thanks to the lack of trade union independence and representation. However, there are interesting developments in some parts of the country, including Wenling, a massive manufacturing center examined here. Design/methodology/approach This qualitative case study covers all stakeholders, including the government, trade unions, sweater association, workers and employers. Findings This paper examines initially the way that trade unions are constrained by corporatism in China. Increased industrial conflicts could push employers to become the engine of change. It finds that employers endeavor to use CB as a tool to stabilize employment relations and neutralize workers resistance. A gradual transition in labor relations system is on the way. The “Wenling Way” described here could become more widely used and is seen in some quarters as a possible model. Originality/value This paper offers new insights into the under-reported area of Chinese industrial relations.
23
Hernández Ulloa, Carlos, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo i Sven Koenig. "A Simple and Fast Bi-Objective Search Algorithm". Proceedings of the International Conference on Automated Planning and Scheduling 30 (1.06.2020): 143–51. http://dx.doi.org/10.1609/icaps.v30i1.6655.
Pełny tekst źródłaStreszczenie:
Many interesting search problems can be formulated as bi-objective search problems, that is, search problems where two kinds of costs have to be minimized, for example, travel distance and time for transportation problems. Bi-objective search algorithms have to maintain the set of undominated paths from the start state to each state to compute the set of paths from the start state to the goal state that are not dominated by some other path from the start state to the goal state (called the Pareto-optimal solution set). Each time they find a new path to a state s, they perform a dominance check to determine whether this path dominates any of the previously found paths to s or whether any of the previously found paths to s dominates this path. Existing algorithms do not perform these checks efficiently. On the other hand, our Bi-Objective A* (BOA*) algorithm requires only constant time per check. In our experimental evaluation, we show that BOA* can run an order of magnitude (or more) faster than state-of-the-art bi-objective search algorithms, such as NAMOA*, NAMOA*dr, Bi-Objective Dijkstra, and Bidirectional Bi-Objective Dijkstra.
24
Jiang, Yunjiang, i Weijun Xu. "On the Number of Turns in Reduced Random Lattice Paths". Journal of Applied Probability 50, nr 02 (czerwiec 2013): 499–515. http://dx.doi.org/10.1017/s0021900200013528.
Pełny tekst źródłaStreszczenie:
We consider the tree-reduced path of a symmetric random walk on ℤ d . It is interesting to ask about the number of turns T n in the reduced path after n steps. This question arises from inverting the signatures of lattice paths: T n gives an upper bound of the number of terms in the signature needed to reconstruct a ‘random’ lattice path with n steps. We show that, when n is large, the mean and variance of T n in the asymptotic expansion have the same order as n, while the lower-order terms are O(1). We also obtain limit theorems for T n, including the large deviations principle, central limit theorem, and invariance principle. Similar techniques apply to other finite patterns in a lattice path.
25
Koshy, Thomas. "Pell Walks". Mathematical Gazette 97, nr 538 (marzec 2013): 27–35. http://dx.doi.org/10.1017/s0025557200005398.
Pełny tekst źródłaStreszczenie:
Like Fibonacci and Lucas numbers, Pell and Pell-Lucas numbers are a fertile ground for creativity and exploration. They also have interesting applications to combinatorics [1], especially to the study of lattice paths [2, 3], as we will see shortly.Pell numbers Pn and Pell-Lucas numbers Qn are often defined recursively [4, 5]:where n ≥ 3. They can also be defined by Binet-like formulas:
26
Hetyorini, Hetyorini Hetyorini, Susmita Eka Mukti i Aziz Maulana Maulana. "The The Effectiveness Of The Pedestrian Path And Ramp On Jl. Imam Bonjol Corridor Semarang". Canopy: Journal of Architecture 12, nr 1 (30.08.2023): 41–52. http://dx.doi.org/10.15294/canopy.v12i1.72282.
Pełny tekst źródłaStreszczenie:
Pedestrian paths and ramps are public facilities that are used by pedestrians and people with disabilities in accessing a place, moving from one place to another, connecting to a destination or carrying out other activities in urban space. Provision of pedestrian paths and ramps must be accessible, effective, and keep activities in urban spaces running well. One of the pedestrian and ramp lanes in Jl. Imam Bonjol corridor Semarang is interesting to study in which the existence of pedestrian paths and ramps can be said is still limited to providing public facilities without regard to quality, continuity of function of facilities and respect for users, both pedestrians and people with disabilities. However, the condition of the pedestrian paths and ramps in Jl. Imam Bonjol corridor is good enough, but there are some significant things that can hinder the user's circulation. Several sections of pedestrian paths and ramps are used as parking lots for vehicles, rickshaws and cars. The guiding line for the blind is cut off in several places and sometimes even leads to an open exhaust channel. In some sections it turns out to be difficult for the disabled to use it. This fact is very unfortunate because pedestrians and people with disabilities have the same rights in the use of pedestrian paths and ramps. This study aims to provide design solutions to the problem of designing pedestrian paths and ramps on Imam Bonjol Semarang street corridor to connect urban activity centers so as to provide an ease and convenience access and improve the quality of urban space. A qualitative descriptive method is used in this research, namely by describing the problem to be studied in more depth in order to find solutions and develop the findings of previous studies.
27
Pace, Ian. "The Panorama of Michael Finnissy (I)". Tempo, nr 196 (kwiecień 1996): 25–36. http://dx.doi.org/10.1017/s0040298200004952.
Pełny tekst źródłaStreszczenie:
A Michael Finnissy work is like a journey from one point to another, along which there are any number of digressions off the ‘main path’, some of them extended. By the end of this journey, one realizes that the digressions were far more interesting than the conclusion: indeed the journey primarily served the purpose of enticingone into the space in question. As a ‘guide’ through the near 200 works that occupy Michael Finnissy's catalogue in the year of his 50th birthday, I shall take the liberty of constructing ‘paths’ of my own: after all, there are an infinite number of such paths, and though none will lead us through the oeuvre in its entirety, I wish to give some impression of the sheer scope and stimulation of Finnissy6s body of work.
28
Cifuentes-Férez, Paula. "A closer look at Paths of vision, Manner of vision and their translation from English into Spanish". Languages in Contrast 14, nr 2 (30.09.2014): 214–50. http://dx.doi.org/10.1075/lic.14.2.03cif.
Pełny tekst źródłaStreszczenie:
Motion and vision seem to be connected domains in, at least, two respects. Vision is a kind of “fictive motion” (Talmy, 1996; 2000a), and both domains seem to appear in similar syntactic constructions (Gruber, 1967; 1976; Slobin, 2008). In this study, we examine whether the different lexicalisation patterns for motion events in English and Spanish also carry over into the domain of vision. In particular, we explore visual Path complexity, the semantic specificity of Manner of vision verbs, and the translation of visual Paths and Manner of vision from English into Spanish. On the whole, this paper provides evidence for parallels between visual and physical motion with regard to visual Paths, Manner of vision and English-Spanish translation. Moreover, it provides interesting insights into further cross-linguistic differences in terms of Manner of vision granularity.
29
Minea, Alexandru, i Patrick Villieu. "DEBT POLICY RULE, PRODUCTIVE GOVERNMENT SPENDING, AND MULTIPLE GROWTH PATHS: A NOTE". Macroeconomic Dynamics 17, nr 4 (30.01.2012): 947–54. http://dx.doi.org/10.1017/s1365100511000642.
Pełny tekst źródłaStreszczenie:
In a very interesting endogenous growth model, Futagami, Iwaisako, and Ohdoi [Macroeconomic Dynamics 12 (2008), 445–462] study the long-run growth effect of borrowing for public investment. Their model exhibits (i) the multiplicity of balanced growth paths (BGPs) in the long run (two steady states) and (ii) a possible indeterminacy of the transition path to the high-growth BGP. The goal of this note is to show that their results depend on a sharp assumption, namely the definition of the public debt target as a ratio to private capital. If the target is defined in terms of public debt–to–GDP ratio, both results vanish: the model exhibits a unique BGP (no multiplicity) and the adjustment path to this unique equilibrium is determinate (no indeterminacy).
30
FALOUTSOS, MICHALIS, RAJESH PANKAJ i KENNESTH C. SEVCIK. "THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM". International Journal of Foundations of Computer Science 13, nr 06 (grudzień 2002): 889–910. http://dx.doi.org/10.1142/s0129054102001527.
Pełny tekst źródłaStreszczenie:
In this paper, we study the problem of multicast routing on directed graphs. We define the asymmetry of a graph to be the maximum ratio of weights on opposite directed edges between a pair of nodes for all node-pairs. We examine three types of problems according the membership behavior: (i) the static, (ii) the join-only, (iii) the join-leave problems. We study the effect of the asymmetry on the worst case performance of two algorithms: the Greedy and Shortest Paths algorithms. The worst case performance of Shortest Paths is poor, but it is affected by neither the asymmetry nor the membership behavior. In contrast, the worst case performance of Greedy is a proportional to the asymmetry in a some cases. We prove an interesting result for the join-only problem: the Greedy algorithm has near-optimal on-line performance.
31
Breen, Jane, Steve Butler, Nicklas Day, Colt DeArmond, Kate Lorenzen, Haoyang Qian i Jacob Riesen. "Computing Kemeny's constant for a barbell graph". Electronic Journal of Linear Algebra 35 (9.12.2019): 583–98. http://dx.doi.org/10.13001/ela.2019.5175.
Pełny tekst źródłaStreszczenie:
In a graph theory setting, Kemeny’s constant is a graph parameter which measures a weighted average of the mean first passage times in a random walk on the vertices of the graph. In one sense, Kemeny’s constant is a measure of how well the graph is ‘connected’. An explicit computation for this parameter is given for graphs of order n consisting of two large cliques joined by an arbitrary number of parallel paths of equal length, as well as for two cliques joined by two paths of different length. In each case, Kemeny’s constant is shown to be O(n3), which is the largest possible order of Kemeny’s constant for a graph on n vertices. The approach used is based on interesting techniques in spectral graph theory and includes a generalization of using twin subgraphs to find the spectrum of a graph.
32
Coyle, Whitney L., Makayle S. Kellison, Carson F. Cunningham, Kent L. Gee i Grant W. Hart. "Artemis I launch noise spectra: Effects of variable weather profiles over short- and long-range propagation paths". Journal of the Acoustical Society of America 153, nr 3_supplement (1.03.2023): A71. http://dx.doi.org/10.1121/10.0018200.
Pełny tekst źródłaStreszczenie:
NASA’s Space Launch System (SLS) launched the Artemis I mission at 1:47 am local time on November 16, 2022. The timing of the night launch offered a multitude of interesting weather effects over the propagation paths to measurement locations ranging from 1.5 km to 60 km. This presentation discusses spectra at different distances from Launch Complex 39B, both inside and outside the Kennedy Space Center perimeter. Preliminary analysis of the SLS sound pressure levels and spectra suggests many propagation phenomena are at play. In addition to geometric spreading, atmospheric absorption, and nonlinear propagation, complex weather profiles and ground effects are discussed. Initial results of a single-frequency Greens-function parabolic equation model, with estimated weather profiles along the propagation paths, will be offered with approximate source and receiver height to compare levels at several locations.
33
McDermott, M., S. K. Prasad, S. Shekhar i X. Zhou. "INTERESTING SPATIO-TEMPORAL REGION DISCOVERY COMPUTATIONS OVER GPU AND MAPREDUCE PLATFORMS". ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences II-4/W2 (10.07.2015): 35–41. http://dx.doi.org/10.5194/isprsannals-ii-4-w2-35-2015.
Pełny tekst źródłaStreszczenie:
Discovery of interesting paths and regions in spatio-temporal data sets is important to many fields such as the earth and atmospheric sciences, GIS, public safety and public health both as a goal and as a preliminary step in a larger series of computations. This discovery is usually an exhaustive procedure that quickly becomes extremely time consuming to perform using traditional paradigms and hardware and given the rapidly growing sizes of today’s data sets is quickly outpacing the speed at which computational capacity is growing. In our previous work (Prasad et al., 2013a) we achieved a 50 times speedup over sequential using a single GPU. We were able to achieve near linear speedup over this result on interesting path discovery by using Apache Hadoop to distribute the workload across multiple GPU nodes. Leveraging the parallel architecture of GPUs we were able to drastically reduce the computation time of a 3-dimensional spatio-temporal interest region search on a single tile of normalized difference vegetative index for Saudi Arabia. We were further able to see an almost linear speedup in compute performance by distributing this workload across several GPUs with a simple MapReduce model. This increases the speed of processing 10 fold over the comparable sequential while simultaneously increasing the amount of data being processed by 384 fold. This allowed us to process the entirety of the selected data set instead of a constrained window.
34
Hernández Ulloa, Carlos, William Yeoh, Jorge Baier, Luis Suazo, Han Zhang i Sven Koenig. "A Simple and Fast Bi-Objective Search Algorithm". Proceedings of the International Symposium on Combinatorial Search 11, nr 1 (1.09.2021): 125–26. http://dx.doi.org/10.1609/socs.v11i1.18521.
Pełny tekst źródłaStreszczenie:
Many interesting search problems can be formulated as bi-objective search problems; for example, transportation problems where both travel distance and time need to be minimized. Multi-objective best-first search algorithms need to maintain the set of undominated paths from the start state to each state to compute a set of paths from a given start state to a given goal state (the Pareto-optimal solutions) such that no path in the set is dominated by another path in the set. Each time they find a new path to a state n, they perform a dominance check to determine whether such a path dominates any of the previously found paths to n. Existing algorithms do not perform these checks efficiently, requiring at least a full iteration over the Open list per check. In this paper, we present the first multi-objective algorithm that performs these checks efficiently. Indeed, Bi-Objective A* (BOA*)—our algorithm—requires constant time to check for dominance. Our experimental evaluation shows that BOA*is orders-of-magnitude faster than state-of-the-art search algorithms, such as NAMOA*, Bi-Objective Dijkstra, and Bidirectional Bi-Objective Dijkstra.
35
Hogeweg, P. "Shapes in the Shadow: Evolutionary Dynamics of Morphogenesis". Artificial Life 6, nr 1 (styczeń 2000): 85–101. http://dx.doi.org/10.1162/106454600568339.
Pełny tekst źródłaStreszczenie:
This article investigates the evolutionary dynamics of morphogenesis. In this study, morphogenesis arises as a side-effect of maximization of number of cell types. Thus, it investigates the evolutionary dynamics of side-effects. Morphogenesis is governed by the interplay between differential cell adhesion, gene-regulation, and intercellular signaling. Thus, it investigates the potential to generate complex behavior by entanglement of relatively “boring” processes, and the (automatic) coordination between these processes. The evolutionary dynamics shows all the hallmarks of evolutionary dynamics governed by nonlinear genotype phenotype mapping: for example, punctuated equilibria and diffusion on neutral paths. More striking is the result that interesting, complex morphogenesis occurs mainly in the “shadow” of neutral paths which preserve cell differentiation, that is, the interesting morphologies arise as mutants of the fittest individuals. Characteristics of the evolution of such side-effects in the shadow appear to be the following: (1) The specific complex morphologies are unique (or at least very rare) among the set of de novo initiated evolutionary histories. (2) Similar morphologies are reinvented at large temporal distances during one evolutionary history and also when evolution is restarted after the main cell differentiation pattern has been established. (3) A mosaic-like evolution at the morphological level, where different morphological features occur in many combinations, while at the genotypic level recombination is not implemented and genotypes diverge linearly and at a constant rate.
36
Piotrowska, Marlena. "Początki politycznej kariery czołowych polityczek CDU i CSU na poziomie federalnym w Niemczech w latach 1991–2018". Rocznik Polsko-Niemiecki, nr 28 (17.12.2020): 181–205. http://dx.doi.org/10.35757/rpn.2020.28.06.
Pełny tekst źródłaStreszczenie:
The article focuses on the first steps in the political career of female politicians from the Christian Democratic Union (CDU) and the Christian Social Union (CSU), who assumed top political positions at the federal level in Germany between 1991 and 2018. The author analyses when the female leaders of the CDU and CSU took their first parliamentary seats in the German Bundestag, when they obtained the first leading positions at the federal level, and also how many years after joining the party this took place. It is also interesting whether top female politicians took their first parliamentary seats through votes in direct districts or thanks to the party list (second votes). Do the career paths of the female politicians from the Christian Democrats fit the model of typical career paths, or do they also include those who have avoided key positions on their way to the top?
37
Zhang, Zhonghua, Caijin Yang, Weihua Zhang, Yanhai Xu, Yiqiang Peng i Maoru Chi. "Motion Control of a 4WS4WD Path-Following Vehicle: Further Studies on Steering and Driving Models". Shock and Vibration 2021 (4.01.2021): 1–25. http://dx.doi.org/10.1155/2021/8830841.
Pełny tekst źródłaStreszczenie:
Further research on motion control of a 4WS4WD path-following vehicle is carried out in this paper. Focuses are placed on understanding and testing the vehicle path-following control models developed previously at a deep level. Control models are in relation to parameters introduced, and the effects of these parameters are discovered. Control models are interpreted by dynamic simulation using a 3DOF vehicle model with three cases. Three kinds of planned paths are considered in these cases to test control performances, which include the straight, circular, and sinusoidal paths. Interesting dynamic results are obtained and analyzed qualitatively, e.g., various steering modes. Simulation studies are extended with consideration of a fine vehicle dynamic model established in CarSim and a complex path composed of straight and curved segments. Control models are examined in a complex problem, and results obtained show that they are validated with robustness in dynamic environment.
38
Petrova, O. V., O. R. Chepyuk, S. D. Makarova, V. V. Mariko i A. I. Gorylev. "Master’s Programs in Russia: Four Paths of Future Development". Vysshee Obrazovanie v Rossii = Higher Education in Russia 30, nr 8-9 (8.09.2021): 20–33. http://dx.doi.org/10.31992/0869-3617-2021-30-8-9-20-33.
Pełny tekst źródłaStreszczenie:
The publication raises the question of the role of master’s degree in the system of modern higher education. Based on a survey of opinions (three-party survey) of key stakeholder groups (employers; students in higher education programs; managers of master’s degree programs; master’s degree teachers), the authors consider possible options for developing master’s degree as one of the key stages of higher education in Russia. The authors conclude that university development programs in the field of master’s degree education should be designed taking into account the high level of uncertainty in the external environment, which means that they should provide for scenario modeling of the future of the entire scientific and educational ecosystem. The study uses the classification of four types of the future labor market (“technological world”, “world of social responsibility”, “world of entrepreneurship” and “world of corporations”) as the main hypothesis about the options for such scenario planning. The study results are visualized in the form of a roadmap for the strategic development of the Russian master’s degree programs, highlighting key trends for each of the development options. The practical result of the study was the identification of the main “gaps” in the positions of stakeholders on the status of the master’s degree program and effective models of its implementation. The conclusions and results of the publication will be interesting for the purposes of the university strategic management, the formation of a development strategy for the master’s degree, as well as the development of special programs for interaction with employers and students.
39
Lin, Mingmin, Yingpei Zeng, Ting Wu, Qiuhua Wang, Linan Fang i Shanqing Guo. "GSA-Fuzz: Optimize Seed Mutation with Gravitational Search Algorithm". Security and Communication Networks 2022 (15.07.2022): 1–17. http://dx.doi.org/10.1155/2022/1505842.
Pełny tekst źródłaStreszczenie:
Mutation-based fuzzing is currently one of the most effective techniques to discover software vulnerabilities. It relies on mutation strategies to generate interesting seeds. As a state-of-the-art mutation-based fuzzer, AFL follows a mutation strategy with high randomization, which uses randomly selected mutation operators to mutate seeds at random offsets. Its strategy may ignore some efficient mutation operators and mutation positions. Therefore, in this paper, we propose a solution named GSA-Fuzz to improve the efficiency of seed mutation strategy with the gravitational search algorithm (GSA). GSA-Fuzz uses GSA to learn the optimal selection probability distributions of operators and mutation positions and designs a position-sensitive strategy to guide seed mutation with learned distributions. Besides, GSA-Fuzz also provides a flip mode to calculate the efficiencies of the deterministic stage and indeterministic stage and implements switching between the two stages to further improve the efficiency of seed mutation. We compare GSA-Fuzz with the state-of-the-art fuzzers AFL, MOPT-AFL, and EcoFuzz on 10 open-source programs. GSA-Fuzz finds 145% more paths than AFL, 66% more paths than EcoFuzz, and 43% more paths than MOPT-AFL. In addition, GSA-Fuzz also outperforms other fuzzers in bug detection and line coverage.
40
Peidayesh, Hamed, Katarína Mosnáčková, Zdenko Špitalský, Abolfazl Heydari, Alena Opálková Šišková i Ivan Chodák. "Thermoplastic Starch–Based Composite Reinforced by Conductive Filler Networks: Physical Properties and Electrical Conductivity Changes during Cyclic Deformation". Polymers 13, nr 21 (4.11.2021): 3819. http://dx.doi.org/10.3390/polym13213819.
Pełny tekst źródłaStreszczenie:
Conductive polymer composites (CPC) from renewable resources exhibit many interesting characteristics due to their biodegradability and conductivity changes under mechanical, thermal, chemical, or electrical stress. This study is focused on investigating the physical properties of electroconductive thermoplastic starch (TPS)–based composites and changes in electroconductive paths during cyclic deformation. TPS–based composites filled with various carbon black (CB) contents were prepared through melt processing. The electrical conductivity and physicochemical properties of TPS–CB composites, including mechanical properties and rheological behavior, were evaluated. With increasing CB content, the tensile strength and Young’s modulus were found to increase substantially. We found a percolation threshold for the CB loading of approximately 5.5 wt% based on the rheology and electrical conductivity. To observe the changing structure of the conductive CB paths during cyclic deformation, both the electrical conductivity and mechanical properties were recorded in parallel using online measurements. Moreover, the instant electrical conductivity measured online during mechanical deformation of the materials was taken as the parameter indirectly describing the structure of the conductive CB network. The electrical conductivity was found to increase during five runs of repeated cyclic mechanical deformations to constant deformation below strain at break, indicating good recovery of conductive paths and their new formation.
41
Mao, Kangkun, i Yi Xiao. "Learning the Fastest RNA Folding Path Based on Reinforcement Learning and Monte Carlo Tree Search". Molecules 26, nr 15 (22.07.2021): 4420. http://dx.doi.org/10.3390/molecules26154420.
Pełny tekst źródłaStreszczenie:
RNA molecules participate in many important biological processes, and they need to fold into well-defined secondary and tertiary structures to realize their functions. Like the well-known protein folding problem, there is also an RNA folding problem. The folding problem includes two aspects: structure prediction and folding mechanism. Although the former has been widely studied, the latter is still not well understood. Here we present a deep reinforcement learning algorithms 2dRNA-Fold to study the fastest folding paths of RNA secondary structure. 2dRNA-Fold uses a neural network combined with Monte Carlo tree search to select residue pairing step by step according to a given RNA sequence until the final secondary structure is formed. We apply 2dRNA-Fold to several short RNA molecules and one longer RNA 1Y26 and find that their fastest folding paths show some interesting features. 2dRNA-Fold is further trained using a set of RNA molecules from the dataset bpRNA and is used to predict RNA secondary structure. Since in 2dRNA-Fold the scoring to determine next step is based on possible base pairings, the learned or predicted fastest folding path may not agree with the actual folding paths determined by free energy according to physical laws.
42
Li, Yajing, Bin Ren i Xu Chen. "Cyclic Deformation and Low-Cycle Fatigue for 316LN Stainless Steel under Non-proportional Loading". MATEC Web of Conferences 300 (2019): 08002. http://dx.doi.org/10.1051/matecconf/201930008002.
Pełny tekst źródłaStreszczenie:
The effects of loading path and strain amplitude ratio on the cyclic behavior and fatigue life were investigated on a 316LN nuclear grade stainless steel employing a series of symmetrically strain-controlled fatigue tests at room temperature. The loading paths of Uniaxial, Torsional, Proportional, Rhombic, Rectangular, and Circular were employed with the constant equivalent strain amplitude of 0.5%. The strain amplitude ratio of 2.35, 1.73 and 1.27, defined by the ratio of shear strain amplitude to the axial strain amplitude, was realized by changing the shear strain amplitude under Proportional, Rhombic, Rectangular and Elliptical loading paths. As expected, the significant non-proportional additional hardening was observed. It’s interesting to note that the axial cyclic stress response varied with the strain amplitude ratio, and the law was different under different loading paths. The fatigue life of all the tests were evaluated by three critical plane criteria proposed by Smith-Watson-Topper (SWT), Fatemi-Socie (FS) and Chen-Xu-Huang (CXH). Results show that the SWT criterion significantly overestimated the fatigue life of non-proportional loading because the effect of shear damage was not considered. The CXH criterion for tensile-type failure yielded good prediction results except for two torsional data points. The FS criterion provided better predictions than other models.
43
Mahendra, A. S., K. Bararatin, S. Nugroho, R. Kharismawan i W. A. Suryawan. "Intervention on pedestrian paths on high risk object in the City of Surabaya during the Covid-19 pandemic". IOP Conference Series: Earth and Environmental Science 1015, nr 1 (1.04.2022): 012009. http://dx.doi.org/10.1088/1755-1315/1015/1/012009.
Pełny tekst źródłaStreszczenie:
Abstract Urban facilities, such as pedestrian paths, were affected by the Covid-19 pandemic. Activity restrictions imposed by the government through official regulations for various regions were one of the causes of the reduction of movement. During the pandemic, the intensity of pedestrian use seemed to be lower than before. However, a particular location showed an interesting phenomenon of intervention on the pedestrian path around public facilities, which did not change the intensity of use. Interestingly, the intervention on the pedestrian path was around the buildings that directly handled Covid-19 and had a high transmission risk, namely hospitals and markets. This paper employed a qualitative approach by collecting the data through field observation in 3 (three) designated hospitals in Surabaya city, which were considered vulnerable places and aim to understand complex phenomena. The result found that the intervention of the pedestrian path was mainly located on the critical side for movement and circulation as well as the mobilization of the service area, also indicated there are use pedestrian path to paddle, wait and relax at certain time. As an important part of urban facilities, the pedestrian path needs to be a concern, especially in locations with a high risk of virus transmission potential.
44
Wang, Chunxiao, Qingxin Zhou i Zhigang Wang. "Geometrical particles and Legendrian dualities related to null curves". International Journal of Modern Physics A 35, nr 09 (30.03.2020): 2050051. http://dx.doi.org/10.1142/s0217751x20500517.
Pełny tekst źródłaStreszczenie:
In this paper, we investigate the special properties of geometrical particles with null paths in de Sitter 3-space–time, new Frenet equations and an important invariant associated with null paths are presented. By means of unfolding theory, the local topological structure of the lightlike dual surfaces is revealed. It is found that the lightlike dual surface has some singularities whose types can be determined by the invariant. Based on the theory of Legendrian dualities on pseudospheres and the theory of contact manifolds, it is shown that there exists the [Formula: see text]-dual relationship between the lightlike transversal trajectory of the particle and the lightlike dual surface. In addition, an interesting and important fact mentioned is that the contact of lightlike transversal trajectory with lightcone quadric and the contact of lightlike transversal trajectory with null hyperplane have the same order when they are related to the same type of singularities of the lightlike dual surface.
45
Chen, Heng, Jian Hou i Wei Chen. "Threshold Effect of Knowledge Accumulation between Innovation Path and Innovation Performance: New Evidence from China’s High-tech Industry". Science, Technology and Society 23, nr 1 (8.01.2018): 163–84. http://dx.doi.org/10.1177/0971721817744459.
Pełny tekst źródłaStreszczenie:
In the process of transitioning from closed to open innovation, regions in developing countries need to understand how to choose the most effective path within the complex innovation system while considering their own innovation factors. Based on provincial panel data from China’s high-tech industry and the improved dynamic threshold model, we introduce the threshold of knowledge accumulation (KLA) into the non-linear mechanism between innovation paths and innovation performance to compare the dynamic threshold effect and its heterogeneity. This research provides interesting insights into innovation paths, showing that the relationship between the innovation path and innovation performance is significantly influenced by the threshold effect of KLA. As the level of KLA strengthens, its effects on each innovation path change. Overall, this article shows how KLA affects the relationship between the innovation path and innovation performance. The article concludes with a discussion of the implications of these insights for innovation management and policy.
46
Tuononen, Tiina A., Anna Liisa Suominen i Johanna Lammintakanen. "Career path from a dentist to a leader". Leadership in Health Services 31, nr 4 (1.10.2018): 384–97. http://dx.doi.org/10.1108/lhs-08-2017-0051.
Pełny tekst źródłaStreszczenie:
Purpose The purpose of this paper was to study the career paths of leaders with a career background as a dentist from basic degree to chief or executive leadership positions and individual factors that influenced their decisions. Design/methodology/approach Semi-structured interview and a questionnaire were used to study 13 leaders using the structure of Edgar Schein’s career anchor interview and career orientation inventory questionnaire. Theory-driven content analysis was used to analyze the data according to themes which included career paths, factors associated with job and career changes and thoughts about future careers. Findings Three different career path types were identified: Progressives (Type A), By chance (Type B), and Enthusiasts (Type C). The main motives were: the Progressives’ goal orientation to proceed to higher leadership positions, the By chance group’s job and even career changing by taking a chance on an interesting possibility that comes their way and the Enthusiasts’ willingness to make a difference and search for possibilities to change things. The most important career anchor was “pure challenge” among the Progressives and By chance groups and “general managerial competence” among the Enthusiasts. Originality/value Studies on personal factors associating with career paths in health care are scarce and similarly leaders with a dentist background are less studied, even though leadership could be an excellent career choice for a dentist. Different individuals can have varied motives and career paths toward executive positions. Because of the multi-professional functions in health care, organizations could benefit from having leaders with different expertise backgrounds.
47
Cichowicz, T., M. Drozdowski, M. Frankiewicz, G. Pawlak, F. Rytwinski i J. Wasilewski. "Hyper-heuristics for cross-domain search". Bulletin of the Polish Academy of Sciences: Technical Sciences 60, nr 4 (1.12.2012): 801–8. http://dx.doi.org/10.2478/v10175-012-0093-7.
Pełny tekst źródłaStreszczenie:
Abstract In this paper we present two hyper-heuristics developed for the Cross-Domain Heuristic Search Challenge. Hyper-heuristics solve hard combinatorial problems by guiding low level heuristics, rather than by manipulating problem solutions directly. Two hyper-heuristics are presented: Five Phase Approach and Genetic Hive. Development paths of the algorithms and testing methods are outlined. Performance of both methods is studied. Useful and interesting experience gained in construction of the hyper-heuristics are presented. Conclusions and recommendations for the future advancement of hyper-heuristic methodologies are discussed.
48
Rault, Christophe. "Further Results on Weak Exogeneity in Vector Error Correction Models". Brazilian Review of Econometrics 25, nr 2 (1.11.2005): 159. http://dx.doi.org/10.12660/bre.v25n22005.2503.
Pełny tekst źródłaStreszczenie:
This paper extends the result for non-causality and strong exogeneity of Pradel and Rault and Pradel (2003) Exogeneity in VAR-ECM models with purely exogenous long-run paths, Oxford Bulletin of Economics and Statistics to weak exogeneity. More precisely, it provides a necessary and sufficient condition for weak exogeneity in vector error correction models. An interesting property is that the statistics involved in the sequential procedure for testing this condition are distributed as χ2 variables and can therefore be easily calculated with usual statistical computer packages, which makes our approach fully operational empirically
49
Gębura, Andrzej, i Mirosław Zieja. "The Idea to Synchronize Measuring Paths for Two Different Current Generators Operated as Position-Voltage Converters". Research Works of Air Force Institute of Technology 38, nr 1 (1.08.2016): 127–34. http://dx.doi.org/10.1515/afit-2016-0012.
Pełny tekst źródłaStreszczenie:
Abstract The study deals with the issue how to apply two different types of current generators at the same time, namely a three-phase AC generator and a DC generator of commutator type. What is more interesting, the two generators would be able to collaborate both during the phase of electromechanical sampling and the phase of electronic sampling. It will enable structural improvement of sensitivity and resolution parameters and shall open new opportunities to investigate new types if mechanical phenomena (that have not been already tracked by means of the FAM-C and FDM-A methods), such as torsion of torque transmission shafts.
50
Giménez Garcia-Conde, Miguel, Longinos Marin, Salvador Ruiz de Maya i Pedro J. Cuestas. "Parental Attitudes to Childhood Overweight: The Multiple Paths through Healthy Eating, Screen Use, and Sleeping Time". International Journal of Environmental Research and Public Health 17, nr 21 (27.10.2020): 7885. http://dx.doi.org/10.3390/ijerph17217885.
Pełny tekst źródłaStreszczenie:
The main goal of this paper is to examine how parental attitudes toward sleeping, screen use, and feeding their child influence the child’s body mass index (BMI) through the child’s behaviors related to time dedicated to sleep and television, and their healthy eating. Using survey data from 908 parents, results show that parental attitudes have a significant influence on children’s behavior and, more importantly, on their BMI. The three forms of a child’s behavior (sleeping, watching TV, and healthy eating patterns) are affected by what parents do and their attitudes toward these three behaviors at home. Results show how changes in parental attitudes are an interesting target to prevent the child’s overweight.