Home About us Contact
|
Home About us Contact | ||
|
|
||
Complexity Analysis (complexity + analysis)
Selected AbstractsComplexity Analysis Based on Image-Processing Method and Pixelized Recognition of Chinese Characters Using Simulated Prosthetic VisionARTIFICIAL ORGANS, Issue 1 2010Kun Yang Abstract The influence of complexity and minimum resolution necessary for recognition of pixelized Chinese characters (CCs) was investigated by using simulated prosthetic vision. An image-processing method was used to evaluate the complexity of CCs, which is defined as the frequency of black pixels and analyzed by black pixel statistic complexity algorithm. A total of 631 most commonly used CCs that can deliver 80% of the information in Chinese daily reading were chosen as the testing database in order to avoid the negative effect due to illegibility and incognizance. CCs in Hei font style were captured as images and pixelized as 6 × 6, 8 × 8, 10 × 10, and 12 × 12 pixel arrays with square dots. Recognition accuracy of CCs with different complexity and different numbers of pixel arrays was tested by using simulated prosthetic vision. The results indicate that both pixel array number and complexity have significant impact on pixelized reading of CCs. Recognition accuracy of pixelized CCs drops with the increase of complexity and the decrease of pixel number. More than 80% of CCs with any complexity can be recognized correctly; 10 × 10 pixel array can sufficiently provide pixelized reading of CCs for visual prosthesis. Pixelized reading of CCs with low resolution is possible only for characters with low complexity (complexity less than 0.16 for a 6 × 6 pixel array and less than 0.24 for an 8 × 8 pixel array). [source] Motive-Related Memories: Content, Structure, and AffectJOURNAL OF PERSONALITY, Issue 3 2001Barbara Woike Two studies tested hypotheses on the content and structure of autobiographical memories and the affect linked to them. In Study 1, agentic and communal-motivated individuals recorded their most memorable experiences and completed the PANAS each day for 6 weeks. Memories were coded for content and structure. Agentics and communals reported more motive congruent memories, and their congruent memories were structured using more differentiation and integration, respectively. In addition, agentics had slightly higher PA and lower NA scores. In Study 2, agentics and communals recalled an event pertaining to either social separation or connection and then completed an affect measure of agentic and communal items. Agentics recalled more agentic memories in the separation condition and communals recalled more communal memories in the connection condition. Complexity analyses showed that agentics and communals used differentiation and integration respectively to recall their motive- congruent memories. The affect data showed a modest predicted pattern. Results suggest that implicit motives have an impact on autobiographical memory but are not as clearly related to self-report affect measures, possibly due to method variance. [source] THE EVOLUTION OF THE VERTEBRATE ,-GLOBIN GENE PROMOTEREVOLUTION, Issue 2 2002Nadia A. Chuzhanova Abstract Complexity analysis is capable of highlighting those gross evolutionary changes in gene promoter regions (loosely termed "promoter shuffling") that are undetectable by conventional DNA sequence alignment. Complexity analysis was therefore used here to identify the modular components (blocks) of the orthologous ,-globin gene promoter sequences of 22 vertebrate species, from zebrafish to humans. Considerable variation between the ,-globin gene promoters was apparent in terms of block presence/absence, copy number, and relative location. Some sequence blocks appear to be ubiquitous, whereas others are restricted to a specific taxon. Block similarities were also evident between the promoters of the paralogous human ,-like globin genes. It may be inferred that a wide variety of different mutational mechanisms have operated upon the ,-globin gene promoter over evolutionary time. Because these include gross changes such as deletion, duplication, amplification, elongation, contraction, and fusion, as well as the steady accumulation of single base-pair substitutions, it is clear that some redefinition of the term "promoter shuffling" is required. This notwithstanding, and as previously described for the vertebrate growth hormone gene promoter, the modular structure of the ,-globin promoter region and those of its paralogous counterparts have continually been rearranged into new combinations through the alteration, or shuffling, of preexisting blocks. Some of these changes may have had no influence on promoter function, but others could have altered either the level of gene expression or the responsiveness of the promoter to external stimuli. The comparative study of vertebrate ,-globin gene promoter regions described here confirms the generality of the phenomenon of sequence block shuffling and thus supports the view that it could have played an important role in the evolution of differential gene expression. [source] A semantic entropy metricJOURNAL OF SOFTWARE MAINTENANCE AND EVOLUTION: RESEARCH AND PRACTICE, Issue 4 2002Letha H. Etzkorn Abstract This paper presents a new semantically-based metric for object-oriented systems, called the Semantic Class Definition Entropy (SCDE) metric, which examines the implementation domain content of a class to measure class complexity. The domain content is determined using a knowledge-based program understanding system. The metric's examination of the domain content of a class provides a more direct mapping between the metric and common human complexity analysis than is possible with traditional complexity measures based on syntactic aspects (software aspects related to the format of the code). Additionally, this metric represents a true design metric that can measure complexity early in the life cycles of software maintenance and software development. The SCDE metric is correlated with analyses from a human expert team, and is also compared to syntactic complexity measures. Copyright © 2002 John Wiley & Sons, Ltd. [source] Good for workers, good for companies: How knowledge sharing benefits individual employeesKNOWLEDGE AND PROCESS MANAGEMENT: THE JOURNAL OF CORPORATE TRANSFORMATION, Issue 4 2009Iris Reychav The paper aims to identify the ways in which explicit and tacit knowledge sharing occur in organizations and to investigate the impact of sharing these two knowledge types on the employee's rewards, performance, and intention to leave. This paper focuses on two hi-tech companies working in the telecommunications field producing cellular networks. The final sample consisted of 278 completed questionnaires from business departments including finance, R&D, marketing, IT, engineering, and manufacturing. Explicit knowledge sharing is perceived by the employees as having: (1) a direct positive effect on the receipt of monetary rewards; (2) a positive indirect effect on the employee's performance; and it has a (3) positive direct and negative indirect effects on employee's intention to leave. Tacit knowledge sharing is perceived by employees as having: (1) a positive direct effect on the receipt of non-monetary rewards; (2) a positive direct effect on performance; and (3) it has a positive indirect effect on employee's intention to leave. Although the findings show that increased knowledge sharing results in positive outcomes at the individual level, the research model would benefit from an examination of larger samples for reasons of statistical complexity analysis and in order to allow for generalizability of the results to other companies that operate in similar environments. It would also be worthwhile to conduct a comparative analysis of companies from different industries. Understanding knowledge-sharing behaviors may prove helpful to managers in developing strategies to encourage organizational knowledge sharing and in the development of an organizational knowledge base. The knowledge sharing outcomes outlined here can give employees a way to predict potential positive outcomes and benefits that are likely to arise as a result of engaging in knowledge sharing activities. The model enables for the first time to substantiate, in a valid way, to hypothesize that knowledge sharing within an organization is perceived by employees to be a rewarding behavior, improving employees' performance, and decrease the intention to leave. Copyright © 2009 John Wiley & Sons, Ltd. [source] A logistics scheduling model: Inventory cost reduction by batchingNAVAL RESEARCH LOGISTICS: AN INTERNATIONAL JOURNAL, Issue 4 2005Xiangtong Qi Abstract Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. [source] Blended kernel approximation in the ,-matrix techniquesNUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, Issue 4 2002W. Hackbusch Abstract Several types of ,-matrices were shown to provide a data-sparse approximation of non-local (integral) operators in FEM and BEM applications. The general construction is applied to the operators with asymptotically smooth kernel function provided that the Galerkin ansatz space has a hierarchical structure. The new class of ,-matrices is based on the so-called blended FE and polynomial approximations of the kernel function and leads to matrix blocks with a tensor-product of block-Toeplitz (block-circulant) and rank- k matrices. This requires the translation (rotation) invariance of the kernel combined with the corresponding tensor-product grids. The approach allows for the fast evaluation of volume/boundary integral operators with possibly non-smooth kernels defined on canonical domains/manifolds in the FEM/BEM applications. (Here and in the following, we call domains canonical if they are obtained by translation or rotation of one of their parts, e.g. parallelepiped, cylinder, sphere, etc.) In particular, we provide the error and complexity analysis for blended expansions to the Helmholtz kernel. Copyright © 2002 John Wiley & Sons, Ltd. [source] | ||||||||||