Requesting codes from问题
大家好,我最近在我的应用中出现这么个问题:
Caused by: java.lang.SecurityException: Requesting code from com.android.localapp (with uid 10072)
查看了下代码实在这个地方
activityManager.startActivity("0", intent).getDecorView();报了异常,但是不是必先,几乎很少会突然出现。我看了下异常的调用栈最后一句是:at android.app.ActivityThread.getPackageInfo(ActivityThread.java:1582)我去查了下android4.0.3的源码,异常出现在这个地方:
public final LoadedApk getPackageInfo(ApplicationInfo ai, CompatibilityInfo compatInfo, int flags) {
boolean includeCode = (flags&Context.CONTEXT_INCLUDE_CODE) != 0;
boolean securityViolation = includeCode && ai.uid != 0 && ai.uid != Process.SYSTEM_UID && (mBoundApplication != null? ai.uid != mBoundApplication.appInfo.uid : true);
if ((flags&(Context.CONTEXT_INCLUDE_CODE
|Context.CONTEXT_IGNORE_SECURITY))
== Context.CONTEXT_INCLUDE_CODE) {
if (securityViolation) {
//报错在这
String msg = "Requesting code from " + ai.packageName
+ " (with uid " + ai.uid + ")";
if (mBoundApplication != null) {
msg = msg + " to be run in process "
+ mBoundApplication.processName + " (with uid "
+ mBoundApplication.appInfo.uid + ")";
}
throw new SecurityException(msg);
}
}
return getPackageInfo(ai, compatInfo, null, securityViolation, includeCode);
} 本地app出错在一个activitygroup中,不知道是为什么很奇怪,话说,也没有去调用其他进程中的activity啊,咋会出现这个异常呢。。。相关推荐
Matlab codes for shape from shading.zip
Matlab codes for shape from shading.zip
Fountain codes论文
Fountain codes are record-breaking sparse-graph codes for channels with erasures, such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file transfer protocols simply chop a file up into K packetsized pieces, then repeatedly transmit each packet until it is successfully received. A back channel is required for the transmitter to find out which packets need retransmitting. In contrast, fountain codes make packets that are random functions of the whole file. The transmitter sprays packets at the receiver without any knowledge of which packets are received. Once the receiver has received any N packets, where N is just slightly greater than the original file size K, the whole file can be recovered. In the paper random linear fountain codes, LT codes, and raptor codes are reviewed. The computational costs of the best fountain codes are astonishingly small, scaling linearly with the file size.
fk2_codes fk2_codes
fk2_codes fk2_codes fk2_codes fk2_codes fk2_codes fk2_codes
raptor codes:一种极好的前向纠错编码算法
We will also introduce novel techniques for the analysis of the error probability of the decoder for finite length Raptor codes. Moreover, we will introduce and analyze systematic versions of Raptor codes, i.e., versions in which the first output elements of the coding system coincide with the original elements.
CODES:这只是一个转储资源库,我可以在其中转储我所解决的问题的解决方案
CODES:这只是一个转储资源库,我可以在其中转储我所解决的问题的解决方案


