Miracle-dz/UniFAR-FTUs huggingface dataset:
Computer-Aided Visualisation of Archaeological Caves

Introduction Historically the two most important methods of communicating the appearance and shape of a cave are cave surveying and cave photography, topics which have been widely reviewed elsewhere (Hatherley et al. 1987; Ellis, 1988; Stoddard, 1994; Wookey, in prep.). Computer-aided visualisation can use both these techniques as starting points to produce alternative ways of presenting the spatial information. These visualisations can be reproduced in print often allowing a greater degree of clarity or a more three-dimensional "feel" than can easily be achieved with the traditional methods. Alternatively, when reproduced electronically they can allow the viewer to interact directly with the visualisation which enhances interest and greatly improves the illusion of representing three-dimensional space on a two-dimensional plane. Some virtual-reality techniques can allow a directly perceivable threedimensional representation which is the ultimate goal when trying to convey the appearance of a complex cave structure.
An optimal two transmit antenna space-time code and its stacked extensions

A space-time code is proposed that exhibits the highest coding gain between competing full rate full transmit diversity space-time codes for the two transmit antenna wireless channel. The proposed code is derived from a layered architecture with real rotation of QAM information symbols in two dimensions. The existing codes of similar architecture concentrate on application of complex full modulation diversity rotations or asymmetric real rotations for the two layers. An analytic evaluation illustrates the significant improvement in coding gain achieved with the proposed code. Moreover, the value of the unnormalized coding gain for the new code is independent of the rate of the code. A stacked extension of the proposed code offers a reduced complexity capacity optimal alternative to the full diversity codes for larger number of transmit antennas. Performance enhancement in several scenarios is verified through simulations.
Performance of heuristic methods driven by chaotic dynamics for ATSP and applications to DNA fragment assembly

: Chaotic dynamics has been shown to be eﬀective in improving the performance of combinatorial optimization algorithms. In this paper, the performance of chaotic dynamics in the asymmetric traveling salesman problem (ATSP) is investigated by introducing three types of heuristic solution update methods. Numerical simulation has been carried out to compare its performance with simulated annealing and tabu search; thus, the eﬀectiveness of the approach using chaotic dynamics for driving heuristic methods has been shown. The chaotic method is also evaluated in the case of a combinatorial optimization problem in the real world, which can be solved by the same heuristic operation as that for the ATSP. We apply the chaotic method to the DNA fragment assembly problem, which involves building a DNA sequence from several hundred fragments obtained by the genome sequencer. Our simulation results show that the proposed algorithm using chaotic dynamics in a block shift operation exhibits the best performance for the DNA fragment assembly problem.
Efficient Routing Using Temporal Distance in Intermittently Connected Mobile Ad-Hoc Networks

The analysis of real social, biological and technological networks has attracted a lot of attention as technological advances have given us a wealth of empirical data. For, analysis and investigation time varying graphs are used to understand the relationship, contact duration, repeated occurrence of contact. It is under exploring in intermittently connected networks. Now, by extending the same concept in intermittent networks, the efficiency of the routing protocol can be improved. This paper discusses about the temporal characterizing algorithm. Such characterization can help in accurately understanding dynamic behaviors and taking appropriate routing decisions. Therefore, the present research provokes exploring different possibilities of utilizing the same time varying network analyses and designing an Adaptive Routing protocol using temporal distance metric. The adaptive routing protocol is implemented using ONE simulator and is compared with the Epidemic and PropHET for delivery ratio, overhead and the number of dropped messages. The result reveals that Adaptive routing performs better than Epidemic and PropHET for real and synthetic datasets.
Joint source-channel coding for raster document transmission over mobile radio

Coding schemes for binary raster document transmission in the mobile radio environment are explored. For many applications, standard facsimile is too costly in terms of capital investment and transmission time. In this paper we present joint source-channel coding as an alternative, cost-effective solution for low resolution graphics transmission. We present SEA-RL coding as a novel and useful example of joint source-channel coding.
Application of Thinking Method of Decomposition and Combination in Developing Software

There are many thinking method, the thinking method of decomposition and combination is important and widely used. In the category of scholars, "decomposition and combination" belong to "analysis and synthesis". Developing software is a complex mental activity, so it requires the use of a variety of thinking method. Thinking method of decomposition and combination is the use of the most frequent in developing software. Content of thinking method of decomposition and combination is analyzed. Application of thinking method of decomposition and combination has been analyzed from four aspects. Four aspects are the development trend of software, the main content of the structured software development method, the main content of the object-oriented software development method, several commonly used software development tools.
Interactive multimedia services to residential users

