ppxscal/embedding_network huggingface dataset:
User Localization for Large Artifacts Prebuffering and Safety Possibilities in Mobile Embedded Systems
Authors: Ondrej Krejcar
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Main area of interest is in a model of a radio-frequency based system for locating and tracking users of control or information system inside the corporate area. The developed framework joins the concepts of location and user tracking as an extension for a new type of mobile embedded systems. The PDPT (Predictive Data Push Technology) framework uses a WiFi network infrastructure to let a mobile device determine its position. User position is used for data pre-buffering and pushing information from server database to user’s PDA database. All server data is saved as artifacts (together) with its position information in building. The accessing of such prebuffered data on mobile embedded device can highly improve the response time needed to view large multimedia data. All data artifacts are transferred from PDPT Server database to mobile embedded device database throw secured wireless connection standard EAP-TLS.
Reporter node determination of replicated node detection in wireless sensor networks
Authors: Yuichi Sei, Shinichi Honiden
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In large-scale sensor networks, sensor nodes are at high risk of being captured and compromised. Once a sensor node is compromised, all the secret keys, data, and code stored on it are exposed to the attacker. The attacker can insert arbitrary malicious code in the compromised node. Moreover, he can easily replicate such code in a large number of clones and deploy them on the network. This node replication attack can form the basis of a variety of attacks such as DoS attacks and Sybil attacks. In the related studies, as a means of detecting compromised nodes, each node reports its neighbor's ID and location to a witness node with some probability p. The value of p is determined beforehand or from only the number of neighbor nodes. In this paper, we change p according to the locations of nodes. We aim to increase the detection rate of replicated node attacks and decrease the amount of messages. Our analysis and simulations demonstrate that using our protocol in combination with the methods of other studies is more effective than using the methods of the related studies by themselves.
The Area Partition of 3-D Basic Body Surface Based on Ant Colony Algorithm
Authors: Meiling Zhuang, Jianan Fang, Xiaofeng Zhang
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

According to the Gauss Curvature of each node on 3-D basic body surface, the indexes such as pheromone and volatilization coefficient are determined. The Ant Colony Algorithm is designed and used. In the algorithm the selected nodes collection are changed every time. The circle times are determined based on the percent of desired nodes account for different areas. At last the basic body surface is divided into two parts that are developable surface and undevelopable one.
Fuzzy Weighted Association Rule Mining with Weighted Support and Confidence Framework
Authors: Maybin Muyeba, M. Sulaiman Khan, Frans Coenen
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

In this paper we extend the problem of mining weighted association rules. A classical model of boolean and fuzzy quantitative association rule mining is adopted to address the issue of invalidation of downward closure property (DCP) in weighted association rule mining where each item is assigned a weight according to its significance w.r.t some user defined criteria. Most works on DCP so far struggle with invalid downward closure property and some assumptions are made to validate the property. We generalize the problem of downward closure property and propose a fuzzy weighted support and confidence framework for boolean and quantitative items with weighted settings. The problem of invalidation of the DCP is solved using an improved model of weighted support and confidence framework for classical and fuzzy association rule mining. Our methodology follows an Apriori algorithm approach and avoids pre and post processing as opposed to most weighted ARM algorithms, thus eliminating the extra steps during rules generation. The paper concludes with experimental results and discussion on evaluating the proposed framework.
MARISA-DP -- from architecture to design: an MDD approach
Authors: Ana Luisa Medeiros, Thais Batista, Christina Chavez
Venue: Proceedings of the 15th workshop on Early aspects (2009)

In general, aspect-oriented approaches associated to different activities in the software development process are independent and the new models and artifacts are not aligned or inserted in a coherent process. The model-driven development, where several models and the correspondence among them are rigorously specified, can support the integration among AO approaches that handle different activities of the software process. This paper presents MARISA-DP, a model based development approach to integrate aspect-oriented architecture and detailed project, aligning their models and artifacts. The proposed approach is part of a rigorous and coherent process where each activity has AO models (and corresponding metamodels) and a set of transformations among the models. To illustrate the viability of the proposed approach, this paper presents a mapping between AspectualACME, an aspect-oriented architectural description language, and aSideML, a modeling language to aspect-oriented detailed project. This mapping is formalized using ATL transformation rules.
The potential of spectral reflectance technique for the detection of Grapevine leafroll-associated virus-3 in two red-berried wine grape cultivars
Authors: Rayapati A. Naidu, Eileen M. Perry, Francis J. Pierce, Tefera Mekuria
Venue: Computers and Electronics in Agriculture (2009)

