On the distribution of the signs of the conjugates of the cyclotomic units in the maximal real subfield of the qth cyclotomic field, q A prime

Let F = Ǫ(ζ + ζ ^–1) be the maximal real subfield of the cyclotomic field Ǫ(ζ) where ζ is a primitive qth root of unity and q is an odd rational prime. The numbers u₁=-1, u_k=(ζ^k-ζ^-k)/(ζ-ζ^-1), k=2,…,p, p=(q-1)/2, are units in F and are called the cyclotomic units. In this thesis the sign distribution of the conjugates in F of the cyclotomic units is studied.

Let G(F/Ǫ) denote the Galoi's group of F over Ǫ, and let V denote the units in F. For each σϵ G(F/Ǫ) and μϵV define a mapping sgn_σ: V→GF(2) by sgn_σ(μ) = 1 iff σ(μ) ˂ 0 and sgn_σ(μ) = 0 iff σ(μ) ˃ 0. Let {σ₁, ... , σ_p} be a fixed ordering of G(F/Ǫ). The matrix M_q=(sgn_σj(v_i) ) , i, j = 1, ... , p is called the matrix of cyclotomic signatures. The rank of this matrix determines the sign distribution of the conjugates of the cyclotomic units. The matrix of cyclotomic signatures is associated with an ideal in the ring GF(2) [x] / (x^p+ 1) in such a way that the rank of the matrix equals the GF(2)-dimension of the ideal. It is shown that if p = (q-1)/ 2 is a prime and if 2 is a primitive root mod p, then M_q is non-singular. Also let p be arbitrary, let ℓ be a primitive root mod q and let L = {i | 0 ≤ i ≤ p-1, the least positive residue of defined by ℓⁱ mod q is greater than p}. Let H_q(x) ϵ GF(2)[x] be defined by H_q(x) = g. c. d. ((Σ xⁱ/I ϵ L) (x+1) + 1, x^p + 1). It is shown that the rank of M_q equals the difference p - degree H_q(x).

Further results are obtained by using the reciprocity theorem of class field theory. The reciprocity maps for a certain abelian extension of F and for the infinite primes in F are associated with the signs of conjugates. The product formula for the reciprocity maps is used to associate the signs of conjugates with the reciprocity maps at the primes which lie above (2). The case when (2) is a prime in F is studied in detail. Let T denote the group of totally positive units in F. Let U be the group generated by the cyclotomic units. Assume that (2) is a prime in F and that p is odd. Let F₍₂₎ denote the completion of F at (2) and let V₍₂₎ denote the units in F₍₂₎. The following statements are shown to be equivalent. 1) The matrix of cyclotomic signatures is non-singular. 2) U∩T = U². 3) U∩F²₍₂₎ = U². 4) V₍₂₎/ V₍₂₎² = ˂v₁ V₍₂₎²˃ ʘ…ʘ˂v_p V₍₂₎²˃ ʘ ˂3V₍₂₎²˃.

The rank of M_q was computed for 5≤q≤929 and the results appear in tables. On the basis of these results and additional calculations the following conjecture is made: If q and p = (q -1)/ 2 are both primes, then M_q is non-singular.

Gestão tributária e a sua importância na tomada de decisão: uma análise comparativa Lucro Real versus Lucro Presumido em uma empresa prestadora de serviço

A globalização e a forte competitividade obrigam as empresas a tornarem-se cada vez mais inovadoras e criativas. O diferencial conquistado através das inovações tende a agregar valor à empresa tornando-a mais forte para enfrentar a concorrência. Entretanto o pesado ônus tributário pode inviabilizar ou criar uma situação desfavorável para as empresas. Nesse contexto a contabilidade por meio de seu sistema de informação busca auxiliar os gestores no melhor planejamento de sua carga tributária. A gestão tributária significa procurar formas lícitas para reduzir, suspender ou adiar o pagamento de tributos, dentre elas está a melhor escolha na forma de tributação. O trabalho apresenta um estudo de caso em uma empresa prestadora de serviços onde será analisada a aplicabilidade da melhor forma de tributação da pessoa jurídica, no qual empresa poderá optar pelo lucro presumido, Lucro real anual ou trimestral, pois uma vez feita a opção, será irretratável para todo o ano calendário, o que pode gerar um ônus tributário que poderá reduzir significativamente a performance econômico-financeira.