Despite the business risks involved in the introduction of digital video and interactive television, vigorous investments made by the telecommunication industries and content owners clearly demonstrate the belief that such services are going to happen. In this paper, a complete scenario for the provision of interactive multimedia services from the residential user's point of view is considered, focusing on software components. Initially, a reference architecture configuration, based on the DAVIC paradigm, suitable for the provision of residential interactive broadband services is presented. In addition to hardware capabilities, the system will be considered successful only if it is easy to learn, worth the time and cost-effective. Consequently, a set of possible service requirements is introduced and a development process for distributed interactive multimedia applications is proposed. Finally, based on experience gained from the implementation of applications in different residential trials throughout Europe, guidelines and methodologies for user interface design are illustrated.
Adaptive transfer function design for volume renering by using a general regression neural network [renering read rendering]

The transfer function is responsible for the three-dimensional image classification and its design is a key process in volume visualization applications. However, it is difficult and time-consuming for the users to design new proper transfer function when the types of the studied images change. By introducing a general regression neural network (GRNN) into the transfer function design, together with a proper image evaluation strategy, a new volume rendering framework is proposed in this paper. Experimental results showed that by using GRNN to guide the transfer function design, the robustness of volume rendering is promoted and the corresponding classification process is optimized.
Object-oriented Programming Applied to the Development of Structural Analysis and Optimization Software

This paper presents the development of a two-dimensional interactive software environment for structural analysis and optimization based on object-oriented programming using the C++ language. The main feature of the software is the effective integration of several computational tools into graphical user interfaces implemented in the Windows-98 and Windows-NT operating systems. The interfaces simplify data specification in the simulation and optimization of two-dimensional linear elastic problems. NURBS have been used in the software modules to represent geometric and graphical data. Extensions to the analysis of three-dimensional problems have been implemented and are also discussed in this paper.
Aviation Equipment Fault Information Fusion Based on Ontology

The designing institution, manufacturer and end-user jointly participate in aircraft maintenance. Maintenance data from multiple sources results in syntax and semantic conflicts, which have restricted integration and sharing of information on aircraft faults. To solve this problem, a solution based on ontology is proposed. Global aircraft fault ontology gives a uniform and specific description for multi-source data, eliminating the semantic heterogeneity. Data integration based on ontology mapping eliminates the structural heterogeneity. Ontology reasoning and data fusion algorithm is proposed and successfully implemented to remove the ambiguity and inconsistence from information on aircraft fault. Index Terms - Ontology Mapping, Data Integration, Ontology Reasoning, Data Fusion, Aircraft Fault
Integration of cloud-based storage in BES III computing environment

We present an on-going work that aims to evaluate the suitability of cloud-based storage as a supplement to the Lustre file system for storing experimental data for the BES III physics experiment and as a backend for storing files belonging to individual members of the collaboration. In particular, we discuss our findings regarding the support of cloud-based storage in the software stack of the experiment. We report on our development work that improves the support of CERN' s ROOT data analysis framework and allows efficient remote access to data through several cloud storage protocols. We also present our efforts providing the experiment with efficient command line tools for navigating and interacting with cloud storage-based data repositories both from interactive sessions and grid jobs.
An ultra-wideband CMOS low noise amplifier for 3-5-GHz UWB system

An ultra-wideband (UWB) CMOS low noise amplifier (LNA) topology that combines a narrowband LNA with a resistive shunt-feedback is proposed. The resistive shunt-feedback provides wideband input matching with small noise figure (NF) degradation by reducing the Q-factor of the narrowband LNA input and flattens the passband gain. The proposed UWB amplifier is implemented in 0.18-/spl mu/m CMOS technology for a 3.1-5-GHz UWB system. Measurements show a -3-dB gain bandwidth of 2-4.6GHz, a minimum NF of 2.3 dB, a power gain of 9.8 dB, better than -9 dB of input matching, and an input IP3 of -7dBm, while consuming only 12.6 mW of power.
A novel control scheme based on online delay evaluation for a class of networked control systems

In this paper, a novel control scheme that integrates control technology with communication technology is introduced for a class of networked control systems (networked half-link systems: NHLS). Concretely, we use the master-slave clock synchronization technology to evaluate the delays online, and then the LQ optimal control based on the obtained delays is adopted to stabilize the controlled plant. Since the error of evaluated delays due to the clock error that is inevitable in the clock synchronization deteriorates the system performances, the discussions about the clock error, and related control analysis and design are also developed. Specifically, we present the relation conditions of controller parameters that guarantee the system stability, and then the from bottom to top method for designing the controller is addressed. Finally, some experiments based on CANbus platform are introduced, which verify the previous analytic results.
CULA: hybrid GPU accelerated linear algebra routines

