ppxscal/embedding_network huggingface dataset:
Evaluation of the damage in the vault and portico of the pre-Romanesque chapel of San Salvador de Valdediós using frictional contacts and the finite-element method
Authors: J. J. Del Coz Díaz, P. J. García Nieto, A. Lozano Martínez-Luengas, F. P. álvarez Rabanal
Venue: International Journal of Computer Mathematics (2007)

Monuments are by definition unique buildings which cannot be reduced to any standard structural scheme. In this study, we have used quasi-static loads, which is common practice in many finite-element (FEM) analyses of masonry structures. Thus it is difficult to evaluate their reliability, because in addition to the many uncertainties that exist in all 'old' buildings, no statistics on the behaviour of similar buildings are available. In this paper we describe a study of the structure of the chapel of San Salvador de Valdediós and proposals for its restoration. The non-linear analysis is based on the application of FEM to each of the stone blocks in this ancient structure. The blocks are assembled side by side using 'contact elements' in order to reproduce the mechanical behaviour of the mortar and the surface conditions of the blocks, some of which are seriously damaged. A clear understanding of the structural behaviour, based on sophisticated analysis tools, can reduce the extent of the remedial measures necessary for the restoration of the chapel vault and portico. In this case, severe damage to the chapel vault has affected the portico, resulting in the possibility of a structural collapse. Finally, based on the numerical results obtained for different load cases and hypotheses, we propose a solution for the repair of this part of the chapel using either traditional materials or compatible substitutes.
An auto-indexing method for Arabic text
Authors: Nashat Mansour, Ramzi A. Haraty, Walid Daher, Manal Houri
Venue: Information Processing and Management: an International Journal (2008)

This work addresses the information retrieval problem of auto-indexing Arabic documents. Auto-indexing a text document refers to automatically extracting words that are suitable for building an index for the document. In this paper, we propose an auto-indexing method for Arabic text documents. This method is mainly based on morphological analysis and on a technique for assigning weights to words. The morphological analysis uses a number of grammatical rules to extract stem words that become candidate index words. The weight assignment technique computes weights for these words relative to the container document. The weight is based on how spread is the word in a document and not only on its rate of occurrence. The candidate index words are then sorted in descending order by weight so that information retrievers can select the more important index words. We empirically verify the usefulness of our method using several examples. For these examples, we obtained an average recall of 46% and an average precision of 64%.
Dynamic half-space reporting, geometric optimization, and minimum spanning trees
Authors: P. K. Agarwal
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, they obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, diameter, and Euclidean minimum spanning tree.
A variable parameters linear programming method and its application in power system
Authors: Zhou Jian, Jiang Chuanwen, Wang Chengmin, Song Yufei, Wang Yu, Chen Xi
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The linear programming method has widely applied in practice engineering due to universality in the mathematical model and validity in the simplex method. While constants in the constrains partly changed with variable coefficients in the objective function, it is improved effect that using a new search technology to solve the changed parameters linear programming problem. This technology is used in economic operation of electric power system.
Algebraic property testing: the role of invariance
Authors: Tali Kaufman, Madhu Sudan
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We argue that the symmetries of a property being tested play a central role in property testing. We support this assertion in the context of algebraic functions, by examining properties of functions mapping a vector space Kn over a field K to a subfield F. We consider (F-)linear properties that are invariant under linear transformations of the domain and prove that an O(1)-local "characterization" is a necessary and sufficient condition for O(1)-local testability. when |K| = O(1). (A local characterization of a property is a definition of a property in terms of local constraints satisfied by functions exhibiting a property.) For the subclass of properties that are invariant under affine transformations of the domain, we prove that the existence of a single O(1)-local constraint implies O(1)-local testability. These results generalize and extend the class of algebraic properties, most notably linearity and low-degree-ness, that were previously known to be testable. In particular, the extensions include properties satisfied by functions of degree linear in n that turn out to be O(1)-locally testable. Our results are proved by introducing a new notion that we term "formal characterizations". Roughly this corresponds to characterizations that are given by a single local constraint and its permutations under linear transformations of the domain. Our main testing result shows that local formal characterizations essentially imply local testability. We then investigate properties that are linear-invariant and attempt to understand their local formal characterizability. Our results here give coarse upper and lower bounds on the locality of constraints and characterizations for linear-invariant properties in terms of some structural parameters of the property we introduce. The lower bounds rule out any characterization, while the upper bounds give formal characterizations. Combining the two gives a test for all linear-invariant properties with local characterizations. We believe that invariance of properties is a very interesting notion to study in the context of property testing in general and merits a systematic study. In particular, the class of linear-invariant and affine-invariant properties exhibits a rich variety among algebraic properties and offer better intuition about algebraic properties than the more limited class of low-degree functions.
Integrating biological data via semantic technologies
Authors: Marta González
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

