ppxscal/embedding_network huggingface dataset:
JavaScript Interview Questions, Answers, and Explanations: JavaScript Certification Review
Authors: Terry Sanchez-Clark
Venue:  (2007)

The Ultimate JavaScript Reference & Learning Guide Over 100 Certification Questions, Answers, and Explanations One cannot claim fluency as a web developer without advanced knowledge of JavaScript, however, locating user-friendly yet comprehensive sources of reference can be challenging. With JavaScript Interview Questions, Answers, and Explanations: JavaScript Certification Review, you can be in great shape to evaluate a potential job candidate, brush up on skills, or prepare for an interview. This guide will explain trouble shooting, applicability in websites and other applications, new features in 1.7, interactions with the host environment, and common errors. More than just Sun Microsystems documentation and sales pitches, this guide explains JavaScript from the perspective of the web developer so that you can evaluate a candidate or land a position with ease. Key topics include: . Changes from 1.6 to 1.7 . Methods of interaction between JavaScript engines and host environments . Uses for stylizing or designing web based user interfaces . Security . Trouble shooting for many of the browsers in common use today, for instance PDAs and mobile phones
Operating System Support for Space Allocation in Grid Storage Systems
Authors: Douglas Thain
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Shared temporary storage space is often the constraining resource for clusters that serve as execution nodes in wide-area distributed systems. At least one large national-scale computing grid has reported a failure rate of as high as thirty percent of submitted jobs, often due to accidentally filled shared storage spaces. Previous systems have attacked this problem by adding space allocation to the distributed system interface. However, these allocations are not enforced at the filesystem level, and thus unexpected or unaccounted uses of storage may cause the system to fail. By adding an inexpensive allocation mechanism to the operating system, we may improve the robustness of such systems at minimal cost. In this paper, we describe an abstract model of space allocation in the file system and explore three implementations of the model: a user-level library, a recursive loopback filesystem, and a modified kernel filesystem. We evaluate the performance and completeness of these implementations and demonstrate that kernel support is essential to keeping the overhead low. Finally, we demonstrate empirically that a cluster under heavy filesystem load can be made more robust by adding allocations to the filesystem.
Underdetermined Blind Source Separation Based on Sparse Component
Authors: Ming-rong Ren, Pu Wang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents a new algorithm to identify matrix knowing only their multiplication . Where is sparse and . The data used for matrix identification are chosen by Least Square method, whose fitting errors are smaller than a given threshold. Then, K-means clustering method is adopted. This technique avoids data overlapping at the origin, thus improving the accuracy of mixing matrix estimation. The validity of the method for true voice separation is verified by computer simulation. Also comparison with other methods is made to verify the efficiency of the algorithm. Simulations show that the algorithm has the property of accuracy and low-cost computation.
Towards Multimedia Orchestra: A Proposal For An Interactive Multimedia Art Creation System
Authors: K. Nishimoto, K. Mase, S. Fels
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we propose a novel multimedia orchestra system named MusiKalScope-2. From our past experiences with multimedia art creation systems, we are aware of two issues: cognitive overload due to the simultaneous creation of music and graphics by a single performer, and finding a way to provide expert knowledge to a system. To address these issues, we propose two approaches: one, use attribute based role allotment and two, the direct use of experts' knowledge. We describe the construction of MusiKalScope-2 and illustrate the realization of the proposed methods.
Strong unforgeability in group signature schemes
Authors: Haeryong Park, Seongan Lim, Ikkwon Yie, Kitae Kim, Junghwan Song
Venue: Computer Standards Interfaces (2009)

A signature scheme is strongly unforgeable if no adversary can produce a new valid signature @s on a message M even after seeing some signatures on M. We define strong unforgeability of group signature schemes and explain why the strong unforgeability of a group signature scheme is necessary. This relatively new security concept was not considered when Bellare-Micciancio-Warinschi established their security model, what we call the BMW security model, of group signature schemes. We show that a scheme proposed at Eurocrypt'06 that was proven secure in the BMW security model is not strongly unforgeable. We also present a method to convert this scheme into a strongly unforgeable group signature scheme preserving the security in the BMW security model.
An efficient conic curve threshold digital signature
Authors: Xinxia Song, Zhigang Chen
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

We propose a new threshold signature scheme based on conic curve. The security of the proposed threshold signature scheme is based on the difficulty of computing the DLP in conic curve groups. It can resist some of the known attacks. Since an exciting characteristic of conic is both encoding and decoding over conic are easily implemented, it can be used in the mobile payment system with the limited bandwidth.
Recognizing Human Action from Videos Using Histograms of Visual Words
Authors: Yang Wang, Yi Sun
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

