检索结果-内蒙古大学图书馆

Central and Eastern European Software engineering Conference in Russia (CEE-SECR)

作者： Vladimir Itsykson Alexey Zozulya Computer Systems and Program Engineering Department Saint Petersburg State Polytechnical University Saint-Petersburg Russia

In modern software engineering the task of migration from one system environment to another may arise very often (e.g. software migrating from Windows to Linux or from desktop PC to some mobile platform). This task may be accomplished manually, but this will certainly be not cost- and time-effective and will require additional testing and verification. Therefore various automated techniques aimed to solve this problem seem to be very useful. The article takes into consideration one of such approaches, mainly focused on transferring source code between two library environments. A comprehensive review of related works is presented. The classification of typical library entities having strong impact to software characteristics is defined. Special program annotation language (PanLang) is introduced. The main purpose of this language is to specify library structure and behavior. The key feature of PanLang is the high level of abstraction allowing to take out of consideration the library implementation details. Therefore, PanLang annotation applied to a library is a partial specification. Such a specification may be considered as a Moore FSM. The problem of semantic conformance of source and target libraries' specifications is posed. The conformance is guaranteed if set of execution traces corresponding to source library may be represented as a subset of target's one. In our case the solution of this problem may be reduced to FSM homomorphism detection. Our approach considers using Abstract Semantic Graph (ASG) as a model of source code. Therefore after semantic conformance is proved, special transformation rules may be applied ASG. These rules are based on both source and target partial specifications which guarantee correctness of result software. A simple prototype migration tool based on proposed approach is described. This Java-based tool uses CLang frontend to LLVM for C source code parsing and ASG construction. A number of sample migration tasks were used to prove

关键词： Libraries Semantics Sockets Linux Operating systems Automation

来源：评论

学校读者我要写书评

暂无评论

Poster abstracts

引用

Sleep and Biological Rhythms 2016年第1期5卷 A1-A189页

