ppxscal/embedding_network huggingface dataset:
A System Perspective to Establish a Mobile Collaborative Learning Environment (MCLE) - A Preliminary Study of Empirical Practice
Authors: Chiu Pin Lin
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

In the near future, students will utilize many convenient devices connecting to wireless networks to form a mobile learning environment in the classroom. The research outcomes of Nussbaum seem to imply that mobile learning devices can effectively improve conventional collaborative learning, e.g. providing every student equal opportunities for expressing himself as well as gathering essential information to formulate solid conclusions [1]. Although there are many academic investigations related to mobile learning software and infrastructure development, it is rare to find feasible practices and solutions of platforms and methodologies to foster learning activities. The aim of this study is to deploy mobile CSCL scenario by means of integrated Educlasses, TupleSpaces and Group Scribbles, a collection of software designed to facilitate students engaging in face-to-face collaborative learning in class activities. The outcomes after the completion of learning activities showed this one-to-one mobile technology enhanced instructional design indeed arouses students’ motivations and improves students’ mutual interactions.
An asymptotic numerical method for singularly perturbed third-order ordinary differential equations with a weak interior layer
Authors: T. Valanarasu, N. Ramanujam
Venue: International Journal of Computer Mathematics (2007)

A class of singularly perturbed two point boundary value problems (BVPs) of convection-diffusion type for third-order ordinary differential equations (ODEs) with a small positive parameter (ε) multi-plying the highest derivative and a discontinuous source term is considered. The BVP is reduced to a weakly coupled system consisting of one first-order ordinary differential equation with a suitable initial condition and one second-order singularly perturbed ODE subject to boundary conditions. In order to solve this system, a computational method is suggested. In the proposed method we first find a zero-order asymptotic expansion approximation of the solution of the weakly coupled system. Then the system is decoupled by replacing the first component of the solution by its zero-order asymptotic expansion approximation in the second equation. Then the second equation is solved by a finite difference method on a Shishkin mesh (a fitted mesh method). Examples are provided to illustrate the method.
Natural Language Watermarking for Korean Using Adverbial Displacement
Authors: Mi-Young Kim
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

This paper explores the method for Korean text watermarking and develops a syntactic tree-based adverbial displacement scheme. Korean, as an agglutinative language, provides a good ground for the syntactic tree-based natural language watermarking because syntactic constituent order is relatively free –especially syntactic adverbial. Our proposed natural language watermarking method consists of six procedures. First, we construct a syntactic dependency tree of unmarked text. Next, we perform clausal segmentation from the syntactic tree. Third, we choose a target adverbial constituent, which will be displaced within its clause. Then, we embed a watermark bit. Fifth, if the watermark bit does not coincide with the direction of the target adverbial displacement, we displace the target adverbial constituent in the syntactic tree. Finally, from the modified syntactic tree, we obtain a marked text. From the experimental results, we show that the coverage of our method outperforms that of previous systems, and the rate of unnatural sentences of marked text is better than that of previous systems. Experimental results also show that the marked text keeps the same style, and it also has the same information without semantic distortion.
Design and Implementation of a Parameterized NoC Router and its Application to Build PRDT-Based NoCs
Authors: Shankar Neelkrishnan, Mei Yang, Yingtao Jiang, Lei Zhang, Yulu Yang, Enyue Lu, Xiaochun Yun
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper presents a parameterized router design which can be applied to build large network-on-chips (NoCs) based on a Perfect Recursive Diagonal Torus (PRDT) or mesh/torus topology. In specific, the router is designed to support two routing algorithms (conventional vector routing and a newly proposed Johnson coded vector routing) and wormhole switching. Along these lines, special considerations for the router design are given to different design options concerning scheduling, buffering strategy, and flowcontrol. Correspondingly, the router is partitioned into four components (input channel module, output channel module, crossbar switch, and scheduler) organized to form a three-stage pipeline, and their Verilog models are designed and implemented in a modular fashion with key parameters specified upon instantiations. A 4x4 PRDT-based NoC incorporating multiple copies of the proposed router design is synthesized using TSMC 0.18μm CMOS technology.
Automatic document prior feature selection for web retrieval
Authors: Jie Peng, Craig Macdonald, Iadh Ounis
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Document prior features, such as Pagerank and URL depth, can improve the retrieval effectiveness of Web Information Retrieval (IR) systems. However, not all queries equally benefit from the application of a document prior feature. This paper aims to investigate whether the retrieval performance can be further enhanced by selecting the best document prior feature on a per-query basis. We present a novel method for selecting the best document prior feature on a per-query basis. We evaluate our technique on the TREC .GOV Web test collection and its associated TREC 2003 Web search tasks. Our experiments demonstrate the effectiveness and robustness of our proposed selection method.
Monad compositions ii: Kleisli strength
Authors: Ernie Manes, Philip Mulry
Venue: Mathematical Structures in Computer Science (2008)

