These are representative sample records from Science.gov related to your search topic.
For comprehensive and current results, perform a real-time search at Science.gov.
1

Ein Bild hielt uns gefangen: The Da Vinci Code and the Humanae Vitae  

Microsoft Academic Search

This article analyses the understanding of sexuality and women in Dan Brown’s The Da Vinci Code and compares it with the one offered by the Catholic encyclical Humanae Vitae. It does so against the background of the four dimensions of the real as advocated by Todorov and others. The first part\\u000a of the article analyses how, and explains why, by

Daniel Candel Bormann

2007-01-01

2

Media Images Abbott and Costello Meet the End of the World: Who Is the Enemy in "The Da Vinci Code" and "An Inconvenient Truth?"  

ERIC Educational Resources Information Center

Popular culture requires readily identifiable villains. Subcultural groups often serve this role, creating controversies. Controversies based on religion are especially bitter. As a rule, religion in the movies is inoffensively sentimental, but "The Da Vinci Code" is both popular and provocative, treading on the dangerous ground of Jesus's…

Beck, Bernard

2007-01-01

3

Leonardo da Vinci's Geometric Sketches  

NSDL National Science Digital Library

How do you solve a problem like solids, mathematically speaking? Well, you could use this rather fascinating resource provided by the Convergence magazine. Offered as an educational resource by the Mathematical Association of America (MAA), this particular resource brings together the work of the Franciscan friar Luca Pacioli (c.1445-1509) and the geometric sketches of Leonardo Da Vinci. Both men were interested in geometry, and this piece offers up a number of plate facsimiles of illustrations created by Da Vinci. Here visitors will find an introduction to this educational resource, along with illustrations of cubes, octahedrons, and cylinders. The accompanying article was written by Frank J. Swetz, and it is easy to see how these materials could be incorporated into a classroom discussion about the history of mathematics.

4

Leonardo da Vinci's Geometric Sketches  

NSDL National Science Digital Library

How do you solve a problem like solids, mathematically speaking? Well, you could use this rather fascinating resource provided by the Convergence magazine. Offered as an educational resource by the Mathematical Association of America (MAA), this particular resource brings together the work of the Franciscan friar Luca Pacioli (c.1445-1509) and the geometric sketches of Leonardo Da Vinci. Both men were interested in geometry, and this piece offers up a number of plate facsimiles of illustrations created by Da Vinci. Here visitors will find an introduction to this educational resource, along with illustrations of cubes, octahedrons, and cylinders. The accompanying article was written by Frank J. Swetz, and it is easy to see how these materials could be incorporated into a classroom discussion about the history of mathematics.

2008-09-15

5

How to Think Like Leonardo da Vinci  

ERIC Educational Resources Information Center

