ppxscal/embedding_network huggingface dataset:
The Application of Improved BP Neural Network Algorithm in Lithology Recognition
Authors: Yuxiang Shao, Qing Chen, Dongmei Zhang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Traditional technology of lithology identification bases on statistical theory, such as regression method and cluster method, which has some shortcomings. The standard BP neural network algorithm has some disadvantages like slow convergence speed, local minimum value which results in the loss of global optimal solution. BP neural network algorithm on the basis of improved variable rate of momentum factor can effectively overcome these disadvantages. Practical application shows that this method has the feature as high recognition precision and fast recognition rate so that it is suitable for recognition of lithology, lithofacies and sedimentary facies as well as geological research like deposit prediction and rock and mineral recognition.
Temperature dependent saturation characteristics of wavelength locked Febry-Perot laser diodes
Authors: Hongyun Meng, Chang-Hee Lee
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The influence of the recombination mechanisms and the temperature- and wavelength-dependent material gain on the performance of amplified spontaneous emission (ASE) injection wavelength-locked Febry-Perot laser diodes (F-P LDs) is analyzed. The results show that the saturation power of the wavelength-locked F-P LD increases as the operation temperature increasing. It can be origin of the temperature dependent noise characteristics in WDM-PON based on wavelength-locked F-P LD.
Rough Relational Operators and Rough Entropy in Rough Relational Database
Authors: Feng Jiang, Guozhu Liu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The relational database model (RDM), proposed by Codd, has been proven to be a very useful model in many applications. The inherent of the RDM is effective for precise and unambiguous data. However, real world applications often include imprecise and uncertain information. Therefore, Beaubouef et al. proposed the rough relational database model (RRDM) for the management of uncertainty in relational databases. In the RRDM, a tuple of a rough relation can have multi-values on some attributes, which is forbidden in the RDM. In this paper we give some new definitions for rough relational operators and rough entropy of rough relations in the rough relational databases. Furthermore, we discuss the possible connections between rough relational operators and rough entropy.
Unsupervised Face Annotation by Mining the Web
Authors: Duy-Dinh Le, Shin'ichi Satoh
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Searching for images of people is an essential task for image and video search engines. However, current search engines have limited capabilities for this task since they rely on text associated with images and video, and such text is likely to return many irrelevant results. We propose a method for retrieving relevant faces of one person by learning the visual consistency among results retrieved from text correlation-based search engines. The method consists of two steps. In the first step, each candidate face obtained from a text-based search engine is ranked with a score that measures the distribution of visual similarities among the faces. Faces that are possibly very relevant or irrelevant are ranked at the top or bottom of the list, respectively. The second step improves this ranking by treating this problem as a classification problem in which input faces are classified as ’person-X’ or ’non-person-X’; and the faces are re-ranked according to their relevant score inferred from the classifier’s probability output. To train this classifier, we use a bagging-based framework to combine results from multiple weak classifiers trained using different subsets. These training subsets are extracted and labeled automatically from the rank list produced from the classifier trained from the previous step. In this way, the accuracy of the ranked list increases after a number of iterations. Experimental results on various face sets retrieved from captions of news photos show that the retrieval performance improved after each iteration, with the final performance being higher than those of the existing algorithms.
Making sense of strangers' expertise from signals in digital artifacts
Authors: N. Sadat Shami, Kate Ehrlich, Geri Gay, Jeffrey T. Hancock
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Contemporary work increasingly involves interacting with strangers in technology-mediated environments. In this context, we come to rely on digital artifacts to infer characteristics of other people. This paper reports the results of a study conducted in a global company that used expertise search as a vehicle for exploring how people interpret a range of information available in online profiles in evaluating whom to interact with for expertise. Using signaling theory as a conceptual framework, we describe how certain 'signals' in various social software are hard to fake, and are thus more reliable indicators of expertise. Multi-level regression analysis revealed that participation in social software, social connection information, and self-described expertise in the corporate directory were significantly helpful in the decision to contact someone for expertise. Qualitative analysis provided further insights regarding the interpretations people form of others' expertise from digital artifacts. We conclude with suggestions on differentiating various types of information available within online profiles and implications for the design of expertise locator/recommender systems.
Topological Properties of Event Structures
Authors: Luigi Santocanale
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Motivated by the nice labelling problem for event structures, we study the topological properties of the associated graphs. For each n>=0, we exhibit a graph G"n that cannot occur on an antichain as a subgraph of the graph of an event structure of degree n. The clique complexes of the graphs G"n are disks (n even) and spheres (n odd) in increasing dimensions. We strengthen the result for event structures of degree 3: cycles of length greater than 3 do not occur on antichains as subgraphs. This amounts to saying that the clique complex of the graph of an event structure of degree 3 is acyclic.
Investigation of Indoor Location Sensing via RFID Reader Network Utilizing Grid Covering Algorithm
Authors: Ahmed Wasif Reza, Tan Kim Geok
Venue: Wireless Personal Communications: An International Journal (2009)