作者： J. Ferrie M. Shipley F. Cappuccio E. Brunner M. Miller M. Kumari M. Marmot A. Coenen J. L. Castillo F. Araya G. Bustamante L. Montecino C. Torres S. Oporto J. Gronli E. Fiske R. Murison B. Bjorvatn E. Sorensen R. Ursin C. M. Portas S. Rajaraman A. Gribok N. Wesensten T. Balkin J. Reifman N. Dursunoglu S. Ozkurt S. Baser O. Delen S. Sarikaya P. Sadler P. Mitchell D. Françon M. Decobert B. Herve A. Richard G. Griebel P. Avenet B. Scatton G. L. Fur D. Eckert A. Jordan A. Wellman S. Smith A. Malhotra D. White D. Bruck I. Thomas A. Kritikos W. Oertel K. Stiasny-Kolster D. Garcia-Borreguero W. Poewe B. Hoegl R. Kohnen E. Schollmayer J. Keffel C. Trenkwalder A. Valle S. Roizenblatt F. Fregni P. Boggio S. Tufik K. Ward L. Robertson L. Palmer P. Eastwood D. Hillman J. Lee S. Mukherjee V. de Padova G. Barbato G. Ficca I. Zilli P. Salzarulo M. Veldi T. Hion V. Vasar M. Kull L. Nowak J. Davis Y. Latzer O. Tzischinsky S. Crowley M. Carskadon M. Anca-Herschkovitsch D. Frey J. Ortega C. Wiseman C. Farley K. Wright A. Campbell A. Neill K. Spiegel R. Leproult E. Tasali N. Scherberg E. van Cauter A. T. Noradina N. A. Karim I. Norlinah A. A. Raymond R. Sahathevan B. Hamidon E. Werth R. Poryazova R. Khatami C. Bassetti R. G. Beran L. Ainley G. Holand J. Duncan H. Kinney B. Davis B. Hood S. Frey C. Schmidt M. Hofstetter P. Peigneux C. Cajochen W.-P. Hu J.-D. Li C. Zhang L. Boehmer J. Siegel Q.-Y. Zhou Y. Sagawa H. Kondo T. Takemura H. Kanayama Y. Kaneko M. Sato T. Kanbayashi Y. Hishikawa T. Shimizu A. Viola L. James L. Schlangen D.-J. Dijk R. Andretic Y.-C. Kim K.-A. Han F. Jones R. Greenspan L. Sanford L. Yang X. Tang K. Dieter E. Uta H. Sven M. Richard N. Oyane S. Pallesen F. Holsten Y. Inoue M. Fujita N. Emura K. Kuroda N. Uchimura A. Johnston J. Astbury G. Kennedy K. Hoedlmoser M. Schabus T. Pecherstorfer S. Moser G. Gruber P. Anderer W. Klimesch N. Naidoo M. Ferber A. Pack D. Neu O. Mairesse G. Hoffmann A. Dris L. Lambrecht P. Linkowski P. Verbanck O. Le Bon N. Matsuura M. Yamao N. Adachi R. Aritomi Y. Komada H. Tanaka S. Shirak University College London London UK University College London London USA Warwick Medical School London UK Warwick Medical School Coventry USA Radboud University Nijmegen Nijmegen Netherlands Department of Neurology University of Chile Santiago Chile Neurology Service Hospital del Salvador Santiago Chile Family Health Center Juan Pablo II Santiago Chile Department of Biomedicine Section on Physiology Univeristy of Bergen Bergen Norway Department of Public Health and Primary Health Care Univeristy of Bergen Bergen Norway Department of Public Health and Primary Health Care University of Bergen Bergen Norway Norwegian Competence Center for Sleep Disorders Haukeland University Hospital Bergen Norway Department of Child and Adolescent Psychiatry Haukeland University Hospital Univeristy of Bergen Bergen Norway Department of Biomedicine University of Bergen Bergen Norway US Army Medical Research and Materiel Command Fort Detrick Frederick USA Walter Reed Army Institute of Research Silver Spring USA Department of Behavioral Biology Walter Reed Army Institute of Research Silver Spring USA Faculty Department of Pulmonology Pamukkale University Medical Denizli Turkey University of Ballarat Ballarat Australia Sanofi-Aventis Recherche et Developpement Paris France Brigham and Women’s Hospital Harvard Medical School Boston USA The University of Queensland Adelaide Australia School of Psychology University of Queensland Brisbane Australia The University of Queensland Brisbane Australia Victoria University Melbourne Australia Department of Psychology Victoria University Melbourne Australia School of Psychology Victoria University Melbourne Australia Philips-Universität Marburg Germany Philips-Universitaet-Marburg Marburg Germany Instituto de Investigaciones del Sueno Madrid Spain Universitätsklinik für Neurologie Innsbruck Austria Universitaetsklinik fuer Neurologie Innsbruck Austria IMEREM GmbH Nuernberg Germany Schwarz Pharma AG Monheim Germany

来源：评论

学校读者我要写书评

暂无评论

Strategies for pathway-based analysis of genome-wide SNP data

Strategies for pathway-based analysis of genome-wide SNP dat...

引用

Defense Science Research Conference and Expo (DSR)

作者： P. Patumcharoenpol J. Chan S. Prom-On A. Meechai Bioinformatics and Systems Biology Program School of Information Technology Computer Engineering Department Biological Engineering Program King Mongkut's University of Technology Thonburi Bangkok Thailand

Numerous genome-wide association studies (GWAS) have been performed in order to determine the susceptible loci of diseases. However, most diseases still cannot be explained by a single locus. Pathway-based methods address this problem by combining those small effects into groups of related genes or pathways. However, because pathway-based approaches consist of multiple steps, there is much room for improvement. This paper presents an improved method for translating list of SNPs from GWAS into list of genes. We incrementally adjusted and compared different modifications applied to Parkinson's disease (PD) genome-wide SNP data and then used GSEA-P to analyze the resulting list of genes. After careful adjustments, we are able to identify more relevant pathways that were not found previously.

关键词： Bioinformatics Genomics Cancer Parkinson's disease Databases

来源：评论

学校读者我要写书评

暂无评论

Frequency multiplexing tickle tones to determine harmonic coupling weights in nonlinear systems

Frequency multiplexing tickle tones to determine harmonic co...

引用

ARFTG Conference

作者： Charles Baylis Robert J. Marks Wireless and Microwave Circuits and Systems Program Department of Electrical and Computer Engineering Baylor University Waco TX USA

