ppxscal/embedding_network huggingface dataset:
Improving performance of text categorization by combining filtering and support vector machines: Research Articles
Authors: Irene Díaz, José Ranilla, Elena Montañes, Javier Fernández, Elías F. Combarro
Venue: Journal of the American Society for Information Science and Technology (2004)

Text Categorization is the process of assigning documents to a set of previously fixed categories. A lot of research is going on with the goal of automating this time-consuming task. Several different algorithms have been applied, and Support Vector Machines (SVM) have shown very good results. In this report, we try to prove that a previous filtering of the words used by SVM in the classification can improve the overall performance. This hypothesis is systematically tested with three different measures of word relevance, on two different corpus (one of them considered in three different splits), and with both local and global vocabularies. The results show that filtering significantly improves the recall of the method, and that also has the effect of significantly improving the overall performance. &copy; 2005 Wiley Periodicals, Inc.
Telemaque, a New Visuo-Haptic Interface for Remediation of Dysgraphic Children
Authors: Bernard Hennion, Edouard Gentaz, Philippe Gouagout, Florence Bara
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The aim of this paper is to present a new Visio-haptic interface for remediation of dysgraphic children. This interface allows teaching the children to reproduce a letter according to a standard not only static (i.e. its correct shape) but also dynamic (i.e. the rules of motor production). A new specific handwriting static and dynamic font was built. Using this font, four exercises were carried out for each letter. First, the sculpturing of a letter was designed to familiarize the child with the haptic pen and the static and the global shape of a letter. Second, the circuit game was focused on the correct order of production of a letter. Third, the dynamical tracing exercise was dedicated to dynamical aspect ofproduction of a letter. Fourth, the blindfolded recognition exercise of letters wasfocused on the static and dynamical aspects of a letter. This exercise required retrieving the letter in memory from dynamical haptic cues. The effects of these exercises on a dysgraphic child were currently assessed.
The restrictive H-coloring problem
Authors: Josep Díaz, Maria Serna, Dimitrios M. Thilikos
Venue: Discrete Applied Mathematics (2005)

We define a variant of the H-coloring problem where the number of preimages of certain vertices is predetermined as part of the problem input. We consider the decision and the counting version of the problem, namely the restrictive H-coloring and the restrictive #H-coloring problems, and we provide a dichotomy theorem determining the H's for which the restrictive H-coloring problem is either NP -complete or polynomial time solvable. Moreover, we prove that the same criterion discriminates the #P -complete and the polynomially solvable cases of the restrictive #H-coloring problem. Finally, we show that both our results apply also for the list versions and other extensions of the problems.
A $1 billion Action Research IT project: building a "new" bank
Authors: Peter Reynolds, Alan Thorogood, Philip Yetton
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

A large retail Bank managed IT as a cost centre for many years, while its competitors invested heavily in Customer Relationship Management (CRM) technology to improve market analytics and customer service. As part of a major transformation, the Bank decides to compete on customer service and rapidly invest in CRM capabilities to support a new customer experience and establish a competitive market position. It chooses a dynamic team from its successful online stockbroking subsidiary to lead the development effort across the Bank. This team brings new capabilities and development approaches to the broader Bank, which represents a change from the traditionally outsourced and dominant Waterfall development approaches. Academics from the Australian Graduate School of Management join the team within an Action Research framework. This paper reports the first cycle in the Action Research Program, identifying the critical importance of a shared framing of the issues.
Pattern expressions and pattern automata
Authors: Cezar Câmpeanu, Sheng Yu
Venue: Information Processing Letters (2004)

We define the pattern expressions as an extension of both regular expressions and patterns. We prove several properties of the new family of languages, similar to those of extended regex languages [Câmpeanu et al., Int. J. Found. Comput. Sci. 14 (6) (2003) 1007-1018]. We also define an automata system that recognizes these languages. Differences between regex and pattern expressions are also discussed.
A Crystal-Based Low-Voltage All-Digital Programmable Ring Oscillator
Authors: S. R. Abdollahi, S. M. Fakhraie, M. Kamarei
Venue: Analog Integrated Circuits and Signal Processing (2005)

