我想做个影集、下载了数码大师，可是要注册才可以而且没办法保存，我想找个不用注册的软件，可以做特效_百度知道
我想做个影集、下载了数码大师，可是要注册才可以而且没办法保存，我想找个不用注册的软件，可以做特效
添加背景音乐的，或者告诉我适用版怎么保存也可以，谢谢
提问者采纳
如果要专业一点就用Premiere吧,我喜欢用的版本是Premiere2.0.或者用会声会影也可以,目前这两个软件做影集和相册是流行的.还可以加上卡拉OK字幕呢.如果愿意请把照片发过来,我帮你做一首卡拉OK,照片要比较清晰的,如果以人物为主题,就要把人物拍得比较大一些的.一般一首歌可以做20到30张照片,如果需要你就自己选择一首歌吧,并把照片发过功矗哆匪馨睹鹅色珐姬来,QQ:
其他类似问题
按默认排序
其他2条回答
电子影集用最新的“朵朵多媒体电子相册”软件制作
朵朵多媒体电子相册使用超级简单，但效果很不错：
影集制作只要把图片、视频、音乐文件复制到指定的文件夹，就马上可以将数码照片和视频、音乐转成相册，制做成自己的个性相册和动感影集。象看电视一样浏览，照片过滤采用蒙太渐变特效，美观人性，同时还内置了200多首背景音乐（可自己添加修改），还可以播放各种影音文件、DVD、蓝光文件、播放MTV和您亲自导演的MTV影片。不仅可以方便的选择专辑，还能控制音乐、自动播放与暂停，还可查看原图，进入照片目录自己添加文件；更能全面播放各种影音文件，首次使用即可自动批量将数码相机的照片按比例裁剪成标准图片，整个使用过程非常简单易用。下载：
用会声会影X2，不管是视频还是图片还是音乐还是特效都能同时加进去，叠加都没问题，我就是用这个做视频的，不用注册，给你看看我做的视频效果
数码大师的相关知识
您可能关注的推广
等待您来回答
下载知道APP
随时随地咨询
出门在外也不愁淫妻交换亚洲无码_西西大胆人体骚图_操少妇人妻交换_性欲声音视频娱乐>> actuarial-_-inst-_-bfanalisis.m - dfd sdfdfdf&lease do your best to d
Click here to see more ▼
Click here to hide ▲
actuarial-_-inst-_-bfanalisis.m - dfd sdfdfdf&lease do your best to d
Download:&
## Copyright (C) 2009 Esteban Cervetto &&
## Oct you can redistribute it and/or modify it
## under the terms of the GNU General Public License as published by
## the Free Software F either version 3 of the License, or (at
## your option) any later version.
## Octave is distributed in the hope that it will be useful, but
## WITHOUT ANY WARRANTY; without even the implied warranty of
## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
See the GNU
## General Public License for more details.
## You should have received a copy of the GNU General Public License
## along with O see the file COPYING.
If not, see
## &http://www.gnu.org/licenses/&.
## -*- texinfo -*-
## @deftypefn {
Function File
} bfanalisis (@var{
ultimate_ext
## Calculate the extended Bornhuetter-Ferguson method for reserves in many ways. If all arguments are provided,
## it calculates 30 different estimations included in the @var{
} structure. It also returns the @var{
} had two levels:
##level 1: Type of Ultimate
## list of posible estimative methods:
##@example
##@multitable {
xxxxxxxxxxxxx
xxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxx
xxxxxxxxxxxxxxxxx
##@headitem FLAG @tab METHOD @tab REQUIRES @tab RELATED FUNCTION
##@item ultad
@tab Loss Ratio AD
ultimatead.m
##@item ultcc
@tab Cape Cod
ultimatecc.m
##@item ultexternal @tab none
@tab ultimate_ext @tab
##@item ultld
@tab Loss Development @tab S
ultimateld.m
##@item ultmack
ultimatemack.m
##@item ultpanning
@tab Panning
ultimatepanning.m
##@end multitable
##@end example
##@end group
##level 2: Type of Quotas
## list of posible estimative methods:
##@example
##@multitable {
xxxxxxxxxxxxxxxx
xxxxxxxxxxxxxxxxxx
xxxxxxxxxxxxx
xxxxxxxxxxxxxxxxxx
##@headitem FLAG @tab METHOD @tab REQUIRES @tab RELATED FUNCTION
##@item quotasad
Loss Ratio AD
##@item quotasexternal
@tab quota_ext @tab
##@item quotasld
Loss Development @tab S
##@item quotasmack
quotamack.m
##@item quotaspanning
quotapanning.m
##@end multitable
##@end example
##@end group
## Parameters:
} is a mxn matrix that contains the run-off triangle, where m is the number of accident-years
## and n is the number of periods to final development. @var{
} may contain u = m-n complete years.
## Optional:
} is an mx1 vector of known volume measures (like premiums or the number of contracts).
} is an 1xn vector with an external scheme of quotas.
## @example
E[S(i,k+1)]
## quota(k) =
-------------,
E[S(i,n) ]
## @end example
## @end group
ultimate_ext
} is a mx1 vector wuth an external estimatios of the ultimate column.
## @seealso {
## @end deftypefn
## Author: Act. Esteban Cervetto ARG &&
## Maintainer: Act. Esteban Cervetto ARG &&
## Created: jul-2009
## Version: 1.1.0
## Keywords: actuarial reserves insurance bornhuetter ferguson chainladder
function [quotas,outcome] = bfanalisis (S,V,quota_ext,ultimate_ext)
#check number of arguments in
if (nargin==0)
usage(&insuficient args. Enter a mxn triangle of losses at least&);
[m,n] = size (S);
#triangle with m years (i=1,2,u,...u+1,u+2,....m) and n periods (k=0,1,2,...n-1)
#rows of the upper square
S = fliplr(triu(fliplr(S),-u));
#ensure S is triangular
quotas.ld = quotald(S);
#quotas LD
quotas.panning = quotapanning(S);
#Panning quotas
outcome.ultld.quotasld(:,k) = bferguson(S,quotas.ld,ultimateld(S,quotas.ld),k-1);
outcome.ultld.quotaspanning(:,k) = bferguson(S,quotas.panning,ultimateld(S,quotas.panning),k-1);
outcome.ultpanning.quotasld(:,k) = bferguson(S,quotas.ld,ultimatepanning(S,quotas.ld),k-1);
outcome.ultpanning.quotaspanning(:,k) = bferguson(S,quotas.panning,ultimatepanning(S,quotas.panning),k-1);
if (nargin&1)
# verify V
if (size(V) ~= [m,1])
usage(strcat(&volume V must be of size [&,num2str(m),&,1]& ));
quotas.ad = quotaad(S,V);
#quotas AD
quotas.mack = quotamack(S,V);
#quotas Mack
outcome.ultld.quotasad(:,k) = bferguson(S,quotas.ad,ultimateld(S,quotas.ad),k-1);
outcome.ultld.quotasmack(:,k) = bferguson(S,quotas.mack,ultimateld(S,quotas.mack),k-1);
outcome.ultpanning.quotasad(:,k) = bferguson(S,quotas.ad,ultimatepanning(S,quotas.ad),k-1);
outcome.ultpanning.quotasmack(:,k) = bferguson(S,quotas.mack,ultimatepanning(S,quotas.mack),k-1);
outcome.ultad.quotasld(:,k) = bferguson(S,quotas.ld,ultimatead(S,V),k-1);
outcome.ultad.quotaspanning(:,k) = bferguson(S,quotas.panning,ultimatead(S,V),k-1);
outcome.ultad.quotasad(:,k) = bferguson(S,quotas.ad,ultimatead(S,V),k-1);
outcome.ultad.quotasmack(:,k) = bferguson(S,quotas.mack,ultimatead(S,V),k-1);
outcome.ultcc.quotasld(:,k) = bferguson(S,quotas.ld,ultimatecc(S,V,quotas.ld),k-1);
outcome.ultcc.quotaspanning(:,k) = bferguson(S,quotas.panning,ultimatecc(S,V,quotas.panning),k-1);
outcome.ultcc.quotasad(:,k) = bferguson(S,quotas.ad,ultimatecc(S,V,quotas.ad),k-1);
outcome.ultcc.quotasmack(:,k) = bferguson(S,quotas.mack,ultimatecc(S,V,quotas.mack),k-1);
outcome.ultmack.quotasld(:,k) = bferguson(S,quotas.ld,ultimatemack(S,V),k-1);
outcome.ultmack.quotaspanning(:,k) = bferguson(S,quotas.panning,ultimatemack(S,V),k-1);
outcome.ultmack.quotasad(:,k) = bferguson(S,quotas.ad,ultimatemack(S,V),k-1);
outcome.ultmack.quotasmack(:,k) = bferguson(S,quotas.mack,ultimatemack(S,V),k-1);
if (nargin&2)
#check out quota_ext
if (size(quota_ext) ~= [1,n])
usage(strcat(&quota_ext must be of size [1,&,num2str(n),&]& ));
quotas.external = quota_
#external quotas
outcome.ultld.quotasexternal(:,k) = bferguson(S,quotas.external,ultimateld(S,quotas.external),k-1);
outcome.ultpanning.quotasexternal(:,k) = bferguson(S,quotas.external,ultimatepanning(S,quotas.external),k-1);
outcome.ultad.quotasexternal(:,k) = bferguson(S,quotas.external,ultimatead(S,V),k-1);
outcome.ultcc.quotasexternal(:,k) = bferguson(S,quotas.external,ultimatecc(S,V,quotas.external),k-1);
outcome.ultmack.quotasexternal(:,k) = bferguson(S,quotas.external,ultimatemack(S,V),k-1);
if (nargin&3)
#verify ultimate_ext
if (size(ultimate_ext) ~= [m,1])
usage(strcat(&ultimate_ext must be of size [&,num2str(m),&,1]& ));
outcome.ultexternal.quotasld(:,k) = bferguson(S,quotas.ld,ultimate_ext,k-1);
outcome.ultexternal.quotaspanning(:,k) = bferguson(S,quotas.panning,ultimate_ext,k-1);
outcome.ultexternal.quotasad(:,k) = bferguson(S,quotas.ad,ultimate_ext,k-1);
outcome.ultexternal.quotasmack(:,k) = bferguson(S,quotas.mack,ultimate_ext,k-1);
outcome.ultexternal.quotasexternal(:,k) = bferguson(S,quotas.external,ultimate_ext,k-1);
Download: &
& & Sponsored links
Tips: You can preview the content of files by clicking file names^_^
NameSizeDate
&&&0.00 B 16:36
&&&0.00 B 14:00
&&&0.00 B 12:14
&&&0.00 B 12:14
&&&0.00 B 12:14
&&&0.00 B 16:36
&&&0.00 B 16:36
&&&0.00 B 16:36
&&&0.00 B 12:14
&&&0.00 B 16:36
&&&0.00 B 16:36
&&&0.00 B 14:00
&&&0.00 B 16:36
&&&0.00 B 16:36
&&&0.00 B 16:36
&&&0.00 B 16:36
&&&0.00 B 16:36
&&&0.00 B 14:00
&COPYING34.32 kB 16:36
&INDEX171.00 B 16:36
&DESCRIPTION552.00 B 16:36
&4.80 kB 16:36
&2.73 kB 16:36
&3.66 kB 16:36
&7.61 kB 16:36
&3.49 kB 16:36
&2.65 kB 16:36
&2.53 kB 16:36
&3.13 kB 16:36
&5.04 kB 16:36
&2.91 kB 16:36
&3.37 kB 16:36
&1.45 kB 14:00
&all-wcprops468.00 B 14:00
&entries709.00 B 12:14
&all-wcprops1.69 kB 14:00
&entries2.06 kB 12:14
&COPYING.svn-base34.32 kB 16:36
&INDEX.svn-base171.00 B 16:36
&DESCRIPTION.svn-base552.00 B 16:36
&ultimatemack.m.svn-base4.80 kB 16:36
&ultimatepanning.m.svn-base2.73 kB 16:36
&quotaad.m.svn-base3.66 kB 16:36
&bfanalisis.m.svn-base7.61 kB 16:36
&ultimatecc.m.svn-base3.49 kB 16:36
&bferguson.m.svn-base2.65 kB 16:36
&ultimatead.m.svn-base2.53 kB 16:36
&quotald.m.svn-base3.13 kB 16:36
&quotamack.m.svn-base5.04 kB 16:36
&ultimateld.m.svn-base2.91 kB 16:36
&quotapanning.m.svn-base3.37 kB 16:36
&porcentual.m.svn-base1.45 kB 14:00
& & Sponsored links
Related source codes
& & Sponsored links
Password：
Verification code：
Remember me
sponsored links:
☉ What is your favorite Linux code editor/IED?
切换到中文版？
Login CodeForge
Don't have an account？
Need any help?
Sorry, you don't have enough CF coins! ^_^|||
Fast channel (Get CF coins immediately):
CF coins (points) for $10.00 USD
CF coins (points) for20.00USD
CF coins (points) for50.00USD
CF coins (points) for100.00USD
Free channel :
You could get 1-10 CF coins
Prompt message
Sorry, no results match your search, please go to
to ask for help!