I think this the first time every one can look at a PE crypter source in top level language such VC++. So as I promised ... if some one sent me one nice compress source I would publish my source. I dedicate this source to all people who involve in this field. I hope it helps someone. Have good days ashkbiz Check: yodap.cjb.net
标签： language crypter source think
上传时间： 2013-12-29
上传用户：dianxin61
TI warrants performance of its products to the specifications applicable at the time of sale in accordance with TI’s standard warranty. Testing and other quality control techniques are utilized to the extent TI deems necessary to support this warranty. Specific testing of all parameters of each device is not necessarily performed, except those mandated by government requirements.
标签： specifications performance applicable the
上传时间： 2016-01-16
上传用户：weixiao99
As all of you know, MATLAB is a powerful engineering language. Because of some limitation, some tasks take very long time to proceed. Also MATLAB is an interpreter not a compiler. For this reason, executing a MATLAB program (m file) is time consuming. For solving this problem, Mathworks provides us C Math Library or in common language, MATLAB API. A developer can employ these APIs to solve engineering problems very fast and easy. This article is about how can use these APIs.
标签： some engineering limitation language
上传时间： 2013-12-06
上传用户：huql11633
// Copyright (c), Philips Semiconductors Gratkorn // (C)PHILIPS Electronics N.V.2000 // All rights are reserved. // Philips reserves the right to make changes without notice at any time. // Philips makes no warranty, expressed, implied or statutory, including but // not limited to any implied warranty of merchantibility or fitness for any //particular purpose, or that the use will not infringe any third party patent, // copyright or trademark. Philips must not be liable for any loss or damage // arising from its use.
标签： Semiconductors Electronics Copyright Gratkorn
上传时间： 2016-02-04
上传用户：xuanjie
Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
标签： interesting Traveling classical Salesman
上传时间： 2016-02-06
上传用户：rocwangdp
First of all we would like to thank God Almighty for giving us the strength and confidence in pursing the ambitions. We would like to thank our Examiner Professor Axel Jantsch for allowing us to do this under his guidance and encouragement. At the same time we would like to mention our sincere thanks to Mr. Said Zainali, Manager of FRAME ACCESS AB for giving all the required equipment and the technical support which helped us to finish this thesis. We would like to mention our gratitude to our fellow VACS team members who helped us a lot during difficult times.
标签： confidence Almighty strength giving
上传时间： 2013-12-01
上传用户：小码农lz
I2C Slave module The module contains N accessable Registers when in read Process, all Registers are read at a time when in write Process, only the addressed register are Writeable.
标签： Registers module accessable contains
上传时间： 2016-05-13
上传用户：xauthu
For solving the following problem: "There is No Free Lunch" Time Limit: 1 Second Memory Limit: 32768 KB One day, CYJJ found an interesting piece of commercial from newspaper: the Cyber-restaurant was offering a kind of "Lunch Special" which was said that one could "buy one get two for free". That is, if you buy one of the dishes on their menu, denoted by di with price pi , you may get the two neighboring dishes di-1 and di+1 for free! If you pick up d1, then you may get d2 and the last one dn for free, and if you choose the last one dn, you may get dn-1 and d1 for free. However, after investigation CYJJ realized that there was no free lunch at all. The price pi of the i-th dish was actually calculated by adding up twice the cost ci of the dish and half of the costs of the two "free" dishes. Now given all the prices on the menu, you are asked to help CYJJ find the cost of each of the dishes.
标签： Limit following solving problem
上传时间： 2014-01-12
上传用户：362279997
Linux was first released into an unsuspecting world in the summer of 1991. Initially the spare-time hobby of a Finnish computer scientist by the name of Linus Torvalds, Linux was at first accessible only in software source code form to those with enough expertise to build and install it. Early enthusiasts (most also developers themselves by necessity) exploited the growth of the Internet in the early 1990s as a means to build online communities and drive development forward. These communities helped to build the first Linux software distributions, containing all the software components needed to install and use a Linux system without requiring users to be technical experts.
标签： unsuspecting spare-time Initially the
上传时间： 2013-12-12
上传用户：dianxin61
What I am trying to introduce here is a full fledged Java Instant messenger, which has all the features supplied by commercial messengers like Yahoo or MSN. Although it cannot compared to be in par with those messengers, it is an attempt by me to learn Advanced Java and JNI concepts. The challenges I faced here were often overcome by referring to numerous sites, which nearly zeroes in or completely solved the issues I faced at that point of time. It improved my learning curve and also believe would do the same to you too. Ofcourse, there are some bugs and glitches, which I hope you would excuse. Thanks to anyone who takes the pain to report them or even suggest better way of doing things to me.
标签： introduce messenger Instant fledged
上传时间： 2014-12-05
上传用户：电子世界
