ppxscal/embedding_network huggingface dataset:
On competition between modes of the onset of Marangoni convection with free-slip bottom under magnetic field
Authors: Norihan Md. Arifin, Haliza Rosali
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

In this paper we use a numerical technique to analyze the onset of Marangoni convection in a horizontal layer of electrically-conducting fluid heated from below and cooled from above in the presence of a uniform vertical magnetic field. The top surface of a fluid is deformably free and the bottom boundary are rigid and free-slip. The critical values of the Marangoni numbers for the onset of Marangoni convection are calculated and the latter is found to be critically dependent on the Hartmann, Crispation and Bond numbers. In particular we present an example of a situation in which there is competition between modes at the onset of convection.
Performance of a MANET directional MAC protocol with angle-of-arrival estimation
Authors: Kun Liu, Walaa Hamouda, Amr Youssef
Venue: Wireless Communications Mobile Computing (2008)

The use of directional antennas in mobile ad hoc networks (MANETs) has shown to offer large throughput gains relative to omnidirectional antennas. When used in ad hoc networks, directional medium-access-control (DMAC) protocols usually require all nodes, or part of nodes, to be aware of their exact locations. This location information is typically provided using a global positioning system (GPS). Although GPS systems are designed to be as nearly accurate as possible, there are still estimation errors that can cause a relatively large deviation from the actual GPS receiver position. In this paper, we investigate the effect of inaccurate node position estimation on the throughput of these protocols. Our results clearly indicate that the advantages of DMAC protocols diminish if the available position information is not accurate enough. As an alternative, we propose an efficient DMAC protocol that utilizes signal parameter estimation via the rotational invariance technique (ESPRIT) for direction-of-arrival (DOA) estimation; alleviating the need for GPS and, hence, avoiding the degrading associated with typical GPS position estimation errors. Moreover, unlike GPS-based protocols, our protocol is suitable for both outdoor and indoor applications. Under different operating conditions and channel models, our simulation results show the throughput improvement achieved using the proposed protocol relative to the IEEE 802.11. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Modelling feature interactions in the automotive domain
Authors: Alma L. Juarez-Dominguez, Nancy A. Day, Jeffrey J. Joyce
Venue: Proceedings of the 2008 international workshop on Models in software engineering (2008)

We propose to use model checking to detect feature interactions in a set of features under design for an automotive embedded system. In this paper, we present (1) the characteristics of the feature interaction problem in the automotive domain that make model checking an appropriate detection technique; (2) our proposal for a general, systematic definition of feature interactions for this domain based on the set of actuators in the vehicle influenced by the features; and (3) our solutions to two modelling issues that arise when creating a description in SMV of the behaviour of an integrated set of automotive features designed in MATLAB's STATEFLOW.
Multi-player VR game built upon wireless sensor network
Authors: HyunHo Jee, Doo-seop Eom, Taeyoung Kim, HunKi Park, Hyoil Lee, JungHyun Han
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

This paper presents a multi-player VR game platform, which uses a motion-tracking system with wireless sensor network (WSN). We use transmitters/receivers of ultrasound and RF signals, and acceleration sensors. Multiple users play the VR game with physical devices in the real world, and the poses of the corresponding virtual devices of the game world are computed and reflected based on the information such as positions, orientations, and velocities of the physical devices. The implementation shows a new type of natural interface for the next-generation VR games which can be well integrated with WSN.
Graph kernels between point clouds
Authors: Francis R. Bach
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and practical constraints associated with point clouds in computer vision and graphics. In this paper, we present extensions of graph kernels for point clouds, which allow one to use kernel methods for such objects as shapes, line drawings, or any three-dimensional point clouds. In order to design rich and numerically efficient kernels with as few free parameters as possible, we use kernels between covariance matrices and their factorizations on probabilistic graphical models. We derive polynomial time dynamic programming recursions and present applications to recognition of handwritten digits and Chinese characters from few training examples.
k-Independence and the k-residue of a graph
Authors: Frank Jelen
Venue: Journal of Graph Theory (1999)

Favaron, Mah&eacute;o, and Sacl&eacute; proved that the residue of a simple graph G is a lower bound on its independence number &epsilon; (G). For k &epsilon; ℕ;, a vertex set X in a graph is called k-independent, if the subgraph induced by X has maximum degree less than k. We prove that a generalization of the residue, the k-residue of a graph, yields a lower bound on the k-independence number. The new bound strengthens a bound of Caro and Tuza and improves all known bounds for some graphs. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 32: 241249, 1999
The IS Organization of the Future: Four Scenarios for 2020
Authors: Paul Gray, Anat Zeelim Hovav
Venue: Information Systems Management (2007)

