Miracle-dz/UniFAR-FTUs huggingface dataset:
Early social cognition : development and Influences

This dissertation investigated the development of early social-cognitive development in the first three years of life. While for a long time research on Theory of Mind (ToM), i.e. the ability to attribute mental states as wishes, intentions, and beliefs to self and others, has focused on preschool age, in recent years also earlier social-cognitive development has gained attention. The assumption of continuity in social-cognitive development is one question we considered in the present work. Moreover, we investigated the influence of various factors on this development, specifically the impact of temperament. In addition, we further examined the impact of temperament on general study performance in infancy. In order to assess children’s temperament we used the questionnaires developed by Rothbart and colleagues as they provide a variety of parent-report questionnaires to adequately assess temperamental aspects across childhood from infancy to later ages. In study 1, we longitudinally investigated the social-cognitive development in infants and toddlers. We tested the relation between infants’ joint attention skills at 12 months and four further social-cognitive skills that emerge around the age of 18 months, namely children’s pretend play behavior, their ability to recognize themselves in a mirror, to imitate an intended action, and to reason about other people’s desires. Only single abilities were related to each other. Some joint attention skills, declarative pointing and detecting the experimenter’s goal in a teasing task, were related to toddlers’ understanding of intention-based imitation. Also, initiating joint attention and performance on a blocking task were both related to pretend solitary play. Additionally, pretend play and mirror self-recognition were related. The results of study 1 cast light on the relationship of different social-cognitive abilities in early childhood. They extend earlier findings and support the idea of continuity in socialcognitive development. Specifically, they suggest that this continuity is not global but rather taskand age-specific.
Social Activities Rival Patch Submission for Prediction of Developer Initiation in OSS Projects

Maintaining a productive and collaborative team of developers is essential to Open Source Software (OSS) success, and hinges upon the trust inherent among the team. Whether a project participant is initiated as a developer is a function of both his technical contributions and also his social interactions with other project participants. Oneâs online social footprint is arguably easier to ascertain and gather than oneâs technical contributions e.g., gathering patch submission information requires mining multiple sources with different formats, and then merging the aliases from these sources. In contrast to prior work, where patch submission was found to be an essential ingredient to achieving developer status, here we investigate the extent to which the likelihood of achieving that status can be modeled solely as a social network phenomenon. For 6 different OSS projects we compile and integrate a set of social measures of the communications network among OSS project participants and a set of technical measures, i.e. OSS developers patch submission activities. We use these sets to predict whether a project participant will become a developer. We find that the social network metrics, in particular the amount of two-way communication a person participates in, are more significant predictors of oneâs likelihood to becoming a developer. Further, we find that this is true to the extent that other predictors, e.g. patch submission info, need not be included in the models. In addition, we show that future developers are easy to identify with great fidelity when using the first three months of data of their social activities. Moreover, only the first month of their social links are a very useful predictor, coming within 10% of the three month dataâs predictions. Finally, we find that it is easier to become a developer earlier in the projects lifecycle than it is later as the project matures. These results should provide insight on the social nature of gaining trust and advancing in status in distributed projects.
A fully integrated CMOS RF front-end for a multi-band analog mixed-signal interface

This paper addresses the analysis and design of a fully integrated CMOS RF front-end suitable for a general analog interface to be employed in mixed-signal SOC applications. This block must relocate an input analog signal to a fixed frequency band and provide a gain control to adjust the input signal dynamic range, so that the mixed-signal stage can process this translated input signal version. A dual-conversion heterodyne architecture suitable for this application is presented and implemented in IBM 0. 18μm CMOS process. Simulation results show a sensitivity of -70dBm, an IIP3 of -28dBm, and a NF of 25dB with a power of 55mW and area of 0.77mm2.
Spontaneous vs. Posed smiles - can we tell the difference?

Smile is an irrefutable expression that shows the physical state of the mind in both true and deceptive ways. Generally, it shows happy state of the mind, however, `smiles' can be deceptive, for example people can give a smile when they feel happy and sometimes they might also give a smile (in a different way) when they feel pity for others. This work aims to distinguish spontaneous (felt) smile expressions from posed (deliberate) smiles by extracting and analyzing both global (macro) motion of the face and subtle (micro) changes in the facial expression features through both tracking a series of facial fiducial markers as well as using dense optical flow. Specifically the eyes and lips features are captured and used for analysis. It aims to automatically classify all smiles into either `spontaneous' or `posed' categories, by using support vector machines (SVM). Experimental results on large database show promising results as compared to other relevant methods.
Virtual-Channel Flow Controll

