图的分数[a,b]-因子存在的一个条件

图G的孤立韧度定义为I(G)=min｛｜S｜/i(G-S):S!V(G),i(G-S)≥2｝,若G不是完全图;否则,令I(G)=∞。论文给出了图的分数[a,b]-因子的存在性与图的孤立韧度的关系。证明若δ(G)≥I(G)≥a-1+a/b,则图G有分数[a,b]-因子,其中a相似文献   

Efficient C4.5 [classification algorithm]

We present an analytic evaluation of the runtime behavior of the C4.5 algorithm which highlights some efficiency improvements. Based on the analytic evaluation, we have implemented a more efficient version of the algorithm, called EC4.5. It improves on C4.5 by adopting the best among three strategies for computing the information gain of continuous attributes. All the strategies adopt a binary search of the threshold in the whole training set starting from the local threshold computed at a node. The first strategy computes the local threshold using the algorithm of C4.5, which, in particular, sorts cases by means of the quicksort method. The second strategy also uses the algorithm of C4.5, but adopts a counting sort method. The third strategy calculates the local threshold using a main-memory version of the RainForest algorithm, which does not need sorting. Our implementation computes the same decision trees as C4.5 with a performance gain of up to five times     

A sufficient condition for a graph to be an (a,b, k)-critical graph

Let G be a graph, and let a, b, k be integers with 0≤a≤b, k≥0. An [a, b]-factor of graph G is defined as a spanning subgraph F of G such that a≤d _F (x)≤b for each x∈V(G). Then a graph G is called an (a, b, k)-critical graph if after deleting any k vertices of G the remaining graph of G has an [a, b]-factor. In this article, a sufficient condition is given, which is a neighborhood condition for a graph G to be an (a, b, k)-critical graph.     

Un ulteriore esempio relativo ad un certo problema di approssimazione negli spaziL 2 dφ [a,b]

Summary See the first thirtheen lines of Introduction and Theorem 1.I.      

What's in a name [embedded systems]

Hardware/software codesign grew out of system-level synthesis. ASICs offer performance advantages at the expense of post-design- time programmability. This contrasts with computer architecture, which focuses on support for a wide variety of end-use programming scenarios. Currently neither hardware synthesis nor hardware/software codesign describes the system-level design represented in CODES+ISSS. CODES were the name of the International Conference on Hardware/Software Codesign. ISSS was the name of the International Symposium on System Synthesis.     

Fluorescence quenching of benzo[k]fluoranthene in poly(vinyl alcohol) film: a possible optical sensor for nitro aromatic compounds

Benzo[k]fluoranthene (BkF) is a condensed multi-ring compounds with high fluorescence quantum yield and Stokes’ shift. Nitro aromatic compounds (NACs) are known to be good electron acceptors and quenchers. The fluorescence quenching of benzo[k]fluoranthene in poly(vinyl alcohol) film by different NACs, e.g. nitrobenzene, m-dinitrobenzene, o-nitrotoluene, m-nitrotoluene, p-nitrobromobenzene, o-nitroaniline, p-nitrophenol, etc. has been studied. The BkF film shows a strong quenching in the NACs concentration range from 1×10⁻⁴ to 1×10⁻³ M. The Stern–Volmer plots for NACs are found to be non-linear, but regular in this concentration range, which can be used for estimation of these compounds. The typical response time of the sensing film is found to be 2–10 s. The sensor film also shows minimal interference from different organic molecules and has good reversibility and reproducibility. The sensor gives a sensitivity of 1×10⁻⁵ M for p-nitrophenol.     

DBMS[me] [life-time records]

The article is concerned with time and the deluge of data that we can expect to collect and view. We examine this from the perspective of a subproblem, a database management system that records a person's life in its entirety - referred to here as DBMS[me] and E-me (that is, a database of me or an electronic model of me). Challenges for the DBMS[me] are to augment human memory by recording all data about an individual, to organize such data into models, and to develop security and privacy languages to control access to such models.     

Aim, fire [test-first coding]

The author argues that test-first coding is not testing. Test-first coding is not new. It is nearly as old as programming. It is an analysis technique. We decide what we are programming and what we are not programming, and we decide what answers we expect. Test-first is also a design technique     

(n+1)维空间Cn[a,b]上规范B基存在的充要条件

给出(n 1)维空间C^n[a,b]上规范B基存在的充要条件,并就摆线的规范B基的非退化表示进行讨论,得到了函数空间Pl＝span{l,t,cost,sint}中摆线的非退化规范B基表示．     

A ghost in a snowstorm [computer graphics]

There is a storm cloud growing on the horizon of the digital convergence between computer graphics and television/graphic arts. Computer graphics and image processing assume that pixel values are linearly related to light intensity. A typical video or paint image, however, encodes intensity nonlinearly. Most image manipulation software does not take this into account and just does arithmetic on the pixel values as though they were linearly related to light intensity. This is obviously wrong. The question is, how wrong, and for what pixel values is the problem worst and best? The author presents a review of the basic concepts     

Trends in measurement, estimation, and control [softwareengineering]

As an expert in quantitative aspects of software management, the author shares his view of where the industry is and where it is going. He identifies a few basic measures that have been used successfully in management and describes the direction that measurement is being driven by the pressure of total quality management     

[反思]

如果一种观点得到广泛认同,或者受到权威的支持,成为某种标准和规则,总之,如果传言变为"格言",各方就能够获得一个相对正确的博弈信息;同时,沟通大家的信息,促使合作的形成,让"非合作"变成"合作",让整体最佳选择成为各方的决策结果,这才是我们所希望的.     

[风潮]

信息化中那些为我们熟悉的现象,他们都是由于对信息化传言的不同理解而导致的博弈结果,这些结果可以对当事人各方有利,但是总体上来看,它们是损害社会和国家利益的,是最差结果,导致了不健康的社会风潮.