Miracle-dz/UniFAR-FTUs huggingface dataset:
Comparative study and review of grid, cloud, utility computing and software as a service for use by libraries

Purpose – Grid computing, cloud computing (CC), utility computing and software as a service are emerging technologies predicted to result in massive consolidation as meta‐level computing services of everything beneath one umbrella in the future. The purpose of this study is to foster the understanding and differentiation, by using the three aforementioned types of computing technologies and software, as a service by both public and private libraries to meet their expectations and strategic objectives.Design/methodology/approach – The approach in this study is a review based on comparing the four computing technologies with a brief analysis for researching and designing the mind map of a new meta‐level computing service approach, taking into consideration the need for new economic tariff and pricing models as well as service‐level agreements.Findings – Since it is anticipated that there will be likely potential consolidation and integration of computing services, a study of these four most advanced computi.
Geometric and neuromorphic learning for nonlinear modeling, control and forecasting

The author describes an algorithm based on results from computational geometry that learns nonlinear dynamical system mappings. The algorithm was applied to (a) the control of robot motion along a nominal trajectory on the basis of a learned model of its inverse dynamics, and (b) prediction of the behavior of a complex nonlinear dynamic system for forecasting regional electric power consumption on the basis of a model learned from noisy time series data. The algorithm is shown to compare favorably to a neural learning algorithm. <<ETX>>
Interprocedural aliasing in the presence of pointers

An Alias occurs at some program point during execution when two more more names exist for the same location. We've investigated the theoretical difficulty of determining the aliases of a program, developed an approximation algorithm for solving for aliases in C like languages, and explored the precision (i.e., closeness of our approximate solution to the actual solution) and time behavior of this algorithm. Myers (Mye81) explored the theoretical difficulty of solving flow sensitive interprocedural data flow problems in the presence of aliasing. However, he did not make any claims about the difficulty of determining aliases. We isolate various programming language mechanisms that create aliases. The complexity of the alias problem (i.e., determining the aliases for a program) induced by each mechanism and their combinations is considered separately and categorized as ${\cal NP}$-hard, complement ${\cal NP}$-hard, or polynomial time $({\cal P}). $ We proved that if there are two (or more) levels of indirection, regardless of the alias mechanisms used, aliasing is ${\cal NP}$-hard. However, if only one level of indirection is possible, then the alias problem is in ${\cal P}. $ In addition, we show the alias problem in the presence of some mechanisms to be ${\cal P}$-space complete. Therefore, in a language which allows general purpose pointers, the problem of determining which aliases can occur during program execution is ${\cal NP}$-hard. We present an algorithm which safely approximates Interprocedural May Alias (i.e., we fail to report an alias only if it never occurs) in the presence of pointers. We are able to show, relative to our definition of precision, that our algorithm is as precise as possible in the worst case. We also pinpoint the sources of imprecision in our algorithm and can empirically bound its precision. Our algorithm has been implemented in a prototype analysis tool for C programs, and we present a preliminary empirical investigation of algorithm speed and precision.
Feature Interactions in Telecommunications Networks IV

From the Publisher: Feature interactions are related to the creation, maintenance, and evolution of new services (telephony, electronic commerce, multimedia, banking, etc.), and to the implementation of these services across distributed platforms. Some of the other aspects are software maintainability, software verification and validation, software documentation, and software development process. This book covers several types of telecommunication software (processing, communication, and management), multimedia applications and other types of distributed applications. Some of the contributions in the book represent work in progress, personal experience, and potential solutions. By their very nature, feature interactions can be found in different types of systems. The spectrum of contributions demonstrates the relevance of feature interactions problems. The book provides contributions by leading experts in these areas, covering many aspects of the specification, detection, and avoidance of feature interactions. The book presents research advances and report personal positions.
Apport de la technologie d’intégration 3D à forte densité d’interconnexions pour les capteurs d'images CMOS

