ppxscal/embedding_network huggingface dataset:
Distributed hybrid-storage partially mountable file system
Authors: Alexandru Radovici, Elena Simona Apostol
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

We have extended the classical approach of a disk partition to a distributed environment. In this way, ? NetFS partition is composed out of several storage fs_nodes that are stored on different type of media and/or computer systems. The file system can be partially mounted, meaning that mounting can be done using only a subset of the fs_nodes. Due to the design of this kind of system, a partition can be dynamically extended or shrunk while it is mounted without any data loss. Our paper presents the implementation of this file system using FUSE (which in term offers some advantages - usage of library functions, stability, portability), the problems encountered and some future work yet to be done.
On the reliability of large-scale distributed systems - A topological view
Authors: Yuan He, Hao Ren, Yunhao Liu, Baijian Yang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

In large-scale, self-organized distributed systems, such as peer-to-peer (P2P) overlays and wireless sensor networks (WSN), a small proportion of the nodes are likely to be more critical to the system's reliability than others. This paper focuses on detecting cut vertices so that we can either neutralize or protect these critical nodes. Detection of cut vertices is trivial if the global knowledge of the whole system is known but it is very challenging when the global knowledge is not available. In this paper, we propose a completely distributed scheme where every single node can determine whether it is a cut vertex or not. In addition, our design can also confine the detection overhead to a constant instead of being proportional to the size of a network. The correctness of this algorithm is theoretically proved and the key performance gains are measured and verified through trace-driven simulations.
New approaches in radar waveform design
Authors: Irina Gladkova
Venue:  (2008)

In this work we discuss two problems that appear in modern radar waveform design. First, we propose a new approach to one of the most challenging problems in this area of research - the construction of waveforms with optimal ambiguity characteristics in a chosen a priori region surrounding the main lobe. Our approach is based on the projection of the signal onto an appropriate orthonormal basis in the space of radar waveforms and approximating the signal with desired ambiguity properties by a finite number of basis waveforms. In particular, we consider well-known Hermite waveforms as the basis functions and discuss the problem of minimizing the volume under the ambiguity surface over a certain given region.The second part of the dissertation is devoted to the problem of the range side- lobe suppression in stepped-frequency LFM pulse trains. Frequency stepping is one of the known techniques employed by modern radars to achieve high range resolution. The main advantage of this approach is that the instantaneous bandwidth of a radar is quite small compared with the total processing bandwidth. This allows the transmission of waveforms with extremely wide overall bandwidth (and, as a consequence, the attainment of high range resolution) without the usage of the expensive hardware needed to support the wide instantaneous bandwidth. We present a systematic approach for designing pulse trains producing the autocorrelation function whose sidelobes are less than some predetermined level.
Towards a dynamic-update-enabled JVM
Authors: Allan Raundahl Gregersen, Douglas Simon, Bo Nørregaard Jørgensen
Venue: Proceedings of the Workshop on AOP and Meta-Data for Software Evolution (2009)

This paper advocates that de facto dynamic updates of Java applications will eventually require a dynamic-update-enabled Java virtual machine. We argue that our approach for dynamic updates of component-based Java applications complements the new module system planned for upcoming Java releases. We conclude that simple extensions to an existing JVM can bring full flexibility and transparency to dynamic updates in Java.
Spatio-Temporal Scene Analysis Based on Graph Algorithms to Determine Rigid and Articulated Objects
Authors: Stephan Kieneke, Markus Steffens, Dominik Aufderheide, Werner Krybus, Christine Kohring, Danny Morton
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

We propose a novel framework in the context of structure and motion for representing and analyzing three-dimensional motions particularly for human heads and faces. They are captured via a stereo camera system and a scene graph is constructed that contains low and high-level vision information. It represents and describes the observed scene of each frame. By creating graphs of successive frames it is possible to match, track and segment main important features and objects as a structure of each scene and reconstruct these features into the three dimensional space. The cue-processor extracts feature information like 2D- and 3D-position, velocity, age, neighborhood, condition, or relationship among features that are stored in the vertices and weights of the graph to improve the estimation and detection of the features and/or objects in the continuous frames. The structure and change of the graph leads to a robust determination and analysis of changes in the scene and to segment and determine these changes even for temporal and partial occluded objects over a long image sequence.
Weighted inequalities with Holder norms of solutions to Lu=divf in non-smooth domains
Authors: Caroline Sweezy
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