Building more sustainable solutions in production-consumption systems: the case of food for people with reduced access

In new product development, the ability to integrate different dimensions of sustainability at a value chain level is still a complex, problematic goal. As product-service approaches are increasingly enabling the introduction of more sustainable paths, this paper describes the authors' experience thus far when building insights into conditions for the implementation of integrated solutions in a process of co-development and testing in real life conditions, which are driven by a social need focusing on food for people with reduced access. Throughout this process, which brought together producers, consumers and other stakeholders to design and test industrialised, sustainable solutions, empirical evidence demonstrates feasibility and usefulness of the approach and insight into the conditions for implementing interactive, comprehensive multi-stakeholder processes in real life situations. In addition, results show that the delivery of innovative solutions enabled to offer social added value, economic profits and environmental improvements under specific experimental conditions. © 2006 Elsevier Ltd. All rights reserved.

Real Time Concrete Damage Visual Assessment for First Responders

First responders are in danger when they perform tasks in damaged buildings after earthquakes. Structural collapse due to the failure of critical load bearing structural members (e.g. columns) during a post-earthquake event such as an aftershock can make first responders victims, considering they are unable to assess the impact of the damage inflicted in load bearing members. The writers here propose a method that can provide first responders with a crude but quick estimate of the damage inflicted in load bearing members. Under the proposed method, critical structural members (reinforced concrete columns in this study) are identified from digital visual data and the damage superimposed on these structural members is detected with the help of Visual Pattern Recognition techniques. The correlation of the two (e.g. the position, orientation and size of a crack on the surface of a column) is used to query a case-based reasoning knowledge base, which contains apriori classified states of columns according to the damage inflicted on them. When query results indicate the column's damage state is severe, the method assumes that a structural collapse is likely and first responders are warned to evacuate.

Real-time marker prediction and CoR estimation in optical motion capture

Optical motion capture systems suffer from marker occlusions resulting in loss of useful information. This paper addresses the problem of real-time joint localisation of legged skeletons in the presence of such missing data. The data is assumed to be labelled 3d marker positions from a motion capture system. An integrated framework is presented which predicts the occluded marker positions using a Variable Turn Model within an Unscented Kalman filter. Inferred information from neighbouring markers is used as observation states; these constraints are efficient, simple, and real-time implementable. This work also takes advantage of the common case that missing markers are still visible to a single camera, by combining predictions with under-determined positions, resulting in more accurate predictions. An Inverse Kinematics technique is then applied ensuring that the bone lengths remain constant over time; the system can thereby maintain a continuous data-flow. The marker and Centre of Rotation (CoR) positions can be calculated with high accuracy even in cases where markers are occluded for a long period of time. Our methodology is tested against some of the most popular methods for marker prediction and the results confirm that our approach outperforms these methods in estimating both marker and CoR positions. © 2012 Springer-Verlag.

Product intelligence in warehouse management: A case study

The need for more flexible, adaptable and customer-oriented warehouse operations has been increasingly identified as an important issue by today's warehouse companies due to the rapidly changing preferences of the customers that use their services. Motivated by manufacturing and other logistics operations, in this paper we argue on the potential application of product intelligence in warehouse operations as an approach that can help warehouse companies address these issues. We discuss the opportunities of such an approach using a real example of a third-party-logistics warehouse company and we present the benefits it can bring in their warehouse management systems. © 2013 Springer-Verlag.

automated test case generation for the stress testing of multimedia systems

