ppxscal/embedding_network huggingface dataset:
Research of Product Function Gene Model Based on Behavior Semantic Web
Authors: Hao Yongtao, Ma Chong, Xin Cheng
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

With the goal of achieving the behavior semantic model of product, this paper analyzes the method of describing functional expression, as well as the behavior semantic. Based on these and the reasonable disassembly of function, along with geometrical character, a new describing scheme for product is described. Combining with XML and semantic network, we get the legible and concrete way of describing product function. Through deeply researching the constitution of functional matrix and the way of using XML to describe semantic network, we design the algorithm of conversion between XML and function matrix. On the basis of these researching, we conclude a new way of case-based reasoning and evolution design.
An efficient variable-length code construction foriterative source-channel decoding
Authors: Ragnar Thobaben, Jörg Kliewer
Venue: IEEE Transactions on Communications (2009)

We present a novel variable-length code (VLC) construction which exhibits an inherent error correcting capability due to the exclusive presence of codewords with even Hamming weight. Besides error robustness, the proposed code construction features a similar codeword length distribution as Golomb-Rice codes, and therefore, in particular for sources with exponentially distributed symbols, has good source compression properties at the same time. We show that in a source channel coding framework with outer source encoding, inner channel encoding with a recursive convolutional code, and iterative decoding the proposed VLC construction can lead to significant performance improvements compared to fixed-length source encoding with optimized mappings. In particular, simulation results for the AWGN channel verify that for Gauss-Markov sources a performance close to the theoretical limit can be achieved.
An adaptive ELD compensation technique using a predictive comparator
Authors: Kamal El-Sankary, Hamed Hanafi Alamdari, Ezz I. El-Masry
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

This brief presents an adaptive excess loop delay (ELD) compensation technique for continuous-time Delta-Sigma modulators. This technique utilizes a predictive comparator with adaptive control using the sign least-mean-square algorithm to estimate the compensation coefficients. Contrary to other state-of-the-art compensation methods, the proposed technique is immune to manipulation of the loop filter transfer function and loop circuitry. Consequently, it will not deteriorate the performance of the modulators. Simulations performed on two different Delta-Sigma modulators show the effectiveness of the proposed technique to compensate the ELD in low-pass and bandpass Delta-Sigma modulators.
Distributed Adaptive Protocols for Information Dissemination in Large-Scale Communication Systems
Authors: Sachin Shetty, Min Song, Jun Wang
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

One approach for information dissemination in large-scale communication systems is using epidemic protocols. Current epidemic protocols, however, adopt a constant fanout policy, which does not enable end users to control the information dissemination process. For distributed applications that need to compute a global function within a pre-determined response time, better procedures to control the information dissemination process have to be developed. In this paper, we introduce two distributed adaptive epidemic protocols using a dynamic fanout scheme. They are named Round-Based dynamic fanout (RBdf) and Cluster-Based dynamic fanout (CBdf). In RBdf, the network topology is flat and each node transmits a message with a varied fanout every round. In CBdf, the network topology is hierarchical, and the fanout values in every cluster differ within the same round. The main objectives are to ensure that peers receive messages within a bounded latency and that the system message overhead is a bounded value. The performance of the proposed protocols are verified through both theoretical and simulation studies.
Modeling geological objects with the XML Schema
Authors: Hassan A. Babaie, Abbed Babaei
Venue: Computers Geosciences (2005)

Interchange, storage, and management of geological data require the development of knowledge-based, standardized vocabularies and data structures. Concepts modeled and designed with the Unified Markup Language (UML), can be mapped into XML Schema Definition Language (XSDL) to compose modular markup languages for each discipline. Developing such efficient, intra-disciplinary, modular and reusable components, based on the XSDL namespace facility and the principles of object-oriented design, reduces redundancy, increases efficiency, scalability, and extensibility, and simplifies the maintenance and future extension of the code. This paper discusses the best practices of composition and reuse of modular intra-disciplinary components by applying XML Schema namespace syntax. In addition to several small examples given for a variety of geological cases, the paper constructs a UML conceptual model and markup language, applying an XML-type library, for a component of the plate tectonics knowledge base (TectonicsML) that deals with the divergent plate boundary.
The challenge of high recall in biomedical systematic search
Authors: Sarvnaz Karimi, Justin Zobel, Stefan Pohl, Falk Scholer
Venue: Proceeding of the third international workshop on Data and text mining in bioinformatics (2009)