Network throughput can be increased by dividing the buffer storage associated with each network channel into several virtual channels [DalSei]. Each physical channel is associated with several small queues, virtual channels, rather than a single deep queue. The virtual channels associated with one physical channel are allocated independently but compete with each other for physical bandwidth. Virtual channels decouple buffer resources from transmission resources. This decoupling allows active messages to pass blocked messages using network bandwidth that would otherwise be left idle. Simulation studies show that, given a fixed amount of buffer storage per link, virtual-channel flow control increases throughput by a factor of 3.5, approaching the capacity of the network.
A Review of DNA Microarray Data Analysis

Background: The mystery of life for a living organism resides in the function of thousands of genes and their products. The striking question of how to get the whole system of an organism in one picture, has been pondering for years. Traditional methods work on one gene at a time, which is time consuming and costly. The ingenuous idea of DNA microarrays created a solution to this problem. DNA microarrays are a new technology that allows the whole genome to be monitored on a single chip so that a better picture of the interactions among thousands of genes can be observed simultaneously (Brazam et al. 2000). A DNA microarray is composed of pieces of DNA ranging from 20-5000 base pairs concentrated into specific areas on a solid support such as a glass chip (Schena 1999). Thousands of same oligonucleotides are attached in a specific location on the support and gene expression can be observed by counting the amount of oligonucleotides that are bound. Therefore, the array works as a capturing device for specific complementary gene products. The experiment using DNA microarrays starts with the process of PCR, used to amplify genes of interest. The PCR products are purified and then placed on glass microscope slides using a robot. Reverse transcription is used to label both the test and reference total RNA using two different fluorescent dyes. The two fluorescent targets are added together and allowed to hybridize to the microarray. Laser exicitation of each hybridized target causes a specific emission with fingerprint-like spectra being produced. The spectra is measured by scanning confocal laser microscope, which is then imported into software that merges the two images and gives them specific colors. The gene expression of each target is given a value, and these values are imputed into data sets (Brown et al. 1999).
Load Balancing by Scoring for Hierarchical Mobile IPv6

HMIPv6 (hierarchical mobile IPv6) protocol introduces MAP (mobility anchor point) which relays all packets between MN (mobile node) and other nodes outside a MAP mobility management area (H. Soliman et al., 2005). This method can reduce the amount of signaling traffic and improve handover frequency. Since very high loads are concentrated in a MAP and the load of MAP possibly influences the communication quality, the load balancing by suitable policy is needed in a multi-layered MAP network. This paper proposes load balancing with a 'score' calculated according to attributes of MNs, such as handover frequency and holding time. Simulation results showed that this proposed method could reduce the control traffic while achieving load balancing on multi-layered MAP in HMIPv6
Burned Area Mapping Using Support Vector Machines and the FuzCoC Feature Selection Method on VHR IKONOS Imagery

The ever increasing need for accurate burned area mapping has led to a number of studies that focus on improving the mapping accuracy and effectiveness. In this work, we investigate the influence of derivative spectral and spatial features on accurately mapping recently burned areas using VHR IKONOS imagery. Our analysis considers both pixel and object-based approaches, using two advanced image analysis techniques: (a) an efficient feature selection method based on the Fuzzy Complementary Criterion (FuzCoC) and (b) the Support Vector Machine (SVM) classifier. In both cases (pixel and object-based), a number of higher-order spectral and spatial features were produced from the original image. The proposed methodology was tested in areas of Greece recently affected by severe forest fires, namely, Parnitha and Rhodes. The extensive comparative analysis indicates that the SVM object-based scheme exhibits higher classification accuracy than the respective pixel-based one. Additionally, the accuracy increased with the addition of derivative features and subsequent implementation of the FuzCoC feature selection (FS) method. Apart from the positive effect in the classification accuracy, the application of the FuzCoC FS method significantly reduces the computational requirements and facilitates the manipulation of the large data volume. In both cases (pixel and objet) the results confirmed that the use of an efficient feature selection method is a prerequisite step when extra information through higher-order features is added to the classification process of VHR imagery for burned area mapping.
A path-transfer based multi-path reliable routing in wireless sensor networks

We study multi-path reliable routing in wireless sensor networks. When data is transmitting from the source node to the destination node, once forward nodes conflict or failures the data cannot transmit as usual. Data missing can cause a serious impact on the network. Therefore, it is worth investigating the reliability of routing protocols. Aiming at data missing caused by nodes confliction and failures, this paper starts with proposing a novel transfer relationship of two paths by a bridge. It is a notion used to react how the data is transmitted from one path to another path. We then formulate the optimal routing based on the transfer relationship by considering the effect of wireless interference as a bipartite graph model. Through the bipartite graph model, we can calculate the interference between two paths easily. In addition, we propose a strategy to deal with congestion and failures. The real test-bed experimental and simulation results show that the proposed algorithms can deal with network congestion and improve the reliability of transmission significantly.
When Being Reactive Just