Four scenarios for the IS organization of 2020 are described, based on differing assumptions about two drivers: the advances in the reliability of international telecommunications and the value placed on computerization in businesses and society.
Redundancy-controllable adaptive retransmission timeout estimation for packet video
Authors: Ali C. Begen, Yucel Altunbasak
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Time-constrained error recovery is an integral component of reliable low-delay video applications. Regardless of the error-control method adopted by the application, unacknowledged or missing packets must be quickly identified as lost or delayed, so that necessary timely actions can be taken by the server/client. Historically, this problem has been referred to as the retransmission timeout (RTO) estimation. Earlier studies show that existing RTO estimators suffer from either long loss detection times or a large number of pre-mature timeouts. The goal of this study is to address these problems by developing an adaptive RTO estimator for high-bitrate low-delay video applications. By exploiting the temporal dependence between consecutive delay samples, we propose an adaptive linear delay predictor. This way, our RTO estimator configures itself based on the video characteristics and varying network conditions. Our approach also features a controller that optimally manages the trade-off between the amount of overwaiting and redundant retransmission rate. The skeleton implementation shows that the proposed RTO estimator discriminates lost packets from excessively-delayed packets faster and more accurately than its rivals, which consequently enables the applications to recover more packets under stringent delay requirements.
Relation between canonical and optimized state models of PWL dynamical system belonging to class C
Authors: Jiří Pospíšil, Zdeněk Kolka, Stanislav Hanus, Václav Pospíšil
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Previously published two piecewise-linear (PWL) dynamical systems belonging to Class C with canonical and low eigenvalue sensitivity state models are compared. Their mutual relation is expressed analytically by similarity transformation conditions using the linear topological conjugacy and then illustrated graphically using the "elastic space" analogy.
Realization of a development platform for Web-based product customization systems
Authors: Xiaodong Zhang, Yu Yang, Sheng Liu, Fei Liu
Venue: International Journal of Computer Integrated Manufacturing (2007)

Web-based product customization systems have been proven effective in satisfying customers' individual requirements and in bringing innovative and profitable products to market quickly. In order to develop Web-based product customization systems efficiently, a development platform is studied and outlined in this paper. First, the function of the platform is analysed, and the function model of the platform is presented. Next, a structural framework will be presented, describing the structure and the working mechanisms of the platform. Additionally, in order to improve the adaptability of the platform, two key technologies are illustrated in detail: definition technology of multiple customization approaches and component-based technology for application modules of the platform. Some practical customization systems have been developed using the platform, and a case study demonstrating the development process of a furniture customization system is presented at the end of the paper.
Statistical analysis on students' performance on st2063 statistical programming package for semester 2 2006/2007 session
Authors: Suriani Hassan, Fauziah Sulaiman, Khadizah Ghazali, Siti Rahayu Mohd Hashim, Zainodin Haji Jubok
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

ST2063 Statistical Programming Package is a core subject for most students in School of Science and Technology, Universiti Malaysia Sabah. This study discussed the students' performance on ST2063 Statistical Programming Package for Semester 2 2006/2007 Session on gender, programme, students' status and year of study. The data consisted of ST2063 Statistical Programming Package results of 269 students in Semester 2 2006/2007 Session. This study utilized Independent-Samples t-Tests and Analysis of Variance for the analysis methods. From this study, it was statistically significant that female students performed better than male students on ST2063 Statistical Programming Package total marks for Semester 2 2006/07 Session. There were significant mean differences for ST2063 Statistical Programming Package total marks between first and third year students, between first and second year students and between second and third year students. Biotechnology students performed better than Plant Technology students, Conservation Biology students, Physics with Electronics students, Marine Science students and Environmental Science students on ST2063 Statistical Programming Package total marks for Semester 2 2006/07 Session. There was no significant mean difference between the status of the students on students' performance on ST2063 Statistical Programming Package.
On the complexity of omega -automata
Authors: S. Safra
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

