ppxscal/embedding_network huggingface dataset:
DC-Tree: An Algorithm for Skyline Query on Data Streams
Authors: Jing Yang, Bo Qu, Cui-Ping Li, Hong Chen
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Skyline query asks for a set of interesting points that are non-dominated by any other points from a potentially large set of data points and has become research hotspot in database field. Users usually respect fast and incremental output of the skyline objects in reality. Now many algorithms about skyline query have been developed, but they focus on static dataset, not on dynamic dataset. For instance, data stream is a kind of the dynamic datasets. Stream data are usually in large amounts and high speed; moreover, the data arrive unlimitedly and consecutively. Also, the data are variable thus they are difficult to predict. Therefore, it is a grim challenge for us to process skyline query on stream data. Real-time control and strong control management are required to capture the characteristic of data stream, because they must settle data updating rapidly. To this challenge, this paper proposes a new algorithm: DC-Tree. It can do skyline query on the sliding window over the data stream efficiently. The experiment results show that the algorithm is both efficient and effective.
Wasp Algorithm for Dynamic Scheduling Based on Manufacturing Grid
Authors: Bao Zhen-qiang, Li Xiang-Qing, Zhang Dan, Wang Peng, Gao Kai-zhou
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

To resolve dynamic job scheduling problem efficiently in manufacturing grid, a manufacturing grid system based on two-layer structure is proposed. This paper applies the theory of wasp colony’s interaction with environment to dynamic job shop scheduling and constructs a wasp-based scheduling decision mechanism. This paper also analyzes urgent events and rescheduling methods to deal with them respectively. At the end, the scheduling algorithm is developed and an instance is given to confirm the above mechanism.
Analysis of Dynamic Congestion Control of SCTP
Authors: Doo-Won Seo, Hyuncheol Kim, Jeom Goo Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

SCTP (Stream Control Transmission Protocol) is a general-purpose transport protocol for IP network data communications. This paper examines methods of guaranteeing multi-streaming management and fairness among streams within SCTP associations. We investigated an important aspect of fairness adjustment between streams of SCTP, the underlying congestion control mechanism. In this paper, we propose that separated congestion control with a fairness compensation module is more efficient than the standard SCTP. Proposed SCTP-SCF overcomes existing problems in the traditional SCTP when a multi-streaming feature is used.
A framework to support the evaluation, adoption and improvement of agile methods in practice
Authors: A. Qumer, B. Henderson-Sellers
Venue: Journal of Systems and Software (2008)

Agile methods are often seen as providing ways to avoid overheads typically perceived as being imposed by traditional software development environments. However, few organizations are psychologically or technically able to take on an agile approach rapidly and effectively. Here, we describe a number of approaches to assist in such a transition. The Agile Software Solution Framework (ASSF) provides an overall context for the exploration of agile methods, knowledge and governance and contains an Agile Toolkit for quantifying part of the agile process. These link to the business aspects of software development so that the business value and agile process are well aligned. Finally, we describe how these theories are applied in practice with two industry case studies using the Agile Adoption and Improvement Model (AAIM).
Design Disciplines and Non-specific Transfer
Authors: David Ginat
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

Computer science educators expect their students to develop a scientific design discipline with programs and proofs. Established acquisition of a scientific discipline encapsulates rich cognitive representation, which is reflected by competent non-specific transfer. Do computer science graduates demonstrate non-specific transfer of fundamental design notions? The study presented here reveals some undesired findings. Computer science graduates, who are engaged in teaching, showed rather limited competence with task representation and the heuristic of decomposition and (re-)composition, as well as with progression through ordered design stages. Many followed a rather unordered and unconvincing solution plan, which yielded only partial outcomes, and no conviction of exploitation. We describe our findings and offer suggestions for explicitly elaborating (sometime implicit) design notions.
A security thread in a thread-based curriculum
Authors: Andy Ju An Wang
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

The Threads model for computing curriculum represents a natural evolution of contextualized computing education. As information security is one of the pervasive themes in IT curriculum, it is reasonable to design a security thread in a Thread-based curriculum. As computing security becomes more important in all sectors of society, so does the preparation of our students with knowledge and understanding of critical security concepts, methodologies, and techniques. Unfortunately, despite the deep and pervasive impact of security, undergraduate IT curricula and programs today often lack a cohesive model to deliver information assurance education to a wider audience, offering security courses beyond the limitation of a track, concentration, or a security minor. We want to infuse information security into our IT curriculum, and we found a good model for doing that. This paper introduces the Threads model for computing curricula originated from Georgia Tech's College of Computing, an innovative way to restructuring computing curriculum. We believe that a security Thread should be developed for any undergraduate IT program. We discuss the rationales, design, and implementation for an information security thread in IT programs as well as the challenges we have faced in designing such a thread.
Self-management of Lambda-Connections in Optical Networks
Authors: Tiago Fioreze, Aiko Pras
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