The detection of viruses in plants involves destructive sampling followed by testing by enzyme-linked immunosorbent assay (ELISA) and/or reverse transcription-polymerase chain reaction (RT-PCR). In this study, we have investigated the potential of leaf spectral reflectance changes between virus infected and uninfected grapevines (Vitis vinifera L.) in developing non-invasive techniques for field-based 'real-time' diagnosis of grapevine leafroll disease (GLD). In situ leaf reflectance spectra were taken with a portable spectrometer using detached leaves from uninfected and Grapevine leafroll-associated virus-3 (GLRaV-3) infected plants of two wine grape cultivars (Cabernet Sauvignon and Merlot). Specific differences in vegetation indices and wavelength intervals were observed between virus-infected and uninfected leaves in the green peak (near 550nm), the near infrared (near 900nm) and in the mid-infrared (near 1600nm and 2200nm). Results of reflectance spectra and classification analysis suggest that different vegetation indices and/or individual wavelength bands may differ in their ability to detect GLD depending on whether there are visible symptoms in the virus-infected leaves. The differences in leaf reflectance measurements at specific wavelength intervals between virus-infected and uninfected grapevines and their correlation with RT-PCR results for the presence of GLRaV-3 suggest spectral reflectance technique as a promising tool for cost-effective, nondestructive method for diagnosis of GLD in the field. To our knowledge this represents the first study to report the potential of using leaf spectral data for virus disease diagnosis in a perennial crop.
Design and simulation of a QCA 2 to 1 multiplexer
Authors: V. Mardiris, Ch. Mizas, L. Fragidis, V. Chatzis
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper a novel design of a quantum-dot cellular automata (QCA) 2 to 1 multiplexer is presented. The objective is the development of a modular design methodology which can be used to design 2n to 1 multiplexers using building blocks. For the QCA implementation a careful consideration is taken into account concerning the design in order to increase the device stability. The proposed multiplexer is designed and simulated using the QCADesigner tool.
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
Authors: Xavier Muñoz, Ignasi Sau
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Traffic grooming is a major issue in optical networks. It refers to grouping low rate signals into higher speed streams, in order to reduce the equipment cost. In SONET WDM networks, this cost is mostly given by the number of electronic terminations, namely Add-Drop Multiplexers (ADMs for short). We consider the unidirectional ring topology with a generic grooming factor C, and in this case, in graph-theoretical terms, the traffic grooming problem consists in partitioning the edges of a request graph into subgraphs with at most C edges, while minimizing the total number of vertices of the decomposition.We consider the case when the request graph has bounded degree Δ, and our aim is to design a network (namely, place the ADMs at each node) being able to support any request graph with maximum degree at most Δ. The existing theoretical models in the literature are much more rigid, and do not allow such adaptability. We formalize the problem, and we solve the cases Δ= 2 (for all values of C) and Δ= 3 (except the case C = 4). We also provide lower and upper bounds for the general case.
On the design of reconfigurable multipliers for integer and Galois field multiplication
Authors: Heiko Hinkelmann, Peter Zipf, Jia Li, Guifang Liu, Manfred Glesner
Venue: Microprocessors Microsystems (2009)

Multiplication is a vital function for practically any DSP system. Some common DSP algorithms require different multiplication types, specifically integer or Galois Field (GF) multiplication. Since both functions share similarities in their structures, the potential is given for efficiently combining them in a single reconfigurable VLSI circuit, leading to competitive designs in terms of area, performance, and power consumption. This will be analysed and discussed in detail for 10 reconfigurable multiplier alternatives that are based on different strategies for the combination of integer and GF multiplication. Each result is compared to a reference architecture, showing area savings of up to 20% at a marginal increase in delay, and an increase in power consumption of 25% and above. This gives evidence that function-specific reconfigurable circuits can achieve considerable improvements in at least one design objective with only a moderate degradation in others. From this perspective, function-specific reconfigurable circuits can be considered feasible alternatives to standard ASIC solutions.
An novel approach to supplier selection based on vague sets group decision
Authors: Dongfeng Zhang, Jinlong Zhang, Kin-Keung Lai, Yaobin Lu
Venue: Expert Systems with Applications: An International Journal (2009)

