ppxscal/embedding_network huggingface dataset:
Next Generation Internet and P2P E-com Model
Authors: Fang Zhiyuan, Zheng Ruiqi
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Initiation of Next Generation Internet (NGI) will make e-commerce face a new challenge and open a new way for P2P model of e-commerce. P2P's Concept, peculiarities, techniques, and P2P e-com models are expounded in this paper. It also explores an application of P2P ecommerce model for P2P model's perspective.
A System for Project Distribution Based on the Semantic Matching Method
Authors: Xu Ying, Xu Fu-yuan, Li Sheng-qi
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In this paper, we develop a system for making matches between domain experts with projects in the same area based on the semantic similarity method. The idea behind this method concerns exploiting features of ontology for processing documents and queries, and calculating similarity for filtering relevant information. The proposed system contains four main components: Ontology Building, Document Formalization, Similarity Calculation and User Interface. First, we utilize Protégé to develop our domain ontologies, which defines concepts of the given domain. These concepts can be transformed to OWL formats. Then, documents describing the experts and projects will be formalized into lists of concepts with weights. This process can be done either automatically or by hand. Finally, an algorithm, which integrates node-based and edge-based approach, is proposed to measure the semantic similarities between projects and experts through the domain ontologies.
Vision-Based Motion Detection Using C-NLPCA Approach
Authors: Silvia Botelho, Ulisses Brisolara Correa, William Israel Lautenschlager
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

In this paper we propose an original method for visionbased motion detection. It allows an autonomous robot to explore an environment, acquiring information, about its own motion aiming to solve future positioning (navigation) problems. This system uses only visual information and no explicit heuristic information (landmarks) for the localization/ navigation process. It is based on the method of Cascaded Nonlinear Components Analysis (C-NLPCA), in order to get a dimensional reduction of the data (image series) which may consider its nonlinearity. For the verification of possible improvements brought by the use of C-NLPCA, a set of analyses were done and the results will be demonstrated in this paper. The C-NLPCA revealed to be efficient, propelling a new field of research.
Asian trio's adoption of Linux-based open source development
Authors: Bongsug (Kevin) Chae, Roger McHaney
Venue: Communications of the ACM (2006)

Three Asian economic heavyweights---China, Japan, and South Korea---join IT forces.
On partially blind multihead finite automata
Authors: Oscar H. Ibarra, Bala Ravikumar
Venue: Theoretical Computer Science (2006)

This work is concerned with 1-way multihead finite automata (FA), both deterministic and nondeterministic, in which the symbol under only one head controls its move. We call such a FA a partially blind multihead FA. We show some results regarding the decision problems and closure properties of blind multihead DFA and NFA. We also compare these devices with 1-way NFA augmented by reversal bounded counters. Finally, we also present some results regarding the simulation of a partially blind DFA and NFA by a probabilistic finite automaton.
MCL: a MobiGATE coordination language for highly adaptive and reconfigurable mobile middleware: Experiences with Auto-adaptive and Reconfigurable Systems
Authors: Yongjie Zheng, Alvin T. S. Chan, Grace Ngai
Venue: Software&mdash;Practice Experience (2006)

The use of middleware is one important approach in facilitating adaptation across wireless and mobile environments, where augmented service entities are composed and deployed to shield mobile clients from the effects of dynamic network characteristics. The MobiGate Coordination Language (MCL) system provides a language-based approach to the building of mobile applications running in an adaptive middleware, MobiGATE. The concept of the separation of concerns forms the underlying and unifying principle in the provision of the adaptive composition of services. Specifically, a coordination language, MCL, is designed to provide rich constructs supporting the definition of compositions, with constrained type validation and checking. In particular, MCL is formalized by means of the design of a semantic model based on the Z language, which can be used to analyze architectural descriptions and detect possible composition errors such as feedback loops and open circuit problems. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Real-Time Semi-Automatic Segmentation Using a Bayesian Network
Authors: Eric N. Mortensen, Jin Jia
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

This paper presents a semi-automatic segmentation technique called Bayesian cut that formulates object boundary detection as the most probable explanation (MPE) of a Bayesian network's joint probability distribution. A two-layer Bayesian network structure is formulated from a planar graph representing a watershed segmentation of an image. The network's prior probabilities encode the confidence that an edge in the planar graph belongs to an object boundary while the conditional probability tables (CPTs) enforce global contour properties of closure and simplicity (i.e., no self-intersections). Evidence, in the form of one or more connected boundary points, allows the network to compute the MPE with minimal user guidance. The constraints imposed by CPTs also permit a linear-time algorithm to compute the MPE, which in turn allows for interactive segmentation where every mouse movement recomputes the MPE based on the current cursor position and displays the corresponding segmentation.
A study for control of client value using cluster analysis
Authors: Hea-Sook Park, Doo-Kwon Baik
Venue: Journal of Network and Computer Applications (2006)