This paper presents a new idea for the management of lambda-connections in optical networks. The idea consists of making multi-service optical switches responsible for automatically detecting IP flows at the packet-level, creating lambda-connections for them, and moving them to the optical-level. In addition to that, they are also in charge of tearing down the connections when no longer needed. This new idea is the result of 1 year of research work at the University of Twente (UT) and it is aimed at resulting in a Ph.D. thesis by the end of 4 years of Ph.D. research.
Generation of Personalised Advisory Messages: An Ontology Based Approach
Authors: Elisabetta Erriquez, Floriana Grasso
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

This paper presents an ontology based approach to the production of personalised motivational messages to the user of a e-Health service. The service is aimed at encouraging diabetic patients to do physical activity. The textual messages have an overall predetermined structure, and need to be personalised to the user's characteristics, and to the context in which the message needs to be generated.
An Active Learning Method Based on Most Possible Misclassification Sampling Using Committee
Authors: Jun Long, Jianping Yin, En Zhu
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

By selecting and asking the user to label only the most informative instances, active learners can significantly reduce the number of labeled training instances to learn a classification function. We focus here on how to select the most informative instances for labeling. In this paper we make three contributions. First, in contrast to the leading sampling strategy of halving the volume of version space, we present the sampling strategy of reducing the volume of version space by more than half with the assumption of target function being chosen from nonuniform distribution over version space. Second, via Halving model, we propose the idea of sampling the instances that would be most possibly misclassified. Third, we present a sampling method named CBMPMS (Committee Based Most Possible Misclassification Sampling) which samples the instances that have the largest probability to be misclassified by the current classifier. Comparing the proposed CBMPMS method with the existing active learning methods, when the classifiers achieve the same accuracy, the former method will sample fewer times than the latter ones. The experiments show that the proposed method outperforms the traditional sampling methods on most selected datasets.
Approximate Dynamic Programming for Ship Course Control
Authors: Xuerui Bai, Jianqiang Yi, Dongbin Zhao
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Dynamic programming (DP) is a useful tool for solving many control problems, but for its complexity in computation, traditional DP control algorithms are not satisfactory in fact. So we must look for a new method which not only has the advantages of DP but also is easier in computation. In this paper, approximate dynamic programming (ADP) based controller system has been used to solve a ship heading angle keeping problem. The ADP controller comprises successive adaptations of two neural networks, namely action network and critic network which approximates the Bellman equations associated with DP. The Simulation results show that the ship keeps the desired heading satisfactorily.
An Improved Conference-Key Agreement Protocol with Forward Secrecy
Authors: Yuh-Min Tseng
Venue: Informatica (2005)

Recently, Tzeng proposed a provably secure and fault-tolerant conference-key agreement protocol. It requires only a constant number of rounds to establish a conference key among all honest participants. This article will show that Tzeng's protocol does not offer forward secrecy. We say that a conference-key agreement protocol offers forward secrecy if the long-term secret key of any participant is compromised and will not result in the compromise of the previously established conference keys. This property is important and has been included in most key agreement protocols and standards. In this paper, an improvement based on Tzeng's protocol is proposed and it achieves forward secrecy. Under the Diffie-Hellman decision problem assumption and the random oracle model, we show that the proposed protocol can withstand passive attacks and is secure against impersonator's attacks. The improved protocol requires a constant number of rounds to compute a conference key. The improved protocol provides fault-tolerance.
Optimized on Demand Routing Protocol of Mobile Ad Hoc Network
Authors: Chinnappan Jayakumar, Chenniappan Chellappan
Venue: Informatica (2006)

In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by caching the routes in adjacent list type of data structures. It selects the shortest hop and least congested path, which in turn reduce the control packets, route request packets, route reply packets and increase the data packets forwarded by the nodes. To solve the DSR route maintenance problem during high mobility, source transparent route maintenance method is introduced in this paper. This method has two schemes namely cache validation and local route repair. These schemes reduce the packet loss, end-to-end delay and increase the throughput.
Real-Time IP Checking and Packet Marking for Preventing ND-DoS Attack Employing Fake Source IP in IPv6 LAN
Authors: Gaeil An, Kiyoung Kim
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

