China
Africa
Explore chapters and articles related to this topic
Parallel Computing Programming Basics
Published in Vivek Kale, Parallel Computing Architectures and APIs, 2019
The structure of the Haskell program: At the topmost level, Haskell software is a set of modules. The modules allow the possibility to control all the code included and to reuse these modules in large and distributed software in the cloud.The top level of a model is compounded from a collection of declarations. Declarations are used to define things such as ordinary values, data types, type classes, and some fixed information.At a lower level are expressions. The way that expressions are defined in a software application written in Haskell is very important. Expressions denote values that have a static type and represent the heart of Haskell programming.The last level is that of lexical structure, which captures the concrete representation of a software in text files.
Higher-Level Programming
Published in Syed R. Rizvi, Microcontroller Programming, 2016
In the above example, the code block consists of four lines. Two of them are occupied by curly braces. The symbolic name “count” is called a variable. Variables are memory locations that are given names and can be assigned values. We use variables to store data in memory for later use. A declaration statement provides a data type and a variable name. The third line in the code block above is a declaration statement with an equal sign (=). This is a binary operator called the assignment operation. We will look into operators in the next subsection. Helpful Hint: Unless a programmer specifies otherwise, all forms of integers are signed by default.Helpful Hint: The long and unsigned integers are used to declare a longer range of values.
C Programming
Published in Paul W. Ross, The Handbook of Software for Engineers and Scientists, 2018
The ‘extern’ keyword is to variable declarations what prototypes are to functions. Declaring a variable with ‘extern’ allows the compiler to continue as if that variable were declared in the current file, but requires that the linker supply a reference to the actual variable declaration at link time. External declarations are often used in header files to explicitly export data items defined in the module implementation. The ‘extern’ keyword can also be used to explicitly import data items that are declared in other files. Using ‘extern’ in this way is less desirable than explicitly exporting the data item in a header, but is a useful workaround when such declarations do not exist.
Integrated surgery scheduling by constraint programming and meta-heuristics
Published in International Journal of Management Science and Engineering Management, 2022
Azadeh Farsi, S. Ali Torabi, Mahdi Mokhtarzadeh
This problem contains if-then constraints. A drawback of a mixed integer programming (MIP) model is that a MIP model needs auxiliary variables to handle these constraints. The CP model resembles a MIP model in terms of syntax. It contains a declaration of decision variables with their domains, constraints, and an objective function. A CP model can contain non-linear and logical expressions, decision variables as indices in other vectors of decision variables, and global constraints that capture a relationship between decision variables. A CP model is solved by a general or domain-specific method that branches on decision variables and their values repeatedly and propagates constraints to prune the domain of decision variables and objective until an optimal solution is found (Apt, 2003). CP has been successfully applied to scheduling problems such as vehicle routing (Gondran et al., 2019), production scheduling (Baptiste, Le Pape, & Nuijten, 2012; Mokhtarzadeh, Tavakkoli-Moghaddam, Vahedi-Nouri, & Farsi, 2020), and timetabling (June, Obit, Leau, & Bolongkikit, 2019). Meskens, Duvivier, and Hanset (2013) developed a CP model for operating room scheduling. Here, a CP model is developed to schedule small- and medium-sized surgery scheduling problems.
Multi-rigid-body dynamics and online model predictive control for transformable multi-links aerial robot*
Published in Advanced Robotics, 2019
Fan Shi, Moju Zhao, Tomoki Anzai, Keita Ito, Xiangyu Chen, Shunichi Nozawa, Kei Okada, Masayuki Inaba
We utilize the multi-rigid-body model to represent the transformable multirotor robot, where each link is regarded as a single rigid body. Our target is to build the equations on force and moment with respect to the frame under the mentioned model. Implementing forward kinematics with joint angles , position and orientation of each link could be computed from the root link, and the position of could be obtained respectively. Orientation of is defined to be same as the orientation of baselink where the main controller board is attached. Compared with the simplified circular model [20], we could establish a more accurate dynamic model. All the variable used in this paper follows the declaration in Table 1.
Bio-monitoring of DNA damage in matchstick industry workers from Peshawar Khyber Pakhtunkhwa, Pakistan
Published in International Journal of Occupational and Environmental Health, 2018
Muhammad Khisroon, Ajmal Khan, Ubaid Ullah, Farrah Zaidi
The slides were stained with 70 μl Acridine orange dye (20 μg/ml) and kept for 5 min, coverslips were placed on the slide, and the samples were viewed by fluorescence microscopy (Nikon Eclipse 80 i equipped with 450–490 nm excitation filter). In order to calculate DNA damage, 100 cells per sample were chosen randomly and analyzed visually according to comet appearance. Five classes, i.e. from class 0 (no DNA damage) to class 4 (maximum DNA damage) give sufficient declaration. Visual scoring is a reliable, simple, and rapid method for scoring the comets [18]. Total comet score (TCS) was then calculated according to the formula, TCS = 0(n) +1(n) +2(n) +3(n) +4(n), where “n” indicates number of cells in each class, thus the overall score for each slide was therefore between 0 (undamaged) and 400 (maximum damaged), as referred by Collins [18] and reported in our previous publications [19–21].