bluuebunny/crossref_metadata_2025_split huggingface dataset:
One case of iodine-125 therapy – A new minimally invasive treatment of intrahepatic cholangiocarcinoma
Authors: Chen Xinju , Chen Xiaoqi , Zhang Chuanlei , Wang Xinting , Yuan Changwei , Yang He , Yang Lixia 
Published: September 2022

Abstract
Intrahepatic cholangiocarcinoma (ICC) is the second most common primary liver cancer associated with a poor prognosis. ICC accounts for about 10% of primary liver malignancies but with increasing incidence in recent years. Recently, some studies suggested that minimally interventional therapy can be used in the treatment of ICC. However, there are few references on interventional therapy for the clinical treatment of ICC. Herein we reported a case of a 48-year-old man who suffered from ICC. The patient was diagnosed with ICC by computerized tomography scan and pathological biopsy. The patient was completely cured by minimally interventional therapy with iodine-125 seed implantation. These results provide an important reference for the treatment option of ICC.
Effect of WC content on ultrasonic properties, thermal and electrical conductivity of WC–Co–Ni–Cr composites
Authors: Bilici Vildan Özkan 
Published: September 2022

Abstract
This study focused on the effect of WC on the ultrasonic properties, thermal and electrical conductivity of WC–Co–Ni–Cr composites. The samples were produced by powder metallurgy method for microstructural, physical, and ultrasonic characterization. Pulse-echo, hot disk, and four probe methods were used to evaluate the ultrasonic properties, thermal and electrical conductivity of WC–Co–Ni–Cr composites with different WC contents, respectively. Experimental results show that thermal conductivity and electrical conductivity of WC–Co–Ni–Cr composites increase linearly with increasing WC content and then decrease rapidly. The reason for this rapid decrease is expressed in the fact that the structure becomes more ceramic as the WC additive ratio increases. The same situation was observed in ultrasonic measurements. As the amount of WC particles in the sample increased, longitudinal and shear wave velocity, attenuation values, and elastic modulus increased.
Stability and Error Estimates of a Novel Spectral Deferred Correction Time-Marching with Local Discontinuous Galerkin Methods for Parabolic Equations
Authors: Zhou Lingling , Chen Wenhua , Guo Ruihan 
Published: September 2022

Abstract
In this paper, we discuss the stability and error estimates of the fully discrete schemes for parabolic equations, in which local discontinuous Galerkin methods with generalized alternating numerical fluxes and a novel spectral deferred correction method based on second-order time integration methods are adopted.
With the energy techniques, we obtain both the second- and fourth-order spectral deferred correction time-marching with local discontinuous Galerkin spatial discretization are unconditional stable.
The optimal error estimates for the corresponding fully discrete scheme are derived by the aid of the generalized Gauss–Radau projection.
We extend the analysis to problems with higher even-order derivatives.
Numerical examples are displayed to verify our theoretical results.
“You just have to join in” – A mixed-methods study on children’s media consumption worlds and parental mediation
Authors: Roth-Ebner Caroline 
Published: September 2022

Abstract
In contemporary society, childhood is characterized as mediatized and commercialized. Media consumption worlds (MCWs) are a phenomenon that mirrors both aspects. They are narratives that are presented through various media platforms, games, and merchandising products. In this paper, the concept of children’s MCWs is developed theoretically and investigated empirically using the case of primary school children’s appropriation of MCWs as well as parental mediation and attitude in Austria and Germany. A mixed-methods design was applied, starting with qualitative interviews with children and their parents and followed by an online survey for parents (N=327). The study revealed that children find individual ways to deal with MCWs, some of which foster creativity and self-expression but also consumerism. The parents’ attitude is ambivalent. They view MCWs as beneficial in terms of creativity, positive values, and as peer group experience. However, parents observe critically that MCWs lure children to the media and to consumption.
Novel benzodioxatriaza and dibenzodioxadiazacrown compounds carrying 1,2,4-oxadiazole moiety
Authors: Özer Besra , Dürüst Yaşar 
Published: September 2022

Abstract
A series of benzo (dibenzo)dioxadiaza and triazamacrocyclic ether compounds carrying 1,2,4-oxadiazole group has been successfully synthesized through N-substitution with 3-p-phenylsubstituted-5-chloromethyl-1,2,4-oxadiazoles. The structures of all the novel macrocycles were confirmed by spectral/physical data including HRMS measurements.
Data on the Population of Reduced Earnings Capacity-Pensioners in Germany, 2001–2020
Authors: Werhan Katharina 
Published: September 2022

