Search results

The paper explores the links between network structures and internationalization, conceptualized as a process of value innovation. The exploration sets off from the concept of an entry node, i.e. whether network entrance is facilitated by a direct dyadic or an indirect triadic relationship.

The paper is mainly conceptual, but also presents an empirical cross-border actor constellation which highlights the implications of the study.

Bi-directionality implies that value innovation is contingent on the fit between the actors involved in the entry node, not on the fulfilment of the needs of a focal actor. Further, the attractiveness of an entry node depends on network structures, the network positions of the actors in the entry node, the desired outcomes of entry (immersion or reach), and the actual behavior of the actors. The dynamics of transitivity can influence triadic entry nodes. However, transitivity operates differently in business networks than in social networks constituted by inter-personal ties. Therefore, closure of open triadic entry nodes is neither an automatic outcome of strong ties, nor a normatively better outcome.

The theorizing offered by this paper must be further explored in different empirical contexts to assess its practical adequacy. Still, the presented empirical case indicates that the expected attractiveness of entry nodes is closely linked to (in)transitivity.

The paper supports the relevance of expanding from a dyadic to a network perspective in order to capture the dynamics of value innovation in an international setting.

The purpose of this paper is to conceptualize “entry node”, to describe the entry node pattern (i.e. the initial entry node and changes in it) of small to medium‐sized enterprises (SMEs) entering emerging market business networks, and to determine how network nodes are associated with experiential knowledge.

Using data from an on‐site survey based on a standardized questionnaire, hypotheses were tested using ANOVA on 197 SMEs in southern Sweden that entered the emerging markets of the Baltic States, Poland, Russia, or China.

The entry node is the establishment point into a foreign market network. In total, four entry situations are defined – triad via home market; triad via host market; dyad from home market; and dyad at host market – each using different entry nodes. After initial entry, one third of the firms changed their nodes, primarily into a more committed node. Various nodes display significant differences in the level of accumulated societal, business network and customer‐specific experiential knowledge. A more committed node is associated with more experiential knowledge.

Knowledge is complex to measure, since various factors influence the level of accumulated experiential knowledge. This study examines the association between types of nodes and experiential knowledge, but does not aim to explain knowledge accumulation. Perceptual measures are used and possible method biases involved are safeguarded through an on‐site survey method.

This paper conceptualizes the novel concept of entry node, provides insight into the SME node pattern in emerging markets and examines the association between nodes and experiential knowledge.

The paper aims to propose an effective method to process keyword-based queries over graph-structured databases which are widely used in various applications such as XML, semantic web, and social network services. To satisfy users' information need, it proposes an extended answer structure for keyword queries, inverted list indexes on keywords and nodes, and query processing algorithms exploiting the inverted lists. The study aims to provide more effective and relevant answers to a given query than the previous approaches in an efficient way.

A new relevance measure for nodes to a given keyword query is defined in the paper and according to the relevance metric, a new answer tree structure is proposed which has no constraint on the number of keyword nodes chosen for each query keyword. For efficient query processing, an inverted list-style index is suggested which pre-computes connectivity and relevance information on the nodes in the graph. Then, a query processing algorithm based on the pre-constructed inverted lists is designed, which aggregates list entries for each graph node relevant to given keywords and identifies top-k root nodes of answer trees most relevant to the given query. The basic search method is also enhanced by using extend inverted lists which store additional relevance information of the related entries in the lists in order to estimate the relevance score of a node more closely and to find top-k answers more efficiently.

Experiments with real datasets and various test queries were conducted for evaluating effectiveness and performance of the proposed methods in comparison with one of the previous approaches. The experimental results show that the proposed methods with an extended answer structure produce more effective top-k results than the compared previous method for most of the queries, especially for those with OR semantics. An extended inverted list and enhanced search algorithm are shown to achieve much improvement on the execution performance compared to the basic search method.

This paper proposes a new extended answer structure and query processing scheme for keyword queries on graph databases which can satisfy the users' information need represented by a keyword set having various semantics.

The refined process structure tree (RPST), the hierarchy of non-overlapping single-entry single-exit (SESE) regions of a process model, has been utilized for better comprehension and more efficient analysis of business process models. Existing RPST methods, based on the triconnected components of edges, fail to identify a certain type of SESE region. The purpose of this paper is to introduce an alternative method for generating a complete RPST utilizing rather simple techniques.

The proposed method first focuses on the SESE regions of bonds and rigids, from the innermost ones to the outermost ones, utilizing dominance and post-dominance relations. Then, any SESE region of a series nested in a bond or a rigid is identified with a depth-first search variation. Two-phase algorithms and their completeness proofs, a software tool incorporating visualization of stepwise outcomes, and the experimental results of the proposed method are provided.

The proposed method utilizes simple techniques that allow their straightforward implementation. Visualization of stepwise outcomes helps process analysts to understand the proposed method and the SESE regions. Experiments with 604 SAP reference models demonstrated the limitation of the existing RPST methods. The proposed method, however, completely identified all types of SESE regions, defined with nodes, in less computation time than with the old methods.

