ppxscal/embedding_network huggingface dataset:
Microstructural study of copper free air balls in thermosonic wire bonding
Authors: C. J. Hang, C. Q. Wang, Y. H. Tian, M. Mayer, Y. Zhou
Venue: Microelectronic Engineering (2008)

Copper wires are increasingly used in place of gold wires for making bonded interconnections in microelectronics. In this paper, a microstructural study is reported of cross-sectioned free air balls (FABs) made with 23@mm diameter copper bonding wire. It was found that the FAB is comprised of a few columnar grains and a large number of fine subgrains formed within the columnar grains around the periphery of the FAB. It was determined that conduction through the wire was the dominant heat loss mechanism during cooling, and the solidification process started from the wire-ball interface and proceeded across the diameter then outward towards the ball periphery. The microstructure of the Cu ball bond after thermosonic bonding was investigated. The result showed that the subgrain orientations were changed in the bonding process. It is evident that metal flow along the bonding interface was from the central area to the bond periphery during thermosonic bonding.
Secure Deniable Authentication Protocol Based on ElGamal Cryptography
Authors: Eun-Jun Yoon, Kee-Young Yoo
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In 2006, Shao et al. showed that Wang et al.'s deniable authentication protocol based on ElGamal cryptography is insecure to a person-in-the-middle attack; that is, in the whole process, the receiver cannot be aware of the existence of this adversary as well as the modification of the messages. Furthermore, they also presented a modification of Wang et al.'s protocol to overcome the security flaw. However, the current paper demonstrates that Shao et al.'s improved deniable authentication protocol is susceptible to a malicious receiver's impersonation attack. To mitigate this security breach, we propose an improved deniable authentication protocol basedon ElGamal cryptography.
A general feature space for automatic verb classification
Authors: Eric Joanis, Suzanne Stevenson, David James
Venue: Natural Language Engineering (2008)

Lexical semantic classes of verbs play an important role in structuring complex predicate information in a lexicon, thereby avoiding redundancy and enabling generalizations across semantically similar verbs with respect to their usage. Such classes, however, require many person-years of expert effort to create manually, and methods are needed for automatically assigning verbs to appropriate classes. In this work, we develop and evaluate a feature space to support the automatic assignment of verbs into a well-known lexical semantic classification that is frequently used in natural language processing. The feature space is general – applicable to any class distinctions within the target classification; broad – tapping into a variety of semantic features of the classes; and inexpensive – requiring no more than a POS tagger and chunker. We perform experiments using support vector machines (SVMs) with the proposed feature space, demonstrating a reduction in error rate ranging from 48% to 88% over a chance baseline accuracy, across classification tasks of varying difficulty. In particular, we attain performance comparable to or better than that of feature sets manually selected for the particular tasks. Our results show that the approach is generally applicable, and reduces the need for resource-intensive linguistic analysis for each new classification task. We also perform a wide range of experiments to determine the most informative features in the feature space, finding that simple, easily extractable features suffice for good verb classification performance.
A Knowledge-Based Question Answering System for B2C eCommerce
Authors: Ali Ghobadi Tapeh, Maseud Rahgozar
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The evolution of B2C eCommerce has been formed through various generations. Last models of B2C eCommerce are comparative shopping systems that connect to multiple vendors’ databases and collect the information requested by the user. The comparative result obtained is then displayed in a tabular format in the user's browser. Although this scenario is much better than the multiple manual site comparisons, user still needs to face inconsistent user interfaces when he is linked from the comparison site to the actual purchasing site for shopping. Therefore, user has to learn logics of each site’s user interface. In this paper, we propose a question answering system based on natural language processing techniques for retail (B2C) in eCommerce. This system gets a question in natural language formats, decomposes it to keywords, and extracts constraints automatically. Corresponding answers are then retrieved from the vendors’ Web sites by exploiting the question constraints.
Linear Programming with MATLAB (MPS-SIAM Series on Optimization), 1 edition
Authors: Michael C. Ferris, Olvi L. Mangasarian, Stephen J. Wright
Venue:  (2008)