To be effective and relevant in twenty-first-century learning, art needs to be more inclusive. In this article, the author discusses how teachers can find a good example in Leonardo da Vinci for building an art program. His art, design, and curiosity are the perfect foundation for any art program, at any level. (Contains 3 resources and 3 online…

Caouette, Ralph

2008-01-01

6

[Prostate cancer treatment by da Vinci surgery].  

PubMed

Minimally invasive laparoscopic surgery replaces many open surgery procedures in urology due to its advantages concerning post-operative morbidity. However, the technical challenges and need of learning have limited the application of this method to the work of highly qualified surgeons. The introduction of da Vinci surgical system has offered important technical advantages compared to the laparoscopic surgical procedure. Robot-assisted radical prostatectomy became a largely accepted procedure. It has paved the way for urologists to start other, more complex operations, decreasing this way the operative morbidity. The purpose of this article is to overview the history of robotic surgery, its current and future states in the treatment of the cancer. We present our robot-assisted radical prostatectomy and the results. PMID:25260081

Szabó, Ferenc János; Alexander, de la Taille

2014-09-26

7

Tree Branching: Leonardo da Vinci's Rule versus Biomechanical Models  

PubMed Central

This study examined Leonardo da Vinci's rule (i.e., the sum of the cross-sectional area of all tree branches above a branching point at any height is equal to the cross-sectional area of the trunk or the branch immediately below the branching point) using simulations based on two biomechanical models: the uniform stress and elastic similarity models. Model calculations of the daughter/mother ratio (i.e., the ratio of the total cross-sectional area of the daughter branches to the cross-sectional area of the mother branch at the branching point) showed that both biomechanical models agreed with da Vinci's rule when the branching angles of daughter branches and the weights of lateral daughter branches were small; however, the models deviated from da Vinci's rule as the weights and/or the branching angles of lateral daughter branches increased. The calculated values of the two models were largely similar but differed in some ways. Field measurements of Fagus crenata and Abies homolepis also fit this trend, wherein models deviated from da Vinci's rule with increasing relative weights of lateral daughter branches. However, this deviation was small for a branching pattern in nature, where empirical measurements were taken under realistic measurement conditions; thus, da Vinci's rule did not critically contradict the biomechanical models in the case of real branching patterns, though the model calculations described the contradiction between da Vinci's rule and the biomechanical models. The field data for Fagus crenata fit the uniform stress model best, indicating that stress uniformity is the key constraint of branch morphology in Fagus crenata rather than elastic similarity or da Vinci's rule. On the other hand, mechanical constraints are not necessarily significant in the morphology of Abies homolepis branches, depending on the number of daughter branches. Rather, these branches were often in agreement with da Vinci's rule. PMID:24714065

Minamino, Ryoko; Tateno, Masaki

2014-01-01

8

DA VINCI X-PRIZE SPACE PROJECT - MISSION ANALYSIS  

Microsoft Academic Search

In the present article we review engineering and research efforts conducted by a group of volunteers with the help of advanced engineering commercial software (CFD-ACE+, ANSYS, CFD-FASTRAN, Matlab\\/Simulink, Autodesk Inventor, Maple) in support of the da Vinci Project, the first Canadian competitor in the International X Prize Competition. The da Vinci Project has an objective of launching the first commercial

Vladimir Kudriavtsev; Brian Feeney; Max Buneta; James Porcher; Asier Ania; Michael Trauttmansdorff; Ta-Liang Hsu; Marek Krzeminski; Kalman Rooz

9

Leonardo da Vinci (1452-1519)  

Microsoft Academic Search

Painter, inventor and polymath, born in Vinci (near Empolia), Italy. Although astronomy does not figure large in Leonardo's works, he realized the possibility of constructing a telescope (`making glasses to see the Moon enlarged'). He suggested that `... in order to observe the nature of the planets, open the roof and bring the image of a single planet onto the

P. Murdin

2000-01-01

10

The Potential da Vinci in All of Us  

NSDL National Science Digital Library

The study of the human form is fundamental to both science and art curricula. For vertebrates, perhaps no feature is more important than the skeleton to determine observable form and function. As Leonard da Vinci's famous Proportions of the Human Figure (Virtruvian Man) illustrates, the size, shape, and proportions of the human body are defined by bones and their articulations. In this unit that focuses on the human skeleton, students are introduced to these concepts by asking them both to study da Vinci's drawing and build their own model of the human skeleton. Units on animal camouflage and architecture are also presented to further support the art and science connection.

Petto, Andrew; Petto, Sarah

2009-02-01

11

Women and Technical Professions. Leonardo da Vinci Series: Good Practices.  

ERIC Educational Resources Information Center

This document profiles programs for women in technical professions that are offered through the European Commission's Leonardo da Vinci program. The following programs are profiled: (1) Artemis and Diana (vocational guidance programs to help direct girls toward technology-related careers); (2) CEEWIT (an Internet-based information and…

Commission of the European Communities, Brussels (Belgium). Directorate-General for Education and Culture.

12

Training and Health. Leonardo da Vinci Series: Good Practices.  

ERIC Educational Resources Information Center

This document profiles programs in the fields of health and medicine that are offered through the European Commission's Leonardo da Vinci program. The following programs are profiled: (1) CYTOTRAIN (a transnational vocational training program in cervical cancer screening); (2) Apollo (a program of open and distance learning for paramedical…

Commission of the European Communities, Brussels (Belgium). Directorate-General for Education and Culture.

13

The Potential da Vinci in All of Us  

ERIC Educational Resources Information Center

The study of the human form is fundamental to both science and art curricula. For vertebrates, perhaps no feature is more important than the skeleton to determine observable form and function. As Leonard da Vinci's famous Proportions of the Human Figure (Virtruvian Man) illustrates, the size, shape, and proportions of the human body are defined by…

Petto, Sarah; Petto, Andrew

2009-01-01

14

DaVinci's Mona Lisa entering the next dimension.  

PubMed

For several of Leonardo da Vinci's paintings, such as The Virgin and Child with St Anne or the Mona Lisa, there exist copies produced by his own studio. In case of the Mona Lisa, a quite exceptional, rediscovered studio copy was presented to the public in 2012 by the Prado Museum in Madrid. Not only does it mirror its famous counterpart superficially; it also features the very same corrections to the lower layers, which indicates that da Vinci and the 'copyist' must have elaborated their panels simultaneously. On the basis of subjective (thirty-two participants estimated painter-model constellations) as well as objective data (analysis of trajectories between landmarks of both paintings), we revealed that both versions differ slightly in perspective. We reconstructed the original studio setting and found evidence that the disparity between both paintings mimics human binocular disparity. This points to the possibility that the two Giocondas together might represent the first stereoscopic image in world history. PMID:24303752

Carbon, Claus-Christian; Hesslinger, Vera M

2013-01-01

15

Cutaneous Feedback of Planar Fingertip Deformation and Vibration on a da Vinci Surgical Robot  

E-print Network

to the surgeon, our system is composed of a BioTac tactile sensor mounted to one of the robot's slave tools to a da Vinci tool, and a cutaneous device is attached to the robot's corresponding master controllerCutaneous Feedback of Planar Fingertip Deformation and Vibration on a da Vinci Surgical Robot

Siena, Università di

16

A Creative Approach to the Common Core Standards: The Da Vinci Curriculum  

ERIC Educational Resources Information Center

"A Creative Approach to the Common Core Standards: The Da Vinci Curriculum" challenges educators to design programs that boldly embrace the Common Core State Standards by imaginatively drawing from the genius of great men and women such as Leonardo da Vinci. A central figure in the High Renaissance, Leonardo made extraordinary contributions as a…

Chaucer, Harry

2012-01-01

17

Robotic laparoscopic surgery: a comparison of the da Vinci and Zeus systems  

Microsoft Academic Search

Objectives. To evaluate two currently available robotic surgical systems in performing various urologic laparoscopic procedures in an acute porcine model.Methods. Robotic laparoscopic surgery was performed in 14 swine. Data were compared between the da Vinci Robotic System and the Zeus Robotic System.Results. During laparoscopic nephrectomy, the da Vinci System (n = 6) had a significantly shorter total operating room time

Gyung Tak Sung; Inderbir S Gill

2001-01-01

18

Leonardo da Vinci and the Art of Sculpture  

NSDL National Science Digital Library

This website from the Getty Museum accompanies the exhibition "Leonardo da Vinci and the Art of Sculpture: Inspiration and Invention", organized by the High Museum of Art, Atlanta, and on display in Los Angeles until June 20th, 2010. The website features a slide show with images of 11 works of art, some by Leonardo and some by other artists, including older artists who influenced Leonardo and his followers. An image of Donatello's Bearded Prophet, 1418-20, is accompanied by audio discussing Donatello's impact on Leonardo, while the last three slides examine the master/pupil relationship between Leonardo and a younger artist, Giovanni Francesco Rustici, 1475-1554. Visitors to the site can also listen to an introduction to the exhibition that lays out its overall intent from co-curator Julian Brooks.

19

Transparency of Vocational Qualifications: The Leonardo da Vinci Approach. CEDEFOP Panorama Series.  

ERIC Educational Resources Information Center

This report gives an overview of the situation of transparency of vocational qualifications by presenting measures introduced at the European Community level and by drawing attention to projects within the Leonardo da Vinci Program dealing with the issue. A 16-page executive summary appears first. Chapter 1 provides general background and aims.…

Bjornavold, Jens; Pettersson, Sten

20

Leonardo da Vinci, One Year on...a Different Look at Vocational Training in Europe.  

ERIC Educational Resources Information Center

Discusses the success of the Leonardo da Vinci program, a European laboratory of innovation in vocational training, a priority focus of investment in human resources and intelligence, and a way to mobilize innovative forces beyond national boundaries. Trends identified by the program focus on new information and communication technologies. (JOW)

Le Magazine, 1996

1996-01-01

21

DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet  

E-print Network

, such as an enterprise network, a Virtual Private Network (VPNs), or an Internet Service Provider (ISP), and ultimatelyDaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang, jrex, chiangm}@princeton.edu ABSTRACT Running multiple virtual networks, customized for different

Singh, Jaswinder Pal

22

Amplatzer Closure of Atrial Septal Defect and da Vinci Robot-Assisted Repair of Vascular Ring  

Microsoft Academic Search

Technology for minimally invasive approaches to congenital heart disease is a rapidly evolving field. This case report reviews a novel approach to combining two of the newer technologies available to treat a pediatric patient with an atrial septal defect (ASD) and a vascular ring. This report is the first to describe the use of the da Vinci surgical system to

R. G. Ohye; E. J. Devaney; J. Graziano; A. Ludomirsky

2004-01-01

23

The handedness of Leonardo da Vinci: A tale of the complexities of lateralisation  

Microsoft Academic Search

The handedness of Leonardo da Vinci is controversial. Although there is little doubt that many of his well-attributed drawings were drawn with the left hand, the hatch marks of the shading going downwards from left to right, it is not clear that he was a natural left-hander, there being some suggestion that he may have become left-handed as the result

I. C. McManus; Helena Drury

2004-01-01

24

The Handedness of Leonardo da Vinci: A Tale of the Complexities of Lateralisation  

ERIC Educational Resources Information Center

The handedness of Leonardo da Vinci is controversial. Although there is little doubt that many of his well-attributed drawings were drawn with the left hand, the hatch marks of the shading going downwards from left to right, it is not clear that he was a natural left-hander, there being some suggestion that he may have become left-handed as the…

McManus, I. C.; Drury, Helena

2004-01-01

25

The Design of Intelligent Monitoring System Based on DaVinci Platform  

Microsoft Academic Search

In this paper, an embedded video monitoring system for intelligent control is presented. This presented system uses DaVinci-based high-speed TMS320DM6467 chip as hardware component and uses Embedded Linux Operating System as software component, in addition, it takes target detection and tracking algorithms as its core. So it can not only meet the requirements of real-time video processing and heavy computation

Pan Zhao; Zhi liang Jiang

2012-01-01

26

The SEP "robot": a valid virtual reality robotic simulator for the Da Vinci Surgical System?  

PubMed

The aim of the study was to determine if the concept of face and construct validity may apply to the SurgicalSim Educational Platform (SEP) "robot" simulator. The SEP robot simulator is a virtual reality (VR) simulator aiming to train users on the Da Vinci Surgical System. To determine the SEP's face validity, two questionnaires were constructed. First, a questionnaire was sent to users of the Da Vinci system (reference group) to determine a focused user-group opinion and their recommendations concerning VR-based training applications for robotic surgery. Next, clinical specialists were requested to complete a pre-tested face validity questionnaire after performing a suturing task on the SEP robot simulator. To determine the SEP's construct validity, outcome parameters of the suturing task were compared, for example, relative to participants' endoscopic experience. Correlations between endoscopic experience and outcome parameters of the performed suturing task were tested for significance. On an ordinal five-point, scale the average score for the quality of the simulator software was 3.4; for its hardware, 3.0. Over 80% agreed that it is important to train surgeons and surgical trainees to use the Da Vinci. There was a significant but marginal difference in tool tip trajectory (p = 0.050) and a nonsignificant difference in total procedure time (p = 0.138) in favor of the experienced group. In conclusion, the results of this study reflect a uniform positive opinion using VR training in robotic surgery. Concepts of face and construct validity of the SEP robotic simulator are present; however, these are not strong and need to be improved before implementation of the SEP robotic simulator in its present state for a validated training curriculum to be successful . PMID:20437345

van der Meijden, O A J; Broeders, I A M J; Schijven, M P

2010-04-01

27

Educating in the Design and Construction of Built Environments Accessible to Disabled People: The Leonardo da Vinci AWARD Project  

ERIC Educational Resources Information Center

An interdisciplinary partnership within an European Leonardo da Vinci project has developed a new approach aimed at educating secondary school students in the creation of built environments accessible to disabled people and at sensitizing them towards the inclusion of people with disabilities in all realms of social life. The AWARD (Accessible…

Frattari, Antonio; Dalpra, Michela; Bernardi, Fabio

2013-01-01

28

Virtual Mobility in Reality: A Study of the Use of ICT in Finnish Leonardo da Vinci Mobility Projects.  

ERIC Educational Resources Information Center

An e-mail survey and interviews collected data on use of information and communications technology (ICT) in Finnish Leonardo da Vinci mobility projects from 2000-02. Findings showed that the most common ICT tools used were e-mail, digital tools, and the World Wide Web; ICT was used during all project phases; the most common problems concerned…

Valjus, Sonja

29

da Vinci fluids, catch-up dynamics and dense granular flow.  

PubMed

We introduce and study a da Vinci fluid, a fluid whose dissipation is dominated by solid friction. We analyse the flow rheology of a discrete model and then coarse-grain it to the continuum. We find that the model gives rise to behaviour that is characteristic of dense granular fluids. In particular, it leads to plug flow. We analyse the nucleation mechanism of plugs and their development. We find that plug boundaries generically expand and we calculate the growth rate of plug regions. In systems whose internal effective dynamic and static friction coefficients are relatively uniform we find that the linear size of plug regions grows as (time)¹(/)³ . The suitability of the model to granular materials is discussed. PMID:20668906

Blumenfeld, R; Edwards, S F; Schwartz, M

2010-08-01

30

Successful treatment of esophageal metastasis from hepatocellular carcinoma using the da Vinci robotic surgical system.  

PubMed

A 59-year-old man with metastatic an esophageal tumor from hepatocellular carcinoma (HCC) presented with progressive dysphagia. He had undergone liver transplantation for HCC three and a half years prevously. At presentation, his radiological and endoscopic examinations suggested a submucosal tumor in the lower esophagus, causing a luminal stricture. We performed complete resection of the esophageal metastases and esophagogastrostomy reconstruction using the da Vinci robotic system. Recovery was uneventful and he was been doing well 2 mo after surgery. ?-fetoprotein level decreased from 510 ng/mL to 30 ng/mL postoperatively. During the follow-up period, he developed a recurrent esophageal stricture at the anastomosis site and this was successfully treated by endoscopic esophageal dilatation. PMID:21765971

Boonnuch, Wiroon; Akaraviputh, Thawatchai; Nino, Carnivale; Yiengpruksawan, Anusak; Christiano, Arthur Andrew

2011-06-27

31

The proportion of the face in younger adults using the thumb rule of Leonardo da Vinci.  

PubMed

The present study was conducted to examine whether the thumb rule of Leonardo da Vinci could be an objective method in the determination of the natural and artistic proportions of human face. In this study, a sample of 400 subjects (200 male and 200 female, 22-25 years old) was used. Measurements were made of the length of thumb, the length of ear, the approximate distances between the hair line and the glabella or eyebrows, between the glabella or eyebrows and the tip of the nose and the distance between the nose and the chin, and the distance between the ear and the lateral aspect of the eye. The results obtained in the males and females showed significant (p < 0.01) correlations between the length of thumb and the proportions of the face examined in the study. Additionally, the height of the face was found to be almost three times the length of the thumb. However, the measurements obtained from female subjects were on average smaller than those taken from males. The results obtained in this experiment could be of value in understanding of the evaluation of the face for the people working in plastic surgery or art. PMID:8782316

Oguz, O

1996-01-01

32

Realization and optimization of AES algorithm on the TMS320DM6446 based on DaVinci technology  

NASA Astrophysics Data System (ADS)

The application of AES algorithm in the digital cinema system avoids video data to be illegal theft or malicious tampering, and solves its security problems. At the same time, in order to meet the requirements of the real-time, scene and transparent encryption of high-speed data streams of audio and video in the information security field, through the in-depth analysis of AES algorithm principle, based on the hardware platform of TMS320DM6446, with the software framework structure of DaVinci, this paper proposes the specific realization methods of AES algorithm in digital video system and its optimization solutions. The test results show digital movies encrypted by AES128 can not play normally, which ensures the security of digital movies. Through the comparison of the performance of AES128 algorithm before optimization and after, the correctness and validity of improved algorithm is verified.

Jia, Wen-bin; Xiao, Fu-hai

2013-03-01

33

The oldest anatomical handmade skull of the world c. 1508: 'the ugliness of growing old' attributed to Leonardo da Vinci.  

PubMed

The author discusses a previously unknown early sixteenth-century renaissance handmade anatomical miniature skull. The small, naturalistic skull made from an agate (calcedonia) stone mixture (mistioni) shows remarkable osteologic details. Dr. Saban was the first to link the skull to Leonardo. The three-dimensional perspective of and the search for the senso comune are discussed. Anatomical errors both in the drawings of Leonardo and this skull are presented. The article ends with the issue of physiognomy, his grotesque faces, the Perspective Communis and his experimenting c. 1508 with the stone mixture and the human skull. Evidence, including the Italian scale based on Crazie and Braccia, chemical analysis leading to a mine in Volterra and Leonardo's search for the soul in the skull are presented. Written references in the inventory of Salai (1524), the inventory of the Villa Riposo (Raffaello Borghini 1584) and Don Ambrogio Mazenta (1635) are reviewed. The author attributes the skull c. 1508 to Leonardo da Vinci. PMID:24853982

Missinne, Stefaan J

2014-06-01

34

Michelangelo in Florence, Leonardo in Vinci.  

ERIC Educational Resources Information Center

Provides background information on the lives and works of Michelangelo and Leonardo da Vinci. Focuses on the artwork of the artists and the museums where their work is displayed. Includes museum photographs of their work. (CMK)

Herberholz, Barbara

2003-01-01

35

The mother relationship and artistic inhibition in the lives of Leonardo da Vinci and Erik H. Erikson.  

PubMed

In four earlier articles, I focused on the theme of the relationship of melancholia and the mother, and suggested that the melancholic self may experience humor (Capps, 2007a), play (Capps, 2007b), dreams (Capps, 2008a), and art (Capps, 2008b) as restorative resources. I argued that Erik H. Erikson found these resources to be valuable remedies for his own melancholic condition, which had its origins in the fact that he was illegitimate and was raised solely by his mother until he was three years old, when she remarried. In this article, I focus on two themes in Freud's Leonardo da Vinci and a memory of his childhood (1964): Leonardo's relationship with his mother in early childhood and his inhibitions as an artist. I relate these two themes to Erikson's own early childhood and his failure to achieve his goal as an aspiring artist in his early twenties. The article concludes with a discussion of Erikson's frustrated aspirations to become an artist and his emphasis, in his psychoanalytic work, on children's play. PMID:19093682

Capps, Donald

2008-12-01

36

Early experience with the da Vinci® surgical system robot in gynecological surgery at King Abdulaziz University Hospital  

PubMed Central

Background: The purpose of this study was to review our experience and the challenges of using the da Vinci® surgical system robot during gynecological surgery at King Abdulaziz University Hospital. Methods: A retrospective study was conducted to review all cases of robot-assisted gynecologic surgery performed at our institution between January 2008 and December 2010. The patients were reviewed for indications, complications, length of hospital stay, and conversion rate, as well as console and docking times. Results: Over the three-year period, we operated on 35 patients with benign or malignant conditions using the robot for a total of 62 surgical procedures. The docking times averaged seven minutes. The mean console times for simple hysterectomy, bilateral salpingo-oophorectomy, and bilateral pelvic lymphadenectomy were 125, 47, and 62 minutes, respectively. In four patients, laparoscopic procedures were converted to open procedures, giving a conversion rate of 6.5%. All of the conversions were among the first 15 procedures performed. The average hospital stay was 3 days. Complications occurred in five patients (14%), and none were directly related to the robotic system. Conclusion: Our early experience with the robot show that with proper training of the robotic team, technical difficulty with the robotic system is limited. There is definitely a learning curve that requires performance of gynecological surgical procedures using the robot. PMID:21845067

Sait, Khalid H

2011-01-01

37

Peri-operative comparison between daVinci-assisted radical prostatectomy and open radical prostatectomy in obese patients  

NASA Astrophysics Data System (ADS)

Introduction: While the effects of increasing body mass index on prostate cancer epidemiology and surgical approach have recently been studied, its effects on surgical outcomes are less clear. We studied the perioperative outcomes of obese (BMI >= 30) men treated with daVinci-assisted laparoscopic radical prostatectomy (DLP) and compared them to those treated with open radical retropubic prostatectomy (RRP) in a contemporary time frame. Method: After Institutional Review Board approval, we used the Mayo Clinic Radical Prostatectomy database to identify patients who had undergone DLP by a single surgeon and those who had undergone open RRP by a single surgeon between December 2002 and March 2005. Baseline demographics, peri- and post-operative courses, and complications were collected by retrospective chart review, and variables from the two cohorts compared using chi-square method and least-squares method of linear regression where appropriate. Results: 59 patients who had DLP and 76 undergoing RRP were available for study. Baseline demographics were not statistically different between the two cohorts. Although DLP had a significantly lower clinical stage than RRP (p=0.02), pathological stage was not statistically different (p=0.10). Transfusion rates, hospital stay, overall complications, and pathological Gleason were also not significantly different, nor were PSA progression, positive margin rate, or continence at 1 year. After bilateral nerve-sparing, erections suitable for intercourse with or without therapy at 1 year was 88.5% (23/26) for DLP and 61.2% (30/49) for RRP (p=0.01). Follow-up time was similar. Conclusion: For obese patients, DLP appears to have similar perioperative, as well as short-term oncologic and functional outcomes when compared to open RRP.

Le, Carter Q.; Ho, Khai-Linh V.; Slezak, Jeffrey M.; Blute, Michael L.; Gettman, Matthew T.

2007-02-01

38

Appropriate set-up of the da Vinci Surgical System in relation to the location of anterior and middle mediastinal tumors.  

PubMed

The da Vinci® Surgical System (dV) and its later version [da Vinci S® Surgical System (dVS)] have been used only in very few cases in selected thoracic surgical areas in Japan. Recently, we used the dV and dVS for various types of anterior and middle mediastinal tumors in clinical practice. We report our experience, and review the settings which depended on tumor location. Six patients gave written informed consent to undergo robotic surgery using the dV or dVS. We evaluated the feasibility, safety and appropriate settings of this system for the surgical treatment of mediastinal tumors. Tumor dissection was performed by two specialists in thoracic surgery certified to use the dV and dVS, and another specialist who acted as an assistant. We were able to access difficult-to-reach areas like the mediastinum. All the resected tumors were classified as benign tumors histologically. Crucial to the success of these operations was the set-up of the dV, which varied according to the location of mediastinal tumors. Robotic surgery enables various types of mediastinal tumor dissection more safely and easily than conventional video-assisted thoracoscopic surgery (VATS). The dV requires the appropriate set-up configuration, which varies according to the location of the mediastinal tumor. PMID:21081552

Kajiwara, Naohiro; Kakihana, Masatoshi; Kawate, Norihiko; Ikeda, Norihiko

2011-02-01

39

Da vinci coding? Using renaissance artists' depictions of the brain to engage student interest in neuroanatomy.  

PubMed

This report describes a pair of brief, interactive classroom exercises utilizing Renaissance artists' depictions of the brain to help increase student interest in learning basic neuroanatomy. Undergraduate students provided anonymous quantitative evaluations of both exercises. The feedback data suggest that students found both exercises engaging. The data also suggest that the first exercise increased student interest in learning more about neuroanatomy in general, while the second provided useful practice in identifying major neuroanatomical structures. Overall, the data suggest that these exercises may be a useful addition to courses that introduce or review neuroanatomical concepts. PMID:23805058

Watson, Todd D

2013-01-01

40

Feasibility of an endoscopic approach to the axillary nerve and the nerve to the long head of the triceps brachii with the help of the Da Vinci Robot.  

PubMed

Surgery to transfer the axillary nerve and the nerve of the long head of the triceps presents two obstacles: 1) the access portals are not standardized and 2) the nerves are for their larger part approached through large incisions. The goal of this study was to explore the feasibility of an endoscopic microsurgical approach. The posterior aspect of a cadaver shoulder was approached through three communicating mini-incisions. The Da Vinci robot camera was installed on a central trocart, and the instrument arms on the adjacent trocarts. A gas insufflation distended the soft tissues up to the lateral axillary space. The branches of the axillary nerve and the nerve to the long head of the triceps brachii muscle were identified. The dissection of the axillary nerve trunk and its branches was easy. The posterior humeral circumflex veins and artery were dissected as well without any difficulty. Finding the nerve to the long head of the triceps brachii was found to be more challenging because of its deeper location. Robots properties allow performing conventional microsurgery: elimination of the physiologic tremor and multiplication of the movements. They also facilitate the endoscopic approach of the peripheral nerves, as seen in our results on the terminal branches of the axillary nerve and the nerve to the long head of the triceps brachii. PMID:23867724

Porto de Melo, P M; Garcia, J C; Montero, E F de Souza; Atik, T; Robert, E-G; Facca, S; Liverneaux, P-A

2013-09-01

41

The Code Delusion  

Microsoft Academic Search

No, I’m not cashing in on that titular domino effect that exploits best sellers. The temptations are great, given the rich rewards from a gullible readership, but offset, in the minds of decent writers, by the shame of literary hitchhiking. Thus, guides to the Louvre become The Da Vinci Code Walkthrough for Dummies, milching, as it were, several hot cows

Stan Kelly-bootle

2007-01-01

42

Chemical characterization and source apportionment of fine and coarse particulate matter inside the refectory of Santa Maria Delle Grazie Church, home of Leonardo Da Vinci's "Last Supper".  

PubMed

The association between exposure to indoor particulate matter (PM) and damage to cultural assets has been of primary relevance to museum conservators. PM-induced damage to the "Last Supper" painting, one of Leonardo da Vinci's most famous artworks, has been a major concern, given the location of this masterpiece inside a refectory in the city center of Milan, one of Europe's most polluted cities. To assess this risk, a one-year sampling campaign was conducted at indoor and outdoor sites of the painting's location, where time-integrated fine and coarse PM (PM(2.5) and PM(2.5-10)) samples were simultaneously collected. Findings showed that PM(2.5) and PM(2.5-10) concentrations were reduced indoors by 88 and 94% on a yearly average basis, respectively. This large reduction is mainly attributed to the efficacy of the deployed ventilation system in removing particles. Furthermore, PM(2.5) dominated indoor particle levels, with organic matter as the most abundant species. Next, the chemical mass balance model was applied to apportion primary and secondary sources to monthly indoor fine organic carbon (OC) and PM mass. Results revealed that gasoline vehicles, urban soil, and wood-smoke only contributed to an annual average of 11.2 ± 3.7% of OC mass. Tracers for these major sources had minimal infiltration factors. On the other hand, fatty acids and squalane had high indoor-to-outdoor concentration ratios with fatty acids showing a good correlation with indoor OC, implying a common indoor source. PMID:22070580

Daher, Nancy; Ruprecht, Ario; Invernizzi, Giovanni; De Marco, Cinzia; Miller-Schulze, Justin; Heo, Jong Bae; Shafer, Martin M; Schauer, James J; Sioutas, Constantinos

2011-12-15

43

Avoiding Steric' Congestion in Dendrimer Growth through Proportionate Branching: A Twist on da Vinci's Rule of Tree Branching  

PubMed Central

Making defect-free macromolecules is a challenging issue in chemical synthesis. This challenge is especially pronounced in dendrimer synthesis where exponential growth quickly leads to steric congestion. To overcome this difficulty, proportionate branching in dendrimer growth is proposed. In proportionate branching, both the number and the length of branches increase exponentially, but in opposite directions to mimic tree growth. The effectiveness of this strategy is demonstrated through the synthesis of a fluorocarbon dendron containing 243 chemically identical fluorine atoms with a MW of 9,082 Da. Monodispersity is confirmed by nuclear magnetic resonance spectroscopy, mass spectrometry and small-angle X-ray scattering. Growing different parts proportionately, as nature does, could be a general strategy to achieve defect-free synthesis of macromolecules. PMID:23039185

Yue, Xuyi; Taraban, Marc B; Hyland, Laura L.

2013-01-01

44

daVinci Code: A Multi-Model Simulation and Analysis Tool for Multi-Body Systems  

E-print Network

, Jeff Trinkle, Binh Nguyen, and Ben Roghani Department of Computer Science Rensselaer Polytechnic are numerically stable and provably convergent. In particular, it has been proven that when the Stewart-Trinkle

Trinkle, Jeff

45

What Is the Moral Imperative of Workplace Learning: Unlocking the DaVinci Code of Human Resource Development?  

ERIC Educational Resources Information Center

In the course of the author's doctoral study, he is exploring the strategic linkages between learning activities in the modern workplace and the long-term success they bring to organisations. For many years, this challenge has been the Holy Grail of human resource (HR) development practitioners, who invest heavily on training and professional…

Short, Tom

2006-01-01

46

VA Informatics and Computing Infrastructure VINCI Organization  

E-print Network

/CDW VINCI Veterans Affairs #12;· Establish a National Research Infrastructure · Develop New Data Privacy language processing? · Increasing demands for more detailed clinical data · Quality Measures · Evidence

47

www.deepsummeracademy.com Da Vinci Engineering  

E-print Network

(DEEP) Summer Academy is an academically rigorous program that nurtures highly motivated grade 9 to 12 and 10th grade students Senior courses for 11th and 12th grade students (See page 10 for course offerings to Friday. The fourth week of DEEP Summer Academy is our popular DEEP Design Week, which focuses

Sislian, J. P.

48

Distance Learning. Leonardo da Vinci Series: Good Practices.  

ERIC Educational Resources Information Center

This brochure, part of a series about good practices in vocational training in the European Union, describes 12 projects that use distance learning to promote lifelong learning in adults. The projects and their countries of origin are as follows: (1) 3D Project, training in the use of IT tools for 3D simulation and animation and practical…

Commission of the European Communities, Brussels (Belgium). Directorate-General for Education and Culture.

49

[Operation-assisted Robot·da Vinci( Lung)].  

PubMed

The most favorable advantage of robotic surgery is the markedly free movement of joint-equipped robotic forceps under 3-dimensional high-vision. Accurate operation makes complex procedures straightforward and may overcome weak points of previous thoracoscopic surgery. The efficiency and safety improves with acquiring skills. However, the spread of robotic surgery in the general thoracic surgery field has been delayed compared to those in other fields. The surgical indications include primary lung cancer, thymic diseases, and mediastinal tumors, but it is unclear whether technical advantages felt by operators are directly connected to merits for patients. Moreover, problems concerning the cost and education have not been solved. Although evidence is insufficient for robotic thoracic surgery, it may be an extension of thoracoscopic surgery, and reports showing its usefulness for primary lung cancer, myasthenia gravis, and thymoma have been accumulating. Now, important thing is to carry out clinical trial for advanced medical care and insurance acquisition. Although it is necessary to solve important problems such as safety, education, training, the cost for the future development, advancing robot technology has a possibility to markedly change general thoracic surgery. PMID:25138949

Nakamura, Hiroshige; Taniguchi, Yuji

2014-07-01

50

78 FR 58376 - American Asset Development, Inc., aVinci Media Corp., Ceragenix Pharmaceuticals, Inc., Marshall...  

Federal Register 2010, 2011, 2012, 2013

...aVinci Media Corp., Ceragenix Pharmaceuticals, Inc., Marshall Holdings International, Inc., MedCom USA, Incorporated...current and accurate information concerning the securities of Marshall Holdings International, Inc. because it has not filed...

2013-09-23

51

Leonardo da EmileTruijen  

E-print Network

Stevin Lect. room B Isaac Newton Lect. room C Daniel Bernoulli Lect. room D James Wa L.r.JCoenraad Stork L laboratories Departments Levels A Leonardo da Vinci - 6 gf B Isaac Newton - 6 gf C Daniel Bernoulli - 6 gf D

Lindken, Ralph

52

Social and Occupational Integration of Disadvantaged People. Leonardo da Vinci Good Practices Series.  

ERIC Educational Resources Information Center

This document profiles nine European programs that exemplify good practice in social and occupational integration of disadvantaged people. The programs profiled are as follows: (1) Restaurant Venezia (a CD-ROM program to improve the reading and writing skills of young people in Luxembourg who have learning difficulties); (2) an integrated…

Commission of the European Communities, Brussels (Belgium). Directorate-General for Education and Culture.

53

Building Skills and Qualifications among SME Employees. Leonardo da Vinci Good Practices Series.  

ERIC Educational Resources Information Center

This document profiles 10 European programs that exemplify good practice in building skills and qualifications among employees of small and medium enterprises (SMEs). The programs profiled are as follows: (1) TRICTSME (a program providing World Wide Web-based information and communication technologies training for SMEs in manufacturing); (2)…

Commission of the European Communities, Brussels (Belgium). Directorate-General for Education and Culture.

54

Leonardo da Vinci, 1452-1519 Perhaps the smartest person ever  

E-print Network

, folio 76 v. Biblioteca Ambrosiana di Milano) #12;Galileo Galilei (Pisa, 1564 - Arcetri, 1642): Discorsi of falling bodies, a law deduced by Galileo's experiments and enunciated by Torricelli in 1642. constant 2 1

Ballarini, Roberto

55

In Pursuit of Social Betterment: A Proposal to Evaluate the Da Vinci Learning Model  

ERIC Educational Resources Information Center

The author presents a proposal that is roughly based on a contingency-based theory of evaluation developed in his book, "Evaluation: An Integrated Framework for Understanding, Guiding, and Improving Policies and Programs" (Mark, Henry, and Julnes, 2000). He and his coauthors stated in this book that social betterment was the ultimate goal of…

Henry, Gary T.

2005-01-01

56

Moving towards Optimising Demand-Led Learning: The 2005-2007 ECUANET Leonardo Da Vinci Project  

ERIC Educational Resources Information Center

Purpose: The purpose of this paper is to present the key project learning points and outcomes as a guideline for the future quality management of demand-led learning and development. Design/methodology/approach: The research methodology was based upon a corporate university blueprint architecture and browser toolkit developed by a member of the…

Dealtry, Richard; Howard, Keith

2008-01-01

57

The rare DAT coding variant Val559 perturbs DA neuron function, changes behavior, and alters in vivo responses to psychostimulants.  

PubMed

Despite the critical role of the presynaptic dopamine (DA) transporter (DAT, SLC6A3) in DA clearance and psychostimulant responses, evidence that DAT dysfunction supports risk for mental illness is indirect. Recently, we identified a rare, nonsynonymous Slc6a3 variant that produces the DAT substitution Ala559Val in two male siblings who share a diagnosis of attention-deficit hyperactivity disorder (ADHD), with other studies identifying the variant in subjects with bipolar disorder (BPD) and autism spectrum disorder (ASD). Previously, using transfected cell studies, we observed that although DAT Val559 displays normal total and surface DAT protein levels, and normal DA recognition and uptake, the variant transporter exhibits anomalous DA efflux (ADE) and lacks capacity for amphetamine (AMPH)-stimulated DA release. To pursue the significance of these findings in vivo, we engineered DAT Val559 knock-in mice, and here we demonstrate in this model the presence of elevated extracellular DA levels, altered somatodendritic and presynaptic D2 DA receptor (D2R) function, a blunted ability of DA terminals to support depolarization and AMPH-evoked DA release, and disruptions in basal and psychostimulant-evoked locomotor behavior. Together, our studies demonstrate an in vivo functional impact of the DAT Val559 variant, providing support for the ability of DAT dysfunction to impact risk for mental illness. PMID:25331903

Mergy, Marc A; Gowrishankar, Raajaram; Gresch, Paul J; Gantz, Stephanie C; Williams, John; Davis, Gwynne L; Wheeler, C Austin; Stanwood, Gregg D; Hahn, Maureen K; Blakely, Randy D

2014-11-01

58

Totally thoracoscopic surgery for the treatment of atrial septal defect without of the robotic Da Vinci surgical system  

PubMed Central

Background More and more surgeons and patients focus on the minimally invasive surgical techniques in the 21st century. Totally thoracoscopic operation provides another minimal invasive surgical option for patients with ASD (atrial septal defect). In this study, we reported our experience of 61 patients with atrial septal defect who underwent totally thoracoscopic operation and discussed the feasibility and safety of the new technique. Methods From January 2010 to October 2012, 61 patients with atrial septal defect underwent totally thoracoscopic closure but not traditional median sternotomy surgery. We divided the 61 patients into two groups based on the operation sequence. The data of group A (the first 30 cases) and group B (the last 31 cases). The mean age of the patients was 35.1?±?12.8 years (range, 6.3 to 63.5 years), and mean weight was 52.7?±?11.9 kg (range, 30.5 to 80 kg). Mean size of the atrial septal defect was 16.8?±?11.3 mm (range, 13 to 39 mm) based on the description of the echocardiography. Results All patients underwent totally thoracoscopy successfully, 36 patients with pericardium patch and 25 patients were sutured directly. 7 patients underwent concomitant tricuspid valvuloplasty with Key technique. No death, reoperation or complete atrioventricular block occurred. The mean time of cardiopulmonary bypass was 68.5?±?19.1 min (range, 31.0 to 153.0 min), the mean time of aortic cross-clamp was 27.2?±?11.3 min (range, 0.0 to 80.0 min) and the mean time of operation was 149.8?±?35.7 min (range, 63.0 to 300.0 min). Postoperative mechanical ventilation averaged 4.9?±?2.5 hours (range, 3.5 to 12.6 hours), and the duration of intensive care unit stay 20.0?±?4.8 hours (range, 15.5 to 25 hours). The mean volume of blood drainage was 158?±?38 ml (range, 51 to 800 ml). No death, residual shunt, lung atelectasis or moderate tricuspid regurgitation was found at 3-month follow-up. Conclusion The totally thoracoscopic operation is feasible and safe for patients with ASD, even with or without tricuspid regurgitation. This technique provides another minimal invasive surgical option for patients with atrial septal defect. PMID:23634811

2013-01-01

59

X CONVEGNO ANNUALE CODAU 2012 Segreteria Codau c/o Politecnico di Milano Piazza Leonardo da Vinci, 32 20133 Milano  

E-print Network

"Globalizzazione, Stato e Università" a cura di Franco DE FELICE, Capo Redattore RAI Regione Toscana VENERD� 21'Università per il rilancio del Paese" Intervengono: Stella TARGETTI, Vice Presidente Regione Toscana Confindustria Toscana Coordina Graziano DRAGONI, Direttore Generale Politecnico di Milano Dibattito

Schettini, Raimondo

60

The DaVincis of dirt: Geoarchaeological perspectives on Native American mound building in the Mississippi River basin  

Microsoft Academic Search

The complexity of mound construction, as revealed through geoarchaeological analyses, indicates the cultural significance of mounds may be as well reflected in the earthen construction materials and their arrangement, as it is in the artifacts abandoned on their summits. We use geoarchaeological examples from three sites in the Mississippi River basin, Shiloh Mounds, Cahokia, and Poverty Point, to advocate a

Sarah C. Sherwood; Tristram R. Kidder

2011-01-01

61

Process to generate a synthetic diagnostic for microwave imaging reflectometry with the full-wave code FWR2Da)  

NASA Astrophysics Data System (ADS)

A synthetic microwave imaging reflectometer (MIR) diagnostic employing the full-wave reflectometer code (FWR2D) has been developed and is currently being used to guide the design of real systems, such as the one recently installed on DIII-D. The FWR2D code utilizes real plasma profiles as input, and it is combined with optical simulation tools for synthetic diagnostic signal generation. A detailed discussion of FWR2D and the process to generate the synthetic signal are presented in this paper. The synthetic signal is also compared to a prescribed density fluctuation spectrum to quantify the imaging quality. An example is presented with H-mode-like plasma profiles derived from a DIII-D discharge, where the MIR focal is located in the pedestal region. It is shown that MIR is suitable for diagnosing fluctuations with poloidal wavenumber up to 2.0 cm-1 and fluctuation amplitudes less than 5%.

Ren, X.; Domier, C. W.; Kramer, G.; Luhmann, N. C.; Muscatello, C. M.; Shi, L.; Tobias, B. J.; Valeo, E.

2014-11-01

62

Improving the Effectiveness of Collaborative Recommendation with Ontology-Based User Profiles  

E-print Network

and Retrieval]: Information Search and Retrieval--Information Filtering General Terms Algorithms, Design, Experimentation Keywords Recommender systems, collaborative filtering, ontology-based user profiles 1 ("Da Vinci Code"), books on computer science topics ("Python Programming") for work-related purposes

Burke, Robin

63

Coding theory basics Toric codes  

E-print Network

. Little Department of Mathematics and Computer Science College of the Holy Cross July 29-31, 2013 John B(!) John B. Little Toric Varieties in Coding Theory #12;Coding theory basics Toric codes Tools from-up message noise encoder trans. channel rec. decoder message John B. Little Toric Varieties in Coding

Little, John B.

64

Expander codes  

Microsoft Academic Search

We present a new class of asymptotically good, linearerror-correcting codes based upon expander graphs.These codes have linear time sequential decoding algorithms,logarithmic time parallel decoding algorithmswith a linear number of processors, and are simple tounderstand. We present both randomized and explicitconstructions for some of these codes. Experimentalresults demonstrate the extremely good performance ofthe randomly chosen codes.1. IntroductionWe present a new class

Michael Sipser; Daniel A. Spielman

1996-01-01

65

Character coding  

NSDL National Science Digital Library

Character coding has been called the bete noire of phylogenetic analysis. As you may have seen from class, the definition of "character" is squishy and varies between authors. Although there isn't agreement on exactly what a character is, it is possible to predict how certain character definitions and coding strategies affect phylogenetic analysis. This activity focuses on character coding, specifically about how different coding strategies can affect analysis. In this exercise we will try to look at different coding strategies by considering the simple shapes below. (1) What is a character, and what qualities do characters have? (2) Given the 'morphology' depicted above, what features vary? (3) Given the variation you identified, come up with as many character codings as you can; i.e., different ways that this variation can be coded into characters. (4) For each of the coding strategies you come up with in question 3, identify its assumptions, limitations, and strengths. (5) Identify your preferred coding strategy and defend your choice. Students asked to define what a character is and to discuss what they 'require', and then to come up with an exhaustive list of coding strategies for the sample morphology. They are then asked to list assumptions/limitations of each strategy.

Wilson, Jeff

66

Code constructions and code families for nonbinary quantum stabilizer code  

E-print Network

Stabilizer codes form a special class of quantum error correcting codes. Nonbinary quantum stabilizer codes are studied in this thesis. A lot of work on binary quantum stabilizer codes has been done. Nonbinary stabilizer codes have received much...

Ketkar, Avanti Ulhas

2005-11-01

67

Raptor codes  

Microsoft Academic Search

We exhibit a class of universal Raptor Codes: for a given integer k, and any real ?> 0 ,R ap- tor Codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + ?) is sufficient to recover the original k sym- bols, with high probability. Each output symbol is generated

Amin Shokrollahi

2006-01-01

68

Poll Code  

NSDL National Science Digital Library

Are you a pollster? Would you like to be one? PollCode makes all of this quite simple. With this handy application, visitors can type in a poll question and up to 30 possible answers. Visitors can customize the poll with their own colors, font, and settings. After visitors have completed their poll, they can use the HTML code provided here to share their poll with others via social media networks and the like. This version of Poll Code is compatible with all operating systems. [KMG

2013-05-09

69

Cloning, characterization, and chromosomal localization to 4p16 of the human gene (LRPAP1) coding for the {alpha}{sub 2}-macroglobulin receptor-associated protein and structural comparison with the murine gene coding for the 44-kDa heparin-binding protein  

SciTech Connect

We report the molecular cloning of the human gene (symbol LRPAP1) coding for the {alpha}{sub 2}-macroglobulin receptor-associated protein (A2MRAP), as well as the gene coding for the 44-kDa heparin-binding protein (HBP-44), its murine counterpart. For both, genomic cosmid clones were isolated, and for the human gene a bacteriophage P1 clone containing the entire A2MRAP gene was also retrieved. The genes were characterized after subcloning: in both species, the known coding part of the cDNA is encoded by eight exons, and the position of the boundaries of the exons was conserved. The human LRPAP1 locus was assigned to chromosome 4 by PCR of human-hamster hybrid cell lines and by fluorescence in situ hybridization to band 4p16.3. This maps closely to the variable constitutional deletions of the short arm of chromosome 4, observed cytogenetically in patients with the Wolf-Hirschhorn syndrome. Metaphase spreads of two such patients were analyzed by fluorescence in situ hybridization with an LRPAP1 genomic probe. The first patient, with karyotype 46,XY,del4(p14-p16.1), had retained both copies of the LRPAP1 gene. In contrast, the other patient, with karyotype 46,XY,del4(p15.3-pter), displayed no signal for LRPAP1 on the deleted chromosome. 44 refs., 3 figs., 1 tab.

Van Leuven, F.; Hilliker, C.; Serneels, L. [Univ. of Leuven (Belgium)] [and others] [Univ. of Leuven (Belgium); and others

1995-01-20

70

High Performance “Reach” Codes  

E-print Network

Jim Edelson New Buildings Institute A Growing Role for Codes and Stretch Codes in Utility Programs Clean Air Through Energy Efficiency November 9, 2011 ESL-KT-11-11-39 CATEE 2011, Dallas, Texas, Nov. 7 ? 9, 2011 New Buildings Institute ESL..., Nov. 7 ? 9, 2011 ?31? Flavors of Codes ? Building Codes Construction Codes Energy Codes Stretch or Reach Energy Codes Above-code programs Green or Sustainability Codes Model Codes ?Existing Building? Codes Outcome-Based Codes ESL-KT-11...

Edelson, J.

2011-01-01

71

Speech coding  

SciTech Connect

Speech is the predominant means of communication between human beings and since the invention of the telephone by Alexander Graham Bell in 1876, speech services have remained to be the core service in almost all telecommunication systems. Original analog methods of telephony had the disadvantage of speech signal getting corrupted by noise, cross-talk and distortion Long haul transmissions which use repeaters to compensate for the loss in signal strength on transmission links also increase the associated noise and distortion. On the other hand digital transmission is relatively immune to noise, cross-talk and distortion primarily because of the capability to faithfully regenerate digital signal at each repeater purely based on a binary decision. Hence end-to-end performance of the digital link essentially becomes independent of the length and operating frequency bands of the link Hence from a transmission point of view digital transmission has been the preferred approach due to its higher immunity to noise. The need to carry digital speech became extremely important from a service provision point of view as well. Modem requirements have introduced the need for robust, flexible and secure services that can carry a multitude of signal types (such as voice, data and video) without a fundamental change in infrastructure. Such a requirement could not have been easily met without the advent of digital transmission systems, thereby requiring speech to be coded digitally. The term Speech Coding is often referred to techniques that represent or code speech signals either directly as a waveform or as a set of parameters by analyzing the speech signal. In either case, the codes are transmitted to the distant end where speech is reconstructed or synthesized using the received set of codes. A more generic term that is applicable to these techniques that is often interchangeably used with speech coding is the term voice coding. This term is more generic in the sense that the coding techniques are equally applicable to any voice signal whether or not it carries any intelligible information, as the term speech implies. Other terms that are commonly used are speech compression and voice compression since the fundamental idea behind speech coding is to reduce (compress) the transmission rate (or equivalently the bandwidth) And/or reduce storage requirements In this document the terms speech and voice shall be used interchangeably.

Ravishankar, C., Hughes Network Systems, Germantown, MD

1998-05-08

72

Free Code  

NSDL National Science Digital Library

Free Code, a service of Andover.Net, is a large index of Internet-related software tool source code. The tools are written in C/C++, Perl, Java, or Visual Basic, and are free for personal and commercial use. They range from handy Perl CGI scripts to Java-based graphics packages. Each tool in the index is briefly described, characterized by language and operating system, and linked to both the home page for the tool and the source code. The total lack of documentation for the search engine makes useful queries hard to create, but the tools are still easy-to-find. This is a very useful index for anyone building Internet or Web-based applications.

73

QR Codes  

ERIC Educational Resources Information Center

This study presents an m-learning method that incorporates Integrated Quick Response (QR) codes. This learning method not only achieves the objectives of outdoor education, but it also increases applications of Cognitive Theory of Multimedia Learning (CTML) (Mayer, 2001) in m-learning for practical use in a diverse range of outdoor locations. When…

Lai, Hsin-Chih; Chang, Chun-Yen; Li, Wen-Shiane; Fan, Yu-Lin; Wu, Ying-Tien

2013-01-01

74

Quantum coding  

Microsoft Academic Search

A theorem is proven for quantum information theory that is analogous to the noiseless coding theorem of classical information theory. In the quantum result, the von Neumann entropy S of the density operator describing an ensemble of pure quantum signal states is equal to the number of spin-1\\/2 systems (``quantum bits'' or ``qubits'') necessary to represent the signal faithfully. The

Benjamin Schumacher

1995-01-01

75

TRACKING CODE DEVELOPMENT FOR BEAM DYNAMICS OPTIMIZATION  

SciTech Connect

Dynamic aperture (DA) optimization with direct particle tracking is a straight forward approach when the computing power is permitted. It can have various realistic errors included and is more close than theoretical estimations. In this approach, a fast and parallel tracking code could be very helpful. In this presentation, we describe an implementation of storage ring particle tracking code TESLA for beam dynamics optimization. It supports MPI based parallel computing and is robust as DA calculation engine. This code has been used in the NSLS-II dynamics optimizations and obtained promising performance.

Yang, L.

2011-03-28

76

Cryptographer  

ERIC Educational Resources Information Center

For the general public, the field of cryptography has recently become famous as the method used to uncover secrets in Dan Brown's fictional bestseller, The Da Vinci Code. But the science of cryptography has been popular for centuries--secret hieroglyphics discovered in Egypt suggest that code-making dates back almost 4,000 years. In today's…

Sullivan, Megan

2005-01-01

77

Lymphoma Coding Guidelines  

Cancer.gov

Coding Guidelines LYMPHOMA M9590/3-M9738/3 See the Hematopoietic and Lymphoid Neoplasm Case Reportability and Coding Manual and the Hematopoietic Database (DB) for more information and coding instructions. First Course of Therapy Do not code

78

Thyroid Coding Guidelines  

Cancer.gov

Coding Guidelines THYROID GLAND C739 Coding Hormone Therapy Code Hormone Therapy as 01 for follicular and/or papillary thyroid cancer when thyroid hormone therapy is given. Do not code replacement therapy as treatment unless the tumor is papillary

79

Error-correction coding  

NASA Technical Reports Server (NTRS)

This report describes the progress made towards the completion of a specific task on error-correcting coding. The proposed research consisted of investigating the use of modulation block codes as the inner code of a concatenated coding system in order to improve the overall space link communications performance. The study proposed to identify and analyze candidate codes that will complement the performance of the overall coding system which uses the interleaved RS (255,223) code as the outer code.

Hinds, Erold W. (Principal Investigator)

1996-01-01

80

Finite-State Codes  

NASA Technical Reports Server (NTRS)

New class of codes with desirable properties constructed from block codes. Finite-state encoder is machine that has finite number of internal states. Receives k parallel information symbols and transmits n parallel code symbols at each clock pulse. Finite-state codes include both block and convolutional codes. Theory of finite-state codes used to study properties of error-correcting codes in general and to design new codes to various specifications.

Pollara, F.; Mceliece, R. J.; Abdel-Ghaffar, K.

1990-01-01

81

Introduction Properties of Expander Codes  

E-print Network

of Expander Codes Our Results Conclusions Background Basic Definitions LDPC Codes Expander Codes Turbo CodesIntroduction Properties of Expander Codes Our Results Conclusions Expander Codes: Constructions, Haifa 32000, Israel. Vitaly Skachek Expander Codes: Constructions and Bounds #12;Introduction Properties

Skachek, Vitaly

82

Homological stabilizer codes  

SciTech Connect

In this paper we define homological stabilizer codes on qubits which encompass codes such as Kitaev's toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev's toric code or to the topological color codes. - Highlights: Black-Right-Pointing-Pointer We show that Kitaev's toric codes are equivalent to homological stabilizer codes on 4-valent graphs. Black-Right-Pointing-Pointer We show that toric codes and color codes correspond to homological stabilizer codes on distinct graphs. Black-Right-Pointing-Pointer We find and classify all 2D homological stabilizer codes. Black-Right-Pointing-Pointer We find optimal codes among the homological stabilizer codes.

Anderson, Jonas T., E-mail: jonastyleranderson@gmail.com

2013-03-15

83

Homological Stabilizer Codes  

E-print Network

In this paper we define homological stabilizer codes which encompass codes such as Kitaev's toric code and the topological color codes. These codes are defined solely by the graphs they reside on. This feature allows us to use properties of topological graph theory to determine the graphs which are suitable as homological stabilizer codes. We then show that all toric codes are equivalent to homological stabilizer codes on 4-valent graphs. We show that the topological color codes and toric codes correspond to two distinct classes of graphs. We define the notion of label set equivalencies and show that under a small set of constraints the only homological stabilizer codes without local logical operators are equivalent to Kitaev's toric code or to the topological color codes.

Jonas T. Anderson

2011-07-18

84

Encyclopedia of Sparse Graph Codes  

Microsoft Academic Search

Evaluation of Gallager codes for low error tolerance, short block length andhigh rate applications.Sparse graph codes include Gallager codes, Tanner codes, MN codes Repeat--Accumulate codes (RA codes), and turbo codes, all of which have near--Shannonlimit performance.This paper (which is still in preparation) describes empirical properties of a wideselection of these codes, comparing in particular the codes\\

David J. C. Mackay

1999-01-01

85

Locally decodable source coding  

E-print Network

Source coding is accomplished via the mapping of consecutive source symbols (blocks) into code blocks of fixed or variable length. The fundamental limits in source coding introduces a tradeoff between the rate of compression ...

Makhdoumi, Ali (Makhdoumi Kakhaki)

2013-01-01

86

Error correcting codes  

Microsoft Academic Search

Linear algebraic codes are an elegant illustration of the power of Algebra. We introduce linear codes, and try to explain\\u000a how the structure present in these codes permits easy implementation of encoding and decoding schemes.

Priti Shankar

1996-01-01

87

Coset Codes Viewed as Terminated Convolutional Codes  

NASA Technical Reports Server (NTRS)

In this paper, coset codes are considered as terminated convolutional codes. Based on this approach, three new general results are presented. First, it is shown that the iterative squaring construction can equivalently be defined from a convolutional code whose trellis terminates. This convolutional code determines a simple encoder for the coset code considered, and the state and branch labelings of the associated trellis diagram become straightforward. Also, from the generator matrix of the code in its convolutional code form, much information about the trade-off between the state connectivity and complexity at each section, and the parallel structure of the trellis, is directly available. Based on this generator matrix, it is shown that the parallel branches in the trellis diagram of the convolutional code represent the same coset code C(sub 1), of smaller dimension and shorter length. Utilizing this fact, a two-stage optimum trellis decoding method is devised. The first stage decodes C(sub 1), while the second stage decodes the associated convolutional code, using the branch metrics delivered by stage 1. Finally, a bidirectional decoding of each received block starting at both ends is presented. If about the same number of computations is required, this approach remains very attractive from a practical point of view as it roughly doubles the decoding speed. This fact is particularly interesting whenever the second half of the trellis is the mirror image of the first half, since the same decoder can be implemented for both parts.

Fossorier, Marc P. C.; Lin, Shu

1996-01-01

88

Transform picture coding  

Microsoft Academic Search

Picture coding by first dividing the picture into sub-pictures and then performing a linear transformation on each sub-picture cud quantizing and coding the resulting coefficients is introduced from a heuristic point of view. Various transformation, quantization, and coding strategies are discussed. A survey of all known applications of these techniques to monochromatic image coding is presented along with a summary

P. A. Wintz

1972-01-01

89

Discussion on LDPC Codes and Uplink Coding  

NASA Technical Reports Server (NTRS)

This slide presentation reviews the progress that the workgroup on Low-Density Parity-Check (LDPC) for space link coding. The workgroup is tasked with developing and recommending new error correcting codes for near-Earth, Lunar, and deep space applications. Included in the presentation is a summary of the technical progress of the workgroup. Charts that show the LDPC decoder sensitivity to symbol scaling errors are reviewed, as well as a chart showing the performance of several frame synchronizer algorithms compared to that of some good codes and LDPC decoder tests at ESTL. Also reviewed is a study on Coding, Modulation, and Link Protocol (CMLP), and the recommended codes. A design for the Pseudo-Randomizer with LDPC Decoder and CRC is also reviewed. A chart that summarizes the three proposed coding systems is also presented.

Andrews, Ken; Divsalar, Dariush; Dolinar, Sam; Moision, Bruce; Hamkins, Jon; Pollara, Fabrizio

2007-01-01

90

Algebraic geometric codes  

NASA Technical Reports Server (NTRS)

The performance characteristics are discussed of certain algebraic geometric codes. Algebraic geometric codes have good minimum distance properties. On many channels they outperform other comparable block codes; therefore, one would expect them eventually to replace some of the block codes used in communications systems. It is suggested that it is unlikely that they will become useful substitutes for the Reed-Solomon codes used by the Deep Space Network in the near future. However, they may be applicable to systems where the signal to noise ratio is sufficiently high so that block codes would be more suitable than convolutional or concatenated codes.

Shahshahani, M.

1991-01-01

91

Dnomination Ville Code postal  

E-print Network

Dénomination Adresse Ville Code postal Téléphone Télécopieur Courriel Facebook Site Web Nombre de membres Charte amendée : l Oui (pièces justificatives) l Non ADMINISTRATEURS Président Code permanent Adresse Téléphone Ville Code postal Courriel Vice-président Code permanent Adresse Téléphone Ville Code

Charette, André

92

QR Codes 101  

ERIC Educational Resources Information Center

A QR (quick-response) code is a two-dimensional scannable code, similar in function to a traditional bar code that one might find on a product at the supermarket. The main difference between the two is that, while a traditional bar code can hold a maximum of only 20 digits, a QR code can hold up to 7,089 characters, so it can contain much more…

Crompton, Helen; LaFrance, Jason; van 't Hooft, Mark

2012-01-01

93

ARA type protograph codes  

NASA Technical Reports Server (NTRS)

An apparatus and method for encoding low-density parity check codes. Together with a repeater, an interleaver and an accumulator, the apparatus comprises a precoder, thus forming accumulate-repeat-accumulate (ARA codes). Protographs representing various types of ARA codes, including AR3A, AR4A and ARJA codes, are described. High performance is obtained when compared to the performance of current repeat-accumulate (RA) or irregular-repeat-accumulate (IRA) codes.

Divsalar, Dariush (Inventor); Abbasfar, Aliazam (Inventor); Jones, Christopher R. (Inventor); Dolinar, Samuel J. (Inventor); Thorpe, Jeremy C. (Inventor); Andrews, Kenneth S. (Inventor); Yao, Kung (Inventor)

2008-01-01

94

Mathematical Fiction for Senior Students and Undergraduates: Novels, Plays, and Film  

ERIC Educational Resources Information Center

Mathematical fiction has probably existed since ideas have been written down and certainly as early as 414 BC (Kasman, 2000). Mathematical fiction is a recently rediscovered and growing literature, as sales of the novels: "The Curious Incident of the Dog in the Night-time" (Haddon, 2003) and "The Da Vinci Code" (Brown, 2004) attest. Science…

Padula, Janice

2006-01-01

95

chaoTIc : (ka tik) adj. 1. in a state of chaos;  

E-print Network

's hopes for black ink are decided by the gods of movie fortune--namely, you and me. Americans may-office future. But if picking films is like randomly tossing darts, why do some people hit the bull's-eye more heads, they see "X-Men"; if the coin lands tails, it's "The Da Vinci Code." Since the coin has an equal

Koch, Christof

96

\\  

Microsoft Academic Search

In recent years, an interest in religious (especially Christian) discourses has resurged, as evidenced by the popularity of the conservative Catholic film, The Passion of the Christ (2004) and Dan Brown's Church-conspiracy thriller The Da Vinci Code (2003). My thesis explores the character of Mary Magdalen within such texts, comparing hercontemporary imaginings with the imaginings of late medieval English texts.

Elizabeth C. Harmer

2005-01-01

97

[The "myologie dynamique" by Girolamo Fabrizi da Aquapendente in the scientific language in the Renaissance age (XVI-XVII)].  

PubMed

Beginning from the XV century, mechanical materialism underwent an evolution in "biological mechanics" within the scientific doctrine. Among the greatest exponents of this new current there were two Italian men, Leonardo da Vinci (1452-1519) and Girolamo da Acquapendente (1533-1619). By the trend given by Leonardo, the myology, instead of being a static science, took a dynamic meaning and valence. Later, Fabrizi resumed and investigated the subject above all in its less known expression, elaborating an original theory. With Acquapendente, the anatomy lost its merely descriptive pecularity and evolved in analysis of the structure in connection with the function. Moreover, he opposed the syllogism against the mechanic language and the mathematical formulation. A new scientific way will be afterwards characterized by Galileo Galilei in the field of the physics and by Giovanni Alfonso Borrelli in the biology. PMID:11640090

Stroppiana, L

1989-01-01

98

Graph concatenation for quantum codes  

E-print Network

Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code and every codeword stabilized code can be described by a graph and a classical code. For the ...

Beigi, Salman

99

Clip and Save.  

ERIC Educational Resources Information Center

Focuses on the facial expression in the "Mona Lisa" by Leonardo da Vinci. Offers background information on da Vinci as well as learning activities for students. Includes a reproduction of the "Mona Lisa" and information about the painting. (CMK)

Hubbard, Guy

2003-01-01

100

Coding AuthentiCity  

E-print Network

This thesis analyzes the impact of form-based codes, focusing on two research questions: (1) What is the underlying motivation for adopting a form-based code? (2) What motivations have the most significant impact on ...

Mercier, Rachel Havens

2008-01-01

101

Cellulases and coding sequences  

DOEpatents

The present invention provides three fungal cellulases, their coding sequences, recombinant DNA molecules comprising the cellulase coding sequences, recombinant host cells and methods for producing same. The present cellulases are from Orpinomyces PC-2.

Li, Xin-Liang (Athens, GA); Ljungdahl, Lars G. (Athens, GA); Chen, Huizhong (Lawrenceville, GA)

2001-01-01

102

Cellulases and coding sequences  

DOEpatents

The present invention provides three fungal cellulases, their coding sequences, recombinant DNA molecules comprising the cellulase coding sequences, recombinant host cells and methods for producing same. The present cellulases are from Orpinomyces PC-2.

Li, Xin-Liang (Athens, GA); Ljungdahl, Lars G. (Athens, GA); Chen, Huizhong (Lawrenceville, GA)

2001-02-20

103

Finite-state codes  

NASA Technical Reports Server (NTRS)

A class of codes called finite-state (FS) codes is defined and investigated. The codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived. A general construction for FS codes is given, and it is shown that in many cases the FS codes constructed in this way have a free distance that is the largest possible. Catastrophic error propagation (CEP) for FS codes is also discussed. It is found that to avoid CEP one must solve the graph-theoretic problem of finding a uniquely decodable edge labeling of the state diagram.

Pollara, Fabrizio; Mceliece, Robert J.; Abdel-Ghaffar, Khaled

1988-01-01

104

Verification of complex codes.  

SciTech Connect

Over the past several years, verifying and validating complex codes at Sandia National Laboratories has become a major part of code development. These aspects tackle two important parts of simulation modeling: determining if the models have been correctly implemented - verification, and determining if the correct models have been selected - validation. In this talk, we will focus on verification and discuss the basics of code verification and its application to a few codes and problems at Sandia.

Ober, Curtis Curry

2009-03-01

105

Tokamak reactor systems code  

SciTech Connect

A tokamak reactor systems code has been developed by combining a previously developed plasma engineering code with an existing reactor systems code and adding calculations for thermal hydraulics, stress analysis, physical sputtering, and neutron activation dose rate. Calculations from the thermal hydraulics and neutron activation dose rate modules are compared with results from more complex codes. The effects on reactor performance of unpredictable properties such as plasma profiles and confinement times are demonstrated.

Baxter, D.C.; Dabiri, A.E.

1983-09-01

106

EMF wire code research  

SciTech Connect

This paper examines the results of previous wire code research to determines the relationship with childhood cancer, wire codes and electromagnetic fields. The paper suggests that, in the original Savitz study, biases toward producing a false positive association between high wire codes and childhood cancer were created by the selection procedure.

Jones, T.

1993-11-01

107

The Woodland Carbon Code  

E-print Network

The Woodland Carbon Code While society must continue to make every effort to reduce greenhouse gas that schemes will actually deliver the carbon savings that they claim. The Woodland Carbon Code will provide that reassurance. The voluntary code will encourage a consistent approach to woodland carbon projects, and offer

108

Occupational Code Assignment System (CodeSearch)  

Cancer.gov

The Codesearch System is a PC-based system which provides users with an interactive method for assigning standardized industry and occupation codes to related job description titles from specific studies.

109

Color code identification in coded structured light.  

PubMed

Color code is widely employed in coded structured light to reconstruct the three-dimensional shape of objects. Before determining the correspondence, a very important step is to identify the color code. Until now, the lack of an effective evaluation standard has hindered the progress in this unsupervised classification. In this paper, we propose a framework based on the benchmark to explore the new frontier. Two basic facets of the color code identification are discussed, including color feature selection and clustering algorithm design. First, we adopt analysis methods to evaluate the performance of different color features, and the order of these color features in the discriminating power is concluded after a large number of experiments. Second, in order to overcome the drawback of K-means, a decision-directed method is introduced to find the initial centroids. Quantitative comparisons affirm that our method is robust with high accuracy, and it can find or closely approach the global peak. PMID:22859022

Zhang, Xu; Li, Youfu; Zhu, Limin

2012-08-01

110

Further results on product codes  

Microsoft Academic Search

A new class of codes, called product generator codes, which are similar to Elias's iterated codes, are investigated. An important subclass of these codes is the generalized Reed-Muller codes. If the original codes that are iterated to produce a product code areL_1andL_2-step orthogonalizable, then the product code is (L_1 + L_2 - 1)-step orthogonalizable. Further if anuth-order product generator code

W. Gore

1970-01-01

111

Source Code Library  

NSDL National Science Digital Library

At the DevX Source Code Library and the newer Sourcebank, users can download source code, algorithms, and sample applications. The Library is culled from DevX services and magazines, and resources are grouped into browseable and searchable categories. The Sourcebank collects code and related tools from sites around the Web and also is searchable and browseable. Users can limit their browsing by type of resource as well (Perl code, Java code, research papers, etc.). Perhaps needless to say, file formats are too numerous to name here.

1969-12-31

112

XSOR codes users manual  

SciTech Connect

This report describes the source term estimation codes, XSORs. The codes are written for three pressurized water reactors (Surry, Sequoyah, and Zion) and two boiling water reactors (Peach Bottom and Grand Gulf). The ensemble of codes has been named ``XSOR``. The purpose of XSOR codes is to estimate the source terms which would be released to the atmosphere in severe accidents. A source term includes the release fractions of several radionuclide groups, the timing and duration of releases, the rates of energy release, and the elevation of releases. The codes have been developed by Sandia National Laboratories for the US Nuclear Regulatory Commission (NRC) in support of the NUREG-1150 program. The XSOR codes are fast running parametric codes and are used as surrogates for detailed mechanistic codes. The XSOR codes also provide the capability to explore the phenomena and their uncertainty which are not currently modeled by the mechanistic codes. The uncertainty distributions of input parameters may be used by an. XSOR code to estimate the uncertainty of source terms.

Jow, Hong-Nian [Sandia National Labs., Albuquerque, NM (United States); Murfin, W.B. [Technadyne Engineering Consultants, Inc., Albuquerque, NM (United States); Johnson, J.D. [Science Applications International Corp., Albuquerque, NM (United States)

1993-11-01

113

REDUCE REVENUE: INCREASE REVENUE: DEPT & FUND CODE DEPT & FUND CODE  

E-print Network

REDUCE REVENUE: INCREASE REVENUE: DEPT & FUND CODE DEPT & FUND CODE ACCOUNT ACCOUNT PROJECT PROJECT: INCREASE REVENUE: DEPT & FUND CODE DEPT & FUND CODE ACCOUNT ACCOUNT PROJECT PROJECT CHARTFIELD 1 CHARTFIELD: DEPT & FUND CODE DEPT & FUND CODE ACCOUNT ACCOUNT PROJECT PROJECT CHARTFIELD 1 CHARTFIELD 1 CHARTFIELD

McQuade, D. Tyler

114

Code Red 2 kills off Code Red 1  

E-print Network

#12;#12;Code Red 2 kills off Code Red 1 Code Red 2 settles into weekly pattern Nimda enters the ecosystem Code Red 2 dies off as programmed CR 1 returns thanks to bad clocks #12;Code Red 2 dies off as programmed Nimda hums along, slowly cleaned up With its predator gone, Code Red 1 comes back, still

Paxson, Vern

115

Generating code adapted for interlinking legacy scalar code and extended vector code  

DOEpatents

Mechanisms for intermixing code are provided. Source code is received for compilation using an extended Application Binary Interface (ABI) that extends a legacy ABI and uses a different register configuration than the legacy ABI. First compiled code is generated based on the source code, the first compiled code comprising code for accommodating the difference in register configurations used by the extended ABI and the legacy ABI. The first compiled code and second compiled code are intermixed to generate intermixed code, the second compiled code being compiled code that uses the legacy ABI. The intermixed code comprises at least one call instruction that is one of a call from the first compiled code to the second compiled code or a call from the second compiled code to the first compiled code. The code for accommodating the difference in register configurations is associated with the at least one call instruction.

Gschwind, Michael K

2013-06-04

116

Overview of Code Verification  

NASA Technical Reports Server (NTRS)

The verified code for the SIFT Executive is not the code that executes on the SIFT system as delivered. The running versions of the SIFT Executive contain optimizations and special code relating to the messy interface to the hardware broadcast interface and to packing of data to conserve space in the store of the BDX930 processors. The running code was in fact developed prior to and without consideration of any mechanical verification. This was regarded as necessary experimentation with the SIFT hardware and special purpose Pascal compiler. The Pascal code sections cover: the selection of a schedule from the global executive broadcast, scheduling, dispatching, three way voting, and error reporting actions of the SIFT Executive. Not included in these sections of Pascal code are: the global executive, five way voting, clock synchronization, interactive consistency, low level broadcasting, and program loading, initialization, and schedule construction.

1983-01-01

117

Phonological coding during reading.  

PubMed

The exact role that phonological coding (the recoding of written, orthographic information into a sound based code) plays during silent reading has been extensively studied for more than a century. Despite the large body of research surrounding the topic, varying theories as to the time course and function of this recoding still exist. The present review synthesizes this body of research, addressing the topics of time course and function in tandem. The varying theories surrounding the function of phonological coding (e.g., that phonological codes aid lexical access, that phonological codes aid comprehension and bolster short-term memory, or that phonological codes are largely epiphenomenal in skilled readers) are first outlined, and the time courses that each maps onto (e.g., that phonological codes come online early [prelexical] or that phonological codes come online late [postlexical]) are discussed. Next the research relevant to each of these proposed functions is reviewed, discussing the varying methodologies that have been used to investigate phonological coding (e.g., response time methods, reading while eye-tracking or recording EEG and MEG, concurrent articulation) and highlighting the advantages and limitations of each with respect to the study of phonological coding. In response to the view that phonological coding is largely epiphenomenal in skilled readers, research on the use of phonological codes in prelingually, profoundly deaf readers is reviewed. Finally, implications for current models of word identification (activation-verification model, Van Orden, 1987; dual-route model, e.g., M. Coltheart, Rastle, Perry, Langdon, & Ziegler, 2001; parallel distributed processing model, Seidenberg & McClelland, 1989) are discussed. (PsycINFO Database Record (c) 2014 APA, all rights reserved). PMID:25150679

Leinenger, Mallorie

2014-11-01

118

The Gli code  

PubMed Central

The Gli code hypothesis postulates that the three vertebrate Gli transcription factors act together in responding cells to integrate intercellular Hedgehog (Hh) and other signaling inputs, resulting in the regulation of tissue pattern, size and shape. Hh and other inputs are then just ways to modify the Gli code. Recent data confirm this idea and suggest that the Gli code regulates stemness and also tumor progression and metastatic growth, opening exciting possibilities for both regenerative medicine and novel anticancer therapies. PMID:17845852

Ruiz i Altaba, Ariel; Mas, Christophe; Stecca, Barbara

2008-01-01

119

Bar Code Labels  

NASA Technical Reports Server (NTRS)

American Bar Codes, Inc. developed special bar code labels for inventory control of space shuttle parts and other space system components. ABC labels are made in a company-developed anodizing aluminum process and consecutively marketed with bar code symbology and human readable numbers. They offer extreme abrasion resistance and indefinite resistance to ultraviolet radiation, capable of withstanding 700 degree temperatures without deterioration and up to 1400 degrees with special designs. They offer high resistance to salt spray, cleaning fluids and mild acids. ABC is now producing these bar code labels commercially or industrial customers who also need labels to resist harsh environments.

1988-01-01

120

List of codes Language abbreviation codes  

E-print Network

Portugal MT Malta GR Greece SE Sweden TR Turkey Country codes for the ERASMUS Institutional Identification Hungary SI Slovenia F France P Portugal LT Lithuania SK Slovakia FL Liechtenstein S Sweden G Greece S F authority (regional) PUB.3 Public authority (national) IND Private company (manufacturing) SER Private

121

Banner Index Codes The Index code is a data-entry shortcut for the Fund code, Org code, and Program code in Banner  

E-print Network

Banner Index Codes The Index code is a data-entry shortcut for the Fund code, Org code, and Program code in Banner Finance (FO-P's). Implementation of the Index has greatly decreased data entry coding ­ Account (object) - Program (FOAP) code numbers on any of your accounting forms (Contracts, Purchase Orders

122

Graph Concatenation for Quantum Codes  

E-print Network

Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on "graph concatenation", where graphs representing the inner and outer codes are concatenated via a simple graph operation called "generalized local complementation." Our method applies to both binary and non-binary concatenated quantum codes as well as their generalizations.

Salman Beigi; Isaac Chuang; Markus Grassl; Peter Shor; Bei Zeng

2009-10-21

123

A Turbo Code Tutorial  

Microsoft Academic Search

We give a tutorial exposition of turbo codes and the associated algorithms. Included are a simple derivation for the performance of turbo codes, and a straightforward presentation of the iterative decoding algorithm. The derivations of both the performance estimate and the modified BCJR decoding algorithm are novel. The treatment is intended to be a launching point for further study in

William E. Ryan

1997-01-01

124

APPENDICE B Code source  

E-print Network

APPENDICE B Code source On trouvera ici le code source des packages ou domaines 'evoqu'es dans lePack ConvPack(le:List Expression):Public == Prive where E ==? Expression SE ==? SortedExpressions L ==? List LE ==? L E I ==? Integer PI ==? Polynomial I RFI ==? RationalFunction I NDMP ==? New

Ollivier, François

125

Fluka Code: An Overview.  

National Technical Information Service (NTIS)

FLUKA is a multipurpose Monte Carlo code which can transport a variety of particles over a wide energy range in complex geometries. The code is a joint project of INFN and CERN: part of its development is also supported by the University of Houston and NA...

F. Ballarini, G. Battistoni, M. Campanella, M. Carboni, F. Cerutti, A. Empol, A. Fasso, A. Ferrari, E. Gadioli, M. V. Garzelli

2005-01-01

126

Prostate Surgery Codes  

Cancer.gov

Prostate C619 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Do not code an orchiectomy in this field. For prostate primaries, orchiectomies are coded in the data item “Hematologic Transplant and

127

Did You "Code"  

ERIC Educational Resources Information Center

The problem of solving mathematical equations can be quite tough for some students hence they face a great difficulty when applying ideas to the actual process. Students in algebra classes are taught coding in which they write down what they will need to do to solve the equation and this coding makes the students more adept at solving equations…

Clausen, Mary C.

2005-01-01

128

Cervix Uteri Surgery Codes  

Cancer.gov

Cervi x Uteri C530–C539 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) [SEER Note: Do not code dilation and curettage (D&C) as Surgery of Primary Site for invasive cancers] Codes 00 None; no surgery

129

Anus Surgery Codes  

Cancer.gov

Anus C210–C218 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) [SEER Note: Do not code infrared coagulation as treatment.] Codes 00 None; no surgery of primary site; autopsy ONLY 10 Local tumor

130

Hadamard transform image coding  

Microsoft Academic Search

The introduction of the fast Fourier transform algorithm has led to the development of the Fourier transform image coding technique whereby the two-dimensional Fourier transform of an image is transmitted over a channel rather than the image itself. This devlopement has further led to a related image coding technique in which an image is transformed by a Hadamard matrix operator.

W. K. Pratt; J. Kane; H. C. Andrews

1969-01-01

131

Lichenase and coding sequences  

DOEpatents

The present invention provides a fungal lichenase, i.e., an endo-1,3-1,4-.beta.-D-glucanohydrolase, its coding sequence, recombinant DNA molecules comprising the lichenase coding sequences, recombinant host cells and methods for producing same. The present lichenase is from Orpinomyces PC-2.

Li, Xin-Liang (Athens, GA); Ljungdahl, Lars G. (Athens, GA); Chen, Huizhong (Lawrenceville, GA)

2000-08-15

132

International Code Council  

NSDL National Science Digital Library

The International Code Council is �a membership association dedicated to building safety and fire prevention, develops the codes used to construct residential and commercial buildings, including homes and schools. Most U.S. cities, counties and states that adopt codes choose the International Codes developed by the International Code Council.� Although some sections of the site are reserved for members only (which requires a fee), there is a remarkable amount of material available to non-members. Available on the website are details about codes development, how to acquire an opinion on a code from multiple sources and how to reach a building code liaison for your locality. Under the �Certification and Testing� tab, users can find sample certification exam questions as well as outlines. The site also provides links to various periodicals, ICC meetings and also includes an event calendar to see dates for industry conferences and upcoming trade shows.

2006-12-04

133

Corpus Uteri Surgery Codes  

Cancer.gov

Corpus Uteri C540–C559 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) [SEER Note: Do not code dilation and curettage (D&C) as Surgery of Primary Site for invasive cancers] Codes 00 None; no surgery

134

Synthesizing Certified Code  

NASA Technical Reports Server (NTRS)

Code certification is a lightweight approach to demonstrate software quality on a formal level. Its basic idea is to require producers to provide formal proofs that their code satisfies certain quality properties. These proofs serve as certificates which can be checked independently. Since code certification uses the same underlying technology as program verification, it also requires many detailed annotations (e.g., loop invariants) to make the proofs possible. However, manually adding theses annotations to the code is time-consuming and error-prone. We address this problem by combining code certification with automatic program synthesis. We propose an approach to generate simultaneously, from a high-level specification, code and all annotations required to certify generated code. Here, we describe a certification extension of AUTOBAYES, a synthesis tool which automatically generates complex data analysis programs from compact specifications. AUTOBAYES contains sufficient high-level domain knowledge to generate detailed annotations. This allows us to use a general-purpose verification condition generator to produce a set of proof obligations in first-order logic. The obligations are then discharged using the automated theorem E-SETHEO. We demonstrate our approach by certifying operator safety for a generated iterative data classification program without manual annotation of the code.

Whalen, Michael; Schumann, Johann; Fischer, Bernd

2002-01-01

135

Binary concatenated coding system  

NASA Technical Reports Server (NTRS)

Coding, using 3-bit binary words, is applicable to any measurement having integer scale up to 100. System using 6-bit data words can be expanded to read from 1 to 10,000, and 9-bit data words can increase range to 1,000,000. Code may be ''read'' directly by observation after memorizing simple listing of 9's and 10's.

Monford, L. G., Jr.

1973-01-01

136

Combustion chamber analysis code  

NASA Technical Reports Server (NTRS)

A three-dimensional, time dependent, Favre averaged, finite volume Navier-Stokes code has been developed to model compressible and incompressible flows (with and without chemical reactions) in liquid rocket engines. The code has a non-staggered formulation with generalized body-fitted-coordinates (BFC) capability. Higher order differencing methodologies such as MUSCL and Osher-Chakravarthy schemes are available. Turbulent flows can be modeled using any of the five turbulent models present in the code. A two-phase, two-liquid, Lagrangian spray model has been incorporated into the code. Chemical equilibrium and finite rate reaction models are available to model chemically reacting flows. The discrete ordinate method is used to model effects of thermal radiation. The code has been validated extensively against benchmark experimental data and has been applied to model flows in several propulsion system components of the SSME and the STME.

Przekwas, A. J.; Lai, Y. G.; Krishnan, A.; Avva, R. K.; Giridharan, M. G.

1993-01-01

137

Energy Conservation Code Decoded  

SciTech Connect

Designing an energy-efficient, affordable, and comfortable home is a lot easier thanks to a slime, easier to read booklet, the 2006 International Energy Conservation Code (IECC), published in March 2006. States, counties, and cities have begun reviewing the new code as a potential upgrade to their existing codes. Maintained under the public consensus process of the International Code Council, the IECC is designed to do just what its title says: promote the design and construction of energy-efficient homes and commercial buildings. Homes in this case means traditional single-family homes, duplexes, condominiums, and apartment buildings having three or fewer stories. The U.S. Department of Energy, which played a key role in proposing the changes that resulted in the new code, is offering a free training course that covers the residential provisions of the 2006 IECC.

Cole, Pam C.; Taylor, Zachary T.

2006-09-01

138

LEXSTAT CAL. CODE. CIV. PROC. 1085 DEERING'S CALIFORNIA CODES ANNOTATED  

E-print Network

Page 1 LEXSTAT CAL. CODE. CIV. PROC. 1085 DEERING'S CALIFORNIA CODES ANNOTATED Copyright (c) 2006 IS CURRENT THROUGH THE 2007 SUPPLEMENT *** (ALL 2006 LEGISLATION) CODE OF CIVIL PROCEDURE Part 3. Special TO CALIFORNIA CODES ARCHIVE DIRECTORY Cal Code Civ Proc § 1085 (2006) § 1085. Issuing courts, and writ

Kammen, Daniel M.

139

Report number codes  

SciTech Connect

This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name.

Nelson, R.N. (ed.)

1985-05-01

140

Reflections on Post-16 Strategies in European Countries. Interim Report of the Leonardo da Vinci/Multiplier Effect Project III.3.a. Priority 2: Forging Links between Educational Establishments and Enterprises (1997-2000) ID 27009. Working Papers, No. 9.  

ERIC Educational Resources Information Center

This four-part publication contains 19 papers on educational practices and promises for post-16 education in European countries. Part I, the introduction, contains these three papers: "Sharpening Post-16 Education Strategies: Building on the Results of the Previous Projects" (Johanna Lasonen); "'Parity of Esteem' and 'Integrated…

Stenstrom, Marja-Leena, Ed.

141

[A role of robotic-assisted surgery to preserve female fertility? Comments about the first paratubal cystectomy performed with the "Da Vinci S" robotic system in a young girl].  

PubMed

In the field of adnexal surgeries in children, robotic surgery seems to make easier the realization of minimal invasive surgery. It could lead to a decrease of post-surgical adherences and therefore preserve the fertility of young patients. We report the first paratubal cystectomy performed using robotic assistance on a child in order to preserve her future fertility and discuss advantages and disadvantages of this technology. PMID:20875765

Delotte, J; Breaud, J; Mialon, O; Verger, S; Bongain, A

2010-10-01

142

Rateless Coding for Gaussian Channels  

E-print Network

A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes ...

Wornell, Gregory W.

143

Title Code Step/Grade Title Code Step/Grade  

E-print Network

Title Code Step/Grade Salary / to Title Code Step/Grade Salary / to Dist% TEMPORARY INTERCAMPUS) Code (ex: BYA, by-agreement: REG, regular pay etc) SD Fund Source to be charged (Index, Fund & Location

Tsien, Roger Y.

144

Rectosigmoid Junction Coding Guidelines  

Cancer.gov

Coding Guidelines Rectosigmoid Junction C199 Primary Site A tumor is classified as rectosigmoid when differentiation between rectum and sigmoid is not possible. A tumor is classified as rectal if • lower margin lies less than 16 cm from the anal

145

Climate Code Foundation  

E-print Network

to greater understanding, and allows us to more easily reason about the scientific principles underlying the code. a CCF project Our flagship product is ccc-gistemp, a reimplementation in Python of the NASA GISS GISTEMP surface temperature reconstruction...

Barnes, Nick; Jones, David

2011-07-05

146

Network Coding Made Practical  

E-print Network

We propose a new architecture for wireless mesh networks. In addition to forwarding packets, routers mix (i.e., code) packets from different sources to increase the information content of each transmission. We show that ...

Katti, Sachin

2006-02-16

147

No Code: Null Programs  

E-print Network

To continue the productive discussion of uninscribed artworks in Craig Dworkin’s No Medium, this report discusses, in detail, those computer programs that have no code, and are thus empty or null. Several specific examples ...

Montfort, Nick

2014-06-05

148

Seals Flow Code Development  

NASA Technical Reports Server (NTRS)

In recognition of a deficiency in the current modeling capability for seals, an effort was established by NASA to develop verified computational fluid dynamic concepts, codes, and analyses for seals. The objectives were to develop advanced concepts for the design and analysis of seals, to effectively disseminate the information to potential users by way of annual workshops, and to provide experimental verification for the models and codes under a wide range of operating conditions.

1991-01-01

149

Subband coding of images  

Microsoft Academic Search

Subband coding has become quite popular for the source encoding of speech. This paper presents a simple yet efficient extension of this concept to the source coding of images. We specify the constraints for a set of two-dimensional quadrature mirror filters (QMF's) for a particular frequency-domain partition, and show that these constraints are satisfied by a separable combination of one-dimensional

JOHN W. WOODS; S. O'Neil

1986-01-01

150

Quantum error control codes  

E-print Network

QUANTUM ERROR CONTROL CODES A Dissertation by SALAH ABDELHAMID AWAD ALY AHMED Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY May 2008 Major... Subject: Computer Science QUANTUM ERROR CONTROL CODES A Dissertation by SALAH ABDELHAMID AWAD ALY AHMED Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY...

Abdelhamid Awad Aly Ahmed, Sala

2008-10-10

151

GYRE: Stellar oscillation code  

NASA Astrophysics Data System (ADS)

GYRE is an oscillation code that solves the stellar pulsation equations (both adiabatic and non-adiabatic) using a novel Magnus Multiple Shooting numerical scheme devised to overcome certain weaknesses of the usual relaxation and shooting schemes. The code is accurate (up to 6th order in the number of grid points), robust, and makes efficient use of multiple processor cores and/or nodes.

Townsend, R. H. D.; Teitler, S.

2013-08-01

152

On modular cyclic codes  

Microsoft Academic Search

We study cyclic codes of arbitrary length N over the ring of integers modulo M. We first reduce this to the study of cyclic codes of length N=pkn (n prime to p) over the ring Zpe for prime divisors p of N. We then use the discrete Fourier transform to obtain an isomorphism ? between Zpe[X]\\/?XN-1? and a direct sum ?i?ISi

Steven T. Dougherty; Young Ho Park

2007-01-01

153

Skeleton Simplicial Evaluation Codes  

E-print Network

For a subspace arrangement over a finite field we study the evaluation code defined on the arrangement's set of points. The length of this code is given by the subspace arrangement's characteristic polynomial. For coordinate subspace arrangements, the dimension is bounded below by the face vector of the corresponding simplicial complex. The minimum distance is determined for coordinate subspace arrangements where the simplicial complex is a skeleton.

Berg, James

2011-01-01

154

Prioritized LT Codes  

NASA Technical Reports Server (NTRS)

The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.

Woo, Simon S.; Cheng, Michael K.

2011-01-01

155

Coded source neutron imaging  

SciTech Connect

Coded aperture techniques have been applied to neutron radiography to address limitations in neutron flux and resolution of neutron detectors in a system labeled coded source imaging (CSI). By coding the neutron source, a magnified imaging system is designed with small spot size aperture holes (10 and 100 m) for improved resolution beyond the detector limits and with many holes in the aperture (50% open) to account for flux losses due to the small pinhole size. An introduction to neutron radiography and coded aperture imaging is presented. A system design is developed for a CSI system with a development of equations for limitations on the system based on the coded image requirements and the neutron source characteristics of size and divergence. Simulation has been applied to the design using McStas to provide qualitative measures of performance with simulations of pinhole array objects followed by a quantitative measure through simulation of a tilted edge and calculation of the modulation transfer function (MTF) from the line spread function. MTF results for both 100um and 10um aperture hole diameters show resolutions matching the hole diameters.

Bingham, Philip R [ORNL; Santos-Villalobos, Hector J [ORNL

2011-01-01

156

Non-Residential Energy Code National and Regional Codes  

E-print Network

Non-Residential Energy Code Comparison National and Regional Codes David Baylon Mike Kennedy #12 Energy Codes in the PNW ­ Oregon State Energy Code (OSEC) ­ Washington Non-Residential Energy Code (NREC;LPDs for Key Occupancies 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 Retail Schools buildings,school

157

Quantum Secret Authentication Code  

E-print Network

This study proposes a quantum secret authentication code for protecting the integrity of secret quantum states. Since BB84[1] was first proposed, the eavesdropper detection strategy in almost all quantum cryptographic protocols is based on the random sample discussion, in which the probability of eavesdropper detection is depending on the number of check qubits eavesdropped by the eavesdropper. Hence, if the eavesdropper interferes only a few qubits of the transmitted quantum sequence, then the detection probability will be very low. This study attempts to propose a quantum secret authentication code to solve this problem. With the use of quantum secret authentication code, not only is the probability of eavesdropper detection guaranteed to be evenly distributed no matter how many qubits had been eavesdropped, but also can the quantum transmission efficiency be highly enhanced.

Tong-Xuan Wei; Tzonelih Hwang; Chia-Wei Tsai

2011-08-17

158

Seals Code Development Workshop  

NASA Technical Reports Server (NTRS)

Seals Workshop of 1995 industrial code (INDSEAL) release include ICYL, GCYLT, IFACE, GFACE, SPIRALG, SPIRALI, DYSEAL, and KTK. The scientific code (SCISEAL) release includes conjugate heat transfer and multidomain with rotordynamic capability. Several seals and bearings codes (e.g., HYDROFLEX, HYDROTRAN, HYDROB3D, FLOWCON1, FLOWCON2) are presented and results compared. Current computational and experimental emphasis includes multiple connected cavity flows with goals of reducing parasitic losses and gas ingestion. Labyrinth seals continue to play a significant role in sealing with face, honeycomb, and new sealing concepts under investigation for advanced engine concepts in view of strict environmental constraints. The clean sheet approach to engine design is advocated with program directions and anticipated percentage SFC reductions cited. Future activities center on engine applications with coupled seal/power/secondary flow streams.

Hendricks, Robert C. (Compiler); Liang, Anita D. (Compiler)

1996-01-01

159

Diameter determinations from VINCI using global  

E-print Network

at least 15 times and on at least 5 separate nights, providing a fruitful database for cross, is challenged in the present work. No a priori diameters are input to the algorithm, which relies on baseline departures from that model. In about 20 cases, we detect a "zero- baseline power" significantly smaller than

Meisner, Jeff

160

Code inspection instructional validation  

NASA Technical Reports Server (NTRS)

The Shuttle Data Systems Branch (SDSB) of the Flight Data Systems Division (FDSD) at Johnson Space Center contracted with Southwest Research Institute (SwRI) to validate the effectiveness of an interactive video course on the code inspection process. The purpose of this project was to determine if this course could be effective for teaching NASA analysts the process of code inspection. In addition, NASA was interested in the effectiveness of this unique type of instruction (Digital Video Interactive), for providing training on software processes. This study found the Carnegie Mellon course, 'A Cure for the Common Code', effective for teaching the process of code inspection. In addition, analysts prefer learning with this method of instruction, or this method in combination with other methods. As is, the course is definitely better than no course at all; however, findings indicate changes are needed. Following are conclusions of this study. (1) The course is instructionally effective. (2) The simulation has a positive effect on student's confidence in his ability to apply new knowledge. (3) Analysts like the course and prefer this method of training, or this method in combination with current methods of training in code inspection, over the way training is currently being conducted. (4) Analysts responded favorably to information presented through scenarios incorporating full motion video. (5) Some course content needs to be changed. (6) Some content needs to be added to the course. SwRI believes this study indicates interactive video instruction combined with simulation is effective for teaching software processes. Based on the conclusions of this study, SwRI has outlined seven options for NASA to consider. SwRI recommends the option which involves creation of new source code and data files, but uses much of the existing content and design from the current course. Although this option involves a significant software development effort, SwRI believes this option will produce the most effective results.

Orr, Kay; Stancil, Shirley

1992-01-01

161

Active Distances for Convolutional Codes  

Microsoft Academic Search

Abstract— A family of active distance measures for general convolutional codes is defined. These distances are generalizations of the extended distances introduced by Thommesen and Justesen for unit memory,convolutional codes. It is shown that the error correcting capability of a convolutional code is determined by the active distances. The ensemble of periodically time-varying convolutional codes is defined and lower bounds

Stefan Höst; Rolf Johannesson; Kamil Sh. Zigangirov; Victor V. Zyablov

1999-01-01

162

Ascetic convolutional codes yvind Ytrehus  

E-print Network

convolutional codes were created, all the little convolutional code children were assigned the following task Hamming Distance. Every little (n = 8; k = 6; = 1) convolutional code distributed vectors from all of Fn 2 over their trellis edges. Ah, well, not quite everyone. One little code only selected even- weight

Ytrehus, Ã?yvind

163

Coding for reliable satellite communications  

NASA Technical Reports Server (NTRS)

Several error control coding techniques for reliable satellite communications were investigated to find algorithms for fast decoding of Reed-Solomon codes in terms of dual basis. The decoding of the (255,223) Reed-Solomon code, which is used as the outer code in the concatenated TDRSS decoder, was of particular concern.

Lin, S.

1984-01-01

164

Quick response codes and libraries  

Microsoft Academic Search

Purpose – This paper aims to explain the nature of quick response (QR) codes and their possible applications in libraries. Design\\/methodology\\/approach – Existing uses, applications, and functionality of QR codes are looked at, before turning to the limited existing use of QR codes in libraries. The author then suggests many different ways QR codes could be used in our libraries.

Andrew Walsh

2009-01-01

165

Free2Code  

NSDL National Science Digital Library

This website contains a wide variety of computer related tutorials ranging from specific programming languages and operating systems to computer networking and Web development. Submitted by members of the Free2Code community, the tutorials vary in style and can be general introductions to a broad topic or they can focus on a particular aspect of an application. Some popular tutorials that fall into the former category include Number Systems, PHP and MySQL, and an Introduction to Flash MX Design. A code archive is also available to help programmers with common problems.

166

Aeroacoustic Prediction Codes  

NASA Technical Reports Server (NTRS)

This report describes work performed on Contract NAS3-27720AoI 13 as part of the NASA Advanced Subsonic Transport (AST) Noise Reduction Technology effort. Computer codes were developed to provide quantitative prediction, design, and analysis capability for several aircraft engine noise sources. The objective was to provide improved, physics-based tools for exploration of noise-reduction concepts and understanding of experimental results. Methods and codes focused on fan broadband and 'buzz saw' noise and on low-emissions combustor noise and compliment work done by other contractors under the NASA AST program to develop methods and codes for fan harmonic tone noise and jet noise. The methods and codes developed and reported herein employ a wide range of approaches, from the strictly empirical to the completely computational, with some being semiempirical analytical, and/or analytical/computational. Emphasis was on capturing the essential physics while still considering method or code utility as a practical design and analysis tool for everyday engineering use. Codes and prediction models were developed for: (1) an improved empirical correlation model for fan rotor exit flow mean and turbulence properties, for use in predicting broadband noise generated by rotor exit flow turbulence interaction with downstream stator vanes: (2) fan broadband noise models for rotor and stator/turbulence interaction sources including 3D effects, noncompact-source effects. directivity modeling, and extensions to the rotor supersonic tip-speed regime; (3) fan multiple-pure-tone in-duct sound pressure prediction methodology based on computational fluid dynamics (CFD) analysis; and (4) low-emissions combustor prediction methodology and computer code based on CFD and actuator disk theory. In addition. the relative importance of dipole and quadrupole source mechanisms was studied using direct CFD source computation for a simple cascadeigust interaction problem, and an empirical combustor-noise correlation model was developed from engine acoustic test results. This work provided several insights on potential approaches to reducing aircraft engine noise. Code development is described in this report, and those insights are discussed.

Gliebe, P; Mani, R.; Shin, H.; Mitchell, B.; Ashford, G.; Salamah, S.; Connell, S.; Huff, Dennis (Technical Monitor)

2000-01-01

167

The Code Project  

NSDL National Science Digital Library

The Code Project is an online repository of free tutorials, source code, and articles about a wide variety of programming languages. Sections devoted to C++, HTML, DirectX, and .NET are among the resources available on the site. Discussion forums and message boards are excellent places for developers to get quick answers to their questions from other members of the community (this requires a short registration). Featured articles and industry news keep the site up-to-date. There are some advertisements on the site, but they do not detract from the content.

2007-07-25

168

Coding for Cooperative Communications  

E-print Network

length k sequence X involves mapping the sequence to its corresponding n-bit syndrome. Thus the compression rate is given as RSW = nk and is related to the rate 12 R of the parity-check code as R = k ? nk = 1 ? RSW . The syndrome sequence, which... be recovered error free if the rate R of the code is less than the overall capacity on the two virtual channels, i.e., R ? Ccorr + Cap = I(X; Y ) + 1 ? H(X) = 1 ? H(X|Y ) (2.1) Now substituting R = 1?RSW in (2.1), we obtain the condition for error free...

Uppal, Momin Ayub

2011-10-21

169

What's coming in 2012 codes  

E-print Network

The 2012 IECC America?s Model Building Energy Code November 9, 2011 Presentation to Clean Air Through Energy Efficiency Conference Dallas, TX Eric Lacey Responsible Energy Codes Alliance Responsible Energy Codes Alliance ? A broad... ? Southeast Energy Efficiency Alliance ? Southwest Energy Efficiency Project Why Building Energy Codes Matter Why Building Energy Codes Matter ? Share of Energy Consumed by Major Sectors of the Economy (2010) Source: U.S. Energy Information...

Lacey, E

2011-01-01

170

Bladder Surgery Codes  

Cancer.gov

Bladder C670–C679 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 10 Local tumor destruction, NOS 11 Photodynamic therapy (PDT) 12

171

Liver Surgery Codes  

Cancer.gov

Liver and Intrahepatic Bile Ducts C220–C221 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 10 Local tumor destruction, NOS 11 Photodynamic

172

Lung Surgery Codes  

Cancer.gov

Lung C340–C349 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 19 Local tumor destruction or excision, NOS Unknown whether a specimen was

173

Lymph Nodes Surgery Codes  

Cancer.gov

Lymph Nodes C770–C779 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 19 Local tumor destruction or excision, NOS Unknown whether a specimen

174

Breast Surgery Codes  

Cancer.gov

Brea st C500–C509 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 19 Local tumor destruction, NOS No specimen was sent to pathology for

175

Thyroid Surgery Codes  

Cancer.gov

Thyroid Gland C739 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 13 Local tumor destruction, NOS No specimen sent to pathology from surgical

176

Spleen Surgery Codes  

Cancer.gov

Spleen C42.2 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 19 Local tumor destruction, NOS Unknown whether a specimen was sent to pathology

177

George Washington's Secret Code  

NSDL National Science Digital Library

In this online interactive, learners decipher codes used by George Washington to safeguard messages during the American Revolution. Learners use a key to decode an excerpt from "Rules of Civility & Decent Behaviour in Company and Conversation," which Washington copied as a writing exercise when he was a teenager and historians believed influenced the development of his character.

Service, National P.

2011-08-20

178

Parotid Surgery Codes  

Cancer.gov

Parotid and Other Unspecified Glands Parotid Gland C079, Major Salivary Glands C080–C089 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY

179

Rectum Surgery Codes  

Cancer.gov

Rectum C209 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Code removal/surgical ablation of single or multiple liver metastases under the data item Surgical Procedure/Other Site (NAACCR Item #1294)

180

Larynx Surgery Codes  

Cancer.gov

Larynx C320–C329 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 10 Local tumor destruction, NOS 11 Photodynamic therapy (PDT) 12 Electrocautery;

181

Stomach Surgery Codes  

Cancer.gov

Stomach C160–C169 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 10 Local tumor destruction, NOS 11 Photodynamic therapy (PDT) 12 Electrocautery;

182

Colon Surgery Codes  

Cancer.gov

Colon C180–C189 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Code removal/surgical ablation of single or multiple liver metastases under the data item Surgical Procedure/Other Site (NAACCR Item

183

Esophagus Surgery Codes  

Cancer.gov

Esophagus C150–C159 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 10 Local tumor destruction, NOS 11 Photodynamic therapy (PDT) 12

184

Colon Surgery Codes  

Cancer.gov

C olon C180–C189 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Code removal/surgical ablation of single or multiple liver metastases under the data item Surgical Procedure/Other Site (NAACCR Item

185

Pharynx Surgery Codes  

Cancer.gov

Pharynx Tonsil C090–C099, Oropharynx C100–C109, Nasopharynx C110–C119 Pyriform Sinus C129, Hypopharynx C130–C139, Pharynx C140 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery

186

Kidney Surgery Codes  

Cancer.gov

Kidney, Renal Pelvis, and Ureter Kidney C649, Renal Pelvis C659, Ureter C669 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 10 Local tumor

187

Testis Surgery Codes  

Cancer.gov

Testi s C620–C629 (Except for M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) Codes 00 None; no surgery of primary site; autopsy ONLY 12 Local tumor destruction, NOS No specimen sent to pathology from surgical

188

Hematopoietic Surgery Codes  

Cancer.gov

Hematopoietic/Reticuloendothelial/ Immunoproliferative/Myeloproliferative Disease C420, C421, C423, C424 (with any histology) or M9727, 9733, 9741-9742, 9764-9809, 9832, 9840-9931, 9945-9946, 9950-9967, 9975-9992) (with any site) Codes 98 All

189

Profile Guided Code Positioning  

Microsoft Academic Search

This paper presents the results of our investigation of code positioning techniques using execution profile data as input into the compilation process. The primary objective of the positioning is to reduce the overhead of the instruction memory hierarchy. After initial investigation in the literature, we decided to implement two prototypes for the Hewlett-Packard Precision Architecture (PA-RISC). The first, built on

Karl Pettis; Robert C. Hansen

1990-01-01

190

Coded IR proximity detector  

Microsoft Academic Search

The coded IR proximity detector is able to generate an electrical signal when the distance between the detector and a certain object becomes shorter than a preset value. The detector may be used as an automotive indicator and control. The detector consists of four parts: a controller, a transmitter, a receiver and the optical system, used both for transmission and

Tudor Zisu; Sorin Miclos

2001-01-01

191

Code Aware Resource Management  

Microsoft Academic Search

Multithreaded programs coordinate their interaction through synchronization primitives like mutexes and semaphores, which are managed by an OS-provided resource manager. We propose algorithms for the auto- matic construction of code-aware resource managers for multithreaded embedded applications. Such managers use knowledge about the structure and resource usage (mutex and semaphore usage) of the threads to guarantee deadlock freedom and progress while

Luca de Alfaro; Vishwanath Raman; Marco Faella; Rupak Majumdar

2005-01-01

192

Dress Codes and Uniforms.  

ERIC Educational Resources Information Center

Students do not always make choices that adults agree with in their choice of school dress. Dress-code issues are explored in this Research Roundup, and guidance is offered to principals seeking to maintain a positive school climate. In "Do School Uniforms Fit?" Kerry White discusses arguments for and against school uniforms and summarizes the…

Lumsden, Linda; Miller, Gabriel

2002-01-01

193

Esophagus Coding Guidelines  

Cancer.gov

Coding Guidelines ESOPHAGUS C150-C155, C158-C159 Primary Site There are two systems that divide the esophagus into three subsites. The first system divides the esophagus into the upper third, middle third, and lower third. The second system describes

194

Odor Coding Sensor  

NASA Astrophysics Data System (ADS)

Odor is a one of important sensing parameters for human life. However, odor has not been quantified by a measuring instrument because of its vagueness. In this paper, a measuring of odor with odor coding, which are vector quantities of plural odor molecular information, and its applications are described.

Hayashi, Kenshi

195

CODE OF FEDERAL REGULATIONS  

EPA Science Inventory

The Code of Federal Regulations (CFR) is an annually revised codification of the general and permanent rules published in the Federal Register by the executive departments and agencies of the Federal Government. The CFR is divided into 50 titles which represent broad areas subje...

196

Code Games for Kids  

NSDL National Science Digital Library

This interactive game for children promotes pattern recognition by identifying the missing numbers in a pattern displayed on a safe lock. Players drag number tiles into the gaps and if successful unlock the safe and move onto a different challenge. There are two practice rounds and then ten codes to crack.

2013-01-01

197

Wyner-Ziv coding based on TCQ and LDPC codes and extensions to multiterminal source coding  

E-print Network

Driven by a host of emerging applications (e.g., sensor networks and wireless video), distributed source coding (i.e., Slepian-Wolf coding, Wyner-Ziv coding and various other forms of multiterminal source coding), has recently become a very active...

Yang, Yang

2005-11-01

198

Suboptimum decoding of block codes  

NASA Technical Reports Server (NTRS)

This paper investigates a class of decomposable codes, their distance and structural properties. it is shown that this class includes several classes of well known and efficient codes as subclasses. Several methods for constructing decomposable codes or decomposing codes are presented. A two-stage soft decision decoding scheme for decomposable codes, their translates or unions of translates is devised. This two-stage soft-decision decoding is suboptimum, and provides an excellent trade-off between the error performance and decoding complexity for codes of moderate and long block length.

Lin, Shu; Kasami, Tadao

1991-01-01

199

On code parameters and coding vector representation for practical RLNC  

E-print Network

Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the encoding vector. Increasing ...

Heide, Janus

200

Reading a neural code.  

PubMed

Traditional approaches to neural coding characterize the encoding of known stimuli in average neural responses. Organisms face nearly the opposite task--extracting information about an unknown time-dependent stimulus from short segments of a spike train. Here the neural code was characterized from the point of view of the organism, culminating in algorithms for real-time stimulus estimation based on a single example of the spike train. These methods were applied to an identified movement-sensitive neuron in the fly visual system. Such decoding experiments determined the effective noise level and fault tolerance of neural computation, and the structure of the decoding algorithms suggested a simple model for real-time analog signal processing with spiking neurons. PMID:2063199

Bialek, W; Rieke, F; de Ruyter van Steveninck, R R; Warland, D

1991-06-28

201

The NIMROD Code  

NASA Astrophysics Data System (ADS)

NIMROD is a new code system that is being developed for the analysis of modern fusion experiments. It is being designed from the beginning to make the maximum use of massively parallel computer architectures and computer graphics. The NIMROD physics kernel solves the three-dimensional, time-dependent two-fluid equations with neo-classical effects in toroidal geometry of arbitrary poloidal cross section. The NIMROD system also includes a pre-processor, a grid generator, and a post processor. User interaction with NIMROD is facilitated by a modern graphical user interface (GUI). The NIMROD project is using Quality Function Deployment (QFD) team management techniques to minimize re-engineering and reduce code development time. This paper gives an overview of the NIMROD project. Operation of the GUI is demonstrated, and the first results from the physics kernel are given.

Schnack, D. D.; Glasser, A. H.

1996-11-01

202

Trellis coded vector quantization for the intraframe coding of images  

E-print Network

TRELLIS CODED VECTOR QUANTI'/ATION FOR THE INTRAFRAME CODING OF IMAGES A Thesis TODD HENRY CHAUVIN Submitted to the OITice of Graduate Studies of Texas ASM University in partial fulfillment of the requirements for the degree of MASTER... OF SCIENCE December 1989 Major Subject: Electrical Engineering TRELLIS CODED VECTOR QUANTIZATION FOR THE INTRAFRAME CODING OF IMAGES A Thesis by TODD Id. CHAUVIN Approved as to style and content by: T. R. Fischer (Chair of Committee) P. E. Cantrell...

Chauvin, Todd Henry

2012-06-07

203

Color-coded Continents  

NSDL National Science Digital Library

Paleogeographic reconstructions for time periods within 620 million years to present are featured on this site. These global paleogeographic maps are viewed by scrolling down the page and are arranged in order of increasing age beginning with the present. Landmasses are color-coded to illustrate the movement of plates through time. The site also discusses how the maps are constructed and what lines of evidence are most commonly used, and includes several links to additional information.

Scotese, C.; Survey, United S.

204

Reeds computer code  

NASA Technical Reports Server (NTRS)

The REEDS (rocket exhaust effluent diffusion single layer) computer code is used for the estimation of certain rocket exhaust effluent concentrations and dosages and their distributions near the Earth's surface following a rocket launch event. Output from REEDS is used in producing near real time air quality and environmental assessments of the effects of certain potentially harmful effluents, namely HCl, Al2O3, CO, and NO.

Bjork, C.

1981-01-01

205

Profile guided code positioning  

Microsoft Academic Search

This paper presents the results of our investigation of code positioning techniques using execution profile data as input into the compilation process. The primary objective of the positioning is to reduce the overhead of the instruction memory hierarchy.After initial investigation in the literature, we decided to implement two prototypes for the Hewlett-Packard Precision Architecture (PA-RISC). The first, built on top

Karl Pettis; Robert C. Hansen; Jack W. Davidson

2004-01-01

206

Status of MARS Code  

SciTech Connect

Status and recent developments of the MARS 14 Monte Carlo code system for simulation of hadronic and electromagnetic cascades in shielding, accelerator and detector components in the energy range from a fraction of an electronvolt up to 100 TeV are described. these include physics models both in strong and electromagnetic interaction sectors, variance reduction techniques, residual dose, geometry, tracking, histograming. MAD-MARS Beam Line Build and Graphical-User Interface.

N.V. Mokhov

2003-04-09

207

subject identification code list  

Microsoft Academic Search

\\u000a syn. patient log list, patient log book; code used in lieu of the subject’s name; “to document that investigator\\/ institution keeps a confidential list of names of all subjects allocated to trial numbers on\\u000a enrolling in the trial” and “to permit identification of all subjects enrolled in the trial in case follow-up is required.\\u000a The list should be kept in

Gerhard Nahler

208

VAC: Versatile Advection Code  

NASA Astrophysics Data System (ADS)

The Versatile Advection Code (VAC) is a freely available general hydrodynamic and magnetohydrodynamic simulation software that works in 1, 2 or 3 dimensions on Cartesian and logically Cartesian grids. VAC runs on any Unix/Linux system with a Fortran 90 (or 77) compiler and Perl interpreter. VAC can run on parallel machines using either the Message Passing Interface (MPI) library or a High Performance Fortran (HPF) compiler.

Tóth, Gábor; Keppens, Rony

2012-07-01

209

Bar coded retroreflective target  

DOEpatents

This small, inexpensive, non-contact laser sensor can detect the location of a retroreflective target in a relatively large volume and up to six degrees of position. The tracker's laser beam is formed into a plane of light which is swept across the space of interest. When the beam illuminates the retroreflector, some of the light returns to the tracker. The intensity, angle, and time of the return beam is measured to calculate the three dimensional location of the target. With three retroreflectors on the target, the locations of three points on the target are measured, enabling the calculation of all six degrees of target position. Until now, devices for three-dimensional tracking of objects in a large volume have been heavy, large, and very expensive. Because of the simplicity and unique characteristics of this tracker, it is capable of three-dimensional tracking of one to several objects in a large volume, yet it is compact, light-weight, and relatively inexpensive. Alternatively, a tracker produces a diverging laser beam which is directed towards a fixed position, and senses when a retroreflective target enters the fixed field of view. An optically bar coded target can be read by the tracker to provide information about the target. The target can be formed of a ball lens with a bar code on one end. As the target moves through the field, the ball lens causes the laser beam to scan across the bar code.

Vann, Charles S. (Fremont, CA)

2000-01-01

210

Orthopedics coding and funding.  

PubMed

The French tarification à l'activité (T2A) prospective payment system is a financial system in which a health-care institution's resources are based on performed activity. Activity is described via the PMSI medical information system (programme de médicalisation du système d'information). The PMSI classifies hospital cases by clinical and economic categories known as diagnosis-related groups (DRG), each with an associated price tag. Coding a hospital case involves giving as realistic a description as possible so as to categorize it in the right DRG and thus ensure appropriate payment. For this, it is essential to understand what determines the pricing of inpatient stay: namely, the code for the surgical procedure, the patient's principal diagnosis (reason for admission), codes for comorbidities (everything that adds to management burden), and the management of the length of inpatient stay. The PMSI is used to analyze the institution's activity and dynamism: change on previous year, relation to target, and comparison with competing institutions based on indicators such as the mean length of stay performance indicator (MLS PI). The T2A system improves overall care efficiency. Quality of care, however, is not presently taken account of in the payment made to the institution, as there are no indicators for this; work needs to be done on this topic. PMID:24461230

Baron, S; Duclos, C; Thoreux, P

2014-02-01

211

Space time coded code division multiplexing on SC140 DSP  

E-print Network

is implemented on StarCore's SC140 fixed-point DSP core. The very large instruction word architecture of the SC140 is utilized to efficiently implement space-time coded code-division multiplexing system. The goal is to evaluate the suitability of space-time coded...

Menon, Murali P

2012-06-07

212

Near optimum error correcting coding and decoding: turbo-codes  

Microsoft Academic Search

This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently

Claude Berrou; Alain Glavieux

1996-01-01

213

New optimal asymmetric quantum codes from constacyclic codes  

NASA Astrophysics Data System (ADS)

In this paper, we construct two classes of asymmetric quantum codes by using constacyclic codes. The first class is the asymmetric quantum codes with parameters [[q2 + 1, q2 + 1 - 2(t + k + 1), (2k + 2)/(2t + 2)

Zhang, Guanghui; Chen, Bocong; Li, Liangchen

2014-06-01

214

Arithmetic coding for data compression  

Microsoft Academic Search

The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives greater compression, is faster for adaptive models, and clearly separates the model from the channel encoding.

Ian H. witten; Radford M. Neal; John Gerald Cleary

1987-01-01

215

MHDEMP Code Simulation of Starfish.  

National Technical Information Service (NTIS)

The magnetic field variations on the ground after Starfish are calculated by the MHDEMP code using input parameters produced by the MICE code. The results agree well with the experimental data at Johnston Island. These magnetic field variations extend ove...

C. L. Longmire, R. W. Kilb, S. Chavin, W. F. Crevier

1979-01-01

216

Matlab-Kinect Interface Code  

E-print Network

This .zip file contains code and installation instructions for acquiring 3d arm movements in Matlab using the Microsoft Kinect 3d camera. The provided code has been validated in 32-bit and 64-bit Matlab with 32-bit and ...

Kowalski, Kevin

2012-06-01

217

Code Completion From Abbreviated Input  

E-print Network

Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated input - a different approach from conventional ...

Miller, Robert C.

218

Quantum codes on Hurwitz surfaces  

E-print Network

Ever since the birth of the first quantum error correcting code, many error correcting techniques and formalism has been constructed so far. Among those, generating a quantum code on a locally planar geometry have lead to ...

Kim, Isaac H. (Isaac Hyun)

2007-01-01

219

Open code for open science?  

NASA Astrophysics Data System (ADS)

Open source software is often seen as a path to reproducibility in computational science. In practice there are many obstacles, even when the code is freely available, but open source policies should at least lead to better quality code.

Easterbrook, Steve M.

2014-11-01

220

Design of proximity detecting codes  

E-print Network

a four-phase asynchronous communication protocol (or other similar protocols). A non-trivial t-proximity detecting code must be unordered. However, not all unordered codes are t-proximity detecting. This thesis analyzes the designs and bounds...

Perisetty, Srinivas

2012-06-07

221

Network coding for anonymous broadcast  

E-print Network

This thesis explores the use of network coding for anonymous broadcast. Network coding, the technique of transmitting or storing mixtures of messages rather than individual messages, can provide anonymity with its mixing ...

Sergeev, Ivan A

2013-01-01

222

Indeterminate-length quantum coding  

E-print Network

The quantum analogues of classical variable-length codes are indeterminate-length quantum codes, in which codewords may exist in superpositions of different lengths. This paper explores some of their properties. The length observable for such codes is governed by a quantum version of the Kraft-McMillan inequality. Indeterminate-length quantum codes also provide an alternate approach to quantum data compression.

Benjamin Schumacher; Michael D. Westmoreland

2000-11-02

223

Time Dependence in Plasma Codes  

E-print Network

Time-dependent plasma codes are a natural extension of static nonequilibrium plasma codes. Comparing relevant timescales will determine whether or not time-dependent treatment is necessary. In this article I outline the ingredients for a time-dependent plasma code in a homogeneous medium and discuss the computational method. In the second half of the article I describe recombination in the early Universe as a detailed example of a problem whose solution requires a time-dependent plasma code.

S. Seager

2001-06-12

224

The ISO audio coding standard  

Microsoft Academic Search

An ISO audio coding standard is being developed that will provide an audio quality comparable to that of a compact disc using a reduced bit rate of about 2×128 kb\\/s for a stereo sound signal instead of 2×706 kb\\/s. Four coding algorithms have been considered in order to develop the audio coding standard. Two of these coding algorithms have been

H. G. Musmann

1990-01-01

225

A Binary Coded Decimal Converter  

Microsoft Academic Search

Of the many different coding schemes possible, the 8-4-2-1 binary decimal code was felt to be the most useful for data handling systems. A transducer wes developed for converting shaft positions to digital numbers in this code. The converter is small, light weight, and produces 10,000 binary coded decimal numbers in 100 revolutions of the input shaft. No ambiguity of

Martin Ziserman

1956-01-01

226

Noiseless Coding Of Magnetometer Signals  

NASA Technical Reports Server (NTRS)

Report discusses application of noiseless data-compression coding to digitized readings of spaceborne magnetometers for transmission back to Earth. Objective of such coding to increase efficiency by decreasing rate of transmission without sacrificing integrity of data. Adaptive coding compresses data by factors ranging from 2 to 6.

Rice, Robert F.; Lee, Jun-Ji

1989-01-01

227

Dual Coding, Reasoning and Fallacies.  

ERIC Educational Resources Information Center

Develops the theory that a fallacy is not a comparison of a rhetorical text to a set of definitions but a comparison of one person's cognition with another's. Reviews Paivio's dual coding theory, relates nonverbal coding to reasoning processes, and generates a limited fallacy theory based on dual coding theory. (PD)

Hample, Dale

1982-01-01

228

Rotationally invariant multilevel block codes  

E-print Network

The objective of this thesis is to evaluate the performance of block codes that are designed to be rotationally invariant, in a multilevel coding scheme, over a channel modelled to be white gaussian noise. Also, the use of non-binary codes...

Kulandaivelu, Anita

2012-06-07

229

Code and data files for \\  

Microsoft Academic Search

There are 21 codes to solve the model and deliver the results in the paper. They are grouped in 4 categories: 1) 4 codes that deliver the main results in the paper and the distribution of initial characteristics. Note that this is the last step in the algorithm. 2) 3 codes that are used to solve for the no college

Felicia Ionescu

2008-01-01

230

Coding Issues in Grounded Theory  

ERIC Educational Resources Information Center

This paper discusses grounded theory as one of the qualitative research designs. It describes how grounded theory generates from data. Three phases of grounded theory--open coding, axial coding, and selective coding--are discussed, along with some of the issues which are the source of debate among grounded theorists, especially between its…

Moghaddam, Alireza

2006-01-01

231

Hu man minimum redundancy coding  

E-print Network

14 Hu#11;man minimum redundancy coding It has become usual to store data and transmit messages a particular coded text. In a classic paper, published in 1952, David Hu#11;man described an algorithm to #12;nd the set of codes that would minimize the expected length 175 #12; 176 Hu#11;man minimum redundancy

Jones, Geraint

232

Low Density Parity Check Codes: Bandwidth Efficient Channel Coding  

NASA Technical Reports Server (NTRS)

Low Density Parity Check (LDPC) Codes provide near-Shannon Capacity performance for NASA Missions. These codes have high coding rates R=0.82 and 0.875 with moderate code lengths, n=4096 and 8176. Their decoders have inherently parallel structures which allows for high-speed implementation. Two codes based on Euclidean Geometry (EG) were selected for flight ASIC implementation. These codes are cyclic and quasi-cyclic in nature and therefore have a simple encoder structure. This results in power and size benefits. These codes also have a large minimum distance as much as d,,, = 65 giving them powerful error correcting capabilities and error floors less than lo- BER. This paper will present development of the LDPC flight encoder and decoder, its applications and status.

Fong, Wai; Lin, Shu; Maki, Gary; Yeh, Pen-Shu

2003-01-01

233

dc-free coset codes  

NASA Technical Reports Server (NTRS)

A class of block coset codes with disparity and run-length constraints are studied. They are particularly well suited for high-speed optical fiber links and similar channels, where dc-free pulse formats, channel error control, and low-complexity encoder-decoder implementations are required. The codes are derived by partitioning linear block codes. The encoder and decoder structures are the same as those of linear block codes with only slight modifications. A special class of dc-free coset block codes are derived from BCH codes with specified bounds on minimum distance, disparity, and run length. The codes have low disparity levels (a small running digital sum) and good error-correcting capabilities.

Deng, Robert H.; Herro, Mark A.

1988-01-01

234

Diagonal Eigenvalue Unity (DEU) code for spectral amplitude coding-optical code division multiple access  

NASA Astrophysics Data System (ADS)

Code with ideal in-phase cross correlation (CC) and practical code length to support high number of users are required in spectral amplitude coding-optical code division multiple access (SAC-OCDMA) systems. SAC systems are getting more attractive in the field of OCDMA because of its ability to eliminate the influence of multiple access interference (MAI) and also suppress the effect of phase induced intensity noise (PIIN). In this paper, we have proposed new Diagonal Eigenvalue Unity (DEU) code families with ideal in-phase CC based on Jordan block matrix with simple algebraic ways. Four sets of DEU code families based on the code weight W and number of users N for the combination (even, even), (even, odd), (odd, odd) and (odd, even) are constructed. This combination gives DEU code more flexibility in selection of code weight and number of users. These features made this code a compelling candidate for future optical communication systems. Numerical results show that the proposed DEU system outperforms reported codes. In addition, simulation results taken from a commercial optical systems simulator, Virtual Photonic Instrument (VPI™) shown that, using point to multipoint transmission in passive optical network (PON), DEU has better performance and could support long span with high data rate.

Ahmed, Hassan Yousif; Nisar, K. S.

2013-08-01

235

Near-optimum decoding of product codes: block turbo codes  

Microsoft Academic Search

This paper describes an iterative decoding algorithm for any product code built using linear block codes. It is based on soft-input\\/soft-output decoders for decoding the component codes so that near-optimum performance is obtained at each iteration. This soft-input\\/soft-output decoder is a Chase decoder which delivers soft outputs instead of binary decisions. The soft output of the decoder is an estimation

Ramesh Mahendra Pyndiah

1998-01-01

236

Lattice code decoder for space-time codes  

Microsoft Academic Search

We explore the lattice sphere packing representation of a multi-antenna system and the algebraic space-time (ST) codes. We apply the sphere decoding (SD) algorithm to the resulted lattice code. For the uncoded system, SD yields, with small increase in complexity, a huge improvement over the well-known V-BLAST detection algorithm. SD of algebraic ST codes exploits the full diversity of the

Oussama Damen; Ammar Chkeif; Jean-Claude Belfiore

2000-01-01

237

Some easily analyzable convolutional codes  

NASA Technical Reports Server (NTRS)

Convolutional codes have played and will play a key role in the downlink telemetry systems on many NASA deep-space probes, including Voyager, Magellan, and Galileo. One of the chief difficulties associated with the use of convolutional codes, however, is the notorious difficulty of analyzing them. Given a convolutional code as specified, say, by its generator polynomials, it is no easy matter to say how well that code will perform on a given noisy channel. The usual first step in such an analysis is to computer the code's free distance; this can be done with an algorithm whose complexity is exponential in the code's constraint length. The second step is often to calculate the transfer function in one, two, or three variables, or at least a few terms in its power series expansion. This step is quite hard, and for many codes of relatively short constraint lengths, it can be intractable. However, a large class of convolutional codes were discovered for which the free distance can be computed by inspection, and for which there is a closed-form expression for the three-variable transfer function. Although for large constraint lengths, these codes have relatively low rates, they are nevertheless interesting and potentially useful. Furthermore, the ideas developed here to analyze these specialized codes may well extend to a much larger class.

Mceliece, R.; Dolinar, S.; Pollara, F.; Vantilborg, H.

1989-01-01

238

Interframe vector wavelet coding technique  

NASA Astrophysics Data System (ADS)

Wavelet coding is often used to divide an image into multi- resolution wavelet coefficients which are quantized and coded. By 'vectorizing' scalar wavelet coding and combining this with vector quantization (VQ), vector wavelet coding (VWC) can be implemented. Using a finite number of states, finite-state vector quantization (FSVQ) takes advantage of the similarity between frames by incorporating memory into the video coding system. Lattice VQ eliminates the potential mismatch that could occur using pre-trained VQ codebooks. It also eliminates the need for codebook storage in the VQ process, thereby creating a more robust coding system. Therefore, by using the VWC coding method in conjunction with the FSVQ system and lattice VQ, the formulation of a high quality very low bit rate coding systems is proposed. A coding system using a simple FSVQ system where the current state is determined by the previous channel symbol only is developed. To achieve a higher degree of compression, a tree-like FSVQ system is implemented. The groupings are done in this tree-like structure from the lower subbands to the higher subbands in order to exploit the nature of subband analysis in terms of the parent-child relationship. Class A and Class B video sequences from the MPEG-IV testing evaluations are used in the evaluation of this coding method.

Wus, John P.; Li, Weiping

1997-01-01

239

KODNINGSTEKNIK EDI042 Error Control Coding  

E-print Network

properties. Convolutional codes and their encoders, the Smith form of polynomial encoding matrices, equivalent and basic encoding matrices, minimal - basic and minimal encoding matrices, minimal encoders encounter with convolutional codes, block codes vs. convolutional codes. Convolutional encoders - structural

240

KODNINGSTEKNIK EDI 042 Error Control Coding  

E-print Network

. Convolutional codes and their encoders, the Smith form of polynomial encoding matrices, equivalent and basic encoding matrices, minimal - basic and minimal encoding matrices, minimal encoders, syndrome formers codes, block codes vs. convolutional codes. Convolutional encoders - structural properties

241

Iterative algorithms for lossy source coding  

E-print Network

This thesis explores the problems of lossy source coding and information embedding. For lossy source coding, we analyze low density parity check (LDPC) codes and low density generator matrix (LDGM) codes for quantization ...

Chandar, Venkat (Venkat Bala)

2006-01-01

242

Absolute radiometric code (ARC)  

NASA Astrophysics Data System (ADS)

The Absolute Radiometric Code (ARC) is a collection of Matlab functions tied together under a Matlab Graphical User Interface (GUI). ARC was developed as part of the Satellite Imaging Experiment conducted by the Air Force Research Laboratory at Kirtland, AFB, in order to get fast estimates of the Optical Cross Sections of various satellites. ARC uses multiple star measures to calculate the atmospheric and optical transmission of the system. The transmissions are then used to compute the optical cross section of an object. Generally, the optical transmission of a sensor system can be characterized quite well, so it serves as a sanity check on all ARC results. The atmospheric transmission changes considerably from night to night and even from hour to hour on the same night. ARC uses a collection of calibration stars at various elevation angles to determine the atmospheric transmission through the viewing times. The star calibration is generally taken several times during the experiment period.

Riker, James F.; Roark, Jon; Stogsdill, Stephen E.; DeShetler, W. Bruce; Brunson, Richard L.

1999-08-01

243

Nonlinear, nonbinary cyclic group codes  

NASA Technical Reports Server (NTRS)

New cyclic group codes of length 2(exp m) - 1 over (m - j)-bit symbols are introduced. These codes can be systematically encoded and decoded algebraically. The code rates are very close to Reed-Solomon (RS) codes and are much better than Bose-Chaudhuri-Hocquenghem (BCH) codes (a former alternative). The binary (m - j)-tuples are identified with a subgroup of the binary m-tuples which represents the field GF(2 exp m). Encoding is systematic and involves a two-stage procedure consisting of the usual linear feedback register (using the division or check polynomial) and a small table lookup. For low rates, a second shift-register encoding operation may be invoked. Decoding uses the RS error-correcting procedures for the m-tuple codes for m = 4, 5, and 6.

Solomon, G.

1992-01-01

244

Uniqueness of Weighted Code Representations  

Microsoft Academic Search

Decimal computers ordinarily use a binary-coded decimal representation. One class of binary-coded decimal digits is the so-called four-bit weighted code representation with weights ¿1 ¿2 ¿3 ¿4. Each ¿i is a nonzero integer in the range ¿9¿¿i¿9, and the set of weights must have the property that every decimal digit can be represented by the sum ¿i=14 bi ¿i, with

G. P. Weeg

1960-01-01

245

Astrophysics Source Code Library Enhancements  

E-print Network

The Astrophysics Source Code Library (ASCL; ascl.net) is a free online registry of codes used in astronomy research; it currently contains over 900 codes and is indexed by ADS. The ASCL has recently moved a new infrastructure into production. The new site provides a true database for the code entries and integrates the WordPress news and information pages and the discussion forum into one site. Previous capabilities are retained and permalinks to ascl.net continue to work. This improvement offers more functionality and flexibility than the previous site, is easier to maintain, and offers new possibilities for collaboration. This presentation covers these recent changes to the ASCL.

Hanisch, Robert J; Berriman, G Bruce; DuPrie, Kimberly; Mink, Jessica; Nemiroff, Robert J; Schmidt, Judy; Shamir, Lior; Shortridge, Keith; Taylor, Mark; Teuben, Peter J; Wallin, John

2014-01-01

246

Arithmetic Coding for Data Compression  

E-print Network

-arithmetic coder #28neglect- ing very large and very small probabilities#29 is less than one percent for N = 32 and about 0.2 percent for N = 128. In implementations, the coding tables can be stripped down so that the numerical values of the interval endpoints...Arithmetic Coding for Data Compression PAUL G. HOWARD and JEFFREY SCOTT VITTER, fellow, ieee Arithmetic coding provides an e#0Bective mechanism for remov- ing redundancy in the encoding of data. We show how arithmetic coding works and describe an e...

Howard, Paul G.; Vitter, Jeffrey Scott

1994-01-01

247

Implementation issues in source coding  

NASA Technical Reports Server (NTRS)

An edge preserving image coding scheme which can be operated in both a lossy and a lossless manner was developed. The technique is an extension of the lossless encoding algorithm developed for the Mars observer spectral data. It can also be viewed as a modification of the DPCM algorithm. A packet video simulator was also developed from an existing modified packet network simulator. The coding scheme for this system is a modification of the mixture block coding (MBC) scheme described in the last report. Coding algorithms for packet video were also investigated.

Sayood, Khalid; Chen, Yun-Chung; Hadenfeldt, A. C.

1989-01-01

248

The FLUKA Code: An Overview  

NASA Technical Reports Server (NTRS)

FLUKA is a multipurpose Monte Carlo code which can transport a variety of particles over a wide energy range in complex geometries. The code is a joint project of INFN and CERN: part of its development is also supported by the University of Houston and NASA. FLUKA is successfully applied in several fields, including but not only, particle physics, cosmic ray physics, dosimetry, radioprotection, hadron therapy, space radiation, accelerator design and neutronics. The code is the standard tool used at CERN for dosimetry, radioprotection and beam-machine interaction studies. Here we give a glimpse into the code physics models with a particular emphasis to the hadronic and nuclear sector.

Ballarini, F.; Battistoni, G.; Campanella, M.; Carboni, M.; Cerutti, F.; Empl, A.; Fasso, A.; Ferrari, A.; Gadioli, E.; Garzelli, M. V.; Lantz, M.; Liotta, M.; Mairani, A.; Mostacci, A.; Muraro, S.; Ottolenghi, A.; Pelliccioni, M.; Pinsky, L.; Ranft, J.; Roesler, S.; Sala, P. R.; Scannicchio, D.; Trovati, S.; Villari, R.; Wilson, T.

2006-01-01

249

Understanding perception through neural "codes".  

PubMed

A major challenge for cognitive scientists is to deduce and explain the neural mechanisms of the rapid transposition between stimulus energy and recalled memory-between the specific (sensation) and the generic (perception)-in both material and mental aspects. Researchers are attempting three explanations in terms of neural codes. The microscopic code: cellular neurobiologists correlate stimulus properties with the rates and frequencies of trains of action potentials induced by stimuli and carried by topologically organized axons. The mesoscopic code: cognitive scientists formulate symbolic codes in trains of action potentials from feature-detector neurons of phonemes, lines, odorants, vibrations, faces, etc., that object-detector neurons bind into representations of stimuli. The macroscopic code: neurodynamicists extract neural correlates of stimuli and associated behaviors in spatial patterns of oscillatory fields of dendritic activity, which self-organize and evolve on trajectories through high-dimensional brain state space. This multivariate code is expressed in landscapes of chaotic attractors. Unlike other scientific codes, such as DNA and the periodic table, these neural codes have no alphabet or syntax. They are epistemological metaphors that experimentalists need to measure neural activity and engineers need to model brain functions. My aim is to describe the main properties of the macroscopic code and the grand challenge it poses: how do very large patterns of textured synchronized oscillations form in cortex so quickly? PMID:21134811

Freeman, Walter J

2011-07-01

250

The FLUKA Code: an Overview  

SciTech Connect

FLUKA is a multipurpose Monte Carlo code which can transport a variety of particles over a wide energy range in complex geometries. The code is a joint project of INFN and CERN: part of its development is also supported by the University of Houston and NASA. FLUKA is successfully applied in several fields, including but not only, particle physics, cosmic ray physics, dosimetry, radioprotection, hadron therapy, space radiation, accelerator design and neutronics. The code is the standard tool used at CERN for dosimetry, radioprotection and beam-machine interaction studies. Here we give a glimpse into the code physics models with a particular emphasis to the hadronic and nuclear sector.

Ballarini, F.; Battistoni, G.; Campanella, M.; Carboni, M.; Cerutti, F.; Empl, A.; Fasso, A.; Ferrari, A.; Gadioli, E.; Garzelli, M.V.; Lantz, M.; Liotta, M.; Mairani,; Mostacci, A.; Muraro, S.; Ottolenghi, A.; Pelliccioni, M.; Pinsky, L.; Ranft, J.; Roesler, S.; Sala, P.R.; /Milan U. /INFN, Milan /Pavia U. /INFN, Pavia /CERN /Siegen U.

2005-11-09

251

Unveiling turbo codes: some results on parallel concatenated coding schemes  

Microsoft Academic Search

A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the first encoder followed by the parity check bits of both encoders. This construction

Sergio Benedetto; Guido Montorsi

1996-01-01

252

Student ID: 2013 Code 2014 Code Unit Prerequisite Corequisite  

E-print Network

DIA10001 HDC005 DDD20004 Contemporary Design Issues Elective 3 2013 Code 2014 Code Unit Prerequisite Entrepreneurship and Prof. Development DIA30004, DIA30002, DIA10004 2.5 yrs UG study or IP HDP051 DES30061 Industry Interior Architecture Entrepreneurship & Prof. Development DIA30004, DIA30002, DIA10004 2.5 yrs UG study

Liley, David

253

Video coding using 3 dimensional DCT and dynamic code selection  

Microsoft Academic Search

Summary only given. We address the quality issue, and present a method for improved coding of the 3D DCT coefficients. Performance gain is achieved through the use of dynamically selected multiple coding algorithms. The resulting performance is excellent giving a compression ratio of greater than to 100:1 for image reproduction. The process consists of stacking 8 frames and breaking the

M. Bauer; K. Sayood

1995-01-01

254

Error-Correcting Codes in Binary-Coded-Decimal Arithmetic  

Microsoft Academic Search

Error-correcting coding schemes devised for binary arithmetic are not in general applicable to BCD arithmetic. In this paper, we investigate the new problem of using such coding schemes in BCD systems. We first discuss the general characteristics of arithmetic errors and define the arithmetic weight and distance in BCD systems. We show that the distance is a metric function. Number

Chao-kai Liu; Tse Lin Wang

1978-01-01

255

Efficient video coding based on backward coding of wavelet trees  

NASA Astrophysics Data System (ADS)

The authors present a wavelet tree-based video coding system, which is referred to as three-dimensional (3-D) backward coding of wavelet trees (BCWT). The 3-D BCWT algorithm encodes the wavelet trees from the lowest wavelet level to the highest wavelet level. All the coding steps for each wavelet coefficient are finished during one coding pass, which makes this algorithm very efficient. The coding process of the 3-D BCWT algorithm is subband by subband, so that a coefficient will be encoded only after all the coefficients in the next lower-level wavelet subbands have been encoded. The output bitstream of the encoder is therefore layered according to the wavelet level. The implementation results show that the 3-D BCWT algorithm has almost identical rate distortion performance to the well-known 3-D set partitioning in hierarchical trees (SPIHT) algorithm. However, it is computationally more efficient and uses significantly less memory than the 3-D SPIHT algorithm.

Ye, Linning; Guo, Jiangling; Nutter, Brian; Mitra, Sunanda

2012-04-01

256

Fine Granular Scalable Video Coding Using Context-Based Binary Arithmetic Coding for Bit-Plane Coding  

Microsoft Academic Search

In this paper, we propose a new efficient entropy coding scheme, namely context-based binary arithmetic coding for bit-plane coding (CBACBP), for the enhancement layer of fine granular scalable (FGS) video coding. The basic structure of proposed CBACBP is based on the traditional bit-plane coding of MPEG-4 FGS. However, in order to enhance the coding efficiency of bit-plane coding, a newly

Seung-Hwan Kim; Yo-sung Ho

2007-01-01

257

Network coding: an instant primer  

Microsoft Academic Search

Network coding is a new research area that may have inter- esting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received informa- tion. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the

Christina Fragouli; Jean-yves Le Boudec; Jörg Widmer

2006-01-01

258

Convolutional codes I: Algebraic structure  

Microsoft Academic Search

A convolutional encoder is defined as any constant linear sequential circuit. The associated code is the set of all output sequences resulting from any set of input sequences beginning at any time. Encoders are called equivalent if they generate the same code. The invariant factor theorem is used to determine when a convolutional encoder has a feedback-free inverse, and the

1970-01-01

259

Secure Symmetrical Multilevel Diversity Coding  

E-print Network

Secure symmetrical multilevel diversity coding (S-SMDC) is a source coding problem, where a total of L - N discrete memoryless sources (S1,...,S_L-N) are to be encoded by a total of L encoders. This thesis considers a natural generalization of SMDC...

Li, Shuo

2012-07-16

260

DOE Coordination Meeting CODES & STANDARDS  

E-print Network

Association's (NFPA's) hearing cycle. Facilitate in the adoption of the International Code Council's codes and adopt the revised NFPA 55 standard for hydrogen storage with data from Technology Validation projects workshops for state and local officials. 4 3Q, 2004Collaborate with ICC and NFPA to develop first

261

Practical loss-resilient codes  

Microsoft Academic Search

We present randomized constructions of linear-time en- codable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encod- ing and decoding algorithms for these codes have fast and simple software implementations. Partial implementations of our algorithms are faster by orders of magnitude than the best software implementations of any previous algorithm for this

Michael G. Luby; Michael Mitzenmacher; Mohammad Amin Shokrollahi; Daniel A. Spielman; Volker Stemann

1997-01-01

262

Quantum codes from Hadamard matrices  

Microsoft Academic Search

From each q × q unitary matrix ?, we construct a family of quantum codes , t ? 1, for q-state systems which encode (2t + 1) q-states into one q-state. We show that such codes are capable of correcting the errors of weight up to t if and only if ? is a complex Hadamard matrix.

W. F. Ke; K. F. Lai; R. B. Zhang

2010-01-01

263

EXIT charts of irregular codes  

Microsoft Academic Search

We study the convergence behavior of iterative decoding of a serially concatenated code. We rederive a existing analysis technique called EXIT chart [15] and show that for certain decoders the construction of an EXIT chart simplifies tremendously. The findings are extended such that simple irregular codes can be constructed, which can be used to improve the converence of the iterative

M. Tüchler; J. Hagenauer

2002-01-01

264

Accelerator Physics Code Web Repository  

SciTech Connect

In the framework of the CARE HHH European Network, we have developed a web-based dynamic accelerator-physics code repository. We describe the design, structure and contents of this repository, illustrate its usage, and discuss our future plans, with emphasis on code benchmarking.

Zimmermann, F.; Basset, R.; Bellodi, G.; Benedetto, E.; Dorda, U.; Giovannozzi, M.; Papaphilippou, Y.; Pieloni, T.; Ruggiero, F.; Rumolo, G.; Schmidt, F.; Todesco, E.; Zotter, B.W.; /CERN; Payet, J.; /Saclay; Bartolini, R.; /RAL, Diamond; Farvacque, L.; /ESRF, Grenoble; Sen, T.; /Fermilab; Chin, Y.H.; Ohmi, K.; Oide, K.; /KEK, Tsukuba; Furman, M.; /LBL, Berkeley /Oak Ridge /Pohang Accelerator Lab. /SLAC /TRIUMF /Tech-X, Boulder /UC, San Diego /Darmstadt, GSI /Rutherford /Brookhaven

2006-10-24

265

The FLUKA Code: an Overview  

Microsoft Academic Search

FLUKA is a multipurpose Monte Carlo code which can transport a variety of particles over a wide energy range in complex geometries. The code is a joint project of INFN and CERN: part of its development is also supported by the University of Houston and NASA. FLUKA is successfully applied in several fields, including but not only, particle physics, cosmic

F. Ballarini; G. Battistoni; M. Campanella; M. Carboni; F. Cerutti; A. Empl; A. Fasso; A. Ferrari; E. Gadioli; M. V. Garzelli; M. Lantz; M. Liotta; A. Mairani; A. Mostacci; S. Muraro; A. Ottolenghi; M. Pelliccioni; L. Pinsky; J. Ranft; S. Roesler; P. R. Sala

2005-01-01

266

The FLUKA code: an overview  

Microsoft Academic Search

FLUKA is a multipurpose MonteCarlo code which can transport a variety of particles over a wide energy range in complex geometries. The code is a joint project of INFN and CERN: part of its development is also supported by the University of Houston and NASA. FLUKA is successfully applied in several fields, including but not only, particle physics, cosmic ray

F. Ballarini; G. Battistoni; M. Campanella; M. Carboni; F. Cerutti; A. Empl; A. Fassò; A. Ferrari; E. Gadioli; M. V. Garzelli; M. Lantz; M. Liotta; A. Mairani; A. Mostacci; S. Muraro; A. Ottolenghi; M. Pelliccioni; L. Pinsky; J. Ranft; S. Roesler; P. R. Sala; D. Scannicchio; S. Trovati; R. Villari; T. Wilson; N. Zapp; V. Vlachoudis

2006-01-01

267

Stabilizer Codes over Frobenius Rings  

E-print Network

as the Frobenius rings. This thesis focuses on developing the theory of stabilizer codes over the Frobenius rings and provides a systematic construction of codes over these rings. A special class of Frobenius rings called finite chain rings will be the emphasis...

Nadella, Sushma

2012-07-16

268

Fibonacci codes for synchronization control  

Microsoft Academic Search

A new family of codes is described for representing serial binary data, subject to constraints on the maximum separation between successive changes in value(0 rightarrow 1, 1 rightarrow, or both), or between successive like digits (0's,1's, or both). These codes have application to the recording or transmission of digital data without an accompanying clock. In such cases, the clock must

WILLIAM H. KAUTZ

1965-01-01

269

Code for Hydrogen Hydrogen Pipeline  

E-print Network

pipe in hydrogen service #12;12 Hydrogen Pipeline Issues · Materials (cont'd) - Liner material for FRP development · Charge from BPTCS to B31 Standards Committee for Hydrogen Piping/Pipeline code development · B31 for Hydrogen Piping and Pipelines · B31 Hydrogen Section Committee to develop a new code for H2 piping

270

Deobfuscation Reverse Engineering Obfuscated Code  

E-print Network

with the development of obfuscation techniques that are more resilient to straightforward reverse engineering. 1Deobfuscation Reverse Engineering Obfuscated Code Sharath K. Udupa, Saumya K. Debray, Matias Madou, as a step towards reverse engineering such programs. Our results indicate that much of the effects of code

Debray, Saumya

271

(significance maps) (distributed source coding;  

E-print Network

-- SPIHT Wyner-Ziv (significance maps) 1 (distributed source coding; DSC) 1970 Slepian Wolf (noiseless coding of correlated information sources)[1] DSC (sensor networks) DSC ),( YXH ),( YXH )()( YHXH + DSC XY (joint decoding) ),( YXH DSC Slepian-Wolf Wyner-Ziv Wyner

Yang, Shih-Hsuan

272

Constructions of Mixed Covering Codes.  

National Technical Information Service (NTIS)

In the work construction methods for so called mixed covering codes are developed. There has been considerable recent growth in the interest in covering codes. They have the property that all words in the space are within a given Hamming distance, called ...

P. R. J. Oestergaerd, L. Ojla

1991-01-01

273

National Transport Code Collaboration (NTCC)  

NASA Astrophysics Data System (ADS)

Progress continues toward achieving NTCC goals, which include the development of -- a library of modules which satisfy clearly defined standards, a framework using modern computer languages to write transport codes, a Web-invocable data server and demonstration code, and an education program to utilize modern computational tools. The development of a flexible framework (using five programming languages -- FORTRAN, C++, PYTHON, CORBA and JAVA, and modern software engineering) allows the design of new customizable, user-friendly, easily maintained transport codes that can address major physics issues facing the fusion program. The demo code runs on up to three computers simultaneously; the GUI Client runs on a local computer, the Physics server advances the transport equations, and the Data server accesses experimental data. The evolutions of plasma discharges using different transport models from the module library are compared using the demo code.

Kritz, A. H.; Bateman, G.; Kinsey, J.; Wiley, J.; Cary, J. R.; Luetkemeyer, K. G.; Cohen, R.; Jong, R.; Lodestro, L.; Yang, T. B.; Houlberg, W.; Greenwood, D.; McCune, D.; Mikkelsen, D.; Pletzer, A.; St. John, H.; Fredian, T.; Sugiyama, L.

1999-11-01

274

Fast direct GPS P-Code acquisition  

Microsoft Academic Search

GPS P-Code has a higher chipping rate, better accuracy, and anti-jamming property than C\\/A code. Traditionally, GPS P-Code acquisition depends on handover from C\\/A code. This potentially needs long acquisition time. Moreover, when C\\/A code is not available, it is no longer possible to acquire GPS P-Code through handover from C\\/A code. The purpose of this paper is to describe

Jing Pang; FrankVan Graas; Janusz Starzyk; Zhen Zhu

2003-01-01

275

Introduction Space Time Codes Space Time Coding with Feedback New Thoughts Summary Space-Time Coding for Multi-Antenna  

E-print Network

Introduction Space Time Codes Space Time Coding with Feedback New Thoughts Summary Space 2007 #12;Introduction Space Time Codes Space Time Coding with Feedback New Thoughts Summary MIMO: Diversity vs Multiplexing Multiplexing Diversity Pictures taken from lectures notes on Space Time Coding

Veeravalli, Venugopal

276

ETR/ITER systems code  

SciTech Connect

A tokamak systems code capable of modeling experimental test reactors has been developed and is described in this document. The code, named TETRA (for Tokamak Engineering Test Reactor Analysis), consists of a series of modules, each describing a tokamak system or component, controlled by an optimizer/driver. This code development was a national effort in that the modules were contributed by members of the fusion community and integrated into a code by the Fusion Engineering Design Center. The code has been checked out on the Cray computers at the National Magnetic Fusion Energy Computing Center and has satisfactorily simulated the Tokamak Ignition/Burn Experimental Reactor II (TIBER) design. A feature of this code is the ability to perform optimization studies through the use of a numerical software package, which iterates prescribed variables to satisfy a set of prescribed equations or constraints. This code will be used to perform sensitivity studies for the proposed International Thermonuclear Experimental Reactor (ITER). 22 figs., 29 tabs.

Barr, W.L.; Bathke, C.G.; Brooks, J.N.; Bulmer, R.H.; Busigin, A.; DuBois, P.F.; Fenstermacher, M.E.; Fink, J.; Finn, P.A.; Galambos, J.D.; Gohar, Y.; Gorker, G.E.; Haines, J.R.; Hassanein, A.M.; Hicks, D.R.; Ho, S.K.; Kalsi, S.S.; Kalyanam, K.M.; Kerns, J.A.; Lee, J.D.; Miller, J.R.; Miller, R.L.; Myall, J.O.; Peng, Y-K.M.; Perkins, L.J.; Spampinato, P.T.; Strickler, D.J.; Thomson, S.L.; Wagner, C.E.; Willms, R.S.; Reid, R.L. (ed.)

1988-04-01

277

Coding design for error correcting output codes based on perceptron  

NASA Astrophysics Data System (ADS)

It is known that error-correcting output codes (ECOC) is a common way to model multiclass classification problems, in which the research of encoding based on data is attracting more and more attention. We propose a method for learning ECOC with the help of a single-layered perception neural network. To achieve this goal, the code elements of ECOC are mapped to the weights of network for the given decoding strategy, and an object function with the constrained weights is used as a cost function of network. After the training, we can obtain a coding matrix including lots of subgroups of class. Experimental results on artificial data and University of California Irvine with logistic linear classifier and support vector machine as the binary learner show that our scheme provides better performance of classification with shorter length of coding matrix than other state-of-the-art encoding strategies.

Zhou, Jin-Deng; Wang, Xiao-Dan; Zhou, Hong-Jian; Cui, Yong-Hua; Jing, Sun

2012-05-01

278

The Secret World of Codes and Code Breaking  

NSDL National Science Digital Library

This brief article describes the historical contexts in which two types of cipher (code), the shift and the substitution cipher were used. The math concepts involved are substitution, inverse operations and letter frequency analysis.

Ellis, Claire

2013-01-01

279

BASS Code Development  

NASA Technical Reports Server (NTRS)

The BASS computational aeroacoustic code solves the fully nonlinear Euler equations in the time domain in two-dimensions. The acoustic response of the stator is determined simultaneously for the first three harmonics of the convected vortical gust of the rotor. The spatial mode generation, propagation and decay characteristics are predicted by assuming the acoustic field away from the stator can be represented as a uniform flow with small harmonic perturbations superimposed. The computed field is then decomposed using a joint temporal-spatial transform to determine the wave amplitudes as a function of rotor harmonic and spatial mode order. This report details the following technical aspects of the computations and analysis. 1) the BASS computational technique; 2) the application of periodic time shifted boundary conditions; 3) the linear theory aspects unique to rotor-stator interactions; and 4) the joint spatial-temporal transform. The computational results presented herein are twofold. In each case, the acoustic response of the stator is determined simultaneously for the first three harmonics of the convected vortical gust of the rotor. The fan under consideration here like modern fans is cut-off at +, and propagating acoustic waves are only expected at 2BPF and 3BPF. In the first case, the computations showed excellent agreement with linear theory predictions. The frequency and spatial mode order of acoustic field was computed and found consistent with linear theory. Further, the propagation of the generated modes was also correctly predicted. The upstream going waves propagated from the domain without reflection from the in ow boundary. However, reflections from the out ow boundary were noticed. The amplitude of the reflected wave was approximately 5% of the incident wave. The second set of computations were used to determine the influence of steady loading on the generated noise. Toward this end, the acoustic response was determined with three steady loading conditions: design, low-loading, high-loading. The overall trend showed significant (approximately 10 dB) increases in the generated noise for the highly loaded stator.

Sawyer, Scott

2004-01-01

280

Approximability of identifying codes and locating-dominating codes  

Microsoft Academic Search

We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible to approximate both problems within a logarithmic factor, but sublog- arithmic approximation ratios are intractable. In bounded-degree graphs, there is a trivial constant-factor approximation algorithm, but arbitrarily low approxima- tion ratios remain intractable. In

Jukka Suomela

2007-01-01

281

All-Optical Gray Code to Binary Coded Decimal Converter  

Microsoft Academic Search

All-optical 4-bit Gray code to binary coded decimal (BCD) converter was demonstrated, for the first time in our knowledge, with the number of 12 SOAs by means of commercially available numerical analysis tool (VPI). Circuit design approach was modified appropriately in order to fit the electrical method on an all-optical logic circuit based on cross gain modulation (XGM) process so

Young-Jin Jung; Seok Lee; Deok-Ha Woo

2008-01-01

282

Bandwidth efficient coding for satellite communications  

NASA Technical Reports Server (NTRS)

An error control coding scheme was devised to achieve large coding gain and high reliability by using coded modulation with reduced decoding complexity. To achieve a 3 to 5 dB coding gain and moderate reliability, the decoding complexity is quite modest. In fact, to achieve a 3 dB coding gain, the decoding complexity is quite simple, no matter whether trellis coded modulation or block coded modulation is used. However, to achieve coding gains exceeding 5 dB, the decoding complexity increases drastically, and the implementation of the decoder becomes very expensive and unpractical. The use is proposed of coded modulation in conjunction with concatenated (or cascaded) coding. A good short bandwidth efficient modulation code is used as the inner code and relatively powerful Reed-Solomon code is used as the outer code. With properly chosen inner and outer codes, a concatenated coded modulation scheme not only can achieve large coding gains and high reliability with good bandwidth efficiency but also can be practically implemented. This combination of coded modulation and concatenated coding really offers a way of achieving the best of three worlds, reliability and coding gain, bandwidth efficiency, and decoding complexity.

Lin, Shu; Costello, Daniel J., Jr.; Miller, Warner H.; Morakis, James C.; Poland, William B., Jr.

1992-01-01

283

Facilitating Internet-Scale Code Retrieval  

ERIC Educational Resources Information Center

Internet-Scale code retrieval deals with the representation, storage, and access of relevant source code from a large amount of source code available on the Internet. Internet-Scale code retrieval systems support common emerging practices among software developers related to finding and reusing source code. In this dissertation we focus on some…

Bajracharya, Sushil Krishna

2010-01-01

284

MACCS versus GENII: Code comparison  

SciTech Connect

The computer codes GENII and MACCS, utilized for computing radiation doses, are discussed. The codes are compared from input from the source term from LANL file HW101-SY.INP, run dated 2/19/91. The release of radionuclides was assumed to be from a point source at ground level with a 10 minute release duration.Doses were calculated at a distance of 660 meters with an exposure duration of 2 hours. It was found that the 2 codes differed in how wind direction was treated.

Foster, J.; Chanin, D.I. [Technadyne Engineering Consultants, Inc., Albuquerque, NM (United States)

1991-09-30

285

Overview of the FLUKA code  

NASA Astrophysics Data System (ADS)

The capabilities and physics model implemented inside the FLUKA code are briefly described, with emphasis on hadronic interaction. Examples of the performances of the code are presented including basic (thin target) and complex benchmarks, and radiation detector specific applications. In particular the ability of FLUKA in describing existing calorimeter performances and in predicting those of future ones, as well as the use of the code for neutron and mixed field radiation detectors will be demonstrated with several examples. Warning, no authors found for 2014snam.conf06006.

Battistoni, Giuseppe; Boehlen, Till; Cerutti, Francesco; Chin, Pik Wai; Salvatore Esposito, Luigi; Fassò, Alberto; Ferrari, Alfredo; Mereghetti, Alessio; Garcia Ortega, Pablo; Ranft, Johannes; Roesler, Stefan; Sala, Paola R.; Vlachoudis, Vasilis

2014-06-01

286

DEPARTMENTAL CODE Department of Psychology  

E-print Network

DEPARTMENTAL CODE Department of Psychology Colorado State University Approved May 13, 2009 #12........................................................................... 3 II. Mission of the Department of Psychology................................................................................................ 7 VI. Review of Candidates for Faculty Positions

287

Seals Flow Code Development 1993  

NASA Technical Reports Server (NTRS)

Seals Workshop of 1993 code releases include SPIRALI for spiral grooved cylindrical and face seal configurations; IFACE for face seals with pockets, steps, tapers, turbulence, and cavitation; GFACE for gas face seals with 'lift pad' configurations; and SCISEAL, a CFD code for research and design of seals of cylindrical configuration. GUI (graphical user interface) and code usage was discussed with hands on usage of the codes, discussions, comparisons, and industry feedback. Other highlights for the Seals Workshop-93 include environmental and customer driven seal requirements; 'what's coming'; and brush seal developments including flow visualization, numerical analysis, bench testing, T-700 engine testing, tribological pairing and ceramic configurations, and cryogenic and hot gas facility brush seal results. Also discussed are seals for hypersonic engines and dynamic results for spiral groove and smooth annular seals.

Liang, Anita D. (compiler); Hendricks, Robert C. (compiler)

1994-01-01

288

Modeling Cloud Formation: Source Code  

E-print Network

We have posted the source code for our cloud model for public use as a tool for the intercomparison of planetary radiation transport models attempting to incorporate the physics of cloud condensation.

C. S. Cooper; J. I. Lunine; J. A. Milsom

2004-12-10

289

FLYCHK Collisional-Radiative Code  

National Institute of Standards and Technology Data Gateway

SRD 160 FLYCHK Collisional-Radiative Code (Web, free access)   FLYCHK provides a capability to generate atomic level populations and charge state distributions for low-Z to mid-Z elements under NLTE conditions.

290

Error Correcting Codes Probability Propagation  

E-print Network

communication? We would like to achieve virtually error-free communication. e.g., an error probability of #24 by Gallager, but were then generally forgotten by the coding theory community. #12; Theoretical result: Low

MacKay, David J.C.

291

OOMMF Micromagnetics Public Code Project  

E-print Network

Portable -- Tcl/Tk -- Windows NT & '95, Unix + X ffl Open Design -- Module level -- Tcl/Tk script level -- C++ source code level ffl Flexible -- Simplicity vs. functionality #12; Requirements ffl Tcl/Tk 7

Donahue, Michael J.

292

Fuel cycle code, "FUELMOVE III"  

E-print Network

Further modifications to the fuel cycle code FUELMOVE are described which were made in an attempt to obtain results for reflected reactors operated under batch, outin, and bidirectional fueling schemes. Numerical methods ...

Sovka, Jerry Alois

1963-01-01

293

Property Control through Bar Coding.  

ERIC Educational Resources Information Center

A public utility company uses laser wands to read bar-coded labels on furniture and equipment. The system allows an 80 percent savings of the time required to create reports for inventory control. (MLF)

Kingma, Gerben J.

1984-01-01

294

NFPA's Hydrogen Technologies Code Project  

SciTech Connect

This article discusses the development of National Fire Protection Association 2 (NFPA), a comprehensive hydrogen safety code. It analyses the contents of this document with particular attention focused on new requirements for setting hydrogen storage systems. These new requirements use computational fluid dynamic modeling and risk assessment procedures to develop requirements that are based on both technical analyses and defined risk criteria. The intent is to develop requirements based on procedures that can be replicated based on the information provided in the code document. This code will require documentation of the modeling inputs and risk criteria and analyses in the supporting information. This article also includes a description of the codes and standards that address hydrogen technologies in general.

Rivkin, C. H.

2008-12-01

295

Generalizations of permutation source codes  

E-print Network

Permutation source codes are a class of structured vector quantizers with a computationally- simple encoding procedure. In this thesis, we provide two extensions that preserve the computational simplicity but yield improved ...

Nguyen, Ha Quy

2009-01-01

296

Deformation-invariant sparse coding  

E-print Network

Sparse coding represents input signals each as a sparse linear combination of a set of basis or dictionary elements where sparsity encourages representing each input signal with a few of the most indicative dictionary ...

Chen, George H

2012-01-01

297

Edge equilibrium code for tokamaks  

NASA Astrophysics Data System (ADS)

The edge equilibrium code (EEC) described in this paper is developed for simulations of the near edge plasma using the finite element method. It solves the Grad-Shafranov equation in toroidal coordinate and uses adaptive grids aligned with magnetic field lines. Hermite finite elements are chosen for the numerical scheme. A fast Newton scheme which is the same as implemented in the equilibrium and stability code (ESC) is applied here to adjust the grids.

Li, Xujing; Zakharov, Leonid E.; Drozdov, Vladimir V.

2014-01-01

298

Bit-Interleaved Coded Modulation  

Microsoft Academic Search

It has been recognized by Zehavi (1992) that the performance of coded modulation over a Rayleigh fading channel can be improved by bit-wise interleaving at the encoder output, and by using an appropriate soft-decision metric as an input to a Viterbi (1990) decoder. The paper presents in a comprehensive fashion the theory underlying bit-interleaved coded modulation, provides tools for evaluating

Giuseppe Caire; Giorgio Taricco; Ezio Biglieri

1998-01-01

299

Quantum stabilizer codes and beyond  

E-print Network

QUANTUM STABILIZER CODES AND BEYOND A Dissertation by PRADEEP KIRAN SARVEPALLI Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY August 2008 Major... Subject: Computer Science QUANTUM STABILIZER CODES AND BEYOND A Dissertation by PRADEEP KIRAN SARVEPALLI Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY...

Sarvepalli, Pradeep Kiran

2008-10-10

300

MACCS versus GENII: Code comparison  

Microsoft Academic Search

The computer codes GENII and MACCS, utilized for computing radiation doses, are discussed. The codes are compared from input from the source term from LANL file HW101-SY.INP, run dated 2\\/19\\/91. The release of radionuclides was assumed to be from a point source at ground level with a 10 minute release duration.Doses were calculated at a distance of 660 meters with

J. Foster; D. I. Chanin

2010-01-01

301

Strongly Secure Linear Network Coding  

Microsoft Academic Search

k-secure network coding for k ? h?r. In this case, no information of the se- cret leaks out even if an adversary wiretaps k edges, i.e. channels. However, if an adversary wiretaps k+1 edges, some Si may leak out explicitly. In this paper, we propose strongly k-secure network coding based on strongly se- cure ramp secret sharing schemes. In this

Kunihiko Harada; Hirosuke Yamamoto

2008-01-01

302

FORTRAN Code Auditor. Volume I. User's Manual.  

National Technical Information Service (NTIS)

The FORTRAN Code Auditor, an automated test tool, is used for the cost effective enforcement of FORTRAN programming standards and conventions appropriate to the Air Force software environemnt. It does not modify code. Using predefined coding standards and...

P. Smith

1976-01-01

303

The Cosmic Code Comparison Project  

E-print Network

Current and upcoming cosmological observations allow us to probe structures on smaller and smaller scales, entering highly nonlinear regimes. In order to obtain theoretical predictions in these regimes, large cosmological simulations have to be carried out. The promised high accuracy from observations make the simulation task very demanding: the simulations have to be at least as accurate as the observations. This requirement can only be fulfilled by carrying out an extensive code validation program. The first step of such a program is the comparison of different cosmology codes including gravitation interactions only. In this paper we extend a recently carried out code comparison project to include five more simulation codes. We restrict our analysis to a small cosmological volume which allows us to investigate properties of halos. For the matter power spectrum and the mass function, the previous results hold, with the codes agreeing at the 10% level over wide dynamic ranges. We extend our analysis to the comparison of halo profiles and investigate the halo count as a function of local density. We introduce and discuss ParaView as a flexible analysis tool for cosmological simulations, the use of which immensely simplifies the code comparison task.

Katrin Heitmann; Zarija Lukic; Patricia Fasel; Salman Habib; Michael S. Warren; Martin White; James Ahrens; Lee Ankeny; Ryan Armstrong; Brian O'Shea; Paul M. Ricker; Volker Springel; Joachim Stadel; Hy Trac

2007-06-08

304

Tree coding of image subbands.  

PubMed

The authors consider the encoding of image subbands with a tree code that is asymptotically optimal for Gaussian sources and the mean squared error (MSE) distortion measure. They first prove that optimal encoding of ideally filtered subbands of a Gaussian image source achieves the rate distortion bound for the MSE distortion measure. The optimal rate and distortion allocation among the subbands is a by-product of this proof. A bound is derived which shows that subband coding is closer than full-band coding to the rate distortion bound for a finite length sequence. The tree codes are then applied to encode the image subbands, both nonadaptively and adaptively. Since the tree codes are stochastic and the search of the code tree is selective, a relatively few reproduction symbols may have an associated squared error a hundred times larger than the target for the subband. Correcting these symbols through a postcoding procedure improves the signal-to-noise ratio and visual quality significantly, with a marginal increase in total rate. PMID:18296149

Nanda, S; Pearlman, W A

1992-01-01

305

Rotating-Pump Design Code  

NASA Technical Reports Server (NTRS)

Pump Design (PUMPDES) is a computer program for designing a rotating pump for liquid hydrogen, liquid oxygen, liquid nitrogen, water, methane, or ethane. Using realistic properties of these fluids provided by another program called GASPAK, this code performs a station-by-station, mean-line analysis along the pump flow path, obtaining thermodynamic properties of the pumped fluid at each station and evaluating hydraulic losses along the flow path. The variables at each station are obtained under constraints that are consistent with the underlying physical principles. The code evaluates the performance of each stage and the overall pump. In addition, by judiciously choosing the givens and the unknowns, the code can perform a geometric inverse design function: that is, it can compute a pump geometry that yields a closest approximation of given design point. The code contains two major parts: one for an axial-rotor/inducer and one for a multistage centrifugal pump. The inducer and the centrifugal pump are functionally integrated. The code can be used in designing and/or evaluating the inducer/centrifugal-pump combination or the centrifugal pump alone. The code is written in standard Fortran 77.

Walker, James F.; Chen, Shu-Cheng; Scheer, Dean D.

2006-01-01

306

Design Of Trellis Codes For Fading Channels  

NASA Technical Reports Server (NTRS)

Report develops theoretical basis for design of trellis codes that perform optimally when used in multiple trellis-coded modulation on Rician fading communication channels. Codes perform better than codes designed to be optimal on nonfading channels with only additive white Gaussian noise (AWGN). Design of improved codes based on new distance measure suitable for fading channels. ("Distance" denotes measure of separation in abstract space in theory of codes rather than in ordinary three-dimensional space.)

Simon, Marvin K.; Divsalar, Dariush

1989-01-01

307

Constructing Coding Duels in Pex4Fun and Code Hunt Nikolai Tillmann,  

E-print Network

Constructing Coding Duels in Pex4Fun and Code Hunt Nikolai Tillmann, Jonathan de Halleux Microsoft. In particular, we have re- leased Pex4Fun (www.pexforfun.com) and its successor Code Hunt (www engineering. In Pex4Fun and Code Hunt, the main game type is a coding duel, where a player writes code

Xie, Tao

308

Coordinated design of coding and modulation systems  

NASA Technical Reports Server (NTRS)

The joint optimization of the coding and modulation systems employed in telemetry systems was investigated. Emphasis was placed on formulating inner and outer coding standards used by the Goddard Spaceflight Center. Convolutional codes were found that are nearly optimum for use with Viterbi decoding in the inner coding of concatenated coding systems. A convolutional code, the unit-memory code, was discovered and is ideal for inner system usage because of its byte-oriented structure. Simulations of sequential decoding on the deep-space channel were carried out to compare directly various convolutional codes that are proposed for use in deep-space systems.

Massey, J. L.; Ancheta, T.; Johannesson, R.; Lauer, G.; Lee, L.

1976-01-01

309

Program School/ Career: Descripton ISIS Program Codes  

E-print Network

Program School/ Career: Descripton ISIS Program Codes Program Career: Descripton College School;Program School/ Career: Descripton ISIS Program Codes Program Career: Descripton College School/ College 1

Wisconsin at Madison, University of

310

The Proteomic Code: a molecular recognition code for proteins  

PubMed Central

Background The Proteomic Code is a set of rules by which information in genetic material is transferred into the physico-chemical properties of amino acids. It determines how individual amino acids interact with each other during folding and in specific protein-protein interactions. The Proteomic Code is part of the redundant Genetic Code. Review The 25-year-old history of this concept is reviewed from the first independent suggestions by Biro and Mekler, through the works of Blalock, Root-Bernstein, Siemion, Miller and others, followed by the discovery of a Common Periodic Table of Codons and Nucleic Acids in 2003 and culminating in the recent conceptualization of partial complementary coding of interacting amino acids as well as the theory of the nucleic acid-assisted protein folding. Methods and conclusions A novel cloning method for the design and production of specific, high-affinity-reacting proteins (SHARP) is presented. This method is based on the concept of proteomic codes and is suitable for large-scale, industrial production of specifically interacting peptides. PMID:17999762

Biro, Jan C

2007-01-01

311

Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes  

NASA Astrophysics Data System (ADS)

Quantum information theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present a local classical processing scheme for correcting errors on toric codes, which demonstrates that quantum information can be maintained in two dimensions by purely local (quantum and classical) resources.

Harrington, James William

312

A genetic scale of reading frame coding.  

PubMed

The reading frame coding (RFC) of codes (sets) of trinucleotides is a genetic concept which has been largely ignored during the last 50 years. A first objective is the definition of a new and simple statistical parameter PrRFC for analysing the probability (efficiency) of reading frame coding (RFC) of any trinucleotide code. A second objective is to reveal different classes and subclasses of trinucleotide codes involved in reading frame coding: the circular codes of 20 trinucleotides and the bijective genetic codes of 20 trinucleotides coding the 20 amino acids. This approach allows us to propose a genetic scale of reading frame coding which ranges from 1/3 with the random codes (RFC probability identical in the three frames) to 1 with the comma-free circular codes (RFC probability maximal in the reading frame and null in the two shifted frames). This genetic scale shows, in particular, the reading frame coding probabilities of the 12,964,440 circular codes (PrRFC=83.2% in average), the 216 C(3) self-complementary circular codes (PrRFC=84.1% in average) including the code X identified in eukaryotic and prokaryotic genes (PrRFC=81.3%) and the 339,738,624 bijective genetic codes (PrRFC=61.5% in average) including the 52 codes without permuted trinucleotides (PrRFC=66.0% in average). Otherwise, the reading frame coding probabilities of each trinucleotide code coding an amino acid with the universal genetic code are also determined. The four amino acids Gly, Lys, Phe and Pro are coded by codes (not circular) with RFC probabilities equal to 2/3, 1/2, 1/2 and 2/3, respectively. The amino acid Leu is coded by a circular code (not comma-free) with a RFC probability equal to 18/19. The 15 other amino acids are coded by comma-free circular codes, i.e. with RFC probabilities equal to 1. The identification of coding properties in some classes of trinucleotide codes studied here may bring new insights in the origin and evolution of the genetic code. PMID:24698943

Michel, Christian J

2014-08-21

313

Wireless Network Coding with Local Network Views: Coded Layer Scheduling  

E-print Network

One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire limited local views of the whole network to design their transmission strategies. In this paper, we study multi-layer wireless networks and assume that each node has only a limited knowledge, namely 1-local view, where each S-D pair has enough information to perform optimally when other pairs do not interfere, along with connectivity information for rest of the network. We investigate the information-theoretic limits of communication with such limited knowledge at the nodes. We develop a novel transmission strategy, namely Coded Layer Scheduling, that solely relies on 1-local view at the nodes and incorporates three different techniques: (1) per layer interference avoidance, (2) repetition coding to allow overhearing of the interference, and (3) network coding to allow inter...

Vahid, Alireza; Avestimehr, A Salman; Sabharwal, Ashutosh

2011-01-01

314

Constructions for finite-state codes  

NASA Technical Reports Server (NTRS)

A class of codes called finite-state (FS) codes is defined and investigated. These codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived from known upper bounds on the minimum distance of block codes. A general construction for FS codes is then given, based on the idea of partitioning a given linear block into cosets of one of its subcodes, and it is shown that in many cases the FS codes constructed in this way have a d sub free which is as large as possible. These codes are found without the need for lengthy computer searches, and have potential applications for future deep-space coding systems. The issue of catastropic error propagation (CEP) for FS codes is also investigated.

Pollara, F.; Mceliece, R. J.; Abdel-Ghaffar, K.

1987-01-01

315

International assessment of PCA codes  

SciTech Connect

Over the past three years (1991-1993), an extensive international exercise for intercomparison of a group of six Probabilistic Consequence Assessment (PCA) codes was undertaken. The exercise was jointly sponsored by the Commission of European Communities (CEC) and OECD Nuclear Energy Agency. This exercise was a logical continuation of a similar effort undertaken by OECD/NEA/CSNI in 1979-1981. The PCA codes are currently used by different countries for predicting radiological health and economic consequences of severe accidents at nuclear power plants (and certain types of non-reactor nuclear facilities) resulting in releases of radioactive materials into the atmosphere. The codes participating in the exercise were: ARANO (Finland), CONDOR (UK), COSYMA (CEC), LENA (Sweden), MACCS (USA), and OSCAAR (Japan). In parallel with this inter-code comparison effort, two separate groups performed a similar set of calculations using two of the participating codes, MACCS and COSYMA. Results of the intercode and inter-MACCS comparisons are presented in this paper. The MACCS group included four participants: GREECE: Institute of Nuclear Technology and Radiation Protection, NCSR Demokritos; ITALY: ENEL, ENEA/DISP, and ENEA/NUC-RIN; SPAIN: Universidad Politecnica de Madrid (UPM) and Consejo de Seguridad Nuclear; USA: Brookhaven National Laboratory, US NRC and DOE.

Neymotin, L. [Brookhaven National Lab., Upton, NY (United States). Dept. of Advanced Technology; Lui, C.; Glynn, J. [Nuclear Regulatory Commission, Washington, DC (United States). Probabilistic Risk Analysis Branch; Archarya, S. [Dept. of Energy, Washington, DC (United States). Office of Nuclear Safety

1993-11-01

316

Verification of FANTASTIC integrated code  

NASA Technical Reports Server (NTRS)

FANTASTIC is an acronym for Failure Analysis Nonlinear Thermal and Structural Integrated Code. This program was developed by Failure Analysis Associates, Palo Alto, Calif., for MSFC to improve the accuracy of solid rocket motor nozzle analysis. FANTASTIC has three modules: FACT - thermochemical analysis; FAHT - heat transfer analysis; and FAST - structural analysis. All modules have keywords for data input. Work is in progress for the verification of the FAHT module, which is done by using data for various problems with known solutions as inputs to the FAHT module. The information obtained is used to identify problem areas of the code and passed on to the developer for debugging purposes. Failure Analysis Associates have revised the first version of the FANTASTIC code and a new improved version has been released to the Thermal Systems Branch.

Chauhan, Rajinder Singh

1987-01-01

317

ASME Code Efforts Supporting HTGRs  

SciTech Connect

In 1999, an international collaborative initiative for the development of advanced (Generation IV) reactors was started. The idea behind this effort was to bring nuclear energy closer to the needs of sustainability, to increase proliferation resistance, and to support concepts able to produce energy (both electricity and process heat) at competitive costs. The U.S. Department of Energy has supported this effort by pursuing the development of the Next Generation Nuclear Plant, a high temperature gas-cooled reactor. This support has included research and development of pertinent data, initial regulatory discussions, and engineering support of various codes and standards development. This report discusses the various applicable American Society of Mechanical Engineers (ASME) codes and standards that are being developed to support these high temperature gascooled reactors during construction and operation. ASME is aggressively pursuing these codes and standards to support an international effort to build the next generation of advanced reactors so that all can benefit.

D.K. Morton

2012-09-01

318

ASME Code Efforts Supporting HTGRs  

SciTech Connect

In 1999, an international collaborative initiative for the development of advanced (Generation IV) reactors was started. The idea behind this effort was to bring nuclear energy closer to the needs of sustainability, to increase proliferation resistance, and to support concepts able to produce energy (both electricity and process heat) at competitive costs. The U.S. Department of Energy has supported this effort by pursuing the development of the Next Generation Nuclear Plant, a high temperature gas-cooled reactor. This support has included research and development of pertinent data, initial regulatory discussions, and engineering support of various codes and standards development. This report discusses the various applicable American Society of Mechanical Engineers (ASME) codes and standards that are being developed to support these high temperature gascooled reactors during construction and operation. ASME is aggressively pursuing these codes and standards to support an international effort to build the next generation of advanced reactors so that all can benefit.

D.K. Morton

2011-09-01

319

A coded tracking telemetry system  

USGS Publications Warehouse

We describe the general characteristics of an automated radio telemetry system designed to operate for prolonged periods on a single frequency. Each transmitter sends a unique coded signal to a receiving system that encodes and records only the appropriater, pre-programmed codes. A record of the time of each reception is stored on diskettes in a micro-computer. This system enables continuous monitoring of infrequent signals (e.g. one per minute or one per hour), thus extending operation life or allowing size reduction of the transmitter, compared to conventional wildlife telemetry. Furthermore, when using unique codes transmitted on a single frequency, biologists can monitor many individuals without exceeding the radio frequency allocations for wildlife.

Howey, P.W.; Seegar, W.S.; Fuller, M.R.; Titus, K.

1989-01-01

320

FLOWTRAN-TF code description  

SciTech Connect

FLOWTRAN-TF is a two-component (air-water), two-phase thermal-hydraulics code designed for performing accident analyses of SRS reactor fuel assemblies during the Emergency Cooling System (ECS) phase of a Double Ended Guillotine Break (DEGB) Loss of Coolant Accident (LOCA). This report provides a brief description of the physical models in the version of FLOWTRAN-TF used to compute the Recommended K-Reactor Restart ECS Power Limit. This document is viewed as an interim report and should ultimately be superseded by a comprehensive user/programmer manual. In general, only high level discussions of governing equations and constitutive laws are presented. Numerical implementation of these models, code architecture and user information are not generally covered. A companion document describing code benchmarking is available.

Flach, G.P. [ed.

1990-12-01

321

FLOWTRAN-TF code description  

SciTech Connect

FLOWTRAN-TF is a two-component (air-water), two-phase thermal-hydraulics code designed for performing accident analyses of SRS reactor fuel assemblies during the Emergency Cooling System (ECS) phase of a Double Ended Guillotine Break (DEGB) Loss of Coolant Accident (LOCA). This report provides a brief description of the physical models in the version of FLOWTRAN-TF used to compute the Recommended K-Reactor Restart ECS Power Limit. This document is viewed as an interim report and should ultimately be superseded by a comprehensive user/programmer manual. In general, only high level discussions of governing equations and constitutive laws are presented. Numerical implementation of these models, code architecture and user information are not generally covered. A companion document describing code benchmarking is available.

Flach, G.P. (ed.)

1991-09-01

322

Parallization of Stellar Atmosphere Codes  

E-print Network

Parallel computing has turned out to be the enabling technology to solve complex physical systems. However, the transition from shared memory, vector computers to massively parallel, distributed memory systems and, recently, to hybrid systems poses new challenges to the scientist. We want to present a cook-book (with a very strong, personal bias) based on our experience with parallization of our existing codes. Some of the general tools and communication libraries are discussed. Our approach includes a mixture of algorithm, domain and physical module based parallization. The advantages, scalability and limitations of each are discussed at some examples. We want show that it becomes easier to write parallel code with increasing complexity of the physical problem making stellar atmosphere codes beyond the classical assumptions very suitable.

P. Hoeflich

2002-09-19

323

Optimal Bacon-Shor codes  

E-print Network

We study the performance of Bacon-Shor codes, quantum subsystem codes which are well suited for applications to fault-tolerant quantum memory because the error syndrome can be extracted by performing two-qubit measurements. Assuming independent noise, we find the optimal block size in terms of the bit-flip error probability p_X and the phase error probability p_Z, and determine how the probability of a logical error depends on p_X and p_Z. We show that a single Bacon-Shor code block, used by itself without concatenation, can provide very effective protection against logical errors if the noise is highly biased (p_Z / p_X >> 1) and the physical error rate p_Z is a few percent or below. We also derive an upper bound on the logical error rate for the case where the syndrome data is noisy.

John Napp; John Preskill

2012-09-04

324

Code Hunt: Searching for Secret Code for Fun Nikolai Tillmann  

E-print Network

. of Computer Science Victoria BC V8W 2Y2, Canada nigelh@cs.uvic.ca Daniel Perelman Univ. Washington Dept. of Computer Science Seattle WA 98195, USA perelman@ cs.washington.edu Tao Xie University of Illinois at Urbana-Champaign Dept. Computer Science Urbana, IL, USA taoxie@illinois.edu ABSTRACT Learning to code can be made more

Xie, Tao

325

Adaptive code generators for tree coding of speech  

E-print Network

for non-stationary speech should be adaptive, and forward adaptation and backward adaptation are widely studied in certain types of speech coding. In this research, based on the same adaptive long-term predictor, tree coders are implemented with different...

Dong, Hui

2012-06-07

326

Coded Exposure Deblurring: Optimized Codes for PSF Estimation and Invertibility  

E-print Network

show how to easily implement coded exposure on a consumer grade machine vision camera on estimating the point Yi Xu is currently a graduate student at Purdue University. k = [-44.39,-0.29] Firewire system and recovering a sharp image from captured noisy blurred image. Blind deconvolution techniques

Agrawal, Amit

327

On Random Coding Error Exponents of Watermarking Codes Neri Merhav  

E-print Network

their electronic data (e.g., images, video, sound, text). This has stimulated many research e#11;orts towards Watermarking codes are analyzed from an information-theoretic viewpoint as a game between an information hider (typically, text, image, sound, or video stream) within a certain distortion level, the attacker processes

Merhav, Neri

328

29 CFR 510.21 - SIC codes.  

...2014-07-01 2014-07-01 false SIC codes. 510.21 Section 510.21 Labor...Classification of Industries § 510.21 SIC codes. (a) The Conference Report...comparable to the four digit Standard Industry Code (SIC) code level.” (b) The...

2014-07-01

329

Discussion Forum for Technical Codes Users  

Microsoft Academic Search

One goal of the Building Energy Codes Program (BECP) is to provide useful, easy to understand information about the national energy codes. A forum where users could ask for, and receive clarification on these codes and software from other users would allow the Energy codes project to reach and instruct a broader audience for a modest resource cost. The forum

Bryce P. Kaspar; Heather E. Dillon

2006-01-01

330

On linear unequal error protection codes  

Microsoft Academic Search

The class of codes discussed in this paper has the property that its error-correction capability is described in terms of correcting errors in specific digits of a code word even though other digits in the code may be decoded incorrectly. To each digit of the code words is assigned an error protection levelf_{i}. Then, ifferrors occur in the reception of

BURT MASNICK; JACK WOLF

1967-01-01

331

Adaptive coded modulation for fading channels  

Microsoft Academic Search

We apply coset codes to adaptive modulation in fading channels. Adaptive modulation is a powerful technique to improve the energy efficiency and increase the data rate over a fading channel. Coset codes are a natural choice to use with adaptive modulation since the channel coding and modulation designs are separable. Therefore, trellis and lattice codes designed for additive white Gaussian

Andrea J. Goldsmith; Soon-Ghee Chua

1998-01-01

332

STATIC CODE ANALYSIS IN JAVA Bachelor Thesis  

E-print Network

STATIC CODE ANALYSIS IN JAVA Bachelor Thesis Fabian van den Broek Supervisor: dr.ir. Erik Poll bugs quickly is the use of static code analysis. There are no exact numbers on the use of static code use static code analysis. Furthermore, a case study is performed to investigate the advantage of using

Lucas, Peter

333

MHD simulations with the FLASH code  

Microsoft Academic Search

The FLASH code developed at the University of Chicago Flash Center is a modular, general-purpose, adaptive, parallel simulation code capable of handling compressible flow problems in various physical, in particular astrophysical, environments. Starting with version release 2.0, the FLASH code supports the equations of magnetohydrodynamics (MHD). In this paper, we will describe the present state of the code and the

Timur Linde

2002-01-01

334

Optimal Probabilistic Fingerprint Codes # Gabor Tardos  

E-print Network

Optimal Probabilistic Fingerprint Codes # Gâ??abor Tardos Râ??enyi Institute Pf. 127, H­1354 Budapest, Hungary tardos@renyi.hu Abstract We construct binary codes for fingerprinting digital documents. Our codes imply that randomized fingerprint codes over a binary alphabet are as powerful as over an arbitrary

Tardos, Gábor

335

UK Quality Code for Higher Education  

E-print Network

UK Quality Code for Higher Education Part C: Information about higher education provision Document practice 4 Information for the public about the higher education provider 4 Information for prospective UK Quality Code for Higher Education 1 About the Quality Code The UK Quality Code for Higher

Wirosoetisno, Djoko

336

An empirical study of code clone genealogies  

Microsoft Academic Search

It has been broadly assumed that code clones are inherently bad and that eliminating clones by refactoring would solve the problems of code clones. To investigate the validity of this assumption, we developed a formal denition of clone evolution and built a clone genealogy tool that automatically extracts the history of code clones from a source code repository. Using our

Miryung Kim; Vibha Sazawal; David Notkin; Gail C. Murphy

2005-01-01

337

Non-information-maximizing neural coding  

Microsoft Academic Search

Information theoretic techniques are often used to investigate neural coding. Results - in terms of bits per second or bits per spike - have been used as evidence to support temporal or rate coding, spike timing precision, etc. Despite its use this way, information theory does not tell one what the neural code (or any code) is. In artificial systems,

Michael Stiber

2003-01-01

338

Low Complexity Opportunistic Decoder for Network Coding  

E-print Network

Low Complexity Opportunistic Decoder for Network Coding Bei Yin, Michael Wu, Guohui Wang for network coding decoder which significantly reduces the decoder complexity and increases the through- put transmissions. Although network coding increases the network performance, the complexity of the network coding

Mellor-Crummey, John

339

Convolutional coding combined with continuous phase modulation  

NASA Technical Reports Server (NTRS)

Background theory and specific coding designs for combined coding/modulation schemes utilizing convolutional codes and continuous-phase modulation (CPM) are presented. In this paper the case of r = 1/2 coding onto a 4-ary CPM is emphasized, with short-constraint length codes presented for continuous-phase FSK, double-raised-cosine, and triple-raised-cosine modulation. Coding buys several decibels of coding gain over the Gaussian channel, with an attendant increase of bandwidth. Performance comparisons in the power-bandwidth tradeoff with other approaches are made.

Pizzi, S. V.; Wilson, S. G.

1985-01-01

340

Coded Modulations for Mobile Satellite Communication Channels  

NASA Astrophysics Data System (ADS)

The mobile satellite (MSAT) channel is subject to multipath fading, shadowing, Doppler frequency shift, and adjacent channel interference (ACI). Therefore, transmitted signals face severe amplitude and phase distortions. This dissertation investigates various high performance and low decoding complexity coded modulation schemes for reliable voice and data transmissions over the shadowed mobile satellite channel and the Rayleigh fading channel. The dissertation consists of four parts. The first part presents a systematic technique for constructing MPSK trellis coded modulation (TCM) codes for voice transmission over the MSAT channel. The multilevel coding method is used for constructing TCM codes using convolutional codes with good free branch distances as the component codes or using both convolutional and block codes as the component codes. Simulation results show that these codes achieve good coding gains over the uncoded reference system and outperform existing TCM codes with the same decoding complexity. In the second part, using the multilevel coding method, multilevel block coded modulation (BCM) codes are constructed for voice transmission over the MSAT channel. Even though BCM is generally less power efficient than TCM for AWGN channels, BCM has a great potential to compete with TCM in the MSAT channel because of its shorter decoding depth and hence more effective interleaving. Binary Reed -Muller (RM) codes of length up to 32 are used as component codes. Simulation results show that these codes achieve good coding gains over the uncoded reference system and outperform TCM codes with the same decoding complexity. In the third part, a simple and systematic technique for constructing multilevel concatenated BCM schemes for data transmission over the shadowed MSAT channel and the Rayleigh fading channel is presented. These schemes are designed to achieve high-performance or large coding gain with reduced decoding complexity. Construction is based on a multilevel concatenation approach in which long powerful (binary or non-binary) codes are used as the outer codes and coset codes constructed from a linear BCM code and its subcodes are used as the inner codes. Simulation results show that these codes achieve large coding gains over the uncoded reference system and outperform single-level concatenated BCM codes with the same inner codes. Especially, some multilevel concatenated BCM codes achieve an error-floor free communication at BER of 10^{-5 }. In the final part of the dissertation, product coded modulation schemes are constructed by using multilevel concatenating approach. In product coded modulation, the product coding technique and coded modulation are combined to achieve high performance with reduced decoding complexity. Good product 8-PSK modulation codes are constructed for various shadowed MSAT channels. Simulation results show that these codes achieve large coding gains over the uncoded reference system and outperform single-level concatenated BCM codes with the same inner codes.

Rhee, Dojun

1995-01-01

341

Accumulate-Repeat-Accumulate-Accumulate Codes  

NASA Technical Reports Server (NTRS)

Accumulate-repeat-accumulate-accumulate (ARAA) codes have been proposed, inspired by the recently proposed accumulate-repeat-accumulate (ARA) codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. ARAA codes can be regarded as serial turbolike codes or as a subclass of low-density parity-check (LDPC) codes, and, like ARA codes they have projected graph or protograph representations; these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The objective in proposing ARAA codes as a subclass of ARA codes was to enhance the error-floor performance of ARA codes while maintaining simple encoding structures and low maximum variable node degree.

Divsalar, Dariush; Dolinar, Samuel; Thorpe, Jeremy

2007-01-01

342

Light-water reactor safety analysis codes  

SciTech Connect

A brief review of the evolution of light-water reactor safety analysis codes is presented. Included is a summary comparison of the technical capabilities of major system codes. Three recent codes are described in more detail to serve as examples of currently used techniques. Example comparisons between calculated results using these codes and experimental data are given. Finally, a brief evaluation of current code capability and future development trends is presented.

Jackson, J.F.; Ransom, V.H.; Ybarrondo, L.J.; Liles, D.R.

1980-01-01

343

NFPA's Hydrogen Technologies Code Project  

Microsoft Academic Search

This article discusses the development of National Fire Protection Association 2 (NFPA), a comprehensive hydrogen safety code. It analyses the contents of this document with particular attention focused on new requirements for setting hydrogen storage systems. These new requirements use computational fluid dynamic modeling and risk assessment procedures to develop requirements that are based on both technical analyses and defined

Rivkin

2008-01-01

344

Coding Theorems for Individual Sequences  

Microsoft Academic Search

A quantity called the {em finite-state} complexity is assigned to every infinite sequence of elements drawn from a finite sot. This quantity characterizes the largest compression ratio that can be achieved in accurate transmission of the sequence by any finite-state encoder (and decoder). Coding theorems and converses are derived for an individual sequence without any probabilistic characterization, and universal data

Jacob Ziv

1978-01-01

345

Source Code Exploration with Google  

Microsoft Academic Search

The paper presents a new approach to source code exploration, which is the result of integrating the Google Desktop Search (GDS) engine into the Eclipse development environment. The resulting search engine, named Google Eclipse Search (GES), provides improved searching in Eclipse software projects. The paper advocates for a component-based approach that allows us to develop strong tools, which support various

Denys Poshyvanyk; Maksym Petrenko; Andrian Marcus; Xinrong Xie; Dapeng Liu

2006-01-01

346

QR Codes: Taking Collections Further  

ERIC Educational Resources Information Center

With some thought and direction, QR (quick response) codes are a great tool to use in school libraries to enhance access to information. From March through April 2013, Caitlin Ahearn interned at Sanborn Regional High School (SRHS) under the supervision of Pam Harland. As a result of Harland's un-Deweying of the nonfiction collection at SRHS,…

Ahearn, Caitlin

2014-01-01

347

Colon Histology Coding Rules Flowchart  

Cancer.gov

Ne xt Page NO Rule Action Notes and Examples Colon Histology Coding Rules - Flowchart Flowchart Key Flow Direction Notes and Examples Rule Action (Exc ludes lym phom a and leukem ia M9590-9989 and Kapos i sarcoma M9140) (C180-C189) M ULT IPLE TUM ORS ABSTRACTED AS A SINGLE PRIM ARY H20 Are there multiple invasive tumors?

348

Multichannel error correction code decoder  

NASA Technical Reports Server (NTRS)

A brief overview of a processing satellite for a mesh very-small-aperture (VSAT) communications network is provided. The multichannel error correction code (ECC) decoder system, the uplink signal generation and link simulation equipment, and the time-shared decoder are described. The testing is discussed. Applications of the time-shared decoder are recommended.

Wagner, Paul K.; Ivancic, William D.

1993-01-01

349

Performance bounds for fractal coding  

Microsoft Academic Search

Reports on investigations concerning the performance of fractal transforms. Emerging from the structural constraints of fractal coding schemes, lower bounds for the reconstruction error are given without regarding quantization noise. This implies finding an at least locally optimal transformation matrix. A full search approach is by definition optimal but also intractable for practical implementations. In order to simplify the calculation

Bernd Hiirtgen; Rwth Aachen

1995-01-01

350

RIPPLE Authentication for Network Coding  

Microsoft Academic Search

By allowing routers to randomly mix the informa- tion content in packets before forwarding them, network coding can maximize network throughput in a distributed manner with low complexity. However, such mixing also renders the transmission vulnerable to pollution attacks, where a malicious node injects corrupted packets into the information flow. In a worst case scenario, a single corrupted packet can

Yaping Li; Hongyi Yao; Minghua Chen; Sidharth Jaggi; Alon Rosen

2010-01-01

351

OOMMF Micromagnetics Public Code Project  

E-print Network

­ Tcl/Tk ­ Windows NT & '95, Unix + X · Open Design ­ Module level ­ Tcl/Tk script level ­ C++ source code level · Flexible ­ Simplicity vs. functionality #12;Requirements · Tcl/Tk 7.5/4.1+ (8

Donahue, Michael J.

352

SALT steady state systems code  

Microsoft Academic Search

A steady state system code has been developed at ANL and has been used to analyze or evaluate the following technologies: open cycle magnetohydrodynamics (MHD), liquid metal MHD, fuel cells, combined cycle coal gasification plants, pulverized coal fired power plants with flue gas desulfurization, pressurized and atmospheric fluidized bed combustion plants, municipal solid waste disposal systems, geothermal systems, fusion reactor

G. Berry; H. Geyer

1983-01-01

353

Spring 2014 Cracking the code  

E-print Network

Spring 2014 Cracking the code Regenerating islet cells may lead to a cure for diabetes much of their energy on minimizing the impact of diabetes. Because people with diabetes do not have--physicians and scientists have found ways to help them manage their blood sugar levels through lifestyle changes

Minnesota, University of

354

Free Energy Code Online Discussion  

E-print Network

Free Energy Code Online Discussion for Building Department Personnel Join us for this FREE 90-minute interactive online event to discuss and decode Title 24 Part 6 residential HVAC changeout of the California Energy Commission. Date: 3 dates currently offered, choose the one that works for you

355

Lexical Source-Code Transformation  

Microsoft Academic Search

As an alternative to syntactic matching on a program's abstract syntax tree, we explore the use of lexical matching on a program's source-code. Lexical techniques have been shown to be effective for the approximation of an abstract syntax tree, thus permitting tools that use regular expres- sions to effectively specify rewrite targets. In this paper, the features needed to support

Anthony Cox; Tony Abou-Assaleh; Wei Ai; Vlado Keselj

356

Tri-Coding of Information.  

ERIC Educational Resources Information Center

Paivio's Dual Coding Theory has received widespread recognition for its connection between visual and aural channels of internal information processing. The use of only two channels, however, cannot satisfactorily explain the effects witnessed every day. This paper presents a study suggesting the presence a third, kinesthetic channel, currently…

Simpson, Timothy J.

357

The NESSUS finite element code  

NASA Technical Reports Server (NTRS)

The objective of this development is to provide a new analysis tool which integrates the structural modeling versatility of a modern finite element code with the latest advances in the area of probabilistic modeling and structural reliability. Version 2.0 of the NESSUS finite element code was released last February, and is currently being exercised on a set of problems which are representative of typical Space Shuttle Main Engine (SSME) applications. NESSUS 2.0 allows linear elastostatic and eigenvalue analysis of structures with uncertain geometry, material properties and boundary conditions, which are subjected to a random mechanical and thermal loading environment. The NESSUS finite element code is a key component in a broader software system consisting of five major modules. NESSUS/EXPERT is an expert system under development at Southwest Research Institute, with the objective of centralizing all component-specific knowledge useful for conducting probabilistic analysis of typical Space Shuttle Main Engine (SSME) components. NESSUS/FEM contains the finite element code used for the structural analysis and parameter sensitivity evaluation of these components. The task of parametrizing a finite element mesh in terms of the random variables present is facilitated with the use of the probabilistic data preprocessor in NESSUS/PRE. An external database file is used for managing the bulk of the data generated by NESSUS/FEM.

Dias, J. B.; Nagiegaal, J. C.; Nakazawa, S.

1987-01-01

358

Fractal image coding: a review  

Microsoft Academic Search

An approach to image coding based on a fractal theory of iterated contractive transformations defined piecewise is described. The main characteristics of this approach are that it relies on the assumption that image redundancy can be efficiently captured and exploited through piecewise self-transformability on a block-wise basis, and it approximates an original image by a fractal image, obtained from a

ARNAUD E. JACQUIN

1993-01-01

359

Amino acid codes in mitochondria as possible clues to primitive codes  

NASA Technical Reports Server (NTRS)

Differences between mitochondrial codes and the universal code indicate that an evolutionary simplification has taken place, rather than a return to a more primitive code. However, these differences make it evident that the universal code is not the only code possible, and therefore earlier codes may have differed markedly from the previous code. The present universal code is probably a 'frozen accident.' The change in CUN codons from leucine to threonine (Neurospora vs. yeast mitochondria) indicates that neutral or near-neutral changes occurred in the corresponding proteins when this code change took place, caused presumably by a mutation in a tRNA gene.

Jukes, T. H.

1981-01-01

360

LEXSTAT CAL CODE CIV PROC 1094.5 Deering's California Codes Annotated  

E-print Network

Page 1 LEXSTAT CAL CODE CIV PROC § 1094.5 Deering's California Codes Annotated Copyright © 2006 IS CURRENT THROUGH THE 2007 SUPPLEMENT *** (ALL 2006 LEGISLATION) CODE OF CIVIL PROCEDURE Part 3. Special TO CALIFORNIA CODES ARCHIVE DIRECTORY Cal Code Civ Proc § 1094.5 (2006) § 1094.5. Inquiry into validity

Kammen, Daniel M.

361

The Mystery Behind the Code: Differentiated Instruction with Quick Response Codes in Secondary Physical Education  

ERIC Educational Resources Information Center

Quick response codes, better known as QR codes, are small barcodes scanned to receive information about a specific topic. This article explains QR code technology and the utility of QR codes in the delivery of physical education instruction. Consideration is given to how QR codes can be used to accommodate learners of varying ability levels as…

Adkins, Megan; Wajciechowski, Misti R.; Scantling, Ed

2013-01-01

362

76 FR 77549 - Lummi Nation-Title 20-Code of Laws-Liquor Code  

Federal Register 2010, 2011, 2012, 2013

...Bureau of Indian Affairs Lummi Nation--Title 20--Code of Laws--Liquor Code AGENCY...publishes the amendment to Lummi Nation's Title 20--Code of Laws--Liquor Code. The...Business Council adopted this amendment to Title 20--Lummi Nation Code of...

2011-12-13

363

Fluid Film Bearing Code Development  

NASA Technical Reports Server (NTRS)

The next generation of rocket engine turbopumps is being developed by industry through Government-directed contracts. These turbopumps will use fluid film bearings because they eliminate the life and shaft-speed limitations of rolling-element bearings, increase turbopump design flexibility, and reduce the need for turbopump overhauls and maintenance. The design of the fluid film bearings for these turbopumps, however, requires sophisticated analysis tools to model the complex physical behavior characteristic of fluid film bearings operating at high speeds with low viscosity fluids. State-of-the-art analysis and design tools are being developed at the Texas A&M University under a grant guided by the NASA Lewis Research Center. The latest version of the code, HYDROFLEXT, is a thermohydrodynamic bulk flow analysis with fluid compressibility, full inertia, and fully developed turbulence models. It can predict the static and dynamic force response of rigid and flexible pad hydrodynamic bearings and of rigid and tilting pad hydrostatic bearings. The Texas A&M code is a comprehensive analysis tool, incorporating key fluid phenomenon pertinent to bearings that operate at high speeds with low-viscosity fluids typical of those used in rocket engine turbopumps. Specifically, the energy equation was implemented into the code to enable fluid properties to vary with temperature and pressure. This is particularly important for cryogenic fluids because their properties are sensitive to temperature as well as pressure. As shown in the figure, predicted bearing mass flow rates vary significantly depending on the fluid model used. Because cryogens are semicompressible fluids and the bearing dynamic characteristics are highly sensitive to fluid compressibility, fluid compressibility effects are also modeled. The code contains fluid properties for liquid hydrogen, liquid oxygen, and liquid nitrogen as well as for water and air. Other fluids can be handled by the code provided that the user inputs information that relates the fluid transport properties to the temperature.

1995-01-01

364

Evolutionary dynamics of coding and non-coding transcriptomes.  

PubMed

Gene expression changes may underlie much of phenotypic evolution. The development of high-throughput RNA sequencing protocols has opened the door to unprecedented large-scale and cross-species transcriptome comparisons by allowing accurate and sensitive assessments of transcript sequences and expression levels. Here, we review the initial wave of the new generation of comparative transcriptomic studies in mammals and vertebrate outgroup species in the context of earlier work. Together with various large-scale genomic and epigenomic data, these studies have unveiled commonalities and differences in the dynamics of gene expression evolution for various types of coding and non-coding genes across mammalian lineages, organs, developmental stages, chromosomes and sexes. They have also provided intriguing new clues to the regulatory basis and phenotypic implications of evolutionary gene expression changes. PMID:25297727

Necsulea, Anamaria; Kaessmann, Henrik

2014-11-01

365

MMSE decision-feedback equalizers and coding. II. Coding results  

Microsoft Academic Search

For pt.I see ibid., vol.43, no.10, p.2582 (1995). The minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE) has properties that suggest that it is a canonical equalization structure in systems that combine equalization with coded modulation. With a given symbol rate 1\\/T and transmit spectrum, the output signal-to-noise ratio SNRMMSE-DFE,U of a MMSE-DFE with an unbiased decision rule is a single parameter that characterizes

John M. Cioffi; Glen P. Dudevoir; M. Vedat Eyuboglu

1995-01-01

366

Codes and coding processes in pigeon short-term memory  

Microsoft Academic Search

The delayed matching-to-sample (DMTS) task was used in three experiments to investigate how pigeons code information about\\u000a sample stimuli. In all experiments, each trial consisted of a signaled presentation of a sample stimulus for a fixed duration\\u000a followed, after some delay, by the presentation of three comparison stimuli. After incorrect first choices, the bird was allowed\\u000a a second choice between

H. L. Roitblat

1980-01-01

367

Computer code design of shaped charges. [CHPCODSC code  

Microsoft Academic Search

A shaped charge is an explosive charge constructed to implode an encased metal liner and project a ''jet'' of liner metal into a designated object at high velocity. The shaped-charge armor-piercing weapons now in use have been developed mainly by trial and error; an economical computer modeling technique for designing future shaped-charge devices is reported here. The CHPCODSC computer code,

L. L. Edwards; C. S. Godfrey

1978-01-01

368

Biological Information Transfer Beyond the Genetic Code: The Sugar Code  

Microsoft Academic Search

In the era of genetic engineering, cloning, and genome sequencing, the focus of research on the genetic code has received\\u000a an even further accentuation in the public eye. When, however, aspiring to understand intra- and intercellular recognition\\u000a processes comprehensively, the two biochemical dimensions established by nucleic acids and proteins are not sufficient to\\u000a satisfactorily explain all molecular events in, e.g.

Hans-Joachim Gabius

369

Genetic coding and gene expression - new Quadruplet genetic coding model  

NASA Astrophysics Data System (ADS)

Successful demonstration of human genome project has opened the door not only for developing personalized medicine and cure for genetic diseases, but it may also answer the complex and difficult question of the origin of life. It may lead to making 21st century, a century of Biological Sciences as well. Based on the central dogma of Biology, genetic codons in conjunction with tRNA play a key role in translating the RNA bases forming sequence of amino acids leading to a synthesized protein. This is the most critical step in synthesizing the right protein needed for personalized medicine and curing genetic diseases. So far, only triplet codons involving three bases of RNA, transcribed from DNA bases, have been used. Since this approach has several inconsistencies and limitations, even the promise of personalized medicine has not been realized. The new Quadruplet genetic coding model proposed and developed here involves all four RNA bases which in conjunction with tRNA will synthesize the right protein. The transcription and translation process used will be the same, but the Quadruplet codons will help overcome most of the inconsistencies and limitations of the triplet codes. Details of this new Quadruplet genetic coding model and its subsequent potential applications including relevance to the origin of life will be presented.

Shankar Singh, Rama

2012-07-01

370

ON MINIMAL TREE REALIZATIONS OF LINEAR CODES NAVIN KASHYAP  

E-print Network

associated with them are now a major focus area of research in coding theory. Turbo codes, low-density parity-check (LDPC) codes, and expander codes are all examples of codes defined, in one way or another, on underlying

Kashyap, Navin

371

Improved source code editing for effective ad-hoc code reuse  

E-print Network

Code reuse is essential for productivity and software quality. Code reuse based on abstraction mechanisms in programming languages is a standard approach, but programmers also reuse code by taking an ad-hoc approach, in ...

Han, Sangmok

2011-01-01

372

Biological Information Transfer Beyond the Genetic Code: The Sugar Code  

NASA Astrophysics Data System (ADS)

In the era of genetic engineering, cloning, and genome sequencing the focus of research on the genetic code has received an even further accentuation in the public eye. In attempting, however, to understand intra- and intercellular recognition processes comprehensively, the two biochemical dimensions established by nucleic acids and proteins are not sufficient to satisfactorily explain all molecular events in, for example, cell adhesion or routing. The consideration of further code systems is essential to bridge this gap. A third biochemical alphabet forming code words with an information storage capacity second to no other substance class in rather small units (words, sentences) is established by monosaccharides (letters). As hardware oligosaccharides surpass peptides by more than seven orders of magnitude in the theoretical ability to build isomers, when the total of conceivable hexamers is calculated. In addition to the sequence complexity, the use of magnetic resonance spectroscopy and molecular modeling has been instrumental in discovering that even small glycans can often reside in not only one but several distinct low-energy conformations (keys). Intriguingly, conformers can display notably different capacities to fit snugly into the binding site of nonhomologous receptors (locks). This process, experimentally verified for two classes of lectins, is termed "differential conformer selection." It adds potential for shifts of the conformer equilibrium to modulate ligand properties dynamically and reversibly to the well-known changes in sequence (including anomeric positioning and linkage points) and in pattern of substitution, for example, by sulfation. In the intimate interplay with sugar receptors (lectins, enzymes, and antibodies) the message of coding units of the sugar code is deciphered. Their recognition will trigger postbinding signaling and the intended biological response. Knowledge about the driving forces for the molecular rendezvous, i.e., contributions of bidentate or cooperative hydrogen bonds, dispersion forces, stacking, and solvent rearrangement, will enable the design of high-affinity ligands or mimetics thereof. They embody clinical applications reaching from receptor localization in diagnostic pathology to cell type-selective targeting of drugs and inhibition of undesired cell adhesion in bacterial/viral infections, inflammation, or metastasis.

Gabius, H.-J.

373

Hospital coding of dementia: is it accurate?  

PubMed

This paper investigates the coding of dementia in the episode of care in a pilot study group (N=48) post hospital discharge and the possible implications of under-coding. The assigned ICD-10-AM codes and Diagnosis Related Groups were reviewed. Results demonstrate under-coding of dementia and of cognitive deficits; poor correlation between admission diagnoses and dementia codes on separation; and changes in individual patients' cognitive status across forms and assessments in the same admission. The complexities of accurately coding dementias will impact upon planning for future treatments and service provision and will have a flow-on effect for patients, hospitals, and patient care in Australia. PMID:22006431

Cummings, Elizabeth; Maher, Roxanne; Showell, Christopher Morris; Croft, Toby; Tolman, Jane; Vickers, James; Stirling, Christine; Robinson, Andrew; Turner, Paul

2011-01-01

374

User instructions for the CIDER Dose Code  

SciTech Connect

This document provides user instructions for the CIDER (Calculation of Individual Doses from Environmental Radionuclides) computer code. The CIDER code computes estimates of annual doses estimated for both reference individuals with a known residence and food consumption history. This document also provides user instructions for four utility codes used to build input data libraries for CIDER. These utility codes are ENVFAC (environmental factors), FOOFAC (food factors), LIFFAC (lifestyle factors), and ORGFAC (organ factors). Finally, this document provides user instructions for the EXPAND utility code. The EXPAND code processes a result file from CIDER and extracts a summary of the dose information for reporting or plotting purposes.

Eslinger, P.W.; Lessor, K.S.; Ouderkirk, S.J.

1994-05-01

375

Tandem Mirror Reactor Systems Code (Version I)  

SciTech Connect

A computer code was developed to model a Tandem Mirror Reactor. Ths is the first Tandem Mirror Reactor model to couple, in detail, the highly linked physics, magnetics, and neutronic analysis into a single code. This report describes the code architecture, provides a summary description of the modules comprising the code, and includes an example execution of the Tandem Mirror Reactor Systems Code. Results from this code for two sensitivity studies are also included. These studies are: (1) to determine the impact of center cell plasma radius, length, and ion temperature on reactor cost and performance at constant fusion power; and (2) to determine the impact of reactor power level on cost.

Reid, R.L.; Finn, P.A.; Gohar, M.Y.; Barrett, R.J.; Gorker, G.E.; Spampinaton, P.T.; Bulmer, R.H.; Dorn, D.W.; Perkins, L.J.; Ghose, S.

1985-09-01

376

A concatenated coding scheme for error control  

NASA Technical Reports Server (NTRS)

A concatenated coding scheme for error contol in data communications was analyzed. The inner code is used for both error correction and detection, however the outer code is used only for error detection. A retransmission is requested if either the inner code decoder fails to make a successful decoding or the outer code decoder detects the presence of errors after the inner code decoding. Probability of undetected error of the proposed scheme is derived. An efficient method for computing this probability is presented. Throughout efficiency of the proposed error control scheme incorporated with a selective repeat ARQ retransmission strategy is analyzed.

Lin, S.

1985-01-01

377

Coding of alternating-sign information in digital devices  

Microsoft Academic Search

Conclusions 1.Possible methods of representing alternating-sign data in computing devices.2.Rules have been derived for constructing displacement codes (D codes), complement codes (C codes), and combination codes (K codes).3.All types of alternating-sign binary codes have been divided into three groups and classified. Examples of representing data in such codes are cited.4.The rules of constructing self-complementing and inverse codes of binary-coded decimal

E. N. Banya; V. L. Selivanov

1987-01-01

378

Minimizing correlation effect using zero cross correlation code in spectral amplitude coding optical code division multiple access  

NASA Astrophysics Data System (ADS)

The use of minimal multiple access interference (MAI) in code design is investigated. Applying a projection and mapping techniques, a code that has a zero cross correlation (ZCC) between users in optical code division multiple access (OCDMA) is presented in this paper. The system is based on an incoherent light source—LED, spectral amplitude coding (SAC), and direct detection techniques at the receiver. Using power spectral density (PSD) function and Gaussian approximation, we obtain the signal-to-noise ratio (SNR) and the bit-error rate (BER) to measure the code performance. Making a comparison with other existing codes, e.g., Hadamard, MFH and MDW codes, we show that our code performs better at BER 10-9 in terms of number of simultaneous users. We also demonstrate the comparison between the theoretical and simulation analyses, where the results are close to one another.

Safar, Anuar Mat; Aljunid, Syed Alwee; Arief, Amir Razif; Nordin, Junita; Saad, Naufal

2012-01-01

379

Exploring Leonardo  

NSDL National Science Digital Library

This online exhibit on Leonardo da Vinci includes references and activities about both his scientific and artistic work. The site is divided into several sections, with each section offering background information about da Vinci, links to more in depth articles and classroom activities.

1997-01-01

380

Physical Activity Monitoring: Gadgets and Uses. Article #6 in a 6-Part Series  

ERIC Educational Resources Information Center

An early 15th century drawing by Leonardo da Vinci depicted a device that used gears and a pendulum that moved in synchronization with the wearer as he or she walked. This is believed to be the early origins of today's physical activity monitoring devices. Today's devices have vastly expanded on da Vinci's ancient concept with a myriad of options…

Mears, Derrick

2010-01-01

381

34 Development of a Robotic Prostatectomy Program  

Microsoft Academic Search

Presently, one of every eight radical prostactectomies per- formed in the United States is being done laparoscopically utilizing the da Vinci® Surgical System (Intuitive Surgical, Sunnyvale, CA). More than 115 hospitals in America use the da Vinci robot to perform radical prostatectomy. Con- tinued data collection and technical refinements are needed to address controversial issues such as positive margin rates,

Jason D. Engel; Harold A. Frazier

382

Transoral Robotic Surgery of the Skull Base: A Cadaver and Feasibility Study  

Microsoft Academic Search

Objective: The goal of this study was to determine the potential role as well as the current limitations of the da Vinci Surgical System robot in transoral surgery of the skull base. Methods: The da Vinci robot was used to perform dissections of the skull base on 7 cadaver heads with their neck and clavicles intact. Neurosurgeons and otolaryngologists familiar

John Y. K. Lee; Jason G. Newman; Gregory S. Weinstein; Bradley Lega; Jason Diaz; M. Sean Grady

2010-01-01

383

On the trail of Leonardo  

PubMed Central

A night course taken almost 25 years ago sparked an interest in Leonardo da Vinci that has become a passion for a London, Ont., neurosurgeon. Dr. Rolando Del Maestro now boasts one of the largest collections of da Vinci artifacts in North America. PMID:9538858

Johnston, P

1998-01-01

384

On the trail of Leonardo.  

PubMed

A night course taken almost 25 years ago sparked an interest in Leonardo da Vinci that has become a passion for a London, Ont., neurosurgeon. Dr. Rolando Del Maestro now boasts one of the largest collections of da Vinci artifacts in North America. PMID:9538858

Johnston, P

1998-03-24

385

Robotic Assistance in Cardiac Surgery  

Microsoft Academic Search

Da Vinci robotic assistance has taken minimally invasive cardiac surgery to a new frontier. Many of the surgical pro- cedures can be performed through ports resulting in less trauma and pain, reduced use of blood products, reduced hospital stay, fast functional recovery and superior cosmet- ic results. The attributes of the da Vinci robotic system, i.e., 3-dimensional vision with up

Sudhir Srivastava; Reyna Barrera; Shaune Quismundo

386

Modeling and optimal design of an optical MEMS tactile sensor for use in robotically assisted surgery  

Microsoft Academic Search

Currently, Minimally Invasive Surgery (MIS) performs through keyhole incisions using commercially available robotic surgery systems. One of the most famous examples of these robotic surgery systems is the da Vinci surgical system. In the current robotic surgery systems like the da Vinci, surgeons are faced with problems such as lack of tactile feedback during the surgery. Therefore, providing a real-time

Roozbeh Ahmadi; Masoud Kalantari; Muthukumaran Packirisamy; Javad Dargahi

2010-01-01

387

The Role of Robotic Surgery in Morbid Obesity  

Microsoft Academic Search

The purpose of this review was to form a collaborative opinion regarding the utility of robotic tech- nology, specifically the da Vinci™ robot (Intuitive Surgical, Inc., Sunnyvale, CA), for bariatric surgery. Eleven surgeons are currently using the da Vinci system to perform laparoscopic bariatric surgery. The surgeons were queried about the type of robotic bariatric surgery and number of cases

Garth Jacobsen; Robert Berger; Santiago Horgan

2003-01-01

388

Rate-compatible punctured convolutional codes (RCPC codes) and their applications  

Microsoft Academic Search

The concept of punctured convolutional codes is extended by punctuating a low-rate 1\\/N code periodically with period P to obtain a family of codes with rate P\\/(P+l), where l can be varied between 1 and (N-1)P. A rate-compatibility restriction on the puncturing tables ensures that all code bits of high rate codes are used by the lower-rate codes. This allows

Joachim Hagenauer

1988-01-01

389

Near-capacity dirty-paper code design: a source-channel coding approach  

Microsoft Academic Search

This paper examines near-capacity dirty-paper code designs based on source-channel coding. We first point out that the performance loss in signal-to-noise ratio (SNR) in our code designs can be broken into the sum of the packing loss from channel coding and a modulo loss, which is a function of the granular loss from source coding and the target dirty-paper coding

Yong Sun; Yang Yang; Angelos D. Liveris; Vladimir Stankovic ´; Zixiang Xiong

2009-01-01

390

Concatenation of space-time block codes and multilevel coding over Rayleigh fading channels  

Microsoft Academic Search

Space-time block codes (STBC) are designed to achieve the maximum possible diversity benefit. However, STBC needs to be concatenated with an outer code which provides a significant coding gain. Based on the capacity rule and a multilevel codes\\/multi-stage decoding (MLC\\/MSD) system, this paper presents three concatenation schemes of STBC and MLC\\/MSD. Punctured convolutional codes are selected as component codes according

Dong-Feng Yuan; Feng Zhang; Ai-Fen Sui; Zuo-Wei Li

2001-01-01

391

FALCON BUILDING LIST BY CODE rev 03-01-13 Bldg Code Bldg Name PROPERTY  

E-print Network

FALCON BUILDING LIST BY CODE rev 03-01-13 Bldg Code Bldg Name PROPERTY 5 Anatomy Chemistry CAMPUS-5-155 Page 1 of 24 #12;FALCON BUILDING LIST BY CODE rev 03-01-13 Bldg Code Bldg Name PROPERTY 160-Fischer Hall CAMPUS-284 Page 2 of 24 #12;FALCON BUILDING LIST BY CODE rev 03-01-13 Bldg Code Bldg Name PROPERTY

Sharp, Kim

392

Habitable zone code (Valle+, 2014)  

NASA Astrophysics Data System (ADS)

A C computation code that provide in output the distance dm (i for which the duration of habitability is longest, the corresponding duration tm (in Gyr), the width W (in AU) of the zone for which the habitability lasts tm/2, the inner (Ri) and outer (Ro) boundaries of the 4Gyr continuously habitable zone. The code read the input file HZ-input.dat, containing in each row the mass of the host star (range: 0.70-1.10M?), its metallicity (either Z (range: 0.005-0.004) or [Fe/H]), the helium-to-metal enrichment ratio (range: 1-3, standard value = 2), the equilibrium temperature for habitable zone outer boundary computation (range: 169-203K) and the planet Bond Albedo (range: 0.0-1.0, Earth = 0.3). The output is printed on-screen. Compilation: just use your favorite C compiler: gcc hz.c -lm -o HZ (2 data files).

Valle, G.; Dell'Omodarme, M.; Prada Moroni, P. G.; Degl'Innocenti, S.

2014-06-01

393

Axisymmetric generalized harmonic evolution code  

SciTech Connect

We describe the first axisymmetric numerical code based on the generalized harmonic formulation of the Einstein equations, which is regular at the axis. We test the code by investigating gravitational collapse of distributions of complex scalar field in a Kaluza-Klein spacetime. One of the key issues of the harmonic formulation is the choice of the gauge source functions, and we conclude that a damped-wave gauge is remarkably robust in this case. Our preliminary study indicates that evolution of regular initial data leads to formation both of black holes with spherical and cylindrical horizon topologies. Intriguingly, we find evidence that near threshold for black hole formation the number of outcomes proliferates. Specifically, the collapsing matter splits into individual pulses, two of which travel in the opposite directions along the compact dimension and one which is ejected radially from the axis. Depending on the initial conditions, a curvature singularity develops inside the pulses.

Sorkin, Evgeny [Max Planck Institute for Gravitational Physics (Albert Einstein Institute), Am Muehlenberg 1, D-14476, Golm (Germany)

2010-04-15

394

Local intensity adaptive image coding  

NASA Technical Reports Server (NTRS)

The objective of preprocessing for machine vision is to extract intrinsic target properties. The most important properties ordinarily are structure and reflectance. Illumination in space, however, is a significant problem as the extreme range of light intensity, stretching from deep shadow to highly reflective surfaces in direct sunlight, impairs the effectiveness of standard approaches to machine vision. To overcome this critical constraint, an image coding scheme is being investigated which combines local intensity adaptivity, image enhancement, and data compression. It is very effective under the highly variant illumination that can exist within a single frame or field of view, and it is very robust to noise at low illuminations. Some of the theory and salient features of the coding scheme are reviewed. Its performance is characterized in a simulated space application, the research and development activities are described.

Huck, Friedrich O.

1989-01-01

395

Computer access security code system  

NASA Technical Reports Server (NTRS)

A security code system for controlling access to computer and computer-controlled entry situations comprises a plurality of subsets of alpha-numeric characters disposed in random order in matrices of at least two dimensions forming theoretical rectangles, cubes, etc., such that when access is desired, at least one pair of previously unused character subsets not found in the same row or column of the matrix is chosen at random and transmitted by the computer. The proper response to gain access is transmittal of subsets which complete the rectangle, and/or a parallelepiped whose opposite corners were defined by first groups of code. Once used, subsets are not used again to absolutely defeat unauthorized access by eavesdropping, and the like.

Collins, Earl R., Jr. (inventor)

1990-01-01

396

The EGS5 Code System  

SciTech Connect

In the nineteen years since EGS4 was released, it has been used in a wide variety of applications, particularly in medical physics, radiation measurement studies, and industrial development. Every new user and every new application bring new challenges for Monte Carlo code designers, and code refinements and bug fixes eventually result in a code that becomes difficult to maintain. Several of the code modifications represented significant advances in electron and photon transport physics, and required a more substantial invocation than code patching. Moreover, the arcane MORTRAN3[48] computer language of EGS4, was highest on the complaint list of the users of EGS4. The size of the EGS4 user base is difficult to measure, as there never existed a formal user registration process. However, some idea of the numbers may be gleaned from the number of EGS4 manuals that were produced and distributed at SLAC: almost three thousand. Consequently, the EGS5 project was undertaken. It was decided to employ the FORTRAN 77 compiler, yet include as much as possible, the structural beauty and power of MORTRAN3. This report consists of four chapters and several appendices. Chapter 1 is an introduction to EGS5 and to this report in general. We suggest that you read it. Chapter 2 is a major update of similar chapters in the old EGS4 report[126] (SLAC-265) and the old EGS3 report[61] (SLAC-210), in which all the details of the old physics (i.e., models which were carried over from EGS4) and the new physics are gathered together. The descriptions of the new physics are extensive, and not for the faint of heart. Detailed knowledge of the contents of Chapter 2 is not essential in order to use EGS, but sophisticated users should be aware of its contents. In particular, details of the restrictions on the range of applicability of EGS are dispersed throughout the chapter. First-time users of EGS should skip Chapter 2 and come back to it later if necessary. With the release of the EGS4 version, a deliberate attempt was made to present example problems in order to help the user ''get started'', and we follow that spirit in this report. A series of elementary tutorial user codes are presented in Chapter 3, with more sophisticated sample user codes described in Chapter 4. Novice EGS users will find it helpful to read through the initial sections of the EGS5 User Manual (provided in Appendix B of this report), proceeding then to work through the tutorials in Chapter 3. The User Manuals and other materials found in the appendices contain detailed flow charts, variable lists, and subprogram descriptions of EGS5 and PEGS. Included are step-by-step instructions for developing basic EGS5 user codes and for accessing all of the physics options available in EGS5 and PEGS. Once acquainted with the basic structure of EGS5, users should find the appendices the most frequently consulted sections of this report.

Hirayama, Hideo; Namito, Yoshihito; /KEK, Tsukuba; Bielajew, Alex F.; Wilderman, Scott J.; U., Michigan; Nelson, Walter R.; /SLAC

2005-12-20

397

Fountain Codes and Invertible Matrices  

Microsoft Academic Search

This paper deals with Fountain codes, and especially with their encoding\\u000amatrices, which are required here to be invertible. A result is stated that an\\u000aencoding matrix induces a permutation. Also, a result is that encoding matrices\\u000aform a group with multiplication operation. An encoding is a transformation,\\u000awhich reduces the entropy of an initially high-entropy input vector. A special

Mikko Malinen

2009-01-01

398

An implicit smooth particle hydrodynamic code  

NASA Astrophysics Data System (ADS)

An implicit version of the Smooth Particle Hydrodynamic (SPH) code SPHINX has been written and is working. In conjunction with the SPHINX code the new implicit code models fluids and solids under a wide range of conditions. SPH codes are Lagrangian, meshless and use particles to model the fluids and solids. The implicit code makes use of the Krylov iterative techniques for solving large linear-systems and a Newton-Raphson method for non-linear corrections. It uses numerical derivatives to construct the Jacobian matrix. It uses sparse techniques to save on memory storage and to reduce the amount of computation. It is believed that this is the first implicit SPH code to use Newton-Krylov techniques, and is also the first implicit SPH code to model solids. A description of SPH and the techniques used in the implicit code are presented. Then the results of a number of tests cases are discussed, which include a shock tube problem, a Rayleigh-Taylor problem, a breaking dam problem, and a single jet of gas problem. The results are shown to be in very good agreement with analytic solutions, experimental results, and the explicit SPHINX code. In the case of the single jet of gas case it has been demonstrated that the implicit code can do a problem in much shorter time than the explicit code. The problem was, however, very unphysical, but it does demonstrate the potential of the implicit code. It is a first step toward a useful implicit SPH code.

Knapp, Charles Edmond

399

An implicit Smooth Particle Hydrodynamic code  

SciTech Connect

An implicit version of the Smooth Particle Hydrodynamic (SPH) code SPHINX has been written and is working. In conjunction with the SPHINX code the new implicit code models fluids and solids under a wide range of conditions. SPH codes are Lagrangian, meshless and use particles to model the fluids and solids. The implicit code makes use of the Krylov iterative techniques for solving large linear-systems and a Newton-Raphson method for non-linear corrections. It uses numerical derivatives to construct the Jacobian matrix. It uses sparse techniques to save on memory storage and to reduce the amount of computation. It is believed that this is the first implicit SPH code to use Newton-Krylov techniques, and is also the first implicit SPH code to model solids. A description of SPH and the techniques used in the implicit code are presented. Then, the results of a number of tests cases are discussed, which include a shock tube problem, a Rayleigh-Taylor problem, a breaking dam problem, and a single jet of gas problem. The results are shown to be in very good agreement with analytic solutions, experimental results, and the explicit SPHINX code. In the case of the single jet of gas case it has been demonstrated that the implicit code can do a problem in much shorter time than the explicit code. The problem was, however, very unphysical, but it does demonstrate the potential of the implicit code. It is a first step toward a useful implicit SPH code.

Charles E. Knapp

2000-04-01

400

Penal Code, 24 June 1987.  

PubMed

This document contains provisions of Liechtenstein's 1987 Penal Code relating to sterilization, abortion, polygamy, the protection of women and children, crimes related to marriage, and failure to provide support. The Code holds that sexual sterilization carried out at the patient's request is lawful if the patient is at least 25 years old. Performing or inducing an abortion is punishable with imprisonment unless: 1) the abortion is necessary to prevent serious danger to the life or health of the pregnant woman, 2) the pregnant woman was under 14 years old and not married to the man who impregnated her, or 3) the abortion is performed to save the woman's life. The Code also imposes a prison sentence on anyone abducting a woman who is helpless or unable to resist in order to sexually abuse the woman. Bigamy carries a prison term of up to 3 years, and a prison term of up to 1 year is applied in cases where a person deceives another or compels another into marriage. Removing a minor from the control of those authorized to rear said minor can lead to a prison term of up to 1 year, and abandonment of a minor can lead to a prison term of up to 3 years. Violation of the duty of financial support called for by family law can invoke a prison term of up to 6 months. PMID:12346688

1987-01-01

401

Image Sequence Coding by Octrees  

NASA Astrophysics Data System (ADS)

This work addresses the problem of representing an image sequence as a set of octrees. The purpose is to generate a flexible data structure to model video signals, for applications such as motion estimation, video coding and/or analysis. An image sequence can be represented as a 3-dimensional causal signal, which becomes a 3 dimensional array of data when the signal has been digitized. If it is desirable to track long-term spatio-temporal correlation, a series of octree structures may be embedded on this 3D array. Each octree looks at a subset of data in the spatio-temporal space. At the lowest level (leaves of the octree), adjacent pixels of neighboring frames are captured. A combination of these is represented at the parent level of each group of 8 children. This combination may result in a more compact representation of the information of these pixels (coding application) or in a local estimate of some feature of interest (e.g., velocity, classification, object boundary). This combination can be iterated bottom-up to get a hierarchical description of the image sequence characteristics. A coding strategy using such data structure involves the description of the octree shape using one bit per node except for leaves of the tree located at the lowest level, and the value (or parametric model) assigned to each one of these leaves. Experiments have been performed to represent Common Image Format (CIF) sequences.

Leonardi, Riccardo

1989-11-01

402

Some optimal partial-unit-memory codes. [time-invariant binary convolutional codes  

NASA Technical Reports Server (NTRS)

A class of time-invariant binary convolutional codes is defined, called partial-unit-memory codes. These codes are optimal in the sense of having maximum free distance for given values of R, k (the number of encoder inputs), and mu (the number of encoder memory cells). Optimal codes are given for rates R = 1/4, 1/3, 1/2, and 2/3, with mu not greater than 4 and k not greater than mu + 3, whenever such a code is better than previously known codes. An infinite class of optimal partial-unit-memory codes is also constructed based on equidistant block codes.

Lauer, G. S.

1979-01-01

403

NHA HYDROGEN SAFETY CODES AND STANDARDS ACTIVITIES  

E-print Network

needs to be disseminated to building code officials such as National Fire Protection Association (NFPA with the International Codes Council (ICC) Ad Hoc Committee on Hydrogen. NFPA liaison has recently been established

404

Efficient, transparent, and comprehensive runtime code manipulation  

E-print Network

This thesis addresses the challenges of building a software system for general-purpose runtime code manipulation. Modern applications, with dynamically-loaded modules and dynamically-generated code, are assembled at runtime. ...

Bruening, Derek L. (Derek Lane), 1976-

2004-01-01

405

Reusing code by reasoning about its purpose  

E-print Network

When programmers face unfamiliar or challenging tasks, code written by others could give them inspiration or reusable pieces. But how can they find code appropriate for their goals? This thesis describes a programming ...

Arnold, Kenneth Charles

2010-01-01

406

2010 Texas Jurisdiction Energy Code Adoption Survey  

E-print Network

In March, 2010, The Energy Systems Laboratory at Texas A&M University conducted a Code Survey of Texas Jurisdictions having populations greater than 25,000. The results for Energy Code Adoption are as follows....

407

MHD simulations with the FLASH code  

NASA Astrophysics Data System (ADS)

The FLASH code developed at the University of Chicago Flash Center is a modular, general-purpose, adaptive, parallel simulation code capable of handling compressible flow problems in various physical, in particular astrophysical, environments. Starting with version release 2.0, the FLASH code supports the equations of magnetohydrodynamics (MHD). In this paper, we will describe the present state of the code and the integration of the MHD module into the code framework. We will further describe specific implementation details of the FLASH MHD module. Finally, we will provide examples of simulations of ideal and resistive MHD fluids and of self-gravitating magnetized plasmas. The FLASH code is available for public distribution. Both information regarding code licensing and code distribution can be found at the Flash Center web site: http://flash.uchicago.edu.

Linde, Timur

2002-03-01

408

Using diagrammatic explorations to understand code  

E-print Network

Understanding code is a significant challenge for developers. This thesis examines the limitations of current tools that use diagrams to assist code comprehension and demonstrates the value of four design principles: * ...

Sinha, Vineet, 1978-

2008-01-01

409

Search for optimal distance spectrum convolutional codes  

NASA Technical Reports Server (NTRS)

In order to communicate reliably and to reduce the required transmitter power, NASA uses coded communication systems on most of their deep space satellites and probes (e.g. Pioneer, Voyager, Galileo, and the TDRSS network). These communication systems use binary convolutional codes. Better codes make the system more reliable and require less transmitter power. However, there are no good construction techniques for convolutional codes. Thus, to find good convolutional codes requires an exhaustive search over the ensemble of all possible codes. In this paper, an efficient convolutional code search algorithm was implemented on an IBM RS6000 Model 580. The combination of algorithm efficiency and computational power enabled us to find, for the first time, the optimal rate 1/2, memory 14, convolutional code.

Connor, Matthew C.; Perez, Lance C.; Costello, Daniel J., Jr.

1993-01-01

410

The FLUKA code: description and benchmarking  

SciTech Connect

The physics model implemented inside the FLUKA code are briefly described, with emphasis on hadronic interactions. Examples of the capabilities of the code are presented including basic (thin target) and complex benchmarks.

Battistoni, G.; Muraro, S.; Sala, P. R. [INFN sezione di Milano, via Celoria 16, I-20133 Milan (Italy); Cerutti, F.; Ferrari, A.; Roesler, S. [CERN, CH-1211 GENEVE 23 (Switzerland); Fasso, A. [SLAC, Stanford (United States); Ranft, J. [Siegen University (Germany)

2007-03-19

411

The FLUKA Code: Description And Benchmarking  

SciTech Connect

The physics model implemented inside the FLUKA code are briefly described, with emphasis on hadronic interactions. Examples of the capabilities of the code are presented including basic (thin target) and complex benchmarks.

Battistoni, Giuseppe; Muraro, S.; Sala, Paola R.; /INFN, Milan; Cerutti, Fabio; Ferrari, A.; Roesler, Stefan; /CERN; Fasso, A.; /SLAC; Ranft, J.; /Siegen U.

2007-09-18

412

Evolutionary Implications of Genetic Code Deviations.  

National Technical Information Service (NTIS)

By extending the standard genetic code into a temperature dependent regime, the authors propose a train of molecular events leading to alternative coding. The first few examples of these deviations have already been reported in some ciliated protozoans an...

J. Chela Flores

1986-01-01

413

Interfacing network coding with TCP: an implementation  

E-print Network

In previous work (`Network coding meets TCP') we proposed a new protocol that interfaces network coding with TCP by means of a coding layer between TCP and IP. Unlike the usual batch-based coding schemes, the protocol uses a TCP-compatible sliding window code in combination with new rules for acknowledging bytes to TCP that take into account the network coding operations in the lower layer. The protocol was presented in a theoretical framework and considered only in conjunction with TCP Vegas. In this paper we present a real-world implementation of this protocol that addresses several important practical aspects of incorporating network coding and decoding with TCP's window management mechanism. Further, we work with the more widespread and practical TCP Reno. Our implementation significantly advances the goal of designing a deployable, general, TCP-compatible protocol that provides the benefits of network coding.

