ppxscal/embedding_network huggingface dataset:
Rethinking the cross-cultural interaction architecture
Authors: Karamjit S. Gill
Venue: AI Society (2007)

The paper is an exploration for a conceptual framework for cross-cultural interfacing. The roots of this exploration lie in my personal, functional, social and cultural experiences, and cross-cultural encounters. These encounters in many ways reflect the networking journey of AI & Society, promoting and stimulating the human-centred debate in cross-cultural settings. As a &#x2018;cross-cultural holon&#x2019;, AI & Society has been questioning the given orthodoxy of the &#x2018;one best way&#x2019; and the culture of the &#x2018;exact language&#x2019; since its inception 21&#x00a0;years ago. My observation is that even though we now live in a world of multimodal interactive media technologies, some how the interface design has not moved much beyond the functional (observed reality) worldview of our interactions. Even at the functional level, the design perspective remains bounded by the observed reality. It is thus no surprise that when it comes to designing interaction technologies for social and cultural domains such as health care, work, employment, life long learning, the design mainly hovers around the functional skill training, mechanical feedback and objectified evaluation. When we move beyond the functional worldview, and explore our interactions within social and cultural domains, we encounter both the reality (objectified world) and actuality (experienced world) of interactions. At this level, the challenge of the interface is not just coping with the interaction spaces of reality and actuality but also with the &#x2018;in-between&#x2019; space of actuality&#x2013;reality gaps. We explore how the concept of symbiosis enables the interaction in the gaps between actuality and reality, how the concept of the &#x2018;culture of the artificial enables the sharing and pooling experiences, how the concept of valorisation&#x2019; enables to find a coherence (commonality) between interactions, and how the concept of cultural holon is used to conceptualise the network architecture of cross-cultural interactions. It is proposed that the way forward to designing cross-cultural interfaces is to first seek a conceptual framework for cross-cultural interaction spaces, and then use this framework to design interfacing systems and tools.
A Better Classifier Based on Rough Set and Neural Network for Medical Images
Authors: Jiang Yun, Li Zhanhuai, Wang Yong, Zhang Longbo
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Detecting tumor in mammography is a difficult task because of complexity in the image. This brings the necessity of creating automatic tools to find whether a mammography present tumor or not. In this paper we integrate neural network with reduction of rough set theory which we call the rough neural network (RNN) to classify digital mammography. The experimental results show that the RNN performs better than purely using neural network in terms of time, and it can get 92.37% classifying accuracy which is higher than 81.25% using neural network only.
Towards Semantically-Enhanced Distributed Service Discovery
Authors: Raphael Romeikat, Bernhard Bauer
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

In this paper, we present a new approach for service discovery combining semantic web and peer-to-peer techniques. A reference ontology is used to describe and discover services in our approach. We do not need a central point of control at any time. All information required for service description and discovery is completely distributed across the nodes of a peer-to-peer overlay network. We describe the design of a Semantically-enhanced Distributed Discovery System (SDDS) allowing dynamic and efficient registration and discovery of services. We also present performance analysis and discuss open issues of our system.
On the Penetration of Business Networks by P2P File Sharing
Authors: Kevin Lee, Danny Hughes, James Walkerdine
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

P2P file-sharing poses a number of problems for system administrators including unpredictable network usage, increased vulnerability to security threats and the danger of legal action. Due to these problems, many businesses take measures to restrict the use of P2P software, but how successful have these measures been? This paper analyzes the degree to which business networks have been penetrated by P2P applications and shows that despite the risks, business networks participate significantly in P2P file-sharing systems. Furthermore, we find that participation is greatest amongst small businesses and that viral media has a significant effect on the participation of large businesses.
Threshold password authentication against guessing attacks in Ad hoc networks
Authors: Zhenchuan Chai, Zhenfu Cao, Rongxing Lu
Venue: Ad Hoc Networks (2007)