IPv6 has been proposed as a basic Internet protocol for realizing a ubiquitous computing service. An IPv6 LAN may suffer from a Neighbor Discovery-Denial of Service (ND-DoS) attack, which results in network congestion on the victim IPv6 LAN by making a great number of Neighbor Discovery protocol messages generated. A ND-DoS attacker may use a fake source IP address to hide his/her identity, which makes it more difficult to handle the attack. In this paper, we propose an IP checking and packet marking scheme, which is applied to an IPv6 access router. The proposed scheme can effectively protect IPv6 LAN from ND-DoS attack employing fake source IP by providing the packets suspected to use fake source and/or destination IP addresses with a poor QoS.
Metrics for Security and Performance in Low-Latency Anonymity Systems
Authors: Steven J. Murdoch, Robert N. Watson
Venue: Proceedings of the 8th international symposium on Privacy Enhancing Technologies (2008)

In this paper we explore the tradeoffs between security and performance in anonymity networks such as Tor. Using probability of path compromise as a measure of security, we explore the behaviour of various path selection algorithms with a Tor path simulator. We demonstrate that assumptions about the relative expense of IP addresses and cheapness of bandwidth break down if attackers are allowed to purchase access to botnets, giving plentiful IP addresses, but each with relatively poor symmetric bandwidth. We further propose that the expected latency of data sent through a network is a useful performance metric, show how it may be calculated, and demonstrate the counter-intuitive result that Tor's current path selection scheme, designed for performance, both performs well and is good for anonymity in the presence of a botnet-based adversary.
Double-Crossing: A New Interaction Technique for Hand Gesture Interfaces
Authors: Takashi Nakamura, Shin Takahashi, Jiro Tanaka
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

We propose double-crossing, a technique for interacting with large displays using hand gestures. This technique extends crossing, which was developed for a pen-based interface, and enables the ease of use by incorporating easy hand gestures such as finger movements.
Scalable parallel programming with CUDA
Authors: John Nickolls, Ian Buck, Michael Garland, Kevin Skadron
Venue: ACM SIGGRAPH 2008 classes (2008)

Is CUDA the parallel programming model that application developers have been waiting for?
Markov Set-Chains as Abstractions of Stochastic Hybrid Systems
Authors: Alessandro Abate, Alessandro D'Innocenzo, Maria D. Benedetto, Shankar S. Sastry
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

The objective of this study is to introduce an abstraction procedure that applies to a general class of dynamical systems, that is to discrete-time stochastic hybrid systems (dt-SHS). The procedure abstracts the original dt-SHS into a Markov set-chain (MSC) in two steps. First, a Markov chain (MC) is obtained by partitioning the hybrid state space, according to a controllable parameter, into non-overlapping domains and computing transition probabilities for these domains according to the dynamics of the dt-SHS. Second, explicit error bounds for the abstraction that depend on the above parameter are derived, and are associated to the computed transition probabilities of the MC, thus obtaining a MSC. We show that one can arbitrarily increase the accuracy of the abstraction by tuning the controllable parameter, albeit at an increase of the cardinality of the MSC. Resorting to a number of results from the MSC literature allows the analysis of the dynamics of the original dt-SHS. In the present work, the asymptotic behavior of the dt-SHS dynamics is assessed within the abstracted framework.
A New Feature Matching Algorithm for Image Registration Based on Feature Similarity
Authors: Jin-jian Lv, Gong-jian Wen, Ji-yang Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Feature matching is a difficult and key problem of the feature-based image registration methods. A new algorithm based on feature similarity is proposed in this paper to deal with the correspondence of features. It mainly consists of three steps: first, a candidate matched feature pairs set is obtained using feature similarity which is computed by the invariant descriptors of features extracted from the reference and sensed images; second, the minimum number optimal matched feature pairs, which can be used to estimate the parameters of geometric transformation model between the two images, are acquired from the candidate set via an exhaustive search strategy; third, all the matched features are estimated according to the nearest neighbour rule. The characteristic of the algorithm is that it combines the methods using the criterion of the minimum distance classification, row and column matching likelihood coefficients algorithms and can overcome their shortcomings. Experiment results are very encouraging and prove that the proposed method is comparatively robust and effective.
A Multi-supplier and Return-Policy Newsboy Model with Limited Budget and Minimum Service Level by Using GA
Authors: P. C. Yang, H. M. Wee, S. L. Chung, S. H. Kang
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