This textbook provides a self-contained introduction to linear programming using MATLAB software to elucidate the development of algorithms and theory. Early chapters cover linear algebra basics, the simplex method, duality, the solving of large linear problems, sensitivity analysis, and parametric linear programming. In later chapters, the authors discuss quadratic programming, linear complementarity, interior-point methods, and selected applications of linear programming to approximation and classification problems. Exercises are interwoven with the theory presented in each chapter, and two appendices provide additional information on linear algebra, convexity, nonlinear functions, and on available MATLAB commands, respectively. Readers can access MATLAB codes and associated mex files at a Web site maintained by the authors. Only a basic knowledge of linear algebra and calculus is required to understand this textbook, which is geared toward junior and senior-level undergraduate students, first-year graduate students, and researchers unfamiliar with linear programming.
Teaching embedded systems software: The HKUST experience
Authors: Jogesh K. Muppala, Zonghua Gu, S. C. Cheung
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Recent trends in embedded systems indicate a growing importance of the software component of these systems, and the concomitant increase in the importance of formal design and development of embedded software. In this paper we share our experience with designing and offering courses related to embedded software in the Department of Computer Science and Engineering at the Hong Kong University of Science and Technology. We give a detailed overview of the courses, the structure and the teaching/learning methodology followed in our courses, followed by some discussion and reflections on the courses.
Read-thrice DNF is hard to learn with membership and equivalence queries
Authors: H. Aizenstein
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

A general technique is developed to obtain nonlearnability results in the model of exact learning from equivalence and membership queries. The technique is applied to show that, assuming NP not=co-NP, there does not exist a polynomial-time membership and equivalence query algorithm for exactly learning read-thrice DNF formulas-boolean formulas in disjunctive normal form where each variable appears at most three times. This result adds evidence to the conjecture that DNF is hard to learn in the membership and equivalence query model.
An Efficient Algorithm for Detecting Closed Frequent Subgraphs in Biological Networks
Authors: Jia-yang Peng, Lu-ming Yang, Jian-xin Wang, Zheng Liu, Ming Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In this paper, aimed at the problem of detecting closed frequent subgraphs in biological networks, an improved FP-growth algorithm MaxFP is presented, which is based on the simplification model appropriate to biological networks. The defects of the algorithm based on item-set mining are analyzed when it is applied to biological networks, and which is overcome in MaxFP. In addition, MaxFP also takes the biological network characteristics into account. Experiment results show that MaxFP runs faster than the algorithms based on Apriori, and MaxFP not only detects maximal frequent subgraphs, but also finds more frequent subgraphs having biological meaning. The results got by performing Apriori based algorithms many times can be got by performing MaxFP once.
HydroTrend v.3.0: A climate-driven hydrological transport model that simulates discharge and sediment load leaving a river system
Authors: Albert J. Kettner, James P. M. Syvitski
Venue: Computers Geosciences (2008)

HydroTrend v.3.0 is a climate-driven hydrological water balance and transport model that simulates water discharge and sediment load at a river outlet, by incorporating drainage basin properties (river networks, hypsometry, relief, reservoirs) together with biophysical parameters (temperature, precipitation, evapo-transpiration, and glacier characteristics). HydroTrend generates daily discharge values through: snow accumulation and melt, glacier growth and ablation, surface runoff, and groundwater evaporation, retention and recharge. The long-term sediment load is predicted either by the ART-QRT module based on drainage area, discharge, relief, and temperature, or the BQART module that also incorporates basin-average lithology and anthropogenic influences on soil erosion. Sediment trapping efficiency of reservoirs is based on reservoir location in the river network and its volume that determines the residence time of water within the reservoir. Glacial influence is based on the extent of ice cover, equilibrium altitude, and freezing line mobility. HydroTrend v.3.0 captures the inter- and intra-annual variability of sediment flux by using either high-resolution climate observations or a stochastic climate generator for simulations over longer geological intervals. A distributary channel module simulates the flow conditions and transport capacity across a multiple deltaic channel system. Simulations of the Metauro and the Po rivers, in Italy, are used as case studies to demonstrate the applicability of the new model.
Local Elastic Registration of Multimodal Medical Image Using Robust Point Matching and Compact Support RBF
Authors: Xuan Yang, Zhixiong Zhang, Ping Zhou
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

A novel local elastic registration of multimodal medical image method is proposed in this paper. At first, local deformation regions are detected by evaluating the variation of mutual information in re-quantified gray space of images. The re-quantified image retains anatomical structure of the organ well and reduces the gray levels greatly. Mutual information performs better in the quantification space and can be used to detect whether the deformation happens in small sampling images. Next, edges of the local deformation regions are detected. Fuzzy Clustering Method is performed on edge points and the clustering centers are chosen as candidate landmarks. Robust Point Matching is used to estimate landmarks correspondence in the local deformation regions. Finally, a new compact support radial basis function CSTPF has been adopted to deform image, which cost less bending energy than other RBFs. Local registration experiments of multimodal medical images show the feasibility of our method.
Modeling and analysis of core-centric network processors
Authors: Yi-Neng Lin, Ying-Dar Lin, Yuan-Cheng Lai, Kuo-Kun Tseng
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2008)

