Search

This document provides the data collection instruments for the full report, "Lessons from the First Statewide Family Engagement Centers: Alignment with Federal Priorities and Factors Influencing Implementation." The report describes the implementation efforts of the first grantees under the Statewide Family Engagement Centers (SFEC) and how they aligned with program priorities. The instruments were used in understanding how the SFECs have developed partnerships with state education agencies (SEAs), built capacity statewide, provided technical assistance and direct services, and what barriers remain. The instruments include: (1) Director Survey; (2) SFEC Director Interview Protocol; (3) State Education Agency Survey; and (4) State Education Agency Interview Protocol.

Electric power transfer maneuvers carried out in the streets of Mexico through medium voltage distribution circuits necessarily imply the interruption of service to users, even though the supplier has several operating procedures to maintain continuity of service.

This article shows the analysis for load transfer without interruption between two 23 kV distribution feeders. This procedure is not common in this type of system and requires paying primary attention to the characteristics of the electrical network for its application. The distribution circuits discussed here have their own power substation with different voltage levels. The information obtained from a state estimator, the contingency conditions, the electrical parameters of impedances and network configuration allow to carry out the simulation of the load transfer with the Alternative Transients Program software. From the simulation it is shown that load transfer without interruption is possible as long as certain operating conditions are met in the power and distribution networks. The dependence of the transfer on the voltage levels, angular phase shift of voltages and strength of the electrical network is shown, represented by its thevenin impedance at the interconnection point. The results found from the simulation indicate that the success of the interconnection is mainly a function of the electrical strength of the power substations and the phase sequence of the power transformer at the load transfer point. Certain percentages of variation of voltage and currents of the feeders are defined that must not be exceeded. The operational aspects proposed here serve as a basis to have a general interconnection procedure between distribution feeders where special attention is required in the continuity of the service due to the high expectation in the satisfaction of the user of the electrical network. Keywords: feeder, state estimator, medium voltage, power system, load transferring.

Background/Context Educational and societal phenomena can converge to draw attention to a new focus, such as English Learners (ELs) and science, technology, engineering and mathematics (STEM), and then trigger new research interests. A funding program can play a critical role in shaping these new research interests by prioritizing specific research topics and designs or by requiring particular specializations of researchers. Purpose of the Study The study examined whether funding provided through the National Science Foundation's (NSF) Discovery Research K-12 (DR K-12) program has made a unique contribution to the research in the fields of science and mathematics education for ELs. Research Design This study compared the portfolio of DR K–12 projects focusing on EL science and mathematics education to the literature of non DR K-12 projects in terms of research topics, design, methods, scale, samples, and outcomes. The study also examined the disciplinary expertise of the DR K-12 investigators. Data Collection and Analysis The primary method used in this study was content analyses of the portfolio of DR K-12 projects and the literature of non DR K-12 projects in the fields of EL science and mathematics education. To develop comprehensive lists of the literature in these fields, two separate literature searches were conducted. Finally, content analyses of the curricula vitae of the DR K–12 projects’ PIs and co-PIs were undertaken. Results The DR K–12 EL projects in both science and mathematics education have made contributions to their respective fields in three areas in particular: (1) their use of mixed methods and experimental designs; (2) their emphasis on instruction and teacher preparation; and (3) their focus on middle school students. In addition, DR K-12 investigators are making connections across the mathematics/science content and EL/English Language Arts (ELA) areas and are incorporating expertise from both areas, often through the addition of advisory group members. Conclusions The results from this comparative study suggest that funding programs can shape research agendas by providing deliberate and targeted funding for priority areas. Federal government agencies should continue providing this funding to support much-needed research that is a necessary step to improving the quality of science and mathematics education for ELs.

This article draws upon the experiences of four recent efforts to synthesize the findings of quantitative studies in science education research. After establishing the need for research syntheses in advancing generalizable knowledge and causal effects research in our field, we identify a set themes that emerged in the process of conducting these syntheses. These themes include that many impact study designs were not conducive to quantitative synthesis, reporting practices of studies were often insufficient for inclusion in research synthesis, and very few replications were performed. These findings have the potential to limit the advancement of knowledge and discovery in science education research. We recommend that the science education research community pay closer attention to existing reporting standards and guidance, as well as consider the merits of a stronger commitment to study registration, replication, and data sharing. © 2016 Wiley Periodicals, Inc. J Res Sci Teach

