ppxscal/embedding_network huggingface dataset:
Experiments with latent semantic analysis for word tagging
Authors: Ashraf Anwar
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

In this paper I show the possible use of Latent Semantic Analysis (LSA) as an aid for word tagging and ambiguity resolution for words in test sentences. The idea is to use large corpora of training sentences, previously tagged by a human expert; for building an LSA "engine" that is used to aid in tagging future test sentences. Various training and testing phases were done. The results show that LSA seems to do somewhat fair; compared to other statistical word tagging and ambiguity resolution methods. However, there is one main drawback for this approach; the accuracy of word tagging depends on the training corpus.
Efficient distribution-free learning of probabilistic concepts
Authors: M. J. Kearns, R. E. Schapire
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A model of machine learning in which the concept to be learned may exhibit uncertain or probabilistic behavior is investigated. Such probabilistic concepts (or p-concepts) may arise in situations such as weather prediction, where the measured variables and their accuracy are insufficient to determine the outcome with certainty. It is required that learning algorithms be both efficient and general in the sense that they perform well for a wide class of p-concepts and for any distribution over the domain. Many efficient algorithms for learning natural classes of p-concepts are given, and an underlying theory of learning p-concepts is developed in detail.
Depth-variant spectral characteristics of submersed aquatic vegetation detected by Landsat 7 ETM+
Authors: H. J. Cho
Venue: International Journal of Remote Sensing (2007)

Spectral variations along depth profiles were compared using two subsets of a Landsat 7 Enhanced Thematic Mapper (ETM+) scene to test the difference between submersed aquatic vegetation (SAV) and non-vegetated bare substrate in their depth-induced spectral variation. Field-surveyed water depth and SAV cover along transects were overlaid with the satellite image of Lake Pontchartrain, LA, USA. Digital numbers on the survey transects for each band and for band ratios were correlated with depth and vegetation cover. Band 1/band 3 correlated well with depth in both SAV and bare substrates, indicating that this ratio least reflects the effect of SAV. The ratio of bands 2 and 1 correlated best with vegetation cover within the shallow estuarine waters. Correlations between depth and the ratio of band 2/band3 showed contrasting results between the two substrate types (SAV and bare), suggesting that the depth-induced variations in the band ratio can be used as indicators of SAV.
Domain specific language implementation via compile-time meta-programming
Authors: Laurence Tratt
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2008)

Domain specific languages (DSLs) are mini-languages that are increasingly seen as being a valuable tool for software developers and non-developers alike. DSLs must currently be created in an ad-hoc fashion, often leading to high development costs and implementations of variable quality. In this article, I show how expressive DSLs can be hygienically embedded in the Converge programming language using its compile-time meta-programming facility, the concept of DSL blocks, and specialised error reporting techniques. By making use of pre-existing facilities, and following a simple methodology, DSL implementation costs can be significantly reduced whilst leading to higher quality DSL implementations.
A fuzzy measure identification method by diamond pairwise comparisons and $${\phi_s}$$ transformation
Authors: Eiichiro Takahagi
Venue: Fuzzy Optimization and Decision Making (2008)

We propose an identification method of fuzzy measures by diamond pairwise comparisons. Right and left side of the diamond means ordinal weights' comparison and up and down means interaction degrees. From the comparisons, we estimate a hierarchy diagram with interaction degrees and weights of evaluation items using the agglomerative hierarchical clustering method. From the diagram, to identify the fuzzy measure, $${\phi_s}$$ conversion method is proposed.
Completely green one-step fabrication of gold patterned-flexible film
Authors: Hiroshi Shiigi, Naonobu Yoshi, Yojiro Yamamoto, Masashi Iwamoto, Tsutomu Nagaoka
Venue: Microelectronic Engineering (2008)

We have developed a new technique for the preparation of conducting nanoparticle patterned film, which consisted of gold nanoparticles on a flexible polyethylene terephthalate substrate through a one-step straightforward procedure. The totally green approach toward the fabrication of metal-patterned flexible films ensures energy savings and reduced environmental releases by using presynthesized Au nanoparticles along with a nonhazardous reducer without employing sophisticated instruments. A favorable electrical resistivity (7.5x10^-^6@Wcm), which corresponds to the resistivity of bulk Au (1.3x10^-^6@Wcm) and good adhesiveness between Au nanoparticle layer and base material were obtained.
Textural characterization from various representations of MERIS data
Authors: G. Christoulas, V. Tsagaris, V. Anastassopoulos
Venue: International Journal of Remote Sensing (2007)