We propose a new method for human action recognition from video sequences using histograms of visual words. Video sequences are represented by a novel "bag-of-words" representation, where each frame corresponds to a "word". The major difference between our model and previous "bag-of-words" models for recognition problems in computer vision is that, a "word" in our representation corresponds to a whole frame. The advantage of this representation is that the large-scale feature of a frame is better captured, which turns out to be important for recognition actions. We demonstrate our approach on two publicly available datasets. Our results are comparable to other state-of-the-art approaches for action recognition.
P2DHMM: A Novel Web Object Information Extraction Model
Authors: Jing Wang, Zhijing Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Due to the difference between web page and plain text document, the concept of web object is introduced in this paper. Besides, the supposed state transition and the emission symbol conditions are improved based on Pseudo two dimension hidden Markov model (P2D-HMM), and a novel web objects information extraction method is proposed. Finally, through an example, it shows that the proposed method has a very high precision for web objects information extraction
Emotion induction during human-robot interaction
Authors: Cornelia Wendt, Michael Popp, Berthold Faerber
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

The aim of the presented study was to measure physiological correlates of emotions that are of particular interest in the field of human-robot interaction (HRI). Therefore, we did not focus on self-induced basic emotions but rather evoked states that might occur naturally in this context. Our video shows how such states (namely stress, boredom, surprise, and perplexity) were elicited during a joint construction task with an industrial robot (see figure 1). Participants were asked to build different LEGO objects, while the robot arm was passing the bricks with predetermined velocity. States of stress and boredom were generated by varying the handover interval from 3 seconds (stress) to 5 seconds (normal working condition) up to 35 seconds (boredom). Surprise was induced by passing an unexpected component. At the end of the experiment, we additionally wanted to know how people react if the robot seems to tease them by repeatedly changing the handover position. This experiment was realized by the support of researchers from the MMK and the IWB of the Technical University Munich who provided the technical facilities and know-how. The underlying project is supported within the DFG excellence initiative research cluster Cognition for Technical Systems - CoTeSys, see also www.cotesys.org.
Frequent items in streaming data: An experimental evaluation of the state-of-the-art
Authors: Nishad Manerikar, Themis Palpanas
Venue: Data Knowledge Engineering (2009)

The problem of detecting frequent items in streaming data is relevant to many different applications across many domains. Several algorithms, diverse in nature, have been proposed in the literature for the solution of the above problem. In this paper, we review these algorithms, and we present the results of the first extensive comparative experimental study of the most prominent algorithms in the literature. The algorithms were comprehensively tested using a common test framework on several real and synthetic datasets. Their performance with respect to the different parameters (i.e., parameters intrinsic to the algorithms, and data related parameters) was studied. We report the results, and insights gained through these experiments.
Achievable Performance of Digital Watermarking Systems
Authors: Brian Chen, Gregory W. Wornell
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

A variety of digital watermarking applications have emerged recently that require the design of systems for embedding one signal (the ``embedded signal'' or ``watermark'') within another signal (the ``host signal''). We develop a framework for analyzing achievable performance trade-offs of these systems among robustness, distortion, and embedding rate. We also describe a recently introduced class of embedding methods, quantization index modulation (QIM), in which an ensemble of quantizers is constructed and information is embedded by quantizing the host signal with a quantizer associated with the watermark. We introduce an implementation of such a method called spread-transform dither modulation where the embedded information modulates the dither signal of a dithered quantizer, which quantizes projections of the host signal onto a spreading vector. We show that QIM systems have considerable performance advantages over previously proposed spread-spectrum and low-bit modulation systems.
A Structure Character Modeling for Chinese Character Glyph Description
Authors: Shixiao Wu, Shijue Zheng
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The major problem existing in current Chinese character glyph descriptions is the standard character set can't cover all possible Chinese characters, some particular variants of characters that are unified also can not describe and display. Character Description Language (CDL) can help resolve both of the difficulties just mentioned. This paper presents the key features and syntax of the language, and discusses some of its applications, especially to character encoding standards work and Chinese writing teaching.
One more bit is enough
Authors: Yong Xia, Lakshminarayanan Subramanian, Ion Stoica, Shivkumar Kalyanaraman
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Achieving efficient and fair bandwidth allocation while minimizing packet loss and bottleneck queue in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (e.g., TCP) and traditional congestion notification schemes (e.g., TCP+AQM/ECN) have significant limitations in achieving this goal. While the XCP protocol addresses this challenge, it requires multiple bits to encode the congestion-related information exchanged between routers and end-hosts. Unfortunately, there is no space in the IP header for these bits, and solving this problem involves a non-trivial and time-consuming standardization process. In this paper, we design and implement a simple, low-complexity protocol, called Variable-structure congestion Control Protocol (VCP), that leverages only the existing two ECN bits for network congestion feedback, and yet achieves comparable performance to XCP, i.e., high utilization, negligible packet loss rate, low persistent queue length, and reasonable fairness. On the downside, VCP converges significantly slower to a fair allocation than XCP. We evaluate the performance of VCP using extensive ns2 simulations over a wide range of network scenarios and find that it significantly outperforms many recently-proposed TCP variants, such as HSTCP, FAST, CUBIC, etc. To gain insight into the behavior of VCP, we analyze a simplified fluid model and prove its global stability for the case of a single bottleneck shared by synchronous flows with identical round-trip times.
Discovering the Most Suitable Web Service in Collaboration Environment
Authors: Guozhen Ren, Qingzhong Li, Lizhen Cui, Tiangang Dong
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

