Miracle-dz/UniFAR-FTUs huggingface dataset:
Access control in probative value cloud

Access Control over large scale distributed system like Cloud computing are one of the most debated topics of computer security. Despite the common use and the popularity of the Cloud computing paradigm, significant risks and challenges are inherent to this new concept, especially when we talk about storage of sensitive data via insecure network. In this paper we look at the problem of protecting data from unauthorized access to the Cloud in the context of gSafe (government Safe) project. Indeed, gSafe project defines essential basic units for a probative storage Cloud. The cornerstone of the efficient cloud security architecture is a well-written access control policy. In today's information technology, many models of access control have been proposed like the Mandatory Access Control (MAC), Discretionary Access Control (DAC), Role-Based Access Control (RBAC) and the latest one Usage Control Authorization, oBligation and Condition (UCONABc). In this paper we use six entities proposed in the UCONABC: Object, Subject, Right, Authorization, oBligation and Condition to model the access control management in the gSafe project. Then we present the XML scheme containing metadata for stored files and users' access authorizations. The proposed solution is validated and implemented over Hadoop distributed file system.
Functional Interaction between the Mouse Notch1 Intracellular Region and Histone Acetyltransferases PCAF and GCN5*

The Notch receptor that plays an important role in cell fate determination is intracellularly cleaved by interaction with the ligand. The cleaved intracellular region (RAMIC) of Notch is translocated into the nucleus and interacts with a DNA-binding protein RBP-J to activate transcription of genes that regulate cell differentiation. Although RAMIC has been shown to facilitate the RBP-J-mediated transactivation by displacing the histone deacetylase corepressor complex from RBP-J, there is no evidence demonstrating the involvement of histone acetyltransferases (HATs) in the transactivation. Here we show that mouse Notch1 RAMIC interacts with two conserved HATs, mouse PCAF and GCN5, and recruits each of the HATs to RBP-J. The ankyrin repeats and the transactivation domain of RAMIC and the N-terminal regions of PCAF and GCN5, respectively, are required for the interaction. We also show that not only mouse Notch1 but alsoDrosophila Notch RAMIC interacts with mouse PCAF and GCN5 in mammalian cells. Furthermore, the RBP-J-mediated transactivation activity of RAMIC is repressed by two HAT inhibitor proteins, E1A and Twist. These results suggest that HATs including PCAF and GCN5 play an important role in the RBP-J-mediated transactivation by RAMIC.
New Vehicle Detection Method with Aspect Ratio Estimation for Hypothesized Windows

All kinds of vehicles have different ratios of width to height, which are called the aspect ratios. Most previous works, however, use a fixed aspect ratio for vehicle detection (VD). The use of a fixed vehicle aspect ratio for VD degrades the performance. Thus, the estimation of a vehicle aspect ratio is an important part of robust VD. Taking this idea into account, a new on-road vehicle detection system is proposed in this paper. The proposed method estimates the aspect ratio of the hypothesized windows to improve the VD performance. Our proposed method uses an Aggregate Channel Feature (ACF) and a support vector machine (SVM) to verify the hypothesized windows with the estimated aspect ratio. The contribution of this paper is threefold. First, the estimation of vehicle aspect ratio is inserted between the HG (hypothesis generation) and the HV (hypothesis verification). Second, a simple HG method named a signed horizontal edge map is proposed to speed up VD. Third, a new measure is proposed to represent the overlapping ratio between the ground truth and the detection results. This new measure is used to show that the proposed method is better than previous works in terms of robust VD. Finally, the Pittsburgh dataset is used to verify the performance of the proposed method.
Environmental Tobacco Smoke in Relation to Bladder Cancer Risk—The Shanghai Bladder Cancer Study