Reactive systems are, generally, highly successful for dynamic uncertain domains. Analysing why this should be so indicates the main criterion for success is that information apprehended about a given situation can render it certain enough to reliably inform action. A case is made for informing action by dynamic world modelling for domains where this does not hold. When the issue of attending selectively to situational information is introduced, the case for dynamic world modelling is enhanced. A system incorporating selective perception which dynamically models its domain is described.
Massively Parallel Support for Computationally Effective Recognition Queries

PARKA, a frame-based knowledge representation system implemented on the Connection Machine, provides a representation language consisting of concept descriptions (frames) and binary relations on those descriptions (slots). The system is designed explicitly to provide extremely fast property inheritance inference capabilities. PARKA performs fast "recognition" queries of the form "find all frames satisfying p property constraints" in O(d+p) time-proportional only to the depth, d, of the knowledge base (KB), and independent of its size. For conjunctive queries of this type, PARKA's performance is measured in tenths of a second, even for KBs with 100,000+ frames, with similar results for timings on the Cyc KB. Because PARKA's run-time performance is independent of KB size, it promises to scale up to arbitrarily larger domains. With such run-time performance, we believe PARKA is a contender for the title of "fastest knowledge representation system in the world".
Choosing an appropriate pronunciation model for the ELT classroom in Hong Kong : a sociolinguistic inquiry

This thesis is protected by copyright, with all rights reserved. By reading and using the thesis, the reader understands and agrees to the following terms: 1. The reader will abide by the rules and legal ordinances governing copyright regarding the use of the thesis. 2. The reader will use the thesis for the purpose of research or private study only and not for distribution or further reproduction or any other purpose. 3. The reader agrees to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
Nonlinear dynamics of human locomotion: from the perspective of dynamical systems theory

We have developed a three-link sagittal plane locomotion model and a sliding mode controller to study the dynamics and repeatability (step to step variability) of human locomotion. Constraint relations derived from the experimental measurements of angular joint rotations and velocities, pelvis translations, and ground reaction forces were implemented into the model. Two scalar measures were proposed to quantify the dynamics of motion. Their derivations are based on the concepts of dynamical systems theory. 3-D graphical simulations were generated to validate the utility of the proposed methods. This was achieved by modifying the model parameters, generated joint torques, and impulsive forces. Our simulation results have shown that proposed measures could be useful in monitoring the performance and progress of gait patients in clinical settings.
A framework for distributed 3D graphics applications based on compression and streaming. (Un cadre unificateur pour des applications graphiques 3D, basé sur la compression et la diffusion)

With the development of the computer networks, mainly the Internet, it became easier to develop applications where the execution is shared between a local computer, the Client, and one located on the other side of the network communication channel, the Server. The hardware advancements in the recent years made it possible to display 3D graphics (games, map navigation, virtual worlds) on mobile devices. However, executing these complex applications on the client terminal is not possible without reducing the quality of the displayed graphics or lowering its processing requirements. Different solutions have already been proposed in academic publications; however none of them satisfies all requirements. The objective of this thesis is to propose an alternative solution for a new client-server architecture where the connectedness of the mobile devices is fully exploited. Several main requirements are addressed: - Minimize the network traffic, - Reduce the required computational power on the terminal, and - Preserve the user experience compared with local execution. First a formal framework is designed that can effectively define and model distributed applications for 3D graphics. Then a model of new architecture is presented, that overcomes the disadvantages of the architectures presented in the state of the art. The core of the architecture is the MPEG-4 standard, which is used to transfer the data between the server and the client in a compressed manner. The last part of explores the design of architectures optimized for running on mobile devices. The design of the new client-server architecture is validated by implementing a game and running simulations.
Using PADL to specify AFrames