One of the biggest challenges in RFID (radio frequency identification) large scale deployment, such as in warehouse RFID deployment, is the positioning of RFID reader antennas to efficiently locate all the tagged objects distributed at RFID reader environment. This paper has investigated a novel location sensing system based on geometric grid covering algorithm that can use any passive or active RFID standard for positioning or tracking objects inside buildings. This study involves design of RFID reader antenna network which focuses on placing the reader antennas on a grid to cover all the tags distributed at two dimensional planes and position calculation using statistical averages algorithm. The statistical averages algorithm simply computes the location coordinates of the tagged object by statistical average of the reader antenna's location. The proposed grid of reader antennas can assist in minimizing the actual number of reader antennas required for RFID large scale deployment. The proposed prototype system is a simpler positioning system which presents the solution of placement pattern of RFID reader antennas, gives less complicated mathematical calculation, and is able to provide a high degree of accuracy. The obtained results show that the proposed location sensing system can achieve better positioning accuracy as compared to existing positioning system and in some cases accuracy improvement of about 50% can be reached.
Cancellativity properties for t-norms and t-subnorms
Authors: Koen C. Maes, Andrea Mesiarová-Zemánková
Venue: Information Sciences: an International Journal (2009)

On the one hand, cancellativity properties are mainly used to express to which extend the partial functions of a t-subnorm T are injective. On the other hand, the zooms of T corresponding to its non-trivial Archimedean components are t-subnorms that largely determine T. Fixing one out of four basic types of cancellativity (cancellativity, conditional cancellativity, weak cancellativity and weak conditional cancellativity) we figure out which less restrictive type of cancellativity expresses that all maximal Archimedean zooms of T satisfy the given cancellativity property. We lay bare the mutual relationships between all these types of cancellativity and solve an open problem posed by Klement et al.
IDSS: an intelligent decision support system for e-purchasing using CBR and CF
Authors: M.K. Kavitha Devi, P. Venkatesh
Venue: International Journal of Agent-Oriented Software Engineering (2009)

Procurement holds significant business value, as most organisations spend at least one-third of their overall budget on purchasing goods and services. In this paper, we describe the design and implementation of an Intelligent Decision Support System (IDSS) for electronic purchasing. The theory of purchasing decision traditionally assumes that the offered quantity and quality are fixed prior to source selection. Decision Support Systems (DSS) are the need of the hour to assure results at a faster rate that best match the buyers' preferences and give valid recommendations. A two-dimensional approach is proposed: first, the Case-Based Reasoning (CBR) approach is used, which is a novel paradigm that solves a new problem by remembering a previous similar situation and reusing the information on and knowledge of that situation to bring out similar cases at a faster rate, depending on the predetermined similarity criteria. Second, the slope one predictors for online rating-based Collaborative Filtering (CF) and item-to-item CF are combined to produce accurate recommendations on the basis of the resources rating given by the users to help each other find better content. Our approach is database-driven, which provides buyers with more flexibility in the specification of their purchasing request and allows for an efficient information exchange among the participants. Finally, the purchaser can improve his profit.
Reaction&#x2013;diffusion algorithm for stereo disparity detection
Authors: Atsushi Nomura, Makoto Ichikawa, Hidetoshi Miike
Venue: Machine Vision and Applications (2009)

The present paper proposes a novel stereo algorithm utilizing multi-sets of reaction&#x2013;diffusion equations. The problem of detecting a stereo disparity map becomes the segmentation problem, in which the uniqueness assumption and the continuity assumption on disparity distribution are taken into account. A set of reaction&#x2013;diffusion equations realizes the continuity assumption, while a mutual-inhibition mechanism among the multi-sets realizes the uniqueness one. In addition, each set of equations has a self-inhibition mechanism, which is necessary for the reaction-diffusion equations applied to stereo disparity detection. Performance of the proposed algorithm is evaluated for well-known test stereo images.
The Probability Distribution Modeling and Parameter Estimation Method of ROD in Different Packet Loss Pattern for Heterogeneous Network
Authors: Zhen Yanxiang, Su Fang, Xu Huimin
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