Sundararajan, Jay Kumar; Medard, Muriel; Mitzenmacher, Michael; Barros, Joao

2009-01-01

414

Coded modulation with Low Density Parity Check codes  

E-print Network

with gray labeling 30 II Profiles used in simulations 46 III Memoryless mapper and waveforms in MSK with a [1, D/1+ D] CPE 50 IV Memoryless mapper with a [1, 1/1+ D] CPE V Memoryless mapper with a [D, 1+ D] CPE VI Variables in the the expanded graph... Comparison of irregular LDPC optimized with GA with random construction vs turbo TCM:20000 information bits 41 Performance of irregular LDPC+multilevel coding optimized with DE and 1A construction:60000 information bits . 42 16 Performance of irregular...

Narayanaswami, Ravi

2012-06-07

415

Nascap-2k Spacecraft Charging Code Overview  

Microsoft Academic Search

Nascap-2k is a modern spacecraft charging code, replacing the older codes NASA Charging Analyzer Program for GEosynchronous Orbit (NASCAP\\/GEO), NASA Charging Analyzer Program for Low-Earth Orbit (NASCAP\\/LEO), Potentials Of Large objects in the Auroral Region (POLAR), and Dynamic Plasma Analysis Code (DynaPAC). The code builds on the physical principles, mathematical algorithms, and user experience developed over three decades of spacecraft