Automata on infinite words were introduced by J.R. Buchi (1962) in order to give a decision procedure for S1S, the monadic second-order theory of one successor. D.E. Muller (1963) suggested deterministic omega -automata as a means of describing the behavior of nonstabilising circuits. R. McNaughton (1966) proved that classes of languages accepted by nondeterministic Buchi automata and by deterministic Muller automata are the same. His construction and its proof are quite complicated, and the blow-up of the construction is double exponential. The author presents a determinisation construction that is simpler and yields a single exponent upper bound for the general case. This construction is essentially optimal. It can also be used to obtain an improved complementation construction for Buchi automata that is also optimal. Both constructions can be used to improve the complexity of decision procedures that use automata-theoretic techniques.
Power gating scheduling for power/ground noise reduction
Authors: Hailin Jiang, Malgorzata Marek-Sadowska
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Power gating is a technique for efficiently reducing leakage power by disconnecting idle blocks from the power grid. When gated blocks are woken up, large amounts of switching currents are drawn in a short period of time that may introduce severe noise on the power delivery mesh. In this paper, we propose a GA-based approach to schedule power gating considering power/ground noise. We introduce a simulation-based method to accurately and efficiently estimate the worst case noise, taking all the current sources, inductance and decaps' effects into consideration. We also present an incremental scheduling procedure considering the dynamic changes of decap configuration. Experimental results show that by optimally scheduling the wake-up order under time constraints, our technique can reduce noise up to 50% compared to waking gated blocks simultaneously. The quality of results depends upon the total wake-up time constraint, locations of gated blocks, current densities of gated blocks, and decap distribution.
Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques
Authors: Marti Sanchez, Simon Givry, Thomas Schiex
Venue: Constraints (2008)

With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested in errors that violate Mendelian laws. The problem of deciding if a Mendelian error exists in a pedigree is NP-complete (Aceto et al., J Comp Sci Technol 19(1):42---59, 2004). Existing tools dedicated to this problem may offer different level of services: detect simple inconsistencies using local reasoning, prove inconsistency, detect the source of error, propose an optimal correction for the error. All assume that there is at most one error. In this paper we show that the problem of error detection, of determining the minimum number of errors needed to explain the data (with a possible error detection) and error correction can all be modeled using soft constraint networks. Therefore, these problems provide attractive benchmarks for weighted constraint network (WCN) solvers. Because of their sheer size, these problems drove us into the development of a new WCN solver toulbar2 which solves very large pedigree problems with thousands of animals, including many loops and several errors.
A Real -Time Interactive Visualization System for DNS Amplification Attack Challenges
Authors: Huiming Yu, Xiangfeng Dai, Tomas Baxley, Jinsheng Xu
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Domain Name Service (DNS) Amplification Attack has become a serious issue for network security because small queries can generate massive amounts of UDP packets in response to flood the target server. This paper presents our work to develop a Real-Time Interactive Visualization System (RTIVS) for DNS Amplification Attack to help administrators visualize and analyze traffic, and detect the DNS Amplification Attack. The design of the RTIVS is based on the characteristics of the DNS Amplification Attack. It provides two modes that are a manual mode and an automatic mode to support reasoning and identify DNS Amplification Attacks. A graphic user interface is implemented to allow administrators to easily monitor network activity and analyze the large amount of UDP packets in real time. The interactive GUI also supports combination of the administrator’s knowledge, experience and judgment into the system.
L'informatique omnipr&eacute;sente pour les communaut&eacute;s de pratique autour de contenus p&eacute;dagogiques
Authors: Amel Bouzeghoub, Pierre-André Caron, Claire Lecocq, Xavier Le Pallec, José Rouillard
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

We present in this paper the interest of ubiquitous computing for the so called contextualized forums. These forums allow communities of practice exchanging and sharing experiences or situations already lived by using learning documents to classify these exchanges. These forums contain a lot of information which contribute to improve classical training. We study here ubiquitous computing possibilities to use this type of forums in order to improve professional training to business process by helping the user to put into practice his/her acquisition. The developed application is being tested and works principally on smartphones.
Media theory: Representations and examples
Authors: Sergei Ovchinnikov
Venue: Discrete Applied Mathematics (2008)