We have designed and implemented a flexible programmable multi-channel digitally-controlled oscillator (MDCO) on an Altera MAX9400 Complex Programmable Logic Device (CPLD) chip. Based on elaborate experiments with the system, we have developed techniques by which to improve its linearity, resolution and stability in an improved MDCO design. This new architecture is programmable to oscillate from 0 Hz to a maximum that is determined by the oscillator master processing clock and the technology limitations. As crystal-based-programmable-delay cells (CBPDC) control its dominant propagation delay, the oscillator frequency thermal drift and jitter are reduced.In a complementary parallel development, to design high-speed and low-power sub-systems for high-speed applications, we have designed high-speed DCO and MDCOs by using the parameters of TSMC 0.25 um CMOS process with level 49 HSPICE models. At 3.3 Volts, the oscillation frequency has been increased up to 315 MHz in our ASIC MDCO design by using dynamic high-speed data flip-flops. In terms of specific applications, this architecture is suitable for digital wireless transceivers that use different bands for their transmit and receive modes, such as GSM and DECT. Yet to further enhance the operation of our DCOs, we have developed a new design technique by which to allow these blocks to operate at extremely low supply voltages. We have named this after IBM's work (Assaderaghi et al., IEDM Transactions, vol. 44, 414--422, March 1997) as DTMOS-like design style. Here, we use gate-bulk connected PMOS devices each in a separate Nwell to bring the PMOS-device threshold voltage further lower for operation with one Volt and below supplies. A wide-band 123 MHz, 0.6 mW@ 1 V DCO core is designed and simulated in the same 0.25 um CMOS process.
Nomograms for visualization of naive Bayesian classifier
Authors: Martin Možina, Janez Demšar, Michael Kattan, Blaž Zupan
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Besides good predictive performance, the naive Bayesian classifier can also offer a valuable insight into the structure of the training data and effects of the attributes on the class probabilities. This structure may be effectively revealed through visualization of the classifier. We propose a new way to visualize the naive Bayesian model in the form of a nomogram. The advantages of the proposed method are simplicity of presentation, clear display of the effects of individual attribute values, and visualization of confidence intervals. Nomograms are intuitive and when used for decision support can provide a visual explanation of predicted probabilities. And finally, with a nomogram, a naive Bayesian model can be printed out and used for probability prediction without the use of computer or calculator.
Time-Constrained Service on Air
Authors: Yu-Chi Chung, Chao-Chun Chen, Chiang Lee
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Data broadcasting is an efficient and highly scalable technique for delivering data to mobile clients in wireless environments. In this paper, we study the problem of scheduling broadcast data that are with an expected time within which the client is expecting to receive the data item. We analyze the problem and derive the minimum number of broadcast channels required for such a task. Also, we discuss the problems when the number of available channels is not enough. We propose novel solutions for both of the cases and the performance study indicates that our method is much better than the previous ones and performs very close to optimal.
Hidden-crossing transitions between collective states of coupled quantum rotators as a possible mechanism of memory processing
Authors: D. Dimitrovski, J. Pop-Jordanov, N. Pop-Jordanova, E. A. Solov'ev
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

The possibility that memory is related to the collective rotational energy levels of the molecules is considered. Treating the molecule as a quantum rotator, the probability of the "hidden-crossing" transitions between rotational states, induced by the external periodic electric field, is analyzed. It is found that this probability depends on frequency only, i.e. the external signal causes the information transfer rather than the energy. Using the data of the typical sources of electric signals in brain cells and the criterium of maximization of the information entropy, the relevant number of water molecules (rotators) per cell is estimated. The results appear to be close to the actual number of water molecules per cortical neuron.
A Comparison of Multicast Feedback Control Mechanisms
Authors: Shuju Wu, Sujata Banerjee, Xiaobing Hou
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

In reliable multicast applications, packet loss needs to be reported by having group members send feedback messages. This results in the well-known feedback implosion problem. The available feedback control mechanisms can be classified as timer-based, hierarchy-based and router-assisted, among which the timer-based approach is more preferable due to its simplicity and flexibility. This paper compares the performance of a set of multicast protocols that use either the traditional timer-based feedback control or a combination of the traditional timers and some representatives in the feedback control. We investigate how the use of representatives and deterministic timers improves feedback control performance.
Towards just-in-time middleware architectures
Authors: Charles Zhang, Dapeng Gao, Hans-Arno Jacobsen
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