Texture characteristics of MERIS data based on the Gray-Level Co-occurrence Matrices (GLCM) are explored in this work as far as their classification capabilities are concerned. Classification is employed in order to reveal four different land cover types, namely: water, forest, field and urban areas. The classification performance for each cover type is studied separately on each spectral band, while the combined performance of the most promising spectral bands is explored. In addition to GLCM, spectral co-occurrence matrices (SCM) formed by measuring the transition from band-to-band are employed for improving classification results. Conventional classifiers and voting techniques are used for the classification stage. Furthermore, the properties of texture characteristics are explored on various types of grayscale or RGB representations of the multispectral data, obtained by means of principal components analysis (PCA), non-negative matrix factorization (NMF) and information theory. Finally, the accuracy of the proposed classification approach is compared with that of the minimum distance classifier.
An empirical performance analysis of minimal and non-minimal routing in cube-based OTIS multicomputers
Authors: Hashem Hashemi Najaf-abadi, Hamid Sarbazi-Azad
Venue: Journal of High Speed Networks (2007)

In this study, the performance of virtual cut-through switching in the cube-based OTIS architecture, an optoelectronic interconnection architecture for multicomputer systems, is empirically analyzed. Deadlock-free deterministic and adaptive minimal path routing algorithms for this architecture are introduced, and the effects of different network and traffic parameters on average message latency are investigated. This analysis presents a relatively more realistic view of the OTIS architecture than that presented in previous work by considering issues related to a lower level of abstraction (the routing and switching of messages). Among other results, the analysis indicates that depending on the traffic pattern, minimal path routing in these architectures may cause extreme congestion to occur over certain channels of the network, resulting in severe performance degradation. Alternative non-minimal path routing schemes are therefore suggested and their performance compared. One of the non-minimal approaches suggested is found to be able to sustain at least half the maximum possible bandwidth under all studied traffic patterns. Yet determining a single routing algorithm that is capable of attaining the highest possible throughput for all different traffic patterns remains an open problem. A constraint-based analysis of the effect of dimensionality on performance is also conducted.
Cell Swapping Based Migration Methodology for Analog and Custom Layouts
Authors: Shabbir H. Batterywala, Sambuddha Bhattacharya, Subramanian Rajagopalan, Hi-Keung Tony Ma, Narendra V. Shenoy
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Layout migration is an important step in design reuse. This paper presents a cell swapping based methodology to migrate hierarchical layouts from one technology to another. The migrated layouts retain both layout hierarchy and swapped cell sanctity. The proposed methodology swaps cell instances, marks these instances as fixed, builds broken connectivity due to cell swapping, and then uses a variant of hierarchical compaction for layout migration. Specifically, constraints for cells marked as fixed are formulated differently from standard hierarchical compaction. This ensures that such cells are unaltered in the migrated layout. In this work, a layout migration engine is developed that supports hierarchical compaction with cell swapping. Using the aforementioned methodology, industrial designs are migrated across technologies with the layout migration engine.
Zimmermann Telegram: The Original Draft
Authors: Joachim von zur Gathen
Venue: Cryptologia (2007)

This article presents the original draft of the Zimmermann telegram from 1917 in facsimile. Its various annotations provide interesting insights, such as the idea to promise California to Japan and instructions concerning transmission and encryption. Further documents clarify how the telegram was sent and put various alternatives suggested in the literature to rest. The political background and fallout in Germany are discussed, as well.
Application of the Crosta technique for alteration mapping of granitoidic rocks using ETM+ data: case study from eastern Tauride belt (SE Turkey)
Authors: D. Aydal, E. Arda, Ö. Dumanlilar
Venue: International Journal of Remote Sensing (2007)

