ppxscal/embedding_network huggingface dataset:
Clustering analysis of the seismic catalog of Iran
Authors: Anooshiravan Ansari, Assadollah Noorzad, Hamid Zafarani
Venue: Computers Geosciences (2009)

Identification and classification of different seismotectonic provinces with similar characteristics in a region of interest is one of the most important subjects in seismic hazard studies. This task is usually done through subjective interpretations based on geological and seismotectonic information. Seismic data is one of the most important sources of information where visual inspection of this data is a traditional way of identification of seismotectonic provinces. Pattern recognition of historical and instrumental seismic data in a non-subjective way provides more robust results and is a more suitable tool for extracting useful knowledge from a huge amount of data. In this study, applicability and usefulness of an unsupervised fuzzy clustering algorithm in identification of hidden patterns among historical and instrumental seismic catalog of Iran is examined through a comparison between the results of such an analysis and the proposed models for seismotectonic provinces of Iran. The clustering method used in this study is based on fuzzy modification of the maximum likelihood estimation and has the capability to detect elliptical clusters with variable size. Moreover, fuzzy hyper-volume and partition density indexes are used as performance indexes for selection the best number of clusters. The comparison between the results of clustering analyses and the seismotectonic models of Iran reveals that it is possible to partition the spatially distributed epicenters of earthquake events into distinct. These partition units, or clusters, are generally in good agreement with the proposed seismotectonic provinces of Iran and show major seismotectonic features of the Iranian Plateau in addition to some hidden information. Such kind of analysis provides a mathematical basis for seismological interpretations of seismic activities. Moreover, the comparisons of the results of clustering analysis among historical data, combination of historical and instrumental data and major earthquakes with magnitude greater than 5.0 shows that the best results will be achieved by the clustering of major events (i.e. Mw>5.0).
The influence of rain on satellite link availability at Ku- and Ka-bands in Saudi Arabia
Authors: Abdulaziz Salem Al-Ruwais
Venue: Space Communications (1998)

An assessment of rain attenuation on satellite link availability within Saudi Arabia at Ku- and Ka-bands is presented. The calculation of rain attenuation depends on a locally generated rain map, which differs from the rain climatic regions established by the CCIR. The variation of rain attenuation at Ku- and Ka-bands with elevation angle is presented. Results of up and down link rain margins versus total system availability are given for the Ku- and Ka-bands. A comparison with the predictions based on the current CCIR results shows that rain attenuation is underestimated significantly in some regions within Saudi Arabia.
Power Aware External Bus Arbitration for System-on-a-Chip Embedded Systems
Authors: Ke Ning, David Kaeli
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

Power efficiency has become a key design trade-off in embedded system designs. For system-on-a-chip embedded systems, an external bus interconnects embedded processor cores, I/O peripherals, a direct memory access (DMA) controller, and off-chip memory. External memory access activities are a major source of energy consumption in embedded systems, and especially in multimedia platforms. In this paper, we focus on the energy dissipated due to the address, data, and control activity on the external bus and supporting logic. We build our external bus power model on top of a cycle-accurate simulation framework that quantifies the bus power based on memory bus state transitions. We select the Analog Devices ADSP-BF533 Blackfin processor as our target architecture model. Using our power-aware external bus arbitration schemes, we can reduce overall external bus power by as much as 18% in video processing applications, and by 14% on average for the test suites studied. Besides reducing power consumption, we also obtained an average bus performance speedup of 21% when using our power-aware arbitration schemes.
A process variation tolerant self-compensating FinFET based sense amplifier design
Authors: Aarti Choudhary, Sandip kundu
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

