ppxscal/embedding_network huggingface dataset:
Enhanced Approaches of Content Management for the Collaborative Semiconductor Business
Authors: Hyun Song Jang, Young Joong Lee, Young Jun Han, Chung Sam Ahn, Joong Min Choi
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Over the last several years in the semiconductorbusiness, types of the semiconductor products have beendramatically diversified, and its business has expandedon a large scale. As a result, technology of advancedprocesses and devices has been more sophisticated, andits information produced has been too huge to be wellmanaged. Therefore there have been many difficulties increating and sharing information and knowledgenecessary for developing and manufacturing products,with traditional processes and existing informationsystems. Eventually such problems caused additionallead-time of product and technology development, andhad it lagged behind other competitors, being an obstacleto reduce costs and time to market.In order to solve the problem, a new classification ofcontents is established so that technology and informationnecessary for product development and production can becomposed of knowledge chain. Further, the collaborativecontent management system base on the enterprise-wideknowledge chain is developed. This paper discussesmodels of designed system and its construction approach.
Learning Name Pronunciations in Automatic Speech Recognition Systems
Authors: Françoise Beaufays, Ananth Sankar, Shaun Williams, Mitch Weintraub
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Many speech recognition systems that provide over-thephone services, e.g. name dialers, stock quote providers, location finders, rely on the accurate recognition of proper names. For this to happen, the systems need to know how their users will pronounce these words. However, predicting the pronunciation of a proper name is a notoriously difficult problem as it depends on the origin of the name, the linguistic background of the speaker, and other cultural and sociological factors, in addition of course to the word spelling.In this paper, we describe a data-driven method that learns proper name pronunciations from audio samples of these words. The algorithm relies on the machinery of a general purpose speech recognizer to find the phone sequence that best matches the sample speech waveforms. In addition, it incorporates linguistic knowledge automatically acquired from a pronunciation dictionary to ensure that the learned pronunciations are "reasonable" from a linguistic viewpoint.We show on a corporate name dialing database that the proposed algorithm reduces the call routing error rate by 40% compared to a reference letter-to-phone pronunciation engine.
Parallel Processing of First Order Linear Recurrence on SMP Machines
Authors: Hong-soog Kim, Young-ha Yoon, Dong-soo Han
Venue: The Journal of Supercomputing (2004)

In this paper, we propose a new algorithm that analyzes the data dependency pattern in the first-order linear recurrence (FOLR) and transforms it into algebraically equivalent expanded form so that it can be processed in parallel using the threads on symmetric multiprocessor (SMP) machines. The transformation aims to eliminate the data dependencies in the naive nested form of the FOLR. However, as this transformation may result in extra multiplication operations, our algorithm examines the immanent overhead of the expanded form of the FOLR and generates a new hybrid form of the FOLR. The hybrid form combines nested and appropriately expanded form in order to make it suitable for parallel processing. The parallel algorithm based on the hybrid form of the FOLR is analytically examined and tested through implementation on SMP machines. The implementation details, such as the workload balancing between processors and the optimization of cache performance, are also discussed. The experimental results show that the parallel algorithm based on the hybrid form of the FOLR considerably improves the performance on SMP machines that have three of more processors.
The experience of libraries across time: thematic analysis of undergraduate recollections of library experiences
Authors: Jacqueline Kracker, Howard R. Pollio
Venue: Journal of the American Society for Information Science and Technology (2003)

To understand the human experience of libraries and the implications this understanding has for library use and service, education, and design, 118 undergraduate students were asked to list three personally memorable incidents concerning library use. Following this, they were asked to write a short narrative of one of these experiences. Incidents reported by participants ranged from preschool to college age, and content analysis indicated that a majority took place at two or more grade levels, sometimes as early as the participant's first (preschool) visit to a library. Phenomenological analysis of individual narratives produced a thematic structure for each of the four grade levels represented in the data: elementary school and younger, middle school, high school, and college/adult. Themes common across all four levels include Atmosphere, Size and Abundance, Organization/Rules and Their Effects on Me, and What I Do in the Library. A theme of Memories was unique to narratives that took place during elementary and younger age levels. Although all remaining themes were noted across age levels, the relative importance of various themes and subthemes was different at different ages. Implications of the thematic structure for library practice are discussed.
An access control framework for business processes for web services
Authors: Hristo Koshutanski, Fabio Massacci
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