This paper proposes a new policy for consolidating a company's profits by segregating the clients using the contents service and allocating the media server's resources selectively by clusters using the cluster analysis method of CRM, which is mainly applied to marketing. In this case, CRM refers to the strategy of consolidating a company's profits by efficiently managing the clients, providing them with a more effective, personalized service, and managing the resources more effectively.For the realization of a new service policy, this paper analyzes the level of contribution vis-à-vis the clients' service pattern (total number of visits to the homepage, service type, service usage period, total payment, average service period, service charge per homepage visit) and profits through the cluster analysis of clients' data applying the TwoStep Cluster Method. Clients were grouped into four clusters according to the contribution level in terms of profits. Likewise, the CRFS (Client Request Filtering System) was suggested to allocate media server resources per cluster. CRFS issues approval within the resource limit of the cluster where the client belongs. In addition, to evaluate the efficiency of CRFS within the Client/Server environment, the number of admitted streams was evaluated for the comparison with other algorithms. A higher renewal rate was shown when applying CRFS through the evaluation of the client's renewal rate.
Security Considerations in Space and Delay Tolerant Networks
Authors: Stephen Farrell, Vinny Cahill
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

This paper reviews the Internet-inspired security work on delay tolerant networking, in particular, as it might apply to space missions, and identifies some challenges arising, for both the Internet security community and for space missions. These challenges include the development of key management schemes suited for space missions as well as a characterization of the actual security requirements applying. A specific goal of this paper is therefore to elicit feedback from space mission IT specialists in order to guide the development of security mechanisms for delay tolerant networking.
A 1 V switchable CMOS LNA for 802.11A/B WLAN applications
Authors: Wang-Chi Cheng, Jian-Guo Ma, Kiat-Seng Yeo, Manh-Anh Do
Venue: Analog Integrated Circuits and Signal Processing (2006)

A new dual-band, 2.4 and 5.2 GHz, combined LNA, which can operate at 1 V supply only, for WLAN application is presented. The switched transistor technique is used in the LNA. It could match the input port in two frequency bands and reduce one on-chip spiral inductor usage compared with [1, 2]. Theoretical analysis and transistor level simulation results using 0.18 ¿m CMOS process from Chartered Semiconductor are presented to demonstrate this idea.
An analysis of learner's activities in embedded software programming practices
Authors: Masaki Yamamoto, Hiroyuki Tomiyama, Shinya Honda, Nobuyuki Kaneko, Kenji Mase, Nobuo Kawaguchi, Hiroaki Takada, Kiyoshi Agusa
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

Nagoya University has started an extension program on embedded software, called NEXCESS (Nagoya university EXtension Courses for Embedded Software Specialists). NEXCESS is targeted towards embedded software engineers in industry. In industry training on technical skills is very important. Practices are effective for training embedded software development skills. This paper describes the organization and course design of NEXCESS. Also, our analytical method of practices is reported.
Rough Discretization of Gene Expression Data
Authors: Dominik Slezak, Jakub Wroblewski
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

We adapt the rough set-based approach to deal with the gene expression data, where the problem is a huge amount of genes (attributes) a?A versus small amount of experiments (objects) u?U. We perform the gene reduction using standard rough set methodology based on approximate decision reducts applied against specially prepared data. We use rough discretization - Every pair of objects (x,y)xU yields a new object, which takes values "\ge a(x)" if and only if a(y)\ge a(x); and "\le a(x)" otherwise; over original genes-attributes aA. In this way: 1) We work with desired, larger number of objects improving credibility of the obtained reducts; 2) We produce more decision rules, which vote during classification of new observations; 3) We avoid an issue of discretization of real-valued attributes, difficult and leading to unpredictable results in case of any data sets having much more attributes than objects. We illustrate our method by analysis of the gene expression data related to breast cancer.
Visual Representation in the Wild: How Rhesus Monkeys Parse Objects
Authors: Yuko Munakata, Laurie R. Santos, Elizabeth S. Spelke, Marc D. Hauser, Randall C. O'reilly
Venue: Journal of Cognitive Neuroscience (2001)

