Miracle-dz/UniFAR-FTUs huggingface dataset:
Iteration of Target Matrices in Exploratory Factor Analysis

Exploratory factor analysis (EFA) almost always involves two unique steps: 1) initial extraction of m orthogonal, unrotated factors from a covariance matrix, followed by 2) rotation of said factors to an interpretable structure. The present research is focused entirely on the second step, rotation; specifically, a new, semi-analytic rotation algorithm called iterated target rotation (ITR) is developed and tested. The goal of ITR is to improve upon basic target rotation (Hurley & Cattell, 1962) by automatically searching for a viable target matrix. Whereas basic target rotation requires a user to specify a target matrix a priori, ITR uses an iterative search procedure to find a viable (often ideal) target matrix. Using Monte Carlo simulation of raw data (N = 250, 500, and 1000), the performance of ITR was tested in simple, complex, and highly complex population factor structures. Further, two characteristics of the ITR algorithm itself were varied, resulting in the following four simulation condition variables: sample size (three conditions), complexity of population factor structure (four conditions), method for iterating solutions (three conditions), and method for beginning the iterations (seven conditions). Performance was defined as the ability to accurately recover a true factor structure, as measured by the root mean-square error (RMSE) between the ITR solution and the population structure. Results suggest that, with few exceptions, ITR performs well even in highly complex structures. Limitations and future directions are discussed, and one potential improvement on the target-iteration algorithm is tested preliminarily.
A Study on Graph Similarity Search

Graph similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical compounds. The problem is challenging as even testing subgraph containment between two graphs is NP-complete. Hence, existing techniques adopt the filtering-and-verification framework with the focus on developing effective and efficient techniques to remove non-promising graphs. Nevertheless, existing filtering techniques may be still unable to effectively remove many ”low” quality candidates. To resolve this, in this paper we propose a novel indexing technique to index graphs according to their ”distances” to features. We then develop lower and upper bounding techniques that exploit the index to (1) prune non-promising graphs and (2) include graphs whose similarities are guaranteed to exceed the given similarity threshold. Considering that the verification phase is not well studied and plays the dominant role in the whole process, we devise efficient algorithms to verify candidates. A comprehensive experiment using real datasets demonstrates that our proposed methods significantly outperform existing methods.
Cubist(++): a new approach to improving the performance of ad-hoc cube queries

suggestions. Last but not least, I extend my utmost gratitude to my wife Jia Liu, my mother-in-law Sun Xinhua, and my son Andrew Fu for their enduring support. We provide a new approach to speeding up the evaluation of cube queries, an important class of OLAP queries which return aggregated values rather than sets of tuples. Our new algorithm called CubiST (Cubing with Statistics Trees) represents a drastic departure from existing approaches in that it does not use the familiar view lattice approach to compute and materialize new views from existing views. Instead, CubiST computes and stores all possible aggregate views in the leaves of a statistics tree during a one-time scan of the detailed data. To be able to handle queries that involve dimension hierarchies, we have developed an improved version of CubiST called CubiST ++ which uses a family of trees instead of a single statistics tree. CubiST ++ applies a greedy strategy to select a family of candidate trees which represent superviews for the different hierarchy levels of the dimensions. In addition, we have developed an algorithm to compute and materialize the candidate trees that make up the family starting from a single statistics tree (base tree). Given an input query, our new query evaluation x algorithm selects the smallest tree in the family which can answer the query. CubiST ++ significantly reduced I/O time and improved in-memory performance when compared with CubiST. have reduced the 1-dimensional holistic cubing to quantiling and selection problems. To implement holistic operations efficiently, we have developed two new algorithms, namely, deterministic bucketing (DB) and random bucketing (RB). Experimental evaluations of our CubiST ++ prototype implementation have demonstrated its superior run-time performance and scalability when compared to existing OLAP systems. 1 CHAPTER 1 OLAP QUERIES AND DATA CUBES Data warehouses and related on-line analytical processing (OLAP) technologies [1, 2] continue to receive strong interest from the research community as well as from industry. A warehouse contains data from a number of independent sources, integrated and cleansed to support clients who wish to analyze the data for trends and anomalies. The decision support is provided by OLAP tools which present their users with a multi-dimensional perspective of the data in the warehouse and facilitate the writing of reports involving aggregations along the various dimensions of the data set [3]. There are also efforts under way to use the data warehouse and OLAP engines …
Personalized update monitoring toolkit using continual queries: system design and implementation