Background: Environmental tobacco smoke (ETS) contains tobacco carcinogens. Hepatic cytochrome P450 (CYP) 1A2 and N-acetyltransferase (NAT2) are important isoenzymes in activation and detoxification, respectively, of tobacco carcinogens. Data on ETS and bladder cancer risk are sparse. Methods: We examined the effects of ETS alone and combined with NAT2/CYP1A2 on bladder cancer risk among lifelong-nonsmokers in a case-control study involving 195 patients and 261 controls in Shanghai, China. A comprehensive history of ETS exposure was determined through in-person interviews while CYP1A2 and NAT2 phenotypes by a caffeine-based urinary assay. Results: ETS exposure was related to an overall statistically nonsignificant 38% increased bladder cancer risk. The risk increased with increasing number of cigarettes smoked by household members or number of hours per day at workplace where coworkers smoked. Compared with no ETS exposure, subjects living with smoking parents during childhood had an OR of 2.43 (95% CI = 0.99–5.96) for bladder cancer. When all ETS sources were combined, the risk increased with increasing total ETS score (Ptrend = 0.03). The OR for high versus nil ETS exposure was 3.00 (95% CI = 1.24–7.26). The increased risk with ETS was mainly seen among individuals possessing a CYP1A2 high efficiency and/or a NAT2 slow acetylation phenotype (Ptrend = 0.04). Conclusions: ETS was associated with an increased bladder cancer risk for lifelong-nonsmokers. The association was stronger for people possessing the at-risk phenotypes of CYP1A2 and/or NAT2. Impact: Reducing exposure to ETS for children and genetically more susceptible individuals could be more effective for bladder cancer prevention. Cancer Epidemiol Biomarkers Prev; 19(12); 3087–95. ©2010 AACR.
t-Darpp overexpression in HER2-positive breast cancer confers a survival advantage in lapatinib

Drug resistance is a major barrier to successful cancer treatment. For patients with HER2-positive breast cancer who initially respond to therapy, the majority develop resistance within one year of treatment. Patient outcomes could improve significantly if we can find and exploit common mechanisms of acquired resistance to different targeted therapies. Overexpression of t-Darpp, a truncated form of the dual kinase/phosphatase inhibitor Darpp-32, has been linked to acquired resistance to trastuzumab, a front-line therapy for HER2-positive breast cancer. Darpp-32 reverses t-Darpp's effect on trastuzumab resistance. In this study, we examined whether t-Darpp could be involved in resistance to lapatinib, another HER2-targeted therapeutic. Lapatinib-resistant SKBR3 cells (SK/LapR) showed a marked change in the Darpp-32:t-Darpp ratio toward a predominance of t-Darpp. Overexpression of t-Darpp alone was not sufficient to confer lapatinib resistance, but cells that overexpress t-Darpp partially mimicked the molecular resistance phenotype observed in SK/LapR cells exposed to lapatinib. SK/LapR cells failed to down-regulate Survivin and failed to induce BIM accumulation in response to lapatinib; cells overexpressing t-Darpp exhibited only the failed BIM accumulation. t-Darpp knock-down reversed this phenotype. Using a fluorescence-based co-culture system, we found that cells overexpressing t-Darpp formed colonies in lapatinib within 3–4 weeks, whereas parental cells in the same co-culture did not. Overall, t-Darpp appears to mediate a survival advantage in lapatinib, possibly linked to failed lapatinib-induced BIM accumulation. t-Darpp might also be relevant to acquired resistance to other cancer drugs that rely on BIM accumulation to induce apoptosis.
The use of cepstral means in conversational speech recognition

Environmental robustness and speaker independence are import issues of current speech recognition research. Channel and speaker adaptation methods do the best job when the adaption is done towards a normalized acoustic model. Normalization meth-ods might make use of the model but primarily in-(cid:13)uence the signal such that important information is kept and unwanted distortions are cancelled out. Most large vocabulary conversationalspeech recognition systems use Cepstral Mean Subtraction (CMS), a channel normalization approach to compensate for the acoustic channel (and also the speaker). In this paper we discuss the basic algorithm and variations of it in the context of conversational speech and report our experience using di(cid:11)erent approacheson two widely used conversational speech recognition tasks.
Hong Kong Preservice Teachers' Achievement Goal Orientations - are they related to their gender and electives?

