Miracle-dz/UniFAR-FTUs huggingface dataset:
Notice of Violation of IEEE Publication PrinciplesArchitecture and Implementation of Object-Level Vertical Search

Current mobile web search engines essentially conduct document-level ranking and retrieval. However, structured information about real-world objects embedded in static WebPages and online databases exists in huge amounts. We explore a new paradigm to enable web search at the object level in this paper, extracting and integrating web information for objects relevant to a specific application domain. We then rank these objects in terms of their relevance and popularity in answering user queries. We introduce the overview and core technologies of object-level vertical search engines that have been implemented in one working systems: Windows Live Product Search on mobile (http://m.live.com).
Clique-width minimization is NP-hard

Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in Monadic Second Order Logic with second-order quantification on vertex sets, that includes NP-hard problems) can be solved efficiently for graphs of small clique-width. It is widely believed that determining the clique-width of a graph is NP-hard; in spite of considerable efforts, no NP-hardness proof has been found so far. We give the first hardness proof. We show that the clique-width of a given graph cannot be absolutely approximated in polynomial time unless P=NP. We also show that, given a graph G and an integer k, deciding whether the clique-width of G is at most k is NPhy complete. This solves a problem that has been open since the introduction of clique-width in the early 1990s.
ScholarWorks @ UTRGV ScholarWorks @ UTRGV

A large number of EBV immortalized LCLs have been generated and maintained in genetic/epidemiological studies as a perpetual source of DNA and as a surrogate in vitro cell model. Recent successes in reprograming LCLs into iPSCs have paved the way for generating more relevant in vitro disease models using this existing bioresource. However, the overall reprogramming efficiency and success rate remain poor and very little is known about the mechanistic changes that take place at the transcriptome and cellular functional level during LCL-to-iPSC reprogramming. Here, we report a new optimized LCL-to-iPSC reprogramming protocolusingepisomalplasmidsencodingpluripotencytranscriptionfactorsandmousep53DD(p53carboxy-terminaldominant-negativefragment)andcommerciallyavailablereprogrammingmedia.Weachievedaconsistentlyhighreprogrammingefficiency and100%successrateusingthisoptimizedprotocol.Further,weinvestigatedthetranscriptionalchangesinmRNAandmiRNA levels,usingFC-abs ≥ 2.0 and FDR ≤ 0.05 cutoffs; 5,228 mRNAs and 77 miRNAs were differentially expressed during LCL-to-iPSC reprogramming. The functional enrichment analysis of the upregulated genes and activation of human pluripotency pathways in the reprogrammed iPSCs showed that the generated iPSCs possess transcriptional and functional profiles very similar to those of human ESCs.
Understanding performance-resource dependency by thread slicing and curve fitting

Various programs or threads, even diverse segments within one thread, differ greatly in their intrinsic performance and resource requirement. Pursuing for the highest performance potential usually leads to over-design and over-supply in most circumstances, consuming more chip size and power. This problem is exacerbated in chip multithreading architectures, where several threads execute on-chip simultaneously, by the fact that inappropriate inter-thread resource competing and sharing probably result in resource misuse. The ultimate reason for the issue lies in the absence of mathematical approach to represent the performance-resource dependency quantitatively. In this paper, we take the rename-register-file, a representative storage resource, for instance to study the performance-resource dependency features and create a straightforward, accurate, and applicable model by thread slicing and curve fitting. The model contains just four parameters but perfectly matches the benchmarks of the SPEC CPU2000 suite. We conclude with a prospective on its application in explicit, on-demand resource allocation and precise performance control.
A Common Law for the Age of Statutes

Guido Calabresi is a distinguished professor of law at the Yale Law School who has previously written critically acclaimed books and articles about tort law, with particular focus on the economics of loss spreading.1 The style of his new book, A Common Law for the Age of Statutes, is not calculated to make it must reading in airport waiting rooms, but the book is well written with the treasure trove of citations that we would expect from a former Yale Law Journal editor and law clerk to Mr. Justice Black. As I read A Common Law for the Age of Statutes I was reminded of Merlin's book of magic in Tennyson's Idylls of the King. No one, not even Merlin, could read the text; Merlin, however, could read the commentary and that is what gave Merlin his power. It was from this arcane and incomprehensible scribbling of commentary that Merlin built Arthur's Camelot. Merlin's book built an empire although only one person had read it. '
Orientation Sensing for Helicopter UAVs under Strict Resource Constraints