This paper describes a project, currently in execution, where ROBOTIKER is researching on different and innovative ways to handle biological data repositories by means of semantic and artificial intelligence technologies such as ontologies, intelligent agents, semantic grid, etc. The human genome sequencing has given rise to a great number of biological data repositories that once analyzed will be very essential for the study of diseases, pharmaceutical research, new treatments and for the development of new bio products.
Wireless Sensor Network for Localized Maritime Monitoring
Authors: Pedro N. E. S. Barbosa, Neil M. White, Nick R. Harris
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we propose a novel routing algorithm for maritime monitoring of short term events where large area monitoring relies on small buoys drifting along with local currents. The objective of this algorithm is to improve communication where scalable mobile networks are optimized by taking into consideration a weight function based on remaining energy and relative distance between buoys. To improve wide area communication, amplified transmitters were selected. Therefore route optimization requires a different approach, as transmission requires more power than reception. We present two new approaches for message routing, where relay selection depends on a weight advertised periodically, and calculated through remaining energy and route distance to sink. The first approach uses a single route, while the second approach balances its load by using different routes selected in proportion to route weight. In both cases, the algorithms show improvements over singlehop and greedy approaches. Moreover, the second solution shows a more efficient message distribution through relay nodes that ultimately results in lower latency.
A note on the /spl theta/ number of Lovasz and the generalized Delsarte bound
Authors: M. Szegedy
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

The /spl theta/ number of Lovasz and the /spl theta//sub 1/2/ of Schrijver, McEliece, Rodemich and Rumsey are convex (semidefinite) programming upper bounds on /spl alpha/(G), the size of a maximal independent set of G. It is known that /spl alpha/(G)/spl les//spl theta//sub 1/2/(G)/spl les//spl theta/(G)/spl les//spl chi/~(G), where /spl chi/~(G) is the clique cover number of G. The above inequalities suggest that perhaps /spl theta//sub 1/2/(G) approximates /spl alpha/(G) from above, and /spl theta/(G) approximates /spl chi/~(G) from below for every graph G. Can this approximation be to within a factor of at most n/sup 1-/spl epsiv// for some fixed /spl epsiv/>0? We show, that the following three conjectures are equivalent: 1. /spl exist//spl epsiv/>0 : /spl theta/(G) approximates /spl alpha/(G) for every G within a factor of n/sup n-/spl epsiv// 2. /spl exist//spl epsiv/>0 : /spl theta/(G) approximates /spl chi/~(G) for every G within a factor of n/sup n-/spl epsiv// 3. /spl exist//spl epsiv/>0 : /spl theta//sub 1/2/(G) approximates /spl alpha/(G) for every G within a factor of n/sup n-/spl epsiv// It is not impossible that /spl theta//sub 1/2/ approximates /spl chi/~(G), but the latter conjecture looks strictly stronger than 1-3. We give however a simple combinatorial reformulation of this one (we cannot find such for 1-3). We rule out some likely candidates for counterexamples to 1-3 by showing that /spl theta/(G) approximates /spl alpha/(G) and /spl chi/~(G) for those graphs G that come from the Hamming scheme.
Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2m)
Authors: I. M. Boyarinov
Venue: Problems of Information Transmission (2008)

We consider problems of detecting errors in combinational circuits and algorithms for the decoding of linear codes. We show that a totally self-checking combinatorial circuit for the decoding of a binary Hamming [n, k] code can be constructed if and only if n = 2 r ¿ 1, r = n¿k. We introduce the notion of a totally self-checking combinational circuit detecting error clusters of size at most µ; for shortened Hamming [n,k] codes, we construct totally self-checking decoding combinational circuits detecting error clusters of size at most µ, 2 ¿ µ < n¿k. We describe single-error protected and self-checking algorithms: the extended Euclidean algorithm and decoding algorithms for binary BCH codes and Reed-Solomon codes over GF(2 m ).
Tag interoperability in cultural web-based applications
Authors: Federica Cena, Francesca Carmagnola, Omar Cortassa, Cristina Gena, Yiwen Wang, Natalia Stash, Lora Aroyo
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