Myron J. Mandell; Victoria A. Davis; David L. Cooke; Adrian T. Wheelock; C. J. Roth

2006-01-01

416

Locating dominating codes: Bounds and extremal cardinalities  

E-print Network

In this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses should determine a malfunctioning processor or an intruder. Here, we present our more significant contributions on \\lambda-codes and \\eta-codes concerning concerning bounds, extremal values and realization theorems.

Cáceres, José; Mora, Mercè; Pelayo, Ignacio M; Puertas, María Luz

2012-01-01

417

gyrfalcON: N-body code  

NASA Astrophysics Data System (ADS)

gyrfalcON (GalaxY simulatoR using falcON) is a full-fledged N-body code using Dehnen's force algorithm of complexity O(N) (falcON); this algorithm is approximately 10 times faster than an optimally coded tree code. The code features individual adaptive time steps and individual (but fixed) softening lengths. gyrfalcON is included in and requires NEMO to run.

Dehnen, Walter

2014-02-01

418

Structural Constraints in Code-Switched Advertising  

Microsoft Academic Search

Code switching, the use of mixed-language expressions, is gaining prominence in advertising targeting linguistic minorities. Two studies investigate the existence of linguistic rules governing the use of code switching and identify situations in which those rules have a greater impact on persuasion. The studies extend Myers-Scotton's 1995 model of code switching by revealing an interaction between linguistic correctness and type