In rapidly growing open environments such as the Internet, users experience information starvation in the midst of data overload, due to di culties similar to nding a needle in a haystack. Update monitoring is a promising area of research where we bring the right information to the user at the right time, instead of forcing the user through manual browsing or repeated submission of queries. In this thesis, we present the design and implementation of an event-driven update monitoring system using continual queries [25, 27]. A Continual Query (CQ) is a standing query that monitors update of interest and returns result whenever the update reaches speci ed thresholds. Each continual query consists of three components: a query component, a trigger condition, and a stop condition. In contrast to normal queries whose scope are limited to past and present data, the scope of a continual query includes past, present, and future data. The main contributions of this thesis is the design and implementation of the rst prototype of the continual query system, capable of push-enabled data management and event-driven information delivery. The key components of this prototype system are a continual query (CQ) manager, a trigger condition evaluator, and a set of event detectors. The CQ manager is responsible for coordination of tasks and communications between CQ clients and CQ server and between CQ server and CQ wrappers. The condition evaluator and event detectors are responsible for monitoring updates according to speci ed update thresholds of interest and the time constraints. The distinct features of this continual query prototype system include: reusing and extending conventional DBMS components, providing push-enabled services by incorporating distributed event-driven triggers, and combining pull and push services in a uni ed framework. Acknowledgements I would like to express my thanks to Dr. Liu, my supervisor, for her invaluable guidance and assistance. She always kept me focused and motivated during my thesis work. I would also like to thank the members of the examining committee, Randy Goebel and Francis Y. Lau for their insightful comments. I am also grateful for the suggestions and help from teammembers of the CQ/DIOM project and my friends. Special thanks are given to David Buttler, John Biggs, Wei Han and Tong Zhou. Finally I would like to thank my parents for their encouragements that helped me to overcome all the new challenges encountered in my study and in my life. It is my parents who helped me to become strong physically and spiritually.
Detecting user sessions in the tumba! web log

This paper describes an approach to detect distinct user sessions from the logs of a particular search engine. We present our work by describing the proposed algorithm and some interesting usage patterns that were detected. Some pitfalls of our approach are also noted. Finally, we give some insights on how web log mining could be exploited in other areas such as semantic relation extraction or query expansion.
Jaques Bertin’s theory of graphics and its development and influence on multimedia cartography

Today, we can say that the graphic system of visual variables established and developed by Bertin represents an indispensable and universally recognized theory of the cartographic transcription of geographic information. Various cartographers have used and improved on Bertin’s System. In the age of automation, GIS and multimedia,initial results in adapting Bertin’s graphic system to the dynamic and also non-visual representation of information are now available. Today one can say that despite its fundamental character, Bertin’s theory has proven to be very adaptable and open towards innovation.
Optimal interpolation data for image reconstructions

Finding optimal inpainting data is a key problem for image compression with homogeneous diffusion. Not only the location of important pixels but also their values should be optimal to maximise the quality gain. Both tasks are analysed in this work. Two approaches to find optimal data locations are discussed. The first one is based on findings from spline interpolation theory. It is very simple and only applicable in presence of one dimensional, strictly convex and continuously differentiable signals. Nevertheless it offers important insight into the difficulties of the underlying optimisation task. Our second approach is very generic and applicable to arbitrary data signals. It uses a powerful optimal control based model where we augment the partial differential equation used for the inpainting process with a cost functional containing a data similarity as well as a sparsity inducing term. Both frameworks are analysed with respect to their convergence behaviour. We also establish conditions that assert optimality of the obtained solutions. For the latter model we also provide additional results on how to handle the occurring non-convex optimisation problem from a numerical point of view. Two approaches are discussed. Both methods proceed by an iterative linearisation of the constraint equations. The second method considers an additional reformulation in terms of convex duality. Experimental results on grey value as well as colour images confirm our theoretical insights. Besides the results on optimal data positions we discuss the task of finding optimal data values for fixed spatial data locations. Our underlying inpainting scheme allows us to formulate this task as a least squares problem. An important relationship between the optimal data positions and the corresponding values is derived. This finding is a fundamental pillar in the design of an competitive image compression codec. Further, we provide efficient numerical schemes to find the best data values. Two algorithms are discussed. One of them excels for CPU based implementations and is based on a well known solver from the literature. The second method exploits findings from primal dual strategies for convex optimisation problems.
Jamu ramuan tradisional kaya manfaat