Obtaining the Jacobian parameters for a nonlinear system, such as in X-parameter or S-function measurement, requires excitation of tickle tones either on or slightly off of the main harmonic frequencies. Traditional off-frequency measurements involve simultaneous excitation with tickle tones both slightly above and/or below a single harmonic frequency at a time. This paper describes a multiplexing technique for the excitation of the system with perturbations at all harmonics simultaneously. This technique requires both frequency and cross-frequency noninterference for successful results from the measurements. If these conditions exist for the nonlinear system, the off-frequency multiplexing technique for tickle tones can reduce the measurements necessary to find the Jacobian matrices by a factor equal to the number of harmonics considered in the polyharmonic distortion. These methods provide exact results for memoryless polynomial nonlinearities.

关键词： Harmonic analysis Frequency measurement Frequency division multiplexing Couplings Weight measurement Polynomials

来源：评论

学校读者我要写书评

暂无评论

A Verification Mechanism of Feature Models for Mobile and Context-Aware Software Product Lines

A Verification Mechanism of Feature Models for Mobile and Co...

引用

Brazilian Symposium on Software Components, Architectures and Reuse (SBCARS)

作者： Fabiana G. Marinho Rossana M.C. Andrade Cl´udia Werner Graduate Program in Computer Science Federal University of Ceará Fortaleza Brazil Systems Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

Software Product Lines (SPLs) have been used to develop mobile and context-aware applications, which provide services and data for their users from anywhere and at any time using context information. In SPLs, commonality and variability of a system family are identified and often documented in a feature model. However, the development of a feature model for mobile and context-aware SPLs is not trivial, since it should comprise system and context information. Furthermore, the consistency check of feature models in the considered domain is also complex and demands advanced skills of software engineers. This paper proposes a mechanism to formalize and verify the correctness and consistency of feature models for mobile and context-aware SPLs based on a profile enriched with OCL specifications.

关键词： Unified modeling language Context Context modeling Mobile communication Adaptation models Software

来源：评论

学校读者我要写书评

暂无评论

Hardware Particle Swarm Optimization with passive congregation for embedded applications

Hardware Particle Swarm Optimization with passive congregati...

引用

Southern Conference on programmable Logic

作者： Muñoz, Daniel M. Llanos, Carlos H. Coelho, Leandro Dos S. Ayala-Rincón, Mauricio Department of Mechanical Engineering Automation and Control Group/GRACO University of Brasilia Brasilia D.F. Brazil Industrial and Systems Engineering Graduate Program Pontifical Catholic University of Parana Curitiba Parana Brazil Department of Computer Science and Mathematics University of Brasilia Brasilia D.F. Brazil

ISBN: (纸本)9781424488483

Achieving high performance optimization algorithms for embedded applications can be very challenging, particularly when several requirements such as high accuracy computations, short elapsed time, area cost, low power consumption and portability must be accomplished. This paper proposes a hardware implementation of the Particle Swarm Optimization algorithm with passive congregation (HPPSOpc), which was developed using several floating-point arithmetic libraries. The passive congregation is a biological behavior which allows the swarm to preserve its integrity, balancing between global and local search. The HPPSOpc architecture was implemented on a Virtex5 FPGA device and validated using two multimodal benchmark problems. Synthesis, simulation and execution time results demonstrates that the passive congregation approach is a low cost solution for solving embedded optimization problems with a high performance. © 2011 IEEE.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Common Agile Practices in Software Processes

Common Agile Practices in Software Processes

引用

International Symposium on Empirical Software engineering and Measurement, ESEM

作者： Jose Fortuna Abrantes Guilherme Horta Travassos COPPE/Systems Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

Objective: to investigate studies about software processes looking for practices which can be used to obtain agility in software processes. Method: A systematic review including seven search engines was executed in Feb/2010. To apply the defined criteria to select papers and extract information regarding working practices bringing agility to software processes. Results: from 6696 retrieved papers, 441 were selected to support the identification of 236 occurrences of 51 distinct practices associated with the concept of agility. Their descriptions were deeply analyzed and consolidated. After discarding those which appeared in the technical literature in a small amount of papers, 17 agile practices were identified. Conclusion: although further studies are necessary to evaluate the efficacy of these 17 agile practices, 12 of them have been more commonly approached in the software projects and could be primarily considered: test driven development, continuous integration, pair programming, planning game, onsite customer, collective code ownership, small releases, metaphor, refactoring, sustainable pace, simple design and coding standards.

