Programming Languages

Al and C-MgB2 doping adds an electron to the system for each atom. This extra electron fills up the sigma-bands thus diminishing the number of sigma-carriers; this has been the usual explanation for the Tc reduction. Nevertheless in this work we show that there is also a large reduction of anisotropy in the electrical conductivity due to the sigma-carriers which should also have an effect on the Tc reduction. Al and C doping produce a different Tc pattern; this difference can be largely explained by the relative shift between the sigma-bands and pi-bands. After adjusting to this shift there is a small but visible difference, at low doping Tc in the Al compounds drops faster than in the C compounds, this can be directly related to the faster loss of conductivity anisotropy in the Al compounds.

Research has shown that lexical databases are good sources of lexical knowledge for various Natural Language Processing (NLP) tasks. Over the years, several lexical databases have been developed, eg HowNet [1], WordNet [2], EuroWordNet [3] and CCD [4]. These knowledge ...

In this paper, a uniform approach to maximal permissiveness in modular control of discrete-event systems is proposed. It is based on three important concepts of modular closed-loops: monotonicity, distributivity, and exchangeability. Monotonicity of various closed-loops satisfying a given property considered in this paper holds whenever the underlying property is preserved under language unions. Distributivity holds if the inverse projections of local plants satisfy the given property with respect to each other. Among new results, sufficient conditions are proposed for distributed computation of supremal relatively observable sublanguages.

In this paper, we further develop the coordination control framework for discrete-event systems with both complete and partial observation. A new weaker sufficient condition for the computation of the supremal conditionally controllable sublanguage is presented. This result is then used for the computation of the supremal conditionally controllable and conditionally normal sublanguage. The paper further generalizes the previous study by considering general, nonprefix-closed languages.

Relative observability has been introduced and studied in the framework of partially observed discrete-event systems as a condition stronger than observability, but weaker than normality. However, unlike observability, relative observability is closed under language unions, which makes it interesting for practical applications. In this paper, we investigate this notion in the framework of coordination control. We prove that conditional normality is a stronger condition than conditional (strong) relative observability, hence conditional strong relative observability can be used in coordination control instead of conditional normality, and present a distributive procedure for the computation of a conditionally controllable and conditionally observable sublanguage of the specification that contains the supremal conditionally strong relative observable sublanguage.

