29 research outputs found
Moniligaster cernosvitovi Gates 1962
No full textMoniligaster cernosvitovi Gates, 1962 Moniligaster perrieri Michaelsen, 1907 sensu Stephenson, 1924: 322,”partim” (Gates 1940: 496). Moniligaster beddardi Gates, 1940: 496. Moniligaster cernosvitovi Gates, 1962: 355, nom. nov. pro M. beddardi Gates, 1940, non M. beddardi Rosa, 1890, (now Drawida beddardi). Brief description. Colour deep bluish. Dimensions: 216–256 mm by 12.5–13 mm, segments 216–256. Spermathecal pores large transverse slits, at cd, at intersegmental furrow 7/8. Male pores paired, transverse slits, at media half of bc. Gizzards 4–5, in segments 15–22. Testis sacs in segment 10. Vas deferens coiled into a mass of hairpin loops, mass as large as or larger than testis sac, discharging directly at ectal end of the prostate gland; prostates vertical, U-shaped, capsule tubular with several, low, rounded nodulations. Spermathecal atrial glands in segments 7 and 8, duct of each atrial gland about one fourth the length of common atrial duct, which is stout and thickened entally. Material examined. 2 aclitellates (ACESSD /EW/786), roadside within tea plantation close to shola forest, Nemakkad (N10°08'39.85" E77°01'56.4"), Munnar hills, Idukki District, Kerala, India, 07 August 2017, 1973 m a.s.l., B. Balachandran and N.G. Vishnu. Distribution. India: Kerala State: Idukki District: Nemakkad (present record) in Munnar hills (Fig. 4). Elsewhere. Kodaikanal, Shembaganur in Tamil Nadu (Gates 1940). Remarks. The species is recorded for the first time from Kerala. It was previously known only from Tamil Nadu (Gates 1940). In Kerala, it is confined to the higher altitude shola-grassland ecosystem of Nemakkad near Munnar.Published as part of Narayanan, S. Prasanth, Sathrumithra, S., Anuja, R., Christopher, G., Thomas, A. P. & Julka, J. M., 2021, Three new species and four new species records of earthworms of the genus Moniligaster Perrier, 1872 (Clitellata: Moniligastridae) from Kerala region of the Western Ghats Biodiversity Hotspot, India, pp. 381-397 in Zootaxa 4949 (2) on page 391, DOI: 10.11646/zootaxa.4949.2.11, http://zenodo.org/record/463623
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
No full textWe consider a content distribution network (CDN) in which data hubs or servers are established in multiple locations to cater to local demands. The distributions of data to these hubs along with related network design problems (such as hub location and user assignment) are the key decision problems to consider to minimize the total routing cost. A new model for allocation of segments is introduced in Sen, Krishnamoorthy, Rangaraj and Narayanan, Comput Oper 62 (2015), 282–295, in which local preferences guide the database partitioning process, and the servers are fully connected to each other. In this article, we develop a simulated annealing (SA) approach (referred to as SA-mesh) to solve this problem and compare its performance with the corresponding mixed-integer linear programming (MILP) formulation. We also formulate a much harder variant of the problem in which servers are interconnected by a tree. We develop a SA algorithm (referred to as SA-tree) for this variant, in which a local search is incorporated to find a suboptimal tree backbone. We use a customized data structure based on linked lists to represent a solution in our algorithms. This enables our algorithms to scale to much larger instances of the problem. We use optimal solutions and the benchmarks obtained by CPLEX to justify the performance of our algorithms
Evaluation of Interference-Cancellation Based MAC Protocols for Vehicular Communications
Get PDFVehicular communications form an important part of future intelligent transport systems. Wireless connectivity between vehicles can enhance safety in vehicular networks and enable new services such as adaptive traffic control, collision detection and avoidance. As several new algorithms are being developed for enhancing vehicle to vehicle wireless connectivity, it is important to validate the performance of these algorithms using reasonably accurate wireless channel models. Specifically, some recent developments in the medium access control (MAC) layer algorithms appear to have the potential to improve the performance of vehicle to vehicle communications; however, these algorithms have not been validated with realistic channel models encountered in vehicular communications.
The aforementioned issues are addressed in this thesis and correspondingly, there are two main contributions - (i) A complete IEEE 802.11p based transceiver model has been simulated in MATLAB and its performance & reliability are tested using existing empirically-developed wireless channel models. (ii) A new MAC layer algorithm based on slotted ALOHA with successive interference cancellation(SIC) has been evaluated and tested by taking into consideration the performance of underlying physical layer. The performance of slotted ALOHA-SIC and the already existing carrier sense multiple access with collision avoidance (CSMA/CA) scheme with respect to channel access delay and average packet loss ratio is also studied
A few more Lonely Runners
Get PDFLonely Runner Conjecture, proposed by J\"{o}rg M. Wills and so nomenclatured
by Luis Goddyn, has been an object of interest since it was first conceived in
1967 : Given positive integers and there exists a
positive real number such that the distance of to the nearest
integer is at least , . In a recent
article Beck, Hosten and Schymura described the Lonely Runner polyhedron and
provided a polyhedral approach to identifying families of lonely runner
instances. We revisit the Lonely Runner polyhedron and highlight some new
families of instances satisfying the conjecture. In addition, we relax the
sufficiency of existence of an integer point in the Lonely Runner polyhedron to
prove the conjecture. Specifically, we propose that it suffices to show the
existence of a lattice point of certain superlattices of the integer lattice in
the Lonely Runner polyhedron
Work Participation in Cultural Operations of Rice Farming by Tribal and Non-Tribal Labourers in Wayanad District : A Comparative Analysis
No full textDesign of Robust and Power Efficient Full Adder Using Energy Efficient Feed through Logic
No full textABSTRACT – An Energy Efficient Feedthrough Logic (EE-FTL) is proposed in this paper to reduce the power consumption for low power applications. The EE-FTL is well suited to arithmetic circuits where the critical path is made of a large cascade of inverting gates. It has a unique characteristic where the output is pre-evaluated before the inputs from the preceding stage are ready. The proposed logic style requires low power when compare to the existing feedthrough logic (FTL). The proposed circuit is simulated and a comparison analysis has been carried out using 90-nm, 1.2V CMOS process technology. A CMOS Full Adder is designed by the energy efficient feedthrough logic and the simulation result in MicroWind environment shows that the proposed logic reduces the power consumption by 77%, 70 % and 36 % over FTL, Low Power FTL (LP-FTL) and Constant Delay Logic (CDL), respectively. The problem of requirement of inverter as in dynamic logic is completely eliminated in the proposed logic
Finite Element Analysis and Experimental Evaluation of Residual Stress of Zr-4 alloys Processed through Swaging
No full textZirconium alloy has been extensively used as a cladding material in nuclear power reactors due to its low neutron absorption cross section, excellent mechanical properties, and corrosion resistance. The influence of the swaging parameter, feed rate (0.7, 1.25, 2 m/min) on residual stress induced in Zr-4 alloy is investigated in the present work. A three-dimensional finite element model was implemented in the Deform 3D software to simulate the rotary swaging (RS) process over a circular rod of Zr-4 alloy. The simulation results based on the 3D framework provide a detailed insight of residual stress, true stress versus true strain and force applied over the rod during the multiple pass swaging process; the results are compared with experimental results. The experimental hole drilling method is used to determine the residual stresses on swaged zirconium alloy at different feed rates (0.7, 1.25, and 2 m/min). A similar trend of residual stress between experimental and numerical results from the surface to the center on the swaged rod samples is observed. The same magnitude of residual stress at the surface of the swaged Zr-4 rod is also observed. It is found to be compressive at the surface and tensile in the center of the samples, as observed in the present work
Facility location models to locate data in information networks: a literature review
No full textThe usage of the Internet has grown substantially in recent times. This has resulted in high volumes of data traffic. There is a concomitant rise in bandwidth demands that could result in excessive download delays (or latency). Thus, a single-server system is no more a prudent choice for data storage. Replication of content and placing them on multiple servers is a method that is used to reduce latency. However, this solution comes at a huge cost. Moreover, replicating objects randomly does not necessarily improve system performance. It is possible to arrive at a solution to the problem of placing content so as to achieve better cost performance. Other performance measures include latency, load balancing and data availability. We refer to the problem of locating content as data location problem in information networks, or DLPIN. The choice of server locations, query routing strategy and user assignment are some of the important problems that require attention along with the location of the data/content. Resource constraints and the nature of traffic (static/dynamic) are two important parameters in the problem environment, and therefore are key distinguishing features in the models. The main contribution of this paper is a novel classification and study of DLPIN on the basis of problem features. The research in this area started with files, the smallest units of allocation. Gradually, files and programs, database segments and entire databases (or mirrors) have been studied. We design examples from these use cases to elaborate a variety of problems in a comprehensive review. Facility location models from physical logistics are extensively used to model these problems. Our paper presents a literature survey of such mathematical models for data location problems. We present a gap analysis that provides pointers to possible future research in this area. This paper also serves to document the success in the use of mathematical programming approaches for data location in information networks
