Search results

Functioning as space connectors, path structures in urban parks may rarely present social interaction opportunities, although centralized activity spaces are available. This paper investigated the interrelationships between the visual and physical accessibility attributes of path structure and their impacts on passive social interaction intensity across urban parks in Kuala Lumpur.

The concept of social interaction has been studied elsewhere in social cohesion, social affiliation and sense of communication. Still, it has not been studied in the context of urban park design. This study employed mixed methods using an adaptive and unique combination of qualitative and quantitative data collections to analyze urban parks with a bit of visual vegetation barrier. The experiential landscape method was applied to determine visual accessibility by interpreting experiential landscape maps. The space syntax method based on quantitative analysis is considered to measure physical accessibilities and vigorous activities along the designated paths by conducting integration analysis and gate observation. The data were crossed-analyzed using a Geographic Information System (GIS) classification technique, correlation analysis and Microsoft combo-charts to generate the relationship between patterns of activities and their accessibilities.

The results suggested that designated paths with higher accessibility attributes, impressively more elevated than other tracks, could influence the intensity of passive social interactions. The findings supported the understanding that activity nodes and active areas adjoining designated routes could make accessibility attribute areas more critical. These findings verify that visually enriching the spaces along the path structure toward activities is a pivotal contributor to urban planners and designers to enhance the paths’ local integration (LI) and visual accessibility to predict more passive eye contact among park visitors.

The proposed interrelationship among variables in this study has limitations because of not considering other qualitative methods and techniques like cognitive maps and interview simultaneously. These techniques could discover why some paths generate more passive eye contact among park users (Mohammadi Tahroodi, 2018).

Kuala Lumpur Structure Plan 2020 emphasizes Kuala Lumpur’s unique image as a tropical garden city via preserving and developing the iconic historical urban parks in the city center (CHKL, 2004, pp. 3–3). The latest Draft Kuala Lumpur Structure Plan 2040 has outlined the strategy to achieve a conducive, good-quality neighborhood that encourages social interaction. The findings could assist urban planners and designers better public parks by considering accessibility and permeability aspects of design. This research endorses the appropriateness of interrelationship between accessibility attributes of path structure and social interaction in urban design research, which local urban designers have not fully considered until now. Evaluating the visual convenience of designated paths and assessing LI of the axial lines constructing each designated route of urban parks during the primary stage could enable urban designers to estimate to what extent the paths are accessible and respond to passive social interaction. Then they could enrich with salient landmarks, views and activity nodes to make them attractive. The considerable number of designated paths connections, specifically while they shape the sides of activity nodes, could increase the connectivity and integration of spaces within the parks. These patterns of positioning the activity nodes make the designated routes more legible and provide ease of movement. As a result, it will give urban park users more information about the activities. Allowing people to use the paths will increase people’s presence and, subsequently, passive social interaction. One way is to locate accessible lands that provide social activities at direct visual access paths within urban parks for legibility.

The socially responsive urban design enhances the quality of life and provides life satisfaction, happiness and society’s overall health. Being in urban social parks in any passive and active situations has psychological benefits. It facilitates relief and rests from a stressful modern lifestyle that significantly impacts their mental health and well-being. The framework applied in this research integrates the social, spatial and physical aspects of parks design. With this regard, principles and indicators facilitate physically and socially attractive urban parks for Kuala Lumpur city center and applicable to similar contexts elsewhere.

The concept of social interaction has been studied elsewhere in social cohesion, social affiliation and sense of communication. Still, it has not been studied in the context of urban park design. This study employed mixed methods using an adaptive and unique combination of qualitative and quantitative data collections to analyze urban parks with a bit of visual vegetation barrier.

The purpose of this paper is to establish an adaptive assembly, to realize the adaptive changing of the models and to improve the flexibility and reliability of assembly change. For a three-dimensional (3D) computer-aided design (CAD) assembly in a changing process, there are two practical problems. One is delivering parameters’ information not smoothly. The other one is to easily destroy an assembly structure.

The paper establishes associated parameters design structure matrix of related parts, and predicts possible propagation paths of the parameters. Based on the predicted path, structured storage is made for the affected parameters, tolerance range and the calculation relations. The study combines structured path information and all constrained assemblies to build the adaptive assembly, proposes an adaptive change algorithm for assembly changing and discusses the extendibility of the adaptive assembly.

The approach would improve the flexibility and reliability of assembly change and be applied to different CAD platform.

The examples illustrate the construction and adaptive behavior of the assembly and verify the feasibility and reasonability of the adaptive assembly in practical application.

The adaptive assembly model proposed in the paper is an original method to assembly change. And compared with other methods, good results have been obtained.

Being an important data exchange and information storage standard, XML has generated a great deal of interest and particular attention has been paid to the issue of XML indexing. Clear use cases for structured search in XML have been established. However, most of the research in the area is either based on relational database systems or specialized semi‐structured data management systems. This paper aims to propose a method for XML indexing based on the information retrieval (IR) system Okapi.

First, the paper reviews the structure of inverted files and gives an overview of the issues of why this indexing mechanism cannot properly support XML retrieval, using the underlying data structures of Okapi as an example. Then the paper explores a revised method implemented on Okapi using path indexing structures. The paper evaluates these index structures through the metrics of indexing run time, path search run time and space costs using the INEX and Reuters RVC1 collections.

Initial results on the INEX collections show that there is a substantial overhead in space costs for the method, but this increase does not affect run time adversely. Indexing results on differing sized Reuters RVC1 sub‐collections show that the increase in space costs with increasing the size of a collection is significant, but in terms of run time the increase is linear. Path search results show sub‐millisecond run times, demonstrating minimal overhead for XML search.

