ppxscal/embedding_network huggingface dataset:
Immune system based distributed node and rate selection in wireless sensor networks
Authors: Bariş Atakan, Özgür B. Akan
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of dense deployed sensor nodes. Due to the dense deployment, since sensor observations are spatially correlated with respect to spatial location of sensor nodes, it may not be necessary for every sensor node to transmit its data. Therefore, due to the resource constraints of sensor nodes it is needed to select the minimum number of sensor nodes to transmit the data to the sink. Furthermore, to achieve the application-specific distortion bound at the sink it is also imperative to select the appropriate reporting frequency of sensor nodes to achieve the minimum energy consumption. In order to address these needs, we propose the new Distributed Node and Rate Selection (DNRS) method which is based on the principles of natural immune system. Based on the B-cell stimulation in immune system, DNRS selects the most appropriate sensor nodes that send samples of the observed event, are referred to as designated nodes. The aim of the designated node selection is to meet the event estimation distortion constraint at the sink node with the minimum number of sensor nodes. DNRS enables each sensor node to distributively decide whether it is a designated node or not. In addition, to exploit the temporal correlation in the event data DNRS regulates the reporting frequency rate of each sensor node while meeting the application-specific delay bound at the sink. Based on the immune network principles, DNRS distributively selects the appropriate reporting frequencies of sensor nodes according to the congestion in the forward path and the event estimation distortion periodically calculated at the sink by Adaptive LMS Filter. Performance evaluation shows that DNRS provides the minimum number of designated nodes to reliably detect the event properties and it regulates the reporting frequency of designated nodes to exploit the temporal correlation in the event data whereby it provides the significant energy saving.
Reliable Network-on-Chip Using a Low Cost Unequal Error Protection Code
Authors: Avijit Dutta, Nur A. Touba
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

The network-on-chip (NoC) paradigm is seen as a way of facilitating the integration of a large number of computational and storage blocks on a chip to meet several performance and power constraints. However due to continued scaling of process technologies, the devices and interconnects have become more susceptible to single event upsets. This paper presents a low cost error correcting code based technique to protect NoC routers against single event upset induced soft errors. An unequal protection error correcting code based methodology is provided for the most commonly used store-and-forward routing strategy. The proposed codes have the same check bit overhead as the conventional single error correcting (SEC) code. The encoding/decoding overhead and latency are also similar to the conventional low cost SEC code. The proposed codes belong to the class of unequal error protection codes as they provide different levels of error correction capability for different portions of the same packet with more protection for the important parts of the data.
SQL Extension for Multidatabase System
Authors: Mi-Yeon Kim, Jung-Min Seo, Chang-Joo Moon
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The most important feature of a Multidatabase System (MDBS) is to provide the global schema with integrating various models of Local Database Systems (LDBS). However, it is difficult to integrate local schemas into the global schema due to the difference of the syntactical and semantic expressions of LDBSs. In this paper, we propose the standard SQL extension for MDBS called by Multidatabase Query Language (MQL) 1 . In addition, we analyze semantic conflicts using case studies and provide solutions to the semantic conflicts using MQL.
Robustness of radial basis functions
Authors: Ralf Eickhoff, Ulrich Rückert
Venue: Neurocomputing (2007)

Neural networks are intended to be used in future nanoelectronic technology since these architectures seem to be robust to malfunctioning elements and noise in its inputs and parameters. In this work, the robustness of radial basis function networks is analyzed in order to operate in noisy and unreliable environment. Furthermore, upper bounds on the mean square error under noise contaminated parameters and inputs are determined if the network parameters are constrained. To achieve robuster neural network architectures fundamental methods are introduced to identify sensitive parameters and neurons.
An Overview of Firmware Engineering
Authors: S. Davidson
Venue: Computer (1978)

Firmware engineering, in analogy to software engineering, covers the specification and design of microprograms, construction techniques, debugging, testing, verification, and maintenance. Here is a look at the current state of the art and coming trends.
Matching between telemetric measures and images for mobile robotics
Authors: C. Couverture, C. Rosenberger, G. Mourioux, C. Novales, G. Poisson
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Mobile robotics often uses both cameras and range-finders for applications like environment perception. In this paper, we propose a method to calibrate such sensors to be able to match their respective informations. To do that, we present to the camera and to the rangefinder a test card in several different positions. Once we know the position of this test card in both reference frames of the camera and the rangefinder, we are able to determine the position and orientation of the rangefinder wrt. the camera. Then, we project some laser points from the rangefinder to the image plane of the camera to determine the system precision.
Mutation-crossover isomorphisms and the construction of discriminating functions
Authors: Joseph C. Culberson
Venue: Evolutionary Computation (1994)