Network processors can be categorized into two types, the coprocessors-centric model in which data-plane is handled by coprocessors, and the core-centric model in which the core processes most of the data-plane packets yet offloading some tasks to coprocessors. While the former has been properly explored over various applications, research regarding the latter remain limited. Based on the previous experience of prototyping the virtual private network (VPN) over the IXP425 network processor, this work aims to derive design implications for the core-centric model performing computational intensive applications. From system and IC vendors' perspectives, the continuous-time Markov chain and Petri net simulations are adopted to explore this architecture. Analytical results prove to be quite inline with those of the simulation and implementation. With subsequent investigation, we find that appropriate process run lengths can improve the effective core utilization by 2.26 times, and by offloading the throughput boosts 7.5 times. The results also suggest single-process programming, since context-switch overhead impacts considerably on the performance.
Collaboration tools in a one-semester software engineering course: what worked? what didn't?
Authors: Lisa Lancor
Venue: Journal of Computing Sciences in Colleges (2008)

Collaboration tools play an important role in the development of software applications. This is especially true as development endeavors are more frequently being conducted in geographically distributed environments. Requiring students to use such tools helps in preparing them for their careers after graduation. This paper describes the experiences of using collaboration tools in a one-semester software engineering course which requires group work throughout the semester. After exploring various open source and closed source solutions, Basecamp by 37signals has been used successfully for several semesters as students work collaboratively to develop a real application for a real, on-campus client. Basecamp provides an easy way for (1) instructors to keep abreast of group and individual progress, (2) on-campus clients to be integrated into the development process, and (3) students to embrace a technology which enhances their collaborative efforts.
Folksonomy-Based Indexing for Location-Aware Retrieval of Learning Contents
Authors: Wen-Chung Shih, Shian-Shyong Tseng
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

With the fast development of wireless communication and sensor technologies, ubiquitous learning has become a promising learning paradigm. In context-aware ubiquitous learning environments, it is desirable that learning content is retrieved according to environmental contexts, such as learners’ location. However, traditional information retrieval schemes are not designed for content retrieval in ubiquitous learning environments. Recently, folksonomies have emerged as a successful kind of applications for categorizing web resources in a collaborative manner. This paper focuses on the index creation problem for location-aware learning content retrieval. First, we propose a bottom-up approach to constructing the index according to the similarity between tags, which considers metadata and structural information of the teaching materials annotated by the tags. Then, a maintenance mechanism is designed to efficiently update the index. The index creation method has been implemented, and a synthetic learning object repository has been built to evaluate the proposed approach. Experimental results show that this method can increase precision of retrieval. In addition, impacts of different similarity functions on precision are discussed.
LISABETH: automated content-based signature generator for zero-day polymorphic worms
Authors: Lorenzo Cavallaro, Andrea Lanzi, Luca Mayer, Mattia Monga
Venue: Proceedings of the fourth international workshop on Software engineering for secure systems (2008)

Modern worms can spread so quickly that any countermeasure based on human reaction might not be fast enough. Recent research has focused on devising algorithms to automatically produce signature for polymorphic worms, required by Intrusion Detection Systems. However, polymorphic worms are more complex than non-mutating ones as they also require the identification of mutated instances. To this end, we propose Lisabeth, our improved version of Hamsa, an automated content-based signature generation system for polymorphic worms that uses invariant bytes analysis of network traffic content. We show an unknown attack to Hamsa's signature generator that is contrasted by Lisabeth. Moreover, we show that our approach is able to generally improve the resilience to poisoning attacks as supported by our experiments with synthetic polymorphic worms.
Wireless Video Transmission: A Distortion-Optimal Approach
Authors: Negar Nejati, Homayoun Yousefi'zadeh, Hamid Jafarkhani
Venue: Proceedings of the Data Compression Conference (2008)

We identify an analytical expression for the distortion of a scalable video bitstream. Relying on the distortion expression, we propose a low complexity distortion-optimal Unequal Error Protection (UEP) method for the transmission of such video bitstream over wireless tandem channels. Utilizing a one-dimensional Forward Error Correction (FEC) coding scheme, our proposed transmission method protects the bitstream against both bit errors caused by fading and packet erasures caused by network buffering. Our coding scheme also leverages symbol interleaving to better cope with the temporally correlated loss observed over the tandem channels of interest. We evaluate the performance of our proposed scheme by comparing its results against those of UEP product codes as well as those of optimized version of Equal Error Protection (EEP). For a variety of choices of fixed packet sizes, available budgets, and channel conditions, we illustrate the performance advantage of our scheme over other schemes. Our experiments also show that our scheme works more efficiently for channels with a higher probability of bit errors than those with a lower probability of bit errors.
Influence of the macrotidal environment on the source to sink pathways of suspended flux in the Gulf of Kachchh, India: evidence from the Ocean Colour Monitor (IRS-P4)
Authors: O. S. Chauhan, A. A. A. Menezes, S. Jayakumar, M. A. Malik, Y. Pradhan, A. S. Rajawat, S. R. Nayak, G. Bandekar, C. Almeida, M. Talaulikar, M. V. Ramanamurty, B. R. Subramanian
Venue: International Journal of Remote Sensing (2007)