Buku Jamu, Ramuan Tradisional Kaya Manfaat memuat konten berupa sejarah jamu dan manfaat jamu untuk kesehatan dan kecantikan. buku ini bertujuan untuk memberikan wawasan kepada anak-anak tentang jamu yang memiliki banyak manfaat, serta untuk melestarikan salah satu kearifan lokal ini.
AN EFFICIENT Hybrid Swarm Intelligence Technique for Solving Integer Programming

In this paper, a hybridization of two different swarm intelligent approaches, stochastic diffusion search, and particle swarm optimization techniques is presented for solving integer programming problems. The hybrid implementation allows us to avoid certain drawbacks and weaknesses of each algorithm, which means that we are able to find an optimal solution in an acceptable computational time. Our hybrid implementation allows the IP algorithm to reach the optimal solution in a considerably shorter time than is needed to solve the model using the entire dataset directly within the model. Our hybrid approach outperforms the results obtained by each technique separately. It is able to find the optimal solution in a shorter time than each technique on its own, and the results are highly competitive with the state-of-the-art in large-scale optimization. Furthermore, according to our results, combining the PSO with SDS approach for solving IP problems appears to be an interesting research area in combinatorial optimization.
Optimization-Based Methods for Road Image Registration

A number of transportation agencies are now relying on direct imaging for monitoring and cataloguing the state of their roadway systems. Images provide objective information to characterize the pavement as well as roadside hardware. The tasks of processing, interpreting, and assessing the condition of the pavement from image data sets poses formidable challenges however. Not only are the data sets extremely large but they are not taken under ideal conditions neither in geometric location and alignment, nor in photometric consistency due to a number of factors including the inaccuracy of dead reckoning as well as the dynamics of the collection vehicles. The resulting images provide, in essence, a set of independent overlapping snapshots of regions of the pavement that must be merged together to produce the continuous mosaic that is needed for automated analysis and interpretation. This requires the registration of these images. Image registration is defined as the problem of aligning features in one image/view to corresponding features in another image/view of the same object. Registration brings independent images into the same reference frame. To be effective, this process must be automated, requiring minimal or no user intervention. In this work, the authors describe a non-parametric optimization procedure that is capable of producing general nonlinear deformations to register multiple images so they can be merged, compared and analyzed.
A Survey on Fuzzy based Image Denoising Methods

: Images are very useful source of information which is often degraded in the presence of noise. Noise present in the image hides the important information. So, to retain the quality of the image we need to remove noise. Noise filtering is one of the important tasks of image processing techniques. Several denoising methods are proposed to improve the quality of image by removing different kinds of noises. Each method has its own applicability, assumptions, advantages and disadvantages. This work comprises study of some traditional filters and fuzzy filters. A comparative study of Image Denoising filters and importance of fuzzy filters has been enlisted.
Linear and nonlinear ICA based on mutual information

In the context of independent components analysis (ICA), the mutual information (MI) of the extracted components is one of the most desirable measures of independence, due to its special properties. This paper presents a method for performing linear and nonlinear ICA based on MI, with few approximations. The use of MI as an objective function for ICA requires the estimation of the statistical distributions of the separated components. In this work, both the extraction of independent components and the estimation of their distributions are performed simultaneously, by a single network with a specialized structure, trained with a single objective function.
Factors Influencing School Counselors' Perceived Effectiveness.

School counselor credentialing requirements have been a continuous topic of discussion for counselor educators and credentialing bodies. Recent discussions include whether or not prior teaching experience is needed to be an effective counselor. The authors surveyed over 300 school counselors from states with varied credentialing standards and asked them to respond to questions regarding perceived counseling effectiveness, collective self-esteem, and previous teaching and school counseling experience. The results indicate the most significant predictors of school counselor perceived effectiveness are their experience in school counseling and their collective self-esteem with the school counseling profession. Implications for school counselor education are discussed.
Knowledge-Based Software Assistant Advanced Development Model (KBSA/ADM).