We compare the search power of crossover and mutation in genetic algorithms. Our discussion is framed within a model of computation using search space structures induced by these operators. Isomorphisms between the search spaces generated by these operators on small populations are identified and explored. These are closely related to the binary reflected Gray code. Using these we generate discriminating functions that are hard for one operator but easy for the other and show how to transform from one case to the other. We use these functions to provide theoretical evidence that traditional GAs use mutation more effectively than crossover, but dispute claims that mutation is a better search mechanism than crossover. To the contrary, we show that methods that exploit crossover more effectively can be designed and give evidence that these are powerful search mechanisms. Experimental results using GIGA, the Gene Invariant Genetic Algorithm, and the well-known GENESIS program support these theoretical claims. Finally, this paper provides the initial approach to a different method of analysis of GAs that does not depend on schema analysis or the notions of increased allocations of trials to hyperplanes of above-average fitness. Instead it focuses on the search space structure induced by the operators and the effect of a population search using them.
Study on the e-learning grid construction for higher special education
Authors: Li Chun-lian, Sun Yu, Zhuang Shu-fan
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The development status of higher special education is introduced and the necessary of the study on the higher special e-learning based on grid is demonstrated. Then the construction and implementation scheme is presented for colleges to set up e-learning grid on higher special education. It is described from the system constitutes, access model, service database management and resources library design for higher special education grid.
Lifestyle Ubiquitous Gaming: Making Daily Lives More Plesurable
Authors: Tatsuo Nakajima, Vili Lehdonvirta, Eiji Tokunaga, Masaaki Ayabe, Hiroaki Kimura, Yohei Okuda
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper, we propose a novel computer gaming style Lifestyle Ubiquitous Gaming, where our experience is enriched in our daily lives by using gaming concepts. In lifestyle ubiquitous gaming, human daily activities are implicitly tracked and interpreted. Then, the feedback of the activities are returned to a user as a game system' presentation. The user can enjoy the game without too much conscious. This characteristic has a very big difference from traditional gaming. We describe the motivation and conceptual framework of lifestyle ubiquitous gaming, and show two case studies that we have conducted to demonstrate our proposal's feasibility and effectiveness.
Vision-based monitoring of pedestrian crossings
Authors: Alessandra Fascioli, Rean Isabella Fedriga, Stefano Ghidoni
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents a vision-based intelligent pedestrian crossing able to derive information on the occupancy status of its zebra crossing. The detection of pedestrians can help enhancing safety for road users who need longer to cross the road. At the same time, it produces savings in traffic delay. A stereo vision approach is adopted: the difference between two bird's eye views of the crossing is analyzed to extract objects rising up from the road plane. Background subtraction is applied to get rid of noise due to small drifts in the calibration and lens distortion. The discrimination between pedestrians and vehicles is performed taking into account their direction of movement.
Comparing the effectiveness of hits and salsa
Authors: Marc A. Najork
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

This paper compares the effectiveness of two well-known query-dependent link-based ranking algorithms, "Hyperlink-Induced Topic Search" (HITS) and the "Stochastic Approach for Link-Structure Analysis" (SALSA). The two algorithms are evaluated on a very large web graph induced by 463 million crawled web pages and a set of 28,043 queries and 485,656 results labeled by human judges. We employed three different performance measures - mean average precision (MAP), mean reciprocal rank (MRR), and normalized discounted cumulative gain (NDCG). We found that as an isolated feature, SALSA substantially outperforms HITS. This is quite surprising, given that the two algorithms operate over the same neighborhood graph induced by the query result set. We also studied the combination of SALSA and HITS with BM25F, a state-of-the-art text-based scoring function that incorporates anchor text. We found that the combination of SALSA and BM25F outperforms the combination of HITS and BM25F. Finally, we broke down our query set by query specificity, and found that SALSA (and to a lesser extent HITS) is most effective for general queries.
Ribosomal RNA as molecular barcodes
Authors: K. H. Chu, C. P. Li, J. Qi
Venue: Bioinformatics (2006)