Clinical systematic reviews are based on expert, laborious search of well-annotated literature. Boolean search on bibliographic databases, such as MEDLINE, continues to be the preferred discovery method, but the size of these databases, now approaching 20 million records, makes it impossible to fully trust these searching methods. We are investigating the trade-offs between Boolean and ranked retrieval. Our findings show that although Boolean search has limitations, it is not obvious that ranking is superior, and illustrate that a single query cannot be used to resolve an information need. Our experiments show that a combination of less complicated Boolean queries and ranked retrieval outperforms either of them individually, leading to possible time savings over the current process.
Opportunistic feedback with multiple classes in wireless systems
Authors: Jaewoo So
Venue: IEEE Communications Letters (2009)

An opportunistic feedback protocol with multiple access probabilities is proposed, where users are divided into several classes according to their measured channel state. Different random access probabilities are assigned to each class. All users compete to send a feedback message through random access if their scheduling metric exceeds a threshold. An analytical model is developed for evaluating the proposed feedback protocol in terms of the sum-rate capacity and the feedback load. The proposed feedback protocol achieves an asymptotic sum-rate capacity with a minimal amount of feedback information.
A Clustering and Routing Algorithm with Combination Weight for Energy Consumption Balance of WSNs
Authors: Jin-rong Zhang, Yue Wang, Dong Wang, Jing Han
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

As sensor nodes are typically powered by non-renewable batteries, energy efficiency is a critical factor in wireless sensor networks (WSNs). And prolonging the lifetime for nodes and the total network is a critical issue. In this paper, a combination weight energy balance clustering and routing algorithm (CW-EBCR) is proposed. This algorithm takes into consideration the following elements: the node degree and energy level, the average distance between node and its neighbors, the accumulative time of node being cluster head, the distance to sink and the optimal cluster number. Then a regulating rule of cluster communication radius and a method of selecting redundancy substitute of cluster head are developed. At the same time, the self-maintenance tactics of cluster is put forward. Simulation and analysis show that this algorithm can make energy balanced both in inner-cluster and in inter-clusters, can prolong the network life time.
Online training for investment in securities: an European network for the improvement of SMEs and professionals financial culture
Authors: Nunzio Casalino, Alessandro D'Atri, Vladimir Uskov
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

The financial market have undergone substantial changes because of most recent improvements in technology, deregulation of financial services, regulatory changes, and the globalization of the marketplace. Internet, along with high-speed computer systems, has dramatically altered the way in which securities and commodities are bought and sold, almost completely automating the transactions process [1]. On the other hand, the existing training courses brokers and dealers due to their high costs allow only to a limited number of professionals to obtain the necessary specific knowledge about financial markets and get practical skills such as 1) perform the buying and selling of securities and commodities, 2) take orders from clients and try to get the best price for them, 3) constantly keep an eye on market activity, and 4) stay in touch with other traders and brokers to know what prices are being offered. The European project entitled "Online Training for Investment in Securities" (OTIS) is a two year project with a financial support from the European Commission under the "Leonardo da Vinci" Community Vocational Training Programme. It is pointed to Vocational and Educational Training (VET) and aimed to develop and evaluate an accredited online trans-European platform to improve and harmonize skills and competencies in the field of financial markets and investment in securities. This paper presents project's preliminary outcomes and findings including: 1) contents for online learning and training based on a progressive "real world"-based learning concept, 2) self-assessment and testing tool, and 3) online business game for multiple users (a simulator) that uses an innovative learning-by-doing method.
Asymptotic random graph intuition for the biased connectivity game
Authors: Heidi Gebauer, Tibor Szabó
Venue: Random Structures Algorithms (2009)

We study biased Maker-Breaker games on the edges of the complete graph, as introduced by Chv&aacute;tal and Erd&odblac;s. We show that Maker, occupying one edge in each of his turns, can build a spanning tree, even if Breaker occupies b &le; (1 - o(1)) &middot; $ {n \over \ln n} $ edges in each turn. This improves a result of Beck, and is asymptotically best possible as witnessed by the Breaker-strategy of Chv&aacute;tal and Erd&odblac;s. We also give a strategy for Maker to occupy a graph with minimum degree c (where c = c(n) is a slowly growing function of n) while playing against a Breaker who takes b &le; (1 - o(1)) &middot; $ {n \over \ln n} $ edges in each turn. This result improves earlier bounds by Krivelevich and Szab&oacute;. Both of our results support the surprising random graph intuition: the threshold bias is asymptotically the same for the game played by two &ldquo;clever&rdquo; players and the game played by two &ldquo;random&rdquo; players. &copy; 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009
Distributed potential field based routing and autonomous load balancing for wireless mesh networks
Authors: Sangsu Jung, Malaz Kserawi, Dujeong Lee, June-Koo Kevin Rhee
Venue: IEEE Communications Letters (2009)