In this paper we develop a representational approach to media theory. We construct representations of media by well-graded families of sets and partial cubes and establish the uniqueness of these representations. Two particular examples of media are also described in detail.
Abductive Reasoning for Keyword Recovering in Semantic-Based Keyword Extraction
Authors: Rachada Kongkachandra, Kosin Chamnongthai
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper proposes semantic based keyphrase recovery for domain-independent keyphrase extraction. In this method, we add a keyphrase recovery function as a postprocess of the conventional keyphrase extractors in order to reconsider the failed keyphrases by semantic matching based on sentence meaning. We also add the Domain Identification Function to determine the related domain of the keyphrases by using keyphrases extracted from the conventional systems in order to make the system as domain-independent. The semantic matching is performed to compare the similar meanings between ones of failed keyphrases and ones in the knowledge base. Therefore, the failed keyphrases that are matched by semantic matching are recused as keyphrases. The experiments with the summary sentences in 60 articles of IEICE Transactions on Information and Systems and glossaries from four resources are performed in initializing Domain Knowledge Base. Other summary sentences in 100 articles of IEICE Transactions on Information and Systems and in 15 chapters in a Computer Information System textbook are experimented in recovering the failed keyphrases. The results reveal that the proposed method increases the average performance of conventional EXTRACTOR and KEA approximately by 33.16 and 41.30% of precision, and 36.10 and 39.17% of recall, respectively.
Target tracking by proportion of distance in wireless sensor networks
Authors: Qianyu Ye, Yu Liu, Lin Zhang, Chan-hyun Youn
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Nowadays, wireless sensor networks (WSNs) become a hot researching area applying from military detection to public surveillance. Among these applications, target tracking is one of the most important research aspects. In many circumstances, it is difficult to obtain the distance from the observation nodes to the surveillant target. As a result, using distance as a factor to determine the target location is not always feasible. In this paper, we propose a target tracking algorithm based on the sensing information which is in proportion to or in inverse proportion to the exponent of distance. The proportions of sensing information on different sensors are used to draw the loci of the target. The target location can be approximated by these loci. The simulation results show that the proposed method performs much better when network density raises and has few burst errors when the variance of noise increased. The nonlinear optimization process utilized by this paper descends quickly for target locating with less number of sensor nodes involved.
Fast and feasible periodic sorting networks of constant depth
Authors: M. Kutylowski, K. Lorys
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

A periodic comparator network has depth (or period) k, if for every t>k, the compare-exchange operations performed at step t are executed between exactly the same registers as at step t-k. We introduce a general method that converts an arbitrary comparator network that sorts n items in time T(n) and that has layout area A into a periodic sorting network of depth 5 that sorts /spl Theta/(n/spl middot/T(n)) items in time O(T(n)/spl middot/log n) and has layout area O(A/spl middot/T(n)). This scheme applied to the AKS network yields a depth 5 periodic comparator network that sorts in time O(log/sup 2/ n). More practical networks with runtime O(log/sup 3/ n) can be obtained from Batcher's networks. Developing the techniques for the main result, we improve some previous results: Let us fix a d/spl isin/N. Then we can construct a network of depth 3 based on a d-dimensional mesh sorting n items in time O(n/sup 1/d//spl middot/log/sup O(d/) n).
The impact of synchronous inter-networked teacher training in Information and Communication Technology integration
Authors: Stewart Martin, Michael Vallance
Venue: Computers Education (2008)

This paper summarises the outcomes of research that recorded and interpreted change in pre-service teachers' pedagogical beliefs when immersed in unique synchronous networked collaboration. The pre-service teachers were involved in the design and implementation of synchronous networked tasks, supported by the theoretical and pragmatic application of 'informed' Information and Communications Technology (ICT) integration. The pre-service teachers' use of digital technology graduated from a didactic, broadcast delivery of information to more constructivist strategies that involved interaction, collaboration and 'good' learning. Moreover, the pre-service teachers gained competencies during a 12-week programme that led to the development of a suggested framework for ICT task development able to effectively promote and support improvements in learning.
Knows what it knows: a framework for self-aware learning
Authors: Lihong Li, Michael L. Littman, Thomas J. Walsh
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We introduce a learning framework that combines elements of the well-known PAC and mistake-bound models. The KWIK (knows what it knows) framework was designed particularly for its utility in learning settings where active exploration can impact the training examples the learner is exposed to, as is true in reinforcement-learning and active-learning problems. We catalog several KWIK-learnable classes and open problems.
Spectral Angle Based Kernels for the Classification of Hyperspectral Images Using Support Vector Machines
Authors: M. N. M. Sap, M. Kohram
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Support vector machines (SVM) have been extensively used for classification purposes in a broad range of applications. These learning machines base their classification on the Euclidean distance of the data vectors or their dot products. These measures do not account for the spectral signature information that can be achieved from remote sensing images. Given the high value of this information, integrating it into the SVM algorithm is a reasonable suggestion. This paper utilizes the spectral angle (SA) function as a measure for classification of a hyperspectral image. The SA function is joined together with the radial basis function (RBF) to form a spectral angle based RBF function. Experimentation results are promising and confirm that this approach can compete with existing classification methods.