Motivation: We explored the feasibility of using unaligned rRNA gene sequences as DNA barcodes, based on correlation analysis of composition vectors (CVs) derived from nucleotide strings. We tested this method with seven rRNA (including 12, 16, 18, 26 and 28S) datasets from a wide variety of organisms (from archaea to tetrapods) at taxonomic levels ranging from class to species. Result: Our results indicate that grouping of taxa based on CV analysis is always in good agreement with the phylogenetic trees generated by traditional approaches, although in some cases the relationships among the higher systemic groups may differ. The effectiveness of our analysis might be related to the length and divergence among sequences in a dataset. Nevertheless, the correct grouping of sequences and accurate assignment of unknown taxa make our analysis a reliable and convenient approach in analyzing unaligned sequence datasets of various rRNAs for barcoding purposes. Availability: The newly designed software (CVTree 1.0) is publicly available at the Composition Vector Tree (CVTree) web server Contact: kahouchu@cuhk.edu.hk
Cross-validation and aggregated EM training for robust parameter estimation
Authors: Takahiro Shinozaki, Mari Ostendorf
Venue: Computer Speech and Language (2008)

A new maximum likelihood training algorithm is proposed that compensates for weaknesses of the EM algorithm by using cross-validation likelihood in the expectation step to avoid overtraining. By using a set of sufficient statistics associated with a partitioning of the training data, as in parallel EM, the algorithm has the same order of computational requirements as the original EM algorithm. Another variation uses an approximation of bagging to reduce variance in the E-step but at a somewhat higher cost. Analyses using GMMs with artificial data show the proposed algorithms are more robust to overtraining than the conventional EM algorithm. Large vocabulary recognition experiments on Mandarin broadcast news data show that the methods make better use of more parameters and give lower recognition error rates than standard EM training.
Application of Fuzzy CMAC to Filament Tension Control
Authors: Gang Wang, Wenjun Ning
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Filament winding is a complex nonlinear time-varying process. Traditional PID controller can not ensure stable filament tension. Parallel implementation of fuzzy cerebellar model articulation controller (CMAC) and PID controller is proposed to control the plant. The adoption of Gaussian curve as activation function to the receptive fields can eliminate the undesired binary behavior of conventional CMAC. The modification to the learning algorithm of fuzzy CMAC greatly improves the learning efficiency. The creditability, which is defined by combining the exciting degree and learning times, is assigned to each hypercube. Error correction is not equally distributed among hypercubes and weights updating is performed by the creditability. To adjust the learning rate dynamically can further improve the learning speed and avoid the learning interference. The online learning ability of fuzzy CMAC makes it suitable to the application of time-varying process. The experimental results have shown that accurate and stable filament tension control can be obtained by the proposed control scheme.
Special Feature A Survey of Methods of Achieving Reliable Software
Authors: D. E. Morgan
Venue: Computer (1977)

As organizations become more dependent on computers, they become more sensitive to computer system failures. The importance of computer reliability in realtime control systems (e.g., communications systems8,15and traffic control systems) has been recognized for some time. Many computer users are now becoming aware that they accomplish more on systems which seldom crash because of malfunctions than on systems which run very rapidly (and correctly) between frequent crashes. Consequently, increasing emphasis is being placed by users and vendors on the reliability of the total system, and particularly the system software. A notable example of this is the emphasis placed by IBM on reliability concerns in the design and implementation of OS/VS2 Release 2.35,36
Operator splitting approach applied to oscillatory flow and heat transfer in a tube
Authors: R. Widura, M. Lehn, K. Muralidhar, R. Scherer
Venue: Journal of Computational and Applied Mathematics (2008)