The modern graphics processing unit (GPU) found in many standard personal computers is a highly parallel math processor capable of nearly 1 TFLOPS peak throughput at a cost similar to a high-end CPU and an excellent FLOPS/watt ratio. High-level linear algebra operations are computationally intense, often requiring O(N3) operations and would seem a natural fit for the processing power of the GPU. Our work is on CULA, a GPU accelerated implementation of linear algebra routines. We present results from factorizations such as LU decomposition, singular value decomposition and QR decomposition along with applications like system solution and least squares. The GPU execution model featured by NVIDIA GPUs based on CUDA demands very strong parallelism, requiring between hundreds and thousands of simultaneous operations to achieve high performance. Some constructs from linear algebra map extremely well to the GPU and others map poorly. CPUs, on the other hand, do well at smaller order parallelism and perform acceptably during low-parallelism code segments. Our work addresses this via hybrid a processing model, in which the CPU and GPU work simultaneously to produce results. In many cases, this is accomplished by allowing each platform to do the work it performs most naturally.
Nitrogen-15-labeled deoxynucleosides. 4. Synthesis of [1-15N] and [2-15N]-labeled 2'-deoxyguanosines

The syntheses of [1- 15 N]- and [2- 15 N]-2'-deoxyguanosines are reported via transformation of 2'-deoxyadenosine. The 15 N source for the [1- 15 N] label is [6- 15 N]-2'-deoxyadenosine, while for the [2- 15 N] label it is [ 15 N]KCN. The synthetic route is particularly straightforward in that there are no protection and deprotection steps and only one chromatographic purification. Furthermore, it is directly applicable to preparation of the labeled ribonucleosides
On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling

Modern architectures allow multiple instructions to be issued at once and have other complex features. To account for this, compilers perform instruction scheduling after generating the output code. The instruction scheduling problem is to find an optimal schedule given the limitations and capabilities of the architecture. While this can be done optimally, a greedy algorithm known as list scheduling is used in practice in most production compilers. List scheduling is generally regarded as being near-optimal in practice, provided a good choice of heuristic is used. However, previous work comparing a list scheduler against an optimal scheduler either makes the assumption that an idealized architectural model is being used or uses too few test cases to strongly prove or disprove the assumed near-optimality of list scheduling. It remains an open question whether or not list scheduling performs well when scheduling for a realistic architectural model. Using constraint programming, we developed an efficient optimal scheduler capable of scheduling even very large blocks within a popular benchmark suite in a reasonable amount of time. I improved the architectural model and optimal scheduler by allowing for an issue width not equal to the number of functional units, instructions that monopolize the processor for one cycle, and non-fully pipelined instructions. I then evaluated the performance of list scheduling for this more realistic architectural model. I found that when scheduling for basic blocks when using a realistic architectural model, only 6% or less of schedules produced by a list scheduler are non-optimal, but when scheduling for superblocks, at least 40% of schedules produced by a list scheduler are non-optimal. Furthermore, when the list scheduler and optimal scheduler differed, the optimal scheduler was able to improve schedule cost by at least 5% on average, realizing maximum improvements of 82%. This suggests that list scheduling is only a viable solution in practice when scheduling basic blocks. When scheduling superblocks, the advantage of using a list scheduler is its speed, not the quality of schedules produced, and other alternatives to list scheduling should be considered.
Necessary test cases for Decision Coverage and Modified Condition / Decision Coverage

Test coverage refers to the extent to which a given software verification activity satisfies its objectives. Several types of coverage analysis exist to check code correctness. Less strict analysis methods require fewer test cases to satisfy their requirements and consume less resources. Choosing test methods is a compromise between the code correctness and the available resources. However this selection should be based on quantitative consideration. In this paper we concern the Decision Coverage and the more strict Modified Condition / Decision Coverage. We examined several projects written in Ada programming language. Some of them are developed in the industry and the others are open source. We analyzed them in several aspects: Mc- Cabe metric, nesting and maximal argument number in decisions. We discuss how these aspects are affected by difference of the necessary test cases for these testing methods.
Future Teachers' Classroom Applications of Technology

Abstract Student teachers from North Carolina's public teacher preparation institutions were surveyed in 2002 and 2003 to learn about the environment in which they taught and the activities they undertook with respect to using technology. Responses regarding the “most successful” use of technology in the classroom were analyzed to determine if they reflected Type I or Type II applications of technology as defined by Maddux, Johnson, and Willis (1997). Type I, or drill-and-practice applications, were found at all grade levels but were most prevalent in K-2 classrooms. The most common of the Type II applications, those that require active intellectual involvement by the learner, was using the Internet for research. Examples of integrated Type II activities are provided.
Classification of Degradation Types Based on Distribution of Blocky Blocks for IP‐Based Video Services