With the increasing growth in popularity of web services, efficient discovery and matchmaking of relevant web services become significant challenges. Semantic Web provides a promising way to address the challenges by providing markup for web services to make them computer-interpretable, use-apparent, and agent-ready. This paper proposes a semantic web service selecting method based on the preconditions and effects of web services and the state of environment in which the user will perform the selected services. The user can specify in what conditions he will perform the services. And the proposed method will choose the most suitable services that not only fulfill functional request, but also are executable in the specified conditions. And this work makes great sense in collaboration environment where state information (described as conditions here) is of most importance.
A Novel Node Selection Method of Bearings-only Sensors for Target Tracking in Wireless Sensor Networks
Authors: Han Ying, Zhao Wei
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we propose a novel information utility description for bearings-only sensors to meet the challenge of sensor arrangement in Wireless Sensor Networks (WSN) for tracking. In order to reduce calculation, we use the probability distribution function of the predicted target state, the sensing model and the position information of sensors to define information utility, thus avoiding the computationally burdensome estimation of the posteriori distribution. Through simulations, we compare the performances of different sensor selection methods in the means of mean square error (MSE). The results show that our method can attain a good tracking accuracy while saving large amounts of calculation.
The common neural basis of autobiographical memory, prospection, navigation, theory of mind, and the default mode: A quantitative meta-analysis
Authors: R. Nathan Spreng, Raymond A. Mar, Alice S. N. Kim
Venue: Journal of Cognitive Neuroscience (2009)

A core brain network has been proposed to underlie a number of different processes, including remembering, prospection, navigation, and theory of mind [Buckner, R. L., & Carroll, D. C. Self-projection and the brain. Trends in Cognitive Sciences,11, 49-57, 2007]. This purported network-medial prefrontal, medial-temporal, and medial and lateral parietal regions-is similar to that observed during default-mode processing and has been argued to represent self-projection [Buckner, R. L., & Carroll, D. C. Self-projection and the brain. Trends in Cognitive Sciences,11, 49-57, 2007] or scene-construction [Hassabis, D., & Maguire, E. A. Deconstructing episodic memory with construction. Trends in Cognitive Sciences,11, 299-306, 2007]. To date, no systematic and quantitative demonstration of evidence for this common network has been presented. Using the activation likelihood estimation (ALE) approach, we conducted four separate quantitative meta-analyses of neuroimaging studies on: (a) autobiographical memory, (b) navigation, (c) theory of mind, and (d) default mode. A conjunction analysis between these domains demonstrated a high degree of correspondence. We compared these findings to a separate ALE analysis of prospection studies and found additional correspondence. Across all domains, and consistent with the proposed network, correspondence was found within the medial-temporal lobe, precuneus, posterior cingulate, retrosplenial cortex, and the temporo-parietal junction. Additionally, this study revealed that the core network extends to lateral prefrontal and occipital cortices. Autobiographical memory, prospection, theory of mind, and default mode demonstrated further reliable involvement of the medial prefrontal cortex and lateral temporal cortices. Autobiographical memory and theory of mind, previously studied as distinct, exhibited extensive functional overlap. These findings represent quantitative evidence for a core network underlying a variety of cognitive domains.
Processing Power Estimation of Simple Wireless Sensor Network Nodes by Power Macro-modeling
Authors: M. Rafiee, M. B. Ghaznavi-Goushchi, B. Seyfe
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