Survey study by means of a questionnaire on achievement goal orientations was conducted with four hundred and seventy-three pre-service student teachers of the Hong Kong Institute of Education. Two contrasting goals were identified, namely: learning goals and performance goals. Psychometric properties of the questionnaire gave support to its applicability in the local context. Statistical analyses indicated there was no significant difference in achievement goal orientations with courses and electives but sex. Female students were found to be more performance goal oriented than male students. Explanation of the differences in achievement goal orientations within sex group was sought in terms of socio-cultural factors. Implications were drawn for teacher educators to consider in the future planning and development of teacher education programmes.
Exploiting Chip Idleness for Minimizing Garbage Collection—Induced Chip Access Conflict on SSDs

Solid state drives (SSDs) are normally constructed with a number of parallel-accessible flash chips, where host I/O requests are processed in parallel. In addition, there are many internal activities in SSDs, such as garbage collection and wear leveling induced read, write, and erase operations, to solve the issues of inability of in-place updates and limited lifetime. When internal activities are triggered on a chip, the chip will be blocked. Our preliminary studies on several workloads show that when internal activities are frequently triggered, the host I/O performance will be significantly impacted because of the access conflict between them. In this work, in order to improve the access conflict induced performance degradation, a novel access conflict minimization scheme is proposed. The basic idea of the scheme is motivated by an interesting observation in SSDs: several chips are idle when other chips are busy with internal activities and host I/O requests. Based on this observation, we propose to schedule internal activities induced operations for minimized access conflict by exploiting the idleness of the multiple chips of SSDs. This approach is realized by two steps: First, read internal activities accessed data to the controller; second, by exploiting the idle chips during internal activities, write internal activities accessed data back to these idle chips. With this scheme, the internal activities can be processed with minimized access conflict to the host requests. Simulation results show that the proposed approach significantly reduces the access conflict, and in turn leads to a significant performance improvement of SSDs.
Twenty-four-hour urine chemistries and the risk of kidney stones among women and men.

BACKGROUND Results of a 24-hour urine collection are integral to the selection of the most appropriate intervention to prevent kidney stone recurrence. However, the currently accepted definitions of normal urine values are not firmly supported by the literature. In addition, little information is available about the relationship between risk of stone formation and the levels of urinary factors. Unfortunately, the majority of previous studies of 24-hour urine chemistries were limited by the inclusion of recurrent stone formers and poorly defined controls. METHODS We obtained 24-hour urine collections from 807 men and women with a history of kidney stone disease and 239 without a history who were participants in three large ongoing cohort studies: the Nurses' Health Study I (NHS I; mean age of 61 years), the Nurses' Health Study II (NHS II; mean age of 42 years), and the Health Professionals Follow-up Study (HPFS; mean age of 59 years). RESULTS Mean 24-hour urine calcium excretion was higher and urine volume was lower in cases than controls in NHS I (P < or = 0.01), NHS II (P < or = 0.13) and HPFS (P < or = 0.01), but urine oxalate and citrate did not differ. Among women, urine uric acid was similar in cases and controls but was lower in cases in men (P = 0.06). The frequency of hypercalciuria was higher among the cases in NHS I (P = 0.26), NHS II (P = 0.03), and HPFS (P = 0.02), but 27, 17, and 14% of the controls, respectively, also met the definition of hypercalciuria. The frequency of hyperoxaluria did not differ between cases and controls, but was three times more common among men compared with women. After adjusting for the other urinary factors, the relative risk of stone formation increased with increasing urine calcium levels and concentration in all three cohorts but not in a linear fashion. Compared with individuals with a urine calcium concentration of <75 mg/L, the relative risk of stone formation among those with a urine calcium concentration of > or =200 mg/L for NHS I was 4.34 (95% CI, 1.59 to 11.88), for NHS II was 51.09 (4.27 to 611.1), and for HPFS was 4.30 (1.71 to 10.84). There was substantial variation in the relative risks for stone formation for the concentration of other urine factors within the different cohorts. CONCLUSIONS The traditional definitions of normal 24-hour urine values need to be reassessed, as a substantial proportion of controls would be defined as abnormal, and the association with risk of stone formation may be continuous rather than dichotomous. The 24-hour urine chemistries are important for predicting risk of stone formation, but the significance and the magnitudes of the associations appear to differ by age and gender.
Automated Design Space Exploration on System Level for Embedded Systems

