Miracle-dz/UniFAR-FTUs huggingface dataset:
High performance visualization through graphics hardware and integration issues in an electric power grid Computer-Aided-Design application

Esta tesis presenta los resultados de trabajos de investigacion llevados a cabo para mejorar la visualizacion de una herramienta de planificacion de redes electricas. La primera actuacion consistio en actualizar su motor de dibujo para explotar el alto rendimiento ofrecido por DirectX. Una forma fundamental de mejorar el rendimiento de una visualizacion es la reduccion de los datos involucrados, puesto que cuanto menor sea su volumen, menor sera el tiempo necesario para generar la visualizacion. Ademas, la reduccion de datos puede mejorar la calidad estetica de la visualizacion, haciendola mas legible. Se presentaron dos aproximaciones a la reduccion de datos: mediante bases de datos espaciales y mediante hardware grafico. No son excluyentes, dado que la informacion de las redes electricas normalmente proviene de una base de datos y, utilizando las extensiones espaciales que proporcionan la mayoria de sistemas de gestion de bases de datos modernos, se puede procesar la informacion para adecuadarla a la visualizacion a realizar. El hardware grafico moderno esta equipado con potentes GPUs con gran capacidad para la computacion paralela de alto rendimiento y proposito general. Se han presentado tres tecnicas que no solo dibujan la visualizacion de las redes electricas, sino que integran en el proceso la simplificacion de las redes electricas para tratar de generar la visualizacion mas rapidamente. Segun sigan evolucionando las capacidades del hardware grafico, nuevas tecnicas podran ser implementadas y las existentes mejoraran su rendimiento de forma casi transparente, lo que hace que este campo sea altamente dinamico y una fuente de innovacion.
Analysis by Synthesis Coding

Up-to-date, expert coverage of topics in wireless voice communications Voice communication is the most important facet of mobile radio service. Even when the predicted surge of wireless data and Internet services becomes a reality, voice will remain the most natural means of human communication. Voice Compression and Communications details issues in wireless voice communications and treats compression, channel coding, and wireless transmission as a joint subject. Part I covers background material, whereas Part II provides detailed information on both proprietary and standardized analysis-by-synthesis codecs, including the speech codecs of virtually all existing wireline-based and wireless systems. Parts III and IV discuss mainly research-based wideband, audio, as well as very low-rate schemes likely to find their way into future standards. Voice Compression and Communications describes fundamental concepts in a non-mathematical way early in the book for those with only a b ckground knowledge of signal processing and communications. More advanced readers will find detailed discussions of theoretical principles, future concepts, and solutions to various specific wireless voice communications problems.
Image Retrieval Method Based on Fusion of Edge Features and RGB Color Component

Construct an image retrieval method based on feature fusion of color features of RGB component and edge feature. The execution of this method is divided into the following steps: First, the original image is decomposed into three components images of RGB; Secondly, wavelet decomposition is carried out on each component image; Third, color and edge features are obtained on the low-pass components from each component image; Finally, these two features are combined to complete the image retrieval. Experimental results show that the proposed method has better accuracy than the retrieval method using single feature, and retrieval speed is relatively fast.
Performance Improvement of Face Recognition System using Selective Local Feature Vectors

Face recognition is one of the important applications of image processing and it has gained significant attention in wide range of law enforcement areas in which security is of prime concern. Although the existing automated machine recognition systems have certain level of maturity but their accomplishments are limited due to real time challenges. Face recognition systems are impressively sensitive to appearance variations due to lighting, expression and aging. The major metric in modeling the performance of a face recognition system is its accuracy of recognition. This paper proposes a novel method which improves the recognition accuracy as well as avoids face datasets being tampered through image splicing techniques. Proposed method uses a non-statistical procedure which avoids training step for face samples thereby avoiding generalizability problem which is caused due to statistical learning procedure. This proposed method performs well with images with partial occlusion and images with lighting variations as the local patch of the face is divided into several different patches. The performance improvement is shown considerably high in terms of recognition rate and storage space by storing train images in compressed domain and selecting significant features from superset of feature vectors for actual recognition.
Papers and Debates on the Economics and Costs of Distance and Online Learning

