ppxscal/embedding_network huggingface dataset:
Understanding the drivers, enablers, and performance of knowledge management in public organizations
Authors: Loo Geok Pee, Atreyi Kankanhalli
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Public organizations are increasingly investing in knowledge management (KM) initiatives. However, most KM concepts, practices, and tools have mainly been developed and studied in the private sector and there is a lack of understanding of KM in public organizations. This paper addresses the gap by discussing the differences between public and private organizations in their KM endeavors. Specifically, KM drivers in the context of public organizations are first identified. Salient KM enablers and how they may differentially affect the success of KM initiatives in public and private organizations are then discussed. Finally, tools for assessing KM performance in public organizations are suggested, in view of their unique organizational objectives.
A fuzzy quantization approach to image retrieval based on color and texture
Authors: Xinzhong Zhu, Jianmin Zhao, Jie Yuan, Huiying Xu
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

This paper presents a new image retrieval method which is based on color and texture features. By using fuzzy quantization (which is based on a linear subjection function in the quantization of HSV color space), this method attempts to make the quantization results more accessible to human perception; furthermore, according to the information of the extracted dominant color of partition, we introduce a neighborhood color matrix which is used to describe the relative color spatial distribution, for the purpose of improving the robustness of image transfiguration. With the supplementary information of image textures, our method combines both the image and texture features to conduct composite image retrieval. Our experimental results show that this method can greatly improve the retrieval accuracy.
A collaborative multimodal handwriting training environment for visually impaired students
Authors: Peter Reid, Beryl Plimmer
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

The spatial motor skills used for handwriting are particularly difficult for visually impaired people to develop. These skills are required in order to sign an aesthetically pleasing and repeatable signature, which is often required for documents such as legal agreements and job applications. Our multimodal system with haptic guidance, sonification and tactile feedback is designed to assist when teaching visually impaired students to form letters, and eventually, a signature. As tactile technologies become commonplace, appearing even in mobile phones, our system may also provide useful insight into the use of nonvisual feedback for a variety of applications.
Comparison of T-shaped microstrip antenna and U-shaped microstrip antenna
Authors: Mohamed Ismaeel, T. Jayanthy
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

In this paper a comprehensive parametric study has been carried out to understand the effects of U patch antenna and T-patch antennas to optimize the performance of the final design. The theoretical simulations are performed using SONNET software. The results are obtained for U-shaped antennas and T-patch antenna to compare the simulation results.
Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Authors: Kimmo Varpaaniemi, Leo Ojala
Venue: Fundamenta Informaticae (2008)

Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism is one of the most appropriate formalisms for reachability analysis oriented modelling. Quantum teleportation and dense coding are non-classical communication protocols that have been widely researched in the field of quantum computing. In this article, we present predicate/transitionnet models of these two protocols and use the PROD reachability analysis tool for analysing the models.
Spatiotemporal Relational Probability Trees: An Introduction
Authors: Amy McGovern, Nathan C. Hiers, Matthew Collier, David J. Gagne II, Rodger A. Brown
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We introduce spatiotemporal relational probability trees (SRPTs), probability estimation trees for relational data that can vary in both space and time. The SRPT algorithm addresses the exponential increase in search complexity through sampling. We validate the SRPT using a simulated data set and we empirically demonstrate the SRPT algorithm on two real-world data sets.
Verbal Roots in the Sanskrit Wordnet
Authors: Malhar Kulkarni, Pushpak Bhattacharyya
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

This paper aims to present a way of storing Sanskrit Verbal roots in a proposed Sanskrit WordNet. The synsets of verbal roots are proposed to be created using all the available dhātupāṭhas. While doing so, it is shown that various formal as well as semantic features of the verbal roots noted by Pānini should be taken into account and stored. This will serve the purpose of disambiguation. It is also shown that verbal roots that denote a different meaning when they occur with upasargas should be stored separately and linked to the synset of the changed meaning. This feature is peculiar to Sanskrit WordNet. Since, IIT Bombay has already developed Hindi as well as Marathi WordNets, information related to storing verbal roots in these two is also presented.
The impact of frame semantic annotation levels, frame-alignment techniques, and fusion methods on factoid answer processing
Authors: Bahadorreza Ofoghi, John Yearwood, Liping Ma
Venue: Journal of the American Society for Information Science and Technology (2009)