The design of embedded systems has to address several interacting design dimensions to implement parallelism, distribution over different locations, hard real-time requirements and design space exploration today. Thus a structured design process has to deal with heterogeneous requirements and restrictions. The integration of dedicated tasks for HW-design and SW-design as well as real-time operating system functionality into the embedded system design flow is the main challenge. On system level, tasks must be mapped to complex functional units, with consideration of communications between the tasks and the costs for the functional units. The structured design process of an embedded system distinguishes among others specification, partitioning, HW-synthesis and SW-synthesis tasks.
Johnny Can't Sing: A Comprehensive Error Model for Sung Music Queries

We propose a model for errors in sung queries, a variant of the Hidden Markov Model (HMM). This is related to the problem of identifying the degree of similarity between a query and a potential target in a database of musical works, in the music retrieval framework. The model comprehensively expresses the types of error or variation between target and query: cumulative and non-cumulative local errors, transposition, tempo and tempo changes, insertions, deletions and modulation. Results of experiments demonstrating the robustness of the model are presented.
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design

In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called fast lookup table estimation (FLUTE). FLUTE is based on a precomputed lookup table to make RSMT construction very fast and very accurate for low-degreeThe degree of a net is the number of pins in the net. nets. For high-degree nets, a net-breaking technique is proposed to reduce the net size until the table can be used. A scheme is also presented to allow users to control the tradeoff between accuracy and runtime. FLUTE is optimal for low-degree nets (up to degree 9 in our current implementation) and is still very accurate for nets up to degree 100. Therefore, it is particularly suitable for very large scale integration applications in which most nets have a degree of 30 or less. We show experimentally that, over 18 industrial circuits in the ISPD98 benchmark suite, FLUTE with default accuracy is more accurate than the Batched 1-Steiner heuristic and is almost as fast as a very efficient implementation of Prim's rectilinear minimum spanning tree algorithm.
Implicitly-threaded parallelism in Manticore

The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-scale scientific computing and tend not to be well-suited to programming the applications one typically finds on a desktop system. Thus we need new parallel-language designs that address a broader spectrum of applications. In this paper, we present Manticore, a language for building parallel applications on commodity multicore hardware including a diverse collection of parallel constructs for different granularities of work. We focus on the implicitly-threaded parallel constructs in our high-level functional language. We concentrate on those elements that distinguish our design from related ones, namely, a novel parallel binding form, a nondeterministic parallel case form, and exceptions in the presence of data parallelism. These features differentiate the present work from related work on functional data parallel language designs, which has focused largely on parallel problems with regular structure and the compiler transformations --- most notably, flattening --- that make such designs feasible. We describe our implementation strategies and present some detailed examples utilizing various mechanisms of our language.
A cheap, portable haptic device for a method to relay 2-D texture-enriched graphical information to individuals who are visually impaired

This paper considers the development of a haptic device needed for a method of relaying 2-D texture enriched graphical information. The focus here is on the conversion of the optical, color-based representation of the formatted diagram, which is efficient for storage and distribution, to its haptic texture enriched form. For this, the device has two main components, an RGB color sensor and piezoelectric actuator, mounted in a casing that is wrapped around the finger. The resulting device has a spatial sensitivity (<2mm) comparable to natural touch (1.0mm), a temporal frequency bandwidth of 1 to 200 Hz, and can be used to output a variety of textures. The point contact device developed can also easily be expanded to the use of multiple devices on multiple fingerpads, while remaining affordable (<100) and portable (<500g).
Handbook of Theory and Research for the Sociology of Education