The present study particularly focuses on the determination of alteration products of the granitoid associations by remote sensing techniques. Widespread magmatism has occurred in the Malatya-Elazığ area of the eastern Tauride belt in south east Turkey as a consequence of plate convergence and continental collision. The development of the magmatism in the study area can be subdivided into two separate phases, the Baskil and the Bilaser Tepe complexes. Based on the petrographic and bulk-rock geochemical data, the Baskil granitoids are classified as quartz-diorite, quartz-monzodiorite and tonalite, whereas the Bilaser Tepe granitoids are classified as granodiorite and dacite-porphyry. Both the Baskil and Bilaser Tepe granitoids have peraluminous and metaluminous compositions. The Crosta method is found to be very useful for enhancing the altered areas with hydroxyl and iron oxide minerals. The Crosta method is applied to six (1, 2, 3, 4, 5 and 7) and two sets of four (1, 3, 4, 5 and 1, 4, 5, 7) bands of ETM+ data. However, the areas with potassic, phyllic, argillic and propylitic alteration zones are enhanced much better by using six bands of Landsat 7 ETM+ data. The alteration differences of these two magmatic groups are also tested with the Crosta technique using four band combinations. Although no distinct difference is observed on the hydroxyl image, a clear difference is observed between the two magmatites on the iron oxide image. The present study shows that the Crosta technique is not only generating hydroxyl and iron oxide images, but also differentiates between two magmatite groups of different ages and genesis.
Intra-stream encoding for multiple depth streams
Authors: Sang-Uok Kum, Ketan Mayer-Patel
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Using multiple cameras, a dynamic real world scene can be captured, represented, and streamed for realistic interaction in a 3D immersive system. One method to represent the dynamic environment is to use multiple depth streams - streams with color and depth information. However the captured data is too large to be streamed uncompressed. Fortunately, these data exhibit spatial and temporal coherence that can be used for compression. In this paper, we examine the initial step in compressing multiple depth streams. To use spatial coherence between streams to compress multiple depth streams, base reference streams - intrastreams - have to be encoded without the use of other depth streams. We investigate encoding of this base depth stream using only temporal coherence. The proposed algorithm extends video stream encoding techniques to encode color and depth. We show that for encoding a depth stream which requires high quality, such as base reference streams, using separate motion vectors to encode color and depth performs better than using a single motion vector.
Sound, complete and scalable path-sensitive analysis
Authors: Isil Dillig, Thomas Dillig, Alex Aiken
Venue: ACM SIGPLAN Notices (2008)

We present a new, precise technique for fully path- and context-sensitive program analysis. Our technique exploits two observations: First, using quantified, recursive formulas, path- and context-sensitive conditions for many program properties can be expressed exactly. To compute a closed form solution to such recursive constraints, we differentiate between observable and unobservable variables, the latter of which are existentially quantified in our approach. Using the insight that unobservable variables can be eliminated outside a certain scope, our technique computes satisfiability- and validity-preserving closed-form solutions to the original recursive constraints. We prove the solution is as precise as the original system for answering may and must queries as well as being small in practice, allowing our technique to scale to the entire Linux kernel, a program with over 6 million lines of code.
On Efficient and Robust Constraint Generation for Practical Layout Legalization
Authors: Sambuddha Bhattacharya, Shabbir H. Batterywala, Subramanian Rajagopalan, Hi-Keung Tony Ma, Narendra V. Shenoy
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Sub-wavelength lithography in modern fabrication processes has resulted in a tremendous increase in the number of design rules. Of these, the context dependent design rules are especially hard to adhere to during manual layout creation. Layout legalization or automatic correction of design rule violation, therefore, has attained prime importance. Layout legalization can be modeled as a modified layout compaction problem. Generation of constraints from a given layout is a crucial step in compaction. In this paper, we propose a systematic framework for constraint generation that identifies context dependent rules and ensures legal layout upon compaction. In addition, we suggest practical schemes for reducing the legalization problem size that results in subsequent efficient solution.
Uncovering deep user context from blogs
Authors: Robert McArthur
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