Each triconnected component of the undirected version of a process model is associated with a pair of boundary nodes without discriminating between the entry and the exit. Here, each non-atomic SESE region is associated with two distinct entry and exit nodes from the original model in the form of a directed graph. By specifying the properties of SESE regions in more comprehensible ways, this paper facilitates a deeper understanding of SESE regions rather than relying on the resulting RPST.

Mobility management for single‐hop cellular networks has received much research attention in the last few years. One of the research challenges for 4G wireless systems is the design of mobility management techniques that integrate cellular and ad‐hoc networks. Currently, there are no structured mobility management schemes for these heterogeneous multi‐hop networks. This paper aims to address these issues.

This paper describes techniques for tracking a mobile node (MN) in an integrated architecture with minimum overhead. This paper proposes group rerouting concept.

The paper implements and evaluates the proposed protocol by using the network simulator (NS‐2). The proposed protocol increases performance compared to broadcasting schemes.

This scheme considers devices with two interfaces only.

The paper proposes a scheme to extend the coverage of cellular base stations by using ad‐hoc devices.

This paper describes techniques for tracking an MN in an integrated architecture with minimum overhead. This scheme is independent of the routing protocol used in a multi‐hop network.

In purpose of this paper is to propose a novel scheme to process XPath-based keyword search over Extensible Markup Language (XML) streams, where one can specify query keywords and XPath-based filtering conditions at the same time. Experimental results prove that our proposed scheme can efficiently and practically process XPath-based keyword search over XML streams.

To allow XPath-based keyword search over XML streams, it was attempted to integrate YFilter (Diao et al., 2003) with CKStream (Hummel et al., 2011). More precisely, the nondeterministic finite automation (NFA) of YFilter is extended so that keyword matching at text nodes is supported. Next, the stack data structure is modified by integrating set of NFA states in YFilter with bitmaps generated from set of keyword queries in CKStream.

Extensive experiments were conducted using both synthetic and real data set to show the effectiveness of the proposed method. The experimental results showed that the accuracy of the proposed method was better than the baseline method (CKStream), while it consumed less memory. Moreover, the proposed scheme showed good scalability with respect to the number of queries.

Due to the rapid diffusion of XML streams, the demand for querying such information is also growing. In such a situation, the ability to query by combining XPath and keyword search is important, because it is easy to use, but powerful means to query XML streams. However, none of existing works has addressed this issue. This work is to cope with this problem by combining an existing XPath-based YFilter and a keyword-search-based CKStream for XML streams to enable XPath-based keyword search.

Resource discovery in peer‐to‐peer (P2P) systems have been extensively studied. Unfortunately, most of the systems studied are not designed to take advantage of the heterogeneity in peer nodes. In this paper, we propose a novel P2P overlay called RATTAN, which serves as an underlay of a Gnutella‐like network. RATTAN exploits the heterogeneity of peer nodes by structuring capable nodes as the core of the overlay. Using a tree‐like structure, RATTAN can maximize the search scope with a minimal number of query messages. We evaluate RATTAN with simulation. The experiments show the following interesting results. First, RATTAN is robust by exploiting redundant overlay links. Second, the maximum bandwidth demand for processing the protocol of a single RATTAN overlay is nearly 1M bits/sec. However, around 80% of the nodes merely take 66 bits/sec. One implication is that we can use a small number of relatively capable peers (e.g., stable machines with a 100M bits/sec network interface) to process the 1M bits/sec protocol overhead and serve other peers that only need to spend 66 bits/sec for processing protocol overhead.

Nodes in sensor networks do not have enough topology information to make efficient routing decisions. To relay messages through intermediate sensors, geographic routing has been proposed as such a solution. Its greedy nature, however, makes routing inefficient especially in the presence of topology voids or holes. In this paper we present GRAViTy (Geographic Routing Around Voids In any TopologY of sensor networks), a simple greedy forwarding algorithm that combines compass routing along with a mechanism that allows packets to explore the area around voids and bypass them without significant communication overhead. Using extended simulation results we show that our mechanism outperforms the right‐hand rule for bypassing voids and that the resulting paths found well approximate the corresponding shortest paths. GRAViTy uses a cross‐layered approach to improve routing paths for subsequent packets based on experience gained by former routing decisions. Furthermore, our protocol responds to topology changes, i.e. failure of nodes, and efficiently adjusts routing paths towards the destination.

This paper seeks to introduce a systematic approach to simulating a given binary network marketing (NM) growth topology in a definite society of people.

The study represented a binary plan network by its binary rooted tree, where each node represents a down‐line distributor of the root. The paper sought to find a cost function which would identify which existing node is most eligible to attract the new node. Using a survey strategy, the paper introduced some effective criteria, where cost function and design systematic algorithms were introduced, in order to simulate an NM growth topology. According to the designed algorithms, the paper modified a currently used compensation plan of the Questnet Company.

The comparison results indicate that the modified plan improves the efficiency by 6 percent, in the sense of profitability for the costumers, and also penetrates the market in 80 percent of trials.

The paper did not find any currently proposed simulation for binary NM plans. So, in order to introduce the systematic approach, new criteria were obtained based on survey strategy.

Network marketing organization designers need such a systematic method to arrange their strategies according to the prediction of the network's growth topology.

The paper presents a novel idea for designing analytical simulation tools for NM plans verification. As far as the authors are aware, this is the first systematic method to propose binary compensation plans.