Báo cáo toán học: "A simple Havel–Hakimi type algorithm to realize graphical degree sequences of directed graphs" ppsx
Báo cáo khoa học: A simple in vivo assay for measuring the efficiency of gene length-dependent processes in yeast mRNA biogenesis doc
... 769 A simple in vivo assay for measuring the efficiency of gene length-dependent processes in yeast mRNA biogenesis Macarena Morillo-Huesca, Manuela Vanti and Sebastia´n Cha´vezDepartamento ... (2001) Mutations in the TATA-binding pro-tein, affecting transcriptional activation, showsynthetic lethality with the TAF145 gene lacking the TAF N-terminal domain in Saccharomyces cerevisiae.J ... GAL1pr::PHO5-LAC4 for the following assays. The mRNA ratios cal-culated for these two transcription units in the spt4Dstrain and in the isogenic wild type confirmed again the validity of the GLAM ratio to...
- 14
- 435
- 0
Báo cáo khoa học: A simple protocol to study blue copper proteins by NMR pot
... important tool to study paramagnetic proteins Plastocyanin is a good model system to address features ofparamagnetic copper proteins in terms of assignmentstrategy. Indeed, the previously available ... requi-ring a specific expertise in the field. The resulting 3D spectraare standard spectra that can be handled by any standardsoftware for protein NMR data analysis.Keywords: blue copper proteins; NMR ... will demonstrate that an approachwhich does not require any hardware or software dedicated to paramagnetic systems can substantially improve theavailable assignments close to the copper (II)...
- 10
- 573
- 0
Báo cáo khoa học: "A Simple Measure to Assess Non-response" docx
... respond-ing to some. The same reasoning is applicable to loga092de compared to base092de for German.5 Related WorkThe decision of leaving a query without response isrelated to the system ability to measure ... also to study the number of times systems aredeemed to be equivalent with respect to a certain measure, which reflects the discrimination power ofthat measure. The less discriminative the measure is, ... success of this measure for evaluating QA systems in favor, again,of accuracy measure. Accuracy is the simplest and most intuitive evalu-ation measure. At the same time is able to rewardthose...
- 10
- 349
- 0
Báo cáo toán học: "A simple unital projectionless C*-algebra " ppsx
... class="bi x0 y0 w1 h 1" alt ="" ...
- 9
- 306
- 0
Báo cáo toán học: "A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16" pptx
... 1996AbstractA method for constructing cubic graphs with girths in the range 13 to 16 is described. The method is used to construct the smallest known cubic graphs for girths 14, 15 and 16.IntroductionWe ... JournalofGraphTheory,6, 1982, 1-22. A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16Geoffrey ExooDepartment of Mathematics and Computer ScienceIndiana State UniversityTerre ... requirement thatT be a tree, and also considered cubic forests. And we tried replacing the single values of hiby sets of values (we tried sets of size two). Neither of these modifications produced...
- 3
- 374
- 0
Báo cáo toán học: "A simple algorithm for constructing Szemer´di’s Regularity Partition e" pps
... A simple algorithm for constructing Szemer´edi’s Regularity Partition Alan FriezeDepartment of Mathematical Sciences,Carnegie ... combinatorics 6 (1999), #R17 3A partition satisfying the second criterion is called equitable. V0is called theexceptional class.Following [9], for every equitable partition P into k +1classes ... (ˆx+)TWˆy−≥ ˆγ√pq/4. (The proof for the other cases is similar.) We define random subsets S, T as follows: For each i ∈ R, put i in S with probability ˆx+i√p/β. For each j ∈ C,putj in T with...
- 7
- 340
- 0
Báo cáo toán học: "A simple card guessing game revisited" docx
... considered the following simple combinatorial game; [5, 3, 7, 6].One starts with a deck of cards consisting of m red and n black cards. A guess is made asto the colour of the top card, after which ... − 1), 0 ≤ n<m,the electronic journal of combinatorics 8 (no. 2) (2001), #R13 7 A simple card guessing game revisitedArnold KnopfmacherThe John Knopfmacher Centre for Applicable Analysis ... 3, 2000.AbstractA deck of cards consisting of m red and n black cards is given. A guess ismade as to the colour of the top card, after which it is revealed and discarded. Tomaximise the number...
- 9
- 272
- 0
Báo cáo toán học: "On edge colorings with at least q colors in every subset of p vertices" ppsx
... behavior of f(n, p, q) between the linear and quadratic orders of magnitude, so for q lin≤ q ≤ q quad. In particular we show that that we can have at mostlog p values of q which give a linear ... denotes the parity of the naturalnumber n,soitis1ifn is odd and 0 otherwise.1.2 Edge colorings with at least q colors in every subset of p verticesThe following interesting concepts were created ... journal of combinatorics 8 (2001), #R9 2 On edge colorings with at least q colors in every subset of p verticesGabor N. Sarkăozy, Stanley SelkowComputer Science DepartmentWorcester Polytechnic InstituteWorcester,...
- 6
- 223
- 0
Báo cáo toán học: "A simple proof for the existence of exponentially balanced Gray codes" ppsx
... is the number of times the integer i occurs in the sequence T . Note that the sum of all b(i), 1 ≤ i ≤ n,isequaltol, the length of T .3 A simple proof for the existence of exponentially balanced ... two, or are two successive powers of two. A proof for the existence of exponentially balanced Gray codes is derived. The proof is much sim-pler than an earlier proof presented by van Zanten and ... A simple proof for the existence of exponentially balanced Gray codesI Nengah Suparta∗Department of Applied MathematicsFaculty of Electrical Engineering, Mathematics and Computer...
- 5
- 426
- 0
Báo cáo toán học: "A Simple Proof of the Aztec Diamond Theorem" potx
... 1986. the electronic journal of combinatorics 12 (2005), #R18 8 Theorem 2.3 (Aztec diamond theorem) The number of domino tilings of the Aztec diamond of order n is 2n(n+1)/2.Remark: The proof of ... between domino tilings of an Aztec diamond and non-intersecting lattice paths, a simple proof of the Aztec diamond theorem is given bymeans of Hankel determinants of the large and small Schrăoder ... A domino tiling of a region R is a set of non-overlapping dominoes the union of which is R. Figure 1 shows the Aztec diamond of order 3 and a domino tiling. The Aztec diamond theorem, first proved...
- 8
- 408
- 0
Báo cáo toán học: "A note on exponents vs root heights for complex simple Lie algebras" pot
... Macdonald-Cherednik theory). For completeness sake, we first quickly recall [2] how one can use proposition 1 todeduce the classical fact concerning exponents and heights of roots.Let P denote ... form on the dual ofthe Cartan subalgebra and let sj∈ W (j = 1 · · · n) be the simple reflection correpondingto αj.We will prove proposition 1 by induction on ht β. If ht β = 1, β is a simple ... finite dimensional simple Lie algebra g, the partition formed by listing its exponents in descending order is dual to thepartition formed by the numbers of positive roots at each height (see...
- 5
- 216
- 0
Báo cáo toán học: "A Colorful Involution for the Generating Function for Signed Stirling Numbers of the First Kind" pps
... Beissinger, who was the first to explore [1]combinatorial proofs using colored permutations, for their assistance.References[1] Janet Beissinger. Colorful proofs of generating function identities. ... follows for (π, f ) ∈ Sn,A: If R(π,f)= ∅, let φ((π, f)) = (π, f).Otherwise, let (i, j) ∈ R(π,f)be minimal under the lexicographic ordering of R(π,f). Let˜π = (i, j) ◦ π, the product of the ... of CambridgeStudies in Advanced Mathematics. Cambridge University Press, Cambridge, 1997.With a foreword by Gian-Carlo Rota, Corrected reprint of the 1986 original. the electronic journal of...
- 2
- 262
- 0
Báo cáo toán học: "A simple bijection between binary trees and colored ternary trees" pot
... we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalannumbers.Keywords: Binary tree; Ternary tree; Generalized ... bijection between for ests of colored ternary trees and forests of complete binary trees. Note that there are totally m + 3p vertices in a forest F of complete ternary trees with m components and p ... + 1n. (1.1)In this short note, we first present a simple bijection between complete binary trees and colored complete ternary trees and then derive the following generalized identity,[n/2]p=0m3p...
- 5
- 261
- 0
Báo cáo toán học: "A simple Havel–Hakimi type algorithm to realize graphical degree sequences of directed graphs" ppsx
... transformsG1intoG2and its length is at most d + 2(e − d) + d = 2e.the electronic journal of combinatorics 17 (2010), #R66 7 A simple Havel–Hakimi type algorithm to realize graphical degree sequences ... realizability of a set of integers as degrees of the vertices of a simple g r aph. J. SIAM Appl. Math. 10 (1 962), 496–506.[7] S.L. Hakimi: On the degrees of the vertices of a directed graph, ... only sequences of strictly positive integer BD S’s, that is each degree is 0 and d+j+ d−j> 0, to avoid isolated points.Our goal is to prove a Havel–Hakimi type algorithm to realize...
- 10
- 262
- 0
Báo cáo toán học: "A Combinatorial Formula for Orthogonal Idempotents in the 0-Hecke Algebra of the Symmetric Group" potx
... if i = N,πiif i = N. the electronic journal of combinatorics 18 (2011), #P28 15 A Combinatorial Formula for Orthogonal Idempotents in the 0-Hecke Algebra of the Symmetric GroupTom DentonSubmitted: ... automorphism of the un-derlying graph of a Dynkin diagram induces an auto morphism of the Hecke algebra. For the Dynkin diagram of SN, there is exactly one non-trivial auto morphism, sending the node ... are indexed by a subset J ⊂ I, retaining the original relations. The Dynkin diagram of the cor r esponding object is obtained by deleting the relevant nodesand connecting edges from the original...
- 20
- 306
- 0
Từ khóa: các báo cáo toán học haybáo cáo toán học haybáo cáo khoa học toán họcbáo cáo khoa họcbáo cáo y họcbáo cáo môn họcNghiên cứu sự biến đổi một số cytokin ở bệnh nhân xơ cứng bì hệ thốngNghiên cứu sự hình thành lớp bảo vệ và khả năng chống ăn mòn của thép bền thời tiết trong điều kiện khí hậu nhiệt đới việt namMột số giải pháp nâng cao chất lượng streaming thích ứng video trên nền giao thức HTTPNghiên cứu vật liệu biến hóa (metamaterials) hấp thụ sóng điện tử ở vùng tần số THzBiện pháp quản lý hoạt động dạy hát xoan trong trường trung học cơ sở huyện lâm thao, phú thọGiáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôitPhối hợp giữa phòng văn hóa và thông tin với phòng giáo dục và đào tạo trong việc tuyên truyền, giáo dục, vận động xây dựng nông thôn mới huyện thanh thủy, tỉnh phú thọPhát triển mạng lưới kinh doanh nước sạch tại công ty TNHH một thành viên kinh doanh nước sạch quảng ninhTrả hồ sơ điều tra bổ sung đối với các tội xâm phạm sở hữu có tính chất chiếm đoạt theo pháp luật Tố tụng hình sự Việt Nam từ thực tiễn thành phố Hồ Chí Minh (Luận văn thạc sĩ)Phát triển du lịch bền vững trên cơ sở bảo vệ môi trường tự nhiên vịnh hạ longNghiên cứu về mô hình thống kê học sâu và ứng dụng trong nhận dạng chữ viết tay hạn chếNghiên cứu khả năng đo năng lượng điện bằng hệ thu thập dữ liệu 16 kênh DEWE 5000Định tội danh từ thực tiễn huyện Cần Giuộc, tỉnh Long An (Luận văn thạc sĩ)Kiểm sát việc giải quyết tố giác, tin báo về tội phạm và kiến nghị khởi tố theo pháp luật tố tụng hình sự Việt Nam từ thực tiễn tỉnh Bình Định (Luận văn thạc sĩ)BT Tieng anh 6 UNIT 2Giáo án Sinh học 11 bài 15: Tiêu hóa ở động vậtGiáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vậtBÀI HOÀN CHỈNH TỔNG QUAN VỀ MẠNG XÃ HỘITÁI CHẾ NHỰA VÀ QUẢN LÝ CHẤT THẢI Ở HOA KỲQUẢN LÝ VÀ TÁI CHẾ NHỰA Ở HOA KỲ