Miracle-dz/UniFAR-FTUs huggingface dataset:
The Korean Pharmacogenomic Database at NIFDS: 2008 Update

Since its first release in 2007, the National Institute of Food and Drug Safety Evaluation (NIFDS) has provided pharmacogenomic and comparative information specific to Koreans to allow regulatory reviewers and researchers to adapt their working practices to pharmacogenomics. The highlights of this year's additions include "Drug Information", "Gene Information" and "Pharmacogenomic information in the drug labels" sections. These new additions provide information on 737 genes, 719 drugs and pharmacogenomic data of the labels or relabels of 253 approved drugs as of November 2008. The latest version of the Korean Pharmacogenomic Database (KPD, release 2.0) has expanded significantly since its previous release. More SNP and haplotype information has been added to the database with the latest version of the KPD containing approximately four times as many SNPs and haplotypes than the previous version (719 vs. 152, and 30 vs. 7 respectively). Through the "SNP" and "Haplotype" sections, the KPD provides unique Korean SNP and haplotype information as well as comparative information of other populations (Japanese, Chinese, European, African) to offer a range of pharmacogenomic data that can help reviewers and the public understand pharmacogenomic information. The quality and quantity of information in the KPD has also been improved considerably. This data can be found at: http://www.nitr. go.kr/nitr/contents/m134700/view.do/.
A mean-sensitive spatial filtering (MSF) method for trial-by-trial analysis of N170 component

N170 is an important neurophysiological index to study the underlying mechanisms of face and object perception. In this study, we proposed a mean-sensitive spatial filtering (MSF) method for linear transformation of event-related potentials (ERP) that is sensitive to mean differences between stimuli conditions and applied it to N170 component to extract category-specific spatio-temporal features contained in EEG. MSF method estimated a set of optimal projecting vectors according to the spatial distribution patterns of N170 means. Then, we applied these spatial filters to single-trial ERP data and perform classification on the extracted features. In this way, the presence of a larger negative component in EEG time courses evoked by faces can be detected robustly in single trial EEG, and hereby we can infer the category of every presented stimulus from faces and objects. Furthermore, we also successfully extracted the unobvious distinct spatial patterns between cars and cats with MSF and separated them correctly. Our remarkable and robust classification performances suggest that MSF works well in extracting stable spatial patterns from N170. Therefore, MSF provides a promising solution for decoding presented visual information basing on single-trial N170 component.
Efficient Sharing in Ambiguous Parsing

At the outbreak, interest in non-deterministic parsing was due to the fact that it is the context free backbone of some natural language analyzers. In effect, several of them start with a purely context-free parsing phase which generates all possible parses as some kind of sharing structure usually called shared forest. Later, in a second phase, a more elaborate analyzer that takes into account the finer grammatical structure of the language is applied in order to filter out undesirable parses. That implies the existence of a disambiguation process, from which a single tree is to be chosen in the resulting shared forest. In this paper, we study the structure of these forests with respect to optimality of syntactic sharing, in relation to the parsing schema used to produce them and to the number of computations to be applied during the parse process. Finally, we give the guideline to design efficient context-free parsers in relation to both the performance and the implementation techniques.
Associative-Memory-Based Human Face Detection

SUMMARY In this paper, we explore the possibility of applying associative memories for locating frontal views of human faces in complex scenes. An appealing property of the associative-memory-based face detection system is that learning of the associative memory may be achieved by using a simple Hebbian learning rule. In addition, a simple heuristic rule is used to quickly filter a certain amount of nonface images at the very beginning of the whole detection procedure. By using the rule, we won’t waste unnecessary computational resources on those nonface images. A database consisting of 74 images was used to test the performance of our associative-memory-based human
Parallel algorithm for setting WIP levels for multi-product CONWIP systems

Reducing work-in-process (WIP) inventory is continuing to be an important business need because of several factors including the need to reduce working capital. Numerous techniques have been suggested for WIP reduction, and CONWIP is a competitive algorithm for WIP reduction. Prior CONWIP algorithms have been primarily sequential algorithms and can be potentially incur significant computing time, especially when dealing with inventories for multiple products. The paper proposes a card-setting algorithm for multiple product types subject to routing and throughput requirements. The proposed algorithm searches the WIP space iteratively and the step-size is adaptively selected based on the known properties of multi-chain, multi-class, closed queuing networks. Furthermore, parallelization of this search algorithm across multiple processors is proposed where each processor searches a different segment of the WIP space while adaptively adjusting its step size for all product types to ensure fast convergence. The proposed parallel algorithm can take advantage of distributed computing architectures to speed-up the overall computation. An experimental implementation of the parallel algorithm using Message Passing Interface (MPI) over a high-speed network is described. Computational results demonstrate that the proposed parallel algorithm can be parallelized over eight to ten processors to obtain a speed-up of three to five.
Sparse Extended Information Filter for AUV SLAM: Insights into the Optimal Sparse Time