Abstract : This document constitutes Andersen Consulting's Final Report on the project, the Knowledge Based Software Assistant/Advanced Development Model (KBSA/ADM). The KBSA/ADM project significantly explored tools and techniques for solving the software development crisis, improving the productivity, quality, and reliability of software development activities. In particular, the KBSA/ADM explored solutions to these quality of service properties by examining them in the context of: managing the complexity inherent in software development activities; enhancing coordination especially among large development teams composed from different skills sets, stakeholders, experience levels etc., and automating what is understood about the software development process in order to enhance human performance. The KBSA/ADM project conducted by Andersen Consulting has been insightful and fruitful. The results of the project team's efforts begin to implement and describe how KBSA/ADM technologies begin to address the software development problems associated with complexity, automation, and coordination. The most innovative aspects of this work have been in the areas of contextual knowledge (i.e., discussion databases and object linking), process support (i.e., personalized agendas and process enactment), evolution transformations (i.e., transformations which automate stereotypical changes to a model), and critics (i.e., integrating intelligent analysis with process enactment). While significant progress has been made, there are many areas for additional research and expansion on the work presented here.
Unified Modeling Language User Guide, The (2nd Edition) (Addison-Wesley Object Technology Series)

For nearly ten years, the Unified Modeling Language (UML) has been the industry standard for visualizing, specifying, constructing, and documenting the artifacts of a software-intensive system. As the de facto standard modeling language, the UML facilitates communication and reduces confusion among project stakeholders. The recent standardization of UML 2.0 has further extended the language's scope and viability. Its inherent expressiveness allows users to model everything from enterprise information systems and distributed Web-based applications to real-time embedded systems.In this eagerly anticipated revision of the best-selling and definitive guide to the use of the UML, the creators of the language provide a tutorial to its core aspects in a two-color format designed to facilitate learning. Starting with an overview of the UML, the book explains the language gradually by introducing a few concepts and notations in each chapter. It also illustrates the application of the UML to complex modeling problems across a variety of application domains. The in-depth coverage and example-driven approach that made the first edition of The Unified Modeling Language User Guide an indispensable resource remain unchanged. However, content has been thoroughly updated to reflect changes to notation and usage required by UML 2.0. Highlights include: A new chapter on components and internal structure, including significant new capabilities for building encapsulated designs New details and updated coverage of provided and required interfaces, collaborations, and UML profiles Additions and changes to discussions of sequence diagrams, activity diagrams, and more Coverage of many other changes introduced by the UML 2.0 specificationWith this essential guide, you will quickly get up to speed on the latest features of the industry standard modeling language and be able to apply them to your next software project.
Analyzing Mass Media through Video Art Education: Popular Pedagogy and Social Critique in the Work of Candice Breitz

This article begins with the premise that art education should engage with forms of popular visual culture in the art classroom so that students can better understand, evaluate, and critique the world around them. The researcher argues that studying video art with students offers a valuable approach to critiquing film and television, among other mass media, because of shared methods of production and persuasion involving sound, language, movement, and time, in addition to visual imagery. Taking the work of South African artist, Candice Breitz, as a case study, this article investigates how video art that re-appropriates multi-sensory popular culture as a form of social critique can provide a model for critical, interdisciplinary conversations in art education. By engaging with Breitz’s videos, which utilize largely “found footage” in their production, art educators can enable students to better analyze the forms and effects of entertainment media and help them “find” their own footage for critical artmaking. This article situates this approach within recent conceptual and contextual literature about visual culture art education, re-appropriation in art and video art, and other topics.
Implementation of the performance evaluation system for the NTP server

Most routers working in the Internet support NTP and register the current accurate time on the NTP control message. But how precisely the time is maintained depends on the topology and/or load of mutual references of NTP. We implemented the application to send continuously NTP control messages with variable time intervals. We experimented to watch the behavior of the NTP daemon and then we can get the following results of the clock offset. First, we extracted effects of the dock offset maintained by different types of stratum servers. We have 0.133 msec/sec drift on the host with no support of NTP. Second, we extracted two cyclic jitters of clock offset on the stratum 1 server. One long cyclic interval is 50 second and the other is 2 second. Finally, we compared between the clock offset on the local stratum 2 server and the remote(long network distance) stratum 2 server and extracted the element of precision of the clock offset.