Middleware becomes increasingly important in building distributed applications. Today, conventional middleware systems are designed, implemented, and packaged prior to their applications. We argue that with this middleware construction paradigm it is often difficult to meet the challenges imposed by application specific customization requirements. We propose to reverse this paradigm by automatically synthesizing middleware structures as the result of reasoning about the distribution needs of the user application of middleware. We term this type of post-postulated middleware Just-in-time middleware (JiM). In this paper, we present our initial design and present an evaluation of the JiM paradigm through Abacus, a CORBA middleware implementation based on the aspect oriented refactoring of an industrial strength object request broker. In addition, we present Arachne, the Abacus synthesizer, which integrates source analysis, feature inference, and implementation synthesis. Our evaluations show that, through automatic synthesis alone, Abacus is able to support diversified application domains with very flexible architectural compositions and versatile resource requirements as compared to conventional pre-postulated approaches.
GridSphere: a portal framework for building collaborations: Research Articles
Authors: Jason Novotny, Michael Russell, Oliver Wehrens
Venue: Concurrency and Computation: Practice Experience (2004)

Grid-enabled portals are becoming increasingly popular as a platform for providing access to Grid services and resources. Unfortunately, much of the work done in portal development has led to vertically layered solutions that work for a particular project but are difficult to extend or reuse for other projects. The GridSphere portal framework seeks to address these limitations by providing a framework that will offer external developers a model for easily adding new functionality and hence increasing community collaboration. The GridLab portal will serve as an initial prototype to showcase the GridSphere framework and provide access to services being developed within the GridLab project. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Video metamorphosis using dense flow fields: Research Articles
Authors: Yizhou Yu, Qing Wu
Venue: Computer Animation and Virtual Worlds (2004)

When we perform video metamorphosis, it would be desirable to make smooth morphing transitions simultaneously along with the original motion in the image sequences. In this paper, we present a novel semi-automatic video morphing technique that exhibits this behavior. Our technique effectively exploits temporal coherence and automatic image matching. One-to-one dense mappings between pairs of corresponding frames are obtained by applying a compositing procedure and a hierarchical image matching technique. These dense mappings can be initialized with sparse frame-to-frame feature correspondences obtained semi-automatically by integrating a friendly user interface with a robust feature tracking algorithm. Experimental results show that our approach to video metamorphosis can produce superior results. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Elimination of Redundant Information for Web Data Mining
Authors: Shakirah Mohd Taib, Soon-Ja Yeom, Byeong-Ho Kang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

These days, billions of Web pages are created with HTML or other markup languages. They only have a few uniform structures and contain various authoring styles compared to traditional text-based documents. However, users usually focus on a particular section of the page that presents the most relevant information to their interest. Therefore, Web documents classification needs to group and filter the pages based on their contents and relevant information. Many researches on Web mining report on mining Web structure and extracting information from web contents. However, they have focused on detecting tables that convey specific data, not the tables that are used as a mechanism for structuring the layout of Web pages. Case modeling of tables can be constructed based on structure abstraction. Furthermore, Ripple Down Rules (RDR) is used to implement knowledge organization and construction, because it supports a simple rule maintenance based on case and local validation.
SUIDT: a user interface builder for secure user interfaces
Authors: Mickaël Baron, Patrick Girard
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

We present in this paper a new computer-aided design for user interfaces tool that leans on several well-defined formalisms. This development tool for end-users is called SUIDT (Safe User Interface Design Tool). It uses visual programming techniques to build every application model and allows building the final application with respect to all models.
Minimizing beam-on time in cancer radiation treatment using multileaf collimators
Venue: Networks (2004)

In this article the modulation of intensity matrices arising in cancer radiation therapy using multileaf collimators &lpar;MLC&rpar; is investigated. It is shown that the problem is equivalent to decomposing a given integer matrix into a positive linear combination of &lpar;0, 1&rpar; matrices. These matrices, called shape matrices, must have the strict consecutive-1-property, together with another property derived from the technological restrictions of the MLC equipment. Various decompositions can be evaluated by their beam-on time &lpar;time during which radiation is applied to the patient&rpar; or the treatment time &lpar;beam-on time plus time for setups&rpar;. We focus on the former, and develop a nonlinear mixed-integer programming formulation of the problem. This formulation can be decomposed to yield a column generation formulation: a linear program with a large number of variables that can be priced by solving a subproblem. We then develop a network model in which paths in the network correspond to feasible shape matrices. As a consequence, we deduce that the column generation subproblem can be solved as a shortest path problem. Furthermore, we are able to develop two alternative models of the problem as side-constrained network flow formulations, and so obtain our main theoretical result that the problem is solvable in polynomial time. Finally, a numerical comparison of our exact solutions with those of well-known heuristic methods shows that the beam-on time can be reduced by a considerable margin. &copy; 2004 Wiley Periodicals, Inc.
Discontinuous Galerkin Method for Linear Free-Surface Gravity Waves
Authors: J. J. W. Vegt, S. K. Tomar
Venue: Journal of Scientific Computing (2005)