David Luna; Dawn Lerman

2005-01-01

419

Code-Alteration Among Arab College Students.  

ERIC Educational Resources Information Center

Investigates Jordanian university students' attitudes toward code-switching (CS) and code mixing (CM) to find out when and why they code switch and the most frequent English expressions that they use in Arabic discourse. A three-section questionnaire was distributed to students (n=352). Students show both positive and negative attitudes toward…

Hussein, Riyad F.

1999-01-01

420

Ultra-narrow bandwidth voice coding  

DOEpatents

A system of removing excess information from a human speech signal and coding the remaining signal information, transmitting the coded signal, and reconstructing the coded signal. The system uses one or more EM wave sensors and one or more acoustic microphones to determine at least one characteristic of the human speech signal.

Holzrichter, John F. (Berkeley, CA); Ng, Lawrence C. (Danville, CA)

2007-01-09

421

DEPARTMENT CODE Department of Computer Science  

E-print Network

DEPARTMENT CODE Department of Computer Science College of Natural Sciences Colorado State and Amendment of this Code 19 #12;1 MISSION AND OBJECTIVES 3 Preamble This Code of the Department of Computer Science1 is a manual of operation that describes the functioning of the Department by codifying policy

422

Parameter Identification of a Numerical Transport Code  

SciTech Connect

