Miracle-dz/UniFAR-FTUs huggingface dataset:
Interoperability and the Need for Intelligent Software A Historical Perspective

With the objective of defining the interoperability theme of this year’s conference it is the purpose of this paper 1 to trace the evolution of intelligent software from data-centric applications that essentially encapsulate their data environment to ontology-based applications with automated reasoning capabilities. The author draws a distinction between human intelligence and component capabilities within a more general definition of intelligence; - a kind of intelligence that can be embedded in computer software. The primary vehicle in the quest for intelligent software has been the gradual recognition of the central role played by data and information, rather than the logic and functionality of the application. The three milestones in this evolution have been: the separation of data management from the internal domain of the application; the development of standard data exchange protocols such as XML that allow machine interpretable structure and meaning to be added to data exchange packages; and, the ability to build information models that are rich in relationships and are thereby capable of supporting the automated reasoning capabilities of software agents. The author suggests that the vision of a Semantic Web environment in which ontology-based Web services with intelligent capabilities are able to discover each other and individually or in self-configured groups perform useful tasks, is not only feasible but imminently realizable. The capabilities of an experimental proof-of-concept system featuring semantic Web services that was demonstrated during the 2002 meeting of this annual conference series is described in summary form. The Concept of ‘Intelligence’
Experiment and analysis of quadrupedal quasi-passive dynamic walking robot “Duke”

Much attention has been paid to passive dynamic walking as an approach to investigate the walking of human beings and animals. As for quadrupedal passive dynamic walking, it is confirmed that walking resembles that of animals, and that the gait of the robot changes depending on the structure of robot or the environment. Based on these facts, it is conceivable that quadrupedal passive dynamic walking is related to walking of animals, and the walking principle is inherent in passive dynamic walking. In this research, we approach the walking principle through realization of a walking on the level ground by rational-energy input and investigation how gait changes depending on the input. In this paper, a quadrupedal quasi-passive dynamic walking robot named Duke has been developed by applying passive dynamic walking. This robot has only two rolling actuators, which simply provide with rocking motion and not drive the knee or hip joint directly. We conduct walking experiments by Duke with various inputs, and observe its gaits. As a result of walking experiments, it was verified that walking speed was related to the frequency and the phase difference of rocking motion. In addition, through analysis of a shape of soles, we revealed Duke has a nonholonomic constraint that is comparable to that of “two-wheeled robot” on its sole. As a result of analyses based on the nonlinear control theory, we conclude that the sole shape contributes to the transition of walking speed accompanying with change of a phase difference.
Low-complexity separable multiplier-less loop filter for video coding

In this paper, we present a low-complexity loop filter for video coding. We begin by presenting a set of non-Wiener based loop filters that can complement the Wiener-based adaptive loop filter which was considered as a tool for possible adoption in the HEVC standard. We devise filters which can be adaptively operated on different regions in an image. We devise a quad-tree based signaling for the filters, and present various loop filters: such as bilateral and Gaussian, as well as a separable 3-tap filter which can be implemented by just shifts and adds. The proposed 3-tap filter is thus hardware friendly with minimal complexity. In terms of compression performance, the proposed 3-tap filter can approach other sophisticated filters, albeit at a substantially reduced complexity; and can provide compression gains of 2.3% on average; and upto 7.0% for Low-Delay-P configuration over a data-set of 19 diverse HD, and UHD sequences of upto 8K resolution when implemented on top of the HM14.0 software for HEVC. Finally, we also present results for combining our proposed filters with the Wiener-based adaptive loop filter considered in HEVC, and illustrate that there is a significant amount of compression gain that can be achieved by loop filters for the next generation of video coding standard beyond HEVC.
Boosting-based Parse Reranking with Subtree Features