Encouraging student interest in science, technology, engineering, and math (STEM) is an urgent priority in the USA and abroad. How most effectively to generate and sustain student interest in and preparation for STEM education and careers remains a vexing question, as the content areas, target ages, instructional approaches, and specific purposes of STEM education—and career preparation—are so diverse. Political interest in uncovering means to prepare and engage both larger numbers and more diverse students in STEM fields has extended to the practice of engaging STEM professionals in educational activities with students. What is the empirical evidence about which approaches that rely upon STEM experts to engage students work, and for whom? This paper summarizes research about the effects of such programmes on student outcomes, and offers recommendations for strengthening the research basis about using STEM professionals in the future.

In this article, we propose the use of a new simple Bayesian classifier (SBND) that quickly learns a Markov boundary of the class variable and a network structure relating class variables and the said boundary. This model is compared with other Bayesian classifiers, then experimental tests are carried out for which 31 well-known ICU databases and two bases of artificial variables have been used. With these databases we compare the results obtained by such algorithms studied in the state of the art such as Naive Bayes, TAN, BAN, RPDag, CRPDag, SBND and combinations with different metrics such as K2, BIC, Akaike, BDEu. The experimental work was done in Elvira software.

A stochastic algorithm for obtaining feasible initial populations to the Vehicle Routing Problem with Time Windows is presented. The theoretical formulation for the Vehicle Routing Problem with Time Windows is explained. The proposed method is primarily divided into a clustering algorithm and a two-phase algorithm. The first step is the application of a modifiedk-means clustering algorithm which is proposed in this paper. The two-phase algorithm evaluates a partial solution to transform it into a feasible individual. The two-phase algorithm consists of a hybridization of four kinds of insertions which interact randomly to obtain feasible individuals. It has been proven that different kinds of insertions impact the diversity among individuals in initial populations, which is crucial for population-based algorithm behavior. A modification to the Hamming distance method is applied to the populations generated for the Vehicle Routing Problem with Time Windows to evaluate their diversity. Experimental tests were performed based on the Solomon benchmarking. Experimental results show that the proposed method facilitates generation of highly diverse populations, which vary according to the type and distribution of the instances.

This paper shows the implementation of the direct method, also called unsatisfied basic need index, indirect or poverty line method, Gini coefficient and Lorenz curve in Manga del Cura non delimited zone in Ecuador. The data used are the result of the processing of questionnaires applied to the people living in the zone. Simple probabilistic randomized sampling was applied for data processing (136 questionnaires). Housing and minimum equipment for home were analyzed, together with infrastructure, access to education and home subsistence ability. Results show that residents have more than one unsatisfied basic need, among them overcrowding, in an infrastructure that does not guarantee the minimum sanitary standards needed. These people live under the line of poverty because their average earnings correspond to 271, 37 USD, not enough to cover the cost of a basic food basket and Ecuadorian vital food basket. Engel and Gini coefficients demonstrate that there is equity in income distribution, what does not necessarily constitutes an indicator of good economic conditions, on the contrary, in this particular case, they indicate that this population group has similar, under 300.00 USD, monthly incomes.

This article describes findings from an evaluation of the National Science Foundation’s (NSF) International Research Fellowship Program (IRFP), which supports postdoctoral research fellowships of 9–24 months in locations outside the USA. The evaluation assessed the role of IRFP in seeding productive international research collaborations for researchers early in their careers. Data used in the evaluation included the NSF program data and survey data from 1,039 scholars who applied to IRFP from 1992 to 2009. The evaluation employed a quasi-experimental design to compare the outcomes of IRFP-funded postdoctoral fellows (awardees) to unfunded applicants (non-awardees), using pre-award characteristics of applicants to mitigate the potential threat of selection bias; the study incorporated propensity score methodology to construct groups of awardees and non-awardees that were statistically similar across a number of preexisting characteristics. By constructing a comparison group from among applicants to the program, the treatment and comparison groups represented individuals who were similarly motivated to engage in international collaboration, and by using propensity scores to match based on characteristics at the time of application, comparisons were made among similarly qualified groups. The study found that IRFP awardees were more likely to have productive research collaborations with foreign researchers, their time abroad did not come at the expense of overall research productivity or career advancement, and the fellowships seeded collaborative relationships that extended beyond the fellowship period.

Male and female focus groups at a Hispanic Serving Institution (HSI) discussed mentoring of Hispanic graduate students. Using Thematic Analysis, investigators identified three main themes: Relationship Initiation and Development, Valued Relationship Qualities, and Context and Barriers. Relationship themes included mentor openness, trust, commitment, availability and grant assistance. Barrier themes subsumed gender roles, financial insecurity, social inequality, and language differences. Females noted one unique theme, and males emphasized work obligations’ negative impact on mentoring.

This paper proposes a real mathematical constraint satisfaction model which defines the timetabling problem in the Faculty of Chemical Sciences and Engineering (FCSE) at the Autonomous University of Morelos State, Mexico. A Constructive Approach Algorithm (CAA) is used to obtain solutions in the proposed model. A comparison is made between the CAA’s results and the schedule generated by the FCSE administration. Using the constraint satisfaction model, it is possible to improve the allocation of class hours in the FCSE so that classroom use is more efficient.

