ppxscal/embedding_network huggingface dataset:
Standardising SPOKEN commands for mobile devices and services
Authors: Helge Hüttenrauch, Mike Tate, Martin Böcker, Rosemary Orr, Françoise Petersen
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The current state of the art in voice-recognition technology is reaching a level of maturity that suggests sophisticated voice-based user-interface technologies will soon be available in mobile devices. As voice commands for mobile devices and services have so far been primarily limited to voice dialling and the activation of individual menu items, there is currently a window of opportunity to standardise voice commands for basic functions of mobile devices and services. ETSI, the European Telecommunications Standards Institute, has formed a Specialist Task Force (STF) to extend the existing ETSI standard ES 202 076 on voice commands for mobile services and devices. The existing published standard covers five major European languages, whereas the revised version will extend the number of languages covered to 30. This paper gives an overview of the commands and languages covered, and outlines the approach used to identify the voice commands (elicitation, validation and phonetic discrimination).
Generalized methodology for the comparison of diagnostic imaging instrumentation
Authors: Leon Kaufman, Dale Shosa
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Technology is providing exciting new ways to diagnose and characterize disease in a non-invasive manner. The decrease in morbidity and mortality that is realized by substituting pneumoencephalography and cerebral angiography by x-ray computed tomography (CT) and brain radionuclide imaging, or coronary angiography by radionuclide ventriculography and perfusion studies, cannot be easily quantitated by costeffectiveness studies. The dollar value of peace of mind, patient dignity and comfort, avoidance of blindness or loss of limb, stroke, etc., cannot be derived from system analysis.
Timing Driven Placement for Fault Tolerant Circuits Implemented on SRAM-Based FPGAs
Authors: Luca Sterpone
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Electronic systems for safety critical applications such as space and avionics need the maximum level of dependability for guarantee the success of their missions. Contrariwise the computation capabilities required in these fields are constantly increasing for afford the implementation of different kind of applications ranging from the signal processing to the networking. SRAM-based FPGA is the candidate device for achieve this goal thanks to their high versatility of implementing complex circuits with a very short development time. However, in critical environments, the presence of Single Event Upsets (SEUs) affecting the FPGA's functionalities, requires the adoption of specific fault tolerant techniques, like Triple Modular Redundancy (TMR), able to increase the protection capability against radiation effects, but on the other side, introducing a dramatic penalty in terms of performances. In this paper, it is proposed a new timing-driven placement algorithm for implementing soft-errors resilient circuits on SRAM-based FPGAs with a negligible degradation of performance. The algorithm is based on a placement heuristic able to remove the crossing error domains while decreasing the routing congestions and delay inserted by the TMR routing and voting scheme. Experimental analysis performed by timing analysis and SEU static analysis point out a performance improvement of 29% on the average with respect to standard TMR approach and an increased robustness against SEU affecting the FPGA's configuration memory.
Efficiency, Fairness and Competitiveness in Nash Bargaining Games
Authors: Deeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Recently, [8] defined the class of Linear Nash Bargaining Games (LNB) and obtained combinatorial, polynomial time algorithms for several games in this class. [8] also defines two natural subclasses within LNB, UNB and SNB, which contain a number of natural Nash bargaining games. In this paper we define three basic game theoretic properties of Nash bargaining games: price of bargaining, fairness and full competitiveness. We show that for each of these properties, a game in UNB has this property iff it is in SNB.
High-throughput low-complexity MIMO detector based on K-best algorithm
Authors: Nariman Moezzi Madani, William Rhett Davis
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Sphere Decoders (SD) have found more popularity among other MIMO detectors because of their close-to-ML error-rate performance and lower hardware complexity. One of the variants of SD is the K-best algorithm. The conventional implementations of K-best are not fast enough to be considered for hardware implementation of the emerging standards like 802.11n because of the throughput bottleneck which is the sort operation. In this work we have proposed the parallel merge algorithm (PMA), which enables us to use more pipeline levels in the system because of its short critical path, resulting in throughput increase, about 4 times compared to the other K-best implementations. Also, we have modified the K-best algorithm by discarding the calculation of unnecessary paths ,which results in a 20% decrease in area and 44% decrease in the number of operations compared to the original K-best.
New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
Authors: Hajime Tanaka
Venue: European Journal of Combinatorics (2009)

We use the Terwilliger algebra to provide a new approach to the Assmus-Mattson theorem. This approach also includes another proof of the minimum distance bound shown by W.J. Martin as well as its dual.
A Product Semantic Annotation Visualization System for Virtual Organization
Authors: Chengfeng Jian, Meiyu Zhang
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