For flight control of helicopter UAVs, it is essential to have high-quality 6-DOF attitude measurements. In the course of the miniaturization, the need for reliable orientation sensors conflicts with strict resource constraints. This paper presents the algorithms for orientation calculation used on-board TU Berlin’s helicopter UAV MARVIN as an example of “low-resource” orientation measurement. While rotation rate sensors provide short-term data, acceleration and magnetic field sensors are fused for delayed on-line calibration, using GPS to eliminate kinematic acceleration effects. All maths are performed using 32 bit fixed point arithmetics, involving certain “crude” simplifications. The algorithm’s performance and computational complexity are compared to a full Kalman Filter fusion of the sensors, justifying the use of the specialized and simplified approach.
ROBUST BOUNDARY LEARNING FOR MULTI-CLASS CLASSIFICATION PROBLEMS

The objective of pattern classification is minimizing generalization errors for innumerable unknown samples. In the structural risk minimization (SRM) principle, both empirical errors and complexities of classifiers are minimized instead of minimizing generalization errors. We define a criterion about both of empirical errors and complexities for multiclass classifiers directly, and propose a perceptron-based linear classifier obtained as the minimum solution of the criterion. Due to this direct measurement, our classifier is robust against outliers and mislabeled training samples. We discuss the advantages of our classifier by comparing with conventional classifiers such as support vector machines and neural networks. We verify classification ability of our classifier by experiments on benchmark datasets.
Tensile Strengths of Concrete Containing Sawdust Ash from Different Calcination Methods

This work investigated the tensile strengths of concrete containing sawdust ash from different calcination methods. SawDust Ash (SDA) was produced using three different calcination methods namely: Open Air Calcination (OAC), Stove Calcination (SC), and Furnace Calcination (FC). OPC was partially replaced with SDA from each of the three calcination methods at 5%, 10%, and 15%. Nine concrete cylinders of 150mm x 300mm were produced for each of the three percentage replacement levels of OPC with SDA and for each of the three calcination methods, making a total of eighty one concrete cylinders with OPC-SDA binary blended cement for the three different calcination methods. Nine control concrete cylinders, with same dimensions of 150mm x 300mm, were also produced using 100% OPC. This gives a grand total of 90 concrete cylinders. A mix ratio of 1: 2: 3.5 (blended cement: sand: local stone) was used for the concrete. Batching was by weight and a constant water/cement ratio of 0.6 was used. All the concrete cylinders were cured in water by immersion. Three concrete cylinders from each of the three SDA calcination methods and for each of the three percentage replacement levels of OPC with pozzolan, as well as three control concrete cylinders were tested for saturated surface dry bulk density and crushed to obtain their split tensile strengths at 28, 90, and 150 days of curing. Excel Spreadsheet Regression Analysis was used to develop empirical models for predicting the split tensile strengths of OPC-SDA concrete for each of the three calcination methods. It was found that Split tensile strength values for FC were much greater than those for OAC and SC for all the days of curing and all percentages of replacement of OPC with SDA. The control split tensile strength value rose to 1.34N/mm2 at 90 days and 1.61N/mm2 at 150 days whereas the greatest 90 and 150-day values were 1.10N/mm2 and 1.51N/mm2 respectively for OAC and 1.29N/mm2 and 1.70N/mm2 respectively for SC. The 28-day values for FC were comparable to the control values for 5% and 10% replacement and increased rapidly to exceed the control values at 90 and 150 days. Therefore, OPC-SDA blended cement concrete with SDA obtained from FC could be used for all civil engineering works at 5-10% OPC replacement while OPC-SDA blended cement concrete with SDA obtained from FC at 15% OPC replacement and with SDA obtained from OAC and SC at 5-10% OPC replacement could be used for low strength civil engineering works where early loading of the structural members are not required. The models developed for FC, OAC, and SC methods were tested using t-test analysis and found to be adequate for predicting the split tensile strength values of OPCSDA binary blended cement concrete at 28-150 days of curing and for 5-15% replacement of OPC with SDA, using SDA obtained from any of the three calcination methods.
ILP and Iterative LP Solutions for Peak and Average Power Optimization in HLS

In this paper, we tackle the problem of peak and average power optimization in high-level synthesis. Because of the quadratic relationship of supply-voltage to the dynamic power consumption, voltage scaling is considered as the most efficient technique for reducing power consumptions in CMOS circuits. We present an MILP formulation for the scheduling problem using multiple supply-voltages in order to optimize peak power as well as average power and energy consumptions. As the design problem becomes large, exact solution takes a tremendous amount of run-time; and to explore the design space in a reasonable amount of time, a high quality heuristic is needed. Thus, we devise a two-phase heuristic to solve the multiple supply-voltages scheduling for peak and average power minimization. In the first phase, a guided LP relaxation is developed. Following the relaxed LP schedule, a power-area-saving procedure is developed. Results for peak and average power of our two-phase heuristic well match those obtained by the optimal solution as has been validated through extensive experiments on several benchmarks.
Cross-lingual Twitter Polarity Detection via Projection across Word-Aligned Corpora

