ppxscal/embedding_network huggingface dataset:
Piecewise polynomial approximations for weakly singular integral equations with discontinuous coefficients
Authors: Kristiina Hakk, Arvet Pedas
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

We study the attainable order of a piecewise polynomial collocation method for the numerical solution of linear integral equations with weakly singular or other nonsmooth kernels. In particular, the kernel may have the form K(t,s) = g(t,s)|t-s)|-ν, 0 < ν < 1, where g is proposed to be smooth only on [0,b] × (0,b] \ {d}), 0 < d < b. We show that the proposed method is of maximal possible order if the grid is chosen appropriately.
A system for generating transcription regulatory networks with combinatorial control of transcription
Authors: Sushmita Roy, Margaret Werner-Washburne, Terran Lane
Venue: Bioinformatics (2008)

Summary: We have developed a new software system, REgulatory Network generator with COmbinatorial control (RENCO), for automatic generation of differential equations describing pre-transcriptional combinatorics in artificial regulatory networks. RENCO has the following benefits: (a) it explicitly models protein–protein interactions among transcription factors, (b) it captures combinatorial control of transcription factors on target genes and (c) it produces output in Systems Biology Markup Language (SBML) format, which allows these equations to be directly imported into existing simulators. Explicit modeling of the protein interactions allows RENCO to incorporate greater mechanistic detail of the transcription machinery compared to existing models and can provide a better assessment of algorithms for regulatory network inference. Availability: RENCO is a C++ command line program, available at http://sourceforge.net/projects/renco/ Contact: terran@cs.unm.edu Supplementary information: Supplementary data are available at Bioinformatics online.
Human Ear Recognition by Computer (Advances in Pattern Recognition), 1 edition
Authors: Bir Bhanu, Hui Chen
Venue:  (2008)

Biometrics deals with recognition of individuals based on their physiological or behavioral characteristics. The human ear is a new feature in biometrics that has several merits over the more common face, fingerprint and iris biometrics. Unlike the fingerprint and iris, it can be easily captured from a distance without a fully cooperative subject, although sometimes it may be hidden with hair, scarf and jewellery. Also, unlike a face, the ear is a relatively stable structure that does not change much with the age and facial expressions. Human Ear Recognition by Computer is the first book on the automatic recognition of human ears. It presents an entire range of computational algorithms for recognition of humans by their ears. These algorithms have been tested and validated on the largest databases that are available today. Specific algorithms addressed include: Ear helix/anti-helix based representation Global-to-local registration Ear recognition using helix/anti-helix representation Ear recognition using a new local surface patch representation Efficient ear indexing and recognition Performance prediction for 3D ear recognition Generality and applications in computer vision and pattern recognition This state-of-the-art research reference explores all aspects of 3D ear recognition, including representation, detection, recognition, indexing and performance prediction. It has been written for a professional audience of both researchers and practitioners within industry, and is also ideal as an informative text for graduate students in computer science and engineering. Professor Bir Bhanu has been director of the Visualization and Intelligent Systems Laboratory (at the University of California at Riverside) since 1991 and serves as the founding Director for the Center for Research in Intelligent Systems. He also has considerable experience working within industry and is the successful author of several books. He is a Fellow of IEEE, AAAS, IAPR, SPIE and was a Senior Fellow at Honeywell Inc. Dr. Hui Chen works alongside Professor Bhanu and has worked for Siemens Medical solutions and the Chinese Academy of Sciences.
Adapting a fault prediction model to allow inter languagereuse
Authors: Shinya Watanabe, Haruhiko Kaiya, Kenji Kaijiri
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