In practice, in purchasing decision-making, many quantitative and qualitative factors, with vagueness and imprecision, have to be considered. This makes the decision process very complicated and unstructured. Besides the fuzzy sets theory, vague sets theory is one of the methods used to deal with uncertain information. Since vague sets can provide more information than fuzzy sets, it is considered superior in mathematical analysis of uncertain information. In this paper, a new approach based on vague sets group decision is proposed to deal with the supplier selection problem in supply chain systems. The work procedure is shown briefly, as follows: First, linguistic values are used to assess the ratings and weights for quantitative or qualitative factors. Second, degree of similarity and probability of vague sets are used to determine the ranking order of all alternatives. Finally, a numerical example of the selection problem of suppliers is shown, to highlight the procedure of the proposed approach, at the end of this paper.
A Blog Mining Framework
Authors: Michael Chau, Jennifer Xu, Jinwei Cao, Porsche Lam, Boby Shiu
Venue: IT Professional (2009)

Blogs have become increasingly popular, and new blogs are generated every day. Many of the contents are useful for applications in various domains, such as business, politics, research, social work, and linguistics. However, automatically collecting and analyzing blogs isn't straightforward due to the large size and dynamic nature of the blogosphere. In this article, the authors propose a framework for blog mining that includes spiders, parsers, analyzers, and visualizers. They present several examples of blog mining applications based on their framework.
Performance optimization of elastic systems using buffer resizing and buffer insertion
Authors: Dmitry Bufistov, Jorge Júlvez, Jordi Cortadella
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Buffer resizing and buffer insertion are two transformation techniques for the performance optimization of elastic systems. Different approaches for each technique have already been proposed in the literature. Both techniques increase the storage capacity and can potentially contribute to improve the throughput of the system. Each technique offers a different trade-off between area cost and latency. This paper presents a method that combines both techniques to achieve the maximum possible throughput while minimizing the cost of the implementation. The provided method is based on mixed integer linear programming. A set of experiments is designed to show the feasibility of the approach.
Corel WordPerfect X3 Quick Source Guide
Authors: Quick Source
Venue:  (2007)

Do you need an easy-to-follow software reference right at your fingertips? Our 6 page, tri-fold guides are the answer. These quick reference guides include step by step instructions to help users to learn software features more quickly, as well as full color screen graphics to highlight important features. Quick Source reference guides also include the software program s NEW features and gives you quick access to time saving shortcuts. The Corel WordPerfect X3 Quick Source guide is a clear and concise tool for learning the features in WordPerfect X3. Features contained in this guide include NEW features such as Importing a PDF, Saving without Metadata, and Counting Words. It also includes Using the Workspace Manager, Opening a Document, Switching Views, Using the Navigation Toolbar, Setting Margins, Undoing and Redoing Actions, Inserting Clip Art, Creating a Table, Previewing a Document, and much more.
Establishment of Rape Leaf Moisture Content Spectral Character Models Based on RSR-PCA Method
Authors: Xiaodong Zhang, Hanping Mao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