Congested hot spots and node failures severely degrade the performance of wireless mesh networks. However, conventional routing schemes are inefficient in mitigation of the problems. Considering analogy to physics, we propose a novel distributed potential-field-based routing scheme for anycast wireless mesh networks, which is robust to sudden traffic and network perturbations, effectively balancing load among multiple gateways and mesh nodes with little control overhead. Simulation results exhibit autonomous load balancing and failure-tolerant performance in wireless mesh networking.
Fair resource allocation for the Gaussian broadcast channel with ISI
Authors: Chi Wan Sung, Kenneth W. Shum, Cho Yiu Ng
Venue: IEEE Transactions on Communications (2009)

We consider fair resource allocation in Gaussian frequency-division broadcast channel with intersymbol interference. The goal is to allocate power and subchannels in a way such that proportional fairness is achieved. We show that the subchannel allocation problem is NP-hard. If multiple users are allowed to time-share a subchannel, the relaxed problem is equivalent to the cake cutting problem and can be efficiently solved. For the joint power and subchannel allocation problem, we propose an iterative method, which solves the power allocation problem and subchannel allocation problem alternately. Simulation results show that its performance is nearly optimal.
Teachers' pedagogical designs for technology-supported collective inquiry: A national case study
Authors: Minna Lakkala, Jiri Lallimo, Kai Hakkarainen
Venue: Computers Education (2005)

The aim of the present study was to analyze teachers' pedagogical designs, plans of organized technology-supported, collective student inquiry. Ten teachers in Finland designed and implemented eight, inquiry-learning units ('designs') in 12 primary and secondary level classrooms in various subject domains. The guiding principles behind the designs were the objectives of progressive inquiry, such as facilitation of question- and explanation-driven learning, and the use of collaborative technology to support the sharing of knowledge. The participating teachers received substantial pedagogical training on these issues before the classroom implementations. The present study concentrated on examining three aspects in the teachers' pedagogical designs: solutions for supporting students' inquiry efforts, organization of collaboration, and the role given to the web-based Collaborative Learning Environment (CLE). The teachers experienced the use of CLE as a valuable new possibility to foster collaboration in classroom work, but there was much variation in the ways that the affordances of the system were utilized. The results indicated that it was a challenge for the teachers, especially in secondary level, to find appropriate methods for supporting students' inquiry efforts. The most difficult aim to achieve appeared to be the promotion of real collaborative knowledge building; the social arrangements of many designs still relied on rather individualistic ways of working. g.
The Implementation of a Web Crawler URL Filter Algorithm Based on Caching
Authors: Wang Hui-chang, Ruan Shu-hua, Tang Qi-jie
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

For large-scale Web information collection, the URL filter module plays important roles in a Web crawler which is a central component of a search engine. The performance of an URL filter module influents the efficiency of the entire collection system directly. This paper introduces one URL filter algorithm based on caching and its implementation. The performances of stability and paralleling of the algorithm are verified by the experiments for Websites which handle a large number of web pages. Experiment results show the algorithm proposed in this paper can achieve satisfactory performances through reasonable adjustments of its some parameters and it is suitable for the process of the URL filter of a Website which has a number of page navigator links and index pages especially.
DOME: a diverse outdoor mobile testbed
Authors: Hamed Soroush, Nilanjan Banerjee, Aruna Balasubramanian, Mark D. Corner, Brian Neil Levine, Brian Lynn
Venue: Proceedings of the 1st ACM International Workshop on Hot Topics of Planet-Scale Mobility Measurements (2009)

A series of complex dependencies conspire to make it difficult to model mobile networks, including mobility, channel and radio characteristics, and power consumption. To address these challenges, we have designed and built a testbed for large-scale mobile experimentation, called the Diverse Outdoor Mobile Environment. DOME consists of computer-equipped buses, battery-powered nomadic nodes, organic WiFi APs, and a municipal WiFi mesh network. While the construction of a testbed such as DOME presents a significant engineering challenge, this paper describes a concrete set of scientific results derived from this experience. We argue that a broad range of mobility experiments could be performed in a testbed which provides the properties of temporal, technological, and spatial diversity. We demonstrate these properties in our testbed through analysis of data collected from DOME over a period of four years. Finally, we use DOME to provide insight into several open problems in mobile systems research.
Finding Abnormal Behavior Based on Patterns
Authors: Yongpo Liu, Ji Wu, Haiyan Yang, Maozhong Jin, Xiaoxia Jia, Xuemei Liu
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