An important step in predicting error prone modules in a project is to construct the prediction model by using training data of that project, but the resulting prediction model depends on the training data. Therefore it is difficult to apply the model to other projects. The training data consists of metrics data and bug data, and these data should be prepared for each project. Metrics data can be computed by using metric tools, but it is not so easy to collect bug data. In this paper, we try to reuse the generated prediction model. By using the metrics and bug data which are computed from C++ and Java projects, we have evaluated the possibility of applying the prediction model, which is generated based on one project, to other projects, and have proposed compensation techniques for applying to other projects. We showed the evaluation result based on open source projects.
Teaching students to think nondeterministically
Authors: Michal Armoni, Noa Lewenstein, Mordechai Ben-Ari
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Nondeterminism is a fundamental concept of computer science. However, since it is a very abstract concept, teaching and learning nondeterminism is difficult. In this paper we focus on one aspect of the teaching and learning processes of nondeterminism: the extent to which undergraduate students of computer science perceive that nondeterministic automata exhibit nondeterministic behavior, that is, they are unpredictable and inconsistent. First we show that students tend to think of nondeterministic automata as consistent machines; then we show that an explicit intervention can significantly affect students' mental models of nondeterministic automata in the direction of improving their perception of nondeterministic behavior.
Clip: a tool for mapping hierarchical schemas
Authors: Alessandro Raffio, Daniele Braga, Stefano Ceri, Paolo Papotti, Mauricio A. Hernández
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Many data integration solutions in the market today include visual tools for schema mapping. Users connect schema elements with lines that are interpreted as high-level logical expressions capturing the relationship between source and target data-sets. These expressions are compiled into queries or programs that convert source-side data instances into target-side instances. In this demo we showcase Clip, an XML Schema mapping tool. Clip is distinguished from existing tools in that mappings explicitly specify structural transformations in addition to value correspondences. We show how Clip's users enter mappings by drawing lines and how these lines are translated into XQuery.
Toward Effective Multi-Capacity Resource Allocation in Distributed Real-Time and Embedded Systems
Authors: Nilabja Roy, John S. Kinnebrew, Nishanth Shankaran, Gautam Biswas, Douglas C. Schmidt
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Effective resource management for distributed real-time embedded (DRE) systems is hard due to their unique characteristics, including (1) constraints in multiple resources and (2) highly fluctuating resource availability and input workload. DRE systems can benefit from a middleware framework that enables adaptive resource management algorithms to ensure application QoS requirements are met. This paper identifies key challenges in designing and extending resource allocation algorithms for DRE systems. We present an empirical study of bin-packing algorithms enhanced to meet these challenges. Our analysis identifies input application patterns that help generate appropriate heuristics for using these algorithms effectively in DRE systems.
Towards a general theory of geographic representation in GIS
Authors: Michael F. Goodchild, May Yuan, Thomas J. Cova
Venue: International Journal of Geographical Information Science (2007)

Geographic representation has become more complex through time as researchers have added new concepts, leading to apparently endless proliferation and creating a need for simplification. We show that many of these concepts can be derived from a single foundation that we term the atomic form of geographic information. The familiar concepts of continuous fields and discrete objects can be derived under suitable rules applied to the properties and values of the atomic form. Fields and objects are further integrated through the concept of phase space, and in the form of field objects. A second atomic concept is introduced, termed the geo-dipole, and shown to provide a foundation for object fields, metamaps, and the association classes of object-oriented data modelling. Geographic dynamics are synthesized in a three-dimensional space defined by static or dynamic object shape, the possibility of movement, and the possibility of dynamic internal structure. The atomic form also provides a tentative argument that discrete objects and continuous fields are the only possible bases for geographic representation.
Galois groups and factoring polynomials over finite fields
Authors: L. Ronyai
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Let p be a prime and F be a polynomial with integer coefficients. Suppose that the discriminant of F is not divisible by p, and denote by m the degree of the splitting field of F over Q and by L the maximal size of the coefficients of F. Then, assuming the generalized Riemann hypothesis (GRH), it is shown that the irreducible factors of F modulo p can be found in deterministic time polynomial in deg F, m, log p, and L. As an application, it is shown that it is possible under GRH to solve certain equations of the form nP=R, where R is a given and P is an unknown point of an elliptic curve defined over GF(p) in polynomial time (n is counted in unary). An elliptic analog of results obtained recently about factoring polynomials with the help of smooth multiplicative subgroups of finite field is proved.
The joint determination of efficiency in multi-mode bus transit
Authors: Ming-Miin Yu, Chih-Ku Fan
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In this paper the multiactivity DEA (data envelopment analysis) model is applied to determine the efficiency of individual services within different but highly homogeneous multimode transit firms which engage in their services with non-identical technologies and use shared inputs. The empirical findings indicate that the multiactivity model is more demanding than the conventional DEA model and thereby shows itself to be an especially useful instrument in performing this task.
Facilitating asynchronous discussions in learning communities: the impact of moderation strategies
Authors: Andrea Kienle, Carsten Ritterskamp
Venue: Behaviour & Information Technology (2007)