A series of tide-synchronous satellite images, obtained from the Ocean Colour Monitor (OCM) onboard the Indian Remote Sensing Satellite (IRS-P4), in situ measurements and hydrodynamic model simulations were used to describe dispersal pathways and sources of total suspended matter (TSM) in the Gulf of Kachchh, a macrotidal system with insignificant freshwater inputs. Strong alongshore currents are prevalent at the mouth that move in (out) clockwise during flood (ebb) and undergo cyclic, dynamic changes with the tidal phases. The Gulf, unlike other regions of the Indian coastline, has dynamic turbidity that is zonal (very high in the outer Gulf and in the creeks of the Gulf), particularly during flooding, and reduced in the central region throughout the entire tidal cycle. From this dynamic turbidity with regard to the prevalent currents, it is deduced that inland amplifying flood currents draw in TSM-rich offshore waters into the Gulf, and are the major source of turbidity in the outer regions of the Gulf. In the inner Gulf, because of these high-magnitude currents, scouring of the creek bed leads to resuspension to create higher turbidity. Most of the scoured flux sinks off the mouths of these creeks because of the fanning out of ebbing flows from the narrow creeks into the wider Gulf. The areas under specific influence of different sources of turbidity are delineated schematically.
Detecting infestation of take-all disease in wheat using Landsat Thematic Mapper imagery
Authors: X. Chen, J. Ma, H. Qiao, D. Cheng, Y. Xu, Y. Zhao
Venue: International Journal of Remote Sensing (2007)

Take-all is an important root disease of wheat and has caused considerable decreases in crop yield in China. Although take-all is the most studied disease of any crop, there is little research on detecting the infestation of the disease using remote sensing imagery. In this Letter, the Normalized Difference Vegetation Index and Masking, Principal-Components Transformation, and Analysis techniques were used to detect the severe infestation of the take-all disease in wheat using Landsat Thematic Mapper imageries on 30 April and 16 May 2006. Results showed that the technique was simple and effective in the study areas, and could be applied to other wheat-planting regions with similar growth situations.
On the complexity of learning from counterexamples and membership queries
Authors: W. Maass, G. Turan
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

It is shown that for any concept class C the number of equivalence and membership queries that are needed to learn C is bounded from below by Omega (VC-dimension(C)). Furthermore, it is shown that the required number of equivalence and membership queries is also bounded from below by Omega (LC-ARB(C)/log(1+LC-ARB(C))), where LC-ARB(C) is the required number of steps in a different model where no membership queries but equivalence queries with arbitrary subsets of the domain are permitted. These two relationships are the only relationships between the learning complexities of the common online learning models and the related combinatorial parameters that have remained open. As an application of the first lower bound, the number of equivalence and membership queries that are needed to learn monomials of k out of n variables is determined. Learning algorithms for threshold gates that are based on equivalence queries are examined. It is shown that a threshold gate can learn not only concepts but also nondecreasing functions in polynomially many steps.
Motion driven adaptive transform based on wavelet transform for enhanced video coding
Authors: Nikola Sprljan, Marta Mrak, Ebroul Izquierdo
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

Spatial wavelet transform in video coding has traditionally been applied in a non-adaptive fashion. However, since motion compensation introduces specific structure into video frames, adaptive spatial transform can introduce additional coding gain. As the structure introduced by motion compensation depends on applied motion parameters, the same motion information can be used as an adaptation parameter in spatial decomposition. Specifically, in this paper motion driven adaptation on wavelet transform in its lifting implementation is proposed. The introduced computational complexity of the proposed method is low as only a few additional multiplications are introduced per lifting step. Since in this case the same motion information is available at both encoder and decoder, transmission of additional side information is not needed. Besides better energy compaction, the proposed scheme introduces considerable gain when applied in scalable video coding.
A note on adaptive group lasso
Authors: Hansheng Wang, Chenlei Leng
Venue: Computational Statistics Data Analysis (2008)

Group lasso is a natural extension of lasso and selects variables in a grouped manner. However, group lasso suffers from estimation inefficiency and selection inconsistency. To remedy these problems, we propose the adaptive group lasso method. We show theoretically that the new method is able to identify the true model consistently, and the resulting estimator can be as efficient as oracle. Numerical studies confirmed our theoretical findings.