A style dress outlet usually purchases products from multiple suppliers with differing cost, quality and selling price. It is assumed that some suppliers will sell their goods to the buyer outright, while some other suppliers will offer return policy for items unsold. In the latter case, the supplier buys back from the buyer the unsold items at the end of the selling season. The purpose of this study is to enable the buyer to develop a supplier selection and replenishment policy subject to limited budget. A minimal service level and uncertain market are assumed as well. Genetic algorithm (GA) is used to solve the problem.
Strongly Absolute Stability Problem of Descriptor Systems
Authors: Chunyu Yang, Qingling Zhang, Linna Zhou
Venue: Informatica (2007)

This paper considers Lur'e type descriptor systems (LDS). The concept of strongly absolute stability is defined for LDS and such a notion is a generalization of absolute stability for Lur'e type standard state-space systems (LSS). A reduced-order LSS is obtained by a standard coordinate transformation and it is shown that the strongly absolute stability of the LDS is equivalent to the absolute stability of the reduced-order LSS. By a generalized Lyapunov function, we derive an LMIs based strongly absolute stability criterion. Furthermore, we present the frequency-domain interpretation of the criterion, which shows that the criterion is a generalization of the classical circle criterion. Finally, numerical examples are given to illustrate the effectiveness of the obtained results.
A New BSS Method of Single-Channel Mixture Signal Based on ISBF and Wavelet
Authors: Xiefeng Cheng, Yewei Tao, Yufeng Guo, Xuejun Zhang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

A new BSS method based on independent sub-band function components (ISBF) and wavelet to separate single-channel mixture signal in noise was studied. Through obtaining sub-band functions with independent component characteristic in the time domain, 6-20 sub-band function by ICA were employed as the preparation knowledge for the blind source separation (BSS). By combining the independent sub-band function components (ISBF) into the single-channel mixture signal, a separation modeling of single-channel mixture signal was built based on ISBF. And the separation mathematics model of the single-channel signal in noise is investigated. The wavelet transform was used to eliminate the noise as well. Two simulation samples performed to verify the availability of the proposed methods. The results show that the methods played good role in one sensor source BSS, and had a capability to extract the sound signal feature.
Gait Recognition by Applying Multiple Projections and Kernel PCA
Authors: Murat Ekinci, Murat Aykut, Eyup Gedikli
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Recognizing people by gait has a unique advantage over other biometrics: it has potential for use at a distance when other biometrics might be at too low a resolution, or might be obscured. In this paper, an improved method for gait recognition is proposed. The proposed work introduces a nonlinear machine learning method, kernel Principal Component Analysis (KPCA), to extract gait features from silhouettes for individual recognition. Binarized silhouette of a motion object is first represented by four 1-D signals which are the basic image features called the distance vectors. The distance vectors are differences between the bounding box and silhouette, and extracted using four projections to silhouette. Classic linear feature extraction approaches, such as PCA, LDA, and FLDA, only take the 2-order statistics among gait patterns into account, and are not sensitive to higher order statistics of data. Therefore, KPCA is used to extract higher order relations among gait patterns for future recognition. Fast Fourier Transform (FFT) is employed as a preprocessing step to achieve translation invariant on the gait patterns accumulated from silhouette sequences which are extracted from the subjects walk in different speed and/or different time. The experiments are carried out on the CMU and the USF gait databases and presented based on the different training gait cycles. Finally, the performance of the proposed algorithm is comparatively illustrated to take into consideration the published gait recognition approaches.
Consensual Definition of Languages by Regular Sets
Authors: Stefano Crespi Reghizzi, Pierluigi San Pietro
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

A new language definition model is introduced and investigated, based on agreement or consensus between similar strings. Considering a regular set of strings over a bipartite alphabet made by pairs of unmarked/marked symbols, a match relation is introduced, in order to specify when such strings agree. Then a regular set over the bipartite alphabet can be interpreted as defining another language over the unmarked alphabet, called the consensual language. A string is in the consensual languages if a set of corresponding matching strings is in the original language. The family defined by this approach includes the regular languages and also interesting non-semilinear languages. The word problem can be solved in polynomial time, using a multi-counter machine. Closure properties of consensual languages are proved for intersection with regular sets and inverse alphabetical homomorphism.
Cellular neural networks in 3D laser data segmentation
Authors: Michal Gnatowski, Barbara Siemiatkowska, Rafał Chojecki
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

In this paper, we consider the problem of 3D maps building based on the laser 3D. The map of the environment is represented as a 2D array. Each cell represents rectangular region of the scene and consists of a list of objects. The main advantages of the system are real-time map building, low memory consumption and accuracy. We show that the system works properly in real indoor environment but it can be extended in order to built the map of unstructured environment.