ppxscal/embedding_network huggingface dataset:
Separate and inequal: preserving heterogeneity in topical authority flows
Authors: Lan Nie, Brian D. Davison
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Web pages, like people, are often known by others in a variety of contexts. When those contexts are sufficiently distinct, a page's importance may be better represented by multiple domains of authority, rather than by one that indiscriminately mixes reputations. In this work we determine domains of authority by examining the contexts in which a page is cited. However, we find that it is not enough to determine separate domains of authority; our model additionally determines the local flow of authority based upon the relative similarity of the source and target authority domains. In this way, we differentiate both incoming and outgoing hyperlinks by topicality and importance rather than treating them indiscriminately. We find that this approach compares favorably to other topical ranking methods on two real-world datasets and produces an approximately 10% improvement in precision and quality of the top ten results over PageRank.
Mining stock category association and cluster on Taiwan stock market
Authors: Shu-Hsien Liao, Hsu-hui Ho, Hui-wen Lin
Venue: Expert Systems with Applications: An International Journal (2008)

One of the most important problems in modern finance is finding efficient ways to summarize and visualize the stock market data to give individuals or institutions useful information about the market behavior for investment decisions. The enormous amount of valuable data generated by the stock market has attracted researchers to explore this problem domain using different methodologies. This paper investigates stock market investment issues on Taiwan stock market using a two-stage data mining approach. The first stage Apriori algorithm is a methodology of association rules, which is implemented to mine knowledge and illustrate knowledge patterns and rules in order to propose stock category association and possible stock category investment collections. Then the K-means algorithm is a methodology of cluster analysis implemented to explore the stock cluster in order to mine stock category clusters for investment information. By doing so, this paper proposes several possible Taiwan stock market portfolio alternatives under different circumstances.
A Goal Driven Approach to Deal with Quality of Service as Potential Aspects
Authors: Assia Ait Ali Slimane, Carine Souveyet
Venue: Proceedings of the 2008 International Workshop on Advanced Information Systems for Enterprises (2008)

Services based application and services compositions are used to improve cooperation between companies to increase the adaptability of information systems (IS) architecture.However, services as well as services compositions are designed in such a way that quality of services (QoS) policy cannot be dynamically adapted to the users needs. In fact, services and services compositions encapsulate the domain-specific business logic served by company IS, and orthogonal requirements called quality of services such as security, logging, and transaction. To adapt, in a dynamic way, the QoS to the business-logic of services in the services composition, we propose to deal with two kinds of services; business and quality early in the process. In this paper, we propose an intentional process that enables to differentiate a business service and quality of service, in a goal driven manner. The QoS is considered as a potential aspect. The paper presents the approach and illustrates it with a medical case study.
Which Instant Messaging System Should I Choose: A Conceptual Model
Authors: Zhaoli Meng, Meiyun Zuo, Yanhui Chen
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Recent years, China has become one of the biggest market for International IT product giants have entered China market in recent years, such as MSN, Google, eBay, and Yahoo!. All of these products experience fierce competitions from indigenous IT products. Although indigenous IT products provide almost the same function as their international competitors, they dominate the market after passing the phase of imitation. What are the key reasons for their success? In this paper, we compare the detailed designs of MSN vs. QQ. By proposing a conceptual model, we investigate how the different functions of MSN and QQ lead to different users’ adoption intention. The conceptual model is not only helpful for researchers who are keen to investigate the factors which affect IT adoption process, but also shed light on how to understand users behavior and grab the market share for practitioners in China.
MOEMS: packaging and testing
Authors: Z. F. Wang, W. Cao, Z. Lu
Venue: Microsystem Technologies (2005)

In this paper, packaging techniques of fiber optical MEMS devices are investigated. A packaging scheme is proposed, which includes the architecture to construct the component package and the major packaging flow to implement it. Passive fiber alignment with the accuracy comparable with active alignment is presented by the combination of rectangular shape fiber grooves and micro fiber stoppers. The experimental setup specific for fiber optic MEMS component is presented for the fiber assembly and the characterization of optical loss. A testing system based on the Labview 6.1 instrument control is also presented, which can facilitate the characterization of switching time for MEMS optical switches.
Fabrication of photonic components by nanoimprint technology within ePIXnet
Authors: U. Plachetka, A. Kristensen, S. Scheerlinck, J. Huskens, N. Koo, H. Kurz
Venue: Microelectronic Engineering (2008)

The joined research activities on nanoimprint lithography (JRA-NIL) within a European Network of Excellence (ePIXnet) are described. The achievements are presented in three different exemplary applications.
Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians
Authors: Andreas Griewank, Andrea Walther, Maciek Korzec
Venue: Optimization Methods Software (2007)