Overall, the results show the method implemented to support XML search in a traditional IR system such as Okapi is viable.

The paper provides useful information on a method for XML indexing based on the IR system Okapi.

Design engineers use the term load path to describe, in general terms, the way in which loads path through a structure from the points of application to the points where they are reacted. In contrast, stress trajectories are more clearly identified by the direction of the principal stress vectors at a point. The first author proposed a simple definition of the term load path in 1995 and proposed procedures to determine load paths from two‐dimensional finite element solutions. In this paper, the concept of load paths will be further explored and related to stress trajectories and Michell structures. The insight given when determining the load transfer near a pin‐loaded hole will be demonstrated. In addition a cantilevered beam will be considered and an introduction to plotting load paths in three‐dimensional structures is given.

This paper demonstrates the capability of staggered solution procedure for coupled fluid‐structure interaction problems. Three possible computational paths for coupled problems are described. These are critically examined for a variety of coupled problems with different types of mesh partitioning schemes. The results are compared with the reported results by continuum mechanics priority approach—a method which has been very popular until recently. Optimum computational paths and mesh partitionings for two field problems are indicated. Staggered solution procedure is shown to be quite effective when optimum path and partitionings are selected.

Crowdfunding (CF) has become an increasingly popular means of financing for entrepreneurs and has attracted significant attention from both researchers and practitioners in recent years. The purpose of this study is to investigate the core content and knowledge diffusion paths in the CF field. Specifically, we aim to identify the main topics and themes that have emerged in this field and to trace the evolution of CF knowledge over time.

This study employs co-word clustering and main path analysis (MPA) to examine the historical development of CF research based on 1,528 journal articles retrieved from the Web of Science Core Collection database.

The results of the analysis reveal that CF research focuses on seven themes: sustainability, entrepreneurial finance, entrepreneurship, fintech, social entrepreneurship, social capital, and microcredits. The analysis of the four main paths reveals that equity CF has been the dominant topic in the past years. Recently, CF research has tended to focus on topics such as fintech, the COVID-19 pandemic, competition, Brexit, and policy response.

To the authors' best knowledge, this is the first attempt to explore knowledge diffusion dynamics in the CF field. Overall, the study offers a structure for analyzing the paths through which knowledge is diffused, enabling scholars to effectively manage a large volume of research papers and gain a deeper understanding of the historical, current, and future trends in the development of CF.

The purpose of this paper is to present an efficient method to integrate path generation and following for an unmanned aerial vehicle.

The shortest path is briefly reviewed using a straight line and a circular arc in a horizontal plane. Based on shortest paths, various path generation algorithms using oriented waypoints are described. Path design unit, which is structured concatenations of line segments and circular arcs, is proposed to represent different paths as one structure. Simple path following controller to follow a straight line and a circle was also implemented with linear‐quadratic regulator control laws. Some flight tests were conducted to verify the efficiency of proposed algorithm.

Proposed method represents various paths between given waypoints efficiently by a small number of parameters. It does not need a large amount of memory storage and computation time to run in real time on a low‐cost microprocessor.

This paper provides new structured method to generate different paths efficiently including Dubins' set, which makes path following easy by simple switching logic. It needs small computational time to run in real time. The proposed algorithm in this paper could be used as a basis of other applications such as air traffic control and curved landing approach, which require more accurate path control.

The increasing popularity of XML has generated a lot of interest in query processing over graph‐structured data. To support efficient evaluation of path expressions structured indexes have been proposed. Extending the proposed indexes to work with large XML graphs and to support intra‐ or inter‐document links requires a lot of computing power for the creation process and a lot of space to store the indexes. Moreover, the efficient evaluation of ancestors‐descendants queries over arbitrary graphs with long paths is a severe problem. This paper aims to propose a scalable path index which is based on the concept of 2‐hop covers as introduced by Cohen et al.

The problem of efficiently managing and querying XML documents poses interesting challenges on database research. The proposed algorithm for index creation scales down the original graph size substantially. As a result a directed acyclic graph with a smaller number of nodes and edges will emerge. This reduces the number of computing steps required for building the index. Thus, computing time and space will be reduced as well. The index also permits ancestors‐descendants relationships to be efficiently evaluated. Moreover, the proposed index has a nice property in comparison to most other work; it is optimized for descendants‐or‐self queries on arbitrary graphs with link relationships.

In this paper, a scalable path index is proposed. It can efficiently address the problem of querying large XML documents that contain links and have cycles. Cycles in the graph stress path‐indexing algorithms. An overview about 2‐hop cover and the algorithms that used to build the index are given.

This paper works on the updating problem. Since the construction of the index is quite complex its construction make sense for some time. However, this means it is currently dealing with the problem of updating XML‐documents.

This paper presents an efficient path index that can test the reachability between two nodes and evaluate ancestors‐descendants queries over arbitrary graphs with long paths.

The use of routines in the decision-making process of individuals, groups and organizations is a well accepted yet taken for granted phenomenon. One goal of organizations is to develop group routines that are efficient, but at the same time flexible. However, this presents a paradox because routines that are efficient at one point in time, or for a particular task, may persist, be unquestioned, and become increasingly inefficient for the group and the organization. This chapter develops a formal theory that describes the processes by which the legitimation of particular group structures impacts the development and use of group routines. The theory presented draws from theories of legitimation, expectation states theory, and institutional theory. The theory formally depicts three sources of legitimation: a referential belief structure (set of cultural beliefs) about expertise and leadership, authorization or superordinate support of a leader, and endorsement (support by group) of a leader. Specifically, the theory addresses: (1) how different sources of legitimation make groups more or less hierarchical; and (2) how the different sources of legitimation make group routines more or less flexible.