Ce travail a montre que l’apport de la technologie d’integration 3D, permet de surmonter les limites imposees par la technologie monolithique sur les performances electriques (« coupling » et consommation) et sur l’implementation physique (aire du pixel) des imageurs. Grâce a l’analyse approfondie sur la technologie d’integration 3D, nous avons pu voir que les technologies d’integration 3D les plus adaptees pour l’integration des circuits dans le pixel sont : 3D wafer level et 3D construction sequentielle. La technologie choisie pour cette etude, est la technologie d'integration 3D wafer level. Cela nous a permis de connecter 2 wafers par thermocompression et d’avoir une interconnexion par pixel entre wafers. L’etude de l’architecture CAN dans le pixel a montre qu’il existe deux limites dans le pixel : l’espace de construction et le couplage entre la partie analogique et numerique « digital coupling ». Son implementation dans la technologie 3D autorise l’augmentation de 100% l’aire de construction et la reduction du « digital coupling » de 70%. Il a ete implemente un outil de calcul des elements parasites des structures 3D. L’etude des imageurs rapides, a permis d’etendre l’utilisation de cette technologie. L’imageur rapide type « burst » a ete etudie principalement. Cet imageur permet de dissocier la partie d’acquisition des images de la sortie. La limite principale, dans la technologie monolithique, est la taille des colonnes (pixels vers memoires). Pour une haute cadence d’acquisition des images, il faut une grande consommation de courant. Son implementation dans la technologie 3D a autorise a mettre les memoires au-dessous des pixels. Les etudes effectuees pour ce changement (reduction de la colonne a une interconnexion entre wafers), ont reduit la consommation totale de 90% et augmente le temps d’acquisition des images de 184%, en comparaison a son pair monolithique.
A comparative survey on invisible structured light

This paper proposes a comparative survey on techniques of vision based on invisible structured lighting. We have classified them in three distinct families: InfraRed Structured Light (IRSL), Imperceptible Structured Light (ISL) and Filtered Structured Light (FSL). For each of them, definition, minimal configuration and main applications found in the literature are given. Then, we compare them regarding to several criteria: required equipment, light pattern coding, color analysis, texture analysis, motion analysis, security, use in non-controlled environment. The description is IRSL, ISL and FSL sensors will permit to sum up these techniques; the comparison will permit to evaluate performances and efficiency of each of them. We think that this study could be useful to researchers that are looking for a compromise between stereovision and structured light vision, combining the processing tools extent of the former with the point matching reliability and simplicity of processing of the latter.
Java(TM) Programming Language, The (4th Edition)

Direct from the creators of the Java™ programming language, the completely revised fourth edition of The Java™ Programming Language is an indispensable resource for novice and advanced programmers alike.Developers around the world have used previous editions to quickly gain a deep understanding of the Java programming language, its design goals, and how to use it most effectively in real-world development. Now, Ken Arnold, James Gosling, and David Holmes have updated this classic to reflect the major enhancements in Java™ 2 Standard Edition 5.0 (J2SE™ 5.0). The authors systematically cover most classes in Java's main packages, java.lang. *, java.util, and java.io, presenting in-depth explanations of why these classes work as they do, with informative examples. Several new chapters and major sections have been added, and every chapter has been updated to reflect today's best practices for building robust, efficient, and maintainable Java software.Key changes in this edition include New chapters on generics, enums, and annotations, the most powerful new language features introduced in J2SE 5.0 Changes to classes and methods throughout to reflect the addition of generics Major new sections on assertions and regular expressions Coverage of all the new language features, from autoboxing and variable argument methods to the enhanced for-loop and covariant return types Coverage of key new classes, such as Formatter and ScannerThe Java™ Programming Language, Fourth Edition, is the definitive tutorial introduction to the Java language and essential libraries and an indispensable reference for all programmers, including those with extensive experience. It brings together insights you can only get from the creators of Java: insights that will help you write software of exceptional quality.
Students’ Perceptions when Learning Mathematics Online: A Path Analysis

Due to the inherent flexibility that online courses provide, the number of students enrolled in online courses has increased substantially both in higher education and K-12 environments. However, the amount of research on effectiveness of online learning fails to parallel its growth. To address the important question of whether learning online is an effective tool for learning mathematics, this study looks at high school students’ perception of the over all usefulness of online synchronous and asynchronous modes of delivery in learning mathematics. The study shows the students feel that the online content and its respective activities are effectives in learning mathematics. However, the results of the effectiveness of synchronous activities and threaded discussion boards are inconclusive and pinpointing the nature their effectiveness is challenging lend themselves to further research.
Structure-Based Virtual Screening in Spark

