In this paper we propose an enhanced parallel iterative scheduler for IBWR synchronous slotted OPS switches in SCWP mode. It obtains a maximal matching of packet demands without resource conflicts. The analytical and numerical results are highly competitive regarding previous work.

We analyze harmonic generation in a two-dimensional (2D) chi((2)) photonic crystal and demonstrate the possibility of multiple phase matching and multicolor parametric frequency conversion. We suggest a new type of photonic structure to achieve simultaneous generation of several harmonics; we also present both general analytical results and design parameters for 2D periodically poled LiNbO(3) s...

Recruitment or popularly known as recruitment is the process of selecting and sorting human resources to carry out company objectives. A Decision support system (DSS) an alternative computer-based that can assist organizations companies in making structured efficient decisions. Selecting employees with needs standards policy be solved by AHP method (Analytical Hierarchy Process) PM (Profile Mat...

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

typographical data entry errors and incomplete documents, produce imperfect records in real world databases. these errors generate distinct records which belong to the same entity. the aim of approximate record matching is to find multiple records which belong to an entity. in this paper, an algorithm for approximate record matching is proposed that can be adapted automatically with input error...

We consider the problem of learning a classifier using only positive and unlabeled samples. In this setting, it is known that a classifier can be successfully learned if the class prior is available. However, in practice, the class prior is unknown and thus must be estimated from data. In this paper, we propose a new method to estimate the class prior by partially matching the class-conditional...

In this paper, we derive optimal search patterns for fast block matching motion estimation. Since the motion search pattern is important in terms of search speed and correctness of the motion information, we consider various search patterns and search strategies. By analyzing the block matching algorithm as a function of the block size and distance in the search area, we find analytic search pa...

Given n uniformly and independently distributed points in a ball of unit volume in dimension d, it is well established that the length of several combinatorial optimization problems (including the minimum spanning tree (MST), the minimum matching (M), the traveling salesman problem (TSP), etc.) on these n points obeys laws of large numbers. It has been a long open conjecture that a central limi...