153 resultados para Price discovery
Resumo:
This study investigates whether and how a firm’s ownership and corporate governance affect its timeliness of price discovery, which is referred to as the speed of incorporation of value-relevant information into the stock price. Using a panel data of 1,138 Australian firm-year observations from 2001 to 2008, we predict and find a non-linear relationship between ownership concentration and the timeliness of price discovery. We test the identity of the largest shareholder and find that only firms with family as the largest shareholder exhibit faster price discovery. There is no evidence that suggests that the presence of a second largest shareholder affects the timeliness of price discovery materially. Although we find a positive association between corporate governance quality and the timeliness of price discovery, as expected, there is no interaction effect between the largest shareholding and corporate governance in relation to the timeliness of price discovery. Further tests show no evidence of severe endogeneity problems in our study.
Resumo:
This thesis provides the first evidence on how ownership concentration and structure relate to the timeliness of price discovery and reporting lags in Malaysia. Based on a sample of 1,276 Malaysian firms from 1996 to 2009, the results show that ownership concentration and the identity of the largest shareholder matter to the timeliness of price discovery and reporting lags. Specifically, closely-held firms are more timely in their price discovery and have shorter reporting lags, particularly if the largest shareholder is a foreigner or a financial institution. Government-owned firms have longer reporting lags, as expected, but we find no evidence that family-owned firms have significantly different timeliness of price discovery and reporting lags than other firms. Additional analysis shows that prior to the implementation of the Malaysian Code of Corporate Governance, firms were more timely in their price discovery but longer in their reporting lag.
Resumo:
This paper provides the first evidence showing that ownership concentration and the identity of the largest shareholder matter to the timeliness of corporate earnings, measured by a stock price-based timeliness metric and the reporting lag. Using panel data of 1276 Malaysian firms from 1996 to 2009, we find a non-linear relationship between concentrated ownership, measured by the largest shareholding in a firm, and the reporting lag but not the timeliness of price discovery. Although firms with government as the largest shareholder and political connections have a significantly shorter reporting lag, only the former are timelier in price discovery. Firms with family and foreigners as the largest shareholder however are less timely in price discovery. While the reporting lag is shorter in the period after the integration of the Malaysian Code of Corporate Governance (MCCG) into Bursa listing rules, its impact on the timeliness of price discovery is mostly immaterial.
Resumo:
With the advent of Service Oriented Architecture, Web Services have gained tremendous popularity. Due to the availability of a large number of Web services, finding an appropriate Web service according to the requirement of the user is a challenge. This warrants the need to establish an effective and reliable process of Web service discovery. A considerable body of research has emerged to develop methods to improve the accuracy of Web service discovery to match the best service. The process of Web service discovery results in suggesting many individual services that partially fulfil the user’s interest. By considering the semantic relationships of words used in describing the services as well as the use of input and output parameters can lead to accurate Web service discovery. Appropriate linking of individual matched services should fully satisfy the requirements which the user is looking for. This research proposes to integrate a semantic model and a data mining technique to enhance the accuracy of Web service discovery. A novel three-phase Web service discovery methodology has been proposed. The first phase performs match-making to find semantically similar Web services for a user query. In order to perform semantic analysis on the content present in the Web service description language document, the support-based latent semantic kernel is constructed using an innovative concept of binning and merging on the large quantity of text documents covering diverse areas of domain of knowledge. The use of a generic latent semantic kernel constructed with a large number of terms helps to find the hidden meaning of the query terms which otherwise could not be found. Sometimes a single Web service is unable to fully satisfy the requirement of the user. In such cases, a composition of multiple inter-related Web services is presented to the user. The task of checking the possibility of linking multiple Web services is done in the second phase. Once the feasibility of linking Web services is checked, the objective is to provide the user with the best composition of Web services. In the link analysis phase, the Web services are modelled as nodes of a graph and an allpair shortest-path algorithm is applied to find the optimum path at the minimum cost for traversal. The third phase which is the system integration, integrates the results from the preceding two phases by using an original fusion algorithm in the fusion engine. Finally, the recommendation engine which is an integral part of the system integration phase makes the final recommendations including individual and composite Web services to the user. In order to evaluate the performance of the proposed method, extensive experimentation has been performed. Results of the proposed support-based semantic kernel method of Web service discovery are compared with the results of the standard keyword-based information-retrieval method and a clustering-based machine-learning method of Web service discovery. The proposed method outperforms both information-retrieval and machine-learning based methods. Experimental results and statistical analysis also show that the best Web services compositions are obtained by considering 10 to 15 Web services that are found in phase-I for linking. Empirical results also ascertain that the fusion engine boosts the accuracy of Web service discovery by combining the inputs from both the semantic analysis (phase-I) and the link analysis (phase-II) in a systematic fashion. Overall, the accuracy of Web service discovery with the proposed method shows a significant improvement over traditional discovery methods.
Resumo:
Single nucleotide polymorphisms (SNPs) are unique genetic differences between individuals that contribute in significant ways to the determination of human variation including physical characteristics like height and appearance as well as less obvious traits such as personality, behaviour and disease susceptibility. SNPs can also significantly influence responses to pharmacotherapy and whether drugs will produce adverse reactions. The development of new drugs can be made far cheaper and more rapid by selecting participants in drug trials based on their genetically determined response to drugs. Technology that can rapidly and inexpensively genotype thousands of samples for thousands of SNPs at a time is therefore in high demand. With the completion of the human genome project, about 12 million true SNPs have been identified to date. However, most have not yet been associated with disease susceptibility or drug response. Testing for the appropriate drug response SNPs in a patient requiring treatment would enable individualised therapy with the right drug and dose administered correctly the first time. Many pharmaceutical companies are also interested in identifying SNPs associated with polygenic traits so novel therapeutic targets can be discovered. This review focuses on technologies that can be used for genotyping known SNPs as well as for the discovery of novel SNPs associated with drug response.
Resumo:
In this paper we discuss our current efforts to develop and implement an exploratory, discovery mode assessment item into the total learning and assessment profile for a target group of about 100 second level engineering mathematics students. The assessment item under development is composed of 2 parts, namely, a set of "pre-lab" homework problems (which focus on relevant prior mathematical knowledge, concepts and skills), and complementary computing laboratory exercises which are undertaken within a fixed (1 hour) time frame. In particular, the computing exercises exploit the algebraic manipulation and visualisation capabilities of the symbolic algebra package MAPLE, with the aim of promoting understanding of certain mathematical concepts and skills via visual and intuitive reasoning, rather than a formal or rigorous approach. The assessment task we are developing is aimed at providing students with a significant learning experience, in addition to providing feedback on their individual knowledge and skills. To this end, a noteworthy feature of the scheme is that marks awarded for the laboratory work are primarily based on the extent to which reflective, critical thinking is demonstrated, rather than the amount of CBE-style tasks completed by the student within the allowed time. With regard to student learning outcomes, a novel and potentially critical feature of our scheme is that the assessment task is designed to be intimately linked to the overall course content, in that it aims to introduce important concepts and skills (via individual student exploration) which will be revisited somewhat later in the pedagogically more restrictive formal lecture component of the course (typically a large group plenary format). Furthermore, the time delay involved, or "incubation period", is also a deliberate design feature: it is intended to allow students the opportunity to undergo potentially important internal re-adjustments in their understanding, before being exposed to lectures on related course content which are invariably delivered in a more condensed, formal and mathematically rigorous manner. In our presentation, we will discuss in more detail our motivation and rationale for trailing such a scheme for the targeted student group. Some of the advantages and disadvantages of our approach (as we perceived them at the initial stages) will also be enumerated. In a companion paper, the theoretical framework for our approach will be more fully elaborated, and measures of student learning outcomes (as obtained from eg. student provided feedback) will be discussed.
Resumo:
Intelligent software agents are promising in improving the effectiveness of e-marketplaces for e-commerce. Although a large amount of research has been conducted to develop negotiation protocols and mechanisms for e-marketplaces, existing negotiation mechanisms are weak in dealing with complex and dynamic negotiation spaces often found in e-commerce. This paper illustrates a novel knowledge discovery method and a probabilistic negotiation decision making mechanism to improve the performance of negotiation agents. Our preliminary experiments show that the probabilistic negotiation agents empowered by knowledge discovery mechanisms are more effective and efficient than the Pareto optimal negotiation agents in simulated e-marketplaces.