This paper introduces a new application of boosting for parse reranking. Several parsers have been proposed that utilize the all-subtrees representation (e.g., tree kernel and data oriented parsing). This paper argues that such an all-subtrees representation is extremely redundant and a comparable accuracy can be achieved using just a small set of subtrees. We show how the boosting algorithm can be applied to the all-subtrees representation and how it selects a small and relevant feature set efficiently. Two experiments on parse reranking show that our method achieves comparable or even better performance than kernel methods and also improves the testing efficiency.
PSA: A Performance and Space-Aware Data Layout Scheme for Hybrid Parallel File Systems

The underlying storage of hybrid parallel file systems (PFS) is composed of both SSD-based file servers (SServer) and HDD-based file servers (HServer). Unlike a traditional HServer, an SServer consistently provides improved storage performance but lacks storage space. However, most current data layout schemes do not consider the differences in performance and space between heterogeneous servers, and may significantly degrade the performance of the hybrid PFSs. In this paper, we propose PSA, a novel data layout scheme, which maximizes the hybrid PFSs performance by applying adaptive varied-size file stripes. PSA dispatches data on heterogeneous file servers not only based on storage performance but also storage space. We have implemented PSA within OrangeFS, a popular parallel file system in the HPC domain. Our extensive experiments using a representative benchmark show that PSA provides superior I/O throughput than the default and performance-aware file data layout schemes.
New Insight into the Treatment of Advanced Differentiated Thyroid Cancer

The vast majority of patients with differentiated thyroid cancer (DTC) are treated successfully with surgery and radioactive iodine ablation, yet the treatment of advanced cases is frustrating and largely ineffective. Systemic treatment with conventional cytotoxic chemotherapy is basically ineffective in most patients with advanced DTC. However, a better understanding of the genetics and biologic basis of thyroid cancers has generated opportunities for innovative therapeutic modalities, resulting in several clinical trials. We aim to delineate the latest knowledge regarding the biologic characteristics of DTC and to describe the available data related to novel targeted therapies that have demonstrated clinical effectiveness.
Recognizing a program's design: a graph-parsing approach

Psychological experiments have shown that programmers tend to use the same structure over and over. The authors call these commonly used programming structures 'cliches'. They describe a prototype, the Recognizer, that automatically finds all occurrences of a given set of cliches in a program and builds a hierarchical description of the program in terms of the cliches it finds. The key to the Recognizer's approach is a representation shift. Instead of looking for cliches directly in the source code, the Recognizer first translates the program into a language-independent, graphical representation called the Plan Calculus. The Plan Calculus is a program representation shared by all components of the Programmer's Apprentice, an intelligent programming system. Thus, although the authors have demonstrated the Recognizer only on small Common Lisp programs, the underlying technology is language-independent. <<ETX>>
S1 Appendix: Taxonomic Notes on Cases of Barcode Sharing, Paraphyletic and Polyphyletic Species.  Cases of Barcode Sharing

[AMNH]). Munroe (1976) described Loxostege sierralis as a new species and [BMNH]) as a synonymy of Loxostege thallophilalis. In our analyses, Loxostege sierralis, a montane species of the western Cordillera, sampled from California, Montana and British Columbia shared barcodes with Loxostege thrallophilalis from Washington. The genetic distance between species varied from 0.77 to 1.71% (mean 1.02%). Mitochondrial introgression is a possible explanation for the shared barcodes between these two taxa. Further investigation by using multi-loci (e.g., nuclear genes) would help to resolve the problem of these two sister species that are likely broadly sympatric and may hybridize frequently. Nomenclatural note: The spelling " thrallophilalis " in the original description by
Substrate-integrated waveguides in glass interposers with through-package-vias

This paper presents, for the first time, substrate-integrated waveguides (SIWs) in ultra-thin glass with through-package-vias (TPVs). An SIW operating at 20 GHz was designed in bare glass substrates to support the dominant TE10 mode and to avoid exciting TE20 mode. The simulated propagation constant confirmed the proper design for one-mode excitation, while the distributions of electromagnetic fields and surface current were examined and they exhibited similar patterns to those in dielectric-filled rectangular waveguides. Furthermore, the simulated S-parameter shows that the insertion loss at 20 GHz is 0.67 dB/cm, and 100% relative bandwidth was achieved. Finally, the impacts of TPV taper and the variability of the glass thickness and TPV pitch on the electrical performance of the SIW in glass interposers with TPVs were studied and presented.
SIMULATION AND RAPID PROTOTYPING ENVIRONMENT FOR AUV NETWORKS