A parameter identification process is presented to obtain effective, resultant properties of a numerical transport code. The method is demonstrated using NUFT (Nonisothermal Unsaturated-Saturated Flow and Transportation model) [1], as a transport code, and the effective heat conductivity and thermal diffusivity as effective parameters. A numerical application example shows that effective transport code in a variety of boundary conditions.

Danko, G.; Jain, A.

2002-02-26

423

Fast Code-Phase Alignment of GPS  

E-print Network

Fast Code-Phase Alignment of GPS Signals Using Virtex-4 FPGAs Usama Malik, Oliver Diessel School based system for aligning the code-phase of a received GPS signal. The core operation involves. We outline the proposed system, which stores the code in on-chip memory blocks and uses both

Diessel, Oliver

424

Weight Distribution and Randomness of Linear Codes.  

National Technical Information Service (NTIS)

Finding the weight distributions of block codes is a problem of theoretical and practical interest. Yet the weight distributions of most block codes are still unknown except for a few classes of block codes. Here, by using the inclusion and exclusion prin...

K. Cheung

1989-01-01

425

Fingerprinting Codes and Separating Hash Families  

E-print Network

Fingerprinting Codes and Separating Hash Families Submitted by Penying Rochanakul for the degree.........................................(Penying Rochanakul) Date: 1 #12;Abstract The thesis examines two related combinatorial objects, namely fingerprinting codes and separating hash families. Fingerprinting codes are combinatorial objects that have been

