1,720,959 research outputs found
Building services and maintenance for air conditioner / Muhammad Firdaus A Hamid Faiz
To complete this diploma course, we are required to undergo industrial training for 20 weeks as it is included in our course outline and need to be completed in our 5th semester of our diploma. This industrial training started from 23rd August 2021 until 7th January 2022 and during the industrial training we are monitored and supervised by the nominated supervisor. For my industrial training, this study at A&A MEGAH SDN. BHD. where it is located at Kuantan, Pahang. It is a contractor company doing building services maintenance and repair and other services. This company was established on 20th June 2020 by Encik Mohd Azlan Bin Mohd Jubli, the owner of this company. This company is expert in air conditioning installation, electrical work and building services such as housekeeping, painting, and laundering. The project that in this research is an installation and maintenance for the air conditioner at all Telekom Malaysia Berhad’s buildings. This study was assisted by my managing director who is the owner of the company to manage all the company organization such as office work and tender/quotation preparation including finishing all of the things that have been pending like example registration with the vendor and supplier. This research was also helped by my team doing this task as the company was a new fifth company from the founder. The conclusion is doing maintenance work for air conditioning to prevent any failure or system doesn’t working as required. My hope for this research will be useful for me as a reference in future
Modeling and exact solution approaches for the distance-based critical node and edge detection problems
The performance of many networked systems including energy, telecommunication and transport networks is dependent on the functionality of a few components of these systems whose malfunction compromises optimal performance of the system. With respect to network connectivity as a performance metric, such components are termed critical nodes and edges. The optimisation problem associated with identifying critical nodes of a network is termed the critical node detection problem (CNDP). The CNDP has gained significant amount of research owing to its applicability in diverse real life problems including disaster management, social network analysis, and disease epidemiology, as well as its computational complexity. However, traditional models, whose underlying objective is to maximize network fragmentation fail to capture cohesiveness and extent of connectivity within the resultant network. Therefore, a new variant of the problem termed the distance-based critical node detection problem (DCNDP) was proposed to address this gap. The DCNDP takes into account pairwise distances between nodes as part of its network connectivity objective, which are modelled by pre-defined distance-based connectivity measure. Distance-based connectivity plays an important part in everyday life. For instance, our choice of route of travel and the cost of a flight ticket are influenced by the duration of travel and number of stopovers involved. Therefore, while a source-destination route might exist, if the duration of a trip via the route precludes attainment of a time-bound activity, then such is a practical disconnection. Similarly, in communication and telecommunication networks, speed and coverage are key operational issues for assessing connectivity which are both related to pairwise distances in the network. In this chapter, we study a generalization of the DCNDP on weighted networks, where distance between any source-destination (s-t) pair is not limited to hop distance (number of edges along an s-t path). We present a new model with fewer entities than the models in previous studies. Moreover, we show that the proposed model admits different distance-based connectivity measures, hence is valid for all existing classes of the distance-based critical node detection problem. We introduce a new version of the problem, in which edges rather than nodes are to be deleted. This version is useful for application contexts where it is impractical or too expensive to delete nodes. Furthermore, we study social and transportation networks, where we also demonstrate practical aspects of the problem. Some computational experiments on instances of different real-world networks are presented for the different application context studied using the proposed models and algorithm. The Chapter concludes with directions for future research
Column Generation and Lagrangian Relaxation:Solving Real-World Crew (Re)Scheduling Problems
In this chapter, we describe the combination of column generation and Lagrangian relaxation to solve a large-scale optimization problem. In the setting of a minimization problem, Lagrangian relaxation is used to compute lower bounds. Column generation is applied to deal with the huge number of columns. We apply these techniques to the crew scheduling and the crew rescheduling problem. Crew scheduling is an important planning problem for public transport companies and airlines. It has been studied by many Operations Researchers over the last few decades. The most complex problems arise at large public transport companies where 10000s of tasks have to be assigned to 1000s of crew members. Usually, the crew scheduling problem is solved once a year. During the year and in particular on the day of operations when disruptions occur, duties are rescheduled. We look at both the tactical planning phase as well as real-time crew rescheduling on the day of operations. In the tactical planning phase, a computation time of several hours is acceptable and it is important to find near-optimal solutions. We discuss the combination of Lagrangian relaxation and column generation to find a lower bound on the optimal objective value, and a Lagrangian heuristic to find good feasible solutions. When a disruption occurs, it is important to react quickly. Therefore, computation times should be in the order of a few minutes. Thus, heuristic approaches are often used for the real-time crew rescheduling problem. We discuss the combination of large neighborhood search with column generation and Lagrangian relaxation to solve a real-world crew rescheduling problem
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
koamabayili/VECTRON-author-checklist: VECTRON author checklist
We have done our best to complete the author checklist relating to the use of animals in the hut study. Note that the objective for the hut study was to evaluate the IRS treatment applications for residual efficacy against Anopheles mosquitoes, including the local An. coluzzii mosquito population. Cows were only used to attract mosquitoes into the huts and no tests were carried out directly on the cows. The author checklist is intended for use with studies where experiments are carried out on animals, which is why we have had such difficulty in completing this for the hut study, as many of the questions do not relate to how the cows were used
- …
