Test of the Clustering Hypothesis in the Helsinki Exchanges

This paper investigates the clustering pattern in the Finnish stock market. Using trading volume and time as factors capturing the clustering pattern in the market, the Keim and Madhavan (1996) and the Engle and Russell (1998) model provide the framework for the analysis. The descriptive and the parametric analysis provide evidences that an important determinant of the famous U-shape pattern in the market is the rate of information arrivals as measured by large trading volumes and durations at the market open and close. Precisely, 1) the larger the trading volume, the greater the impact on prices both in the short and the long run, thus prices will differ across quantities. 2) Large trading volume is a non-linear function of price changes in the long run. 3) Arrival times are positively autocorrelated, indicating a clustering pattern and 4) Information arrivals as approximated by durations are negatively related to trading flow.

Computing complete test graphs for hierarchical systems

Conformance testing focuses on checking whether an implementation. under test (IUT) behaves according to its specification. Typically, testers are interested it? performing targeted tests that exercise certain features of the IUT This intention is formalized as a test purpose. The tester needs a "strategy" to reach the goal specified by the test purpose. Also, for a particular test case, the strategy should tell the tester whether the IUT has passed, failed. or deviated front the test purpose. In [8] Jeron and Morel show how to compute, for a given finite state machine specification and a test purpose automaton, a complete test graph (CTG) which represents all test strategies. In this paper; we consider the case when the specification is a hierarchical state machine and show how to compute a hierarchical CTG which preserves the hierarchical structure of the specification. We also propose an algorithm for an online test oracle which avoids a space overhead associated with the CTG.

Bootstrapping the Error Correction Model Cointegration Test

This paper is concerned with using the bootstrap to obtain improved critical values for the error correction model (ECM) cointegration test in dynamic models. In the paper we investigate the effects of dynamic specification on the size and power of the ECM cointegration test with bootstrap critical values. The results from a Monte Carlo study show that the size of the bootstrap ECM cointegration test is close to the nominal significance level. We find that overspecification of the lag length results in a loss of power. Underspecification of the lag length results in size distortion. The performance of the bootstrap ECM cointegration test deteriorates if the correct lag length is not used in the ECM. The bootstrap ECM cointegration test is therefore not robust to model misspecification.

Explicit Construction of Optimal Exact Regenerating Codes for Distributed Storage

Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. Also of interest is minimization of the bandwidth required to repair the system following a node failure. In a recent paper, Wu et al. characterize the tradeoff between the repair bandwidth and the amount of data stored per node. They also prove the existence of regenerating codes that achieve this tradeoff. In this paper, we introduce Exact Regenerating Codes, which are regenerating codes possessing the additional property of being able to duplicate the data stored at a failed node. Such codes require low processing and communication overheads, making the system practical and easy to maintain. Explicit construction of exact regenerating codes is provided for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications. A sub-space based approach is provided and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of our construction. Also included in the paper, is an explicit construction of regenerating codes for the minimum storage point for parameters relevant to storage in peer-to-peer systems. This construction supports a variable number of nodes and can handle multiple, simultaneous node failures. All constructions given in the paper are of low complexity, requiring low field size in particular.

Magnetotransport of Dirac fermions on the surface of a topological insulator

We study the properties of Dirac fermions on the surface of a topological insulator in the presence of crossed electric and magnetic fields. We provide an exact solution to this problem and demonstrate that, in contrast to their counterparts in graphene, these Dirac fermions allow relative tuning of the orbital and Zeeman effects of an applied magnetic field by a crossed electric field along the surface. We also elaborate and extend our earlier results on normal-metal-magnetic film-normal metal (NMN) and normal-metal-barrier-magnetic film (NBM) junctions of topological insulators [S. Mondal, D. Sen, K. Sengupta, and R. Shankar, Phys. Rev. Lett. 104, 046403 (2010)]. For NMN junctions, we show that for Dirac fermions with Fermi velocity vF, the transport can be controlled using the exchange field J of a ferromagnetic film over a region of width d. The conductance of such a junction changes from oscillatory to a monotonically decreasing function of d beyond a critical J which leads to the possible realization of magnetic switches using these junctions. For NBM junctions with a potential barrier of width d and potential V-0, we find that beyond a critical J, the criteria of conductance maxima changes from chi=eV(0)d/h upsilon(F)=n pi to chi=(n+1/2)pi for integer n. Finally, we compute the subgap tunneling conductance of a normal-metal-magnetic film-superconductor junctions on the surface of a topological insulator and show that the position of the peaks of the zero-bias tunneling conductance can be tuned using the magnetization of the ferromagnetic film. We point out that these phenomena have no analogs in either conventional two-dimensional materials or Dirac electrons in graphene and suggest experiments to test our theory.

Exact solution for the unsteady flow and heat transfer between eccentrically rotating disks

The unsteady heat transfer associated with flow due to eccentrically rotating disks considered by Ramachandra Rao and Kasiviswanathan (1987) is studied via reformulation in terms of cylindrical polar coordinates. The corresponding exact solution of the energy equation is presented when the upper and lower disks are subjected to steady and unsteady temperatures. For an unsteady flow with nonzero mean, the energy equation can be solved by prescribing the temperature on the disk as a sum of steady and oscillatory parts