The packet loss differentiating mechanism of TCP for heterogeneous network has the important influence to the stability of wireless network, relative one-way delay (ROD) of loss pair is adopted as a differentiating parameter to distinguish the loss type in reference [1]. The accuracy of this algorithm depends on ROD membership function. In order to differentiate packet loss pattern more accurately, first the probability distribution of ROD is analyzed in different packet loss pattern, then the probability distribution model is built, finally the method of parameter estimation is proposed. From the results of simulation the effect of this method model is more ideal.
Optimizing the parallel computation of linear recurrences using compact matrix representations
Authors: Adrian Nistor, Wei-Ngan Chin, Tiow-Seng Tan, Nicolae Tapus
Venue: Journal of Parallel and Distributed Computing (2009)

This paper presents a novel method for optimizing the parallel computation of linear recurrences. Our method can help reduce the resource requirements for both memory and computation. A unique feature of our technique is its formulation of linear recurrences as matrix computations, before exploiting their mathematical properties for more compact representations. Based on a general notion of closure for matrix multiplication, we present two classes of matrices that have compact representations. These classes are permutation matrices and matrices whose elements are linearly related to each other. To validate the proposed method, we experiment with solving recurrences whose matrices have compact representations using CUDA on nVidia GeForce 8800 GTX GPU. The advantages of our technique are that it enables the computation of larger recurrences in parallel and it provides good speedups of up to eleven times over the un-optimized parallel computations. Also, the memory usage can be as much as nine times lower than that of the un-optimized parallel computations. Our result confirms a promising approach for the adoption of more advanced parallelization techniques.
Spime builder: a tangible interface for designing hyperlinked objects
Authors: Leonardo Bonanni, Greg Vargas, Neil Chao, Stephen Pueblo, Hiroshi Ishii
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Ubiquitous computing is fostering an explosion of physical artifacts that are coupled to digital information -- so-called Spimes. We introduce a tangible workbench that allows for the placement of hyperlinks within physical models to couple physical artifacts with located interactive digital media. A computer vision system allows users to model three-dimensional objects and environments in real-time using physical materials and to place hyperlinks in specific areas using laser pointer gestures. We present a working system for real-time physical/digital exhibit design, and propose the means for expanding the system to assist Design for the Environment strategies in product design.
Multiobjective Disk Cover Admits a PTAS
Authors: Christian Glaßer, Christian Reitwießner, Heinz Schmitz
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We introduce multiobjective disk cover problems and study their approximability. We construct a polynomial-time approximation scheme (PTAS) for the multiobjective problem where k types of points (customers) in the plane have to be covered by disks (base stations) such that the number of disks is minimized and for each type of points, the number of covered points is maximized. Our approximation scheme can be extended so that it works with the following additional features: interferences, different services for different types of customers, different shapes of supply areas, weighted customers, individual costs for base stations, and payoff for the quality of the obtained service.Furthermore, we show that it is crucial to solve this problem in a multiobjective way, where all objectives are optimized at the same time. The constrained approach (i.e., the restriction of a multiobjective problem to a single objective) often used for such problems can significantly degrade their approximability. We can show non-approximability results for several single-objective restrictions of multiobjective disk cover problems. For example, if there are 2 types of customers, then maximizing the supplied customers of one type is not even approximable within a constant factor, unless P = NP.
A synergistic co-operative framework of health diagnostic systems for people with disabilities and the elderly: a case study
Authors: Nikolaos Bourbakis, John Gallagher
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Millions of people worldwide have (or will due to aging) experienced some kind of unexpected disability throughout their lives. For this population health care costs increase, quality of life and productivity decline, and in many cases family members serve as primary care assistants. Early detection and diagnosis of critical health changes could enable prevention of most of these problems, saving billions of dollars annually (Newsweek, 2006 - "Fixing the American Hospital" [31,32]). Early detection, however, requires continual vigilance. Due to the nature of their conditions or the lack of training and experience, many among this population are patients of either disinclined or unable to detect and report the critical observations that could make a difference. A common solution is for health care professionals to monitor patients directly or via relatively crude patient data collection devices; however, that solution does not scale to large populations. New generation of inexpensive, unobtrusive wearable/ implanted devices automatically detect critical changes on their health condition. These devices will not be simple data collection appliances, nor will they only report variations from sampled population norms. Rather, they will learn individual user baselines and employ advanced detection and diagnostics to discover problems autonomously and signal medical professionals for further assistance. These wearable/implanted systems will be engineered to integrate seamlessly both with portable equipment carried by first-responders and with fixed-location systems installed in hospitals. In addition to providing advanced detection in field, our devices will continually capture data, organize it into customized patient and condition models, and communicate each patient's unique information to first-responders and hospital personnel. This paper describes the fundamental steps for the systematic development and co-operation of three layers of health diagnosis systems. These explorations will result in new fundamental knowledge and catalyze a revolution in low-cost, high-reliability, ubiquitously deployable automated health detection and diagnostic equipment.
A new hybrid vector quantizer of LSF parameters
Authors: Septimiu Mischie, Liviu Toma
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