A facilitator or moderator is often responsible for supporting processes and their progress in learning communities. In this article we present an approach for supporting moderators of asynchronous processes in learning communities. This approach follows the socio-technical perspective: it includes a theory-based development of moderator tasks and the technical features designed to support these tasks. Starting with relevant work in this area, we describe our approach to moderator support in the collaborative learning environment KOLUMBUS 2. In a qualitative study, a professional moderator facilitated the discussion processes of a group of 12 students based on KOLUMBUS 2. The moderator used different methods and varying levels of participation intervention. The study showed that different intervention strategies led to different levels of student participation and different successes in finding common results at the end of the discussions. Suggestions for the design of technical features are also made.
Robust Dictionary Attack of Short Simple Substitution Ciphers
Authors: Edwin Olson
Venue: Cryptologia (2007)

Simple substitution ciphers are a class of puzzles often found in newspapers, in which each plaintext letter is mapped to a fixed ciphertext letter and spaces are preserved. In this article, a system for automatically solving them is described even when the ciphertext is too short for statistical analysis, and when the puzzle contains non-dictionary words. The approach is based around a dictionary attack; several important performance optimizations are described as well as effective techniques for dealing with non-dictionary words. Quantitative performance results for several variations of the approach and two other implementations are presented.
Design of an Autonomic QoE Reasoner for Improving Access Network Performance
Authors: P. Simoens, S. Latré, B. De Vleeschauwer, W. Van de Meerssche, F. De Turck, B. Dhoedt, P. Demeester, S. Van Den Berghe, E. Gilon
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

The access network has become an infrastructure for delivery of multimedia services, such as broadcast TV, voice over IP or video conferencing, to residential users. Compared to more traditional IP services such as e-mail, users demand a higher Quality of Experience (QoE) for these new services. To guarantee the Quality of Service (QoS), access network providers have deployed several service enablers, such as Video on Demand proxies. These techniques are only focused on the part between the service edge router and the access node, while the access network provider has only a limited view and impact on the home network environment. The QoE management in the home network is even more complicated by the wide range of user devices and the various home network configurations, containing wireless interfaces and home multimedia servers. This paper explores the architectural design of an autonomic intelligence component on the access node that determines required QoE enhancing actions, such as adjusting the video bit rate, by taking into account the specifics of the home network and the requested services. The viability of an analytical, fuzzy logic and neural network approach to implement an intelligent, autonomic reasoner is discussed, and experimental results are presented.
Strategic KM, Innovation and Performance
Authors: Carolina López-Nicolás, Ángel Meroño-Cerdán
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Our aim is to shed light on the consequences of KM strategies on firm’s innovation and corporate performance. Organizations are not aware of the real implications that KM may have. Our conclusions, based on an empirical study consisted of 310 Spanish organizations and structural equations modeling with LISREL 8.7, may help academics and managers in designing KM strategic programs in order to achieve higher effectiveness, efficiency and profitability.
Algorithm 877: A Subroutine Package for Cylindrical Functions of Complex Order and Nonnegative Argument
Authors: Masao Kodama
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