A comparative analysis of several neighborhood structures is presented, including a variable neighborhood structure, which corresponds to a combination of the neighborhood structures evaluated in this paper. The performance of each neighborhood structure was tested using large random instances generated in this research and well-known benchmarks such as the Classical Symmetric Traveling Salesman Problem and the Unrelated Parallel Machines Problem. Experimental results show differences in the performance of the variable neighborhood search when it is applied to problems with differing complexity. Contrary to reports in literature about variable neighborhood searches, its performance varies according to the complexity of the problem.

Wavelet transforms have proved to be very powerful tools for image compression. Previous studies have verified that there is a strong correlation between the sign of a wavelet coefficient and the signs of their neighbors. This correlation opens the possibility of using a sign predictor in order to improve the image compression process. In this paper a new sign coding approximation method for the wavelet coefficients in a 2D image codec based on an iterated local search algorithm (ILS) is presented. The efficiency of the proposed algorithm versus simulated annealing algorithm (SA) and genetic algorithm (GA) using standard images and benchmarks of Kodak is compared. The proposed sign prediction algorithm is as efficient as other methods and it provides a significant reduction of wavelet coefficients sign information in the final bit-stream.

In this paper an unsupervised clustering method for the Capacited Vehicle Routing Problem is proposed. Advantages and disadvantages of the proposed algorithm are weighed, and comparisons are made to some clustering algorithms commonly used in the literature to tackle routing problems. Experimental tests were performed using Solomon and Hering/Homberger benchmarks applied to different distributions. The proposed algorithm is demonstrated as effective for the attempted problem, with the ability to improve upon weaknesses in some of the clustering algorithms in the literature.

In this paper a new sign coding approximation method for the wavelet coefficients in a 2D image codec based on a simulated annealing metaheuristic is presented. The efficiency of the proposed algorithm versus a genetic algorithm using benchmarks of Kodak is compared and showing that the proposed sign prediction algorithm is efficient and provides a significant reduction of wavelet coefficients sign information in the final bit-stream. The results show that, by including sign coding capabilities to a nonembedded encoder, the sign compression gain is up to 17.35%, being the rate-distortion (R/D) performance improvement up to 0.25 dB.

Around the world there have recently been new and more powerful computing platforms created that can be used to work with computer science problems. Some of these problems that are dealt with are real problems of the industry; most are classified by complexity theory as hard problems. One such problem is the vehicle routing problem with time windows (VRPTW). The computational Grid is a platform which has recently ventured into the treatment of hard problems to find the best solution for these. This chapter presents a genetic algorithm for the vehicle routing problem with time windows. The algorithm iteratively applies a mutation operator, first of the intelligent type and second of the restricting type. The algorithm takes advantage of Grid computing to increase the exploration and exploitation of the solution space of the problem. The Grid performance is analyzed for a genetic algorithm and a measurement of the latencies that affect the algorithm is studied. The convenience of applying this new computing platform to the execution of algorithms specially designed for Grid computing is presented.

In this paper a comparative analysis of a neighborhood structures group are presented, including a hybrid structure, which arises of a combination of this set of structures. The efficiency and effectiveness of each structure was tested using the Classical Symmetric Travelling Salesman Problem. This study identifies the neighborhood structure that allows performing a better exploration and exploitation of the space solutions to discrete optimization problems. A neighborhood hybrid structure proposed has better performance comparing with other techniques, this is experimentally proved, in addition a competitive efficiency is shown.

This paper addresses the Job Shop Scheduling Problem (JSSP). Basic constraints are established and it is modeled by a disjunctive graph. The model was mapped to Unrelated Parallel Machines Problem through a bipartite graph. An analysis of constraints is made in both problems to perform a relaxation of the manufacturing problem. Conducting the relaxation of JSSP, it is that any operation can be assigned to any machine, in addition, the precedence constraint between two operations longer applies. The application of approximated bipartite graph model is shown as a new alternative model to represent the JSSP problem, it may be an option to work with this type of problems instead of the disjunctive graph model.

In this paper, a solution is presented to the unrelated parallel machines problem that minimizes the total weighted completion time. Simulated annealing is applied to the problem, which is modeled as a Weighted Bipartite Matching Problem. Experimental results with benchmarks are presented, evaluating the efficiency and efficacy of the algorithm. It is then compared with an exact algorithm that solves the pondered model of Integer Linear Programming. The results demonstrate that Simulated Annealing Algorithm has high performance because for all the evaluated instances, it finds the optimum global solution.