This paper proposes a new type of hybrid vector quantizer (VQ) of line spectrum frequencies (LSF) parameters of a speech signal. First, the LSF vector is split into two or three subvectors. Then, a tree-search procedure is performed until a terminal node is reached. Finally, a full-search is performed among the code vectors associated with the terminal node in order to find the result of the encoding process. The method finds the nearest neighbor of each input subvector. This new hybrid VQ has a much lower complexity than current VQs like split VQ or switched split VQ. In the design process of this VQ, the Voronoi cells which intersect with the rectangular cells must be determined. We propose a new method to solve this issue requiring less encoding operations compared to previous work.
Optimization Analysis of Transmission Performance of 10Gb/s Optical Signal Using Adaptive Decision Feedback Equalizer
Authors: Liuyang Dong, Bo Xu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Electrical dispersion compensation equalizer is a cost-effective element in optical communication OOK systems in the presence of chromatic dispersion. The optimization of training sequence and taps for the electrical adaptive decision feedback equalizer in a single-mode fiber communication system is studied in this paper.10-Gb/s transmission over 100km and up to 180km of single-mode fiber without any in-line dispersion compensation is demonstrated. The simulation results show that the ISI can be eliminated effectively with the ADFE in the optical Single-Mode Fiber (SMF) communication systems. With a transmission distance up to 180km without in-line dispersion compensation, present metropolitan area networks can be efficiently upgraded and expanded to accommodate fast development of expanding cities
An LMI Approach to Computing Delayed Perturbation Bounds for Stabilizing Receding Horizon H∞ Controls
Authors: ChoonKi Ahn, SooHee Han
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This letter presents new delayed perturbation bounds (DPBs) for stabilizing receding horizon H∞ control (RHHC). The linear matrix inequality (LMI) approach to determination of DPBs for the RHHC is proposed. We show through a numerical example that the RHHC can guarantee an H∞ norm bound for a larger class of systems with delayed perturbations than conventional infinite horizon H∞ control (IHHC).
Experiences in teaching computer architecture
Authors: Timothy Stanley, Nathan I. Kim, Yiu-Ming Chan, Ji Zheng, Leslie Fife
Venue: Journal of Computing Sciences in Colleges (2009)

Many methods exist for teaching computer organization and architecture. These include hardware kits, hardware emulation and logic simulation tools. Each method has advantages and disadvantages. It is important to understand the differences of each approach and the needs and interests of the students. Over a period of several years these methods have been used in sophomore level computer organization and senior level computer architecture courses. This paper explores the tradeoffs associated with each choice through a discussion of tools used.
A Secure and Efficient Mutual Authentication Protocol Using Hash Function
Authors: Sida Lin, Qi Xie
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Most remote user authentication schemes are designed by encryption or hash-function techniques. In terms of computational cost, the hash-function-based scheme is more simple and efficient. In 2008, under the conditions of using tamper-resistant smart card device and the verifier table storage technique, Chen-Lee proposed a novel mutual authentication protocol using hash function to solve remote user authentication. Based on Chen-Lee scheme, a secure and efficient mutual authentication protocol using hash function is proposed. The proposed scheme not only keeps the advantages of Chen-Lee scheme, but also avoids using well-defined tamper-resistant smart card device and storing the verifier table in server.