With the emerging nanoscale devices, SIA roadmap identifies FinFET as a candidate for post-planar end-of-roadmap CMOS device. Lithography related CD variations, fluctuations in dopant density, oxide thickness and parametric variations of devices are identified as a major challenge to the classical bulk type MOSFET in ITRS. Yield loss due to device and process variation has never been so critical to cause failure in circuits. Due to growth in size of embedded SRAMs as well as usage of sense amplifier based signaling techniques, process variation in sense amplifiers lead to significant loss of yield. In this paper, we present a FinFET based Process Variation Tolerant Sense Amplifier design, that exploits the backgate of FinFET devices for dynamic compensation against process variation. Results from statistical simulation show that the proposed dynamic compensation is highly effective in restoring yield at a level comparable to that of sense amplifiers without significant process variations.
Bandwidth management using weighted fair queuing
Authors: Mohammed A. Qadeer, Shahid Habib, A. Yazdan Javaid
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, we present a new technique for Bandwidth allocation among users in a server controlled network in a technical, industrial or institutional setup. In creating our project we shall be using fair queuing i.e. the system which is connected to the internet and on which our software is installed will be receiving all the packets requested from the user. Then putting all packets in a queue and transmitting them after a suitable delay will guarantee that the users receive the allocated bandwidth. The method is to send all network traffic to a centralized bandwidth manager that provides prioritization, rate limiting and other related services.
Detection of Core Points in Fingerprint Images Based on Edge Map
Authors: Guo Cao, Quan-sen Sun, Zhihong Mao, Yuan Mei
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper proposes a novel yet simple and accurate technique for determination of core point in fingerprint images. Most previous works need to search the whole image domain to determine the reference point, which requires a lot of processing time. The proposed method obtains the edge map first and then performs edge pixel deletion to reduce the searching space. Finally, core point can be extracted by analyzing the orientation consistency of a few edge pixels in the fingerprint singular regions. Experimental results show that the proposed method is very fast and can effectively detect the core point for all types of fingerprint including the arch type.
Design of Class DE Amplifier with Nonlinear Shunt Capacitances for Any Output Q
Authors: Toru Ezawa, Hiroo Sekiya, Takashi Yahagi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper investigates the design curves of the class DE amplifier with the nonlinear shunt capacitances for any output Q and any grading coefficient m of the diode junction in the MOSFET. The design curves are derived by the numerical calculation using Spice. The results of this paper have two important meanings. Firstly, it is clarified that the nonlinearities of the shunt capacitances affect the design curves of the class DE amplifier, especially, for low output Q. Moreover, the supply voltage is a quite important parameter to design the class DE amplifier with the nonlinear shunt capacitances. Secondly, it is also clarified that the numerical design tool using Spice, which is proposed by authors, can be applied to the derivation of the design curves. This shows the possibility of the algorithm to be a powerful tool for the analysis of the class E switching circuits. The waveforms from Spice simulations denote the validity of the design curves.
Performance modeling in the design process
Authors: William Alexander, Richard Brice
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Performance modeling and analysis of computer systems are often ignored during the project design phase in favor of other techniques collectively known as structured design or software engineering. We describe benefits that can result from including performance analysis as an integral part of the design process. Several different goals, time frames, and roles played by performance analysis during system design are illustrated by three case studies of current projects at Los Alamos.
Simulacra
Authors: Tatchapon Lertwirojkul
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

In the vast galaxy, there is one robot planet where natural life is extinct, where only machines and robots live. One day, one robot finds a piece of organic life in his world. He's very excited about his discovery and wants to preserve the organic specimen, which is located in a dangerous and restricted area of the planet. Finally, he decides to rescue the organic specimen. Then his adventure begins.
Fighting with jelly: user-centered development of wireless infrastructure visualization tools for authoring location-based experiences
Authors: Leif Oppermann, Boriana Koleva, Steve Benford, Matt Watkins, Rachel Jacobs
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Previous research has proposed that authoring tools for location-aware mobile experiences should be extended to reveal the usually hidden ubiquitous computing infrastructure to designers so that they can take account of its characteristics when placing digital content. This paper explores this idea in practice, describing how a suite of such authoring tools has evolved through an iterative process of collaborating with artists to create a location-based game. Reflections on the design process identify the need to support the mobile capture, verification and annotation of mapping data 'in the field' and the visualization and use of this data back 'in the studio' as part of a tightly integrated workflow. We also identify the need for more powerful visualizations that can deal with multiple layers of information representing different locations and networks, and that can move between abstract and detailed views of the data on demand.
Practical robust estimators for the imprecise Dirichlet model
Authors: Marcus Hutter
Venue: International Journal of Approximate Reasoning (2009)

Walley's imprecise Dirichlet model (IDM) for categorical i.i.d. data extends the classical Dirichlet model to a set of priors. It overcomes several fundamental problems which other approaches to uncertainty suffer from. Yet, to be useful in practice, one needs efficient ways for computing the imprecise=robust sets or intervals. The main objective of this work is to derive exact, conservative, and approximate, robust and credible interval estimates under the IDM for a large class of statistical estimators, including the entropy and mutual information.
Granular-Based Linguistic Models for Identification of Process System
Authors: Keun-Chang Kwak
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This paper is concerned with a method for designing a Granular-based Linguistic Model (GLM) for identification of process system. For this purpose, a GLM is constructed by the use of fuzzy granulation realized via linguistic context-based fuzzy clustering. The proposed approach is comprised of three steps. In the first step, we use Linear Regression (LR) for global approximation. As a result, we obtain the approximation error. On the basis of the error, we construct the GLM based on the linguistic contexts produced by the error distribution for local approximation in the second step. Finally we use the Constrained Least Square Estimate (CLSE) method to generate the flexible linguistic context in the consequent part to improve the approximation performance. Finally, we use the proposed methods to identify a pH neutralization process in a continuous stirred-tank reactor (CSTR). The experimental results reveal that the proposed approach yields a better performance in comparison with linear model, Linguistic Models (LM), and GLM itself.
Implementation of scatter search for multi-objective optimization: a comparative study
Authors: R. Baños, C. Gil, J. Reca, J. Martínez
Venue: Computational Optimization and Applications (2009)