Password authentication has been accepted as one of the commonly used solutions in network environment to protect resources from unauthorized access. The emerging mobile Ad hoc network, however, has called for new requirements for designing authentication schemes due to its dynamic nature and vulnerable-to-attack structure, which the traditional schemes overlooked, such as availability and strong security against off line guessing attacks in face of node compromise. In this paper, we propose a threshold password authentication scheme, which meets both availability and strong security requirements in the mobile Ad hoc networks. In our scheme, t out of n server nodes can jointly achieve mutual authentication with a registered user within only two rounds of message exchanges. Our scheme allows users to choose and change their memorable password without subjecting to guessing attacks. Moreover, there is no password table in the server nodes end, which is preferable since mobile nodes are usually memory-restricted devices. We also show that our scheme is efficient to be implemented in mobile devices.
Enhancing sequential depth computation with a branch-and-bound algorithm
Authors: Chia-Chih Yen, Jing-Yang Jou
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

We present an effective algorithm to enhance sequential depth computation. The sequential depth plays the most crucial role to the completeness of bounded model checking. Previous work computes the sequential depth by exhaustively searching the state space, which is unable to keep pace with the exponential growth of design complexity. To improve the computation, we develop an efficient approach that takes the branch-and-bound manner. We reduce the search space by applying a partitioning as well as a pruning method. Furthermore, we propose a novel formulation and integrate the techniques of BDDs and SAT solvers to search states that determine the sequential depth. Experimental results show that our approach considerably enhances the performance compared with the results of the previous work.
Some Trends in Web Application Development
Authors: Mehdi Jazayeri
Venue: 2007 Future of Software Engineering (2007)

A Web application is an application that is invoked with a Web browser over the Internet. Ever since 1994 when the Internet became available to the public and especially in 1995 when the World Wide Web put a usable face on the Internet, the Internet has become a platform of choice for a large number of ever-more sophisticated and innovative Web applications. In just one decade, the Web has evolved from being a repository of pages used primarily for accessing static, mostly scientific, information to a powerful platform for application development and deployment. NewWeb technologies, languages, and methodologies make it possible to create dynamic applications that represent a new model of cooperation and collaboration among large numbers of users. Web application development has been quick to adopt software engineering techniques of component orientation and standard components. For example, search, syndication, and tagging have become standard components of a new generation of collaborative applications and processes. Future developments in Web applications will be driven by advances in browser technology, Web internet infrastructure, protocol standards, software engineering methods, and application trends.
A Hybrid User and Item-Based Collaborative Filtering with Smoothing on Sparse Data
Authors: Rong Hu, Yansheng Lu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Collaborative filtering, the most successful recommender system technology to date, helps people make choices based on the opinions of other people. Existing collaborative filtering methods, mainly user-based and item-based methods, predict new ratings by aggregating rating information from either similar users or items. However, a large amount of ratings of similar items or similar users may be unavailable because of the sparse characteristic inherent to the rating data. For this reason, we present a Hybrid Predictive Algorithm with Smoothing (HSPA). HSPA uses item-based methods to provide the basis for data smoothing and builds the predictive model based on both users' aspects and items' aspects in order to ensure robust to data sparsity and predictive accuracy. Moreover, HSPA utilizes the user clusters to achieve high scalability. Experimental results from real datasets show that HSPA effectively contributes to the improvement of prediction on sparse data.
A computational model of dynamic perceptual attention for virtual humans
Authors: Randall Hill
Venue:  (2006)