Numerically Exact Study of Polarizabilities and Hyperpolarizabilities of Correlated Conjugated Organic Models

Polarizabilities and Hyperpolarizabilities of conjugated organic chains are calculated using correlated model Hamiltonians. While correlations reduce the Polarizabilities and extend the range of linear response, the Hyperpolarizabilities essentially are unaffected by the same. This explains the apparently large Hyperpolarizabilities of conjugated electronic systems.

Isobaric electrical resistance along the critical line in nickel: An experimental test of universality

High-precision measurement of the electrical resistance of nickel along its critical line, a first attempt of this kind, as a function of pressure to 47.5 kbar is reported. Our analysis yields the values of the critical exponents α=α’=-0.115±0.005 and the amplitude ratios ‖A/A’‖=1.17±0.07 and ‖D/D’‖=1.2±0.1. These values are in close agreement with those predicted by renormalization-group (RG) theory. Moreover, this investigation provides an unambiguous experimental verification to one of the key consequences of RG theory that the critical exponents and amplitudes ratios are insensitive to pressure variation in nickel, a Heisenberg ferromagnet.

Porsastuotannon tuottavuuskehitys sikatilinpäätöstiloilla vuosina 2003–2008

Tutkimuksessa mitataan porsastuotannon tuottavuuden kehitystä ProAgrian sikatilinpäätöstiloilla vuosina 2003–2008. Tuottavuutta mitataan Fisher-tuottavuusindeksillä, joka dekomponoidaan tekniseen, allokatiiviseen ja skaalatehokkuuteen sekä teknologiseen kehitykseen ja hintavaikutukseen. Koko aineistosta aggregoidulla tuottavuusindeksillä mitattuna tuottavuus kasvoi viidessä vuodessa yhteensä 14,3 % vuotuisen kasvun ollessa 2,7 %. Tuottajien keskimääräinen tuottavuusindeksi antaa lähes saman tuloksen: sen mukaan tuottavuus kasvaa yhteensä 14,7 %, mikä tekee 2,8 % vuodessa. Skaalatehokkuuden paraneminen havaitaan merkittävimmäksi tuottavuuskasvun lähteeksi. Skaalatehokkuus paranee aggregoidusti mitattuna 1,6 % vuodessa ja tiloilla keskimäärin 2,1 % vuodessa. Teknisen tehokkuuden koheneminen on toinen tuottavuuskasvua edistävä tekijä tutkimusjaksolla. Molemmilla mittaustavoilla nousu on keskimäärin 1,4 % vuodessa. Allokatiivinen tehokkuus laskee hieman: aggregoidusti mitattuna 0,1 % ja keskimäärin 0,4 % vuodessa. Teknologinen kehitys tutkimusjaksolla on lievästi negatiivista, keskimäärin -0,1 % vuodessa. Vuosittaiset vaihtelut ovat kuitenkin voimakkaita. Hintojen muutokset eivät juuri ole vaikuttaneet tuottavuuden tasoon, sillä hintavaikutuksen vuotuiset muutokset jäävät jokaisena vuonna alle puoleen prosenttiin ja keskimääräinen vuotuinen muutos on -0,1 %. Keskeinen tuottavuuskasvua edistänyt tekijä näyttää olleen tilakoon kasvu, joka on parantanut rakenteellista tehokkuutta. Teknologisen kehityksen jääminen negatiiviseksi kuitenkin tarkoittaa, että paras havaittu tuottavuuden taso ei ole noussut lainkaan.

Prediction of Specimen Strain from Extensometer Deflection Measurements in a Direct Stress Fatigue Test Specimen under Static Tensile Loading

The displacement between the ridges situated outside the filleted test section of an axially loaded unnotched specimen is computed from the axial load and shape of the specimen and compared with extensometer deflection data obtained from experiments. The effect of prestrain on the extensometer deflection versus specimen strain curve has been studied experimentally and analytically. An analytical study shows that an increase in the slope of the stress-strain curve in the inelastic region increases the slope of the corresponding computed extensometer deflection versus specimen strain curve. A mathematical model has been developed which uses a modified length ¯ℓef in place of the actual length of the uniform diameter test section of the specimen. This model predicts the extensometer deflection within 5% of the corresponding experimental value. This method has been successfully used by the authors to evolve an iterative procedure for predicting the cyclic specimen strain in axial fatigue tests on unnotched specimens.

Exact static polarizabilities of correlated finite model systems

A finite-field method for calculating exact polarizabilities of correlated conjugated model systems within the valence bond (VB) framework is presented. The correlations reduce the polarizabilities from their noninteracting values and extend the range of linearity to higher external fields. The large nonlinear polarizabilities observed in strongly correlated conjugated organic molecules cannot be directly attributed to electron correlations. The method described can be employed to calculate static polarizabilities for any desired state of a correlated system.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.