Business Processes for Web Services are the new paradigm for the lightweight integration of business from different enterprises.Whereas the security and access control policies for basic web services and distributed systems are well studied and almost standardized, there is not yet a comprehensive proposal for an access control architecture for business processes. The major issue is that a business process describe complex services that cross organizational boundaries and are provided by entities that see each other as just partners and nothing else.This calls for a number of differences with traditional aspects of access control architectures such as&bull; credential vs classical user-based access control,&bull; interactive and partner-based vs one-server-gathers-all requests of credentials from clients,&bull; controlled disclosure of information vs all-or-nothing access control decisions,&bull; abducing missing credentials for fulfilling requests vs deducing entailment of valid requests from credentials in formal models,&bull; "source-code" authorization processes vs data describing policies for communicating policies or for orchestrating the work of authorization servers.Looking at the access control field we find good approximation of most components but not their synthesis into one access control architecture for business processes for web services, which is the contribution of this paper.
An Efficient and Scalable Algorithm for Clustering XML Documents by Structure
Authors: Wang Lian, David Wai-lok Cheung, Nikos Mamoulis, Siu-Ming Yiu
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--With the standardization of XML as an information exchange language over the net, a huge amount of information is formatted in XML documents. In order to analyze this information efficiently, decomposing the XML documents and storing them in relational tables is a popular practice. However, query processing becomes expensive since, in many cases, an excessive number of joins is required to recover information from the fragmented data. If a collection consists of documents with different structures (for example, they come from different DTDs), mining clusters in the documents could alleviate the fragmentation problem. We propose a hierarchical algorithm (S-GRACE) for clustering XML documents based on structural information in the data. The notion of structure graph (s-graph) is proposed, supporting a computationally efficient distance metric defined between documents and sets of documents. This simple metric yields our new clustering algorithm which is efficient and effective, compared to other approaches based on tree-edit distance. Experiments on real data show that our algorithm can discover clusters not easily identified by manual inspection.
Sufficient Optimality Condition for Vector Optimization Problems under D.C. Data
Authors: N. Gadhi, A. Metrane
Venue: Journal of Global Optimization (2004)

In this paper, we establish sufficient optimality conditions for D.C. vector optimization problems. We also give an application to vector fractional mathematical programming in a ordred separable Hilbert space.
Derived tree languages of nonassociative Lambek categorial grammars with product
Authors: Maciej Kandulski
Venue: Fundamenta Informaticae (2002)

We introduce the notion of derived tree corresponding with a derivation in the nonassociative Lambek calculus with product, and examine languages of derived trees determined by categorial grammars employing the calculus as a type reduction system. We prove that the class of derived tree languages of nonassociative Lambek grammars with product contains only regular tree languages.
Design patterns for marine biology simulation
Authors: Dung "Zung" Nguyen, Mathias Ricken, Stephen Wong
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

We specify and implement a GUI application that simulates marine biological systems by making extensive use of object-oriented design patterns.The key design patterns are model-view-control, observer/observable, visitor, command, factory method and decorator. These design patterns help delineate the roles and responsibilities of the objects in the system, establish loose coupling between objects and arrange for the objects to communicate and cooperate with one another at the highest level of abstraction. The result is an application that exhibits minimal control flow, yet is powerful, robust, flexible and easy to maintain.Our work entails a non-trivial redesign of the current AP Computer Science Marine Biology Simulation case study and may serve as a case study for an introductory "object-first" curriculum.
Storage mechanism for VHDL intermediate form
Authors: Bruno Poterie
Venue: Proceedings of the conference on European design automation (1990)

This paper describes the storage and access mechanisms used for structured data throughout the VHDL CAD system developed at the Swedish Institute of Microelectronics.We present the implementation rationale and the main design choices. We give an overview of the general architecture of all parts and tools, with special emphasis on the most prominent features. We then detail the main components of the system. We present and comment on results, and indicate possible enhancements.
An Intrusion-Tolerant Password Authentication System
Authors: Xunhua Wang, M. Hossain Heydari, Hua Lin
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