Sparse extended information filter-based simultaneous localization and mapping (SEIF-based SLAM) algorithm can reflect significant advantages in terms of computation time and storage memories. However, SEIF-SLAM is easily prone to overconfidence due to sparsification strategy. In this paper we will consider the time consumption and information loss of sparse operation, and get the optimal sparse time. In order to verify the feasibility of sparsification, a sea trial for autonomous underwater vehicle (AUV) C-Ranger was conducted in Tuandao Bay. The experimental results will show the improved algorithm is much more effective and accurate comparedwithothermethods.
Qualitative analysis of student assignments: a practical look at ATLAS.ti

Purpose – The purpose of this paper is to review the basic principles of qualitative analysis, and examine the practical application of these principles to analyze student assignments using the ATLAS.ti software.Design/methodology/approach – Student comments from an assignment are prepared for import into ATLAS.ti. The comments are coded, and then analyzed for patterns using ATLAS.ti and its mechanisms for exploring data and data patterns.Findings – ATLAS.ti offers myriad analytic tools that allow the researcher to quantify qualitative information through coding, data query, cross‐tabulation, and networked visualization of project design. By developing both technical expertise with the software, and developing familiarity with qualitative methodology, librarians can wield an effective means to assess and evaluate text‐based data, such as student assignments or surveys.Research limitations/implications – Because the ATLAS.ti software, and the qualitative analysis process itself is so complex, this article .
Synthesis of self-clocked asynchronous state machines

A systematic approach to the design of asynchronous state machines with minimum state variables and arbitrary state encoding is described. Multiple input changes are allowed. Simple latches in master-slave configuration are used as memory elements rendering the method suitable for implementation in small scale integration (SSI) or VLSI. It avoids extra delay elements often necessary in self-clocked circuits. The method is illustrated by its application to the design of a VMEbus requester. <<ETX>>
HMM-Based speech recognition using multi-dimensional multi-labeling

This paper describes a new vector quantization (VQ; so-called labeling) method of a speech recognition system based on hidden Markov model (HMM). For improving the VQ accuracy in a simple manner, "multi-labeling" which generates multiple labels at each frame was introduced while keeping a conventional HMM formulation. Furthermore, in order to represent characteristics of speech accurately and effectively, "multi-dimensional labeling" was also introduced which quantizes multiple features such as spectral dynamics and spectrum independently. This labeling method was tested in an isolated word recognition task using 150 Japanese confusable words. The recognition error rate was roughly reduced to 1/2 or less compared with the conventional method.
DENTON: Stata module to interpolate a flow or stock series from low-frequency totals via proportional Denton method

denton computes the proportional Denton method of interpolation of a low-frequency flow time series by use of an associated high-frequency "indicator series", imposing the constraints that the interpolated series obeys the low-frequency totals. The method is recommended in IMF publications as "relatively simple, robust, and well-suited for large-scale applications. " It may be particularly useful in cases where, due to sizable statistical discrepancy, quarterly series do not integrate to annual totals. The indicator series only contribute their pattern to the interpolation. The routine can interpolate annual data to quarterly or monthly, and quarterly data to monthly. The stock option allows the routine to handle stock (rather than flow) series. A certification script for the package is provided. This version of the package also contains denton7 and dentonmq7, which should be used if you do not have Stata 11 or 12. These routines use a completely different command format and require more setup effort. dentonmq7 is a routine to perform the same task for monthly interpolation of a quarterly series. The programs may be applied to a single time series within a panel.
A task allocation scheme for hypercube distributed computing systems using the affinity graph model

In the affinity graph model, the vertices represent the modules in the task to be allocated. The weight of the edges represents the affinity the modules represented by the vertices have for each other. The affinity function has been defined in such a way that both the competing demands of load balancing and minimizing interprocessor communication are addressed. By applying a graph partitioning algorithm on such an affinity graph, optimal task allocation is possible. The task allocation algorithm presented for hypercube distributed computing systems uses the above idea to repeatedly partition the affinity graph until all modules in the task are allocated. The algorithm is fully distributed with no central control being exercised. <<ETX>>
Several strategies of implementing PACS in developing countries like China

It is inevitable for developing countries to take the concept of an informationized hospital in order to improve diagnosis quality and reduce administrative overheads. However implementing HIS and PACS in developing countries like China (mainland) has a common inherent difficulty: limited development funds but the same desires as hospitals in developed countries. To cater to this high expectation of hospitals with limited funds, researchers have to produce some effective strategies to reduce the development costs and make full use of the existing hardware in order to improve the investment profits of hospitals. This paper presents some concrete experience gained during development of a PACS in Shanghai and discusses some common concepts which may be instructive for implementing PACS in developing countries.
Toward an intelligent architectural design aid

