Miracle-dz/UniFAR-FTUs huggingface dataset:
The influence of serum substituents on serum-free Vero cell conditioned culture media manufactured from Dulbecco's modified Eagle medium in mouse embryo culture

Objective This study was conducted to examine the influences of supplementation of the serum substituents and available period of serum-free Vero cell conditioned media (SF-VCM) manufactured from Dulbecco's modified Eagle medium cultured with Vero cells for in vitro development of mouse preimplantation embryos. Methods A total of 1,099 two-cell embryos collected from imprinting control region mice were cultured in SF-VCM with 10% and 20% human follicular fluid (hFF), serum substitute supplement (SSS), and serum protein substitute (SPS). Development of embryos was observed every 24 hours. Results between different groups were analyzed by chi-square test, and considered statistically significant when P-value was less than 0.05. Results The rates of embryonic development cultured in SF-VCM supplemented with serum substituents were significantly higher compare with serum-free group (P < 0.05). The rates of embryonic development after 48 hours (morula≤) and 96 hours (blastocyst≤) were significantly higher in 20% SSS and 10% SPS than in 20% hFF supplementation (P < 0.05). And the rates of embryonic development after 96 hours (hatching blastocyst≤) were significantly higher in 10% SPS (94.5%) than in 20% SSS (82.6%) and 20% hFF supplementation (68.5%). The rates of embryonic development according to storage period of the SF-VCM supplemented with 10% SPS showed no significant difference between control, 2 weeks and 4 weeks group. However developmental rate in 6 weeks storage group was significantly lower than other groups. Conclusion The rate of embryonic development after 96 hours (hatching blastocyst≤) was significantly higher in SF-VCM supplemented with 10% SPS. And storage period of media up to 4 weeks did not affect on embryonic development.
Resource Management Using Untrusted Auctioneers in a Grid Economy

The CORA (Coallocative, Oversubscribing Resource Allocation) architecture is an auction based resource reservation system that makes combinatorial allocations of resources to clients. The focus of this paper is on the use of cryptographic tools in CORA to remove the need for trust in the resource auctioneer. One of the nice properties of this approach is that the auctioneers can be drawn from an arbitrary pool of untrusted peers, without the need to establish pre-existing trust or restrict the role of auctioneer to a trusted system service. This approach results in more flexibility in the design of large economic systems, with the potential for wide distribution of load amongst many auctioneers. In addition, only the winners of the auction and the prices they pay are revealed while all other bid values are kept secret. It is our belief that future growth or commercialisation of large scale Grid systems requires the provision of such mechanisms to share the wide pool of Grid brokered resources such as computers, software, licences and peripherals amongst many users and organisations. This paper encapsulates an overview of our design, our experiences of implementing two different secure auction protocols and the performances that we have achieved.
Probabilistic workflow mining

In several organizations, it has become increasingly popular to document and log the steps that makeup a typical business process. In some situations, a normative workflow model of such processes is developed, and it becomes important to know if such a model is actually being followed by analyzing the available activity logs. In other scenarios, no model is available and, with the purpose of evaluating cases or creating new production policies, one is interested in learning a workflow representation of such activities. In either case, machine learning tools that can mine workflow models are of great interest and still relatively unexplored. We present here a probabilistic workflow model and a corresponding learning algorithm that runs in polynomial time. We illustrate the algorithm on example data derived from a real world workflow.
Sociology for What? Rethinking Sociology in an Era of Transformatory Changes

Dans cet article, l'A se penche sur l'evolution historique de la sociologie en Inde. Apres un hommage appyue au professeur Syed Hussein Alatas, l'A analyse les influences de l'anthropologie britannique, de la sociologie americaine et du marxisme sur les orientations theoriques et methodologiques de la sociologie indienne, et s'interroge sur le role de la sociologie en fonction des courants dominants des annees 90 face aux problemes contemporains
Improved approximation bounds for Vector Bin Packing

In this paper we propose an improved approximation scheme for the Vector Bin Packing problem (VBP), based on the combination of (near-)optimal solution of the Linear Programming (LP) relaxation and a greedy (modified first-fit) heuristic. The Vector Bin Packing problem of higher dimension (d \geq 2) is not known to have asymptotic polynomial-time approximation schemes (unless P = NP). Our algorithm improves over the previously-known guarantee of (ln d + 1 + epsilon) by Bansal et al. [1] for higher dimensions (d > 2). We provide a {\theta}(1) approximation scheme for certain set of inputs for any dimension d. More precisely, we provide a 2-OPT algorithm, a result which is irrespective of the number of dimensions d.
Automatic Speech Recognition of accented Hindi data