This paper presents an approach that shows how user interaction data (tags) generated by one application can be exploited by another one in similar domain for integrating user models in distributed and interactive environments. In particular we discuss the tags interoperability among two adaptive systems into the cultural heritage domain.
A knowledge-based architecture for implementing collaborative problem-solving methods in military e-training
Authors: Shu-Hsien Liao, Yen-Ping Ho
Venue: Expert Systems with Applications: An International Journal (2008)

E-learning systems provide a variety of instructional aids and communication methods, and offer learners great flexibility as to the time and place of instruction. Given these advantages, it is not surprising that business and educational institutions are making substantial investments in e-learning systems. In military, the military scenario is a tool or environment that supports the classroom training in collaborative decision-making and problem solving. It offers a method to train officers by simulating battlefield situations to analyze situations, generate plans, make decision, and acquire knowledge and experience from the scenario training procedure. This article is an example on implementing a military e-training system on military training institute in the Taiwanese Military. For this, this paper proposes a knowledge-based system architecture that incorporates the functions of military training materials, scenario case base, database, and geographical information systems (GIS) in terms of integrating web-based and collaborative problem solving methods in military collaborative scenario training. A scenario case is presented as an example of system implementation and some issue discussion are also described.
Real-time cooperating motion generation for man-machine systems and its application to medical technology
Authors: Fumi Seto, Yasuhisa Hirata, Kazuhiro Kosuge
Venue: Technology and Health Care (2007)

In this paper, we propose a cooperating motion generation method for man-machine cooperation systems in which the machines are controlled based on the intentional force applied by a human/humans for realizing several tasks in cooperation with a human/humans. By applying this method, the systems could avoid self-collisions, collisions with obstacles and other dangerous situations during the tasks. Proposed method consists of two parts; representation method of robots' body referred to as "RoBE (Representation of Body by Elastic elements)", and cooperating motion generation method using RoBE. As the application examples of proposed method, we focused on robots cooperating with a human/humans and surgery robot tools from the aspect of medical and welfare field. We did the experiments using human-friendly robot, referred to as MR Helper, for illustrating the validity of the proposed method. We also did the computer simulation to indicate the prospects of applications of our self-collision avoidance method to surgery robot tools.
Accuracy of Laplace approximation for discrete response mixed models
Authors: Harry Joe
Venue: Computational Statistics Data Analysis (2008)

The Laplace approximation is amongst the computational methods used for estimation in generalized linear mixed models. It is computationally the fastest, but there hasn't been a clear analysis of when its accuracy is adequate. In this paper, for a few factors we do calculations for a variety of mixed models to show patterns in the asymptotic bias of the estimator based on the maximum of the Laplace approximation of the log-likelihood. The biggest factor for asymptotic bias is the amount of discreteness in the response variable; there is more bias for binary and ordinal responses than for a count response, and more bias for a count response when its support is mainly near 0. When there is bias, the bias decreases as the cluster size increases. Often, the Laplace approximation is adequate even for small cluster sizes. Even with bias, the Laplace approximation may be adequate for quick assessment of competing mixed models with different random effects and covariates.
Spectral broadening of lower extremity venous Doppler signals using STFT and AR modeling
Authors: Sadık Kara, Semra İçer, Nuri Erdogan
Venue: Digital Signal Processing (2008)

This study researches the behaviour of spectral broadening index (SBI) obtained from spectra achived using short-time Fourier transform (STFT) analysis compared to that of SBI based on autoregressive (AR) modeling of clinical Doppler lower extremity vein signal. Doppler signals from 12 healthy subject with eight different physiologic situations were analysed. Sonograms obtained from Doppler signals were used to compare the applied methods in terms of their frequency resolution and their effectiveness for the determination of SBI. The AR based sonograms produced narrower spectra compared to STFT sonograms. Besides, the magnitude of the STFT based SBI was larger than that of the AR based SBI. Furthermore, standard deviations and coefficient of variations of STFT and AR based SBIs changed depending on each physiologic situation. The results of this research have also shown that despite the qualitative improvement in the individual frequency spectra, there was no quantitative advantage in using the AR approach over the STFT for the determination of SBI. Moreover there was also an additional computational complexity income connections with AR modeling.
Automated transistor sizing for FPGA architecture exploration
Authors: Ian Kuon, Jonathan Rose
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The creation of an FPGA requires extensive transistor-level design. This is necessary for both the final design, and during architecture exploration, when many different logic and routing architectures are considered. For such explorations, it is not feasible to spend significant amounts of time on transistor-level design. This paper presents an automated transistor sizing tool for FPGA architecture exploration that uses a two-phased approach - a coarse rapid phase with simple modeling followed by refinement with much more accurate models. The output of the system is a design optimized towards a specific area-delay criterion. We compare the quality of our results to prior manual and partially automated approaches. Also, our tool has been used to produce hundreds of candidate architectures which we are releasing to support future high quality explorations.
Construction and analysis of educational tests using abductive machine learning
Authors: El-Sayed M. El-Alfy, Radwan E. Abdel-Aal
Venue: Computers Education (2008)

