PROBABILITY OF BPSK SIGNAL RECEPTION ERROR IN PRESENCE OF SIMILAR HINDRANCE

The paper considers the problem of calculation of average probability of error of optimum symbol‑by‑symbol coherent reception of binary opposite phase‑shift keyed signals (BPSK) in the presence of similar synchronous noise. The noise similar to signal of PSK‑2 (BPSK), synchronous on clock periods, matching on frequency, differing in sequence of information characters and, perhaps, on initial phase of the bearing fluctuation is considered, up to mutual coherence of signal and noise. Formulas for calculation of probability of error are derived and results of partial computer type of diagrams of tension are given in some points of the correlation receiver. Optimum reception of discrete signals is carried out by means of the correlation receiver or the coordinated filter configured on signal in lack of noise in the presence of only receiver noises. It is shown that availability of synchronous similar or harmonious coherent noise, aim on structure, leads to decrease in noise stability of radio channel of information transfer. Than the level of noise is higher, that the probability of error is more.

PERLINDUNGAN HUKUM TRANSAKSI JUAL BELI KOMPUTER RAKITAN MENURUT UNDANG-UNDANG TENTANG PERLINDUNGAN KONSUMEN (Studi Di Bintan Risky Computer Surabaya)

In the computer trade is known two terms of the computer type namely Branded computer, which is usually sold in a well packet, assembled by the producer (company) and the second one is assembly computer that nowadays dominates more than 60 % of computer market share in Indonesia in which the trade transaction makes many obstacles which need the solution and law protection for those involved in the trade transaction of assembly computer. By being prevailed the law of number 8, 1999 about consumer protection, it is wondered whether it has given the law protection for those who are involved especially the consumers. It can be devided into three stages, they are preliminary transaction or the bargain of assembly computer through advertisement, the transaction or agreement of the assembly computer trade and the last is the transaction of sale after service that also concerns with the guarantee. The form of lawsuit solution is commonly done by the familial relathionship between the consumer and the seller. It is the best and effective solution, although the law of the consumer protection also gives the place to complain their cases through the consumer lawsuit affairs. Key words: law protection, trade transaction, assembly computer

The Research and Development of an Exam-Integrating System Based on .NET-Test Library

In order to implement Exam-Integrating system with the function of auto generating papers, in this paper, we propose a program which processes the non-text information in the system such as complex formulas and graphics. The program takes model of reflection technology, with the use of ASP .NET technology and SQL Server 2005 database. The system completes both test library by hand and Exam-Integrating by specified parameters, and then generates the paper by automatically computer type setting.

PARALLELIZATION OF SHORT- AND LONG-RANGE CELLULAR AUTOMATA ON SCALAR, VECTOR, SIMD AND MIMD MACHINES

Algorithms exhibiting parallelization on many different levels are discussed for short-and long-range cellular automata implemented on scalar, vector, SIMD and MIMD machines. Short range cellular automata are commonly used for simulating hydrodynamic fluid flows, while long range cellular automata are applicable to neural networks at zero temperature. A common programming approach based upon multi-spin coding and including higher levels of parallelization when possible, has been used to implement these models on the SUN SPARC-1, the IBM-3090, the Alliant FX/2800, the NEC-SX3/11, the Cray-YMP/832 and the Connection Machine, CM-2. Section 4 of the paper compares the performance of these computers for the algorithms discussed in the text. Additionally, the major subroutines for each computer type are given in the Appendix.

The application of logic programming to the generation of plans for robots

SUMMARYThe previous paper by the same authors (Robotica 2, Part 2, pp. 93–103 1984) was concerned with the application of logic programming to the generation of paths for robots. This paper is dealing with the PIGS system for robot problem-solving in generating plans for robots. The system avoids the overhead of generating a new set of facts for each state considered. A computer-type control is adopted not only to generate a simple sequence of actions to be performed by the robot, but also to enable the robot to follow an accurately defined path. A suitable plan of action of a robot problem-solving system is generated. The system is written in the PROLOG language and acts as a robot plan generator that is integrated with a path finding procedure in order to avoid collisions whilst plans are being implemented.