In this letter, we propose a new quality measurement method to identify the causes of video quality degradation for IP‐based video services. This degradation mainly results from network performance issues and video compression. The proposed algorithm identifies the causes based on statistical feature values from blocky block distribution in degraded IP‐based videos. We found that the sensitivity and specificity of the proposed algorithm are 93.63% and 91.99%, respectively, in comparison with real error types and subjective test data.
The first adduct of bis(1,3-di­phenyl-1,3-propane­dionato)­oxovanadium(IV)

In the reaction of bis(1,3-di­phenyl-1,3-propane­dionato)­oxovanadium(IV) with pyridine, a 1:1 adduct is formed, viz bis(1,3-di­phenyl-1,3-propane­dionato-κ2O,O′)­oxo­(pyridine-κN)­vanadium(IV), [V(C15H10O2)2O(C5H5N)]. The V atom is surrounded by one pyridine ligand, two 1,3-di­phenyl-1,3-propandionate (dbm) ligands and one oxo group. The complex exhibits a distorted octahedral coordination, with the oxo group and pyridine ligand in a cis configuration. Pairs of mol­ecules of the adduct are connected by an intermolecular C41—H41⋯O1(−x, 2 − y, 1 − z) contact of 3.171 (3) A and thus form dimers in the solid state.
Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs

The matching of a bipartite graph is a structure that can be seen in various assignment problems and has long been studied. The semi-matching is an extension of the matching for a bipartite graph G =(U ∪ V, E). It is defined as a set of edges, M ⊆ E, such that each vertex in U is an endpoint of exactly one edge in M. The load-balancing problem is the problem of finding a semi-matching such that the degrees of each vertex in V are balanced. This problem is studied in the context of the task scheduling to find a “balanced” assignment of tasks for machines, and an O(¦E¦¦U¦) time algorithm is proposed. On the other hand, in some practical problems, only balanced assignments are not sufficient, e.g., the assignment of wireless stations (users)to access points (APs) in wireless networks. In wireless networks, the quality of the transmission depends on the distance between a user and its AP; shorter distances are more desirable. In this paper, We formulate the min-weight load-balancing problem of finding a balanced semi-matching that minimizes the total weight for weighted bipartite graphs. We then give an optimal condition of weighted semi-matchings and propose an O(¦E¦¦U¦¦V¦) time algorithm.
Research on Theory and Approach of Provable Security

This paper presents a survey on the theory of provable security and its applications to the design and analysis of security protocols. It clarifies what the provable security is, explains some basic notions involved in the theory of provable security and illustrates the basic idea of random oracle model. It also reviews the development and advances of provably secure public-key encryption and digital signature schemes, in the random oracle model or the standard model, as well as the applications of provable security to the design and analysis of session-key distribution protocols and their advances.
A Key Delay Design Operation Model of Block Cipher Algorithm in Network

For the published block cipher algorithm, the key design is an important part to a cryptographic system. Block ciphers used in networks environment take more risks than ever before because of their initialization key’s distribution in internet openly. But key algorithm and block cipher algorithm combined with model has been ignored for a long period. If the key delay technology is used, the speed of algorithm will be promoted and the chip’s area will be decreased with very low value. This article proposed an approach in block cipher’s key design against only known ciphertext attack. Furthermore, we discussed this design’s provable security according to information theory.
An innovative kernel-based recursive time-series learning algorithm with applications to improvements of beehive management practices

In this paper, we propose an innovative kernel-based learning algorithm to sequentially estimate subset vector autoregressive models (including full-order models). To demonstrate the effectiveness of the proposed recursive algorithm, we apply this algorithm to test the direct causal relationships between the population of honeybee foragers and foraging types gathering nectar, pollen or water. We have found that under certain conditions, nectar foraging may be improved by the changes in the proportions of other foraging bees, such as pollen foragers. This suggests that we may be able to predict the optimal conditions at any time to maximise the honey yield of colonies.
New compression paradigms in JPEG 2000

The JPEG2000 still image compression standard has adopted a new compression paradigm: 'Encode once, decode many. ' JPEG2000 architecture allows the codestream to be decoded differently for different application needs. The codestream can be decoded to produce lossless and lossy images, specific spatial regions of the image or images with different quality and resolution. The syntax contains pointers and length fields which allow relevant coded data to be identified without the entropy coder or transforms. Consequently, the codestream can be 'parsed' to create different codestreams without transcoding. For example, such parsing operation can create a new codestream which contains a lower resolution image (e.g. thumbnail) of the original codestream. If a codestream is produced appropriately, it can also be converted to codestreams of lower quality images, or images containing only a specific spatial region. This feature is very useful for many applications, especially on the internet.