The first of its kind, this handbook synthesizes major advances in the sociology of education over the past several decades. It incorporates both a systematic review of significant theoretical and empirical work and challenging original contributions by distinguished American, English, and French sociologists. In his introduction, John G. Richardson traces the development of the sociology of education and reviews the important classical European works in which this discipline is grounded. Each chapter, devoted to a major topic in the field, provides both a review of the literature and an exposition of an original thesis. The inclusion of subjects outside traditional sociological concern--such as the historical foundations of education and the sociology of special education--gives an interdisciplinary scope that enhances the volume's usefulness.
A scalable, low cost design-for-test architecture for UltraSPARC/spl trade/ chip multi-processors

An emerging trend in microprocessor architecture for servers is to design chips with multiple processor cores on a chip called chip multi-processors (CMPs). Due to the short design cycle time and large size of these chips, the design-for-testability and testing of such chips is a major challenge. In this paper we describe a hierarchical DFT architecture for UltraSPARC/spl trade/ CMPs that is scalable with number of processor cores and can be implemented in a very short design cycle time. The DFT architecture allows testing of the processor cores individually for diagnosis as well as concurrently to reduce test application time and thus test cost. The DFT architecture can be easily ported across CMPs with different numbers of processor cores as well as to higher order CMPs designed by putting together CMPs.
Searching Semantic Resources for Complex Selectional Restrictions to Support Verb Sense Disambiguation

Abstract : Natural language processing systems are increasingly integrating lexicons with ontologies for word sense disambiguation (WSD). Manually acquiring a lexicon that is integrated with a large ontology and other semantic resources can be difficult and inefficient in part due to the complexity of ontologies and inconsistency of entity extractors supporting WSD applications. A major contributing factor to the difficulty is the creation of selectional restrictions with respect to particular semantic resources. This paper presents a process for acquiring complex expressions for selectional restrictions via search through an ontology.
Scalable Sequential Verification

In general, sequential verification is PSPACE complete, but for application to present-day industrial designs, it needs to be made scalable, which means essentially linear in circuit size. This paper focuses on the problem where the circuit in question has been transformed using a form of scalable sequential synthesis. During this synthesis, a history And-Inverter-Graph (HAIG) is constructed, which efficiently records all logic nodes ever created in the synthesis process. A HAIG can be constructed in a fast, memory efficient, and scalable way. It is an FSM, which contains the initial and final FSMs to be compared as well as many redundant, sequentially equivalent nodes. The sets of equivalent nodes form “bridges” connecting the initial and final machines and can be used to construct an inductive invariant. It is shown that this invariant is sufficient to prove delayed sequential equivalence between the two FSMs. The complexity of validating this is roughly the cost of one combinational SAT call of the size of the two machines; however, the many structural similarities, which are pre-identified in the HAIG structure, make the proof of invariance particularly easy and scalable.
Constant depth circuits, Fourier transform, and learnability

Boolean functions in AC/sup O/ are studied using the harmonic analysis of the cube. The main result is that an AC/sup O/ Boolean function has almost all of its power spectrum on the low-order coefficients. This result implies the following properties of functions in AC/sup O/: functions in AC/sup O/ have low average sensitivity; they can be approximated well be a real polynomial of low degree; they cannot be pseudorandom function generators and their correlation with any polylog-wide independent probability distribution is small. An O(n/sup polylog(/ /sup sup)/ /sup (n)/)-time algorithm for learning functions in AC/sup O/ is obtained. The algorithm observed the behavior of an AC/sup O/ function on O(n/sup polylog/ /sup (n)/) randomly chosen inputs and derives a good approximation for the Fourier transform of the function. This allows it to predict with high probability the value of the function on other randomly chosen inputs. <<ETX>>