Abstract We describe an extension of the halo-based galaxy group-finding algorithm. add freedom to algorithm in order more accurately determine which galaxies are central and satellites, provide unbiased estimates halo masses. focus on determination galaxy-halo relations for star-forming quiescent galaxies. The added is self-calibrated using observations color-dependent clustering, as well meas...

As a current reality, students are frequently questioned about suitable career path for the future, but they unaware of jobs offered by industries. Moreover, seeking university admission encounter difficulties selecting courses and educational programs, confronted with variety available courses. This research aims to make mobile application obtain employment options appropriate their qualificat...

An 8-bit programmable square finder cum frequency divider architecture is presented. This special architecture includes a high speed parallel counter, clock trigger circuit, eight bit multiplier logic, sequence termination logic and sequence restarter logic. The entire architecture is divided into two parts: The frequency divider section and the square finder section. The frequency divider circ...

In recent years advanced car navigation systems have emerged as a key tool for commuters. For tourists and visitors, analogous mobile tour guides are equally important when exploring urban and outdoor spaces. During the development of a mobile tour guide designed specifically for hikers and cyclists the need for route planning based on individualized time estimates became evident. Despite progr...

For a given set A C_ (-Tr; +Tr] of angles, the problem "Angle-Restricted Tour" (ART) is to decide whether a set P of n points in the Euclidean plane allows a closed directed tour consisting of straight line segments, such that all angles between consecutive line segments are from the set A. We present a variety of algorithmic and combinatorial results on this problem. In particular, we show tha...

Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN), popular choices for tour construction heuristics, work at acceptable level for the Euclidean TSP, but produce very poor results for the general Symmetric and Asymmetric TSP (STSP and ATSP). We prove that for every n ≥ 2 there is an instance of ATSP (STSP) on n vertices for which GR finds the w...

Distributed denial of service (DDoS) attacks pose great threat to the Internet and its public services. Various computation-based cryptographic puzzle schemes have been proposed to mitigate DDoS attacks when detection is hard or has low accuracy. Yet, existing puzzle schemes have shortcomings that limit their effectiveness in practice. First, the effectiveness of computation-based puzzles decre...

In this study, we implement a random-effects model that estimates cubic spline-based time-dependent skill functions for 253 active PGA Tour golfers over the 1998–2001 period. Our model controls for the first-order autocorrelation of residual 18-hole scores and adjusts for round–course and player–course random effects. Using the model, we are able to estimate time-varying measures of skill and l...

Many crimes can happen every day in a major city, and figuring out which ones are committed by the same individual or group is an important and difficult data mining challenge. To do this, we propose a pattern detection algorithm called Series Finder, that grows a pattern of discovered crimes from within a database, starting from a “seed” of a few crimes. Series Finder incorporates both the com...