Interest in the design of efficient meta-heuristics for the application to combinatorial optimization problems is growing rapidly. The optimal design of water distribution networks is an important optimization problem which consists of finding the best way of conveying water from the sources to the users, thus satisfying their requirements. The efficient design of looped networks is a much more complex problem than the design of branched ones, but their greater reliability can compensate for the increase in cost when closing some loops. Mathematically, this is a non-linear optimization problem, constrained to a combinatorial space, since the diameters are discrete and it has a very large number of local solutions. Many works have dealt with the minimization of the cost of the network but few have considered their cost and reliability simultaneously. The aim of this paper is to evaluate the performance of an implementation of Scatter Search in a multi-objective formulation of this problem. Results obtained in three benchmark networks show that the method here proposed performs accurately well in comparison with other multi-objective approaches also implemented.
On the Efficient Execution of ProbLog Programs
Authors: Angelika Kimmig, Vítor Santos Costa, Ricardo Rocha, Bart Demoen, Luc Raedt
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The past few years have seen a surge of interest in the field of probabilistic logic learning or statistical relational learning. In this endeavor, many probabilistic logics have been developed. ProbLog is a recent probabilistic extension of Prolog motivated by the mining of large biological networks. In ProbLog, facts can be labeled with mutually independent probabilities that they belong to a randomly sampled program. Different kinds of queries can be posed to ProbLog programs. We introduce algorithms that allow the efficient execution of these queries, discuss their implementation on top of the YAP-Prolog system, and evaluate their performance in the context of large networks of biological entities.
A framework for existence tests based on the topological degree and homotopy
Authors: Thomas Beelitz, Andreas Frommer, Bruno Lang, Paul Willems
Venue: Numerische Mathematik (2009)

The invariance of the topological degree under certain homotopies is used to derive a framework for tests to computationally prove the existence of zeros of nonlinear mappings in $${\mathbb {R}^{n}}$$. These tests use interval arithmetic to enclose the range of a function over a box and are provably more general than many other tests like the Moore&#x2013;Kioustelidis test, a test based on the Krawczyk operator, and another degree&#x2013;based test published recently. A numerical example is included.
Experimental comparison of attack trees and misuse cases for security threat identification
Authors: Andreas L. Opdahl, Guttorm Sindre
Venue: Information and Software Technology (2009)

A number of methods have been proposed or adapted to include security in the requirements analysis stage, but the industrial take-up has been limited and there are few empirical and comparative evaluations. This paper reports on a pair of controlled experiments that compared two methods for early elicitation of security threats, namely attack trees and misuse cases. The 28 and 35 participants in the two experiments solved two threat identification tasks individually by means of the two techniques, using a Latin-Squares design to control for technique and task order. The dependent variables were effectiveness of the techniques measured as the number of threats found, coverage of the techniques measured in terms of the types of threats found and perceptions of the techniques measured through a post-task questionnaire based on the Technology Acceptance Model. The only difference was that, in the second experiment, the participants were given a pre-drawn use-case diagram to use as a starting point for solving the tasks. In the first experiment, no pre-drawn use-case diagram was provided. The main finding was that attack trees were more effective for finding threats, in particular when there was no pre-drawn use-case diagram. However, the participants had similar opinions of the two techniques, and perception of a technique was not correlated with performance with that technique. The study underlines the need for further comparisons in a broader range of settings involving additional techniques, and it suggests several concrete experiments and other paths for further work.
Positive effects of redundant descriptions in an interactive semantic speech interface
Authors: Lane Schwartz, Luan Nguyen, Andrew Exley, William Schuler
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Spoken language interfaces based on interactive semantic language models allow probabilities for hypothesized words to be conditioned on the semantic interpretation of these words in the context of some interfaced application environment. This conditioning may allow users to avoid recognition errors in an intuitive way, by adding extra, possibly redundant description. This paper evaluates the effect on error reduction of redundant descriptions in an interactive semantic language model. In order to evaluate the effect in natural use, the model is run on rich domains, supporting references to sets of individuals (instead of just individuals themselves) arranged in multiple continuous dimensions (a 2-D floorplan scene). Results of these experiments suggest that an interactive semantic language model allows users to achieve significantly higher recognition accuracy by providing additional redundant spoken description.
The forcing hull and forcing geodetic numbers of graphs
Authors: Li-Da Tong
Venue: Discrete Applied Mathematics (2009)