In this paper, we propose an unsupervised framework that leverages the sentiment resources and tools available in English language to automatically generate stand-alone polarity lexicons and classifiers for languages with scarce subjectivity resources and thus avoids the need for labor intensive manual annotation. Starting with a list of English sentiment-bearing words, we expand this lexicon using WordNet synsets. For each sentence pair in a given bilingual parallel corpus, the highprecision English polarity lexicon is applied to the English side then the output sentiment label is projected onto the target language side via statistically derived word alignments. The resulting lexicon is applied to a large pool of unlabeled tweets in the target language, in order to automatically label tweets as training data to train polarity classifier. Our experiments using Spanish and Portuguese as target ones have shown that the resulting classifiers help to improve polarity classification performance compared to lexicon-based classification for under-resourced languages in social media.
A definition for information system survivability

Society has become dependent on information systems. As networks develop into large-scale systems, often critical to personal and business operations, survivability of these systems is imperative. While these systems continue to emerge and grow, answers to questions like: "What does survivability mean? ", "How is survivability being measured? ", and "How is survivability computed? " become very important. This paper summarizes the standard or lack of standard methods for defining and computing survivability while providing an easy to reference baseline of the current state. It also provides a template for defining survivability to facilitate subsequent research into computational quality attributes by using standard definitions. Where there are gaps or inconsistencies in current research and practice, assessments can be made to continue research and development in the areas most needed to develop taxonomy of survivability.
Two tapes are better than one for nondeterministic machines

It is known that k tapes are no better than two tapes for nondeterministic machines. We show here that two tapes are better than one. In fact, we show that two pushdown stores are better than one tape. Also, k tapes are no better than two for nondeterministic reversal-bounded machines. We show here that two tapes are better than one for such machines. In fact, we show that two reversal-bounded pushdown stores are better than one reversal-bounded tape. We also show that for one-tape nondeterministic machines, unrestricted machines are better than reversal-bounded machines.
A modest proposal for MFG with density constraints

We consider a typical problem in Mean Field Games: the congestion case, where in the cost that agents optimize there is a penalization for passing through zones with high density of agents, in a deterministic framework. This equilibrium problem is known to be equivalent to the optimization of a global functional including an $L^p$ norm of the density. The question arises as to produce a similar model replacing the $L^p$ penalization with an $L^\infty$ constraint, but the simplest approaches do not give meaningful definitions. Taking into account recent works about crowd motion, where the density constraint $\rho\leq 1$ was treated in terms of projections of the velocity field onto the set of admissible velocity (with a constraint on the divergence) and a pressure field was introduced, we propose a definition and write a system of PDEs including the usual Hamilton-Jacobi equation coupled with the continuity equation. For this system, we analyze an example and propose some open problems.
Joint pricing and inventory management under servitisation

Abstract We analyse a problem involving the joint pricing of a product and associated service, together with the management of inventory under servitisation. For a finite planning horizon, the firm sells both a product and a product-centric service whose market size depends on the past sales of the product. At the beginning of each period, the firm simultaneously decides the price of the product, the price of the service, and the replenishment quantity. We prove that a modified base-stock list-price policy is optimal to this problem. In addition, we find that there is a trade-off between realising current profit from the product and stimulating demand to increase future profit, and that overlooking this trade-off results in overall loss of profit for the firm. Moreover, the optimal policy that takes the trade-off into account leads to a lower optimal product price compared with a myopic policy, and the optimal price increases as a function of the past sales of the product.
COPY-MOVE DETECTION ALGORITHM BASED ON LOCAL DERIVATIVE PATTERNS

Copy-move forgery is one of most frequently used types of image forgery. During copy-move process a fragment of the image is copied and past- ed to another location of the same image to hide some important area of the im- age. The purpose of copy-move forgery detection algorithm is to identify dupli- cated areas in the image. This method is based on the calculating features in a sliding or an overlapping window. In this paper, the copy-move detection algo- rithm using local derivative pattern is proposed. Experimental results show high detection accuracy when the proposed solution is used. Distinctive characteris- tics of the local derivative pattern based features are robustness to distortions of the duplicated area and low computational complexity.
Who Needs Special Education Professional Development?

Although access to formal education has improved internationally for children with disabilities, concerns remain about education quality for this student population. Using data on 121 173 teachers from 38 countries in the 2013 Teaching and Learning International Survey (TALIS), this study examined the qualifications and professional development (PD) needs of teachers who work with children with special needs. The results indicate that teachers responsible for students with special needs had, on average, lower qualifications, worked in itinerant positions more frequently and expressed greater professional development need than colleagues who did not teach students with special needs. The need for professional development among teachers who taught special needs students was lowest in schools with greater instructional leadership. Additionally, only a small percentage of teachers reported that their professional development had a positive impact on their instruction. The paper discusses policy implications for teacher recruitment and designing professional development.
A joint illumination and sparse representation for visual tracking