In the last few years, learners' and parents' interests in distance education were enhanced dramatically as a result of changes in society and advances in audio-visual media and telecommunication technology, which in turn resulted in an increase in both access and the subject areas offered by distance education institutions. In response to this interest, distance education has become one of the formal means of education for those who are unable to attend traditional campus due to cultural, economic, physical, or geographical obstacles.
Network Reliability and Resiliency in Next Generation Networks at Physical, Datalink, and Network Layers

The “Next Generation Network”(NGN)will replace today’s separate networks for telephone and data. It is expected that the NGN will allow the introduction of new services, such as broadcast media transmission and video on demand. A major consideration with the NGN is that it provides an equivalent voice service quality and resiliency as the current telephone network. The analysis carried out for this thesis looked at the physical reliability of the network topology, network resiliency of the most popular candidate protocols at datalink and network layers, and the end-to-end voice performance over an NGN corresponding to the New Zealand network. This showed that the physical layer reliability of the network could surpass the reliability of the telephone network. The results also showed that in a representative ladder-based core network Multi Protocol Label Switching has a much better resiliency than Open Shortest Path First. In a representative tree-based access topology MPLS was found to be superior to Ethernet. The analysis of an end-to-end voice solution over the NGN yielded results which showed that the network complies with the most strict standards and the voice is of current telephone quality provided that packet losses in the NGN are below 1.34 %, which is relatively high to the expected NGN packet loss figures.
Constructing, Refining and Exploiting Rich Linguistic Resources

Linguistic resources, such as corpora, thesauruses, and (machine readable) dictionaries , are important as training data and knowledge sources in Natural Language Processing (NLP). These resources can take various forms. For example, corpora can be annotated with a variety of information; part-of-speech tags, syntax trees, and word sense information; to name a few, or none at all in the case of raw corpora. Recently, the target of natural language processing becomes deeper and deeper, shifting from surface to sense, from morphological analysis to syntactic analysis, then to semantic analysis. Therefore, importance of linguistic resources with rich syntactic and semantic information increases. There are several methods to construct resources, for example, hand-construction, automatic-construction, and semi-automatic-construction. With the increasing the amount of machine-readable data, automatically-constructed resources have become more popular. Generally, automatically-constructed resources are easy to expand and have high topicality, but unfortunately, they are relatively shallowly analyzed and include errors. Moreover, the richer resources we try to construct, the more difficult automatic-construction becomes. On the other hand, hand-construction is both time consuming and costly, but can provide much richer resources. In this thesis, we focus on such rich resources, and describe the methods of constructing , refining and exploiting them. First, we describe the background of our research , and the thesis outline in Chapter 1. Then, in Chapter 2, we introduce the resources related with our research; the Japanese Ontology Goi-Taikei, bilingual valency i (pattern) dictionary, the Hinoki Corpus, and the Lexeed Dictionary. These resources are related to each other, and have been constructed by hand. Then, we propose some methods to extend them effectively (Chapter 3 and 4), and prove their usefulness through several task-based evaluations (Chapter 5 and 6). Finally, in Chapter 7, we reconfirm the importance of studies on constructing, refining and exploiting rich linguistic resources. Acknowledgements I am deeply grateful to Professor Yuji Matumoto of Nara Institute of Science and Technology for his patient support and supervising this thesis. and gave me valuable, constructive and fruitful suggestions and comments. I wish to express my gratitude to NTT Communication Laboratory that gave me a chance to take a doctor's degree. Then, I would like to express my gratitude to people who evaluated translations, annotated corpora, refined resources, and so on. Especially Takayuki Kuribayashi, Tomoko Tanaka (Hirata) and members of NTT-AT and IR-ALT. Finally, I wish to thank my family, my partner Takuma Kawai for his understand-iii ing, …
Effective dithering of sigma-delta modulators

Dithering methods for removing idle channel noise in sigma-delta ( Sigma Delta ) modulators are presented. This noise exists for all types of Sigma Delta modulators. Its structure appears as periodic impulses, the peak levels of which are much higher than their RMS values. The noise is readily apparent in the time domain, but not in the power spectrum. Relatively large dither power is required to remove this noise. Dithering with pseudorandom white noise is effective if the dither signal is shaped according to the quantization noise transfer function of the modulator. This allows the dither power to be relatively high without significantly increasing the noise in the baseband. The minimum dither power required for effectiveness is predominantly a function of the step size of the quantizer. Simulation and experimental results are presented. <<ETX>>
Adaptive real-time publish-subscribe service model for mobile communication environments