In this paper we introduce the concept of Kleisli strength for monads in an arbitrary symmetric monoidal category. This generalises the notion of commutative monad and gives us new examples, even in the cartesian-closed category of sets. We exploit the presence of Kleisli strength to derive methods for generating distributive laws. We also introduce linear equations to extend the results to certain quotient monads. Mechanisms are described for finding strengths that produce a large collection of new distributive laws, and consequently monad compositions, including the composition of monadic data types such as lists, trees, exceptions and state.
Discriminant factor anaysis for movement recognition: application to dance
Authors: Sullivan Hidot, Jean-Yves Lafaye, Christophe Saint-Jean
Venue: Machine Graphics Vision International Journal (2006)

In this paper, we present an example of operator discriminant factor analysis applied to the study of movement. Our goal is to contribute to the automatic recognition of typical movements and give analytic elements to discuss the differences between the various types. As a signature for the movements, we select the 'Relational Covariance Operator' and explain our motivation. Discriminant analysis cannot be directly applied to covariance operators; so, in order to deal with a well conditioned problem and avoid useless heavy computation, we proceed in two steps. We first achieve a variant of principal components analysis on covariance operators by using convenient metrics, and then apply plain linear discriminant analysis on the resulting axis. Such a method allows a simple and powerful interpretation of the movement typology. We also present an experiment on motion-captured movements performed by dancers from the 'Ballet Atlantique Régine Chopinot'.
Finite element formulation of a new nonlocal damage model
Authors: M. K. Samal, M. Seidenfuss, E. Roos, B. K. Dutta, H. S. Kushwaha
Venue: Finite Elements in Analysis and Design (2008)

It is now widely recognized in literature that the results of the local damage model are mesh dependent. Regularization methods which use gradients of equivalent plastic strain in the material yield function are also popularly known as gradient plasticity models. Many times, these nonlocal forms of equivalent plastic strain have been used as a measure of material damage in the integral and gradient enhanced formulations. Regularization methods based on nonlocal forms of ductile void volume fraction are limited in literature, especially for the Rousselier's model. Moreover, the mesh independent nature of the nonlocal solutions are usually demonstrated with the help of 1D bar, shear band and notched tensile specimens, etc. Comparisons of the nonlocal solutions with those of experiment are hardly done, especially, for problems involving prediction of the fracture resistance behaviour of cracked specimens. In this work, the Rousselier's damage model has been extended to a nonlocal form using the nonlocal damage parameter 'd' as an additional degree of freedom of the finite element (FE) model. The FE equations have been derived using the weak forms of the governing equations for both mechanical stress equilibrium and the damage equilibrium. The mesh independent nature of the model has been demonstrated through various examples, such as an axisymmetric tensile specimen and a standard fracture mechanics specimen (for which predicted results have been compared with those of experiment) using different mesh sizes. The ability of the new model to predict the effect of crack tip constraint on the fracture resistance behaviour has been demonstrated by analysing two different types of standard fracture mechanics specimens.
Automatic extraction of notions from course material
Authors: Michela Pedroni, Manuel Oriol, Bertrand Meyer, Lukas Angerer
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Formally defining the knowledge units taught in a course helps instructors ensure a sound coverage of topics and provides an objective basis for comparing the content of two courses. The main issue is to list and define the course concepts, down to basic knowledge units. Ontology learning techniques can help partially automate the process by extracting information from existing materials such as slides and textbooks. The TrucStudio course planning tool, discussed in this article, provides such support and relies on Text2Onto to extract concepts from course material. We conducted experiments on two different programming courses to assess the quality of the results.
An Efficient Technique for Distance Computation in Road Networks
Authors: Xu Jianqiu, Victor Almeida, Qin Xiaolin
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road networks such as nearest neighbor querying and the analysis of moving objects trajectories come into sight which present challenges to the database community. The essential part of the queries behind these services is related to the distance computation in road networks. In this paper, we focus on this problem and propose a method for distance computation in road networks including the access of network connectivity information. We present an algorithm called circle which returns all moving objects within a given distance (radius) to a given network position during some time intervals in the past. We choose an existed index structure, the MON-Tree, to record the framework presented in this paper which is to store and query network connectivity information. The circle operator is used to experimentally evaluate our approach. The results show that the performance of the technique presented in this paper outperforms the only existing index structure in the literature capable to support this kind of query.
Rules of Thumb for Developing Secure Software: Analyzing and Consolidating Two Proposed Sets of Rules
Authors: Holger Peine
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper presents guidelines to develop secure applications in the form of "Do’s and Don’ts" applying mostly to the software design level, but also to the implementation level. It builds on two collections of similar rules published in two seminal books in the area of secure software development, criticizes and improves those earlier rules and extends them by several new ones. The paper does not cover how to apply such rules in general. The main direction of improvement is making the rules more constructive, less ambiguous, and removing aspects not related to security.
On solvability for higher order parabolic equations
Authors: Martín López Morales
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