: Architectural design is a complex task which requires expert knowledge, a great deal of experience and no small amount of creativity and artistic flair. However, while humans are very good at creativity, intuition, artistry and evaluation, they are notoriously bad at routine mundane tasks. Searching through large databases of past designs can be such a task. This can result in useful design knowledge being ignored. In this paper we present a way to aid architects in their work by providing a software tool aimed at recording, retrieving and evaluating architectural designs.
Nonlinear filtering with really bad data

In past presentations at this and other conferences and in the recent book `Mathematics of Data Fusion,' we have introduced `finite set statistics' or FISST (a direct generalization of conventional single-sensor, single-target statistics to the multisensor-multitarget realm). We have also shown how FISST provides a unified foundation for the following aspects of multisource-multitarget data fusion: detection, identification, tracking, multi-evidence accrual, sensor management, performance estimation, and decision- making. In this paper we illustrate the FISST approach by showing how conventional filtering and estimation theory can be generalized to tracking or target I.D. problems involving highly ambiguous evidence. In particular, we illustrate the FISST approach on three simple model problems involving (1) target I.D. with a very low-quality RWR (radar warning receiver) sensor, and (2) target tracking via fusion of (simulated) radar reports with (simulated) English-language reports.
Doubly balanced dual-gate CMOS mixer

The operation, biasing, and measured results of a CMOS doubly balanced dual-gate downconversion mixer are presented. Measurements show, with a radio-frequency input of 1.9 GHz and an intermediate-frequency output of 250 MHz, that the mixer has a conversion gain of 0 dB, an input-referred third-order intercept point of +2 dBm, and a single-sideband noise figure of 13.6 dB while requiring +5 dBm of local-oscillator power and consuming 10.2 mA from a 3 V power supply.
A Twisted Bit Line Technique for Multi-Mb Drams

16M 4M 1M AS THE INTEGRATION DENSITY OF THE DRAM has grown, new types of memory array noise inherent in the scaled memory cell array have emerged as inevitable problems: inter-bitline coupling noise due to the bitline-bitline coupling capacitance, increased as the bitline pitch becomes smaller, and hitlinewordline feedback noise due t o mirror capacitance of the transfer-gate transistors of the memory They become serious problems in high density DRAMs. The inter-bitline coupling noise problem may be partially solved by scaling down the vertical dimension of the bitline, but this is limited by problems such as the electro-migration and the performance degradation due to the increase o f the bitline resistance. This paper will propose and demonstrate bitline architecture to eliminate the noise and also overcome the scaling problem of future DRAMs. Two kinds of inter-bitline coupling noise in conventional folded bit-line design are illustrated in Figure 1. They are inter-pair coupling N1 (which is dependent on the data pattern) and intra-pair coupling N2. The total bitline capacitance CB and the inter-bitline coupling capacitance CBB estimated by simulation of the 256K 16Mb level bitline structures are shown in Figure 2. Figure 3 shows the worst-case-signal amplitude versus inter-bitline capacitance, which simulated is in good agreement with measurement on a test device that has the actual bitline structures and operating conditions. From these results, the signal reduction due t o the inter-bitline coupling noise 16Mb bitline structure is estimated to be 40% of the total signal amplitude, in spite of the use of a thin poly-hitline. Figure 4 shows proposed Twisted Bit Line (TBL) techniques which cancel the inter-bitline coupling noise and improve the signal. The inter-pair coupling noise in the TBL configurations is equally coupled to adjacent paired bitlines and cancelled in the differential sensing operation. In the modified TBL case, the intra-pair coupling noise is also eliminated and the signal is improved twice as much as in the TBL case, as shown in Figure 5. Thus in the modified TBL, the bitline-bitline coupling capacitance does not cause coupling noise, but only increases the CB. Figure 6 shows the worst-case signal estimated with only the spacing and width of the A1 bit line proportionally scaled down. The TBL and modified TBL configurations permit the constantvertical-dimension scaling by factors of 0.7 and 0.45, respectively, (which correspond to just one and two DRAM generations), while maintaining the same level of signal loss as the lhlb level folded bit-line configuration.
A fast-settling CMOS op amp for SC circuits with 90-dB DC gain

