Achieving Optimal Inter-Node Communication in Graph Partitioning Using Random Selection and Breadth-First Search

Processing large graph datasets represents an increasingly important area in computing research and applications. The size of many graph datasets has increased well beyond the processing capacity of a single computing node, thereby necessitating distributed approaches. As these datasets are processed over a distributed system of nodes, this leads to an inter-node communication cost problem that negatively affects system performance. Previously proposed algorithms implemented breadth-first search (BFS) for graph searching and focused on the execution, parallel performance and not the communication. In this paper a new methodology is proposed that combines BFS with random selection in order to partition large graph datasets and effectively minimize inter-node communication. The new method is discussed and applied to the single-source shortest path and PageRank algorithms using three graphs that are representative of real-world scenarios. Experimental results show that graph inter-node communication for canonical graphs representative of real-world data is improved up to 42 % in case of Powerlaw graph, up to 27 % in case of Random near K-regular graph (with low degree), and up to 7 % in case of Random near K-regular graph (with high degree).     

Samarium Ion-Doped Maghemite Nanoparticles: Synthesis,Microstructural, Optical,and Magnetic Characterizations

Journal of Superconductivity and Novel Magnetism - This paper reports the effects of rare-earth Sm3+ ion substitution on structural, optical, electronic, and magnetic responses of maghemite...     

In vitro and in vivo degradability,biocompatibility and antimicrobial characteristics of Cu added iron-manganese alloy

In recent years,iron(Fe)based degradable metal is explored as an alternative to permanent fracture fixation devices.In the present work,copper(Cu)is added in Fe-Mn system to enhance the degradation rate and antimicrobial properties.Fe-Mn-xCu(x=0.9,5 and 10 wt.％)alloys are prepared by the melting-casting-forging route.XRD analysis confirms austenite phase stabilization due to the presence of Mn and Cu.As predicted by Thermo-Calc calculations,Cu rich phase precipitations are noticed along the austen-ite grain boundaries.Degradation behaviours of Cu added Fe-Mn alloys are investigated through static immersion and electrochemical polarization where enhanced degradation is found for higher Cu added alloys.When challenged against E.Coli bacteria,the Fe-Mn-Cu alloy media extract shows a significant bac-tericidal effect compare to the base alloy.In vitro cytocompatibility studies,as determined using MG63 and MC3T3-E1 cell lines,indicate increased cell density as a function of time for all the alloys.When implanted in rabbit femur,the newly developed alloy does not show any kind of tissue necrosis around the implants.Better osteogenesis and higher new bone formation are observed with Fe-Mn-10Cu alloy as evident from micro-computed tomography(μ-CT)and fluorochrome labelling.     

New Algorithms for Resource Reclaiming from Precedence Constrained Tasks in Multiprocessor Real-Time Systems

The scheduling of tasks in multiprocessor real-time systems has attracted many researchers in the recent past. Tasks in these systems have deadlines to be met, and most of the real-time scheduling algorithms use worst case computation times to schedule these tasks. Many resources will be left unused if the tasks are dispatched purely based on the schedule produced by these scheduling algorithms, since most of the tasks will take less time to execute than their respective worst case computation times. Resource reclaiming refers to the problem of reclaiming the resources left unused by a real-time task when it takes less time to execute than its worst case computation time. In this paper, we propose two algorithms to reclaim these resources from real-time tasks that are constrained by precedence relations and resource requirements, in shared memory multiprocessor systems. We introduce a notion called a restriction vector for each task which captures its resource and precedence constraints with other tasks. This will help not only in the efficient implementation of the algorithms, but also in obtaining an improvement in performance over the reclaiming algorithms proposed in earlier work [[2]]. We compare our resource reclaiming algorithms with the earlier algorithms and, by experimental studies, show that they reclaim more resources, thereby increasing the guarantee ratio (the ratio of the number of tasks guaranteed to meet their deadlines to the number of tasks that have arrived), which is the basic requirement of any resource reclaiming algorithm. From our simulation studies, we demonstrate that complex reclaiming algorithms with high reclaiming overheads do not lead to an improvement in the guarantee ratio.     

Negation as Failure as Resolution

Providing a clean procedural semantics of the Negation As Failure rule in Logic Programming has been an open problem for some time now. This rule has been treated as a technique in nonmonotonic reasoning, not as a rule in classical logic. This paper contains a demonstration of the negation as failure rule as a resolution procedure in first-order logic. We present a sound and complete resolution scheme for negation as failure rule for the larger class of constraint logic programs. The approach is to consider a canonical partition of the completion of a definite (constraint) program into the IF and the FI programs. We show that a negated goal, provable from the completed definite program is provable from just the FI part. The clauses in this program have a structure dual to that of definite Horn clauses. We describe a sound and complete linear resolution rule for this fragment, and show that a resolution proof of the negated goal from the FI part corresponds to a finite failure tree resulting from classical linear resolution applied to the goal on the If part of the original definite program. Our work shows that negation as failure rule can be computationally efficient in the sense that the SLD-resolution on the If part of a definite program along with the negation as failure rule is more efficient than a direct resolution procedure on the completion of that program.     

Reactivity characteristics of nanoscale zerovalent iron--silica composites for trichloroethylene remediation

Spherical silica particles containing nanoscale zerovalent iron were synthesized through an aerosol-assisted process. These particles are effective for groundwater remediation, with the environmentally benign silica particles serving as effective carriers for nanoiron transport. Incorporation of iron into porous sub-micrometer silica particles protects ferromagnetic iron nanoparticles from aggregation and may increase their subsurface mobility. Additionally, the presence of surface silanol groups on silica particles allows control of surface properties via silanol modification using organic functional groups. Aerosolized silica particles with functional alkyl moieties, such as ethyl groups on the surface, clearly adsorb solubilized trichloroethylene (TCE) in water. These materials may therefore act as adsorbents which have coupled reactivity characteristics. The nanoscale iron/silica composite particles with controlled surface properties have the potential to be efficiently applied for in situ source depletion and in the design of permeable reactive barriers.     

Carob Kibble: A Bioactive‐Rich Food Ingredient

Carob (Ceratonia siliqua L.) is well known for its valuable locust bean gum obtained from the carob seeds. Separation of seeds from the pod leaves behind the carob kibble which is a good source of dietary fiber, sugars, and a range of bioactive compounds such as polyphenols and pinitol. Bioactive compounds present in carob kibble have been found to be beneficial in the control of many health problems such as diabetes, heart diseases, and colon cancer due to their antidiabetic, antioxidant, and anti‐inflammatory activities. Carob kibble has substantial potential to be used as a food ingredient. This article focuses on the composition, health benefits, and food applications of carob kibble.