7,998 research outputs found
sj-docx-1-pie-10.1177_09544089221109739 - Supplemental material for Influence of high-intensity horizontal mould vibration on the density, grain refinement and mechanical characteristics of a die cast aluminium alloy (LM21)
No full textSupplemental material, sj-docx-1-pie-10.1177_09544089221109739 for Influence of high-intensity horizontal mould vibration on the density, grain refinement and mechanical characteristics of a die cast aluminium alloy (LM21) by Siddharth Yadav, Santosh Kumar, Satya Prakash Tewari, Subhash Chandra Ram, Rabindra Prasad, Nitesh Kumar Sinha, Manish Deo and Jayant Kumar Singh in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
Assessment of groundwater level fluctuation by using remote sensing and GIS in West Bokaro coalfield, Jharkhand, India
No full textPoint Separation and Obstacle Removal by Finding and Hitting Odd Cycles
No full textSuppose we are given a pair of points s, t and a set of n geometric objects in the plane, called obstacles. We show that in polynomial time one can construct an auxiliary (multi-)graph G with vertex set and every edge labeled from {0, 1}, such that a set _d ⊆ of obstacles separates s from t if and only if G[_d] contains a cycle whose sum of labels is odd. Using this structural characterization of separating sets of obstacles we obtain the following algorithmic results.
In the Obstacle-removal problem the task is to find a curve in the plane connecting s to t intersecting at most q obstacles. We give a 2.3146^q n^{O(1)} algorithm for Obstacle-removal, significantly improving upon the previously best known q^{O(q³)} n^{O(1)} algorithm of Eiben and Lokshtanov (SoCG'20). We also obtain an alternative proof of a constant factor approximation algorithm for Obstacle-removal, substantially simplifying the arguments of Kumar et al. (SODA'21).
In the Generalized Points-separation problem input consists of the set of obstacles, a point set A of k points and p pairs (s₁, t₁), … (s_p, t_p) of points from A. The task is to find a minimum subset _r ⊆ such that for every i, every curve from s_i to t_i intersects at least one obstacle in _r. We obtain 2^{O(p)} n^{O(k)}-time algorithm for Generalized Points-separation. This resolves an open problem of Cabello and Giannopoulos (SoCG'13), who asked about the existence of such an algorithm for the special case where (s₁, t₁), … (s_p, t_p) contains all the pairs of points in A. Finally, we improve the running time of our algorithm to f(p,k) ⋅ n^{O(√k)} when the obstacles are unit disks, where f(p,k) = 2^{O(p)} k^{O(k)}, and show that, assuming the Exponential Time Hypothesis (ETH), the running time dependence on k of our algorithms is essentially optimal
The Maximum Exposure Problem
No full textGiven a set of points P and axis-aligned rectangles R in the plane, a point p in P is called exposed if it lies outside all rectangles in R. In the max-exposure problem, given an integer parameter k, we want to delete k rectangles from R so as to maximize the number of exposed points. We show that the problem is NP-hard and assuming plausible complexity conjectures is also hard to approximate even when rectangles in R are translates of two fixed rectangles. However, if R only consists of translates of a single rectangle, we present a polynomial-time approximation scheme. For general rectangle range space, we present a simple O(k) bicriteria approximation algorithm; that is by deleting O(k^2) rectangles, we can expose at least Omega(1/k) of the optimal number of points
Shortest Paths in the Plane with Obstacle Violations
No full textWe study the problem of finding shortest paths in the plane among h convex obstacles, where the path is allowed to pass through (violate) up to k obstacles, for k <= h. Equivalently, the problem is to find shortest paths that become obstacle-free if k obstacles are removed from the input. Given a fixed source point s, we show how to construct a map, called a shortest k-path map, so that all destinations in the same region of the map have the same combinatorial shortest path passing through at most k obstacles. We prove a tight bound of Theta(kn) on the size of this map, and show that it can be computed in O(k^2 n log n) time, where n is the total number of obstacle vertices
Bibliographics for the 983 eprints in the live archives of E-LIS : trends and status report up to 7th July 2004, based on author-self-archiving metadata
No full textThe priority for ideas and philosophy related to "Network Theory" have been traced back and documented by Braun(2004),and credit goes to Karinthy(1929).The IT has empowered to realise it, as the most practical phenomena and it is no more a humour. The OAI (Open Archives Initiatives)and ACIS (Academic Contributor Information System)are progressive in the direction ,which may lead to realise the "Collective Genius" at global level. Focus of present study is on Author-Self-Archiving (A-S-A)Metadata of the 983 Eprints in the Live Archives of the E-LIS (EPrints of Library and Information Science),which were approved till 7th July 2004.The A-S-A Metadata was used for librametric analysis. Self-explanatory bibliographics are illustrated.The highlights include: Conference papers (34%); highest approval, June 2004 (28%); published archives (76%);not refereed (52%); not in public domain (60%); highest self-archiving-author (De Robbio, Antonella).The Nos. of EPrints having single JITA domain specifications were: Theoretical and general aspects of libraries and information(27); Information use and sociology of information(80);Users,literacy and reading(13);Libraries as physical collections(30);Publishing and legal issues(57);Management(13);Industry, profession and education(36);Information sources, supports, channels(113) ; Information treatment for information services, Information functions and techniques (101); Technical services libraries, archives and museums(25); Housing technologies(1); Information technology and library technology(92); and Inter-domainery (395) i.e. having specifications of two or more than two JITA classes
Evaluation of hydrogeological factors and their relationship with seasonal water table fluctuation in Dhanbad district, Jharkhand, India
No full textA Unified Shell model for Buoyancy-Driven Turbulence
No full textWe construct a unified shell model for stably stratified and convective turbulence. Shell model simulation of stably stratified flow in turbulent regime exhibit Bolgiano-Obukhbov (BO) scaling in which the kinetic energy spectrum varies as . However, simulation of convective turbulence shows Kolmogorov's spectrum. These results are consistent with the direct numerical simulations of Kumar {\em et al.} [Phys. Rev. E {\bf 90}, 023016 (2014)]. We also observe a dual scaling ( and ) for a limited range of parameters in stably stratified flow
Impacts of Watershed Development Programmes: Experiences and Evidences from Tamil Nadu
No full textThe overall performance of watershed development programmes has been examined in the state of Tamil Nadu. The impacts of major watershed development programmes have been outlined in terms of biophysical impacts, environmental impacts, socio-economic impacts and overall economic impacts. It is pointed out that the watershed development activities have made significant positive impacts on various biophysical aspects such as soil and water conservation, soil fertility, soil and water erosion in cropped area, changes in cropping pattern, cropping intensity, production and productivity of crops. Watershed development activities have shown significant positive impacts on water table, perenniality of water in wells, water availability for cattle and other domestic uses, etc. The overall economic impacts have been evaluated in terms of NPV, IRR and BCR. The peoples’ participation in watershed development activities has been found satisfactory but the optimal level is yet to be achieved. Training of farmers has been found effective in disseminating technical knowledge. According to the study, the future strategy should be the movement towards a balanced approach of matching the supply-driven menu with a set of demand-driven activities. Peoples’ participation, involvement of Panchayati Raj Institutions, local user groups and NGOs along side institutional support from different levels, viz. the Union Government, the state, the district and block levels should be ensured to make the programme more participatory, interactive and cost-effective. Convergence of various rural development programmes around the watershed could be ensured to promote holistic development of watersheds. For its continued success, the programme, should be economically efficient, financially viable, technically feasible and socially acceptable while ensuring equity. For, sustainable development, regular and routine monitoring of environmental parameters is important as environmental enhancement increases the credibility and acceptability of the programme.Agricultural and Food Policy,
- …