Modeling interactive virtual humans has been one of the primary goals of immersive virtual environments for training. An important characteristic of a virtual human is the ability to direct its perceptual attention to objects and locations in a virtual environment in a manner that looks believable and serves a functional purpose. Not only must the virtual human pay attention to objects related to the tasks it is performing, but it must also be able to cope with sudden events that demand attention. It is often the case that the amount of information in the virtual environment far exceeds the processing abilities of the virtual human. In fact, only a small fraction of sensory information can be fully processed and assimilated into the cognitive model. A successful model of perceptual attention provides a way of both pruning the incoming sensory input and choosing the most salient information to focus on during the next step of a decision cycle. In this dissertation, we present a computational model of perceptual attention for virtual humans. This model extends a prior model of perceptual resolution [39][40] based on psychological theories of human perception. This model allows virtual humans to dynamically interact with objects and other individuals, balancing the demands of goal-directed behavior with those of attending to novel stimuli.
Subgoal identification and error analysis in problem solving
Authors: K. Morton
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Quantitative problem solving is the major ingredient of core pre-engineering physics courses. The analysis of problem-solving behaviors in these courses can provide an important source of information not only about how students approach problems in general, but how their performance might be enhanced through the development and assessment of instructional innovations. We have focused on the electromagnetics portion of our introductory physics sequence. This course has a failure rate exceeding 30%. Thus, any system for enhancing problem solving in this difficult course will significantly impact many students. A principal barrier to successful problem solving is lack of generalization, i.e. the ability to transfer knowledge and skills from one problem to another and to recognize classes of problems. The common tendency is to treat each problem as a separate entity to be approached by rigid application of memorized formulae, or simply by trial and error. Seemingly small changes in requirements or conditions can be met with bafflement. We have approached problem solving in two interlocked ways. One is the systematic analysis and classification of errors that students make when attempting standard problems in quizzes and exams. The second consists of breaking problems down into a sequence of subgoals. The results show that students often improperly identify both the correct operational equations and the appropriate subgoals required for solution. Our analysis is used to teach students more effective problem-solving strategies with a computerized tutorial.
Nose shape estimation and tracking for model-based coding
Authors: Lijun Yin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Feature extraction on the face plays an important role in applications of model based coding and human face recognition. Traditionally, the eyes and mouth are considered to be the most significant features contributing to different facial expressions. However, detecting and tracking the nose shape is non-trivial, and plays an equally important role as eyes and mouth for model based coding, especially for analysis and synthesis of realistic facial expressions. A feature detection method on the facial organ areas is presented. Individual templates are designed for the nostril and nose-side. First, the feature regions are limited to certain areas by using two-stage region growing methods. Second, the pre-defined templates are applied to extract the shape of the nostril and nose-side. Finally, the extracted feature shapes are exploited to guide a facial model to complete an accurate adaptation. The advantage of the proposed scheme is demonstrated by experiments on real video sequences for low bit rate video coding.
MAMCost: Global and Local Estimates leading to Robust Cost Estimation of Similarity Queries
Authors: Gisele Busichia Baioco, Agma J. M. Traina, Caetano Traina Jr.
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

This paper presents an effective cost model to estimate the number of disk accesses (I/O cost) and the number of distance calculations (CPU cost) to process similarity queries over data indexed by metric access methods. Two types of similarity queries were taken into consideration: range and k-nearest neighbor queries. The main point of the cost model is considering not only global parameters of the data set but also the local data distribution. The model takes advantage of the intrinsic dimension of the data set, estimated by its correlation fractal dimension. Experiments were performed on real and synthetic data sets, with different sizes and dimensions, in order to validate the proposed model. They confirmed that the estimations are accurate, within the range achieved by real queries.
Structure-Based Filtering for Ontology Alignment
Authors: Bi Chen, He Tan, Patrick Lambrix
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Ontologies are an important technology for the Semantic Web and many ontologies have already been developed. Many ontologies also contain overlapping information and to be able to use them together effectively, we need to align them. Some of the current alignment techniques use information about the structure of the ontologies, but they have not produced good results in evaluations. We propose an approach where, in contrast to the other approaches, structural information is used as a filtering method in the alignment process. We evaluate the approach in terms of quality and performance.
A Learning Support System based on Question-posing and Its Evaluation
Authors: Yuuki HIRAI, Atsuo HAZEYAMA
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

This paper proposes a Web-based collaborative learning system, which supports question-posing by learners, assessment from peers, and discussions with question-poser and peers. It also describes evaluation of effectiveness of the system. Based on the results, the system contributed to enhancement of understanding of those who used the system. Although facilities for discussions were not used as much as we expected, we found some functions to be enhanced for discussions support.
SeFS: Unleashing the power of full-text search on file systems
Authors: George Margaritis, Stergios V. Anastasiadis
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Dropping prices in storage space capacity combined with a constant increase in the accumulated amount of digitized content create an unprecedented need for full-text search automation in local and distributed file systems. The current state of the art in what is usually called desktop search is mainly (or seems to be) an adaptation from technology previously developed for the needs of information retrieval and web search applications. Indeed, search facilities for large-scale storage systems have not received the attention that they deserve from system designers. We point out particular deficiencies of existing systems and outline approaches likely to overcome them.
IPv6 Anomaly Traffic Monitoring with IPFIX
Authors: Youngseok Lee, Seongho Shin, Soonbyoung Choi, Hyeon-gu Son
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Though the IPv6 network is believed to be safe against security-violating exploits or attacks that were prevailed in IPv4, it is still expected that brand-new or mutational anomaly traffic will appear as IPv6 networks are being deployed. In this paper, among several anomaly traffic patterns we consider the possible IPv6 attacks that are utilizing ICMPv6, IPv6 extension headers, and IPv6-over-IPv4 tunneling. For IPv6 traffic measurement infrastructure, we employ IP Flow Information eXport (IPFIX) that has been standardized to generate the flow-level traffic measurement information. Thus, we present new IPFIX templates that have been extended to carry IPv6 anomaly traffic related with ICMPv6, IPv6 extension headers, and IPv6-over-IPv4 tunneling. Then, based on the extended IPFIX flow templates, we propose a simple IPv6 flow classification method that could be used for detecting IPv6 DoS attack, IPv6 covert channel exploiting destination option, and IPv6-over-IPv4 tunneling flows. From the experiments with our own IPFIX analyzer and the IPFIX flow-generating probe, we have shown that IPFIX is useful for monitoring normal IPv6 traffic as well as anomaly IPv6 traffic.
DR. GEO II: Adding Interactivity Planes in Interactive Dynamic Geometry
Authors: Hilaire Fernandes, Stephane Ducasse, Thibault Carron
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