The interest in deployment of multiple autonomous underwater vehicles (AUVs), such as AUV swarms, has been increasing. AUV swarms can reduce mission completion times and increase the system reliability. One of the basic constraints of these multiple vehicle systems is the limited communication between AUVs through the very challenging underwater acoustic channel. Even though reliable point-to-point communications through the acoustic channel can be successfully established, much research is needed to connect multiple AUVs within a network. In this paper, we present a simulation and prototyping environment
SPEA2: Improving the strength pareto evolutionary algorithm

The Strength Pareto Evolutionary Algorithm (SPEA) (Zitzler and Thiele 1999) is a relatively recent technique for ﬁnding or approximating the Pareto-optimal set for multiobjective optimization problems. In different studies (Zitzler and Thiele 1999; Zitzler, Deb, and Thiele 2000) SPEA has shown very good performance in comparison to other multiobjective evolutionary algorithms, and therefore it has been a point of reference in various recent investigations, e.g., (Corne, Knowles, and Oates 2000). Furthermore, it has been used in different applications, e.g., (La-hanas, Milickovic, Baltas, and Zamboglou 2001). In this paper, an improved version, namely SPEA2, is proposed, which incorporates in contrast to its predecessor a ﬁne-grained ﬁtness assignment strategy, a density estimation technique, and an enhanced archive truncation method. The comparison of SPEA2 with SPEA and two other modern elitist methods, PESA and NSGA-II, on different test problems yields promising results.
Demonstrating data possession and uncheatable data transfer

We observe that a certain RSA-based secure hash function is homomorphic. We describe a protocol based on this hash function which prevents ‘cheating’ in a data transfer transaction, while placing little burden on the trusted third party that oversees the protocol. We also describe a cryptographic protocol based on similar principles, through which a prover can demonstrate possession of an arbitrary set of data known to the verifier. The verifier isn’t required to have this data at hand during the protocol execution, but rather only a small hash of it. The protocol is also provably as secure as integer factoring.
Information Systems Competences in Small Manufacturing Firms

This paper focuses on information systems (IS) competences in small firms. The paper draws on prior IS research that has used resource-based theory. The literature was used to identify many types of IS resources and competences, predominantly based on research in large firms. The paper reports evidence gained from interviews within nine small manufacturing firms using the Peppard & Ward (2004) competences framework. Some small firms have developed many IS competences while other small firms have developed few IS competences. This paper is one of the first to report the existence of IS competences in small firms. Resource-based theory opens up many research opportunities, which are outlined towards the end of the paper.
Energy-Efficient and Metastability-Immune Resilient Circuits for Dynamic Variation Tolerance

A 65 nm resilient circuit test-chip is implemented with timing-error detection and recovery circuits to eliminate the clock frequency guardband from dynamic supply voltage (VCC) and temperature variations as well as to exploit path-activation probabilities for maximizing throughput. Two error-detection sequential (EDS) circuits are introduced to preserve the timing-error detection capability of previous EDS designs while lowering clock energy and removing datapath metastability. One EDS circuit is a dynamic transition detector with a time-borrowing datapath latch (TDTB). The other EDS circuit is a double-sampling static design with a time-borrowing datapath latch (DSTB). In comparison to previous EDS designs, TDTB and DSTB redirect the highly complex metastability problem from both the datapath and error path to only the error path, enabling a drastic simplification in managing metastability. From a survey of various EDS circuit options, TDTB represents the lowest clock energy EDS circuit known; DSTB represents the lowest clock energy static-EDS circuit with SER protection known. Error-recovery circuits are introduced to replay failing instructions at lower clock frequency to guarantee correct functionality. Relative to conventional circuits, test-chip measurements demonstrate that resilient circuits enable either 25%-32% throughput gain at equal VCC or at least 17% VCC reduction at equal throughput, corresponding to 31%-37% total power reduction.
Sensor Scheduling Algorithm Target Tracking-Oriented

