Search - minimum energy

Search - minimum energy - List

[Windows Develop] MFC_WeatherForecast DL : 0: （1）显示本地天气情况；（2）提供实时查询国内城市天气功能；（3）能进行实时更新天气，如默认每三小时进行更新一次；（3）显示日期（今明）（4）最低能提供两天的天气预报；（5）自行设定更新时间和界面透明度。 -(1) shows the local weather conditions (2) to provide real-time query function of the domestic urban weather (3) real-time updates to weather, such as the default update every three hours (3) shows the date (next) (4) minimum energy provide a two-day weather forecasts (5) update the time and set your own interface transparency.
Date : 2025-12-23 Size : 657kb User :
[Windows Develop] ActiveModels_version7 DL : 0: 使用连续曲线来表达目标边缘，并定义一个能量泛函使得其自变量包括边缘曲线，因此分割过程就转变为求解能量泛函的最小值的过程，一般可通过求解函数对应的欧拉(Euler．Lagrange)方程来实现，能量达到最小时的曲线位置就是目标的轮廓所在。-Continuous curve to express goal edge, and define an energy functional so that its arguments including edge curve, so segmentation process is transformed into the process of solving the minimum energy functional, and generally function by solving the corresponding Euler (Euler. Lagrange) equations to achieve the minimum energy to reach the position of the curve is where the contour of an object.
Date : 2025-12-23 Size : 15.13mb User : 李祥霞
[Windows Develop] CV-model-code2 DL : 0: CV模型是一种重要的图像分割模型,本文针对其收敛速度慢、效率低的缺点提出一种求解CV模型的新方法.首先将CV模型的能量泛函改写成与原来有相同稳定解的总变分公式形式,然后使用对偶公式法求总变分公式的极小值,再在其中引入一速度项以加快模型的收敛速度.新方法一方面克服了梯度下降法要求时间步长小、迭代次数多的缺点,经过较少次的迭代就能收敛,减少了迭代计算的次数-CV model is one of the most important image segmentation model and disadvantage in view of its convergence rate is slow and low efficiency of the proposed a new method for solving the CV model. First, the energy functional of the CV model adapted and had the same stable solution total variational formula, and then use the dual formula method for total variation formula of minimum, and in which introduced a speed to accelerate the convergence speed of the model. New method to overcome the gradient descent method requires small time steps, the number of iterations of the shortcomings of the, after a few times of iteration will converge, reducing the number of iterative computation
Date : 2025-12-23 Size : 40kb User : 李祥霞
[Windows Develop] 111 DL : 0: 在一个果园里，多多已经将所有的果子打了下来，而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。每一次合并，多多可以把两堆果子合并到一起，消耗的体力等于两堆果子的重量之和。可以看出，所有的果子经过n-1次合并之后，就只剩下一堆了。多多在合并果子时总共消耗的体力等于每次合并所耗体力之和。因为还要花大力气把这些果子搬回家，所以多多在合并果子时要尽可能地节省体力。假定每个果子重量都为1，并且已知果子的种类数和每种果子的数目，你的任务是设计出合并的次序方案，使多多耗费的体力最少，并输出这个最小的体力耗费值。例如有3种果子，数目依次为1，2，9。可以先将1、2堆合并，新堆数目为3，耗费体力为3。接着，将新堆与原先的第三堆合并，又得到新的堆，数目为12，耗费体力为12。所以多多总共耗费体力=3+12=15。可以证明15为最小的体力耗费值。输入输入包括两行，第一行是一个整数n(1<＝n<=10000)，表示果子的种类数。第二行包含n个整数，用空格分隔，第i个整数ai(1<＝ai<=10000)是第i种果子的数目。输出输出包括一行，这一行只包含一个整数，也就是最小的体力耗费值。输入数据保证这个值小于2^31。-In an orchard, a lot has shot down all the fruit, and the fruit is divided into different types according to different stack. We decided to put all the fruit of a lot of synthetic pile. Every merger, a lot of fruit into two piles can put together, physical consumption equal to the weight of the fruit and piles. As can be seen, all the fruit after n-1 merger, on the left a pile. When you merge a lot of fruit in the total consumption of physical strength equal to the sum of the consumption of each merger. Because it will take great effort to put these fruits to move back home, so a lot of fruit in consolidation to save energy as much as possible. The number of species and the number of each fruit is assumed that each fruit weight is 1, and the fruit is known, your task is to design a combined order of programs to spend a lot of physical minimum, and output value of the minimum physical cost. For example there are three kinds of fruit, followed by the number 1,2,9. 1,2 heap can first merg
Date : 2025-12-23 Size : 2kb User : ton
[Windows Develop] programm DL : 0: 基于最小能量统计的语音增强算法，使用vs2010编译器，测试文件使用dat语音文件-Statistics based on minimum energy speech enhancement algorithm using vs2010 compiler, test files using dat voice files
Date : 2025-12-23 Size : 2kb User : 孙航
[Windows Develop] apple DL : 0: 程序设计，合并果子例如有3种果子，数目依次为1，2，9。合并方案如下： 1. 将1、2合并，得到新堆数目为3，耗费体力为3。 2. 将新堆与第三堆合并，又得到新堆，数目为12，耗费的体力为12。 3. 总共消耗体力为 3 + 12 = 15，可以证明15为最小的体力耗费值。输入输入包括两行，第一行是一个整数 n (1<＝n<=10000)，表示果子的种类数。第二行包含 n 个整数，用空格分隔，第 i 个整数 ai (1<＝ai<=10000)是第 i 种果子的数目。(Programming combines fruit For example, there are 3 kinds of fruit, the number is 1, 2, 9. The merger scheme is as follows: 1. combined 1 and 2, the new heap number is 3, and the physical strength is 3. 2. combine the new heap with the third heap, and get the new heap, the number is 12, the energy consumption is 12. 3. of the total physical exertion was 3 + 12 = 15, and 15 could be proved to be the minimum physical exertion value. input The input consists of two rows, and the first line is an integer n (1< = n<=10000) indicating the number of fruits. The second line contains n integers, separated by spaces. The first I integer AI (1< = ai<=10000) is the number of the first I species.)
Date : 2025-12-23 Size : 1.41mb User : 小猴子