It was developed that the method of spectral analysis was used to quantitatively analyze the rape moisture content. The method of region stepwise regression (RSR) was proposed to select the characteristic wavelengths for rape leaf moisture content prediction. The spectrum curve was segmented into several regions by the middle points of adjacent zeros of derivative spectrum data. Each region included a spectral absorption peak or an absorption valley. Stepwise regression was applied to each region, where the correlation coefficient and root mean square error (RMSE) was taken as the evaluation standard to select the spectral characteristic wavelength regions for the model in each region. In order to avoid wrongly choosing characteristic wavelengths or neglecting the necessary information, applied further choice to the selected characteristic wavelengths according to the former research findings of our team and regularities of molecular spectrum absorption band distribution. The method of principal component regression analysis（PCA）was used to establish the model between the moisture content and the characteristic wavelengths of rape leaf. The method could diminish runtime and overcome the effect of multiple co-linearity while enhance model prediction precision. From the spectral date of rape leaves under different water stress conditions, it was found that the rape leaf moisture content had a significant correlation with the spectral reflectance at 460nm, 510nm, 1450nm, 1650nm, 1900nm and derivative of spectral reflectance at 702nm. The correlation coefficient between the estimated value and the real value is 0.92; the root mean square error is 0.37
Watermarking Based on the Classification of Cracks in Paintings
Authors: R. Sinduja
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This system presents a methodology for watermarking by detection of cracks in images of old statues of temples and old paintings. The cracks are detected by thresholding the output of the morphological top-hat transform. Afterwards, the thin dark brush strokes, which have been misidentified as cracks are removed using a semi-automatic procedure based on region growing. The cracks are classified using an unsupervised approach, which incorporates fuzzy clustering of the patterns. This system classifies cracks using the fuzzy k-means technique. The watermarked information is stored on the specific category of cracks. The user gives the input of the category of crack. The resulting image is the watermarked image. While retrieving the watermark information, the above procedure for identifying cracks is conducted and the watermark information is retrieved from the same category of cracks specified during the hiding stage.Index terms: This system presents a methodology for watermarking by detection of cracks in images of old statues of temples and old paintings. The cracks are detected by thresholding the output of the morphological top-hat transform. Afterwards, the thin dark brush strokes, which have been misidentified as cracks are removed using a semi-automatic procedure based on region growing. The cracks are classified using an unsupervised approach, which incorporates fuzzy clustering of the patterns. This system classifies cracks using the fuzzy k-means technique. The watermarked information is stored on the specific category of cracks. The user gives the input of the category of crack. The resulting image is the watermarked image. While retrieving the watermark information, the above procedure for identifying cracks is conducted and the watermark information is retrieved from the same category of cracks specified during the hiding stage.
Expanding network communities from representative examples
Authors: Andrew Mehler, Steven Skiena
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2009)

We present an approach to leverage a small subset of a coherent community within a social network into a much larger, more representative sample. Our problem becomes identifying a small conductance subgraph containing many (but not necessarily all) members of the given seed set. Starting with an initial seed set representing a sample of a community, we seek to discover as much of the full community as possible. We present a general method for network community expansion, demonstrating that our methods work well in expanding communities in real world networks starting from small given seed groups (20 to 400 members). Our approach is marked by incremental expansion from the seeds with retrospective analysis to determine the ultimate boundaries of our community. We demonstrate how to increase the robustness of the general approach through bootstrapping multiple random partitions of the input set into seed and evaluation groups. We go beyond statistical comparisons against gold standards to careful subjective evaluations of our expanded communities. This process explains the causes of most disagreement between our expanded communities and our gold-standards&mdash;arguing that our expansion methods provide more reliable communities than can be extracted from reference sources/gazetteers such as Wikipedia.
Resiliency of the computerized society
Authors: Rein Turn, Eric J. Novotny
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Computers support nearly every functional area of a modern society. Consequently, when malfunctions or software errors occur, or when computing support is not available for other reasons, disruptions may result. In networked systems, disruptions may spread and seriously impair an entire functional area of the country. Has computerization produced a new vulnerability for society? Or is society intrinsically resilient and able to absorb large disruptions without grave and lasting societal consequences? This paper analyzes these and related questions. The conclusion is that modern societies (at least the United States) still appear to be resilient. Suggestions for maintaining resiliency are made.
Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN
Authors: Manal El Dick, Esther Pacitti, Bettina Kemme
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distribution networks such as Akamai. For those websites, we have developed Flower-CDN, a locality-aware P2P based content-distribution network (CDN) in which the users that are interested in a website support the distribution of its content. The idea is that peers keep the content they retrieve and later serve it to other peers that are close to them in locality. Our architecture is a hybrid between structured and unstructured networks. When a new client requests some content from a website, a locality-aware DHT quickly finds a peer in its neighborhood that has the content available. Additionally, all peers in a given locality that maintain content of a particular website build an unstructured content overlay. Within this overlay, peers gossip information about their content allowing the system to maintain accurate information despite churn. In our performance evaluation, we compare Flower-CDN with an existing P2P-CDN strictly based on DHT and not locality aware. Flower-CDN reduces lookup latency by a factor of 9 and transfer distance by a factor of 2. We also show that Flower-CDN's gossip has low overhead and can be adjusted according to hit ratio requirements and bandwidth availability.