People's utterances are fundamentally different to other documents because they are more immediate and less thought through. While this makes them more natural - noisy and unstructured - it provides an unrivalled opportunity to see "inside" the author, to collect some context. The data requires analysis methods that have a relationship to human information processing: socio-cognitively motivated semantic systems. Using HAL, a method validated by cognitive science, the text from a large number of blog entries was analysed to uncover changes in entries author's sense-of-self. Sense-of-self was measured through geometric projection of author's first-person usage onto key indicators of kin and negative emotion words. An example of non-clinical qualitative evaluation affirmed the utility and promise of the technique: that deep personal context can be uncovered from utterances through the appropriate analysis and inference.
On Non-Approximability of Coarse-Grained Workflow Grid Scheduling
Authors: Noriyuki Fujimoto
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Scheduling a scientific workflow onto a computational grid is considered. A computational grid can be regarded as a heterogeneous parallel machine such that the speed of each processor varies over time. A scientific workflow can be modeled as a DAG of tasks. This paper focuses on a coarse-grained workflow. So, any communication delay between tasks is negligible because computation time of every task is much longer than the corresponding communication delay. Hence, in this paper, a coarse-grained workflow grid scheduling problem (WSP for short) is defined as an extension of the classical precedence constrained scheduling problem over a uniform parallel machine with processor speed fluctuation. The objective of our problem is to minimize the makespan of a schedule. It is known that no approximation algorithm exist if a grid has a very long period with zero spare computing power. However, such situation seems to be unrealistic. This paper gives a proof that, unless P=NP, WSP is not approximable within a factor of 1.5 even if accurate performance prediction is possible, all processors have the same peak speed, and speed of every processor at any time is restricted to either 50% or 100% of the peak speed. Since the quite restricted problem is not approximable, any more general problem such that accurate performance prediction is impossible and/or processor speed fluctuation pattern isnot restricted is also not approximable. So, the proof implies that WSP is not approximable within a factor of 1.5 in realistic grid environment unless P=NP.
A generic flow algorithm for shared filter ordering problems
Authors: Zhen Liu, Srinivasan Parthasarathy, Anand Ranganathan, Hao Yang
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environment. Each query is a conjunction of boolean filters, and each filter could be shared across multiple queries. We are required to design an evaluation plan that evaluates filters against stream items in order to determine the set of queries satisfied by each item. The evaluation plan specifies for each item: (i) the subset of filters evaluated for this item and the order of their evaluations, and (ii) the processor on which each filter evaluation occurs. Our goal is to design an evaluation plan which maximizes the total throughput (flow) of the stream handled by the plan, without violating the processor capacities. Filter ordering has received extensive attention in single-processor settings, with the objective of minimizing the total cost of filter evaluations: in particular, efficient (approximation) algorithms are known for various important versions of min-cost filter ordering. Min-cost filter ordering problem for a single processor is a special case of our flow maximization for parallel processors. Our main contribution in this work is a generic flow-maximization algorithm, which assumes the availability of a min-cost filter ordering algorithm for a single processor, and uses this to iteratively construct a solution to the flow-maximization problem for heterogenous parallel processors. We show that the approximation ratio of our flow-maximization strategy is essentially the same as that of the underlying min-cost filter ordering algorithm. Our result, along with existing results on min-cost filter ordering, enables the optimization of several important versions of filter ordering in parallel environments.
Supporting social practice learning in NGOs
Authors: Till Schümmer, Jörg M. Haake
Venue: Proceedings of the hypertext 2008 workshop on Collaboration and collective intelligence (2008)

The exchange of best practice is an essential ingredient for collaborative voluntary action in non-governmental organizations (NGOs). While current approaches for learning social practice focus on adopting and describing best practice individually, they fail to address collaborative detection and description of best practice in organizations. We propose a pattern-based approach, which facilitates collaborative creation, improvement, and sharing of social best practice via Web 2.0 concepts.
IκB, NF-κB regulation model: simulation analysis of small number of molecules
Authors: Anamika Sarkar, Marina Meila, Robert B. Franza
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2007)

The regulation of IκB, NF-κB is of foremost interest in biology as the transcription factor NF-κB has multiple target genes. We have modeled a previously published model by Hoffmann et al. (2002) of IκB, NF-κB mathematically as discrete reaction systems. We have used stochastic algorithm to compare the results when there are large and small numbers of molecules available in a finite volume for each protein. Our results for small number of molecules show that with continuous presence of stimulation, nuclear NF-κB oscillates continuously in every individual cell rather than damping, which was observed in cell population results. This characteristic of the system is missed when averaged behavior is studied.
Direct adaptive fuzzy control for a class of MIMO nonlinear systems
Authors: Salim Labiod, Thierry Marie Guerra
Venue: International Journal of Systems Science (2007)

This article presents a direct adaptive fuzzy control scheme for a class of uncertain continuous-time multi-input multi-output nonlinear (MIMO) dynamic systems. Within this scheme, fuzzy systems are employed to approximate an unknown ideal controller that can achieve control objectives. The adjustable parameters of the used fuzzy systems are updated using a gradient descent algorithm that is designed to minimize the error between the unknown ideal controller and the fuzzy controller. The stability analysis of the closed-loop system is performed using a Lyapunov approach. In particular, it is shown that the tracking errors are bounded and converge to a neighborhood of the origin. Simulations performed on a two-link robot manipulator illustrate the approach and exhibit its performance.
Performance of channel allocation techniques for uni-directional & bi-directional call using 50 channels
Authors: M. Irfan Anis, M. Ibrar-ul-haque, M. Zamin Khan, M. Nadeem Iqbal
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

Traffic congestion in mobile system generally results in call blocking, thereby degrading the service. The aim of Dynamic Channel Allocation (DCA) technique is to offer as many subscribers as possible to use the mobile networks simultaneously in the condition of limited channel resources and certain traffic load of the network. Thus channel assignment techniques will impact on the blocking of call. Comparison shows the blocking probability in network for 50 and 100 channels for DCA. A significant gain in blocking probability of Bi-directional calls as compared to the uni-directional calls is achieved. The significance of having lower blocking probability is that for a particular value of blocking probability, DCA can support a higher load for each call as compared to FCA technique. As expected the DCA for bi-directional calls has the lowest blocking probability.