Target tracking is a challenging problem for wireless sensor networks because sensor nodes carry limited power recourses. Thus, scheduling of sensor nodes must focus on power conservation. It is possible to extend the lifetime of a network by dynamic clustering and duty cycling. Sensor Scheduling Algorithm Target Tracking-oriented is proposed in this paper. When the target occurs in the sensing filed, cluster and duty cycling algorithm is executed to scheduling sensor node to perform taking task. With the target moving, only one cluster is active, the other is in sleep state, which is efficient for conserving sensor nodes’ limited power. Using dynamic cluster and duty cycling technology can allocate efficiently sensor nodes’ limited energy and perform tasks coordinately.
Detection-Guided Fast Affine Projection Channel Estimator for Speech Applications

In various adaptive estimation applications, such as acoustic echo cancellation within teleconferencing systems, the input signal is a highly correlated speech. This, in general, leads to extremely slow convergence of the NLMS adaptive FIR estimator. As a result, for such applications, the affine projection algorithm (APA) or the low-complexity version, the fast affine projection (FAP) algorithm, is commonly employed instead of the NLMS algorithm. In such applications, the signal propagation channel may have a relatively low-dimensional impulse response structure, that is, the number m of active or significant taps within the (discrete-time modelled) channel impulse response is much less than the overall tap length n of the channel impulse response. For such cases, we investigate the inclusion of an active-parameter detection-guided concept within the fast affine projection FIR channel estimator. Simulation results indicate that the proposed detection-guided fast affine projection channel estimator has improved convergence speed and has lead to better steady-state performance than the standard fast affine projection channel estimator, especially in the important case of highly correlated speech input signals.
Summarization-based Video Caption via Deep Neural Networks

Generating appropriate descriptions for visual content draws increasing attention recently, where the promising progresses were obtained owing to the breakthroughs in deep neural networks. Different from the traditional SVO (subject, verb, object) based methods, in this paper, we propose a novel framework of video caption via deep neural networks. For each frame, we extract visual features by a fine-tuned deep Convulutional Neural Networks (CNN), which are then fed into a Recurrent Neural Networks (RNN) to generate novel sentences descriptions for each frame. In order to obtain the most representative and high-quality descriptions for target video, a well-devised automatic summarization process is incorporated to reduce the noises by ranking on the sentence-sequence graph. Moreover, our framework owns the merit of describing out-of-sample videos by transferring knowledge from pre-captioned images. Experiments on the benchmark datasets demonstrate our method has better performance than the state-of-the-art methods of video caption in language generation metrics as well as SVO accuracy.
A Blackboard Architecture for Query Optimization in Object Bases

Adopting the blackboard architecture from the area of Arti cial Intelligence, a novel kind of optimizer enabling two desirable ideas will be proposed. Firstly, using such a well-structured approach backpropagation of the optimized queries allows an evolutionary improvement of (crucial) parts of the optimizer. Secondly, the A search strategy can be applied to harmonize two contrary properties: Alternatives are generated whenever necessary, and straight-forward optimizing is performed whenever possible, however. The generic framework for realizing a blackboard optimizer is proposed rst. Then, in order to demonstrate the viability of the new approach, a simple example optimizer is presented. It can be viewed as an incarnation of the generic framework.
Large Scale Spectral Clustering with Landmark-Based Representation