Interactive geometry environments support the creation and exploitation of interactive geometric sketches. However, such environments are often driven in a rigid manner, following a well specified construction path. This rigidity is not always compatible with: i. the internal cognitive representation of the learner about the geometric domain and ii. the way a geometric sketch is used in a paper-pen environment. This rigidity is therefore a source of internal tension for the learner and it can reduce the pedagogical added value of the interactive geometry environments. We think additional interactive planes to manipulate a geometric sketch differently can help the learner. We have developed DR. GEO II, an interactive geometry framework that is able to receive additional interactive planes such as a free sketching and a command-based one. We have experimented it in a junior high school class and we report here our first results.
Neural Network Aided Unscented Kalman Filter for Maneuvering Target Tracking in Distributed Acoustic Sensor Networks
Authors: Zhi-Jun Yu, Shao-Long Dong, Jian-Ming Wei, Tao Xing, Hai-Tao Liu
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

A new neural network aided Unscented Kalman filter is presented for tracking maneuvering target in distributed acoustic sensor networks. In practice, the system dynamics of these problems are usually incompletely observed, there may be large modeling errors when the target is maneuverable and some parameters of the system models may be inaccurate. So we propose using an offline trained neural network to correct these errors, the nonlinear inferring process is done by the normal Unscented Kalman filter. This method doesn't need complex modeling for tracking maneuvering target and is very suitable for real-time implementation because the implementation time is only the sum of the Unscented Kalman filter and the neural network recall time.
On Nearly Orthogonal Lattice Bases and Random Lattices
Authors: Ramesh Neelamani, Sanjeeb Dash, Richard G. Baraniuk
Venue: SIAM Journal on Discrete Mathematics (2007)

We study lattice bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is at least $\frac{\pi}{3}$ radians; we denote such bases as &ldquo;nearly orthogonal.&rdquo; We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, we prove that if the basis vector lengths are &ldquo;nearly equal,&rdquo; then the basis is the unique nearly orthogonal lattice basis up to multiplication of basis vectors by $\pm 1$. We also study random lattices generated by the columns of random matrices with $n$ rows and $m \leq n$ columns. We show that if $m \leq c\,n$, with $c \approx 0.071$, then the random matrix forms a nearly orthogonal basis for the random lattice with high probability for large $n$ and almost surely as $n$ tends to infinity. Consequently, the columns of such a random matrix contain the shortest vector in the random lattice. Finally, we discuss an interesting JPEG image compression application where nearly orthogonal lattice bases play an important role.
Embedded System Modeling Based on Resource-Oriented Model
Authors: Jin Hyun Kim, Jin-Young Choi
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

In Model-Based Development(MBD), developers analyze, validate, implement, and test a system with based on the model of system. In the development of embedded system, MBD becomes more popular since the complexity of embedded system has been increasing nowadays. However, the produced software through MBD often diverges from the original model and even results in an erroneous situation because the model of system may not properly reflect the principal aspect of system. In this paper, we provide a hardware model to capture the property and constraint of hardware in embedded systems. In addition, we propose a development framework for embedded systems, in which the model of system is oriented to the model of hardware called resource model.