ACM試題An Easy Problem
Description
As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form. Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of 1 s in whose binary form is the same as that in the binary form of I. For example, if "78" is given, we can write out its binary form, "1001110". This binary form has 4 1 s. The minimum integer, which is greater than "1001110" and also contains 4 1 s, is "1010011", i.e. "83", so you should output "83".
This is a little console mode utility program which is able to
(de-)compress single files with a static Arithmetic compression
algorithm. You could easily add the RLE/BWT/MFT data
transformation algorithms. Just rip the corresponding classes
out of my HuffComp source code. I won t add these ones in the
next time.
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
* CONSTRAINTS
* This module does not handle data which is considered out of range by the
* application(i.e. fixed constants which represent error condition)
*
* Maximum weight value must be limited to 128 to prevent an overflow
* condition during the calculation.
*
* The internal data type must be large enough to handle the calculations.
* The maximum possible internal value
* = Max Input Value * (weight - 1) + Max Input Value
* If a maximum weight of 128 is used, the internal data type should be 2
* times the size of the input data type.
* DEFINITION
* This is the header file for a library module used to calculate the median
* of a list of values. It finds the value that would be in the center if
* the list were sorted. If the list contains an even number of values, the
* lower of the two center values is reported. The values themselves are not
* sorted or modified in any way. This algorithm can be used as a filtering
* tool for rejecting noisy data.
Prony算法工具箱。Prony方法是用一組指數項的線性組合來擬和等間距采樣數據的方法,可以從中分析出信號的幅值、相位、阻尼因子、頻率等信息。considerations including data preprocessing, model order selection, model order selection criteria, signal subspace selection, signal and noise separation, root inspection and assessing residuals. The PTbox provides flexibility to compare and display analysis results simultaneously for several parameter variations.
DETRIN is a C++ library of classification algorithms and other utilities in the field of data mining. We will use standard ISO C++ programming language to develop our project. The goal of DETRIN is to facilitate researchers in the related fields.
In order to thoroughly understand what makes Linux tick and why it works so well on a wide variety of systems, you need to delve deep into the heart of the kernel. The kernel handles all interactions between the CPU and the external world, and determines which programs will share processor time, in what order. It manages limited memory so well that hundreds of processes can share the system efficiently, and expertly organizes data transfers so that the CPU isn t kept waiting any longer than necessary for the relatively slow disks.
This program demonstrates using watchdog timers to invoke deadline
handlers. CoordinatorTask sends data to the organizer.
OrganizerTask receives data from the coordinatorTask, and resets
the coordinatorTask when no data is sent by the coordinatorTask in
the past five seconds (deadline time). This demonstration program
is automatically stopped after twenty seconds.
SharpPrivacy - OpenPGP for C#:
SharpPrivacy is an OpenPGP implementation in C#. It can be used to encrypt and sign data, created OpenPGP compatible keys, and a lot more. This article explains how to use the library in your own .NET application or webpage to encrypt, sign, decrypt or verify OpenPGP messages.