Inter-speaker variability resulting from factors such as gender, emotions, accent and age lead to the decrease in recognition accuracy of speaker-independent Automatic Speech Recognition systems. Accent variation in Hindi speech and its effect on the performance of Continuous Speech Hindi ASR was studied with the objective to design and develop a compensation technique for accent variation. This paper presents the results of the preliminary experiments conducted in the process.
Comprehensive performance analysis of a TCP session over a wireless fading link with queueing

A link model-driven approach toward transmission control protocol (TCP) performance over a wireless link is presented. TCP packet loss behavior is derived from an underlying two-state continuous time Markov model. The approach presented here is (to our knowledge) the first that simultaneously considers (1) variability of the round-trip delay due to buffer queueing; (2) independent and nonindependent (bursty) link errors; (3) TCP packet loss due to both buffer overflow and channel errors; and (4) the two modes of TCP packet loss detection (duplicate acknowledgments and timeouts). The analytical results are validated against simulations using the ns-2 simulator for a wide range of parameters; slow and fast fading links; small and large link bandwidth-delay products. For channels with memory, an empirical rule is presented for categorizing the impact of channel dynamics (fading rate) on TCP performance.
Properties ofPb(Zr,Ti)O3ultrathin films under stress-free and open-circuit electrical boundary conditions

A first-principles-based scheme is developed to simulate properties of (001) PbO-terminated $\mathrm{Pb}({\mathrm{Zr}}_{1\ensuremath{-}x}{\mathrm{Ti}}_{x}){\mathrm{O}}_{3}$ thin films that are under stress-free and open-circuit boundary conditions. Their low-temperature spontaneous polarization never vanishes down to the minimal thickness, and continuously rotates between the in-plane ⟨010⟩ and ⟨110⟩ directions when varying the Ti composition around $x=0.50$. Such rotation dramatically enhances piezoelectricity and dielectricity. Furthermore, the order of some phase transitions changes when going from bulk to thin films.
A 1.40mm2 141mW 898GOPS sparse neuromorphic processor in 40nm CMOS

Sparsity is a brain-inspired property that enables a significant reduction in workload and power dissipation of deep learning. This work presents a 1.40mm2 40nm CMOS sparse neuromorphic processor that implements a two-layer convolutional restricted Boltzmann machine (CRBM) for inference and a support vector machine (SVM) classifier. The processor incorporates sparse convolvers to realize sparsity-proportional workload reduction. The architecture is parallelized along a non-sparse dimension to minimize stalling. At 0.9V and 240MHz, the processor achieves an effective 898.2GOPS performance, dissipating 140.9mW. Using sparsity, we reduce the workload, datapath power consumption and area by 3.4×, 3.3× and 1.74×, respectively. The design uses latch-based memory to reduce area and dynamic clock gating to save power.
Alignment between luminous red galaxies and surrounding structures at z∼ 0.5

We analyse a high-redshift sample (0.4 < z < 0.5) of luminous red galaxies (LRGs) extracted from the Sloan Digital Sky Survey data release 4 and their surrounding structures to explore the presence of alignment effects of these bright galaxies with neighbour objects. In order to avoid projection effects, we compute photometric redshifts for galaxies within 3 h -1 Mpc in projection of LRGs and calculate the relative angle between the LRG major axis and the direction to neighbours within 1000 km s -1 . We find a clear signal of alignment between LRG orientations and the distribution of galaxies within 1.5 h -1 Mpc. The alignment effects are present only for the red population of tracers; LRG orientation is uncorrelated to the blue population of neighbour galaxies. These results add evidence to the alignment effects between primaries and satellites detected at low redshifts. We conclude that such alignments were already present at z ∼ 0.5.
Hapgets, Towards Haptically-enhanced widgets Based on a User Interface Description Language

This paper describes an interaction technique wherein web pages are parsed so as to automatically generate a virtual reality scene composed of “hapgets” (haptically-enhanced widget), a three dimensional widget providing a behavior that is analogous to its original web behavior but that is enhanced with capabilities for haptic feedback. In this interaction technique, haptic and virtual modalities are combined together in order to enhance user experiences for multiple users: a normal sighted person is able to normally interact with the virtual reality scene by direct manipulation, a blind person is able to interact with the virtual reality scene by sensing and acting on the hapgets, a person having a small visual impairment benefits from the haptic feedback to reinforce the visual channel. A small toolkit of hapgets is described and used in some examples. Each hapget is also specified in UsiXML, a XML-compliant User Interface Description Language that supports model-driven engineering of user interfaces. In this way, any UsiXML-compatible user interface can be rendered thanks to any traditional user interface interpreter as well as through HaptiXML, a special rendering engine that has been developed for this purpose.
Application of Global Route-Planning Algorithms with Geodesy

