UKM Pempek Ogan is a small industry engaged in the food sector. This UKM was founded in 2007. The main problem of UKM Pempek Ogan Palembang is the slow and monotonic development and business ...innovation i.e. the promotion strategy implemented is not well designed to increase sales and compete with similar businesses. Consequently, the business experienced declined sales and therefore, reducing revenues if appropriate measures are not taken. The purpose of this research is to develop new strategies, marketing strategies, by creating new innovations for UKM Pempek Ogan Palembang using Blue Ocean Strategy. The Blue Ocean Strategy is a method to develop a new value innovation that is not yet owned by competitors to divert from intense competition among business actors. The BOS method has several steps in its application, namely the creation of a strategy canvas, the creation of a four-step framework i.e. eliminating, enhancing, reducing, and creating, of the creation of three characteristics of a good strategy, namely focus, divergence and motto. Our findings from the strategy canvas suggested that there are several indicators whose values are below competitors. The new innovation applied to UKM Pempek Ogan Palembang as a diversion from competitors by the framework of four steps is to reduce a product price. Moreover, product variants, social media advertising, sales promotion, employee appearance, cleanliness and comfort of the place as well as poor-designed-banners should be improved. We suggested frozen pempek and pempek with unique shapes are created for new and fresh looks as a new innovation.
Purpose
The valuation and pricing of information assets often presents managers with substantial challenges. Information assets are usually highly unique, lack objective price benchmarks, have a high ...potential for piracy, can be simultaneously accessed and enjoyed by multiple users and generally feature significant information asymmetry between sellers and buyers. This paper aims to discuss five methods that can be used to value/price information assets.
Design/methodology/approach
This is a conceptual paper that draws and builds upon the multidisciplinary pricing literature.
Findings
A tree diagram, one that matches particular combinations of information asset features with each of the five methods, is presented to assist practitioners with their choice of valuation/pricing method.
Originality/value
The pricing of information assets is a challenging and even daunting task. The linkages specified by the paper’s model, and in particular its matching of information asset characteristics with specific valuation/pricing methods, offers a decision tool that does not currently exist. This tool is capable of supporting practitioner decision-making and highlights avenues for future scholarly research.
The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some ...convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decoding of block codes using tree structure. Many good block codes are presently known. Several of them have been used in applications ranging from deep space communication to error control in storage systems. But the primary difficulty with applying Viterbi or BCJR algorithms to decode of block codes is that, even though they are optimum decoding methods, the promised bit error rates are not achieved in practice at data rates close to capacity. This is because the decoding effort is fixed and grows with block length, and thus only short block length codes can be used. Therefore, an important practical question is whether a suboptimal realizable soft decision decoding method can be found for block codes. A noteworthy result which provides a partial answer to this question is described in the following sections. This result of near optimum decoding will be used as motivation for the investigation of different soft decision decoding methods for linear block codes which can lead to the development of efficient decoding algorithms. The code tree can be treated as an expanded version of the trellis, where every path is totally distinct from every other path. We have derived the tree structure for (8, 4) and (16, 11) extended Hamming codes and have succeeded in implementing the soft decision stack algorithm to decode them. For the discrete memoryless channel, gains in excess of 1.5dB at a bit error rate of 10-5 with respect to conventional hard decision decoding are demonstrated for these codes.
The authors study the finite decomposition complexity of metric spaces of
H
, equipped with different metrics, where
H
is a subgroup of the linear group GL
∞
(ℤ). It is proved that there is an ...injective Lipschitz map
φ
: (
F, d
S
) → (
H, d
), where
F
is the Thompson’s group,
dS
the word-metric of
F
with respect to the finite generating set
S
and
d
a metric of
H
. But it is not a proper map. Meanwhile, it is proved that
φ
: (
F, d
S
) → (
H, d
1
) is not a Lipschitz map, where
d
1
is another metric of
H
.
Full text
Available for:
DOBA, EMUNI, FIS, FZAB, GEOZS, GIS, IJS, IMTLJ, IZUM, KILJ, KISLJ, MFDPS, NLZOH, NUK, OILJ, PILJ, PNG, SAZU, SBCE, SBJE, SBMB, SBNM, UILJ, UKNU, UL, UM, UPUK, VKSCE, ZAGLJ
Describimos el proceso seguido por estudiantes de 11 y 12 años para descubrir patrones de conteo en un problema básico de combinatoria. Hacemos énfasis en la transición de las estrategias ...manipulativas para el conteo directo a la generalización. En esta transición hubo estudiantes que utilizaron, de forma espontánea, diagramas de árbol; y otros estudiantes que recurrieron a estrategias comunes en pensamiento numérico. Resaltamos el interés de resolver problemas de combinatoria sin haber aprendido fórmulas previas para que los estudiantes den significado a la regla del producto y relacionamos los resultados obtenidos con aspectos didácticos de la multiplicación en educación primaria. Reasoning and Strategies in the Transition to Generalization in a Combinatorial Problem We describe the procedure used by 11-12 years old students to discover counting patterns in basic combinatory problems. We emphasize the transition from manipulative strategies for direct counting to generalization. In this transition, there were students who spontaneously used tree diagrams of mathematical ideas and some students used numerical thinking strategies. We highlight the interest of solving combinatory problems in order to let the students make sense of the multiplication rule. We relate the results to the teaching of multiplication in primary school.Handle: http://hdl.handle.net/10481/3506
Full text
Available for:
IZUM, KILJ, NUK, PILJ, PNG, SAZU, UL, UM, UPUK
A novel low complexity soft decision technique which allows the decoding of block codes with tree structure is proposed. These codes are shown to have a convenient tree structure that allows Fano ...decoding techniques to be used to decode them. The Fano algorithm searches through the tree structure of the block code for a path which has the optimal value of the Fano metric function. When a new candidate codeword is found, an optimality check is performed on it by using the threshold. If checked successfully, the candidate codeword is the most likely codeword and the search stops. The basic idea of this approach is to achieve a good error performance progressively in a minimum number of steps. For each decoding step, the error performance is tightly bounded and the decoding is terminated at the stage where either optimum or near optimum error performance is achieved. As a result, more flexibility in the trade off between performance and decoding complexity is provided. Some examples of the tree construction and the soft decision Fano decoding procedure are discussed.
Xu introduced a family of root-tree-diagram nilpotent Lie algebras of differential operators, in connection with evolution partial differential equations. We generalized his notion to more general ...oriented tree diagrams. These algebras are natural analogues of the maximal nilpotent Lie subalgebras of finite-dimensional simple Lie algebras. In this article, we use Hodge Laplacian to study the cohomology of these Lie algebras. The "total rank conjecture" and "b
2
-conjecture" for the algebras are proved. Moreover, we find the generating functions of the Betti numbers by means of Young tableaux for the Lie algebras associated with certain tree diagrams of single branch point. By these functions and Euler-Poincaré principle, we obtain analogues of the denominator identity for finite-dimensional simple Lie algebras. The result is a natural generalization of the Bott's classical result in the case of special linear Lie algebras.
Full text
Available for:
BFBNIB, GIS, IJS, KISLJ, NUK, PNG, UL, UM, UPUK
Via a graphical method, which codes tree diagrams composed of partitions, a novel power series expansion is derived for the reciprocal of the logarithmic function ln (1+
z
), whose coefficients ...represent an infinite set of fractions. These numbers, which are called reciprocal logarithm numbers and are denoted by
A
k
, converge to zero as
k
→∞. Several properties of the numbers are then obtained including recursion relations and their relationship with the Stirling numbers of the first kind. Also appearing here are several applications including a new representation for Euler’s constant known as Hurst’s formula and another for the logarithmic integral. From the properties of the
A
k
it is found that a term of ζ(2) cannot be eliminated by the remaining terms in Hurst’s formula, thereby indicating that Euler’s constant is irrational. Finally, another power series expansion for the reciprocal of arctangent is developed by adapting the preceding material.
This paper focuses on the morphological changes that occur when translating English political news into Arabic. It attempts to find the answer to the research question, "What is the nature of the ...morphological changes that occur in the Arabic translation?" Towards this end, it examines the morphological changes that are attributable to various reasons in Vinay and Darbenet (1995) procedures, among them transposition or shift. Thus, each data item is examined on the basis of the ideas of Vinay and Darbenet (1995) as well as Culicover (1997) using both X'-Theory representation either as phrase markers (tree diagrams) or in linear structures using label bracketing and narrative descriptions.
Organic waste is still of great value and its transformation into biodegradable polymers is part of the circular economy strategy. The main objective of this research was to evaluate different ...variables that were analyzed through a tree decision method in order to obtain a biomaterial developed through the conversion of orange peels into a biopolymer. The analysis and assessment include different particle sizes of the orange peel powder, different starch types, different cooling, and dehydration processes. The variables that resulted in the best biopolymer were as follows: particle size of the orange peel powder: 250 micrometers, potato starch and corn starch in a ratio of 0:100, cooling of the mixture at room temperature, and finally the application of a dehydration process.
PDF