We consider the Cauchy problem for higher order linear parabolic equations in a layer. We establish new a priori estimates for the solution to this problem in general anisotropic Hölder norm, under the assumption that the coefficients and the independent term satisfy the general anisotropic Hölder condition of exponent α(l) with respect to the space variables only. In this connection, however, we also obtain an estimate for the modulus of continuity with respect to the time of the higher derivatives with respect to space variables of the corresponding solutions. On the basis of our new a priori estimates for the solution to the Cauchy problem for higher order linear parabolic equations, we establish the corresponding solvability theorem for this problem in general Hölder anisotropic spaces. We establish the local solvability of the Cauchy problem for higher order nonlinear parabolic equations with the aid of the results of the corresponding linear theory.
On Collaborative Scheduling of Distributable Real-Time Threads in Dynamic, Networked Embedded Systems
Authors: Sherif Fadel Fahmy, Binoy Ravindran, E. D. Jensen
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Some emerging networked embedded real-time applications have relatively long reaction time magnitudes—e.g., milliseconds to minutes. These longer execution time magnitudes allow opportunities for more computationally expensive scheduling algorithms than what is traditionally considered for device-level real-time control sub-systems. In this paper, we review recent research conducted on collaborative scheduling algorithms in such systems that are subject to dynamic behavior such as transient and sustained resource overloads, arbitrary activity arrivals, and arbitrary node failures and message loss. We show that collaborative scheduling algorithms have an advantage over non-collaborative scheduling algorithms.
Set constraints with projections are in NEXPTIME
Authors: W. Charatonik
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. In this paper we prove that the problem of existence of a solution of a system of set constraints with projections is in NEXPTIME, and thus that it is NEXPTIME-complete. This extends the result of A. Aiken, D. Kozen, and E.L. Wimmers (1993) and R. Gilleron, S. Tison, and M. Tommasi (1990) on decidability of negated set constraints and solves a problem that was open for several years.
Organizational learning: effects of (network) structure and (individual) strategy
Authors: Simon Rodan
Venue: Computational Mathematical Organization Theory (2008)