Semantic annotation is becoming increasingly important for the on-line semantic reconstruction of the heterogeneous product information in the virtual organization (VO) with the semantic grid. Product Semantic Annotation Visualization (PSAV) is introduced. It uses AJAX/SVG to realize the visualization in the display space of the browser. It can help user to discover the potential semantic association and rebuild dynamically according to the requirement of the dynamic VO
Automatic Verification of Heap Manipulation Using Separation Logic
Authors: Josh Berdine
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Accurately representing the structure and manipulation of heap-allocated data structures is a key challenge for automatic verification of nontrivial code. Capturing this information is central to proving properties such as the absence of invalid memory accesses (for instance, deallocating memory twice or dereferencing dangling or NULL pointers), the absence of memory leaks, and data-structure integrity properties (for instance, that a doubly-linked list structure is properly linked in both directions).
A Multimedia Approach to Fluid Power System Design
Authors: Thomas G. Richards, Edmund J. Hughes, Derek G. Tilley
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

The design of fluid power systems is a multi-disciplinary activity requiring not only considerable background knowledge and experience but also the use of numerous design resources. Current design resources are fragmented and offer no structured guidance. This paper describes the first year of a three-year project to create an integrated multimedia environment for fluid power system design and instruction using Java and other Internet-based technologies. Prototype software is under development and has been tested on a number of different platforms.
Simulation study of a lightweight TDMA - based MAC protocol with adaptive power control for wireless sensor network
Authors: Rozeha Abd Rashid, Wan Mohd Ariff Ehsan W. Embong, Norsheila Fisal, Azami Zaharim
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

Wireless sensor network (WSN) is increasingly being used in a wide range of environmental application. Such applications are habitat monitoring, large-scale industrial monitoring and urban population monitoring. WSN consists of tiny wireless devices typically cooperate with each other to aggregate sensor data to the base station. Providing a reliable data transmission and efficiency in energy usage is critical in order to prolong the network lifetime. We propose an enhanced lightweight medium access control (eL-MAC) protocol which combines scheduled based MAC mechanism and adaptive transmission power control. eL-MAC solves the problems that normally happen in WSN such as idle listening, over hearing and hidden terminal problem, by introducing a slotting communication mechanism where node only transmits in its own timeslot and sleep in other time slot if there is no activity. Furthermore, eL-MAC combines this protocol with an adaptive transmission power control where node uses an optimum transmission power level without reducing packet delivery ratio. We compare our protocol with traditional carrier sense multiple access (CSMA) mechanism and the result shows our protocol gives a more reliable packet transmission and prolongs the network lifetime.
Low Power Gated Clock Tree Driven Placement
Authors: Weixiang Shen, Yici Cai, Xianlong Hong, Jiang Hu
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

As power consumption of the clock tree dominates over 40% of the total power in modern high performance VLSI designs, measures must be taken to keep it under control. One of the most effective methods is based on clock gating to shut off the clock when the modules are idle. However, previous works on gated clock tree power minimization are mostly focused on clock routing and the improvements are often limited by the given registers placement. The purpose of this work is to navigate the registers during placement to further reduce the clock tree power based on clock gating. Our method performs activity-aware register clustering that reduces the clock tree power not only by clumping the registers into a smaller area, but also by pulling the registers with the similar activity patterns closely to shut off the clock more time for the resultant subtrees. In order to reduce the impact of signal nets wirelength and power due to register clustering, we apply the timing and activity based net weighting in [14], which reduces the nets switching power by assigning a combination of activity and timing weights to the nets with higher switching rates or more critical timing. To tradeoff the power dissipated by the clock tree and the control signal, we extend the idea of local ungating in [6] and propose an algorithm of gate control signal optimization, which still sets the gate enable signal high if a register is active for a number of consecutive clock cycles. Experimental results on a set of MCNC benchmarks show that our approach is able to reduce the power and total wirelength of clock tree greatly with minimal overheads.
A performance evaluation of disassembly systems with reverse blocking
Authors: Tetsuo Yamada, Naoyuki Mizuhara, Hisashi Yamamoto, Masayuki Matsui
Venue: Computers and Industrial Engineering (2009)