Sheldon, Nathan D.

426

On the factor set of code loops  

E-print Network

A Code loop on a binary linear code that is doubly even with a factor set is shown to be a central loop, conjugacy closed loop, Burn loop and extra loop. General forms of the identities that define the factor set of a code are deduced.

Temitope Gbolahan Jaiyeola

2008-06-05

427

7 CFR 201.24 - Code designation.  

...Agriculture 3 2014-01-01 2014-01-01 false Code designation. 201.24 Section 201.24 Agriculture...REGULATIONS Labeling Agricultural Seeds § 201.24 Code designation. The code designation used in lieu of the full name...

2014-01-01

428

Code Creation in Endogenous Merger Experiments  

E-print Network

Code Creation in Endogenous Merger Experiments Lauren Feiler and Colin F. Camerer Division language, or code, when organizations merge, and whether participants' valuations of mergers take," separately at two universities, and create code words to describe a series of pictures from their own college

Greer, Julia R.

429

MELCOR Accident Consequence Code System (MACCS)  

Microsoft Academic Search

This report describes the MACCS computer code. The purpose of this code is to simulate the impact of severe accidents at nuclear power plants on the surrounding environment. MACCS has been developed for the US Nuclear Regulatory Commission to replace the previous CRAC2 code, and it incorporates many improvements in modeling flexibility in comparison to CRAC2. The principal phenomena considered

D. I. Chanin; J. L. Sprung; L. T. Ritchie; Hong-Nian Jow

2012-01-01

430

MELCOR Accident Consequence Code System (MACCS)  

Microsoft Academic Search

This report describes the MACCS computer code. The purpose of this code is to simulate the impact of severe accidents at nuclear power plants on the surrounding environment. MACCS has been developed for the US Nuclear Regulatory Commission to replace the previously used CRAC2 code, and it incorporates many improvements in modeling flexibility in comparison to CRAC2. The principal phenomena

J. A. Rollstin; D. I. Chanin; H. N. Jow

1990-01-01

431

MELCOR Accident Consequence Code System (MACCS)  

Microsoft Academic Search

This report describes the MACCS computer code. The purpose of this code is to simulate the impact of severe accidents at nuclear power plants on the surrounding environment. MACCS has been developed for the US Nuclear Regulatory Commission to replace the previously used CRAC2 code, and it incorporates many improvements in modeling flexibility in comparison to CRAC2. The principal phenomena

H. N. Jow; J. L. Sprung; L. T. Ritchie; J. A. Rollstin; D. I. Chanin

2010-01-01

432

Blind recognition of punctured convolutional codes  

Microsoft Academic Search

This paper presents an algorithm for blind recognition of punctured convolutional codes with application for instance in adaptive systems. Minimal basic encoding matrices of the original convolutional codes and their puncturing patterns are determined according to the accounted parity check matrices of the punctured convolutional codes.

Peizhong Lu; Li Shen; Xiangyang Luo; Yan Zou

2004-01-01

433

On Graph-Based Convolutional Codes  

Microsoft Academic Search

Abstract Today’s communication systems demand,increasing capacities but simultane- ously decreasing error probabilities in order to provide fast and reliable data transfers. Therefore, channel coding, using proper codes with good error- correcting probabilities, like large free distances, has to be applied. In this thesis, focusing on convolutional codes, dierent distance proper- ties like the column distance, row distance, and, the most

Florian Hug

2008-01-01

434

An Investigation of Different String Coding Methods.  

ERIC Educational Resources Information Center

Investigates techniques for automatic coding of English language strings which involve titles drawn from bibliographic files, but do not require prior knowledge of source. Coding methods (basic, maximum entropy principle), results of test using 6,260 titles from British National Bibliography, and variations in code element ordering are…

Goyal, Pankaj

1984-01-01

435

Code red worm propagation modeling and analysis  

Microsoft Academic Search

The Code Red worm incident of July 2001 has stimulated activities to model and analyze Internet worm propagation. In this paper we provide a careful analysis of Code Red propagation by accounting for two factors: one is the dynamic countermeasures taken by ISPs and users; the other is the slowed down worm infection rate because Code Red rampant propagation caused

Cliff Changchun Zou; Weibo Gong; Donald F. Towsley

2002-01-01

436

Code-Copying in Irano-Turkic.  

ERIC Educational Resources Information Center

Different types of Persian impact on Irano-Turkic language varieties are surveyed and classified according to the Code-Copying model, which implies that copies of elements from foreign codes are inserted, globally or selectively, into a basic code that provides the morphosyntactic frame for the insertion. The study investigates under what…

Johanson, Lars

1998-01-01

437

Concatenated coding with two levels of interleaving  

Microsoft Academic Search

A performance evaluation of an electronic counter counter measure (ECCM) communication system in a worst case partial band noise and partial band tone jamming scenario is documented. The ECCM communication system is composed of two levels of channel coding (concatenated coding) and two levels of interleaving. An analysis was performed for a concatenated code consisting of either a Reed-Solomon or

Samuel Lim; Michael Newhouse

1991-01-01

438

Computationally efficient multiuser detection for coded CDMA  

Microsoft Academic Search

Computationally efficient multiuser detection for coded asynchronous CDMA systems is investigated. The particular receiver studied is a near-far resistant multiuser detector known as the projection receiver (PR). The PR performs multiple access interference resolution for CDMA with error control coding. The output of the front-end of the projection receiver yields a metric for decoding of the coded sequences. This metric

C. Schlegel; V. J. Mathews

1997-01-01

439

Representing Code History with Development Environment Events  

E-print Network

history with a semantic representation. Based on Epicea, we want to enrich code sharing with extra such limitations and describe scenarios and requirements for tracking fine-grained code history with a semantic representation. We present Epicea, an early proto- type implementation. We want to enrich code sharing with extra

Paris-Sud XI, Université de

440

Variance propagation using the VP Code  

SciTech Connect

The VP (Variance Propagation) Code has been developed at Los Alamos in the Safeguards Systems Group to provide offline variance propagation and systems analysis for nuclear material processing facilities. VP provides a flexible, menu-driven user interface. Outputs from the code are in the form of tables and graphs. The code runs on IBM PC or compatible computers. 7 figs.

Kern, E.A.

1991-01-01

441

Process-shared and persistent code caches  

Microsoft Academic Search

Software code caches are increasingly being used to amortizethe runtime overhead of tools such as dynamic optimizers, simulators, and instrumentation engines. The additional memory consumed by these caches, along with the data structures used to manage them, limits the scalability of dynamic tool deployment. Inter-process sharing of code caches significantly improves the ability to efficiently apply code caching tools to

Derek Bruening; Vladimir Kiriansky

2008-01-01

442

UK Quality Code for Higher Education  

E-print Network

UK Quality Code for Higher Education Chapter B11: Research degrees Part B: Assuring and enhancing of sound practice 7 Higher education provider arrangements 7 The research environment 9 Selection Development Framework 35 #12;The UK Quality Code for Higher Education 1 About the Quality Code The UK Quality

Krauss, Thomas

443

Nascap-2k Spacecraft Charging Code Overview.  

National Technical Information Service (NTIS)