With the rapid advances in mobile computing technology, there is increasing demand for disseminating information to large numbers of clients with wireless network. The service model, which supports such mobile communication environments, should be scalable, flexible, and cater to the limited bandwidth of mobile clients while providing real-time guarantees. In this paper, we present high-level design of an adaptive real-time publish-subscribe model for mobile communication environments. To express the model and the underlying work mechanism, we define four primitives: publish, subscribe, activate and deactivate. Furthermore, we discuss how to achieve the adaptability and real-time property in the model. Primary simulation study shows that the service model is feasible and well suited to address the requirements of mobile computing. In conclusion, we identify some open problems and our future work.
Introduction to Geometric Intronization as a Security Technique

†† Summary The intronization is defined as an encryption method, i.e., inserting introns into an exon sequence to obtain ciphertext. Intronization can be used for information hiding, password salting, virus morphing, and an intermediate step of other encryption or hash primitives. Geometric objects can be applied to guide the intronization process. The existence of large number of introns in ciphertext could make frequency-based cryptanalysis difficult.
A structured history for command recall

A history function provides users with access to previously used commands. However, existing history functions are very limited in usability. Two different models and implementations of a structured history function were explored and contrasted. A structured history is based on a mental model of users' interaction with a system. This tool consists of a database of commands previously executed by a user, together with methods for storing and recalling these commands. In the first model all commands are stored, eliminating duplicates and short commands. Retrieval is by pattern matching of several different types, frequency, and time. The second model is a parallel distributed processing (PDP) model that presents the user with a list of likely candidates for good matches to an input string. The PDP history allows for misspellings and retrieves a list of related commands. <<ETX>>
Performance Evaluation of AN-VE: An Error Detection and Correction Code

Several techniques have been proposed and employed to effectively detect and correct errors introduced during message transmission over a communication channel or at the destination domain during storage. Some of these techniques can detect: only single error, all unidirectional errors, only burst errors, any number of zero-to-one bit-flip errors as long as no one-to-zero bit-flip errors occur in the same stream of message bits, errors with known positions, assume a code is correct if the error positions are known or cannot detect errors which appear in the same position in a pair of message codes. Coding techniques that detects and correct errors are more precise at detecting error positions and correcting them, however if more than one error occur, it becomes a challenge to detect all errors and decode correctly. In this paper, the performance of AN-VE is evaluated in comparison with the following coding techniques: Reed-Solomon codes, Hamming codes, and Low-density parity-check codes. An independent design platform is utilized for the implementation via Simulink, which shows a significant reduction in uncorrected errors during message transmission. The efficient performance of AN-VE makes it a more applicable coding technique for telecommunication, data compression and other application.
An approach to creating very large, high resolution artistic printed images

Contemporary printing processes, such as wall and floor graphics, offer artists the potential to create very large-scale pieces. However creating images that exploit both the potential size (say many metres square) AND resolution of the media (say 200 dpi), is very difficult using standard bitmap editing software as both the creative processes involved and file sizes become too cumbersome to manage. We present an approach to this problem that uses a combination of algorithmic techniques to control the generation of such an image as a set of non-repeating, seamlessly tiled sections, and facilitate a high degree of artistic authorship throughout the process. Our approach also necessitates the use of generative techniques, primarily in generating a very high degree of local detail over the entire surface of the image. We also hypothesise a further generative technique for building potentially limitless images at high resolutions. A working example is given.
On the worst data loss behavior in statistical multiplexing

The introduction of QoS requirements into high-speed networks poses many technical challenges to network architects, for communication services usually request guarantees of performance bounds in a network. In the paper, the authors investigate the worst data loss behavior in a statistical multiplexer with limited buffer capacity. They evaluate the upper bounds on probabilities of buffer overflow in a multiplexer, as well as data loss of an input traffic stream. They found that simply controlling the utilization of a multiplexer does not improve the ability to guarantee performance. Indeed, these two performance parameters depend only on the available buffer capacity and the degree of correlation among the input traffic.
A survey of parallel local search methods application in scheduling and logistics