For sustainable manufacturing, manufacturers should construct and design inverse manufacturing systems consisting of assembly and disassembly systems. The sorting process in the disassembly system is the first process of the whole inverse manufacturing system. Therefore, it can become a bottleneck and decrease the productivity of the whole inverse manufacturing systems. This study focuses on a disassembly system with reverse blocking in a sorting process [Yamada, T., & Matsui, M. (2003). Disassembly production systems and its design issues. Reprints of Japan Industrial Management Association, Spring meeting, Chofu, Japan, May, 144-145 (in Japanese)]. It generalizes the queuing model and discusses the performance of the disassembly system by mathematical and numerical analysis. First, the sorting process with reverse blocking is generally modeled as a queuing system. Next, the stationary state equations of the system are formulated, and the objective function is set as the throughput. Finally, the system performance is discussed by mathematical and numerical analysis in cases of a different number of stations and buffers, and also an example of the system design is shown and discussed in view of the busy rate, blocking probability and throughput.
Reputation and Uncertainty Reduction: Simulating Partner Selection
Authors: Walter Quattrociocchi, Mario Paolucci, Rosaria Conte
Venue: Trust in Agent Societies: 11th International Workshop, TRUST 2008, Estoril, Portugal, May 12 -13, 2008. Revised Selected and Invited Papers (2008)

Computer simulations of the impact of reputation in ideal marketplaces are presented. The study concentrates on the link between choices at individual level (partner selection) and system level performance, measured in terms of goods' average quality. Partner selection is based on two different information exchange settings. In L1, information conveys only agent's evaluation of a target (Image). In L2, it also transmits what is heard, but not yet necessarily checked by present informer, about a target (Reputation). The results show that in L2, the system exhibits higher tolerance for informational uncertainty.
A Web Search Analysis Considering the Intention behind Queries
Authors: Marcelo Mendoza, Ricardo Baeza-Yates
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

The identification of the intention of the users behind the queries can be useful to improve the precision of the list of documents recommended by the Web search engines. That is why, recent works have focused themselves in the construction of query classifiers following the categories proposed in the scientific literature. These works have based on query representations using two sources of main information: text and click-through data. Despite of the before mentioned we have little understanding about the nature and behaviour of the variables used to characterize queries. In this work we analyse the behaviour of the variables looking for a way to improve their comprehension and to identify the characteristics that exactly allow that the query classifiers improve their precision. The analysis shows that the variables based on text have a better performance in the discrimination of the categories than the ones based on click-through data. Among these variables, the query length (number of terms that compound a query), the Levenshtein distance between snippets and queries, and the PageRank metric are recommendable features to work with query type classifiers.
A hybrid probabilistic framework for content-based image retrieval with feature weighting
Authors: Djemel Ziou, Touati Hamri, Sabri Boutemedjet
Venue: Pattern Recognition (2009)

In this paper, we propose a probabilistic framework for efficient retrieval and indexing of image collections. This framework uncovers the hierarchical structure underlying the collection from image features based on a hybrid model that combines both generative and discriminative learning. We adopt the generalized Dirichlet mixture and maximum likelihood for the generative learning in order to estimate accurately the statistical model of the data. Then, the resulting model is refined by a new discriminative likelihood that enhances the power of relevant features. Consequently, this new model is suitable for modeling high-dimensional data described by both semantic and low-level (visual) features. The semantic features are defined according to a known ontology while visual features represent the visual appearance such as color, shape, and texture. For validation purposes, we propose a new visual feature which has nice invariance properties to image transformations. Experiments on the Microsoft's collection (MSRCID) show clearly the merits of our approach in both retrieval and indexing.
A technique for comparative assessment of software development management policies
Authors: Brendan D. L. Mulhall, Steven M. Jacobs
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

This paper describes a technique designed for organizing and structuring the comparison of software development management and software design practices. It is intended to provide a general method for assessing proposed software practices, especially of bidders on software contracts, and also to provide a visual aid in explaining to management how these proposed software practices comply with specifications, exceed specifications or are lacking.
Implementation and Improvement Based on Shear-Warp Volume Rendering Algorithm
Authors: Li Guo, Xie Mei
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

The shear-warp algorithm is one of the fastest algorithms based on CPU for volume rendering so far, but it achieves this rendering speed only by sacrificing the resulting image quality. This paper presents a new method that makes the resulting image quality much improved, by mending the resampling values used during the process of image compositing，nearly not affecting the efficiency of rendering. In this method, two adjacent slices are defined as front slice and back slice respectively, according to the direction of the viewing ray. A cost function is defined for describing the two adjacent slices' effect to the slab between them. The values of the resampling points in the front slice and back slice are inputted to the cost function as its parameters, and the resulting value can reflect the information of the slab more effectively. Compositing this resulting value as resampling value will improve the image quality significantly, and overcome the drawback of image-aliasing in the traditional shear-warp algorithm.
Sequential Belief-Based Fusion of Manual and Non-manual Information for Recognizing Isolated Signs
Authors: Oya Aran, Thomas Burger, Alice Caplier, Lale Akarun
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