Global Route-Planning Algorithms (GRPA) are required to compute paths between several points located on Earth's surface. A geodesic algorithm is employed as an auxiliary tool, increasing the precision of distance calculations. This work presents a novel simulator for GRPA, which compares and evaluates three GRPAs implemented to solve the shortest path problem for points located at different cities: A*, LPA*, and D*Lite. The performance of each algorithm is investigated with a set of experiments, which are executed to check the answers provided by the algorithms and to compare their execution time. It is shown that GRPAs implementations with consistent heuristics lead to optimal paths. The noticeable differences among those algorithms are related to the time execution after successive executions.
Interference Channels With Coordinated Multipoint Transmission: Degrees of Freedom, Message Assignment, and Fractional Reuse

Coordinated multipoint (CoMP) transmission is an infrastructural enhancement under consideration for next generation wireless networks. In this paper, the capacity gain achieved through CoMP transmission is studied in various models of wireless networks that have practical significance. The capacity gain is analyzed through the degrees of freedom (DoF) criterion. The DoF available for communication provides an analytically tractable way to characterize the capacity of interference channels. The considered channel model has K transmitter/receiver pairs, and each receiver is interested in one unique message from a set of K independent messages. Each message can be available at more than one transmitter. The maximum number of transmitters at which each message can be available, is defined as the cooperation order M. For fully connected interference channels, it is shown that the asymptotic per user DoF, as K goes to infinity, remains at 1/2 as M is increased from 1 to 2. Furthermore, the same negative result is shown to hold for all M ≥ 2 for any message assignment that satisfies a local cooperation constraint. On the other hand, when the assumption of full connectivity is relaxed to local connectivity, and each transmitter is connected only to its own receiver as well as L neighboring receivers, it is shown that local cooperation is optimal. The asymptotic per user DoF is shown to be at least max {1/2, 2M/(2M + L)} for locally connected channels, and is shown to be 2M/(2M + 1) for the special case of Wyner's asymmetric model where L = 1. An interesting feature of the proposed achievability scheme is that it relies on simple zero-forcing transmit beams and does not require symbol extensions. Also, to achieve the optimal per user DoF for Wyner's model, messages are assigned to transmitters in an asymmetric fashion unlike traditional assignments where message i has to be available at transmitter i. It is also worth noting that some receivers have to be inactive, and fractional reuse is needed to achieve equal DoF for all users.
Hide and seek: worms digging at the Internet backbones and edges

The problem of malicious shellcode detection in high-speed network channels is a significant part of the more general problem of botnet propagation detection and filtering. Many of the modern botnets use remotely exploitable vulnerabilities in popular networking software for automatic propagation. We formulate the problem of shellcode detection in network flow in terms of formal theory of heuristics combination, where a set of detectors are used to recognize specific shellcode features and each of the detectors has its own characteristics of shellcode space coverage, false negative and false positive rates and computational complexity. Since the set of detectors and their quality is the key to the problem’s solution, we will provide a survey of existing shellcode detection methods, including static, dynamic, abstract execution and hybrid, giving an estimation to the quality of the characteristics for each of the methods. Keywords-shellcode; malware; polymorphism; metamorphism; botnet detection;
Simple Annotation Tools for Complex Annotation Tasks : an Evaluation

This paper presents a comparative evaluation of ready-to-use, XML-based tools for annotating linguistic data. We start by describing our research project that deals with the creation and annotation of empirical data related to information structure. Based on the requirements of this project and the data, we develop a set of evaluation criteria and apply them in the evaluation of five selected annotation tools.
The Laryngeal Class in RcvP and Voice phenomena in Dutch

This article proposes a system for representing phonation distinction in consonantswithin Radical CV Phonology (RCVP), a dependency-based model thatuses unary “features” (called elements). The RCVP model is briefly outlined.The proposal for phonation distinction is compared to traditional binarysystems and other unary proposals in the context of Government Phonology.The model is applied to phonation distinctions in Dutch, English and Frenchwhich has traditionally been claimed to have different analyses. RCVP proposesa more unified analysis that uses the notion of enhancement. This article paysspecific attention to voicing phenomena in Dutch (final devoicing, progressiveand regressive voice assimilation) to illustrate and motivate certain aspects ofthe proposed system.
SPATIALLY RESOLVED SPECTROSCOPY OF SUB–AU-SIZED REGIONS OF T TAURI AND HERBIG AE/BE DISKS