Abstract In this short technical note we show how PADL – the process algebraic ar-chitectural description language of Bernardo, Ciancarini and Donatiello – can be used to specify AFrames. AFrames exist to structure the machine in a Problem Frames development, and are important in that framework as they allow architectural expertise to be captured and reused therein. Because of the close proximity of PADL to other Architectural Description Languages, we assert that this work opens the Problem Frames framework to standard architectural abstractions. 1 Introduction Architectural description languages (ADLs, [1]) are used to describe software system architectures. ADLs consist of components and connectors, i.e., respec-tively, units of functionality and combinators thereof to build more complex functionality. ADLs will typically describe the topology of a software system, i.e., its structure, as well as its behaviour. Many architectures have been described in ADLs. To open AFrames, and so Problem Frames, to the large repository of architectural knowledge contained in the ADL literature we show how AFrames relate to one such notation, PADL. PADL ([2], [3]) provides a formalisation of the notion of an architectural type using PA, a CCS-like process algebra ([10]), that, through a CCS-like notion of bisimulation equivalence, allows the compositional and efﬁcient reasoning about its well-formedness. We choose PADL for its formal basis in process algebra, and its amenability to manipulation of its textual descriptions.Architectural Frames (AFrames), introduced in [4], [11] and formalised in [5], allow the naming and characterisation of architectural styles so that they can
COX‐2 independent induction of cell cycle arrest and apoptosis in colon cancer cells by the selective COX‐2 inhibitor celecoxib

The regular use of various nonsteroidal anti‐inflammatory drugs (NSAIDs) was shown to decrease the incidence of colorectal cancer. This effect is thought to be caused predominantly by inhibition of cyclooxygenase‐2 (COX‐2) and, subsequently, prostaglandin synthesis. However, recent studies have suggested that COX‐independent pathways may contribute considerably to these antiproliferative effects. To evaluate the involvement of COX‐dependent and COX‐independent mechanisms further, we assessed the effects of celecoxib (selective COX‐2 inhibitor) and SC560 (selective COX‐1 inhibitor) on cell survival, cell cycle distribution, and apoptosis in three colon cancer cell lines, which differ in their expression of COX‐2. Both drugs induced a G0/G1 phase block and reduced cell survival independent of whether or not the cells expressed COX‐2. Celecoxib was more potent than SC560. The G0/G1 block caused by celecoxib could be attributed to a decreased expression of cyclin A, cyclin B1, and cyclin‐dependent kinase‐1 and an increased expression of the cell cycle inhibitory proteins p21Waf1 and p27Kip1. In addition, celecoxib, but not SC560, induced apoptosis, which was also independent of the COX‐2 expression of the cells. In vivo, celecoxib as well as SC560 reduced the proliferation of HCT‐15 (COX‐2 deficient) colon cancer xenografts in nude mice, but both substances had no significant effect on HT‐29 tumors, which express COX‐2 constitutively. Thus, our in vitro and in vivo data indicate that the antitumor effects of celecoxib probably are mediated through COX‐2 independent mechanisms and are not restricted to COX‐2 over‐expressing tumors.
Adaptive value of ambling gaits in primates and other mammals

SUMMARY At speeds between the walk and the gallop, most mammals trot. Primates almost never trot, and it has been claimed that they transition directly from a walk to a gallop without any distinctive mid-speed running gait. If true, this would be another characteristic difference between the locomotion of primates and that of most other quadrupedal mammals. Presently, however, few data exist concerning the actual presence or absence of intermediate-speed gaits (i.e. gaits that are used between a walk and a gallop) in primates. Video records of running in twelve primate species reveal that, unlike most other mammals, all the primates studied almost exclusively adopt an `amble' - an intermediate-speed running gait with no whole-body aerial phase - rather than trot. Ambling is also common in elephants and some horses, raising the question of why ambling is preferred over trotting in these diverse groups of animals. Mathematical analyses presented here show that ambling ensures continuous contact of the body with the substrate while dramatically reducing vertical oscillations of the center of mass. This may explain why ambling appears to be preferable to trotting for extremely large terrestrial mammals such as elephants and for arboreal mammals like primates that move on unstable branches. These findings allow us to better understand the mechanics of these unusual running gaits and shed new light on primate locomotor evolution.
Combined LPC and MFCC Features based technique for Isolated Speech Recognition

The aim of speech recognition is to convert speech signal into a corresponding sequence of text. It is important to obtain the highest possible recognition rate without increasing the complexity of the system for cost-effective and reliable consumer applications. In this paper, main tasks involved in isolated speech recognition viz., pre-processing, feature extraction, pattern matching and their implementation are examined [1],[2]. Different existing methods, e.g., the Dynamic Time Warping (DTW), Hidden Markov Model (HMM) for implementing speech recognition are discussed and implemented for isolated digit recognition. A new method, which combines Linear Prediction Coefficients and Mel-Frequency Cepstral Coefficients features, has been proposed and recognition has been done using DTW. The performance of the proposed method is found to be better than existing methods.