This work aims to recognize signs which have both manual and non-manual components by providing a sequential belief-based fusion mechanism. We propose a methodology based on belief functions for fusing extracted manual and non-manual features in a sequential two-step approach. The belief functions based on the likelihoods of the hidden Markov models are used to decide whether there is an uncertainty in the decision of the first step and also to identify the uncertainty clusters. Then we proceed to the second step which utilizes only the non-manual features within the identified cluster, only if there is an uncertainty.
Optimal inventory policies for deteriorating complementary and substitute items
Authors: K. Maity, M. Maiti
Venue: International Journal of Systems Science (2009)

The optimal production for an inventory control system of deteriorating multi-items where items are either complementary and/or substitute is formulated with a resource constraint. Here, the production function is unknown and considered as a control variable. Also, the deterioration rates of the items are either stock dependent or constant. The demand is stock dependent, shortages are not allowed and deteriorated items are salvaged. The total profit, which consists of the sales proceeds, production cost, inventory holding cost, salvage value, is formulated as a Pontryagin's Optimal Control problem for both steady and transient states and evaluated using Taylor's theorem, generalised reduced gradient technique and optimal control theory satisfying the Generalised Legendre conditions. The model is formulated in general form for n-items, and in particular, is illustrated with three items for some numerical data. The optimum results are presented both in tabular form and graphically.
Development of full-HD multi-standard video CODEC IP based on heterogeneous multiprocessor architecture
Authors: Hiroaki Nakata, Koji Hosogi, Masakazu Ehama, Takafumi Yuasa, Toru Fujihira, Kenichi Iwata, Motoki Kimura, Fumitaka Izuhara, Seiji Mochizuki, Masaki Nobori
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

To solve recent pressing issues regarding satisfying numerous video codec standards and supporting "full-high-definition" (full-HD) (i.e., 1920 pixels by 1080 lines) video on different consumer devices, a multi-standard CODEC IP based on a heterogeneous multiprocessor architecture was developed. To achieve satisfactory performance with low power consumption, operation-specific processors were designed in regards to two types of processing: stream processing and pixel processing. The CODEC uses effectively several dedicated circuits for functions which are unsuitable for those processors. To design the CODEC, we developed a C-language model to check that the architecture worked correctly. The model was also used as a reference for verifying the RTL model. The CODEC can process full-HD videos formatted in H.264, MPEG-2, MPEG-4, and VC-1 at an operating frequency of 162 MHz.
A well-conditioned augmented system for solving Navier-Stokes equations in irregular domains
Authors: Kazufumi Ito, Ming-Chih Lai, Zhilin Li
Venue: Journal of Computational Physics (2009)

An augmented method based on a Cartesian grid is proposed for the incompressible Navier-Stokes equations in irregular domains. The irregular domain is embedded into a rectangular one so that a fast Poisson solver can be utilized in the projection method. Unlike several methods suggested in the literature that set the force strengths as unknowns, which often results in an ill-conditioned linear system, we set the jump in the normal derivative of the velocity as the augmented variable. The new approach improves the condition number of the system for the augmented variable significantly. Using the immersed interface method, we are able to achieve second order accuracy for the velocity. Numerical results and comparisons to benchmark tests are given to validate the new method. A lid-driven cavity flow with multiple obstacles and different geometries are also presented.
A Hardware Accelerated Simulation Environment for Spiking Neural Networks
Authors: Brendan Glackin, Jim Harkin, Thomas M. Mcginnity, Liam P. Maguire
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Spiking Neural Networks (SNNs) model the biological functions of the human brain enabling neuro/computer scientists to investigate how arrays of neurons can be used to solve computational tasks. However, as network models approach the biological scale with significantly large numbers of neurons, existing software simulation environments face the problem of scalability and increasing simulation times. Emulation in hardware offers a significant increase in the acceleration of simulations through the exploitation of parallelism and dedicated on-chip training. However, it is important that the configuration of SNNs for hardware emulation is abstracted from the novice end-user to allow flexible, high-level specification and execution. This paper presents a novel reconfigurable hardware architecture and internet-based configuration environment for the FPGA-based acceleration of SNNs with online training. Results are presented to demonstrate the acceleration performance.