Structure-Based Virtual Screening (SBVS) is a method used in drug discovery in order to search leads for certain target receptors. In the past decades high-throughput methods were used in order to build huge molecular libraries. ZINC and eMolecules are two high-throughput virtual molecular libraries that count million of molecules. Therefore, SBVS is computationally heavy for such libraries. However, SBVS is a trivially parallelizable task. In the past Message Passing Interface (MPI) has been used in order to parallelize SBVS. The main disadvantage of MPI based SBVS is that organizations need High Performance Computing (HPC) facilities in order to run it. Furthermore, MPI does not offer much more than a message passing interface. Therefore, MPI-applications are difficult to implement and maintain. Big data analytics on inexpensive hardware was pioneered by Google’s MapReduce programming model and parallel implementation. MapReduce applications have the property to be out of the box fault tolerant and scalable. Therefore, these applications are suitable to run in the cloud, which is in general cheaper than HPC. Even if Google’s MapReduce is legacy, many open source implementations such as Apache Hadoop are available. However, MapReduce is not a general purpose programming model and does not easily apply to SBVS. The Spark framework is an open source project, and it represents an evolution of Google’s MapReduce. The Spark programming model is more flexible than MapReduce and it gracefully applies to SBVS. Furthermore, Spark-applications are still out of the box fault tolerant, scalable and cloud runnable. Using Spark we implemented a tool for massively parallel SBVS. Our tool allows the user to define cloud-ready pipelines for high-throughput SBVS with few lines of code. The tests we performed in our private cloud show that our tool is simple to use and it scales well. Therefore, here we show how Spark can be used for massively parallel pipelining, and more in general how Big Data analytics can be beneficial in life science. Structure-Based Virtual Screening in Spark Popular science summary
Dynamic Programming Algorithms in Speech Recognition

In a system of speech recognition containing words, the recognition requires the comparison between the entry signal of the word and the various words of the dictionary. The problem can be solved efficiently by a dynamic comparison algorithm whose goal is to put in optimal correspondence the temporal scales of the two words. An algorithm of this type is Dynamic Time Warping. This paper presents two alternatives for implementation of the algorithm designed for recognition of the isolated words.
Multicriteria Optimal Humanoid Robot Motion Generation

Humanoid robots, because of their similar structure with humans, are expected to operate in hazardous and emergency environments. In order to operate in such environments, the humanoid robot must be highly autonomous, have a long operation time and take decisions based on the environment conditions. Therefore, algorithms for generating in real time the humanoid robot gait are central for development of humanoid robot. In the early works, the humanoid robot gait is generated based on the data taken from human motion (Vukobratovic et al. 1990). Most of the recent works (Roussel 1998, Silva & Machado 1998, Channon 1996) consider minimum consumed energy as a criterion for humanoid robot gait generation. Roussel (1998) considered the minimum consumed energy gait synthesis during walking. The body mass is concentrated on the hip of the biped robot. Silva & Machado (1998) considered the body link restricted to the vertical position and the body forward velocity to be constant. The consumed energy, related to the walking velocity and step length, is analyzed by Channon (1996). The distribution functions of input torque are obtained by minimizing the joint torques. In our previous works, we considered the humanoid robot gait generation during walking and going up-stairs (Capi et al. 2001) and a real time gait generation (Capi et al. 2003). In addition of minimum consumed energy (MCE) criteria, minimum torque change (MTC) (Uno et al. 1989, Nakano et al. 1999) was also considered. The results showed that MCE and MTC gaits have different advantages. Humanoid robot motion generated based on MCE criterion was very similar with that of humans. Another advantage of MCE criterion is the long operation time when the robot is actuated by a battery. On the other hand, MTC humanoid robot motion was more stable due to smooth change of torque and link accelerations. Motivated from these observations, it will be advantageous to generate the humanoid robot motion such that different criteria are satisfied. This belongs to a multiobjective optimization problem. In a multiobjective optimization problem there may not exist one solution that is the best with respect to all objectives. Usually, the aim is to determine the tradeoff surface, which is a set of nondominated solution points, known as Pareto-optimal or noninferior solutions. The multiobjective problem is almost always solved by combining the multiple objectives into one scalar objective using the weighting coefficients. Therefore, to combine different
Antenna factors of half‐wavelength dipole antennas with roberts balun

To use antenna factors most effectively in either EMI measurement or the reference antenna method, the antenna factor is more accurately derived than the conventionally obtained value when a half-wave resonant dipole antenna with Roberts balun (ANSI C63.5 Specification) is placed on the ground plane. In the calculation, the antenna is treated as the boundary value problem of Maxwell's equations and is analyzed by the Galerkin moment method. The balun is treated using circuit theory based on power transmission mismatch. To confirm the validity of these theoretical calculations, the computed value of the antenna factor in free space is compared with the measured results by the standard site method and the standard antenna method. It is confirmed that the tendency of the numerical results agrees well with that of the measured values.
Plurality in Chinese with a restricted class of noun-classifier words