For every pair of vertices u,v in a graph, a u-v geodesic is a shortest path from u to v. For a graph G, let I"G[u,v] denote the set of all vertices lying on a u-v geodesic. Let S@?V(G) and I"G[S] denote the union of all I"G[u,v] for all u,v@?S. A subset S@?V(G) is a convex set of G if I"G[S]=S. A convex hull [S]"G of S is a minimum convex set containing S. A subset S of V(G) is a hull set of G if [S]"G=V(G). The hull number h(G) of a graph G is the minimum cardinality of a hull set in G. A subset S of V(G) is a geodetic set if I"G[S]=V(G). The geodetic number g(G) of a graph G is the minimum cardinality of a geodetic set in G. A subset F@?V(G) is called a forcing hull (or geodetic) subset of G if there exists a unique minimum hull (or geodetic) set containing F. The cardinality of a minimum forcing hull subset in G is called the forcing hull number f"h(G) of G and the cardinality of a minimum forcing geodetic subset in G is called the forcing geodetic number f"g(G) of G. In the paper, we construct some 2-connected graph G with (f"h(G),f"g(G))=(0,0),(1,0), or (0,1), and prove that, for any nonnegative integers a, b, and c with a+b>=2, there exists a 2-connected graph G with (f"h(G),f"g(G),h(G),g(G))=(a,b,a+b+c,a+2b+c) or (a,2a+b,a+b+c,2a+2b+c). These results confirm a conjecture of Chartrand and Zhang proposed in [G. Chartrand, P. Zhang, The forcing hull number of a graph, J. Combin. Math. Combin. Comput. 36 (2001) 81-94].
Research on the Algorithms for Registration in Sensor Network for Target Tracking
Authors: Ling Wu, Fa-Xing Lu
Venue: International Journal of Distributed Sensor Networks (2009)

To gain benefit from netted sensors, it is essential to correctly integrate each sensor into a global frame of reference. The process is termed sensor registration. It involves minimizing the effects of the errors from the imprecisely known relative positions or orientations of the various sensors, the biased sensor measurements, the offset sensor clocks, and so on. In the paper, a model of a typical sensor registration problem in a 2-sensor scenario is presented for illustration. Four kinds of registration errors, i.e., calibration errors (offsets), attitude (orientation) errors, position errors, and timing errors are mainly discussed in literatures, and literatures are categorized in the paper by its purpose that which one of the four kinds of errors, or which combination of the decoupled errors among them is aimed to solve. The registration errors can be viewed as constant and they can also vary or drift slowly. To address them, different kinds of algorithms have been developed. The algorithms for sensor registration can be divided into three types referred to as Type 1, Type 2, and Type 3 respectively. Algorithms of Type 1, mainly including batch processing methods and meta-heuristic optimization ones, are applied to cases that the registration errors are constant over time. Algorithms of Type 2 provide online estimation of sensor biases, but it is decoupled from the target estimation. The assumption for constant errors is relaxed, and the approaches are extended to cope with both constant and varying errors. The algorithms of Type 3 attempt to simultaneously solve for target variables and sensor systematic biases, and most of them achieve this via augmented state Kalman filter with the augmented state vector combining the target states and sensor uncertainty. References are accordingly organized by type, discussed, and annotated. Related issues of sensor registration are concerned including the non-unique detection probability, the asynchronous sensor measurements, the observability of registration problem, the relative registration and absolute registration, and the performance bounds of the estimator of the registration errors. The developed techniques for solving the problems are summarized respectively. The paper is concluded with a brief summary and some thoughts on the future trends and research directions.
A fuzzy AHP approach to personnel selection problem
Authors: Zülal Güngör, Gürkan Serhadlıoğlu, Saadettin Erhan Kesen
Venue: Applied Soft Computing (2009)

Due to the increasing competition of globalization and fast technological improvements, world markets demand companies to have quality and professional human resources. This can only be achieved by employing potentially adequate personnel. In this paper, we proposed a personnel selection system based on Fuzzy Analytic Hierarchy Process (FAHP). The FAHP is applied to evaluate the best adequate personnel dealing with the rating of both qualitative and quantitative criteria. The result obtained by FAHP is compared with results produced by Yager's weighted goals method. In addition to above-mentioned methods, a practical computer-based decision support system is introduced to provide more information and help manager make better decisions under fuzzy circumstances.