The main issue considered in the paper is concerned with solving difficult optimization problems in parallel calculating environments, such as multiprocessor computers, clusters or distributed calculation nodes in networks, by applying algorithms which use various parallelization technologies. Strongly sequential character of the scheduling algorithms is considered to be the main obstacle in designing sufficiently effective parallel algorithms. On the one hand, up till now sequential algorithms exhausted the possibilities of significant growth in the power of solution methods. On the other hand, parallel computations offer essential advantages of solving difficult problems of discrete optimization, pushing towards theory, methodology and engineering of solution algorithms.
Book Reviews: Putting Linguistics into Speech Recognition: The Regulus Grammar Compiler, by Manny Rayner, Beth Ann Hockey, and Pierette Bouillon

Most computer programs that analyze spoken dialogue use a spoken command grammar, which limits what the user can say when talking to the system. To make this process simpler, more automated, and effective for command grammars even at initial stages of a project, the Regulus grammar compiler was developed by a consortium of experts including NASA scientists. This book presents a complete description of both the practical and theoretical aspects of Regulus and will be extremely helpful for students and scholars working in computational linguistics as well as software engineering. "
Simulated annealing for the unit commitment problem

Due to their efficiency and their interesting design and implementation features, metaheuristics have been used for a long time with success, in dealing with combinatorial problems. They have been applied to the unit commitment problem with rather interesting results that justify further research in the area. In this paper we present a simulated annealing approach to the unit commitment problem. Two coding schemes are compared, new neighbourhood structures are presented and some searching strategies are discussed. Preliminary computational experience, performed on some test instances, shows that this approach is flexible, effective and able to handle variations on the problem structure.
The autoregressive backpropagation algorithm

Describes an extension to error backpropagation that allows the nodes in a neural network to encode state information in an autoregressive 'memory'. This neural model gives such networks the ability to learn to recognize sequences and context-sensitive patterns. Building upon the work of A. Wieland (1990) concerning nodes with a single feedback connection, the authors generalize the method to n feedback connections and address stability issues. The learning algorithm is derived, and a few applications are presented. <<ETX>>
Appearance reproduction of high‐dynamic‐range video based on human visual models

In this paper, we propose a method for improving image quality in order to match precisely the appearances of recorded video sequences with those of real scenes. Captured video and still images by cameras often have saturated and underexposed areas due to their limited dynamic range. Therefore, it is required to acquire images with a wide dynamic range and much tone data for the accurate reproduction of appearances. In addition, it is important to apply color reproduction processing based on human visual models to recorded videos because the appearances between the videos and real scenes differ due to the characteristics of human vision. In our method, a photometric high-dynamic-range (PHDR) video is generated by using a recorded video sequence and metadata of a camera such as the sensitivity (speed), aperture, and shutter speed. The PHDR video consists of the values of high-dynamic-range tone and absolute luminance. After the generation of a PHDR video, the video is processed by using color reproduction techniques based on spatiotemporal visual adaptation models for the accurate reproduction of appearances. Our results show that the proposed method reproduces fine appearance of videos which is the close appearance of real scenes. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(11): 55–64, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20403
Normally-off PLED (Planar Localised Electron Device) for non-volatile memory

An advanced Planar Localised Electron Device (PLED) is presented for use as a non-volatile and high-speed random access memory with very low power consumption. A new tunnel barrier configuration is introduced to achieve both write time shorter than 1.0 nsec and retention time over 10 years. An operation scheme based on extremely high ON/OFF current ratios is demonstrated for the first time by conducting numerical simulation of tunnel currents.
TIME SERIES PREDICTION USING KNN ALGORITHMS VIA EUCLIDIAN DISTANCE FUNCTION: A CASE OF FOREIGN EXCHANGE RATE PREDICTION

International transactions are usually settled in the near future. Exchange rate forecasts are necessary to evaluate the foreign denominated cash flows involved in international transactions. Thus, exchange rate forecasting is very important to evaluate the benefits and risks attached to the international business environment. A forecast represents an expectation about a future value or values of a variable. In this research paper, Researchers use technique known as KNN which belongs to Machine learning subfield of Artificial intelligence. Here researchers develop an experimental setup to predict the value of USD in term of INR for the next day. The MATLAB is used as the developing tool. The interesting results so obtained are presented here.