The impact of frame semantic enrichment of texts on the task of factoid question answering (QA) is studied in this paper. In particular, we consider different techniques for answer processing with frame semantics: the level of semantic class identification and role assignment to texts, and the fusion of frame semantic-based answer-processing approaches with other methods used in the Text REtrieval Conference (TREC). The impact of each of these aspects on the overall performance of a QA system is analyzed in this paper. The TREC 2004 and TREC 2006 factoid question sets were used for the experiments. These demonstrate that the exploitation of encapsulated frame semantics in FrameNet in a shallow semantic parsing process can enhance answer-processing performance in factoid QA systems. This improvement is dependent on the level of semantic annotation, the frame semantic alignment method, and the method of fusing frame semantic-based answer-processing models with other existing models. A more comprehensively annotated environment with all different part-of-speech target predicates provides a higher chance of correct factoid answer retrieval where semantic alignment is based on both semantic classes and a relaxed set of semantic roles for answer span identification. Our experiments on fusion techniques of frame semantic-based and entity-based answer-processing models show that merging answer lists with respect to their scores and redundancy by exploiting a fusion function leads to a more effective overall factoid QA system compared to the use of individual models. &copy; 2009 Wiley Periodicals, Inc.
Using Application Bisection Bandwidth to Guide Tile Size Selection for the Synchroscalar Tile-Based Architecture
Authors: John Oliver, Diana Franklin, Frederic T. Chong, Venkatesh Akella
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

This paper investigates the impact of proper tile size selection on the power the power consumption for tile-based processors. We refer to this investigation as a tile granularity study. This is accomplished by distilling the architectural cost of tiles with different computational widths into a system metric we call the Granularity Indicator (GI). The GI is then compared against the bisection bandwith of algorithms when partitioned across multiple tiles. From this comparison, the tile granularity that best fits a given set of algorithms can be determined, reducing the system power for that set of algorithms. When the GI analysis is applied to the Synchroscalar tile architecture[1], we find that Synchroscalar's already low power consumption can be further reduced by 14% when customized for execution of the 802.11a reciever. In addition, the GI can also be a used to evaluate tile size when considering multiple applications simultaneously, providing a convenient platform for hardware-software co-design.
Bayesian inference for the hazard term structure with functional predictors using Bayesian predictive information criteria
Authors: Tomohiro Ando
Venue: Computational Statistics Data Analysis (2009)

A Bayesian method for estimation of a hazard term structure is presented in a functional data analysis framework. The hazard terms structure is designed to include the effects of changes in economic conditions, as well as trends in stock prices and accounting variables from financial statements. The hazard function contains time-varying parameters that are modelled using splines. To estimate the model parameters, a Markov-chain Monte Carlo sampling algorithm is developed. The Bayesian predictive information criterion is employed to assess the default predictive power of the estimated model. The method is then applied to a Japanese firm's default data listed on the Japanese Stock Exchange. The results demonstrate that the proposed method performs well.
Using neural network method to solve marker making "calculation of fabric lays quantities" efficiency for optimum result in the apparel industry
Authors: Mahmut Kayar, Yelda Ozel
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

Using Artificial Neural Network (ANN) method aims to obtain the highest productivity for "calculation of fabric lays quantities" process in cutting department of apparel industry. The calculations of fabric lays quantities (FLQC) provide us with the exact length of the marker making. Fitting the marker making with spreading table and at the same time the possibility of spreading more than one marker making on the same table, shows the importance of estimating the length of the marker making (MM). A system was created by applying the ANN methods to marker making length data used in the industry. Using different possible calculations of fabric lays quantities findings, marker making lengths are approximated resulting in that the most optimum "calculations of fabric lays quantities" have been decided.
Construction of active steering control system for the curving performance analysis of the scaled railway vehicle
Authors: Min-Soo Kim, Joon-Hyuk Park, Won-Hee You
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This paper describes the construction of active steering control system for the curving performance analysis of scaled railway vehicle. Active steering system of railway vehicles is designed to alleviate wheel/rail contact forces and to decrease wheel/rail wear. The active steering control system consists of the remote control station module, the steering controller module, the battery module, the driving bogie module, the steering bogie module, and various sensors module. The proposed active steering control system is tested in the 1/5 scale research vehicle and R=20 curved track, and we could verify the effectiveness and performance of the proposed system.
Global Storing Mechanisms for Tabled Evaluation
Authors: Jorge Costa, Ricardo Rocha
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Arguably, the most successful data structure for tabling is tries. However, while tries are very efficient for variant based tabled evaluation, they are limited in their ability to recognize and represent repeated terms in different tabled calls or/and answers. In this paper, we propose a new design for the table space where tabled terms are stored in a common global trie instead of being spread over several different tries.
Adaptive TetraPuzzles: efficient out-of-core construction and visualization of gigantic multiresolution polygonal models
Authors: Paolo Cignoni, Fabio Ganovelli, Enrico Gobbetti, Fabio Marton, Federico Ponchio, Roberto Scopigno
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