Abstract
Pensions for reduced earnings capacity (REC) have yearly made up about 20% of all pensions granted by the German Pension Insurance in the past 25 years. The dataset described in this article is a time series of cross-sectional observations for the retirement cohorts 2001–2020. It enables researchers to have a detailed insight into the population of REC-pensioners and allows observing trends and effects of reforms over time. The article provides general information on the data, first descriptive analyses, examples on possible matching with other data of the FDZ-RV and information on how to access the data.
Life, learning, and legacy: retired Black educators and the quest for education
Authors: Beachum Floyd D. , Khabbaz Tashina , Hylton-Fraser Kadia 
Published: September 2022

Abstract
Students from culturally and linguistically diverse (CLD) backgrounds face negative perceptions about their academic potential (Smith, C. A. (2005). School factors that contribute to the underachievement of students of color and what culturally competent school leaders can do. Educational Leadership and Administration: Teaching and Program Development, 17, 21–32). They are more often tracked into special education classes, and receive harsher punishments than their White peers (Shores, K., Kim, H. E., & Still, M. (2020). Categorical inequalities between Black and White students are common in US schools—but they don’t have to be. Brookings Center Chalkboard. https://www.brookings.edu/blog/brown-center-chalkboard/2020/02/21/categorical-inequalities-between-black-and-white-students-are-common-in-us-schools-but-they-dont-have-to-be/). Further, changing student demographics across the United States makes it imperative that students’ experiences within the classroom are positive, affirming, and reflective of their cultures and realities (Ladson-Billings, G. (2021). I’m here for the hard re-set: Post pandemic pedagogy to preserve our culture. Equity & Excellence in Education, 54(1), 68–78). While research in education has focused on the various teaching and leadership experiences of CLD educators, there are only a few which have specifically explored those of Black educators who taught in the era after the Great Migration. Unearthing such stories would be instructive for informing and improving current pedagogical practices for Blacks and other CLD students. Further, centering Black educators’ narratives is a way to disrupt the pervasive hegemonic narratives that typically focus on the experiences of White educators. Consequently, this small-scale study sought, through qualitative inquiry, to explore the perspectives of Black educational leaders and educators who attended segregated schools and then taught in more integrated settings after the Great Migration. Data collected through semi-structured interviews revealed three main themes: boundaries, community, and enhanced education. Importantly, the findings also revealed that as these Black educators shared their teaching and leadership experiences after migrating, they somehow could not escape the physical or psychological burden associated with being Black. The study has implications for how current educators interface with Black and CLD students to help them navigate a system that is still marked by anti-Black racism.
Children’s use of English as lingua franca in Swedish preschools
Authors: Larsson Karolina , Björk-Willén Polly , Haraldsson Katarina , Hansson Kristina 
Published: September 2022

AbstractThis paper highlights a current phenomenon reported from preschools placed in multilingual areas in Sweden, namely that some preschoolers with mutually different language backgrounds sometimes use English as lingua franca instead of Swedish during play. The data stems from a study of language environments in Swedish preschools situated in both monolingual and multilingual areas. The analyses reveal that many children are influenced by the English language in both areas, but to a much greater extent in multilingual areas. An interesting situation arises when the majority language of society, which is also the language of education and lingua franca of the preschool, acquires a less prevailing role in children’s accomplishment of everyday practices. Data show that the participating children are exposed to and speak English to a varying extent. They learn and teach each other English, and speak English in an array of pragmatic purposes; to position themselves in the social hierarchies of the preschool group, to create meaning within their shared peer culture and for the purpose of exclusion of intruders. English is also used as a secret language of friendship.
Laser cutting tobacco slice experiment: Effects of cutting power and cutting speed
Authors: Li Pengfei , Wang Shuiming , Xiong Bin , Tang Xiangbing , Tong Yuxing , Gao Song , Wen Shuangshuang , Huang Ming , Duan Zhoujun , Chen Qianjin 
Published: September 2022

Abstract
Due to their low melting point, low strength, uneven thickness, and sugar and moisture content, tobacco slices are very sensitive to the requirements of cutting parameters. In this article, the CO2 laser is used to study the specific process parameters in the cutting process of tobacco slices with a moisture content of 13%. The cutting powers and cutting speeds are varied to investigate the effects on the cutting quality of tobacco slices. The result reveals that the lower the cutting speed, the more conducive to the cutting of tobacco slices. And cutting speeds less than 2.5 m/s are preferable to the cutting of tobacco slices. But lower cutting speed means lower cutting efficiency. Meanwhile, the larger the cutting power, the more conducive to the cutting of tobacco slices. However, larger cutting power means larger energy consumption and higher requirements for the laser. Therefore, there is a compromise between cutting speed and cutting power. The preferable cutting power and speed parameters are summarized. The results obtained provide practical guidance for cutting high-quality tobacco slices.
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Authors: Low Kian Hsiang , Dolan John , Khosla Pradeep 
Published: September 2022

Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a sequential decision-theoretic planning under uncertainty framework called MASP. The time complexity of solving MASP approximately depends on the map resolution, which limits its use in large-scale, high-resolution exploration and mapping. To alleviate this computational difficulty, this paper presents an information-theoretic approach to MASP (iMASP) for efficient adaptive path planning; by reformulating the cost-minimizing iMASP as a reward-maximizing problem, its time complexity becomes independent of map resolution and is less sensitive to increasing robot team size as demonstrated both theoretically and empirically. Using the reward-maximizing dual, we derive a novel adaptive variant of maximum entropy sampling, thus improving the induced exploration policy performance. It also allows us to establish theoretical bounds quantifying the performance advantage of optimal adaptive over non-adaptive policies and the performance quality of approximately optimal vs. optimal adaptive policies. We show analytically and empirically the superior performance of iMASP-based policies for sampling the log-Gaussian process to that of policies for the widely-used Gaussian process in mapping the hotspot field. Lastly, we provide sufficient conditions that, when met, guarantee adaptivity has no benefit under an assumed environment model.
Inference and Decomposition in Planning Using Causal Consistent Chains
Authors: Lipovetzky Nir , Geffner Hector 
Published: September 2022

Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems and to explain their solutions, it seems that an essential inferential component may be missing. The reasons expressed by people for selecting actions appear to be related to causal chains: sequences of causal links ai → pi + 1, i = 0, ..., n – 1, such that a0 is applicable in the current state, pi is a precondition of action ai, and pn is a goal. Some of these causal chains or paths appear to be good, some bad, others appear to be impossible. In this work, we focus on such paths and develop three techniques for performing inference over them from which a path-based planner is obtained. We define the conditions under which a path is consistent, provide an heuristic estimate of the cost of achieving the goal along a consistent path, and introduce a planning algorithm that uses paths as decomposition backbones. The resulting planner, called C3, is not complete and does not perform as well as recent planners that carry extensive but extremely efficient searches such as LAMA, but is competitive with FF and in particular, with FF running in EHC mode which yields very focused but incomplete searches, and thus provides, a more apt comparison. Moreover, many domains are solved backtrack-free, with no search at all, suggesting that planning with paths may be a meaningful idea both cognitively and computationally.
A Semantics for HTN Methods
Authors: Goldman Robert 
Published: September 2022

Despite the extensive development of first-principles planning in recent years, planning applications are still primarily developed using knowledge-based planners which can exploit domain-specific heuristics and weaker domain models. Hierarchical Task Network (HTN) planners capture domain-specific heuristics for more efficient search, accommodate incomplete causal models, and can be used to enforce standard operating procedures. Unfortunately, we do not have semantics for the methods or tasks that make up HTN models, that help evaluate the correctness of methods, or to build a reliable executive for HTN plans. This paper fills the gap by providing a well-defined semantics for the methods and plans of SHOP2, a state-of-the-art HTN planner. The semantics are defined in terms of concurrent golog (ConGolog) and the situation calculus. We provide a proof of equivalence between the plans generated by SHOP2 and the action sequences of the ConGolog semantics. We show how the semantics reflects the distinction between plan-time and execution-time, and provide some simple examples showing how the semantics can support method verification. The semantics provide an implementation-neutral specification for an executive, showing how an executive must treat the plans SHOP2 generates in order to enforce the expected behaviors. Future directions include automated verification of method specifications, automatically generating plan monitors, and plan revision and repair.
Extended Goals for Composing Services
Authors: Kaldeli Eirini , Lazovik Alexander , Aiello Marco 
Published: September 2022

The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of service composition have been recently made. We present an approach, based on modelling the problem as a CSP (Constraint Satisfaction Problem), that accommodates for the use of numeric variables, sensing and incomplete knowledge. We introduce a language for expressing extended goals, equipped with temporal constructs, maintainability properties, and an explicit distinction between sensing and achievement goals, in order to avoid undesirable situations.
Using Distance Estimates in Heuristic Search
Authors: Thayer Jordan , Ruml Wheeler 
Published: September 2022

This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is not the same as search-distance-to-go. We evaluate two previous proposals: dynamically weighted A* and A* epsilon. We present a revision to dynamically weighted A* that improves its performance substantially in domains where the search does not progress uniformly towards solutions, and particularly in certain temporal planning problems. We show how to incorporate distance estimates into weighted A* and improve its performance in several domains. Both approaches lead to dramatic performance increases in popular benchmark domains.
Self-Taught Decision Theoretic Planning with First Order Decision Diagrams
Authors: Joshi Saket , Kersting Kristian , Khardon Roni 
Published: September 2022

We present a new paradigm for planning by learning, where the planner is given a model of the world and a small set of states of interest, but no indication of optimal actions in these states. The additional information can help focus the planner on regions of the state space that are of interest and lead to improved performance. We demonstrate this idea by introducing novel model-checking reduction operations for First Order Decision Diagrams (FODD), a representation that has been used to implement decision-theoretic planning with Relational Markov Decision Processes (RMDP). Intuitively, these reductions modify the construction of the value function by removing any complex specifications that are irrelevant to the set of training examples, thereby focusing on the region of interest. We show that such training examples can be constructed on the fly from a description of the planning problem thus we can bootstrap to get a self-taught planning system. Additionally, we provide a new heuristic to embed universal and conjunctive goals within the framework of RMDP planners, expanding the scope and applicability of such systems. We show that these ideas lead to significant improvements in performance in terms of both speed and coverage of the planner, yielding state of the art planning performance on problems from the International Planning Competition.
Abstractions for Oversubscription Planning
Authors: Mirkis Vitaly , Domshlak Carmel 
Published: September 2022

In deterministic OSP, the objective is to achieve an as valuable as possible subset of goals within a fixed allowance of the total action cost. Although numerous applications in various fields share this objective, no substantial algorithmic advances have been made beyond the very special settings of net-benefit optimization. Tracing the key sources of progress in classical planning, we identify a severe lack of domain-independent approximations for OSP, and start with investigating the prospects of abstraction approximations for this problem. In particular, we define the notion of additive abstractions for OSP, study the complexity of deriving effective abstractions from a rich space of hypotheses, and reveal some substantial, empirically relevant islands of tractability.
The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph
Authors: Domshlak Carmel , Nazarenko Anton 
Published: September 2022

For almost two decades, monotonic, or ``delete free,'' relaxation has been one of the key auxiliary tools in the practice of domain-independent deterministic planning. In the particular contexts of both satisficing and optimal planning, it underlies most state-of-the-art heuristic functions. While satisficing planning for monotonic tasks is polynomial-time, optimal planning for monotonic tasks is NP-equivalent. We took a step towards a fine-grained classification of worst-case time complexity of optimal monotonic planning, with a focus on ``what gets harder" and ``what gets easier" when switching from optimal planning to optimal relaxed planning, in the context of finite-domain planning task representations.
A Tree-Based Algorithm for Construction Robots
Authors: Kumar T. K. , Jung Sangmook , Koenig Sven 
Published: September 2022

In this paper, we present a tree-based algorithm for construction robots. Inspired by the TERMES project of Harvard University, robots in this domain are required to gather construction blocks from a reservoir and build user-specified structures much larger than themselves. While the robots are of roughly the same size as the blocks, they can scale greater heights by using temporarily constructed ramps in the substructures. In this paper, we consider the problem of minimizing the number of pickup and drop-off operations performed on blocks in order to build user-specified structures. Our polynomial-time algorithm heuristically solves this problem and is based on the idea of performing dynamic programming on a spanning tree in the inner loop and searching for a good tree to do so in the outer loop. Our algorithm performs very well in simulation and scales easily to large problem instances. For planning problems of this nature that are akin to construction domains, we believe that valuable lessons can be learned from comparing the success of our algorithm with the failure of off-the-shelf planning technologies.
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Authors: Mandalika Aditya , Salzman Oren , Srinivasa Siddhartha 
Published: September 2022

Motion-planning problems, such as manipulation in cluttered environments, often require a collision-free shortest path to be computed quickly given a roadmap graph.	Typically, the computational cost of evaluating whether an edge of the roadmap graph is collision-free dominates the running time of search algorithms. Algorithms such as Lazy Weighted A* (LWA*) and LazySP have been proposed to reduce the number of edge evaluations by employing a lazy lookahead (one-step lookahead and infinite-step lookahead, respectively). However, this comes at the expense of additional graph operations: the larger the lookahead, the more the graph operations that are typically required.	We propose Lazy Receding-Horizon A* (LRA*) to minimize the total planning time by balancing edge evaluations and graph operations. Endowed with a lazy lookahead, LRA* represents a family of lazy shortest-path graph-search algorithms that generalizes LWA* and LazySP. We analyze the theoretic properties of LRA* and demonstrate empirically that, in many cases, to minimize the total planning time, the algorithm requires an intermediate lazy lookahead. Namely, using an intermediate lazy lookahead, our algorithm outperforms both LWA* and LazySP. These experiments span simulated random worlds in R^2 and R^4, and manipulation problems using a 7-DOF manipulator.