For use in a total quasi-Newton NLP code [Griewank, A. and Walther, A., 2002, On constrained optimization by adjoint based quasi-Newton methods. Optimization Methods and Software, 17, 869-889.], we describe a QR-based nullspace factorization of KKT matrices. We illustrate the linear algebra in detail and present a theory for maintaining factorized matrices after low-rank updates. Each update of the whole system is incorporated with a computational effort that grows only quadratically with respect to the number of variables and active constraints. Furthermore, our method is special in making use of quasi-Newton updates for the constraint Jacobian approximation, instead of the usual way of using the exact derivative or divided differences. To avoid singularity or blow-up of the KKT matrix, we limit the variations of its determinant to a certain factor and dampen or augment the updates if necessary. We maintain the reduced Hessian positive definite, so that the resulting quasi-Newton steps in the primal and dual variables are downhill for suitably weighted merit functions.
On Effective Data Transmission in Mobile Ad Hoc Networks
Authors: Masako Shinohara, Takahiro Hara, Shojiro Nishio
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In mobile ad hoc networks, when a mobile host receives a data request from another host, the host usually transmits the requested data item by unicast. However, if mobile hosts hold data items that are frequently requested by others, they have to transmit the data items many times and consume a large amount of power. In this paper, we discuss effective data transmission for not only maintaining data availability but also prolonging the lifetime of mobile hosts. In our proposed method, each mobile host sends a data request attached with the deadline to receive the requested data item by the determined time. Moreover, each mobile host collects multiple requests for data items and transmits the requested data items by multicast. Therefore, our proposed method reduces data traffic.
Half-baked logo microworlds as boundary objects in integrated design
Authors: Chronis Kynigos
Venue: Informatics in education (2007)

The paper addresses the problem of fragmentation of the communities involved in the design of digital media for education. It draws on the experience gained at the Educational Technology Lab in the design of Logo-based microworlds with three different platforms respectively based on component computing, 3D game engines and 3D navigation with a GIS. In this paper I use the term half-baked to describe a microworld which is explicitly designed to engage its users with changing it as the main aspect of their activity. I discuss this kind of microworld as a tool for integrated design involving people with diverse expertise and/or roles to communicate. These kinds of microworlds implicitly exist within the community, but they can be explicitly designed mediated and put to use in the role of facilitators for integrated design and development to enable a growing communication amongst researchers, technicians, teachers and students. A template for presenting microworlds which was constructed through the experience with four such integrated communities is used to describe for each respective case the design principles, the affordances, the histories of development and the variety of emergent microworlds.
Creating Cool MINDSTORMS NXT Robots (Technology in Action)
Authors: Daniele Benedettelli
Venue:  (2008)

Build and program MINDSTORM NXT robots with Daniele Benedettelli, one of the worlds most respected NXT robot builders. He shows you how to build and program them from scratch, starting with the simplest robots and progressing in difficulty to a total of seven awardwinning robots! You can download all the code, along with lowresolution videos that show how your robot works when its finished. You dont need to be a programmer to develop these cool robots because all the code is provided, but advanced developers will enjoy seeing the secrets of Benedettellis code and techniques revealed. What youll learn How to create awardwinning robots from scratch to final programming. How to build each robot and which materials to use. Why certain features have specific designs. How to program your robotall code is available for free download. Inspiration and tips and tricks on robotics, a particularly valuable resource for teachers and students. Who is this book for? Anyone interested in building robots or seeing how it is done. Programmers interested in learning how robots are programmed. Related Titles Competitive MINDSTORMS: A Complete Guide to Robotic Sumo using LEGO MINDSTORMS Squeak: Learn Programming with Robots Robot Building for Beginners The Definitive Guide to Building Java Robots Intermediate Robot Building LEGO MINDSTORMS NXT: The Mayan Adventure LEGO MINDSTORMS NXT-G Programming Guide The Robosapien Companion: Tips, Tricks, and Hacks Extreme MINDSTORMS: An Advanced Guide to LEGO MINDSTORMS Advanced NXT: The Da Vinci Inventions Book
A New Enterprise Customer and Supplier Cooperative System Framework Based on Multiple Criteria Decision-Making
Authors: Xiang Liu
Venue: Proceedings of the Third International Conference on Systems (2008)