In this paper, we discuss a discontinuous Galerkin finite (DG) element method for linear free surface gravity waves. We prove that the algorithm is unconditionally stable and does not require additional smoothing or artificial viscosity terms in the free surface boundary condition to prevent numerical instabilities on a non-uniform mesh. A detailed error analysis of the full time-dependent algorithm is given, showing that the error in the wave height and velocity potential in the L2-norm is in both cases of optimal order and proportional to O(¿t2+hp+1), without the need for a separate velocity reconstruction, with p the polynomial order, h the mesh size and ¿t the time step. The error analysis is confirmed with numerical simulations. In addition, a Fourier analysis of the fully discrete scheme is conducted which shows the dependence of the frequency error and wave dissipation on the time step and mesh size. The algebraic equations for the DG discretization are derived in a way suitable for an unstructured mesh and result in a symmetric positive definite linear system. The algorithm is demonstrated on a number of model problems, including a wave maker, for discretizations with accuracy ranging from second to fourth order.
Variable Programming: A Generalized Minimax Problem. Part II: Algorithms
Authors: Yong-Chang Jiao, Yee Leung, Zongben Xu, Jiang-She Zhang
Venue: Computational Optimization and Applications (2005)

In this part of the two-part series of papers, algorithms for solving some variable programming (VP) problems proposed in Part I are investigated. It is demonstrated that the non-differentiability and the discontinuity of the maximum objective function, as well as the summation objective function in the VP problems constitute difficulty in finding their solutions. Based on the principle of statistical mechanics, we derive smooth functions to approximate these non-smooth objective functions with specific activated feasible sets. By transforming the minimax problem and the corresponding variable programming problems into their smooth versions we can solve the resulting problems by some efficient algorithms for smooth functions. Relevant theoretical underpinnings about the smoothing techniques are established. The algorithms, in which the minimization of the smooth functions is carried out by the standard quasi-Newton method with BFGS formula, are tested on some standard minimax and variable programming problems. The numerical results show that the smoothing techniques yield accurate optimal solutions and that the algorithms proposed are feasible and efficient.
Principles and preferences for computer arithmetic
Authors: Christian H. Reinsch
Venue: ACM SIGNUM Newsletter (1979)

This working paper arose out of discussions on desirable hardware features for numerical calculation in the IFIP Working Group 2.5 on Numerical Software. It reflects the views of all members of the group, although no formal vote of approval has been taken; it is not an official IFIP document. Many people contributed ideas to this paper, especially T. J. Dekker, C. W. Gear, T. E. Hull, J. R. Rice, and J. L. Schonfeldor.
Flexible system for simulating and tele-operating robots through the internet
Authors: F. A. Candelas, S. T. Puente, F. Torres, V. Segarra, J. Navarrete
Venue: Journal of Robotic Systems (2005)

Simulation and teleoperation tools offer many advantages for the training or learning of technological subjects, such as flexibility in time-tables and student access to expensive and limited equipment. In this paper, we present a new system for simulating and tele-operating robot arms through the Internet, which allows many users to simulate and test positioning commands for a robot by means of a virtual environment, as well as execute the validated commands in a real remote robot of the same characteristics. The main feature of the system is its flexibility in managing different robots or including new robot models and equipment. &copy; 2005 Wiley Periodicals, Inc.
Dealing with incomplete knowledge on CLP(FD) variable domains
Authors: Marco Gavanelli, Evelina Lamma, Paola Mello, Michela Milano
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2005)

Constraint Logic Programming languages on Finite Domains, CLP(FD), provide a declarative framework for Artificial Intelligence problems. However, in many real life cases, domains are not known and must be acquired or computed. In systems that interact with the outer world, domain elements synthesize information on the environment, they are not all known at the beginning of the computation, and must be retrieved through an expensive acquisition process.In this article, we extend the CLP(FD) language by combining it with a new sort (called Incrementally specified Sets, I-Set). In the resulting language, CLP(FD &plus; I-Set), FD variables can be defined on partially or fully unknown domains (I-Set). Domains can be linked each other through relations, and constraints can be imposed on them. We describe a propagation algorithm (called Known Arc Consistency (KAC)) based on known domain elements, and theoretically compare it with arc-consistency.The language can be implemented on top of different CLP systems, thus letting the user exploit different possible semantics for domains (e.g., lists, sets or streams). We state the specifications that the employed system should provide, and we show that two different CLP systems (Conjunto and &lcub;log&rcub;) can be effectively used.We provide motivating examples and describe promising applications.