The operation of wireless sensor networks is fundamentally constrained by available energy sources. In this paper, we propose a numerical power estimation technique for register transfer level. This technique allows estimating the power dissipation of components in WSN to their statistical knowledge of primary inputs/outputs. During power estimation procedure, the sequence of an input stream is generated using input metrics and numerical macro-model function is used to construct a set of functions that maps the input metrics of a module to its output metrics. Then, simulation is performed and power dissipation is predicted by a macro-model function. The results are effective and highly correlated, with average error of 3.5%.
The time complexity of typechecking tree-walking tree transducers
Authors: Joost Engelfriet
Venue: Acta Informatica (2009)

Tree-walking tree transducers can be typechecked in double exponential time. More generally, compositions of k tree-walking tree transducers can be typechecked in (k&#x00a0;+&#x00a0;1)-fold exponential time. Consequently k-pebble tree transducers, which form a model of XML transformations and XML queries, can be typechecked in (k&#x00a0;+&#x00a0;2)-fold exponential time. The results hold for both ranked and unranked trees.
Computer Based Karyotyping
Authors: Xiaoli Yang, Ding Wen, Yuhua Cui, Xiang Cao, Jason Lacny, Charles Tseng
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Karyotyping is a fundamental step in chromosome analysis. Since G-banding patterns of any chromosomes in the metaphase spread are changeable, it is difficult and time consuming for students to master the technique of karyotyping. Current methods for leaning karyotyping are ineffective, and therefore it is necessary to develop a software program to help students learn the skill efficiently. Virtual reality is suitable for this purpose because of its inherent simulating ability. By building dynamic chromosome models capable changing shapes, G-band resolutions, and structure, along with creating variable metaphase spreads, a versatile software program was developed to provide students with a virtual learning environment for self practicing and testing, thus transforming the traditionally dry and tedious approach into an exciting and efficient learning process.
Heterogeneous Architecture Exploration: Analysis vs. Parameter Sweep
Authors: Asma Kahoul, George A. Constantinides, Alastair M. Smith, Peter Y. Cheung
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

This paper argues the case for the use of analytical models in FPGA architecture layout exploration. We show that the problem when simplified, is amenable to formal optimization techniques such as integer linear programming. However, the simplification process may lead to inaccurate models. To test the overall methodology, we combine the resulting layouts with VPR 5.0. Our results show that the resulting architectures are better than those found using traditional parameter sweeping techniques.
Guide to Wireless Ad Hoc Networks, 1st edition
Authors: Sudip Misra, Isaac Woungang, Subhas Chandra Misra
Venue:  (2009)

Wireless ad-hoc network communication technologies have experienced a steep growth in research and significant advancements in recent times due to their important advantages. These benefits help to set-up a network fast in situations where there is no existing network set-up, or when setting up a fixed infrastructure network is considered infeasible. However, there are challenges that still need to be addressed. This indispensable guidebook provides a comprehensive resource on the new ideas and results in the areas of mobile ad-hoc networks and other ad-hoc computing systems in the wireless communication technology field. Wireless ad-hoc networks are explored by leading experts in the field from both academia and industry, with discussions on various challenges in varied environments, standards, routing mechanisms, etc. This reader-friendly, broad-ranging text features in-depth descriptions of terminologies and concepts related to the diverse subject areas germane to wireless ad hoc communication. Features: Provides an accessible, comprehensive overview of the state-of-the-art technology of wireless ad-hoc networks Includes reader-friendly discussions for practitioners, directions for future research, and helpful lists of terms and definitions Offers a set of summary questions at the end of each chapter to help readers assess their understanding of the various concepts Presents insight into the practical significance of these topics in real-world scenarios Designed, in structure and content, to aid the learning process with the intension of making the book useful at all learning levels Supplies supportive PowerPoint presentation slides and solutions to aid lecturers at www.springer.com/978-1-84800-327-9 This wide-ranging and highly useful guide will be a valuable reference/text in the field for researchers, engineers and strategists needing to know about this technology. It is also an ideal textbook for graduate students wishing to learn more about the topic. Key Topics: Routing Mobility Management Quality of Service Support Congestion Control Security Trust Management
Transition skew coding for global on-chip interconnect
Authors: Charbel J. Akl, Magdy A. Bayoumi
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper presents new simulation results of the previously proposed Transition Skew Coding (TSC) for global on-chip interconnects. Considering 2-GHz global clock frequency at the 90-nm node, we show that TSC can be applied to broad range of wire length on both semiglobal and global metal layers, while maintaining its energy efficiency and its advantages in terms of crosstalk reduction and signal integrity, and wiring and repeater area minimization.