The rate of change of a solution to Lu=divf→ in a bounded, non-smooth domain Ω in Rd, d ≥ 3, u=0 on ∂Ω, is investigated using a local Hölder norm of u and different measures on Ω. Results for L = Σij-1d ∂/∂xi(aij(x)∂/∂xj are presented.
SoundSense: scalable sound sensing for people-centric applications on mobile phones
Authors: Hong Lu, Wei Pan, Nicholas D. Lane, Tanzeem Choudhury, Andrew T. Campbell
Venue: Proceedings of the 7th international conference on Mobile systems, applications, and services (2009)

Top end mobile phones include a number of specialized (e.g., accelerometer, compass, GPS) and general purpose sensors (e.g., microphone, camera) that enable new people-centric sensing applications. Perhaps the most ubiquitous and unexploited sensor on mobile phones is the microphone - a powerful sensor that is capable of making sophisticated inferences about human activity, location, and social events from sound. In this paper, we exploit this untapped sensor not in the context of human communications but as an enabler of new sensing applications. We propose SoundSense, a scalable framework for modeling sound events on mobile phones. SoundSense is implemented on the Apple iPhone and represents the first general purpose sound sensing system specifically designed to work on resource limited phones. The architecture and algorithms are designed for scalability and Soundsense uses a combination of supervised and unsupervised learning techniques to classify both general sound types (e.g., music, voice) and discover novel sound events specific to individual users. The system runs solely on the mobile phone with no back-end interactions. Through implementation and evaluation of two proof of concept people-centric sensing applications, we demostrate that SoundSense is capable of recognizing meaningful sound events that occur in users' everyday lives.
Monte Carlo simulation for quantification of light transport features in apples
Authors: Jianwei Qin, Renfu Lu
Venue: Computers and Electronics in Agriculture (2009)

Light interaction with turbid biological materials involves absorption and scattering. Quantitative understanding of light transport process and features in the fruit is critical to designing better optical systems for inspection of food quality. This paper reports on the quantification of light transport in the apple fruit in the visible and short-wavelength near-infrared region using Monte Carlo simulations. The absorption and reduced scattering coefficients (@m"a and @m^'"s, respectively) of 600 'Golden Delicious' apples were determined over the spectral range of 500-1000nm using a spatially resolved hyperspectral imaging method coupled with a diffusion theory model. The @m"a and @m^'"s values were used in Monte Carlo (MC) models to simulate light transport in the fruit tissue. MC simulation models were validated against the diffusion theory model and experimental data. The patterns of diffuse reflectance, internal absorption, and light penetration depth were determined using typical values of @m"a and @m^'"s for the apples. Simulation results showed that up to 96.4% of the photons were absorbed under the maximum absorption condition, while 75.9% photons exited as diffuse reflectance for the maximum scattering case. The optimum sensing range under our imaging system setup was found to be 1-11mm for 'Golden Delicious' apples. Fruit tissue with a larger @m"a value absorbed light energy rapidly in short depth and radial distances, whereas light in the tissue with small @m^'"s values tended to propagate forward to the deeper area of the sample. Light penetration depths in 'Golden Delicious' apples, defined as the depths at which the incident light was reduced by 99%, were in the range of 0.43-8.67cm over the 500-1000nm spectral range, with a majority of the samples (approximately 68%) in the range of 0.81-4.48cm. Pigments and water in the fruit tissue greatly influenced light penetration depth.
Integrated morphological and syntactic disambiguation for Modern Hebrew
Authors: Reut Tsarfaty
Venue: Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop (2006)

Current parsing models are not immediately applicable for languages that exhibit strong interaction between morphology and syntax, e.g., Modern Hebrew (MH), Arabic and other Semitic languages. This work represents a first attempt at modeling morphological-syntactic interaction in a generative probabilistic framework to allow for MH parsing. We show that morphological information selected in tandem with syntactic categories is instrumental for parsing Semitic languages. We further show that redundant morphological information helps syntactic disambiguation.
INSPIRED broadening participation: first year experience and lessons learned
Authors: Peggy Doerschuk, Jiangjiang Liu, Judith Mann
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

The Increasing Student Participation in Research Development Program ('INSPIRED') is designed to increase participation of women and underrepresented minorities in computing. It is a comprehensive program whose goals are to attract, retain and transition these students into careers or advanced study in computing. This paper focuses on the program's first year experience, including the results of a formal assessment of the program's effectiveness. It describes the strategies used to attain the goals and the rationale for using these strategies. It also includes lessons learned for the benefit of those who are considering adopting these strategies at their institutions.
Multi-object tracking via particle sampling and enhanced probabilistic data association for event detection in intelligent video systems
Authors: Jenq-Neng Hwang
Venue:  (2008)

This dissertation presents a system framework that can automatically and robustly track multiple targets in video-based event detection applications. Combining the advantages of both the flexibility of particle sampling and mathematical tractability of Kalman filter, the tracking framework achieves both high tracking accuracy and computational simplicity. The system can distinguish occlusion and segmentation error cases and resolve those cases by constructing measurement candidates via particle sampling and an enhanced version of Probabilistic Data Association (PDA) for updating of filters. Despite the misleading information extracted from the segmentation mask when occlusion or segmentation error occurs, our proposed measurement candidate list construction procedure and enhanced PDA are still able to accurately associate correct measurements to each target at the update phase of filtering. Also, we integrate the initial occlusion handling module in the tracking system to backtrack and correct the object trajectories when initial occlusion cases are detected. The reliable tracking results can serve as the foundation for automatic event detection in intelligent surveillance systems. We also demonstrate some examples of event detection in both traffic monitoring and human surveillance applications by classifying the trajectories of the tracked objects with Hidden Markov Models (HMMs). The experimental results have shown that the proposed tracking mechanism can solve the occlusion and segmentation error problems effectively and the events can be detected with high accuracy.
Identification of non-linear systems, based on neural networks, with applications at fuzzy systems
Authors: Constantin Volosencu
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

The paper presents a short review how to use feedforward neural networks for non-linear system identification, with application at the neural implementation of a fuzzy system. In this application the input-output transfer characteristics of the fuzzy system are used to evaluate the accuracy of the identification results expressed for a neuro-fuzzy model. This method could be used for identification of the most general fuzzy systems, which are non-linear systems, being developed with all kind of fuzzyfication methods, rule bases, inference methods and defuzzification methods. Using this method, accurate neural models for a large class of fuzzy systems may be obtained. The neuro-fuzzy model preserves all the properties of the fuzzy systems: the values of the transfer gain and the sector property. The neuro-fuzzy model obtained by identification is useful in all applications of the fuzzy systems, for example in control. Good values of the quality neural identification criteria are obtained. The optimized neuro-fuzzy model is given by its structure, weights and biases, related to the most adequate training method.
Multi-word term extraction for Bulgarian
Authors: Svetla Koeva
Venue: Proceedings of the Workshop on Balto-Slavonic Natural Language Processing: Information Extraction and Enabling Technologies (2007)

The goal of this paper is to compile a method for multi-word term extraction, taking into account both the linguistic properties of Bulgarian terms and their statistical rates. The method relies on the extraction of term candidates matching given syntactic patterns followed by statistical (by means of Log-likelihood ratio) and linguistically (by means of inflectional clustering) based filtering aimed at improving the coverage and the precision of multi-word term extraction.
Universality of R-automata with Value Copying
Authors: Parosh Aziz Abdulla, Pavel Krcal, Wang Yi
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a constant D such that all words are accepted by some run along which no counter exceeds D. It has been shown in [Parosh Abdulla, Pavel Krcal, and Wang Yi. R-automata. In Proc. of CONCUR'08., volume 5201 of LNCS, pages 67-81. Springer, 2008] that this question is decidable. In this paper, we add one more operation to R-automata, namely the operation which can copy the value of a counter into another one. The result of this paper is a reduction of the universality problem for R-automata with value copying to universality of R-automata, thus rendering the problem decidable. The reduction replaces copy operations by non-deterministic resets together with a mechanism ensuring that the number of such replacements is bounded between each two resets of a value.
Industrial Connection Analysis and Case Study Based on Theory of Industrial Gradient
Authors: Zhi Yang, Wei Zeng, Hongtao Zhou, Ying Li, Qi Fei
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

The difference and imbalance of regional economic development is an objective fact existed in the process of the socio-economic development. Giving an example of Wuhan city circle, the paper calculates and analyzes industrial gradient based on theory of industrial gradient. According to the characteristics of industries, the relevant industrial connection patterns are proposed, which provides the theoretical foundation for making development policy of regional industries.
Electronic structure of bulk and defect α- and γ-Al2O3
Authors: T. V. Perevalov, A. V. Shaposhnikov, V. A. Gritsenko
Venue: Microelectronic Engineering (2009)

Electronic structure of bulk and oxygen vacancies of high-k dielectric Al"2O"3 (@a- and @c- phases) was calculated from the first principles. It was found, that oxygen vacancy can be both electron and hole trap in @a- and @c-Al"2O"3. High leakage current trough thin films of Al"2O"3 can be caused by oxygen vacancies.
Piecewise-stationary bandit problems with side observations
Authors: Jia Yuan Yu, Shie Mannor
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We consider a sequential decision problem where the rewards are generated by a piecewise-stationary distribution. However, the different reward distributions are unknown and may change at unknown instants. Our approach uses a limited number of side observations on past rewards, but does not require prior knowledge of the frequency of changes. In spite of the adversarial nature of the reward process, we provide an algorithm whose regret, with respect to the baseline with perfect knowledge of the distributions and the changes, is O(k log(T)), where k is the number of changes up to time T. This is in contrast to the case where side observations are not available, and where the regret is at least &Omega;(&radic;T).
40 Years of Progress in Automatic Speaker Recognition
Authors: Sadaoki Furui
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Research in automatic speaker recognition has now spanned four decades. This paper surveys the major themes and advances made in the past 40 years of research so as to provide a technological perspective and an appreciation of the fundamental progress that has been accomplished in this important area of speech-based human biometrics. Although many techniques have been developed, many challenges have yet to be overcome before we can achieve the ultimate goal of creating human-like machines. Such a machine needs to be able to deliver satisfactory performance under a broad range of operating conditions. A much greater understanding of the human speech process is still required before automatic speaker recognition systems can approach human performance.
OPC Client for Data Management of Incompatible Automation Equipments
Authors: Bok-Keun Sun, Kwang-Min Lee, Je Ryu, Kwang-Rok Han
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

Servers and application devices based on OPC protocol are extending their areas in industrial automation. However, interoperability with legacy systems causes problems in introducing new systems. Thus, the present study purposed to design a system that enables the selection and the operation of OPC systems actively while allowing the use of legacy systems as they are. In addition, this study will design a standardized structure of information collected when using OPC protocol and, for this, use not only OPC-DA but also OPC-XMLDA to integrate data.
Model-Based Diagnosis of Discrete Event Systems with an Incomplete System Model
Authors: Xiangfu Zhao, Dantong Ouyang
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Model-based diagnosis of discrete event systems (DESs) is more and more active in artificial intelligence. However, there has been always a very restrictive assumption in the previous works that the model of a given DES is complete, including all nominal behaviors and all possible failure behaviors of the system. In order to relax this so restrictive assumption, in this paper, model-based diagnosis of a DES with an incomplete system model is investigated. A new concept of “P-synchronization product” of finite state automata is proposed, by which the P-diagnosis of the DES with an incomplete system model is easily put forward. It is also shown that the traditional synchronization product of finite state automata can be seen as a special situation of P-synchronization product. In addition, an ideal heuristic way from theoretical view to improve the P-synchronization product is discussed as well.
Bridging Knowledge Gaps in Engineering Companies-The Case of Pipeline River Crossings in Greece
Authors: Fragiskos A. Batzias, Philip-Mark P. Spanidis
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

The introduction of Knowledge Management (KM) processes is suggested herein for bridging knowledge gaps observed during long-term and high complexity engineering projects, like the Natural Gas Project (NGP) of Greece, with a view to deploying a dedicated KM system in engineering companies. The model of three essential knowledge management processes (acquisition, maintenance and sharing) is demonstrated, applying the IDEF0 method of functional analysis and design. The functionality of the introduced KM processes has been proved by a case study referring to a pipeline river crossing sub-project.
Progress in Wireless Communications Research
Authors: Alfred P. Martinhoff
Venue:  (2007)

This book includes new and noteworthy advanced research on the following topics: personal portable telephones, multimedia devices, digital assistants, and communicating palmtop computers; registration and handoff protocols, messaging, and communications and computing requirements; network control and management for protocols associated with routing and tracking of mobile users; location-independent numbering plans for movable personal services; personal profiles, personalised traffic filtering, and other database-driven aspects of personal communications; link access technologies and protocols; radio and infrared channel characterisation and other microcell-based personal communication systems; satellite systems and global personal communications; traffic management and performance issues; policy issues in spectrum allocation, industry structure, and technology evolution; applications, case studies, and field experience; and, intelligent vehicle highway systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player