With the advancement in network bandwidth and computing power, multimedia systems have become a popular means for information delivery. However, general principles of system testing cannot be directly applied to testing of multimedia systems on account of their stringent temporal and synchronization requirements. In particular, few studies have been made on the stress testing of multimedia systems with respect to their temporal requirements under resource saturation. Stress testing is important because erroneous behavior is most likely to occur under resource saturation. This paper presents an automatable method of test case generation for the stress testing of multimedia systems. It adapts constraint solving techniques to generate test cases that lead to potential resource saturation in a multimedia system. Coverage of the test cases is defined upon the reachability graph of a multimedia system. The proposed stress testing technique is supported by tools and has been successfully applied to a real-life commercial multimedia system. Although our technique focuses on the stress testing of multimedia systems, the underlying issues and concepts are applicable to other types of real-time systems.

Tandem duplication-random loss is not a real feature of oyster mitochondrial genomes

Duplications and rearrangements of coding genes are major themes in the evolution of mitochondrial genomes, bearing important consequences in the function of mitochondria and the fitness of organisms. Yu et al. (BMC Genomics 2008, 9: 477) reported the complete mt genome sequence of the oyster Crassostrea hongkongensis (16,475 bp) and found that a DNA segment containing four tRNA genes (trnK(1), trnC, trnQ(1) and trnN), a duplicated (rrnS) and a split rRNA gene (rrnL5') was absent compared with that of two other Crassostrea species. It was suggested that the absence was a novel case of "tandem duplication-random loss" with evolutionary significance. We independently sequenced the complete mt genome of three C. hongkongensis individuals, all of which were 18,622 bp and contained the segment that was missing in Yu et al.'s sequence. Further, we designed primers, verified sequences and demonstrated that the sequence loss in Yu et al.'s study was an artifact caused by placing primers in a duplicated region. The duplication and split of ribosomal RNA genes are unique for Crassostrea oysters and not lost in C. hongkongensis. Our study highlights the need for caution when amplifying and sequencing through duplicated regions of the genome.

Pose-Invariant Face Recognition Using Real and Virtual Views

The problem of automatic face recognition is to visually identify a person in an input image. This task is performed by matching the input face against the faces of known people in a database of faces. Most existing work in face recognition has limited the scope of the problem, however, by dealing primarily with frontal views, neutral expressions, and fixed lighting conditions. To help generalize existing face recognition systems, we look at the problem of recognizing faces under a range of viewpoints. In particular, we consider two cases of this problem: (i) many example views are available of each person, and (ii) only one view is available per person, perhaps a driver's license or passport photograph. Ideally, we would like to address these two cases using a simple view-based approach, where a person is represented in the database by using a number of views on the viewing sphere. While the view-based approach is consistent with case (i), for case (ii) we need to augment the single real view of each person with synthetic views from other viewpoints, views we call 'virtual views'. Virtual views are generated using prior knowledge of face rotation, knowledge that is 'learned' from images of prototype faces. This prior knowledge is used to effectively rotate in depth the single real view available of each person. In this thesis, I present the view-based face recognizer, techniques for synthesizing virtual views, and experimental results using real and virtual views in the recognizer.

Exploring knowledge transfer mechanisms: The case of a UK-based group within a high-tech global corporation

Jasimuddin, Sajjad, 'Exploring knowledge transfer mechanisms: The case of a UK-based group within a high-tech global corporation', International Journal of Information Management (2007) 27(4) pp.294-300 RAE2008

Speculative Concurrency Control for Real-Time Databases

In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that serializable schedules are found and executed as early as possible, thus, increasing the chances of a timely commitment of transactions with strict timing constraints. Due to its nature, we term our concurrency control algorithms Speculative. The aforementioned description encompasses many algorithms that we call collectively Speculative Concurrency Control (SCC) algorithms. SCC algorithms combine the advantages of both Pessimistic and Optimistic Concurrency Control (PCC and OCC) algorithms, while avoiding their disadvantages. On the one hand, SCC resembles PCC in that conflicts are detected as early as possible, thus making alternative schedules available in a timely fashion in case they are needed. On the other hand, SCC resembles OCC in that it allows conflicting transactions to proceed concurrently, thus avoiding unnecessary delays that may jeopardize their timely commitment.

Dynamic Window-Constrained Scheduling for Real-Time Media Streaming

This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while at the same time guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for link bandwidth by a set of real-time (i.e., window-constrained) streams can exceed 100% and still ensure all window-constraints are met. In fact, we show how it is possible to guarantee worst-case per-stream bandwidth and delay constraints while utilizing all available link capacity. Finally, we show how best-effort packets can be serviced with fast response time, in the presence of window-constrained traffic.

Participation by place-based community organisations in local development: case studies from East Cork

The past two decades have witnessed concerted efforts by theorists and policy-makers to place civil society at the centre of social, economic and environmental development processes. To this end, policies grounded in a Third Way approach have sought to forge stronger linkages between the state and voluntary community-based organisations. Concepts such as active citizenship, social capital, partnership and sustainability have underpinned this political philosophy, which reflects a movement in development theory and political science away from notions of state-led development and unfettered neo-liberalism. In the Irish context, a series of initiatives have given expression to this new policy agenda, the foremost amongst them the publication of a White Paper in 2000. New local governance structures and development schemes have multiplied since the early 1990s, while the physical planning system has also been modified. All this has taken place against the backdrop of unprecedented economic development and social change precipitated by the ‘Celtic Tiger’.This thesis examines the interaction between community organisations, state institutions and other actors in development processes in East Cork. It focuses upon place-based community organisations, who seek to represent the interests of their particular localities. A case study approach is employed to explore the realpolitik of local development and to gauge the extent to which grassroots community organisations wield influence in determining the development of their communities. The study concludes that the transfer of decision-making power to community organisations has been more illusory than real and that, in practical terms, such groups remain marginal in the circuits of power. However, the situation of community organisations operating in different geographical locales cannot be reduced to an overarching theoretical logic. The case studies show that the modus operandi of community groups varies considerably and can be influenced by specific local geographies, events and personalities.

Practical programming for static average-case analysis: the MOQA investigation

This work considers the static calculation of a program’s average-case time. The number of systems that currently tackle this research problem is quite small due to the difficulties inherent in average-case analysis. While each of these systems make a pertinent contribution, and are individually discussed in this work, only one of them forms the basis of this research. That particular system is known as MOQA. The MOQA system consists of the MOQA language and the MOQA static analysis tool. Its technique for statically determining average-case behaviour centres on maintaining strict control over both the data structure type and the labeling distribution. This research develops and evaluates the MOQA language implementation, and adds to the functions already available in this language. Furthermore, the theory that backs MOQA is generalised and the range of data structures for which the MOQA static analysis tool can determine average-case behaviour is increased. Also, some of the MOQA applications and extensions suggested in other works are logically examined here. For example, the accuracy of classifying the MOQA language as reversible is investigated, along with the feasibility of incorporating duplicate labels into the MOQA theory. Finally, the analyses that take place during the course of this research reveal some of the MOQA strengths and weaknesses. This thesis aims to be pragmatic when evaluating the current MOQA theory, the advancements set forth in the following work and the benefits of MOQA when compared to similar systems. Succinctly, this work’s significant expansion of the MOQA theory is accompanied by a realistic assessment of MOQA’s accomplishments and a serious deliberation of the opportunities available to MOQA in the future.

A framework for historical case-based reasoning

This paper presents a framework for Historical Case-Based Reasoning (HCBR) which allows the expression of both relative and absolute temporal knowledge, representing case histories in the real world. The formalism is founded on a general temporal theory that accommodates both points and intervals as primitive time elements. A case history is formally defined as a collection of (time-independent) elemental cases, together with its corresponding temporal reference. Case history matching is two-fold, i.e., there are two similarity values need to be computed: the non-temporal similarity degree and the temporal similarity degree. On the one hand, based on elemental case matching, the non-temporal similarity degree between case histories is defined by means of computing the unions and intersections of the involved elemental cases. On the other hand, by means of the graphical presentation of temporal references, the temporal similarity degree in case history matching is transformed into conventional graph similarity measurement.