Visual object representation was studied in free-ranging rhesus monkeys. To facilitate comparison with humans, and to provide a new tool for neurophysiologists, we used a looking time procedure originally developed for studies of human infants. Monkeys' looking times were measured to displays with one or two distinct objects, separated or together, stationary or moving. Results indicate that rhesus monkeys used featural information to parse the displays into distinct objects, and they found events in which distinct objects moved together more novel or unnatural than events in which distinct objects moved separately. These findings show both commonalities and contrasts with those obtained from human infants. We discuss their implications for the development and neural mechanisms of higher-level vision.
Using XML and BOMS to rapidly compose simulations and simulation environments
Authors: Paul Gustavson, Tram Chase
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper explores the application of Base Object Models (BOMs), an emerging XML standard, for rapidly composing simulations and simulation environments. We examine how pattern components, supported by the Interface (IF) BOM and how behavior components, supported by the Encapsulated (ECAP) BOM, can be used to enable simulation composability at design time and dynamically at run-time. We also explore the potential capabilities BOMs and other XML standards provide for the future of web-based simulation and training.
Auto-Adaptive Questions in E-Learning System
Authors: Enrique Lazcorreta, Federico Botella, Antonio Fernandez-Caballero, Jose M. Gascuena
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

All books entitled "Learn ... with 1000 exercises" have in common the same basic principle. They aim to supply enough material to students so that they may better understand the studied subject, starting from their own practice. If there is no instructor who helps students during the reading of the book, the students will not be able to understand the subject, as the excessive amount of information provided in this kind of books does not enable learners to pursue the learning goals. There is a great boom in e-learning through the socalled Intelligent Tutoring Systems, excellent virtual instructors which guide their learners through the reading of such kinds of books and help their learners to classify all the exercises and recommend them which ones to solve first. Nowadays instructors and teachers are entrusted to produce these books and to classify all exercises, whatever implies an overload to teachers. In this work we introduce a scalable system that only requires teachers to write the questions and their answers. The system will classify and manage all the questions. So the teacher will obtain, with the minimal effort, hundreds of exercises at the end of the course (and for future courses) which will reinforce individually his students.
Research Community Mining with Topic Identification
Authors: Ryutaro Ichise, Hideaki Takeda, Taichi Muraki
Venue: Proceedings of the conference on Information Visualization (2006)

Since research trends can change dynamically, researchers have to keep up with these new trends and undertake new research topics. Therefore, research communities for new research domains are important. In this paper, we propose a method to discover research communities. The key features of our method are a network model of papers and a word assignment technique for the communities obtained. We show our system based on the proposed method and discuss our system through case studies and experiments.
Using Categorial Context-SHOIQ(D) DL to Integrate Context-aware Web Ontology MetaData
Authors: Ruliang Xiao, Shengqun Tang, Ling Li, Lina Fang, Yang Xu, Weiqing Chen, Youwei Xu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

An important issue in semantic web ontology application is how to improve ontological evolvement. In order to solve the context-sensitive environmental problem caused by constantly evolving ontology knowledge base, from the category theory point of view, this paper proposes a context-based formalism- Context- SHOIQ(D) DL which is under the frame of SHOIQ(D) DL, a kind of description logic, then relates its syntax , semantics, and some meta languages about reasoning and knowledge representation, finally discusses a method that implements context-aware web ontology metadata integration with this categorial Context-SHOIQ(D) DL.
A Splitter Theorem for Internally 4-Connected Binary Matroids
Authors: Jim Geelen, Xiangqian Zhou
Venue: SIAM Journal on Discrete Mathematics (2006)

We prove that if N is an internally 4-connected minor of an internally 4-connected binary matroid M with E(N) \geq 4, then there exist matroids M0, M1,... , Mn such that M0 \cong N, Mn = M, and, for each i \in {1,... ,i}, Mi - 1 is a minor of Mi, |E(Mi - 1)| \ge |E(Mi)| - 2, and Mi is 4-connected up to separators of size 5.
Maximum likelihood velocity estimation of multiple seismic wavefronts
Authors: Hui Liu, Fu Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Presents a new approach to simultaneously estimate stacking velocity and zero-offset time of seismic wave propagation, which is specially designed for multiple seismic wavefronts while the traditional semblance approach and the subspace approach are not. Simulations show a good performance of the new approach.
Efficient algorithms for online convex optimization and their applications
Authors: Sanjeev Arora
Venue:  (2006)