The algorithm presented provides a package of subroutines for calculating the cylindrical functions J&nu;(x), N&nu;(x), H&nu;(1)(x), H&nu;(2)(x) where the order &nu; is complex and the real argument x is nonnegative. The algorithm is written in Fortran 95 and calculates the functions using single, double, or quadruple precision according to the value of a parameter defined in the algorithm. The methods of calculating the functions are based on a series expansion, Debye's asymptotic expansions, Olver's asymptotic expansions, and recurrence methods (Miller's algorithms). The relative errors of the functional values computed by this algorithm using double precision are less than 2.4&times;10&thinsp;&minus;&thinsp;13 in the region 0&thinsp;&le;&thinsp;Re &nu;&thinsp;&le;&thinsp;64, 0&thinsp;&le;&thinsp;Im &nu;&thinsp;&le;&thinsp;63, 0.024&thinsp;&le;&thinsp;x&thinsp;&le;&thinsp;97.
A data model and architecture for long-term preservation
Authors: Greg Janée, Justin Mathena, James Frew
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The National Geospatial Digital Archive, one of eight initial projects funded under the Library of Congress's NDIIPP program, has been researching how geospatial data can be preserved on a national scale and be made available to future generations. In this paper we describe an archive architecture that provides a minimal approach to the long-term preservation of digital objects based on co-archiving of object semantics, uniform representation of objects and semantics, explicit storage of all objects and semantics as files, and abstraction of the underlying storage system. This architecture ensures that digital objects can be easily migrated from archive to archive over time and that the objects can, in principle, be made usable again at any point in the future; its primary benefit is that it serves as a fallback strategy against, and as a foundation for, more sophisticated (and costly) preservation strategies. We describe an implementation of this architecture in a protoype archive running at UCSB that also incorporates a suite of ingest and access components.
An Empirical Analysis of Intel Thread Checker for Detecting Races in OpenMP Programs
Authors: Young-Joo Kim, Daeyoung Kim, Yong-Kee Jun
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Races in OpenMP programs must be detected because they may cause unintended nondeterministic results of programs. The Intel Thread Checker can detect the races occurred in an execution of OpenMP program, but it has not been analyzed on the limitation of its power for race detection in OpenMP programs.This paper empirically analyzes the functionality and performance of Thread Checker using a set of multithreaded synthetic programs. We have found that Thread Checker can not verify the existence of races in an execution of OpenMP program, and show that the ratio of the required time for race detection is dependent on the number of total accesses to shared variables in parallel section programs, but not in parallel loop programs.
Unstable ordinary differential equations: solution via genetic algorithms and the method of Nelder-Mead
Authors: Nikos E. Mastorakis
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

In this paper, a new method for solving unstable differential ordinary equations is proposed using a computational scheme of Evolutionary Computing (Genetic Algorithms) and the Nelder-Mead method.
A Three-Way Dance: The Global Public Good and Accessibility in Information Technologies
Authors: Deborah Stienstra, James Watzke, Gary E. Birch
Venue: The Information Society (2007)

When we recognize the development and use of information technologies as an emerging global public good, we can move away from the stark dualisms of profit versus human rights, market share versus accessibility, and competition versus inclusion, to an understanding of how both public and private interests are at play in the development of this global public good. Governments, industry, and disability advocacy organizations are all involved in the construction of this public good in a complex three-way dance. We argue that in the context of this three-way dance it is possible to create a common ground between disability advocacy organizations and the IT industry by developing tools that address the tensions that arise from their differing motivating forces. Specifically, we argue that three sets of tools-regulation, developing ease of use products and standards, and using education to increase the market strength of people with disabilities as consumers-can change the relationships between these two communities of interest in ways that will benefit each.
Anti-DDoS Virtualized Operating System
Authors: Sanjam Garg, Huzur Saran
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

It is easier to detect a DDoS attack near the victim but it is of little use to do so. Many researchers believe that it would be best to handle DDoS attacks closer to the computers which host these attacks and have propounded various strategies for packet ﬁltering at edge-routers. This paper makes three contributions over earlier work. First, we propose that it is best to track illegitimate packets suspected to cause a DDoS at the source computer itself. Secondly, we come up with a secure and efﬁcient implementation (ADVOS: Anti-DDoS Virtualized Operating System) for packet ﬁltering at the source computer itself. Security dependency on the integrity of the source operating system is removed by using virtualization to isolate the modules providing the protection capabilities. Different models of trafﬁc characterization could possibly be used in curtailing malicious trafﬁc, we justify the effectiveness of symmetry based model at source computers. Thirdly, we demonstrate that such an anti-DDoS operating system using virtualization can be implemented practically and efﬁciently. In our prototype over native Linux system 2.4% overhead was observed in the attained network throughput. Less than 1% of the total attack trafﬁc generated was allowed to pass through on attack. Finally, we discuss the scalability and deployment issues for ADVOS.
Pitching motion control of underwater traveling LSM vehicle ME02 using controlled air-cored electromagnet
Authors: K. Yoshida, M. El-Nemr, Y. Yamashita
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

When Marine Express starts to propel, an undesired pitching motion is established. In the attractive mode of operation, the propulsion and levitation forces produce additive torques and pitching motion becomes highly unstable. The current paper introduces enhanced control scheme for pitching motion of the underwater linear motor vehicle ME02 in attractive mode. Two air-cored electromagnets are utilized to produce damping torque. The proposed control technique successfully damped the pitching motion. In addition, the energy requirements of the new control system are much smaller than previous techniques. The simulation results show clearly that the new technique can be applied for real scale Marine Express.
An Ergonomic Study of the Efficiency of the Mobile Shortcuts and Page-Turning Keys in Chinese Users
Authors: Xuemin Zhang, Renlai Zhou, Bin Yang, Wen Shan, Qin Xu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Mobile interface ergonomics efficiency is on the center of the focus of small-screen interface design. This investigation performed a mixed design experiment to examine the effects of different arrangements of shortcuts and page-turning keys on the operation efficiency. The results showed the shortcuts and page-turning keys both had significant effects on user's performance. The interaction between the two also reached significance. Furthermore, the participants' reaction was significantly faster when there were shortcuts and page-turning keys than not. Key Words: Mobile phone, Shortcuts, page-turning