In a password-based authentication system, to authenticatea user, a server typically stores password verificationdata (PVD), which is a value derived from theuser's password using publicly known functions.For thoseusers whose passwords fall within an attacker's dictionary,their PVDs, if stolen (for example, through servercompromise), will allow the attacker to mount off-line dictionaryattacks.In this article, we describe a passwordauthentication system that can tolerate server compromises.The described system uses multiople (say n) serversto share password verification data and never reconstructsthe shared PVD during user authentications.Onlya threshold number (say t, t ¿ n) of these servers are requiredfor a user authentication and compromisingup to (t - 1) of these servers will not allow an attackerto mount off-line dictionary attacks, even if a user'spassword falls within the attacker's dictionary.Thedescribed system can still function if some of the serversare unavailable.In this paper, we give the system architectureand implementation details.Our experimental resultsshow that the described system works well.The givensystem can be used to build intrusion-tolerant applications.
Mathematical Models for Studying the Value of Cooperational Leadership in Team Replacement
Authors: Daniel Solow, Chartchai Leenawong
Venue: Computational Mathematical Organization Theory (2003)

Mathematical models are presented for studying the value of leadership in a team whose composition is changing over time. The models are based on a leader's role of achieving cooperation among the interacting members so that they perform their tasks better and hence improve overall team performance. Three different approaches, modified from Kauffman's NK model, are proposed. Each model includes controllable parameters whose values reflect the amount of interaction among the workers as well as the skill and variance of the leader in achieving cooperation. Computer simulations are used to show how the skill level and variance of the leader affect the expected performance of the team. Managerial insights into the value of the leader&mdash;such as the fact that finding a more skillful leader can be more important to team performance than controlling the amount of interaction among the team members&mdash;are provided.
Linear response algorithms for approximate inference in graphical models
Authors: Max Welling, Yee Whye Teh
Venue: Neural Computation (2004)

Belief propagation (BP) on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. However, it does not prescribe a way to compute joint distributions over pairs of distant nodes in the graph. In this article, we propose two new algorithms for approximating these pairwise probabilities, based on the linear response theorem. The first is a propagation algorithm that is shown to converge if BP converges to a stable fixed point. The second algorithm is based on matrix inversion. Applying these ideas to gaussian random fields, we derive a propagation algorithm for computing the inverse of a matrix.
Route panoramas for city navigation
Authors: Jiang Yu Zheng, Min Shi, Makoto Kato
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper presents a new medium called route panorama (RP) for visualizing a large-scale environment such as a town or a city. An RP is captured by a slit camera mounted on a vehicle. It is a continuous, compact and complete visual representation of scenes along a route. It can be transmitted on the Internet in real time as a streaming media and displayed in various styles for virtual city traversing. The application of RPs includes virtual tour, navigation, heritage archiving, urban planning, city indexing, etc.
An adaptive temperament-based information filtering method for user-customized selection and presentation of online communication
Authors: Dennis Mcleod
Venue:  (2002)