An enterprise customer and supplier cooperative system is powerful tools to solving customer and supplier multiple criteria decision-making (MCDM) problems. This study develops an agent-based and service-oriented enterprise customer and supplier cooperative system framework based on multiple criteria decision-making. It consists of three main components. The first component is customer and supplier group decision-making (GDM) approach in which many participants’ points of views are considered in the modeling of a specific problem. In the second component, a new approach for solving enterprise customer and supplier MCDM problems is proposed based on cooperative neural network. The third component is related to enterprise customer and supplier MCDM cooperative intelligent system that are supported by new technologies such as multi-agent, multi-dimensional query expression for document warehouses, distributed data mining, cooperative neural network. A new software system called enterprise customer and supplier cooperative system is developed based on the framework. Enterprise customer and supplier cooperative system can be accessed from Web. The software provides online queries, and online analysis functions for users anywhere at any time. An example of the software as tested on enterprise customer and supplier MCDM problems is presented to illustrate its effectiveness.
An Adapter Chaining Scheme for Service Continuity in Ubiquitous Environments with Adapter Evaluation
Authors: Byoungoh Kim, Kyungmin Lee, Dongman Lee
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

A key feature of ubiquitous computing is service continuity which allows a user to transparently continue his task regardless of his movement. For service continuity, the underlying system needs to not only discover a service satisfying a user’s request, but also provide an interface differences resolution scheme if the interface of the service found is not the same as that of the service requested. For resolving interface mismatches, one of popular solutions is to use an interface adapter. The most serious problem in the interface adapter-based approach is the overhead of adapter generation. There are many research efforts about adapter generation load reduction and this paper focuses on an adapter chaining scheme to reduce the number of necessary adapters among different service interfaces. We propose a construction-time adaptation loss evaluation scheme and an adapter chain construction algorithm, which finds an adapter chain with minimal adaptation loss.
An empirical study of the learning effect of an ontology-driven information system
Authors: Misook Heo, Myongho Yi
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

This paper investigates the effect of an ontology-driven information system on users' learning the content of the domain covered by the system. While there have been quite a number of research studies on ontology systems' design, development and evaluation, its impact on users has not been a popular research topic. An experimental system has been developed and constructed with pluralistic, non-linear representations of metadata and relationships. While the expected learning effect did not occur among differently trained participant groups, previous online search experience showed a positive correlation with the performance of the participants.
Hierarchical sampling for active learning
Authors: Sanjoy Dasgupta, Daniel Hsu
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We present an active learning scheme that exploits cluster structure in data.
Practical, pluggable types
Authors: Niklaus Haldiman, Marcus Denker, Oscar Nierstrasz
Venue: Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007 (2007)

Most languages fall into one of two camps: either they adopt a unique, static type system, or they abandon static type-checks for runtime checks. Pluggable types blur this division by (i) making static type systems optional, and (ii) supporting a choice of type systems for reasoning about different kinds of static properties. Dynamic languages can then benefit from static-checking without sacrificing dynamic features or committing to a unique, static type system. But the overhead of adopting pluggable types can be very high, especially if all existing code must be decorated with type annotations before any type-checking can be performed. We propose a practical and pragmatic approach to introduce pluggable type systems to dynamic languages. First of all, only annotated code is type-checked. Second, limited type inference is performed on unannotated code to reduce the number of reported errors. Finally, external annotations can be used to type third-party code. We present TypePlug, a Smalltalk implementation of our framework, and report on experience applying the framework to three different pluggable type systems.
ASDPS-based geochemical data processing and anomaly identification
Authors: Wanwu Guo
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Geochemical data processing aims firstly at reducing random and/or systematic errors resulted from the field survey and/or laboratory analysis, and secondly at identifying whether the data contain some useful information indicating the existence of mineral concentrations, oil fields, and pollution sources in the survey area. The first task is usually carried out by using various smoothing approaches. However, how to determine the 'best' outcome from many smoothing methods still depends on a geochemist's personal judgment. The second task is achieved by making the data in reference to some geochemical benchmarks. In this paper, a statistical method is proposed to determine the likely 'best' outcome among many smoothed datasets, and then this 'best' fitted dataset is used to determine anomalies in reference to different geochemical benchmarks. The proposed statistical selector quantifies the determination of smoothing processing of geochemical data. The anomaly classifiers proposed can automatically identify and classify any geochemical anomalies contained in the data.
On the structure of graphs with a unique k-factor
Authors: Petra Johann
Venue: Journal of Graph Theory (2000)