The framework of finding abnormal behaviors based on patterns was proposed, including preparing data, extracting patterns and finding abnormal behaviors. Then, data preprocessing was introduced in the process of finding patterns, the standard of patterns was defined, the mining algorithm of abnormal behaviors was put forward, and the implementation procedure was described in detail. Lastly, the abnormal behaviors were found on the basis of pattern analysis. The faults in the program were localized by using complete information about the program behaviors. This method has been utilized in the research on fault localization. Good results have been achieved with this method.
Adaptive cooperation tools in learning virtual communities
Authors: A. Carbonaro, L. Colazzo, A. Molinari
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

In this paper we introduce an update of our work about developing a distance learning environment based on a collaborative bookmark management system. We introduce EasyInfo, an hybrid recommender architecture extension, which processes resources in order to extract concepts using semantic capabilities. Thanks to its resource sharing and recommendation facilities, the system contributes to human collaborative activities: it supports group collaboration among people involved in a task, independently from time and space distance, and learns from positive and negative experiences in group practice.
On-chip measurement of jitter transfer and supply sensitivity of PLL/DLLs
Authors: Jaeha Kim
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

This brief describes low-cost on-chip measurement circuits for jitter transfer and supply sensitivity of phase-locked loops (PLLs) and delay-locked loops (DLLs). Unlike previous works that measured the frequency-domain responses, the proposed circuits measure the time-domain responses of the PLL/DLL to the periodic disturbances applied to either its input clock phase or its supply voltage. A synchronous sampling technique accurately measures the PLL/DLVs periodic response while suppressing the unrelated noises and interferences via averaging. The synchronous sampler outputs either dc voltage or digital values, making it suitable for low-cost characterization and production tests. The procedure for estimating the frequency-domain transfer functions from the measured time-domain responses is outlined. The jitter transfer and supply sensitivity measurements were demonstrated with a PLL fabricated in 0.13-µm CMOS. Compared witlb the PLL that occupied 1.1 × 0.46 mm2 and dissipated 36 mW from a 1.2-V supply, the on-chip measurement circuits occupied only 0.014 mm2 and dissipated only 2.6 mW.
Dual code Tx diversity with antenna selection for spatial multiplexing in MIMO-WCDMA networks
Authors: Panagiotis K. Gkonis, George V. Tsoulos, Dimitra I. Kaklamani
Venue: IEEE Communications Letters (2009)

This letter investigates the performance of a mixed diversity-spatial multiplexing transmission strategy for multiple input-multiple output (MIMO) networks based on dual code transmission with antenna selection. The wideband code division multiple access (WCDMA) physical layer protocol has been used to demonstrate that for eight transmit and four receive antennas per user, 2.4Mbps more capacity is provided compared to single code spatial multiplexing transmission and 100% code allocation gain, compared to diversity combining and four codes per user.
Low BER performance estimation of LDPC codes via application of importance sampling to trapping sets
Authors: Enver Cavus, Charles L. Haymes, Babak Daneshrad
Venue: IEEE Transactions on Communications (2009)

We introduce an Importance Sampling (IS) method that successfully simulates the performance of Low density Parity Check (LDPC) Codes in an AWGN channel at very low bit error rates (BERs). By effectively finding and biasing bit node combinations that are the dominant sources of error events, called trapping sets, the developed technique provokes more frequent decoder failures. Consequently, fewer simulation runs and higher simulation gains are achieved.
Further results on the approximation of log-normal power sum via Pearson type IV distribution: a general formula for log-moments computation
Authors: Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
Venue: IEEE Transactions on Communications (2009)

In [1], we have recently proposed a general approach for approximating the power sum of Log-Normal Random Variables (RVs) by using the Pearson system of distributions. Therein, we have also highlighted the main advantages of using Pearson approximation instead of the usual Log-Normal one, and compared the proposed method with other approaches available in the open technical literature. However, despite being very accurate, the proposed method may be, in some circumstances, computational demanding since a non-linear least-squares problem needs to be solved numerically to get an accurate approximation. Motivated by the above consideration, the aim of this Letter is to provide an alternative approach for computing the parameters of the approximating Pearson distribution. The proposed solution is based on the Method of Moments (MoMs) in the logarithmic domain. In particular, by using some known properties of the Laplace transform, we will show that the MGF of the Log-Normal power sum in the logarithmic domain (denoted as log-MGF) can be obtained from the Mellin transform of the MGF of the Log-Normal power sum in the linear domain. From the estimated log-MGF, we will then compute the desired log-moments required for Pearson approximation. Numerical results will be also shown in order to substantiate the accuracy of the proposed method.