The rapid proliferation of on-line digital information is changing our everyday life. New techniques are needed to assist people in managing this potentially overwhelming and diverse digital information space. The most popular approach is content-based filtering which draws on the vector space model of conventional textual information retrieval. However, such keyword-based systems usually require the user to know what they want exactly and are not suitable for serendipitous search. In addition, multimedia information units cannot be fully featured by key terms or filtered on quality or style. Although social filtering addresses some of the limitations of content-based filtering by clustering information by user evaluations or opinion, no predefined concept classes are used to describe or simplify the meaning of the clusters. Moreover, none has taken human temperaments into account in the classification or filtering process. Human temperaments have been recognized as a predominant factor in the patterns of human behavior. We hypothesized that the accuracy of an information recommendation system can be significantly improved by employing user temperament for filtering and customization. To test the hypothesis, Temperament-based information filtering model was proposed as a solution to characterize the information space by taking human factors, particularly human temperament, into consideration, which may categorize the information space into conceptually coherent classes and improve recommendation. A prototype system was developed and demonstrated in three application domains&mdash;a document collection, an art image collection, and representation styles, by utilizing a combination of simulation and user-studies testing. The notion of human temperaments was explored and learned for the representation and segmentation of an information space. Furthermore, the learned temperament concept was employed for the interpretation and measurement of the relevance for classification and recommendation of the information units. The results of our experiments indicate that the accuracy of recommendation using temperament-based filtering generally outperforms that in content-based filtering. The quality of specific search as well as serendipitous search is enhanced by providing the optimal predictions that are pertinent to not only user interests but also user temperament.
Efficient mediators through dynamic code generation: a method and an experiment
Authors: Yasushi Shinjo, Toshiyuki Kubo, Calton Pu
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Mediators are well-known software components in the construction of distributed systems and applications, with clear advantages when adding functionality to legacy code. However, mediators that must handle dynamic interfaces (i.e., those that may change at run-time such as callback functions) are not easy to build in most imperative languages such as C, due to the many variants implied by the dynamic interfaces. We call his kind of mediators intermediators. We propose a systematic implementation method based on the concept of closures to implement intermediators using the Tempo run-time specializer for C programs. To illustrate this method, we implemented a unified user authentication intermediator for Unix and Windows 2000 called GINA-IM. GINA-IM gets the password entries from a Unix NIS server and performs user authentication based on the GINA model (Graphical Identification and Authentication) of Windows 2000. The code of GINA-IM is a quarter of the code size of a conventional component written without our tools. GINA-IM is in production use at authors' university by two thousands of freshmen in class and several thousands of students daily.
A concave-type structure of a Ru electrode capacitor fabricated by the reactive ion etching method
Authors: Byong-Sun Ju, Hyoun Woo Kim
Venue: Microelectronic Engineering (2003)

We have developed a concave-type Ru electrode capacitor to overcome the limitation of conventional stack-type capacitor in a small critical-dimension (CD) pattern. We have deposited a Ru layer on the concave-type structure made by patterning of SiO2 and subsequently we separated the adjacent nodes by an etch-back process with hydrogen silsesquioxane (HSQ) as a protecting layer. We have summarized the issues regarding the patterning in the reactive ion etching system for fabricating the concave-type capacitor.
Adaptive content networking
Authors: Sven Buchholz, Thomas Buchholz
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Content adaptation is an essential concept to meet the heterogeneous requirements of clients in Pervasive Computing environments. However, content adaptation interferes with replication applied in content networks to improve the performance of information access. Leveraging the advantages of replication in the world of Pervasive Computing is the subject of this paper.We introduce the notion of Cost-Quality Optimized Content Networking and formalize the inherent optimization problem. Additionally, web-caching and Content Distribution Networks (CDN) are compared with respect to their potential to accommodate cost-quality optimized content adaptation showing web-caching to be inappropriate due to intolerable response delays. The feasibility in the CDN scenario is illustrated by outlining a CDN system architecture.
The Case for Proactive Mobile IP
Authors: T. Pagtzis, S. Hailes, P. Kirstein
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

This paper establishes quantitatively, the case for proactiveIP mobility versus its reactive Mobile IP counterpartby means of simulations. Results attained, exhibit markedimprovements on transmission delay over proactive MobileIP and demonstrate the case for context-transfered intelligence,assisting both the MN and its accommodating wirelessnetwork in effecting intelligent seamless IP handoffs.
Mining unexpected rules by pushing user dynamics
Authors: Ke Wang, Yuelong Jiang, Laks V. S. Lakshmanan
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Unexpected rules are interesting because they are either previously unknown or deviate from what prior user knowledge would suggest. In this paper, we study three important issues that have been previously ignored in mining unexpected rules. First, the unexpectedness of a rule depends on how the user prefers to apply the prior knowledge to a given scenario, in addition to the knowledge itself. Second, the prior knowledge should be considered right from the start to focus the search on unexpected rules. Third, the unexpectedness of a rule depends on what other rules the user has seen so far. Thus, only rules that remain unexpected given what the user has seen should be considered interesting. We develop an approach that addresses all three problems above and evaluate it by means of experiments focusing on finding interesting rules.