排序方式： 共有13条查询结果，搜索用时 15 毫秒
1.
Madhavan Mukund 《Resonance》2007,12(9):40-63
Functional programming has its roots in Alonzo Church’s lambda calculus. In the first part1 of this article, we explored some basic notions of functional programming using the language Haskell. We now examine some
more advanced concepts, including polymorphism, infinite data types and computations, and user-defined data types.
Madhavan Mukund has been on the Computer Science faculty at Chennai Mathematical Institute since 1992, where he is currently
Professor. His research interests are primarily in formal methods for specifying and verifying computing systems. He is the
Secretary of the Indian Association for Research in Computing Science (IARCS) and the National Coordinator of the Indian Computing
Olympiad. 相似文献
2.
3.
4.
5.
English DJ Upadhyaya MP Litrownik AJ Marshall JM Runyan DK Graham JC Dubowitz H 《Child abuse & neglect》2005,29(5):597-619
OBJECTIVE: The aim of this exploratory study was to examine the extent to which, in combination, the best constructions of basic dimensions of maltreatment, identified in other papers from LONGSCAN, predict child outcomes. METHOD: Maltreatment records of a sample of 203 children were used to define dimensions of maltreatment related to Type, Severity, Chronicity, and Age at First Report. The definitions were based upon findings presented in other papers in this special issue. Children's behavioral and emotional functioning was examined at age 8 using standardized measures of problem behaviors, socialization and adaptation, and trauma symptomatology. Backward elimination regression was used to screen for interactions among the dimensions; regression models including dimensions and significant interactions were then run for each child outcome. Stratified partial correlations were utilized to explicate significant interactions. RESULTS: Individual maltreatment dimensions were found to have distinct effects on child functioning. Additionally, dimensions of maltreatment were interrelated and interacted in determining outcomes. Type of maltreatment (as indicated by the maximum severity rating of each type) was the most consistent predictor across outcomes, albeit different types predicted different outcomes. Various dimensional interactions were significant predictors of different outcomes. CONCLUSION: The results suggest that a comprehensive assessment of a child's maltreatment experience, including type and severity, when the maltreatment began and the pattern of maltreatment across the life span, is important to understanding the effects of maltreatment on children's growth and development. 相似文献
6.
Madhavan Mukund 《Resonance》2007,12(8):27-48
Functional programming has roots in Alonzo Church’s lambda calculus. A functional program is a collection of functions that
work together to transform data. Though Lisp brought functional programming to public attention in the 1950s, it was John
Bacus’s 1977 Turing Award lecture criticizing the limitations of imperative programming languages that led to a resurgence
of of interest in this field. The 1970s and 1980s saw a number of advances, leading to the development of the language Haskell,
which carefully combined ideas from many earlier languages. In this article, we explore some basic notions of functional programming
via Haskell.
Madhavan Mukund has been on the Computer Science faculty at Chennai Mathematical Institute since 1992, where he is currently
Professor. His research interests are primarily in formal methods for specifying and verifying computing systems. He is the
Secretary of the Indian Association for Research in Computing Science (IARCS) and the National Coordinator of the Indian Computing
Olympiad. 相似文献
7.
Fatigue reliability analysis of fixed offshore structures： A first passage problem approach 总被引：1，自引：0，他引：1
MADHAVAN PILLAI T.M VEENA G. 《浙江大学学报(A卷英文版)》2006,7(11):1839-1845
INTRODUCTION Offshore production and drilling platforms are, in general, large and complex structural systems, usually fabricated using steel tubular members interconnected through welded joints. These structures are predomi- nantly subjected to oscillatory environmental loads and fatigue characterizes a primary mode of failure of their components. The fatigue damage at any point in the structure depends on the complete stress history during the structure’s service life. The calculation … 相似文献
8.
9.
S.V.Nageswara Rao S.Sitharama Iyengar C.E.Veni Madhavan 《Information processing & management》1985,21(5):433-442
A variety of data structures such as inverted file, multi-lists, quad tree, k-d tree, range tree, polygon tree, quintary tree, multidimensional tries, segment tree, doubly chained tree, the grid file, d-fold tree. super B-tree, Multiple Attribute Tree (MAT), etc. have been studied for multidimensional searching and related problems. Physical data base organization, which is an important application of multidimensional searching, is traditionally and mostly handled by employing inverted file. This study proposes MAT data structure for bibliographic file systems, by illustrating the superiority of MAT data structure over inverted file. Both the methods are compared in terms of preprocessing, storage and query costs. Worst-case complexity analysis of both the methods, for a partial match query, is carried out in two cases: (a) when directory resides in main memory, (b) when directory resides in secondary memory. In both cases, MAT data structure is shown to be more efficient than the inverted file method. Arguments are given to illustrate the superiority of MAT data structure in an average case also. An efficient adaptation of MAT data structure, that exploits the special features of MAT structure and bibliographic files, is proposed for bibliographic file systems. In this adaptation, suitable techniques for fixing and ranking of the attributes for MAT data structure are proposed. Conclusions and proposals for future research are presented. 相似文献
10.
Madhavan Mukund 《Resonance》2009,14(7):667-681
The ACM Turing Award for 2007 was awarded to Clarke, Emerson and Sifakis for their invention of model-checking, an automated
technique for verifying finite-state computing systems. In this article, we describe the central ideas underlying their approach. 相似文献