Earlier theoretical accounts of collective learning relied on rules and operating procedures as the organizational memory (March in Organ. Sci. 2(1):71---87, 1991; Rodan in Scand. J. Manag. 21:407---428, 2005). This paper builds on this tradition drawing on ideas from social network theory. Learning is modeled as a social-psychological process (Darr and Kurtzberg in Organ. Behav. Hum. Decis. Process. 82(1):28---44, 2000; Rulke et al. in Organ. Behav. Hum. Decis. Process. 82(1):134---149, 2000), in which organizations learn by exchanging information internally between their members (Argote et al. in Organ. Behav. Hum. Decis. Process. 82(1):1---8, 2000; Carley in Am. Soc. Rev. 56(3):331---354, 1991; Carley in Soc. Perspect. 48(4):547---571, 1995). Learning is also characterized as stochastic and creative (Gruenfeld et al. in Organ. Behav. Hum. Decis. Process. 82(1):45---59, 2000). This model is used to explore predictions about the effect social networks have on idea generation and learning and alternative strategies for choosing from whom to seek information.
Ensemble Classification for Cancer Data
Authors: Yang Liu, Jin Zhou, Yuehui Chen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Now the classification of different tumor types is of great importance in cancer diagnosis and drug discovery. It is more desirable to create an optimal ensemble for data analysis that deals with few samples and large features. In this paper, a new ensemble method for cancer data classification is proposed. The gene expression data is firstly preprocessed for normalization. Correlation analysis method is then applied to generate different feature subsets. Secondly, an intelligent approach is brought forward, which uses Support Vector Machine (SVM) as the base classifier and applied with Binary Particle Swarm Optimization (BPSO) for constructing ensemble classifiers. The leukemia and colon datasets are used for conducting all the experiments. Results show that the proposed method produces a good recognition rate comparing with some other advanced artificial techniques.
Problem-Solving Methods for Understanding Process Executions
Authors: Jose Manuel Gómez-Pérez, Oscar Corcho
Venue: Computing in Science and Engineering (2008)

Provenance information can be seen as a pyramid with four main levels: data, organization, process, and knowledge. The first three levels focus on how data is transformed across a process's execution, the roles of the actors involved, and which tasks it comprises. However, the increasing complexity of the distributed, data-intensive applications that produce ever-larger amounts of provenance information require more advanced analytical capabilities with a higher level of abstraction. In this regard, the authors approach knowledge provenance as being focused on providing users with meaningful interpretations of process executions, explaining provenance in a way closer to how domain experts reason on a given problem, and facilitating their comprehension. Their approach is based on problem-solving methods (PSM), which are used in application development as generic and reusable strategies to model, establish, and control the sequence of actions required to accomplish tasks in different application domains. In this article, the authors describe how they use PSMs for a different purpose: to exploit their analytical power as high-level, domain-independent, knowledge templates and support user-focused interpretation of the execution of past processes.
Usefulness of a Regional Health Care Information System in primary care
Authors: Marianne C. Maass, Paula Asikainen, Tiina Mäenpää, Olli Wanne, Tarja Suominen
Venue: Computer Methods and Programs in Biomedicine (2008)

The goal of this paper is to describe some benefits and possible cost consequences of computer based access to specialised health care information. A before-after activity analysis regarding 20 diabetic patients' clinical appointments was performed in a Health Centre in Satakunta region in Finland. Cost data, an interview, time-and-motion studies, and flow charts based on modelling were applied. Access to up-to-date diagnostic information reduced redundant clinical re-appointments, repeated tests, and mail orders for missing data. Timely access to diagnostic information brought about several benefits regarding workflow, patient care, and disease management. These benefits resulted in theoretical net cost savings. The study results indicated that Regional Information Systems may be useful tools to support performance and improve efficiency. However, further studies are required in order to verify how the monetary savings would impact the performance of Health Care Units.
SenseWorld: Towards Cyber-Physical Social Networks
Authors: Raghu K. Ganti, Yu-En Tsai, Tarek F. Abdelzaher
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Web-based social networks such as LinkedIn, FaceBook and MySpace have gained wide popularity in recent years. With the advent of ubiquitous sensing, future social networks will be cyber-physical, combining measured elements of the physical world with manual human input. Microsoft SensorMap is an early example of a cyber-physical network in that it allows users to browse the physical world. In contrast to social networks, however, the main abstractions exported by SensorMap are those of physical objects (such as sensors), not people. This work extends the concept of SensorMap to incorporate social entities such as individuals and special-interest communities to which they belong. In the extended network, called SenseWorld, SensorMap offers a geographical index into a cyber-physical social network with its own logical topology derived from social connections.