In this paper we study the structure of graphs with a unique k-factor. Our results imply a conjecture of Hendry on the maximal number m (n,k) of edges in a graph G of order n with a unique k-factor: For $k > {n\over 2}$ we prove $m(n,k)={nk\over 2} + \left({n- k\atop 2}\right)$ and construct all corresponding extremal graphs. For $k\le {n\over 2}$ we prove $m(n,k) \le {n^2\over 4} + (k - 1){n\over 4}$. For n = 2kl, l &epsilon; ℕ, this bound is sharp, and we prove that the corresponding extremal graph is unique up to isomorphism. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 35: 227243, 2000
A longitudinal study of real-time search assistance adoption
Authors: Peter Anick, Raj Gopal Kantamneni
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We present findings from a log based study designed to track the adoption of features of a new real-time query refinement interface deployed on the Yahoo search engine. Several trends from the first four months are noted and discussed.
Up and coming SIGWEB supported conferences
Authors: Darren Lunn
Venue: ACM SIGWEB Newsletter (2008)

SIGWEB supports several specialized conferences, short courses, and workshops, as well as the Annual Hypertext Conference. SIGWEB sponsored conferences focus on timely topics in applied and computational hypertext and Web disciplines and provide a place for members and the en- tire applied Hypermedia and Web community to exchange ideas and to meet with and expand their network of colleagues. In this article, we provide a brief overview of SIGWEB sponsored conferences, in addition to events that are in co-operation with SIGWEB.
Generalization of raster images containing patterns featuring stochastic repetitiveness
Authors: Artur Rataj
Venue: Machine Graphics Vision International Journal (2007)

The issue of reconstruction of missing or unreliable parts of an image is one of the basic problems in image processing. For example, there are a number of methods for texture generation on the basis of a small sample. This paper presents a method that 'bottlenecks' an image processing feedforward neural network so that only some basic traits of the image are preserved. These basic traits are in turn used to generalize the image, thus filtering out any unusual parts of the image. The ability of neural networks and several other learning machines to generalize is based on the premise of smoothness of the generalizing function. Thus, in order to detect advanced patterns that exhibit complex traits like repetitiveness, instead of training these machines directly with raw data, transforms of the patterns like the Fast Fourier Transform are sometimes performed. In this paper it is shown, that a simple feedforward neural network, without any pre-processing of the training data, using the described 'bottleneck' architecture, can properly predict a stochastically repetitive pattern in a raster image.
Compressed sensing and Bayesian experimental design
Authors: Matthias W. Seeger, Hannes Nickisch
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We relate compressed sensing (CS) with Bayesian experimental design and provide a novel efficient approximate method for the latter, based on expectation propagation. In a large comparative study about linearly measuring natural images, we show that the simple standard heuristic of measuring wavelet coefficients top-down systematically outperforms CS methods using random measurements; the sequential projection optimisation approach of (Ji & Carin, 2007) performs even worse. We also show that our own approximate Bayesian method is able to learn measurement filters on full images efficiently which outperform the wavelet heuristic. To our knowledge, ours is the first successful attempt at "learning compressed sensing" for images of realistic size. In contrast to common CS methods, our framework is not restricted to sparse signals, but can readily be applied to other notions of signal complexity or noise models. We give concrete ideas how our method can be scaled up to large signal representations.
Event-related potentials associated with masked priming of test cues reveal multiple potential contributions to recognition memory
Authors: Anna M. Woollams, Jason R. Taylor, Frini Karayanidis, Richard N. Henson
Venue: Journal of Cognitive Neuroscience (2008)

The relationship between recognition memory and repetition priming remains unclear. Priming is believed to reflect increased processing fluency for previously studied items relative to new items. Manipulations that affect fluency can also affect the likelihood that participants will judge items as studied in recognition tasks. This attribution of fluency to memory has been related to the familiarity process, as distinct from the recollection process, that is assumed by dual-process models of recognition memory. To investigate the time courses and neural sources of fluency, familiarity, and recollection, we conducted an event-related potential (ERP) study of recognition memory using masked priming of test cues and a remember/know paradigm. During the recognition test, studied and unstudied words were preceded by a brief, masked word that was either the same or different. Participants decided quickly whether each item had been studied (“old” or “new”), and for items called old, indicated whether they “remembered” (R) the encoding event, or simply “knew” (K) the item had been studied. Masked priming increased the proportion of K, but not R, judgments. Priming also decreased response times for hits but not correct rejections (CRs). Four distinct ERP effects were found. A medial-frontal FN400 (300--500 msec) was associated with familiarity (R, K Hits > CRs) and a centro-parietal late positivity (500--800 msec) with recollection (R Hits > K Hits, CRs). A long-term repetition effect was found for studied items judged “new” (Misses > CRs) in the same time window as the FN400, but with a posterior distribution. Finally, a centrally distributed masked priming effect was visible between 150 and 250 msec and continued into the 300--500 msec time window, where it was topographically dissociable from the FN400. These results suggest that multiple neural signals are associated with repetition and potentially contribute to recognition memory.