We present spatially resolved near-IR spectroscopic observations of 15 young stars. Using a grism spectrometer behind the Keck interferometer, we obtained an angular resolution of a few milliarcseconds and a spectral resolution of 230, enabling probes of both gas and dust in the inner disks surrounding the target stars. We find that the angular size of the near-IR emission typically increases with wavelength, indicating hot, presumably gaseous material within the dust sublimation radius. Our data also clearly indicate Brγ emission arising from hot hydrogen gas, and suggest the presence of water vapor and carbon monoxide gas in the inner disks of several objects. This gaseous emission is more compact than the dust continuum emission in all cases. We construct simple physical models of the inner disk and fit them to our data to constrain the spatial distribution and temperature of dust and gas emission components.
Facilitating collaboration through design games

In recent years both companies and research communities call for collaborative work practices and user-centered approaches in various design fields. There are several challenges and issues to take into consideration. For instance there is a need to find ways of collaborating across various competences, interests, responsibilities and perhaps professional languages both within one organization, between several organizations and between the organizations and a group of (potential) users. It is necessary to find ways to learn about users and the contexts of use, and to create a common understanding of the development task. This paper presents a set of four design games, which offers solutions to the challenges mentioned. The design games have been developed in the Space Studio during several projects and years. Here experiences are discussed on the basis of two research projects carried out in collaboration with industrial partners and potential users, and use of the games in three educational settings.The overall aim of the design games is to help facilitate a user-centered design process for cross-disciplinary design groups early in the design process. Framing collaborative design activities in a game format, arguably improves idea generation and communication between stakeholders. By shifting focus to the game, power relations and other factors that might hamper idea generation, are downplayed.
Discussion of Trade, Multinationals and Labour

Two of the most defining features of US labour market developments over the past several decades have been the lack of growth of average earnings and the growing dispersion of earnings. In terms of the latter, the real earnings of those at the lower end of the wage dispersion actually declined over the 1980s. While the phenomenon of increasing pay inequality has been characteristic of a number of developed economies (OECD 1993), the increase in pay dispersion has been greater in the US than elsewhere. (The UK also experienced a significant rise in pay dispersion, but in association with rising real earnings, including of those at the lower end of the pay distribution.) Not surprisingly, these two features of US labour market developments have given rise to concerns, which in turn, have prompted analysts to consider their explanations.
Identification of Residues in Domain III ofBacillus thuringiensis Cry1Ac Toxin That Affect Binding and Toxicity

ABSTRACT Alanine substitution mutations in the Cry1Ac domain III region, from amino acid residues 503 to 525, were constructed to study the functional role of domain III in the toxicity and receptor binding of the protein to Lymantria dispar, Manduca sexta, and Heliothis virescens. Five sets of alanine block mutants were generated at the residues 503SS504,506NNI508, 509QNR511,522ST523, and 524ST525. Single alanine substitutions were made at the residues509Q, 510N, 511R, and513Y. All mutant proteins produced stable toxic fragments as judged by trypsin digestion, midgut enzyme digestion, and circular dichroism spectrum analysis. The mutations,503SS504-AA,506NNI508-AAA,522ST523-AA,524ST525-AA, and 510N-A affected neither the protein’s toxicity nor its binding to brush border membrane vesicles (BBMV) prepared from these insects. Toward L. dispar and M. sexta, the509QNR511-AAA, 509Q-A,511R-A, and 513Y-A mutant toxins showed 4- to 10-fold reductions in binding affinities to BBMV, with 2- to 3-fold reductions in toxicity. Toward H. virescens, the509QNR511-AAA, 509Q-A,511R-A, and 513Y-mutant toxins showed 8- to 22-fold reductions in binding affinities, but only509QNR511-AAA and 511R-A mutant toxins reduced toxicity by approximately three to four times. In the present study, greater loss in binding affinity relative to toxicity has been observed. These data suggest that the residues509Q, 511R, and 513Y in domain III might be only involved in initial binding to the receptor and that the initial binding step becomes rate limiting only when it is reduced more than fivefold.
Decoupling linear dynamical systems using disturbance accommodation control theory

Unwanted coupling between linear dynamical systems can cause instability even when each system is individually stable. In this paper, we demonstrate how to design a disturbance accommodating controller to automatically cancel the unwanted coupling and to allow each system to behave as if the coupling didn't exist. This approach can be effective even when little is known about the “physics” of the coupling-disturbance.