Nascap-2k is a modern spacecraft charging code, replacing the older codes NASCAP/GEO, NASCAP/LEO, POLAR, and DynaPAC. The code builds on the physical principles, mathematical algorithms, and user experience developed over three decades of spacecraft charg...

A. T. Wheelock, C. J. Roth, D. L. Cooke, M. J. Mandell, V. A. Davis

2005-01-01

444

Classification via Minimum Incremental Coding Length (MICL)  

E-print Network

domain-specific information. All MATLAB code and classification results are publicly available for peer1 Classification via Minimum Incremental Coding Length (MICL) John Wright, Student Member, IEEE the minimum number of additional bits to code the test sample, subject to an allowable distortion. We

Ma, Yi

445

An Analysis of IrisCode  

Microsoft Academic Search

IrisCode is an iris recognition algorithm developed in 1993 and continuously improved by Daugman. It has been extensively applied in commercial iris recognition systems. IrisCode representing an iris based on coarse phase has a number of properties including rapid matching, binomial impostor distribution and a predictable false acceptance rate. Because of its successful applications and these properties, many similar coding

Adams Wai-Kin Kong; David Zhang; Mohamed S. Kamel

2010-01-01

446

A concatenated coding scheme for error control  

NASA Technical Reports Server (NTRS)

A concatenated coding scheme for error control in data communications is analyzed. The inner code is used for both error correction and detection, however the outer code is used only for error detection. A retransmission is requested if the outer code detects the presence of errors after the inner code decoding. The probability of undetected error of the above error control scheme is derived and upper bounded. Two specific exmaples are analyzed. In the first example, the inner code is a distance-4 shortened Hamming code with generator polynomial (X+1)(X(6)+X+1) = X(7)+X(6)+X(2)+1 and the outer code is a distance-4 shortened Hamming code with generator polynomial (X+1)X(15+X(14)+X(13)+X(12)+X(4)+X(3)+X(2)+X+1) = X(16)+X(12)+X(5)+1 which is the X.25 standard for packet-switched data network. This example is proposed for error control on NASA telecommand links. In the second example, the inner code is the same as that in the first example but the outer code is a shortened Reed-Solomon code with symbols from GF(2(8)) and generator polynomial (X+1)(X+alpha) where alpha is a primitive element in GF(z(8)).

Lin, S.

1985-01-01

447

Advanced coding techniques: theory and practice  

NASA Astrophysics Data System (ADS)

In this paper, we compare performance of three classes of forward error correction schemes for 40 Gb/s optical transmission systems. The first class is based on the concatenation of RS codes and this is employed in state-of-the-art fiber-optics communication systems. The second class of codes is the turbo product codes with BCH component codes. The application of these codes in optical communication systems was extensively studied by Sab et al., and Mizuochi et al., and they are being considered for the next generation of long-haul systems. The third class of codes is the low-density parity-check (LDPC) codes that have gained great significance over the past decade. Structured binary LDPC codes, nonbinary LDPC codes, and generalized LDPC codes are considered in this paper. A sophisticated simulator that models all major transmission impairments is used to assess the performance of the error correction schemes. The simulation results show that LDPC codes outperform significantly two other classes of codes.

Vasic, Bane; Djordjevic, Ivan B.

2005-10-01

448

Working with Code UIC Linux Users Group  

E-print Network

outline editors compiling debugging resources Working with Code UIC Linux Users Group September 8, 2010 UIC Linux Users Group Working with Code #12;outline editors compiling debugging resources editors resources resources UIC Linux Users Group Working with Code #12;outline editors compiling debugging

Ben-Arie, Jezekiel

449

Low complexity algebraic multicast network codes  

Microsoft Academic Search

We present a low complexity algorithmfor designing algebraic codes that achieve the informationtheoretic capacity for the multicast problemon directed acyclic networks. These codes operateovereld sizes which are signicantly smaller thanthose previously known, leading to signicantly lowerdesign and implementation complexity, and networklink usage. These codes can be extended for networkswith cycles and delays, and for robustness properties.

Sidharth Jaggi; Philip A. Chou; Kamal Jain

2003-01-01

450

E cient Code Certi cation Dexter Kozen  

E-print Network

to the certi cation of com- piled code. We ensure a basic but nontrivial level of code safety, including control ow safety, memory safety, and stack safety. The system is designed to be simple, e cient of the Internet. Recent work by Necula and Lee 5, 6] on proof carrying code (PCC), by Mor- risett et al. 4

Kozen, Dexter

451

The general theory of convolutional codes  

NASA Technical Reports Server (NTRS)

This article presents a self-contained introduction to the algebraic theory of convolutional codes. This introduction is partly a tutorial, but at the same time contains a number of new results which will prove useful for designers of advanced telecommunication systems. Among the new concepts introduced here are the Hilbert series for a convolutional code and the class of compact codes.

Mceliece, R. J.; Stanley, R. P.

1993-01-01

452

Associated Students of Boise State University Governing Code  

E-print Network

Associated Students of Boise State University Governing Code CHAPTERS get caps and underlined I. Titles are in bold. Definitions: Underlined with colon, always end with a period. I. Code Overview II. Ethics Code III. Financial Code IV. Executive Council Code V. Assembly Code VI. Election Code #12;CHAPTER

Barrash, Warren

453

Tracking Code Clone for Software Traceability and Quality  

Microsoft Academic Search

As one of the major problems in software maintenance, code clone, a pair of duplicated code in a source code, is well known. For software improvement, it is valuable to track code clone which has potential risk. This is because to determine how to treat code clones needs deep insight for the code clones. However, such code clone tracking is

Shinji Kawaguchi; Hajimu Iida

2007-01-01

454

Fountain Codes and Invertible Matrices  

E-print Network

This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a group with multiplication operation. An encoding is a transformation, which reduces the entropy of an initially high-entropy input vector. A special encoding matrix, with which the entropy reduction is more effective than with matrices created by the Ideal Soliton distribution is formed. Experimental results with entropy reduction are shown.

Malinen, Mikko

2009-01-01

455

Responsible Code of Nanotechnology Development  

NSDL National Science Digital Library

This presentation was given at the 2008 Arizona Nanotechnology Symposium on the topic of developing a worldwide standard governing the development and proliferation of nanotechnology products. Self industry policing guide will help companies and educational institutions to develop nanotechnology products that meet environmental standards, employee health standards, disposal, and a myraid of other guidelines. Can the industry self police its development activities and keep the public safe. See this presentation for information on the development and implementation of the Nanotechnology Code in the Europe.

Friedrichs, Steffi

2008-10-24

456

Reconstruction of coded aperture images  

NASA Technical Reports Server (NTRS)

Balanced correlation method and the Maximum Entropy Method (MEM) were implemented to reconstruct a laboratory X-ray source as imaged by a Uniformly Redundant Array (URA) system. Although the MEM method has advantages over the balanced correlation method, it is computationally time consuming because of the iterative nature of its solution. Massively Parallel Processing, with its parallel array structure is ideally suited for such computations. These preliminary results indicate that it is possible to use the MEM method in future coded-aperture experiments with the help of the MPP.

Bielefeld, Michael J.; Yin, Lo I.

1987-01-01

457

Princeton spectral equilibrium code: PSEC  

SciTech Connect

A fast computer code has been developed to calculate free-boundary solutions to the plasma equilibrium equation that are consistent with the currents in external coils and conductors. The free-boundary formulation is based on the minimization of a mean-square error epsilon while the fixed-boundary solution is based on a variational principle and spectral representation of the coordinates x(psi,theta) and z(psi,theta). Specific calculations using the Columbia University Torus II, the Poloidal Divertor Experiment (PDX), and the Tokamak Fusion Test Reactor (TFTR) geometries are performed.

Ling, K.M.; Jardin, S.C.

1984-03-01

458

Understanding Mixed Code and Classroom Code-Switching: Myths and Realities  

ERIC Educational Resources Information Center

Background: Cantonese-English mixed code is ubiquitous in Hong Kong society, and yet using mixed code is widely perceived as improper. This paper presents evidence of mixed code being socially constructed as bad language behavior. In the education domain, an EDB guideline bans mixed code in the classroom. Teachers are encouraged to stick to…

Li, David C. S.

2008-01-01

459

The Charter and Code The European Charter for Researchers and the Code of Conduct for the  

E-print Network

The Charter and Code · The European Charter for Researchers and the Code of Conduct for the Recruitment of Researchers were drawn up in 2005 and are known as the Charter and Code. · The aim is to ensure out in the Charter and Code. · Over 900 European research institutions have signed the Charter

Johansen, Tom Henning

460

Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1  

Microsoft Academic Search

A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built using a parallel concatenation of two recursive systematic convolutional codes, and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders

Claude Berrou; A. Glavieux; Punya Thitimajshima

1993-01-01

461

Code of Student Conduct (Replacing the Code of Disciplinary Procedures for Students)  

E-print Network

Code of Student Conduct (Replacing the Code of Disciplinary Procedures for Students) Effective March 23, 2006 Revised May 25, 2007, Board of Regents CODE OF STUDENT CONDUCT 1.0 PREFACE 2 on Maintenance and Use of Records II Housing Fines #12;CODE OF STUDENT CONDUCT 1.0 PREFACE Memorial University

deYoung, Brad

462

CodedStream: Live Media Streaming with Overlay Coded Jiang Guo, Ying Zhu, Baochun Li  

E-print Network

CodedStream: Live Media Streaming with Overlay Coded Multicast Jiang Guo, Ying Zhu, Baochun Li in the overlay network remain unused. In this paper, we propose CodedStream, a high-bandwidth live media and network coding may indeed bring significant benefits with respect to improving the quality of live media

Li, Baochun

463

The Hardness of Code Equivalence over Fq and its Application to Code-based Cryptography  

E-print Network

The Hardness of Code Equivalence over Fq and its Application to Code-based Cryptography Nicolas review the hardness of code equivalence over Fq due to some recent negative results and argue and the hidden subgroup problem. Keywords: Code Equivalence, Isometry, Hardness, Zero-Knowledge Protocols

Paris-Sud XI, Université de

464

Soft concatenation of space-time block codes and multilevel coding  

Microsoft Academic Search

Space-time block codes (STBC) are designed to achieve the maximum possible diversity benefit. However STBC are not designed to achieve an additional coding gain. Multilevel coding (MLC) has been paid more attention to for its rate change ability and the ease of the use of the capacity rule. It is shown that MLC are optimal outer codes to be concatenated

Dong-Feng Yuan; Feng Zhang; Ai-Fen Sul; Zuo-wei Li

2001-01-01

465

National Agenda for Hydrogen Codes and Standards  

SciTech Connect

This paper provides an overview of hydrogen codes and standards with an emphasis on the national effort supported and managed by the U.S. Department of Energy (DOE). With the help and cooperation of standards and model code development organizations, industry, and other interested parties, DOE has established a coordinated national agenda for hydrogen and fuel cell codes and standards. With the adoption of the Research, Development, and Demonstration Roadmap and with its implementation through the Codes and Standards Technical Team, DOE helps strengthen the scientific basis for requirements incorporated in codes and standards that, in turn, will facilitate international market receptivity for hydrogen and fuel cell technologies.

Blake, C.

2010-05-01

466

Syndrome source coding and its universal generalization  

NASA Technical Reports Server (NTRS)

A method of using error-correcting codes to obtain data compression, called syndrome-source-coding, is described in which the source sequence is treated as an error pattern whose syndrome forms the compressed data. It is shown that syndrome-source-coding can achieve arbitrarily small distortion with the number of compressed digits per source digit arbitrarily close to the entropy of a binary memoryless source. A universal generalization of syndrome-source-coding is formulated which provides robustly-effective, distortionless, coding of source ensembles.

Ancheta, T. C., Jr.

1975-01-01

467

TRAC code development status and plans  

SciTech Connect

This report summarizes the characteristics and current status of the TRAC-PF1/MOD1 computer code. Recent error corrections and user-convenience features are described, and several user enhancements are identified. Current plans for the release of the TRAC-PF1/MOD2 computer code and some preliminary MOD2 results are presented. This new version of the TRAC code implements stability-enhancing two-step numerics into the 3-D vessel, using partial vectorization to obtain a code that has run 400% faster than the MOD1 code.

Spore, J.W.; Liles, D.R.; Nelson, R.A.; Dotson, P.J.; Steinke, R.G.; Knight, T.D.; Henninger, R.J.; Martinez, V.; Jenks, R.P.; Cappiello, M.W.

1986-01-01

468

Code of Ethics: Principles for Ethical Leadership  

PubMed Central

The code of ethics for a professional association incorporates values, principles, and professional standards. A review and comparative analysis of a 1934 pledge and codes of ethics from 1957, 1977, 1988, 1998, 2004, and 2011 for a health information management association was conducted. Highlights of some changes in the healthcare delivery system are identified as a general context for the codes of ethics. The codes of ethics are examined in terms of professional values and changes in the language used to express the principles of the various codes. PMID:23346028

Flite, Cathy A.; Harman, Laurinda B.

2013-01-01

469

Bandwidth efficient CCSDS coding standard proposals  

NASA Technical Reports Server (NTRS)

The basic concatenated coding system for the space telemetry channel consists of a Reed-Solomon (RS) outer code, a symbol interleaver/deinterleaver, and a bandwidth efficient trellis inner code. A block diagram of this configuration is shown. The system may operate with or without the outer code and interleaver. In this recommendation, the outer code remains the (255,223) RS code over GF(2 exp 8) with an error correcting capability of t = 16 eight bit symbols. This code's excellent performance and the existence of fast, cost effective, decoders justify its continued use. The purpose of the interleaver/deinterleaver is to distribute burst errors out of the inner decoder over multiple codewords of the outer code. This utilizes the error correcting capability of the outer code more efficiently and reduces the probability of an RS decoder failure. Since the space telemetry channel is not considered bursty, the required interleaving depth is primarily a function of the inner decoding method. A diagram of an interleaver with depth 4 that is compatible with the (255,223) RS code is shown. Specific interleaver requirements are discussed after the inner code recommendations.

Costello, Daniel J., Jr.; Perez, Lance C.; Wang, Fu-Quan

1992-01-01

470

Layered Wyner-Ziv video coding  

NASA Astrophysics Data System (ADS)

Wyner-Ziv coding refers to lossy source coding with side information at the decoder. Recently some practical applications of Wyner-Ziv coding to video compression have been studied due to its advantage of error robustness over standard video coding standards. Based on recent theoretical result on successive Wyner-Ziv coding, we propose in this paper a practical layered Wyner-Ziv video codec using the DCT, nested scalar quantizer (NSQ), and irregular LDPC code based Slepian-Wolf coding (or lossless source coding with side information). The DCT is applied as an approximation to the conditional KLT, which makes the components of the transformed block conditionally independent given the side information. NSQ is a binning scheme that facilitates layered bit-plane coding of the bin indices while reducing the bit rate. LDPC code based Slepian-Wolf coding exploits the correlation between the quantized version of the source and the side information to achieve further compression. Different from previous works, an attractive feature of our proposed system is that video encoding is done only once but decoding allowed at many lower bit rates without quality loss.

Xu, Qian; Xiong, Zixiang

2004-01-01

471

An Investigation of Code Matched Interleaver for 3G Turbo Code Systems  

NASA Astrophysics Data System (ADS)

In this research, we have investigated Code Matched Interleaver (CMI) in turbo code system for both 3G Wireless Communication standards-WCDMA and cdma2000 systems-to substitute 3G interleavers, which are complex. The code matched interleaver design formula in both 3G turbo code systems is obtained through a meticulous study on the weight distributions of the systems. The simulation results for the 3G turbo code system using CMI for N = 400 (WCDMA) and N = 378 (cdma2000), code rate = 1/3 with Log-MAP decoder over Additive White Gaussian Noise (AWGN) and Rayeligh fading channel are obtained and compared with 3G turbo code system using typical 3G interleavers. From the performance results, it is observed that the 3G turbo code system using CMI performs better than the typical 3G turbo code with coding gain of 0.15-0.35 dB.

Balamuralithara, B.; Kalpana, S.

472

Efficient Polar Coding of Quantum Information  

NASA Astrophysics Data System (ADS)

Polar coding, introduced 2008 by Ar?kan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here, we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channels and qubit erasure channels, we use classical polar codes to construct a coding scheme that asymptotically achieves a net transmission rate equal to the coherent information using efficient encoding and decoding operations and code construction. Our codes generally require preshared entanglement between sender and receiver, but for channels with a sufficiently low noise level we demonstrate that the rate of preshared entanglement required is zero.

Renes, Joseph M.; Dupuis, Frédéric; Renner, Renato

2012-08-01

473

Trellis coded modulation applied to orthogonal signals  

NASA Astrophysics Data System (ADS)

A method for the design of trellis codes for coherent detection of orthogonal signals in additive white Gaussian noise (AWGN) channels is presented. This method utilizes the landmark works of Ungerboeck in trellis coded modulation (TCM). After examining the channel capacity, it is shown that a coding method requiring the same bandwidth efficiency for the orthogonal signal space and maximum likelihood (ML) soft decoding using the Viterbi algorithm can achieve large asymptotic coding gains. Several codes are analyzed using Ungerboeck's technique of set-partitioning and mapping, then applying the analytic code description method of Calderbank and Mazo to M-ary frequency shift keying (M-FSK). The general finding of this paper is that relative to uncoded modulation, asymptotic coding gains of 3-4 dB can be achieved.

Stevens, Janet E.

1993-03-01

474

Surface code quantum computing by lattice surgery  

E-print Network

In recent years, surface codes have become the preferred method for quantum error correction in large scale computational and communications architectures. Their comparatively high fault-tolerant thresholds and their natural 2-dimensional nearest neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect- based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfa...

Horsman, Clare; Devitt, Simon; Van Meter, Rodney

2011-01-01

475

Bar code identification of digital levels  

NASA Astrophysics Data System (ADS)

This paper introduced the algorithm of bar code identification of digital level. In the digital level system, the original gauge rod is substituted by bar code rod. The CCD-sensor is used to substitute the eyes of people. The automatic measuring is realized by identifying the bar code on the rod using image process, code principle and the geometry optics technology. The data processing algorithm is achieved purposively after analyzing the data and waveform of CCD output signal. At first, the noise is attenuated with the filter algorithm and signal noise ratio is increased. Then the bar code information from bar image of the gauge is gotten with the speedy edge detection algorithm based on exponent, and the load of calculation is decreased. According to the principle of photoelectric transform of CCD, identify the corresponding bar code and the altitude of the point was calculated. The experiment results indicate that the algorithm of bar code identification is feasible.

Li, Jinhui; Geng, Liqing

2005-04-01

476

Transform coding for space applications  

NASA Technical Reports Server (NTRS)

Data compression coding requirements for aerospace applications differ somewhat from the compression requirements for entertainment systems. On the one hand, entertainment applications are bit rate driven with the goal of getting the best quality possible with a given bandwidth. Science applications are quality driven with the goal of getting the lowest bit rate for a given level of reconstruction quality. In the past, the required quality level has been nothing less than perfect allowing only the use of lossless compression methods (if that). With the advent of better, faster, cheaper missions, an opportunity has arisen for lossy data compression methods to find a use in science applications as requirements for perfect quality reconstruction runs into cost constraints. This paper presents a review of the data compression problem from the space application perspective. Transform coding techniques are described and some simple, integer transforms are presented. The application of these transforms to space-based data compression problems is discussed. Integer transforms have an advantage over conventional transforms in computational complexity. Space applications are different from broadcast or entertainment in that it is desirable to have a simple encoder (in space) and tolerate a more complicated decoder (on the ground) rather than vice versa. Energy compaction with new transforms are compared with the Walsh-Hadamard (WHT), Discrete Cosine (DCT), and Integer Cosine (ICT) transforms.

Glover, Daniel

1993-01-01

477

Development of the Code RITRACKS  

NASA Technical Reports Server (NTRS)

A document discusses the code RITRACKS (Relativistic Ion Tracks), which was developed to simulate heavy ion track structure at the microscopic and nanoscopic scales. It is a Monte-Carlo code that simulates the production of radiolytic species in water, event-by-event, and which may be used to simulate tracks and also to calculate dose in targets and voxels of different sizes. The dose deposited by the radiation can be calculated in nanovolumes (voxels). RITRACKS allows simulation of radiation tracks without the need of extensive knowledge of computer programming or Monte-Carlo simulations. It is installed as a regular application on Windows systems. The main input parameters entered by the user are the type and energy of the ion, the length and size of the irradiated volume, the number of ions impacting the volume, and the number of histories. The simulation can be started after the input parameters are entered in the GUI. The number of each kind of interactions for each track is shown in the result details window. The tracks can be visualized in 3D after the simulation is complete. It is also possible to see the time evolution of the tracks and zoom on specific parts of the tracks. The software RITRACKS can be very useful for radiation scientists to investigate various problems in the fields of radiation physics, radiation chemistry, and radiation biology. For example, it can be used to simulate electron ejection experiments (radiation physics).

Plante, Ianik; Cucinotta, Francis A.

2013-01-01

478

Neural Coding for Effective Rehabilitation  

PubMed Central

Successful neurological rehabilitation depends on accurate diagnosis, effective treatment, and quantitative evaluation. Neural coding, a technology for interpretation of functional and structural information of the nervous system, has contributed to the advancements in neuroimaging, brain-machine interface (BMI), and design of training devices for rehabilitation purposes. In this review, we summarized the latest breakthroughs in neuroimaging from microscale to macroscale levels with potential diagnostic applications for rehabilitation. We also reviewed the achievements in electrocorticography (ECoG) coding with both animal models and human beings for BMI design, electromyography (EMG) interpretation for interaction with external robotic systems, and robot-assisted quantitative evaluation on the progress of rehabilitation programs. Future rehabilitation would be more home-based, automatic, and self-served by patients. Further investigations and breakthroughs are mainly needed in aspects of improving the computational efficiency in neuroimaging and multichannel ECoG by selection of localized neuroinformatics, validation of the effectiveness in BMI guided rehabilitation programs, and simplification of the system operation in training devices.

2014-01-01

479

Space-time codes and concatenated channel codes for wireless communications  

Microsoft Academic Search

Following a brief historical perspective on channel coding, an introduction to space-time block codes is given. The various space-time codes considered are then concatenated with a range of channel codecs, such as convolutional and block-based turbo codes as well as conventional and turbo trellis codes. The associated estimated complexity issues and memory requirements are also considered. These discussions are followed

T. H. Liew; LAJOS HANZO

2002-01-01

480

On generalized low-density parity-check codes based on Hamming component codes  

Microsoft Academic Search

In this paper we investigate a generalization of Gallager's (1963) low-density (LD) parity-check codes, where as component codes single error correcting Hamming codes are used instead of single error detecting parity-check codes. It is proved that there exist such generalized low-density (GLD) codes for which the minimum distance is growing linearly with the block length, and a lower bound of

M. Lentmaier; K. Sh. Zigangirov

1999-01-01

481

Video Coding Using a Simplified Block Structure and Advanced Coding Techniques  

Microsoft Academic Search

This paper describes a new video coding scheme based on a simplified block structure that significantly outperforms the coding efficiency of the ISO\\/IEC 14496-10 $vert{rm ITU}hbox{-}{rm T}$ H.264 advanced video coding (AVC) standard. Its conceptual design is similar to a typical block-based hybrid coder applying prediction and subsequent prediction error coding. The basic coding unit is an 8 $,times,$8 block

Frank Bossen; Virginie Drugeon; Edouard François; Joel Jung; Sandeep Kanumuri; Matthias Narroschke; Hisao Sasai; Joel Solé; Yoshinori Suzuki; Thiow Keng Tan; Thomas Wedi; Steffen Wittmann; Peng Yin; Yunfei Zheng

2010-01-01

482

Properties of even length Barker codes and specific polyphase codes with Barker type autocorrelation functions  

NASA Astrophysics Data System (ADS)

Properties of even-length Barker codes, if they exist, are derived. The analysis leads to the analysis of polyphase codes. Similar properties are derived for specific types of polyphase codes, with Barker type autocorrelation functions. The analysis is done in the time and frequency domains (including linear algebra and Z transform treatments), and suggests a procedure to search for codes with Barker type autocorrelation functions. The search problem is reduced by using the properties of such codes.

Gabbay, S.

1982-07-01

483

Spin glasses and error-correcting codes  

NASA Technical Reports Server (NTRS)

In this article, we study a model for error-correcting codes that comes from spin glass theory and leads to both new codes and a new decoding technique. Using the theory of spin glasses, it has been proven that a simple construction yields a family of binary codes whose performance asymptotically approaches the Shannon bound for the Gaussian channel. The limit is approached as the number of information bits per codeword approaches infinity while the rate of the code approaches zero. Thus, the codes rapidly become impractical. We present simulation results that show the performance of a few manageable examples of these codes. In the correspondence that exists between spin glasses and error-correcting codes, the concept of a thermal average leads to a method of decoding that differs from the standard method of finding the most likely information sequence for a given received codeword. Whereas the standard method corresponds to calculating the thermal average at temperature zero, calculating the thermal average at a certain optimum temperature results instead in the sequence of most likely information bits. Since linear block codes and convolutional codes can be viewed as examples of spin glasses, this new decoding method can be used to decode these codes in a way that minimizes the bit error rate instead of the codeword error rate. We present simulation results that show a small improvement in bit error rate by using the thermal average technique.

Belongie, M. L.

1994-01-01

484

The trellis complexity of convolutional codes  

NASA Technical Reports Server (NTRS)

It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm. It has gradually become apparent that linear block codes also have a natural, though not in general a regular, 'minimal' trellis structure, which allows them to be decoded with a Viterbi-like algorithm. In both cases, the complexity of the Viterbi decoding algorithm can be accurately estimated by the number of trellis edges per encoded bit. It would, therefore, appear that we are in a good position to make a fair comparison of the Viterbi decoding complexity of block and convolutional codes. Unfortunately, however, this comparison is somewhat muddled by the fact that some convolutional codes, the punctured convolutional codes, are known to have trellis representations that are significantly less complex than the conventional trellis. In other words, the conventional trellis representation for a convolutional code may not be the minimal trellis representation. Thus, ironically, at present we seem to know more about the minimal trellis representation for block than for convolutional codes. In this article, we provide a remedy, by developing a theory of minimal trellises for convolutional codes. (A similar theory has recently been given by Sidorenko and Zyablov). This allows us to make a direct performance-complexity comparison for block and convolutional codes. A by-product of our work is an algorithm for choosing, from among all generator matrices for a given convolutional code, what we call a trellis-minimal generator matrix, from which the minimal trellis for the code can be directly constructed. Another by-product is that, in the new theory, punctured convolutional codes no longer appear as a special class, but simply as high-rate convolutional codes whose trellis complexity is unexpectedly small.

Mceliece, R. J.; Lin, W.

1995-01-01

485

The Trellis Complexity of Convolutional Codes  

NASA Astrophysics Data System (ADS)

It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm [30,10]. It has gradually become apparent that linear block codes also have a natural, though not in general a regular, "minimal" trellis structure, which allows them to be decoded with a Viterbi-like algorithm [2,31,22,11,27,14,12,16,24,25,8,15]. In both cases, the complexity of the Viterbi decoding algorithm can be accurately estimated by the number of trellis edges per encoded bit. It would, therefore, appear that we are in a good position to make a fair comparison of the Viterbi decoding complexity of block and convolutional codes. Unfortunately, however, this comparison is somewhat muddled by the fact that some convolutional codes, the punctured convolutional codes [4], are known to have trellis representations that are significantly less complex than the conventional trellis. In other words, the conventional trellis representation for a convolutional code may not be the minimal trellis representation. Thus, ironically, at present we seem to know more about the minimal trellis representation for block than for convolutional codes. In this article, we provide a remedy, by developing a theory of minimal trellises for convolutional codes. (A similar theory has recently been given by Sidorenko and Zyablov [29].) This allows us to make a direct performance-complexity comparison for block and convolutional codes. A by-product of our work is an algorithm for choosing, from among all generator matrices for a given convolutional code, what we call a trellis-minimal generator matrix, from which the minimal trellis for the code can be directly constructed. Another by-product is that, in the new theory, punctured convolutional codes no longer appear as a special class, but simply as high-rate convolutional codes whose trellis complexity is unexpectedly small.

McEliece, R. J.; Lin, W.

1995-07-01

486

48 CFR 725.702 - Designation of authorized geographic code.  

Code of Federal Regulations, 2012 CFR

... false Designation of authorized geographic code. 725.702 Section 725.702 Federal Acquisition...725.702 Designation of authorized geographic code. (a) The authorized geographic code or codes for an USAID contract shall be...

2012-10-01

487

45 CFR 162.1011 - Valid code sets.  

Code of Federal Regulations, 2011 CFR

... 2011-10-01 2011-10-01 false Valid code sets. 162.1011 Section 162.1011 Public...RELATED REQUIREMENTS ADMINISTRATIVE REQUIREMENTS Code Sets § 162.1011 Valid code sets. Each code set is valid within the...

2011-10-01

488

48 CFR 725.702 - Designation of authorized geographic code.  

Code of Federal Regulations, 2010 CFR

... false Designation of authorized geographic code. 725.702 Section 725.702 Federal Acquisition...725.702 Designation of authorized geographic code. (a) The authorized geographic code or codes for an USAID contract shall be...

2010-10-01

489

48 CFR 725.702 - Designation of authorized geographic code.  

Code of Federal Regulations, 2013 CFR

... false Designation of authorized geographic code. 725.702 Section 725.702 Federal Acquisition...725.702 Designation of authorized geographic code. (a) The authorized geographic code or codes for an USAID contract shall be...

2013-10-01

490

45 CFR 162.1011 - Valid code sets.  

Code of Federal Regulations, 2012 CFR

... 2012-10-01 2012-10-01 false Valid code sets. 162.1011 Section 162.1011 Public...RELATED REQUIREMENTS ADMINISTRATIVE REQUIREMENTS Code Sets § 162.1011 Valid code sets. Each code set is valid within the...

2012-10-01

491

45 CFR 162.1011 - Valid code sets.  

Code of Federal Regulations, 2010 CFR

... 2010-10-01 2010-10-01 false Valid code sets. 162.1011 Section 162.1011 Public...RELATED REQUIREMENTS ADMINISTRATIVE REQUIREMENTS Code Sets § 162.1011 Valid code sets. Each code set is valid within the...

2010-10-01

492

45 CFR 162.1011 - Valid code sets.  

Code of Federal Regulations, 2013 CFR

... 2013-10-01 2013-10-01 false Valid code sets. 162.1011 Section 162.1011 Public...RELATED REQUIREMENTS ADMINISTRATIVE REQUIREMENTS Code Sets § 162.1011 Valid code sets. Each code set is valid within the...

2013-10-01

493

48 CFR 725.702 - Designation of authorized geographic code.  

Code of Federal Regulations, 2011 CFR

... false Designation of authorized geographic code. 725.702 Section 725.702 Federal Acquisition...725.702 Designation of authorized geographic code. (a) The authorized geographic code or codes for an USAID contract shall be...

2011-10-01

494

Error-Detecting Identification Codes for Algebra Students.  

ERIC Educational Resources Information Center

Discusses common error-detecting identification codes using linear algebra terminology to provide an interesting application of algebra. Presents examples from the International Standard Book Number, the Universal Product Code, bank identification numbers, and the ZIP code bar code. (YP)

Sutherland, David C.

1990-01-01

495

Noiseless coding for the magnetometer  

NASA Technical Reports Server (NTRS)

Future unmanned space missions will continue to seek a full understanding of magnetic fields throughout the solar system. Severely constrained data rates during certain portions of these missions could limit the possible science return. This publication investigates the application of universal noiseless coding techniques to more efficiently represent magnetometer data without any loss in data integrity. Performance results indicated that compression factors of 2:1 to 6:1 can be expected. Feasibility for general deep space application was demonstrated by implementing a microprocessor breadboard coder/decoder using the Intel 8086 processor. The Comet Rendezvous Asteroid Flyby mission will incorporate these techniques in a buffer feedback, rate-controlled configuration. The characteristics of this system are discussed.

Rice, Robert F.; Lee, Jun-Ji

1987-01-01

496

Numerical classification of coding sequences  

NASA Technical Reports Server (NTRS)

DNA sequences coding for protein may be represented by counts of nucleotides or codons. A complete reading frame may be abbreviated by its base count, e.g. A76C158G121T74, or with the corresponding codon table, e.g. (AAA)0(AAC)1(AAG)9 ... (TTT)0. We propose that these numerical designations be used to augment current methods of sequence annotation. Because base counts and codon tables do not require revision as knowledge of function evolves, they are well-suited to act as cross-references, for example to identify redundant GenBank entries. These descriptors may be compared, in place of DNA sequences, to extract homologous genes from large databases. This approach permits rapid searching with good selectivity.

Collins, D. W.; Liu, C. C.; Jukes, T. H.

1992-01-01

497

TVD: Total Variation Diminishing code  

NASA Astrophysics Data System (ADS)

TVD solves the magnetohydrodynamic (MHD) equations by updating the fluid variables along each direction using the flux-conservative, second-order, total variation diminishing (TVD), upwind scheme of Jin & Xin. The magnetic field is updated separately in two-dimensional advection-constraint steps. The electromotive force (EMF) is computed in the advection step using the TVD scheme, and this same EMF is used immediately in the constraint step in order to preserve ??B=0 without the need to store intermediate fluxes. The code is extended to three dimensions using operator splitting, and Runge-Kutta is used to get second-order accuracy in time. TVD offers high-resolution per grid cell, second-order accuracy in space and time, and enforcement of the ??B=0 constraint to machine precision. Written in Fortran, It has no memory overhead and is fast. It is also available in a fully scalable message-passing parallel MPI implementation.

Pen, Ue-Li; Arras, Phil; Wong, ShingKwong

2013-04-01

498

Parallelization of Stellar Atmosphere Codes  

NASA Astrophysics Data System (ADS)

Parallel computing has turned out as a enabling technology to solve complex physical systems. However, the transition from shared memory, vector computers to massively parallel, distributed memory systems and, recently, to hybrid systems poses new challenges to the scientist. We want to present a cook-book (with a very strong, personal bias) based on our experience with parallization of our code. Some of the general tools and communication libraries are discussed. Our approach includes a mixture of algorithm based, grid based and physical module based parallelization. The advantages, scalability and limitations of each are discussed at example calculations for supernovae. We hope to show that effective parallelization becomes easier with increasing complexity of the physical problem making stellar atmosphere beyond the classical assumptions very suitable.

Höflich, P.

2003-01-01

499

Speeding Up Cosmological Boltzmann Codes  

E-print Network

We introduce a novel strategy for cosmological Boltzmann codes leading to an increase in speed by a factor of \\sim 30 for small scale Fourier modes. We (re-)investigate the tight coupling approximation and obtain analytic formulae reaching up to the octupoles of photon intensity and polarization. This leads to accurate results reaching optimal precision, while still being simple. Damping rapid oscillations of small scale modes at later times, we simplify the integration of cosmological perturbations. We obtain analytic expressions for the photon density contrast and velocity as well as an estimate of the quadrupole from after last scattering until today. These analytic formulae hold well during re-ionization and are in fact negligible for realistic cosmological scenarios. However, they do extend the validity of our approach to models with very large optical depth to the last scattering surface.

Michael Doran

2005-03-11

500

Rate 3/4 convolutional coding of 16-PSK - Code design and performance study  

NASA Technical Reports Server (NTRS)

Convolutional coding coupled with 16-PSK modulation is investigated for bandwidth efficient transmission. Rate 3/4, small memory codes are found which are optimized in the free-distance sense on the Gaussian channel. These codes provide up to 4.8 dB of coding gain with 32 states over uncoded 8-PSK, a scheme having the same spectral efficiency as the codes described. The performance is compared with earlier findings of Ungerboeck and some recent results on R = 2/3 coded 8-PSK. In addition, results of a channel transmission study to assess the performance of the four-state code on the band-limited nonlinear channel are presented, and it is found that performance of the coded scheme degrades comparably with uncoded 8-PSK, i.e., coding gain is roughly preserved.

Wilson, S. G.; Sleeper, H. A.; Schottler, P. J.; Lyons, M. T.

1984-01-01