In this thesis we study algorithms for online convex optimization and their relation to approximate optimization. In the first part, we propose a new algorithm for a general online optimization framework called online convex optimization. Whereas previous efficient algorithms are mostly gradient-descent based, the new algorithm is inspired by the Newton-Raphson method for convex optimization, and hence called ONLINE NEWTON STEP. We prove that in certain scenarios ONLINE NEWTON STEP guarantees logarithmic regret, as opposed to polynomial bounds achieved by previous algorithms. The analysis is based on new insights concerning the natural "follow-the-leader" method for online optimization, answers some open problems regarding the latter. One application is for the portfolio management problem, for which we describe experimental results over real market data. In the second part of the thesis, we describe a general scheme of utilizing online game playing algorithms to obtain efficient algorithms for offline optimization. Using new and old online convex optimization algorithms we show how to derive the following: (1) Approximation algorithms for convex programming with linear dependence on the approximation guaranty. (2) Fast algorithms for approximate Semidefinite Programming. (3) Efficient algorithms for haplotype frequency estimation.
Incomplete Information Systems Processing Based on Fuzzy-Clustering
Authors: Qinghua Zhang, Guoyin Wang, Jun Hu, Xianquan Liu
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The classical rough set theory developed by Prof. Z.Pawlak can't process incomplete information systems directly. A new method based on fuzzy-clustering is proposed in this paper. The nonequivalence relation defined in incomplete information systems is transformed into an equivalence relation at first, then the variable upper-approximation, variable lower-approximation and variable positive region are developed using the classical rough set theory. Finally, the relations between our method and several other extended rough set models are studied.
Face Recognition Based on Fuzzy Rough Set Reduction
Authors: Lifang Zhou, Weisheng Li, Yu Wu
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

An attribute reduction method based on fuzzy rough set is applied for the result obtained by PCA method and the recognition process use neural network ensemble. The method avoids losing of information caused by dispersing before rough set attribute reduction. The reduction result can reflect the classification ability of the original information system completely. As a result, the recognition accuracy is improved. Meanwhile, computational complexity is reduced for the genetic algorithm.
A Trust-Aware, P2P-Based Overlay for Intrusion Detection
Authors: Claudiu Duma, Martin Karresand, Nahid Shahmehri, Germano Caronni
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Collaborative intrusion detection systems (IDSs) have a great potential for addressing the challenges posed by the increasing aggressiveness of current Internet attacks. However, one of the major concerns with the proposed collaborative IDSs is their vulnerability to the insider threat. Malicious intruders, infiltrating such a system, could poison the collaborative detectors with false alarms, disrupting the intrusion detection functionality and placing at risk the whole system. In this paper, we propose a P2P-based overlay for intrusion detection (Overlay IDS) that addresses the insider threat by means of a trust-aware engine for correlating alerts and an adaptive scheme for managing trust. We have implemented our system using JXTA framework and we have evaluated its effectiveness for preventing the spread of a real Internet worm over an emulated network. The evaluation results show that our Overlay IDS significantly increases the overall survival rate of the network.
CoINS: Context Sensitive Indoor Navigation System
Authors: Fernando Lyardet, Jan Grimmer, Max Muhlhauser
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The Context sensitive Indoor Navigation System (CoINS) implements an architecture to develop context-aware indoor user guidance services and applications. This paper presents a detailed discussion on algorithms and architectural issues in building an indoor guidance system. We first start with the World Model and required mapping to 2D for the process of path calculation and simplification. We also compare several algorithm optimizations applied in this particular context. The system provides the infrastructure to support different techniques of presenting the path and supporting user orientation to reach a certain destination in indoor premises.
An Educational Networking Infrastructure Supporting Ubiquitous Learning for School Students
Authors: Maria Felisa Verdejo, Carlos Celorrio, Emilio Lorenzo, Teresa Sastre
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper proposes a pedagogical and technical approach to support the flow of learning activities outside of school and in class. One primary goal is to develop curricula that bring multimedia resources to outdoor settings to enrich the field experience, and to enable students to make connections between what they learn outside and the formal curriculum. A pilot user scenario and the supporting technology for a set of collaborative learning activities involving tasks of preparation, data gathering, data analyzing, visualization and modeling related to a diversity of content areas are described. The background for the mobile infrastructure, including a learning object repository, has been implemented and tested.
Working Memory and the Suppression of Reflexive Saccades
Authors: Jason P. Mitchell, C. Neil MacRae, Iain D. Gilchrist
Venue: Journal of Cognitive Neuroscience (2002)

Conscious behavioral intentions can frequently fail under conditions of attentional depletion. In attempting to trace the cognitive origin of this effect, we hypothesized that failures of action control&mdash;specifically, oculomotor movement&mdash;can result from the imposition of fronto-executive load. To evaluate this prediction, participants performed an antisaccade task while simultaneously completing a working-memory task that is known to make variable demands on prefrontal processes (n-back task, see Jonides et al., 1997). The results of two experiments are reported. As expected, antisaccade error rates were increased in accordance with the fronto-executive demands of the n-back task (Experiment 1). In addition, the debilitating effects of working-memory load were restricted to the inhibitory component of the antisaccade task (Experiment 2). These findings corroborate the view that working memory operations play a critical role in the suppression of prepotent behavioral responses.