1. Funciones amigas 2. Entrada / Salida 3. Sobrecarga de funciones y operadores 4. Gestión de memoria dinámica 5. Atributos y métodos de clase 6. Implementación de relaciones entre objetos C++ ÍNDICE 3 C++ FUNCIONES AMIGAS  La parte privada de una clase sólo es accesible por:  Métodos (funciones miembro) de la propia clase  Funciones amigas (C++).  Función Amiga: Función NO miembro de una clase, que puede tener acceso a la parte privada de esa clase. Rompe el principio de "encapsulación". Una función se declara como amiga de una clase mediante la palabra reservada "friend". class MiClase { friend void unaFuncionAmiga(int, MiClase&

Determina si un objeto puede ser a la vez instancia de dos o más subclases de ese nivel de herencia. Java/C++ no soporta la herencia solapada (tipado fuerte)  Completa/Incompleta  Determina si todas las instancias de la clase padre son a la vez instancias de alguna de las clases hijas (completa) o, por el contrario, hay objetos de la clase padre que no pertenecen a ninguna subcategoría de las reflejadas por las clases hijas (incompleta).  Determina si un determinado objeto puede pasar de ser instancia de una clase hija a otra dentro de un mismo nivel de la jerarquía de herencia.  Java/C++ no soporta la herencia dinámica (tipado fuerte) Herencia Caracterización semántica Herencia de implementación  Habilidad para que una clase herede parte o toda su implementación de otra clase.  Debe ser utilizada con cuidado.

Tema 4. Polimorfismo Objetivos básicos  Comprender el concepto de polimorfismo  Conocer y saber utilizar los diferentes tipos de polimorfismo.  Comprender el concepto de enlazado estático y dinámico en los lenguajes OO.  Comprender la relación entre polimorfismo y herencia en los lenguajes fuertemente tipados.  Apreciar la manera en que el polimorfismo hace que los sistemas sean extensibles y mantenibles.

This work presents the use of remote sensing data for land cover mapping with a case of Central Apennines, Italy. The data include 8 Landsat 8-9 Operational Land Imager/Thermal Infrared Sensor (OLI/TIRS) satellite images in six-year period (2018-2024). The operational workflow included satellite image processing which were classified into raster maps with automatically detected 10 classes of land cover types over the tested study. The approach was implemented by using a set of modules in Geographic Resources Analysis Support System (GRASS) Geographic Information System (GIS). To classify remote sensing (RS) data, two types of approaches were carried out. The first is unsupervised classification based on the MaxLike approach and clustering which extracted Digital Numbers (DN) of landscape feature based on the spectral reflectance of signals, and the second is supervised classification performed using several methods of Machine Learning (ML), technically realised in GRASS GIS scripting software. The latter included four ML algorithms embedded from the Python's Scikit-Learn library. These classifiers have been implemented to detect subtle changes in land cover types as derived from the satellite images showing different vegetation conditions in spring and autumn periods in central Apennines, northern Italy.

With the increase use of web pages as interface to data and information on the Internet and the Intranet, the usability of these web pages became essential. We consider the web page one of the tools that users need to interact with daily. Since there exist many definitions of ...

It is well-known that: (i) every context-free language over a singleton terminal alphabet is regular [4], and (ii) the class of languages that satisfy the Pumping Lemma is a proper super-class of the context-free languages. We show that any language in this super-class over a singleton terminal alphabet is regular. Our proof is based on a transformational approach and does not rely on Parikh’s Theorem [6]. Our result extends previously known results because there are languages that are not context-free, do satisfy the Pumping Lemma, and do not satisfy the hypotheses of Parikh’s Theorem [7].

This is an exposition of the well known theorem of Chomsky and Miller [1] a language is regular iff the language is generated by a left linear grammar. Def 1.1 A context free grammar is a Left Linear Grammar if every production is either of the form X → σY or X → σ where σ ∈ Σ ∪ {e}.

The purpose of this study is to determine analytically what and how acceleration from paralleling execution of a task depends. It is reasonable if level of parallelism is increased, the costs of synchronization will be increased also and upon reaching a certain degree of granulation acceleration of multi-program execution starts to decrease.

In this paper, we identify some of the computational advances that have been contributing to the efficient solution of mixed-integer linear programming (MILP) problems. Recent features added to MILP solvers at the algorithmic level and at the hardware level have been contributing to the increasingly efficient solution of more difficult and larger problems. Therefore, we will focus on the main advances in terms of hardware, and algorithms in one commercial solver to demonstrate the advantages and disadvantages of the recent features. Special attention is given to the utilization of multiple threads, parallelization modes, and the integration of heuristics with the branch and cut algorithm. Two problems are used to show the advantages of some of the new options. The results show that while some of the new features may help on the solution of difficult problems, they can also reduce the performance on relatively easy problems.

The NLP research group at the University of Szeged took part in the development of the Hungarian WordNet between 2005 and 2007. In 2008, they developed a smaller, domain specific WordNet on customs law. This knowledge base contains about 650 concepts cautiously selected by legal experts from the relevant Hungarian statutory legal texts, above all, from two acts and from other laws and decrees. The resulted hierarchic net of concepts is used in an information retrieval system for quick access to documents that ...

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden to Washington Headquarters Service, Directorate for Information Operations and Reports,

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden to Washington Headquarters Service, Directorate for Information Operations and Reports,

HyperCare is a prototype of a decision support system for essential hypertension care management. The medical knowledge implemented in HyperCare derives from the guidelines for the management of mild hypertension of the World Health Organization/International Society of Hypertension, and from the recommendations of the United States Joint National Committee on Detection, Evaluation and Treatment of High Blood Pressure. HyperCare has been implemented using Chimera, an active database language developed at the Politecnico di Milano. HyperCare proves the possibility to use active database systems in developing a medical data-intensive application where inferential elaboration of moderate complexity is required.

In this paper we propose an approach for the automatic enrichment of standardized electronic dictionaries by the semantic classes. This approach consists of three phases. The first phase treat the semantic classification process founded on the studies of Gaston Gross. The second phase profites from the existed subject fields in the dictionary's lexical entries in order to attribute the suitable semantic classes. The final phase realizes syntactic analyses of the textual content of meanings’s lexical entries. This phase, aims to refine the subject field based enrichment and also treats the non enriched meanings in the second phase. In addition, it attributes the same semantic classes for the synonym meanings. We used an available standardized Arabic dictionary to tested the performance of the proposed approach.

The views expressed in this document are the sole responsibility of the author(s) and do not necessarily reflect the view of Chatham House, its staff, associates or Council. Chatham House is independent and owes no allegiance to any government or to any political body. It does not take institutional positions on policy issues. This document is issued on the understanding that if any extract is used, the author(s)/ speaker(s) and Chatham House should be credited, preferably with the date of the publication or details of the event. Where this document refers to or reports statements made by speakers at an event every effort has been made to provide a fair representation of their views and opinions, but the ultimate responsibility for accuracy lies with this document's author(s). The published text of speeches and presentations may differ from delivery.

The paper discusses the evolving role of artificial intelligence and big data in language education, emphasizing digital technologies' transformative role in linguistic studies. It highlights the pedagogical benefits of fostering onomasiological awareness within the cognitive linguistics framework. Through practical examples, the study demonstrates how project-based learning enhances both language acquisition and technological proficiency. Digital tools such as ChatGPT, DeepL, Textometr, and Bookcreator are shown to diversify instructional methods, while databases like the Russian National Corpus and Constructicon support detailed linguistic analysis. The findings underscore the importance of using AI tools to complement human creativity and advocate for developing students' critical thinking to assess the reliability of AI-assisted language outputs.

In this study it has been tackled the NP-complete problem of academic class scheduling (or timetabling). The aim of this thesis is finding a feasible solution for Computer Engineering Department of İzmir Institute of Technology. Hence, a solution method for course timetabling is presented in this thesis, consisting of two phases: a constraint programming phase to provide an initial solution and a simulated annealing phase with different neighbourhood searching algorithms. When the experimental data are obtained it is noticed that according to problem structure, whether the problem is tightened or loosen constrained, the performance of a hybrid approach can change. These different behaviours of the approach are demonstrated by two different timetabling problem instances. In addition to all these, the neighbourhood searching algorithms used in the simulated annealing technique are tested in different combinations and their performances are presented.

Background: It has long been recognized that sensitivity analysis plays a key role in modeling and analyzing cellular and biochemical processes. Systems biology markup language (SBML) has become a well-known platform for coding and sharing mathematical models of such processes. However, current SBML compatible software tools are limited in their ability to perform global sensitivity analyses of these models. Results: This work introduces a freely downloadable, software package, SBML-SAT, which implements algorithms for simulation, steady state analysis, robustness analysis and local and global sensitivity analysis for SBML models. This software tool extends current capabilities through its execution of global sensitivity analyses using multi-parametric sensitivity analysis, partial rank correlation coefficient, SOBOL's method, and weighted average of local sensitivity analyses in addition to its ability to handle systems with discontinuous events and intuitive graphical user interface. SBML-SAT provides the community of systems biologists a new tool for the analysis of their SBML models of biochemical and cellular processes.

Purpose -This work seeks to present the theoretical study considerations and the characteristics of a general design methodology in optimal time for electronic systems using numerical methods and optimal control theory. Through this, the design problem of a system is formulated in terms of optimal control in minimal time. Design/methodology/approach -This general design methodology includes the traditional design strategy (TDS), and the modified traditional design strategy (MTDS), where the model of the system is part of the optimization procedure but an objective function of the optimization process is constructed such as includes the traditional objective function and some penalty functions that feign the model of the system. Many special control functions are introduced artificially to generalize the methodology and produce several design trajectories for the same optimization process -the first and final trajectories correspond to TDS and MTDS, respectively. The combination of these trajectories produce an infinite number of design strategies, some of these are quasi-optimal in time and only one is optimal in time. Findings -Qualitative and numeric results of this iterative process are generated in a personal computer in a Cþþ language elaborated with a visual Cþþ graphic user interface. An algorithm is constructed to form an optimal in time design strategy switching from a MTDS subset to a TDS subset. Results of measured times are analyzed, showing that there is a control input U, such that the objective function is minimized in a minimum time. Originality/value -These ideas are proposed using method of gradient optimization and special acceleration effect.

Rubrics offer a solution to assessment inconsistencies frequently observed among evaluators at Turkish teaching centers, both within and across institutions. Particularly for productive language skills, rubrics can mitigate subjective evaluation by providing structured assessment frameworks. This research aimed to develop valid and reliable analytic rubrics for assessing B1-B2 level writing skills in Turkish language instruction. Using an exploratory sequential mixed methods design, the study followed systematic rubric development protocols. Validity was established through expert consultation with seven specialists using the Davis technique, while reliability was determined by having 20 evaluators score six writing samples, analyzed using Kendall's W coefficient of concordance. The study also examined whether evaluation experience (Kruskal Wallis-H test) or instructor background (foreign language vs. second language Turkish instruction; Mann Whitney U test) influenced scoring patterns when using the rubrics. Results confirmed the developed rubrics' validity and reliability. No significant differences emerged between ratings from experienced versus inexperienced instructors, or between foreign language and second language Turkish instructors, demonstrating the rubrics' effectiveness in standardizing assessment across evaluator profiles. These findings suggest that properly constructed rubrics can successfully reduce assessment inconsistencies regardless of evaluator experience or instructional background.

Design of large dependable real-time embedded systems relies on integration of software elements onto a set of hardware nodes. In this paper an overall process of how to generate a Platform Specific Model (PSM) from a set of Platform Independent Models (PIM) and a hardware resource description is presented in the course of designing such embedded systems. Subsystems with different requirements are allocated and integrated onto shared hardware resources based on the constraints of the specified HW resources. The focus of this paper lies on developing the methodologies and tools for the generation of the PSM. Ac- cordingly a dual-track approach has been proposed. First track is based on a transformational process and the second is a Multi Variable Optimization (MVO) approach.

Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equations in a definition may have to be aware of unrelated constructs semantics. Current approaches for modularity in this formalism do not address this problem, providing, for this reason, tangled semantic definitions. This paper proposes an incremental approach for denotational semantic specifications, in which each step can either add new features or adapt existing equations, by means of a formal language based on function transformation and aspect weaving.

Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equations in a definition may have to be aware of unrelated constructs semantics. Current approaches for modularity in this formalism do not address this problem, providing, for this reason, tangled semantic definitions. This paper proposes an incremental approach for denotational semantic specifications, in which each step can either add new features or adapt existing equations, by means of a formal language based on function transformation and aspect weaving.

The aim of this study is to obtain optimal position and orientation of a trajectory frame with respect to the fixed frame of the manipulator. The work path which is given in the trajectory frame is also constrained in the workspace of the 3 – PRS parallel kinematic machine. In the analysis, forward and inverse kinematics solutions are derived as well as the inverse dynamics model using Lagrange’s Method. Several algorithms governing the motion of the manipulator are developed. Moreover, optimization goals are defined and evaluated with the genetic algorithm.M.S. - Master of Scienc

At the beginning of 1986 the Physics Analysis Workstation project PAW was launched at CERN. The first public release of the system was made at the beginning of 1988. At present the system runs on most of the computer systems used in the High Energy Physics (HEP) community (Mainframes, Workstations, PC's). In addition to its powerful data analysis, particular emphasis has been put on the quality of the user interface and of the graphical presentation. PAW is an interactive utility for visualizing experimental data on a computer graphics display. It may be run in batch mode if desired for very large and time consuming data analyses; typically, however, the user will decide on an analysis procedure interactively before running a batch job. PAW combines a handful of CERN High Energy Physics Library systems that may also used individually in software that processes and displays data. The purpose of PAW is to provide many common analysis and display procedures that would be duplicated needlessly by individual programmers, to supply a flexible way to invoke these common procedures, and yet also to allow user customization where necessary. Definition: VECTOR/CREATE V(NCOL,NROW,NPLANE)

At the beginning of 1986 the Physics Analysis Workstation project PAW was launched at CERN. The first public release of the system was made at the beginning of 1988. At present the system runs on most of the computer systems used in the High Energy Physics (HEP) community (Mainframes, Workstations, PC's). In addition to its powerful data analysis, particular emphasis has been put on the quality of the user interface and of the graphical presentation. PAW is an interactive utility for visualizing experimental data on a computer graphics display. It may be run in batch mode if desired for very large and time consuming data analyses; typically, however, the user will decide on an analysis procedure interactively before running a batch job. PAW combines a handful of CERN High Energy Physics Library systems that may also used individually in software that processes and displays data. The purpose of PAW is to provide many common analysis and display procedures that would be duplicated needlessly by individual programmers, to supply a flexible way to invoke these common procedures, and yet also to allow user customization where necessary. Definition: VECTOR/CREATE V(NCOL,NROW,NPLANE)

A presentation of software sub-system developed to augment C Language Production Systems (CLIPS) with facilities for object oriented Knowledge representation. Functions are provided to define classes, instantiate objects, access attributes, and assert object related facts. This extension is implemented via the CLIPS user function interface and does not require modification of any CLIPS code. It does rely on internal CLIPS functions for memory management and symbol representation.

A presentation of software sub-system developed to augment C Language Production Systems (CLIPS) with facilities for object oriented Knowledge representation. Functions are provided to define classes, instantiate objects, access attributes, and assert object related facts. This extension is implemented via the CLIPS user function interface and does not require modification of any CLIPS code. It does rely on internal CLIPS functions for memory management and symbol representation.

Las actividades de aprendizaje de lenguas son parte de una unidad didáctica desarrollada para un contexto educativo determinado, y su diseño conforma un ciclo de producción que va desde la identificación de una necesidad hasta la evaluación de los materiales. El presente trabajo describe tres casos de producción de materiales para cuyo fin se analizan las adaptaciones llevadas a cabo en actividades con foco en el desarrollo de la conciencia lingüística, la producción oral y el aprendizaje de nuevas formas lingüísticas respectivamente. El análisis y la contrastación con marcos teóricos que fundamentan los aspectos abordados en cada uno de los casos descriptos permitió establecer la coherencia entre propósito y diseño y realizar sugerencias de adaptación a fin de mejorar las actividades. La conciencia de la relevancia de los marcos teóricos y didácticos en el diseño redunda en una mayor efectividad de las actividades y, por ende, en un impacto positivo en el aprendizaje.

We present GKIN, a simulator and a comprehensive graphical interface where one can draw the model specification of reactions between hypothesized molecular participants in a gene regulatory and biochemical reaction network (or genetic network for short). The solver is written in C++ in a nearly platform independent manner to simulate large ensembles of models, which can run on PCs, Macintoshes, and UNIX machines, and its graphical user interface is written in Java which can run as a standalone or WebStart application. The drawing capability for rendering a network significantly enhances the ease of use of other reaction network simulators, such as KINSOLVER and enforces a correct semantic specification of the network. In a usability study with novice users, drawing the network with GKIN was preferred and faster in comparison with entry with a dialog-box guided interface in COPASI with no difference in error rates between GKIN and COPASI in specifying the network. GKIN is freely available at .

The last decade has seen a rapid growth in the use of mobile devices all over the world. With an increasing use of mobile devices, mobile applications are becoming more diverse and complex, demanding more computational resources. However, mobile devices are typically resource-limited (i.e., a slower-speed CPU, a smaller memory) due to a variety of reasons. Mobile users will be capable of running applications with heavy computation if they can offload some of their computations to other places, such as a desktop or server machines. However, mobile users are typically subject to dynamically changing network environments, particularly, due to user mobility. This makes it hard to choose good offloading decisions in mobile environments. In general, users' mobility can provide some hints for upcoming changes to network environments. Motivated by this, we propose a mobility model of each individual user taking advantage of the regularity of his/her mobility pattern, and develop an offloading decision-making technique based on the mobility model. We evaluate our technique through trace-based simulation with real log data traces from 14 Android users. Our evaluation results show that the proposed technique can help boost the performance of mobile devices in terms of response time and energy consumption, when users are highly mobile.

We describe the implementation of a MIPS Simulator called MIPS-SIM. MIPS-SIM is a GUI, Java-based simulator for the MIPS assembly language. MIPS, the computer architecture is widely used in industry and is the basis of the popular textbook Computer Organization and Design by David Patterson and John Hennessy, used at over 400 universities. The third edition of this text (published by Morgan Kaufmann in 2005) uses standard 32-bit MIPS as the primary teaching ISA. The MIPS-SIM simulator has been implemented for educational purposes with characteristics that are especially useful to undergraduate computer science and engineering students and their instructors who use the above textbook. MIPS-SIM should be useful in courses such as computer organization and architecture, assembly language programming, and compiler writing. MIPS-SIM implements almost the entire MIPS32 assembler-extended instruction set. MIPS-SIM also provides a simple debugger and minimal set of operating system services. We test MIPS-SIM simulator by running several MIPS assembly programs. Results prove the accuracy, correctness, effectiveness and usefulness of MIPS-SIM.

Resumo: Este texto coleta diferentes tempos, memórias, experiências de teatro e migração. Uma pesquisa que “nafunda” e mareja, ao mesmo tempo, em diferentes encontros. Pesquisa-em-ato, amarrando pedaços de cordas de naufrágios - do sofrimento psíquico a modos de experimentar a clínica coletivamente, no laboratório do teatro. Pesquisa que escreve, que secreta metodologias, em cartografias parciais, a arte como matéria movente.

Summary: A text between different times, memories, theater experiences and migration. A research that simultaneously sinks and navigates, trough different encounters. Research-in-act, tying together pieces of shipwreck ropes - from psychological suffering to ways of experiencing the clinic collectively, in the theater as a laboratory. A research that writes, that secretes methodologies, in partial cartographies, art as moving matter.

palavras-chave: delírio, improvisação, pesquisa-em-ato, criatividade processual, migração
keywords: delirium, improvisation, research-in-act, procedural creativity, migration

It can be remarkably hard to design a good communications protocol, much harder than it is to write a sequential program. Unfortunately,w hen the design of a newp rotocol is complete, we usually have little trouble convincing ourselves that it is trivially correct. It can be a unreasonably hard to prove those facts formally and to convince also others. Faced with that dilemma, a designer usually decides to trust his or her instincts and forgo the formal proofs. The subtle logical flaws in a design thus get a chance to hide, and inevitably find the worst possible moment in the lifetime of the protocol to reveal themselves. Though feww ill admit it, most people design protocols by trial and error.T here is a known set of trusted protocol standards, whose descriptions are faithfully copied in most textbooks, but there is little understanding of whysome designs are correct and whyothers are not. To design and to analyze protocols you need tools. Until recently the right tools were simply not generally available. But that has changed. In this tutorial we introduce a state-of-the-art tool called SPIN and the specification language PROMELA.W eshow howthe language and the tool can be used to design reliable protocols. The tool itself is available by anonymous ftp from research.att.com, or by email from the author.

This book is typeset in Times Roman by the author, using an Linotronic 200P phototypesetter and a DEC VAX 8550 running the 10th Edition of the UNIX® operating system. DEC and VAX are trademarks of Digital Equipment Corporation. UNIX is a registered trademark of AT&T.

Cognitive radio (CR) presents a unique challenge to source localization in that the radio has the ability to adapt to the environment, thus rendering current localization techniques ineffective due to a shifting combination of spatial, frequency, and temporal parameters. For any localization scheme to be effective, it must be able to adapt over time as a CR adapts to its surroundings. In this paper an extended semi range-based localization (ESRB) scheme is proposed to accomplish this task. The proposed scheme estimates the position of a CR using the collaborative spectrum sensing results of a wireless radio frequency sensor network (WSN) in a CR environment. The central idea behind the proposed scheme is to exploit the relationships between spatial, frequency, and temporal parameters of the environment to solve for the position of the CR. The proposed scheme is modeled in the MATLAB programming language, and its efficacy is demonstrated through simulation. It is shown that over time the proposed scheme is capable of estimating the frequency band of operation and the location of a CR, and is thus capable of accounting for both frequency and spatial mobility inherent in the CR environment.