Tracking object under illumination conditions is an important task in computer vision. A large number of methods for tracking object are described in the literature. Unfortunately, there is not enough robust methods that work for all applications. We have therefore proposed a tracker for the changing lights conditions with a model of the combination of sparse representation and intensity feature of the video sequence. In addition, the model is an object instanced model and depends on the illumination of the surroundings, and thus is effective in tracking object in illumination conditions. Experimental results show that the proposed tracker works well under significant illumination changes and outperforms many state-of-the-art tracking algorithms.
Comparative growth analysis of capsulated (Vi+) and acapsulated (Vi-) Salmonella typhi isolates in human blood

Salmonella enterica serovar Typhi (S. Typhi) is a human restricted pathogen. It biosynthesizes a virulence capsular polysaccharide named as Vi antigen. S. Typhi regulates expression of genes involved in the biosynthesis of Vi antigen in response to osmolarity. Beside Vi-positive isolates, Vi-negative (acapsulated) isolates are also pathogenic. However, Vi-positive isolates are more prevalent. The present study was planned to investigate comparative growth of Vi-positive and Vi-negative S. Typhi isolates in an ex vivo human whole blood model. Four isolates of each type were tested for growth in human whole blood and in an enrichment medium (Tryptic soy broth-TSB) as a control. It was found that capsulated (Vi-positive) strains formed smooth circular colonies and grew with shorter lag and generation time than Vi-negative isolates. Overall growth pattern of S. Typhi isolates both in vitro and ex vivo conditions showed that Vi-positive isolates grew at a faster rate. Especially in human blood, the lag time of acapsulated isolates was almost doubled as compared to capsulated S. Typhi isolates. It was also observed that Vi-negative isolates reduced in number up to 81 % during the first 12 hours of incubation in human whole blood. Interestingly, both types of isolates had similar growth curve in TSB indicating that Vi capsule is dispensable for bacterial growth in vitro. This study shows for the first time that absence of capsular antigen retards the growth of Vi-negative isolates on initial contact with human blood, but with passage of time they adjust themselves according to the new environment.
A Novel Session Based Dual Image Encoding and Hiding Technique Using DWT and Spread Spectrum

This work proposes a DWT based Steganographic technique. Cover image is decomposed into four sub bands using DWT. Two Encoded secret images are embedded within the HL and HH sub bands respectively. During embedding secret images are dispersed within each band using a pseudo random sequence and a Session key. Encoded Secret images are extracted using the session key and the size of the images . Decode to recover the secrete images. In this approach the stego image generated is of acceptable level of imperceptibility and distortion compared to the cover image and the overall security is high.
Linear Algebra and Sets Theory (LAST)-based Formal Modeling for IS Client-Specification

It seems clear that there is plenty of room for improvement in the area of IS client-developer working relationship. On the client side, it is general to find professionals with a background in the fields of Management and Accounting (M&A). Two disciplines involving the development of rich and precise abstract models of their domain of interest. Consequently, this paper assumes that it is desirable to establish a (suitable) common language for communication between the M&A and IS communities. To that end, this paper describes a LAST-based formal method for IS client-specification. The use of standard mathematical language guarantees precision, accessibility, and comprehensibility by both IS and Management specialists. The resulting clientspecification may be translated by the IS designer into a system-specification proper (that can be verified and implemented). Another possible use of LAST-based modeling, consistent with the stated objective and tested by the authors over the course of several years, is as an educational tool. For illustration purposes, a Financial Accounting Information Subsystem is chosen because it is highly standardized and of widespread use.
Second International Workshop on Operating Systems, Programming Environments and Management Tools for High-Performance Computing on Clusters (COSET-2)

Modern single and multi-processor computer systems incorporate, either directly or through a LAN, a number of storage devices with diverse performance characteristics. These storage devices have to deal with workloads with unpredictable burstiness. Storage aware caching scheme—that partitions the cache and maintains one partition per disk— is necessary in this environment. Moreover, maintaining proper size for these partitions is crucial. Adjusting the partition size after each epoch ( a certain time interval) assumes that the workload in the subsequent epoch will show similar characteristics as observed in the current epoch. However, in an environment with highly bursty and time varying workload such an approach seems to be optimistic. In this paper, we present a caching scheme that continuously adjusts the partition size forgoing any periodic activity. Experimental results shows the effectiveness of our approach. We show that our scheme achieves better performance while compared with an existing storage-aware caching scheme.