We describe an efficient technique for out-of-core construction and accurate view-dependent visualization of very large surface models. The method uses a regular conformal hierarchy of tetrahedra to spatially partition the model. Each tetrahedral cell contains a precomputed simplified version of the original model, represented using cache coherent indexed strips for fast rendering. The representation is constructed during a fine-to-coarse simplification of the surface contained in diamonds (sets of tetrahedral cells sharing their longest edge). The construction preprocess operates out-of-core and parallelizes nicely. Appropriate boundary constraints are introduced in the simplification to ensure that all conforming selective subdivisions of the tetrahedron hierarchy lead to correctly matching surface patches. For each frame at runtime, the hierarchy is traversed coarse-to-fine to select diamonds of the appropriate resolution given the view parameters. The resulting system can interatively render high quality views of out-of-core models of hundreds of millions of triangles at over 40Hz (or 70M triangles/s) on current commodity graphics platforms.
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
Authors: Xibin Lin, Chang-An Zhao, Fangguo Zhang, Yanming Wang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves with k = 12. The case k = 9 has not been studied in the literature, and so it is not clear how efficiently pairings can be computed in that case. In this paper, we present efficient methods for the k = 9 case, including generation of elliptic curves with the shorter Miller loop, the denominator elimination and speed up of the final exponentiation. Then we compare the performance of these choices. From the analysis, we conclude that for pairing-based cryptography at the AES 128 security level, the Barreto-Naehrig curves are the most efficient choice, and the performance of the case k = 9 is comparable to the Barreto-Naehrig curves.
Speech-activated user interfaces and climbing Mt. Exascale
Authors: Tessa Lau, Daniel Reed
Venue: Communications of the ACM (2009)

The Communications Web site, cacm.acm.org, features 13 bloggers in the BLOG@CACM community. In each issue of Communications, we'll publish excerpts from selected posts, plus readers' comments. Tessa Lau discusses why she doesn't use the touch screen on her in-car GPS unit anymore and Daniel Reed considers the future of exascale computing.
Fine-grained efficient resource allocation using approximated combinatorial auctions: A parallel greedy winner approximation for large-scale problems
Authors: Naoki Fukuta, Takayuki Ito
Venue: Web Intelligence and Agent Systems (2009)

Combinatorial auctions, one of the most popular market mechanisms, have a huge effect on electronic markets and political strategies. Combinatorial auctions provide suitable mechanisms for efficient allocation of resources to self-interested attendees. On the other hand, efficient resource allocation is also becoming crucial in many computer systems that should manage resources efficiently. Considering ubiquitous computing scenarios, the ability to complete an auction within a fine-grained time period without loss of allocation efficiency is in strong demand. Furthermore, to achieve such scenarios, it is very important to handle a large number of bids in an auction. In general, the optimal winner determination problem of a combinatorial auction is NP-hard. Thus, much work focuses on tackling the computational costs for winner determination. In this paper, we show that our approximation algorithms provide sufficient quality of winners for auctions that have a large number of bids on hard time constraints. Furthermore, we compare and discuss desirable properties of such approximation algorithms to be embedded in application systems.
Real-time estimation of olive oil quality parameters: a combined approach based on ANNs and machine vision
Authors: Monica Carfagni, Marco Daou, Rocco Furferi
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The present work describes a combined approach based on Artificial Neural Networks and Machine Vision for the real-time estimation of some qualitative olive oil parameters. The proposed methodology proves to be a useful tool for the real-time estimation of acidity level and of peroxides number of olive oil extracted with a continuous extraction process. The two qualitative parameters are estimated on the basis of a number of technological and agronomical parameters. Some of the parameters correlated to the sanitary condition of olives and to ripeness are evaluated by means of image processing algorithms. The estimation may be performed during the extraction thus allowing a quality control of the oil quality without the requirement of a time-expensive chemical analysis.
An overview of a network design system
Authors: W. E. Bracker, B. R. Konsynski
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

During the past few years there has been an increasing trend toward the development of on-line computer systems. By 1980 it is estimated that 70--80 percent of all larger computer installations will support some networking capability. This trend has resulted in an increasing network user population and varying applications for computer-communication networks. Furthermore, due to economics, the prevalence of single-application networks is giving way to increasing numbers of multi-application networks.
Novel polarization interference imaging spectroscope
Authors: Chunmin Zhang, Baochang Zhao, Yingcai Li, Zhilin Yuan, Xiaohua Jian, Lanyan Zhu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