A technique that combines the high-frequency behavior of a single-stage op amp with the high DC gain of a multistage design is presented. This technique is based on the concept that a very high DC gain can be achieved in combination with any unity-gain frequency achievable by a (folded-) cascode design. Bode-plot measurements for an op amp realized in a 1.6- mu m process show a DC gain of 90 dB and a unity-gain frequency of 116 MHz (16-pF load). Settling measurements with a feedback factor of 1/3 show a fast single-pole settling behavior corresponding to a closed-loop bandwidth of 18 MHz (35-pF load) and a settling accuracy better than 0.03%. This technique does not cause any loss in output voltage swing. At a supply voltage of 5.0 V an output swing of about 4.2 V is achieved without loss in DC gain. The above advantages are achieved with a 30% increase in chip area and a 15% increase in power consumption. >
Wireless mobile collaboration

The focus of this new mini-track is on the rapidly changing and evolving use of wireless mobile computing technologies for human-to-human and human-to-machine collaboration. This mini-track is intended to provide a forum for reporting the results of research focusing on system and application development and technology usage as well as the reporting of user adoption, deployment, acceptance, and diffusion among academicians and practitioners in the computer-based system sciences. As such, the wireless mobile collaboration mini-track focuses on the conceptual design, implementation, use, and evaluation of wireless mobile computing technologies in controlled, organizational and broader societal settings. We include four papers to be presented as part of this new mini-track on mobile wireless collaboration. The first paper is by Khalifa and Cheng and is titled, "Adoption of Mobile Commerce: Role of Exposure. In this paper the authors develop and empirically test a model for explaining the role of exposure to mobile technology in the adoption of mobile commerce. The results show exposure has both indirect and moderating effects on the intention of adopting mobile commerce. The second paper is by Urbaczewski, Wells, Koivisto, and Sarker, and is titled, "Cultural Differences in Creating the Global Mobile Internet: A Theoretical Basis and Program of Research. " In that paper the authors discuss mobile e-commerce and the role that culture plays in its globalization. They then pose a series of interesting research questions, existing theories suitable for studying these questions, and a proposed program of related research. The third paper is by Marsic, Krebs, Dorohonceanu, and Tremaine, and is titled, "Designing and Examining PC to Palm Collaboration. " In this paper the authors describe an architecture for managing displays across multiple mobile computing platforms. They then operationalize this architecture in a collaboration system and experiment with its use across different platforms, with interesting results. The fourth paper is by Okoli, Ives, Jessup, and Valacich, and is titled, "The Mobile Conference Information System: Unleashing Academic Conferences with Wireless Mobile Computing. " In this paper the authors provide a vision for how a mobile, wireless platform could be used to support and extend academic conferences. Perhaps one day soon we will see HICSS or some other such conference run in this way. In any event, we hope you enjoy these papers and that they prompt you to consider conducting research in this new and exciting area.
Prospects for commercial satellite services at Q- and V-bands

Some 16 proposed new satellite systems operating at 36 to 46 GHz (Q-band) and 46 to 56 GHz (V-band) have been proposed to the US Federal Communications Commission by US companies. Of these, 14 are intended to provide global, or nearly global, service. One is intended for US domestic service, and one is package to provide additional store-and-forward capability on an earlier proposed "Little LEO" system. This paper provides a summary of the 14 global systems, which for the most part are designed to exploit the wide band of frequencies available for services such as multimedia distribution and Internet access. Systems are proposed that would use geostationary orbit, medium Earth orbit, low Earth orbit, and Molniya orbit satellites, and in some cases combinations of two of these orbits. Most of the new systems propose to employ new technologies such as multiple narrow spot-beam antennas, onboard demodulation and routing of traffic between beams, intersatellite links, and in some cases scanning beams to continuously illuminate the service area as the satellite flies by. Some of the difficulties involved in fielding systems at these high frequencies arise from the propagation impairments that can be expected and the high cost of solid-state power devices for user terminals, which will drive up costs. It is concluded that, while the large amount of bandwidth (3 GHz) proposed by the FCC for these systems is attractive, few if any are likely to be built while spectrum remains available at Ka-band.
A Survey of old and New Results for the Test Error Estimation of a Classifier

Abstract The estimation of the generalization error of a trained classifier by means of a test set is one of the oldest problems in pattern recognition and machine learning. Despite this problem has been addressed for several decades, it seems that the last word has not been written yet, because new proposals continue to appear in the literature. Our objective is to survey and compare old and new techniques, in terms of quality of the estimation, easiness of use, and rigorousness of the approach, so to understand if the new proposals represent an effective improvement on old ones.
Increasing interactivity of paper prototyping with smart pen

Wireframes have been widely used in the early phase of user interface (UI) design processes. However, because they lack interactivity in usage, it is not possible for users to have a realistic experience. Through our preliminary study, several implications were found for developing a wireframe prototyping system. Based on these, we designed a prototyping tool for ad hoc mobile prototyping, which allows designers to build an interactive prototyping system quickly. The system supports designer's natural drawing behaviors and builds an interactive prototype based on their sketches. From users' feedback, we found our tool was useful for building interactive low-fidelity prototypes.