关键词： Software Software engineering Context programming profession Business Encoding

来源：评论

学校读者我要写书评

暂无评论

High Level Rule Modeling Language for Airline Crew Pairing

引用

AIP Conference Proceedings 2011年第1期1389卷 798-801页

作者： Erdal Mutlu Ş. İlker Birbil Kerem Bülbül Hüsnü Yenigün aSabanci University Computer Science & Engineering Program Orhanli‐Tuzla 34956 Istanbul Turkey bSabanci University Manufacturing Systems & Industrial Eng. Program Orhanli‐Tuzla 34956 Istanbul Turkey

The crew pairing problem is an airline optimization problem where a set of least costly pairings (consecutive flights to be flown by a single crew) that covers every flight in a given flight network is sought. A pairing is defined by using a very complex set of feasibility rules imposed by international and national regulatory agencies, and also by the airline itself. The cost of a pairing is also defined by using complicated rules. When an optimization engine generates a sequence of flights from a given flight network, it has to check all these feasibility rules to ensure whether the sequence forms a valid pairing. Likewise, the engine needs to calculate the cost of the pairing by using certain rules. However, the rules used for checking the feasibility and calculating the costs are usually not static. Furthermore, the airline companies carry out what‐if‐type analyses through testing several alternate scenarios in each planning period. Therefore, embedding the implementation of feasibility checking and cost calculation rules into the source code of the optimization engine is not a practical approach. In this work, a high level language called ARUS is introduced for describing the feasibility and cost calculation rules. A compiler for ARUS is also implemented in this work to generate a dynamic link library to be used by crew pairing optimization engines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic process adaptation: A context-aware approach

Dynamic process adaptation: A context-aware approach

引用

International Conference on computer Supported Cooperative Work in Design

作者： Vanessa Tavares Nunes Cláudia M. Lima Werner Flávia Maria Santoro COPPE PESC-Systems Engineering and Computer Science Program UFRJ Rio de Janeiro Brazil NP2Tec and Postgraduate Information Systems Program UNIRIO Rio de Janeiro Brazil

Dynamism of day-to-day activities in organizations is inextricably linked and there is a variety of information, insight and reasoning being processed between people and systems, in carrying out a business process. We argue that flexibility in processes could be managed in real time, using context information collected in the work environment. This paper proposes a context management architecture approach that aims to improve and automate dynamic process adaptation. We explain how process adaptation may occur in real time and discuss a scenario for this proposal.

关键词： Context Adaptation models Organizations Cognition Context modeling Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Opposition-based shuffled PSO with passive congregation applied to FM matching synthesis

Opposition-based shuffled PSO with passive congregation appl...

引用

IEEE Congress on Evolutionary Computation

作者： Munoz, Daniel M. Llanos, Carlos H. Dos S. Coelho, Leandro Ayala-Rincon, Mauricio Department of Mechanical Engineering Automation and Control Group/GRACO University of Brasilia Brasilia D.F. Brazil Industrial and Systems Engineering Graduate Program LAS/PPGEPS Pontifical Catholic University of Parana Curitiba Parana Brazil Department of Computer Science and Mathematics University of Brasilia Brasilia D.F. Brazil

ISBN: (纸本)9781424478347

Synthesis of musical instruments or human voice is a time consuming process which requires theoretical and experimental knowledge about the synthesis engine. Commonly, performers need to deal with synthesizer interfaces and a process of trial and error for creating musical sounds similar to a target sound. This drawback can be overcome by adjusting automatically the synthesizer parameters using optimization algorithms. In this paper a hybrid particle swarm optimization (PSO) algorithm is proposed to solve the frequency modulation (FM) matching synthesis problem. The proposed algorithm takes advantage of a shuffle process for exchanging information between particles and applies the selective passive congregation and the opposition-based learning approaches to preserve swarm diversity. Both approaches for injecting diversity are based on simple operators, preserving the easy implementation philosophy of the particle swarm optimization. The proposed hybrid particle swarm optimization algorithm was validated for a three-nested FM synthesizer, which represents a 6-dimensional multimodal optimization problem with strong epistasis. Simulation results revealed that the proposed algorithm presented promising results in terms of quality of solutions. © 2011 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：