A novel principle and scheme of Polarization Interferometer Imaging Spectroscope has been proposed. A wide-field-of-view polarization Interference imaging spectrometer (WPIIS) based on a Savart polariscope, without moving parts, and with a narrow slit has been designed and developed. The primary feature of the WPIIS is the target image as well as the interferogram and polarization information can be obtained at the same time in the spatial domain and are recorded by a two-dimensional CCD camera. The field of view of the WPIIS will be extend 3--5 times as large as a common interference imaging spectrometer, and the throughput will raise 1--2 orders of magnitude. The total optics is as small as 531.1 X 150 X 243mm3 in size, and 5.5kg in mass, the spectral resolution of the prototype system is 81.38cm-1 between 0.48&mu;m and 0.96&mu;m (&lambda;=480nm, &delta; &lambda;=1.87nm; &lambda;=960nm, &delta; &lambda;=7.5nm). The WPIIS has advantages of ultra-compact size, wide field of view, high throughput and without any moving parts. The optics system and especially principle is described, and the experimental result of the Interference Imaging spectrum is show.
Designing loop condition constraint model for join point designation diagrams (JPDDs)
Authors: Bahram Zarrin, Rodziah Atan, Muhammad Taufik Abdullah
Venue: Proceedings of the 13th workshop on Aspect-oriented modeling (2009)

The specification of selection criteria (Join Point Selection) is a very important issue in the Aspect Oriented Software Development. Several models have been presented to visualize the selection criteria in the Aspect Oriented Modeling. JPDDs provides a visual means to constraint the selection of join points based on static and dynamic, structural and behavioral context. For some applications in order to call an advice, it is necessary to select the join points in programs, when specified message flow (or a block of them) should be repeated either for specified times or meeting a particular condition. this constraint cannot be visualized by JPDDs. No notation is defined to address loop structures constraint in these diagrams. This paper introduces a design model extension called Loop Condition Constraint Model (LCCM) to support these constraints in JPDDs. A scenario is used to explain this extension.
An overview of the 1974 COBOL standard
Authors: Margaret M. Cook, George N. Baird, William M. Holmes, Patrick M. Hoyt, L. Arnold Johnson, Paul Oliver
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Since 1 July 1972, all COBOL compilers brought into the Federal Government have to be identified as implementing one of the levels of the Federal COBOL Standard. The National Bureau of Standards, which has the responsibility for the development and maintenance of Federal ADP Standards, has delegated to the Department of Defense the responsibility for the operation of a Government-wide COBOL Compiler Testing Service. This responsibility is discharged by the Federal COBOL Compiler Testing Service (FCCTS), an activity of the Department of the Navy's Automatic Data Processing Equipment Selection Office Software Development Division, through the implementation and maintenance of the COBOL Compiler Validation System (CCVS), a comprehensive set of computer programs used to test COBOL compilers for compliance with the Federal COBOL Standard.
Computing compatibility in dynamic service composition
Authors: Zhaohui Wu, Shuiguang Deng, Ying Li, Jian Wu
Venue: Knowledge and Information Systems (2009)

Dynamically composing services requires mechanisms to ensure component services compatible with each other both at all of the syntax, semantic and behavioral level. This paper focuses on the issue of behavioral compatibility in a service composition. It adopts the &#x03c0;-calculus to model service behaviors and interactions in a formal way. Based on the formalization, it proposes a method to automatically check the behavioral compatibility in a qualitative way. Furthermore, it presents an algorithm to compute the compatibility degree in a quantitative way. The algorithm is implemented in a prototype and its performance analysis is also carried out to show that it can help composing services on the fly and ensure the services compatible with each other to provide functions with newly-added values.
Making Programs to Perceive Time Flow
Authors: Mauro Marcelo Mattos
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Biological rhythms in humans have cycles ranging from minutes to months. Those rhythms are based on changes in various physiological and behavioral functions of organisms that repeat at regular intervals providing a framework of temporal organization for them. This paper describes the mapping the biological clock concept from humans to machines in the context of a Knowledge-Based Operating System. We have identified three dimensions over which such a new operating system paradigm has to be based: (i) physical dimension, (ii) logical dimension, and (iii) temporal dimension. The physical dimension describes the physical components and their structural relationship. The logical dimension describes the functional characteristics of each physical component and the time dimension is provided in order to enable the entire system to perceive the time flow – as a biological clock in human beings.