Recent advances in educational technologies and the wide-spread use of computers in schools have fueled innovations in test construction and analysis. As the measurement accuracy of a test depends on the quality of the items it includes, item selection procedures play a central role in this process. Mathematical programming and the item response theory (IRT) are often used in automating this task. However, when the item bank is very large, the number of item combinations increases exponentially and item selection becomes more tedious. To alleviate the computational complexity, researchers have previously applied heuristic search and machine learning approaches, including neural networks, to solve similar problems. This paper proposes a novel approach that uses abductive network modeling to automatically identify the most-informative subset of test items that can be used to effectively assess the examinees without seriously degrading accuracy. Abductive machine learning automatically selects only effective model inputs and builds an optimal network model of polynomial functional nodes that minimizes a predicted squared error criterion. Using a training dataset of 1500 cases (examinees) and 45 test items, the proposed approach automatically selected only 12 items which classified an evaluation population of 500 cases with 91% accuracy. Performance is examined for various levels of model complexity and compared with that of statistical IRT-based techniques. Results indicate that the proposed approach significantly reduces the number of test items required while maintaining acceptable test quality.
Towards Robust Low Cost Authentication for Pervasive Devices
Authors: Erdinç Öztürk, Ghaith Hammouri, Berk Sunar
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footprint limitations of such networks, prevent us from employing standard cryptographic techniques for authentication which were originally designed to secure high end systems with abundant power. Furthermore, the sharp increase in the number, diversity and strength of physical attacks which directly target the implementation may have devastating consequences in a network setting creating a single point of failure. A compromised node may leak a master key, or may give the attacker an opportunity for injecting faulty messages. In this paper we present a lightweight challenge response authentication scheme based on noisy physical unclonable functions (PUF) that allows for extremely efficient implementations. Furthermore, the inherent properties of PUFs provide cryptographically strong tamper resilience. In a network setting this means that a tampered device will no longer authenticate and in a sense will be isolated from the network.
Generalized instruction selection using SSA-graphs
Authors: Dietmar Ebner, Florian Brandner, Bernhard Scholz, Andreas Krall, Peter Wiedermann, Albrecht Kadlec
Venue: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems (2008)

Instruction selection is a well-studied compiler phase that translates the compiler's intermediate representation of programs to a sequence of target-dependent machine instructions optimizing for various compiler objectives (e.g. speed and space). Most existing instruction selection techniques are limited to the scope of a single statement or a basic block and cannot cope with irregular instruction sets that are frequently found in embedded systems. We consider an optimal technique for instruction selection that uses Static Single Assignment (SSA) graphs as an intermediate representation of programs and employs the Partitioned Boolean Quadratic Problem (PBQP) for finding an optimal instruction selection. While existing approaches are limited to instruction patterns that can be expressed in a simple tree structure, we consider complex patterns producing multiple results at the same time including pre/post increment addressing modes, div-mod instructions, and SIMD extensions frequently found in embedded systems. Although both instruction selection on SSA-graphs and PBQP are known to be NP-complete, the problem can be solved efficiently - even for very large instances. Our approach has been implemented in LLVM for an embedded ARMv5 architecture. Extensive experiments show speedups of up to 57% on typical DSP kernels and up to 10% on SPECINT 2000 and MiBench benchmarks. All of the test programs could be compiled within less than half a minute using a heuristic PBQP solver that solves 99.83% of all instances optimally.
The use of online digital resources and educational digital libraries in higher education
Authors: Flora McMartin, Ellen Iverson, Alan Wolf, Joshua Morrill, Glenda Morgan, Cathryn Manduca
Venue: International Journal on Digital Libraries (2008)

This paper summarizes results from a national survey of 4,678 respondents, representing 119 institutions of higher education in the United States regarding their use of digital resources for scholarly purposes. This paper presents the following results: (1) demographics commonly used in higher education to categorize populations such as institution type or level of teaching experience could not reliably predict use of online digital resources, (2) valuing online digital resources corresponds with only higher levels of use for certain types of digital resources, (3) lack of time was a significant barrier to use of materials while, paradoxically, respondents indicated that they used them because they save time, (4) respondents did not tend to intentionally look to the Internet as a trusted resource for learning about teaching.