Spectral clustering is one of the most popular clustering approaches. Despite its good performance, it is limited in its applicability to large-scale problems due to its high computational complexity. Recently, many approaches have been proposed to accelerate the spectral clustering. Unfortunately, these methods usually sacrifice quite a lot information of the original data, thus result in a degradation of performance. In this paper, we propose a novel approach, called Landmark-based Spectral Clustering (LSC), for large scale clustering problems. Specifically, we select $p\ (\ll n)$ representative data points as the landmarks and represent the original data points as the linear combinations of these landmarks. The spectral embedding of the data can then be efficiently computed with the landmark-based representation. The proposed algorithm scales linearly with the problem size. Extensive experiments show the effectiveness and efficiency of our approach comparing to the state-of-the-art methods.
Prevention of Recurrent Foot Ulcers With Plantar Pressure–Based In-Shoe Orthoses: The CareFUL Prevention Multicenter Randomized Controlled Trial

OBJECTIVE To assess the efficacy of in-shoe orthoses that were designed based on shape and barefoot plantar pressure in reducing the incidence of submetatarsal head plantar ulcers in people with diabetes, peripheral neuropathy, and a history of similar prior ulceration. RESEARCH DESIGN AND METHODS Single-blinded multicenter randomized controlled trial with subjects randomized to wear shape- and pressure-based orthoses (experimental, n = 66) or standard-of-care A5513 orthoses (control, n = 64). Patients were followed for 15 months, until a study end point (forefoot plantar ulcer or nonulcerative plantar forefoot lesion) or to study termination. Proportional hazards regression was used for analysis. RESULTS There was a trend in the composite primary end point (both ulcers and nonulcerative lesions) across the full follow-up period (P = 0.13) in favor of the experimental orthoses. This trend was due to a marked difference in ulcer occurrence (P = 0.007) but no difference in the rate of nonulcerative lesions (P = 0.76). At 180 days, the ulcer prevention effect of the experimental orthoses was already significant (P = 0.003) when compared with control, and the benefit of the experimental orthoses with respect to the composite end point was also significant (P = 0.042). The hazard ratio was 3.4 (95% CI 1.3–8.7) for the occurrence of a submetatarsal head plantar ulcer in the control compared with experimental arm over the duration of the study. CONCLUSIONS We conclude that shape- and barefoot plantar pressure–based orthoses were more effective in reducing submetatarsal head plantar ulcer recurrence than current standard-of-care orthoses, but they did not significantly reduce nonulcerative lesions.
Potential use of tropical grass for deferment in semi-arid region.

Management evaluation of Panicum maximum cv. massai (Massai guineagrass) under deferment contributes as a strategic reserve of forage in the Brazilian semi-arid region. The objective of this study was to evaluate biomass production and nutritive value of massai guineagrass in an area of thinned caatinga vegetation in two deferment periods (60 and 90 days after plot-leveling cut) and four use periods (30, 60, 90 and 120 days after the end of the rain season), in a random blocks design arranged in a split-plot (2 × 4), with three replications. Extending the deferment period of massai guineagrass promoted elevation of the biomass components, but compromised the pasture quality due to increasing stem biomass. The massai guineagrass deferred 30 days after raining season started and should use 90 days after raining season ended to ensure a forage supply of appropriate nutritional value. The increase in relative air humidity and the occurrence of rainfall after water restriction stimulate regrowth, resulting in improved nutritional value of the grass.
A NOVEL IMPLEMENTATION OF ICP ALGORITHM APPLIED TO THE MULTIMODAL REGISTRATION OF THE LEFT VENTRICLE OF THE HEART

Image registration is a valuable technique for medical diagnosis and treatment. In this paper, we present an enhanced implementation of the popular iterative closest point (ICP) algorithm developed for the registration of 3D free-form closed surfaces. The main step of the ICP consists of finding the closest points between data sets which are then used to estimate the parameters of the global rigid transformation. We propose a new technique based on the use of a look up matrix for finding the best correspondence pairs. The algorithm, called Comprehensive ICP (CICP) algorithm, is then successfully applied for the registration of 3D data of the left ventricle of the heart, acquired using two different medical imaging modalities.