This study is concerned with the realization of plurality in the nominal in Chinese. It is part of a larger research program (cf. Fassi Fehri & Vinet 2007). It here focuses on a restricted type of lexical form which has received less attention in the literature, namely a word formed by a Noun-Classifier sequence, such as ch_liang (car fleet) or xinjian (letters, mail). Classifiers can indeed combine in a reverse manner [N-Cl]No with the Ns they denote to form a No. It is argued that if such Ns form a group Pl in the grammar, under the projection Nb, before getting to D, then this explains why their grammatical Group nature makes it incompatible with a singular interpretation, simultaneous counting, as well as other semantic readings. It is proposed, as discussed in previous research, that the two functional projections, ClassifierP and NumberP, are both overtly realized in Chinese.
Static analysis of program source code using EDSA

EDSA (expert data flow and static analysis tool) which uses static analysis of source code to help gain an understanding of existing code, is described. This may be for the purpose of tracking down a bug or to determine in advance whether an intended change will have any undesirable side effects. In either case, the phase of the development life cycle that is most likely to benefit from a tool like EDSA is the maintenance phase. EDSA provides three kinds of facilities. It helps to browse through code, following either the control flow or data flow, rather than the order in which the code happens to be written. It displays code with unimportant source lines eluded, so that the user can get a more global view of the program. Finally, it provides search management to make it easier to examine all possibilities when browsing. The mechanism used to create and display various views of programs is described and the approach to the user interface is discussed. The state of the current implementation is described. <<ETX>>
Multiple candidate characters in the post-processing for off-line handwritten Chinese character recognition

The size of candidate character set is very important in the contextual post-processing for Chinese character recognition, which should be changed with the script's recognition accuracy of isolated Chinese character recognition. In this paper, based on the confidence theory of candidate character, two methods are proposed to automatically decide the size of candidate character set. One is called static decision method in light of the script's overall situation, and the other is called dynamic decision method in allusion to each candidate character set in the script. Experimental results on off-line handwritten Chinese character recognition show the effectiveness of the proposed methods.
Learning Analytics as a Method to Examine Students' Learning Patterns in an Online Module

This research relates to the investigation of the written discussions in an asynchronous online activity, namely a blog activity that forms part of a fully online module for first year undergraduate students. The aims of this study were to (i) analyse the quality and depth of different levels of interactions by categorising students’ responses into one of the three following categories: paraphrasing, value addition and critical thinking; (ii) explore of the relationship between this specific blog learning activity and development of higher order thinking skills of students; and (iii) investigate on possible patterns of learner behaviour in an online learning environment in the context of newly developed Web-based educational technologies at the VCILT, University of Mauritius. The study corpus used is a transcript of 764 postings generated by a group of 800 first year students engaged in a 6-credit general education module (GEM) delivered totally online in a time span of one year.
The mystery of the “spinning statue” at Manchester Museum

Abstract This paper discusses the emergence, and impact, of public perceptions of Ancient Egypt and diverse ideas of “magic” at the Manchester Museum, following the huge response to the episode of the “spinning statuette. ” In June 2013, a video of an Egyptian statuette spinning of its own accord in its case in the Egypt Gallery of the Manchester Museum went viral. During the media storm that followed the publication of the video, many hinted at a “magic event,” which could be related to popular perceptions of Ancient Egypt: ideas from movies and popular culture were widely used to explain and comment, often ironically, on the episode. At the same time, in the museum galleries people were jostling to see the statuette and questioning the museum staff. Therefore, this paper will observe how media and museum audiences have used the concept of “magic” in relation to the spinning statuette: what beliefs and attitudes towards “magic” emerge from these comments? Why was the museum criticized for suggesting a “magic” connection? And what have been the outcomes of the episode for the museum and for our understanding of public perceptions of Ancient Egypt?
BRITE: A Flexible Generator of Internet Topologies

Abstract BRITE is a parameterized topology generation tool, which can be used to flexibly control various parameters (such as connectivity and growth models) and study various properties of generated network topologies (such power laws, path length and clustering coefficient). BRITE can be used to study the relevance of possible causes for properties recently observed in Internet topologies. Different combinations of possible causes can be tested. In this version, we consider four of them: (1) preferential connectivity of a new node to existing nodes; (2) incremental growth of the network; (3) geographical distribution of nodes; and (4) locality of edge connections. We use BRITE in [BU-CS-TR-2000-0004] to study the origin of power laws and other metrics in Internet topologies. BRITE (Boston university Representative Internet Topology gEnerator) is available on the Web at http://www.cs. bu.edu/faculty/matta/Research/BRITE/