The method of operator splitting is applied to an advection-diffusion model as it occurs in a pulse tube. Firstly, the governing equations of the simplified model are studied and the mathematical description is derived. Then the splitting approach is used to separate the advection and the diffusion part. Now it turns out that the advective part can be solved analytically and therefore the computational cost are reduced and the accuracy is increased. It is shown that the method can model an effect called Taylor dispersion. Applying a domain decomposition strategy, the solution process can be decoupled, reducing the numerical cost even more. This procedure allows to study the relevant parameters within the model with the goal to maximize the amount of energy stored within the tube wall. As a measure of efficiency, the amount of energy transferred between the fluid phase and the wall is chosen.
Keyword Spotting and Retrieval of Document Images Captured by a Digital Camera
Authors: S. Lu, C.-L. Tan
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper presents a keyword spotting technique that locates keywords within document images captured by a digital camera. In the proposed technique, the shape of word images in perspective view is captured by using three perspective invariants, namely, holes, water reservoirs, and character ascenders and descenders. Given a camera im- age of document, text line and word images are first seg- mented through the connected component analysis. The three perspective invariants are then detected through two rounds of scanning process, which transliterate each char- acter image into a character shape code of dimension six and so convert each word image into a word shape code.
Scalable semantic web data management using vertical partitioning
Authors: Daniel J. Abadi, Adam Marcus, Samuel R. Madden, Kate Hollenbach
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Efficient management of RDF data is an important factor in realizing the Semantic Web vision. Performance and scalability issues are becoming increasingly pressing as Semantic Web technology is applied to real-world applications. In this paper, we examine the reasons why current data management solutions for RDF data scale poorly, and explore the fundamental scalability limitations of these approaches. We review the state of the art for improving performance for RDF databases and consider a recent suggestion, "property tables." We then discuss practically and empirically why this solution has undesirable features. As an improvement, we propose an alternative solution: vertically partitioning the RDF data. We compare the performance of vertical partitioning with prior art on queries generated by a Web-based RDF browser over a large-scale (more than 50 million triples) catalog of library data. Our results show that a vertical partitioned schema achieves similar performance to the property table technique while being much simpler to design. Further, if a column-oriented DBMS (a database architected specially for the vertically partitioned case) is used instead of a row-oriented DBMS, another order of magnitude performance improvement is observed, with query times dropping from minutes to several seconds.
International Workshop on Tool Support and Requirements Management in Distributed Projects (REMIDI'07)
Authors: Eva Geisberger, Patrick Keil, Marco Kuhrmann
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Today, distributed projects, often subsumed under terms like global software development (GSD), global collaboration, offshoring etc. are common ways to overcome time and budget restrictions or lack of personnel. Thus, today's projects take place in a global context. But developing software with geographically distributed teams presents a unique set of challenges that influence virtually all aspects of a project and make them more complex. This workshop addressed topics relevant in multi-site projects like tooling, process support, economic aspects, project management and collaboration and communication.
Exploration of Low Power Adders for a SIMD Data Path
Authors: G. Paci
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Hardware for ambient intelligence needs to achieve extremely high computational efficiency (up to 40GOPS/W). An important way for reaching this is exploiting parallelism, and more specifically data-level parallelism enabled by SIMD. Whereas a large body of research exists on the benefits of the architectural design of and compilation onto SIMD, the design of energy-optimal functional units for SIMD has received limited attention. It appears that existing SIMD functional units are designed in an area optimal, but not energy optimal way. By exploiting the difference in critical path length for the types of operations (e.g., 4times8/2times16/1times32), SIMD adders can be developed that save up to 40% of energy. In this paper, the authors present these adders, the issues of building them and quantify their benefits for different usage scenarios and operating frequencies.
The Parallel Enumeration Sorting Scheme for VLSI
Authors: H. Yasuura
Venue: IEEE Transactions on Computers (1982)

We propose a new parallel sorting scheme, called the parallel enumeration sorting scheme, which is suitable for VLSI implementation. This scheme can be introduced to conventional computer systems without changing their architecture. In this scheme, sorting is divided into two stages, the ordering process and the rearranging one. The latter can be efficiently performed by central processing units or intelligent memory devices. For implementations of the ordering process by VLSI technology, we design a new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting. Data are serially transmitted between the sorting circuit and memory devices and the total communication between them is minimized. The basic structure used in the algorithm is called a bus connected cellular array structure with pipeline and parallel processing. The circuit consists of a linear array of one type of simple cell and two buses connecting all cells for efficient global communications in the circuit. The sorting circuit is simple, regular and small enough for realization by today's VLSI technology. We discuss several applications of the sorting circuit and evaluate its performance.
Toward undetected operating system fingerprinting
Authors: Lloyd G. Greenwald, Tavaris J. Thomas
Venue: Proceedings of the first USENIX workshop on Offensive Technologies (2007)

Tools for active remote operating system fingerprinting generate many packets and are easily detected by host and network defensive devices such as IDS/NIDS. Since each additional packet increases the probability of detection, it is advantageous to minimize the number of probe packets. We make use of an information-theoretic measure of test quality to evaluate fingerprinting probes and use this evaluation to derive effective probe combinations that minimize probe packets. While the default configuration of Nmap's second generation operating system detection transmits 16 different probe packets, we demonstrate successful fingerprinting with one to three packets. Furthermore, these packets are valid TCP SYN packets to open ports, which are less likely to be detected as fingerprinting probes than malformed packets or packets that are not part of a valid TCP three-way handshake.