ppxscal/embedding_network huggingface dataset:
A Framework and Process for Curricular Integration and Innovation Using Project Based Interdisciplinary Teams
Authors: Frank P. Coyle, Mitchell A. Thornton
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper describes a framework and process for ongoing curricular integration and innovation based on feedback from the performance of undergraduate interdisciplinary teams working on problems that reflect the needs of industry. The five-step process is based on a top-down, objectives-based approach to bringing the computer science and engineering curriculum in line with computing practice. Critical to the effort is the selection of projects for undergraduate teams since project definitions serve both as an opportunity to challenge students and to lay the foundation for departmental direction. Each project is associated with a set of capability requirements that reflect what team members should both know and be able to do to meet project requirements. Upon project completion, expectations and actual performance are used in a curricular feedback loop to identify possible curricular modifications. We report on an ongoing implementation of this framework at Southern Methodist University (SMU) where integration between computer science and computer engineering serves as a testbed for the framework. At SMU, undergraduate students from computer science and computer engineering are teamed to develop applications that serve to bring core curricula in line with current trends in computing and industry needs.
The generalized associative law in smooth groups
Authors: Mustafa Demirci
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

In this paper, assuming a multiplicative symbol for smooth groups, successive products in smooth groups are introduced as a counterpart to the products of a finite number of elements in classical group theory, and then a generalized associative law in smooth groups is formulated by means of successive products. Various elementary properties of successive products are established, and some applications of the generalized associative law in smooth groups are given.
Performance study of multiple route dynamic source routing protocols for mobile ad hoc networks
Authors: Jie Li, Yi Pan, Yang Xiao
Venue: Journal of Parallel and Distributed Computing (2005)

Design and analysis of routing protocols are the key issues for a mobile ad hoc network (MANET). The Dynamic Source Routing (DSR) protocol is one of the important on-demand routing protocols. In this paper, we develop a comprehensive analytic model for the performance study of the DSR protocol with multiple routes. Two performance metrics, called probability of a successful data transmission and probability that the multiple routes can support the next data transmission, are introduced. We derive both of the two probabilities for the general case over n multiple routes for the DSR protocol. These analytic results provide insights into the mechanics of the multiple DSR routing protocol. It is also useful for the design and implementation of the on-demand routing for MANET.
Investigating heterogeneous combination of functional units for a criticality-based low-power processor architecture
Authors: Akihiro Chiyonobu, Toshinori Sato
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

In recent years, advanced applications that require high processing performance are executed on portable and mobile devices. Those devices require high-performance and low-power processors. To satisfy this requirement, we propose to exploit information regarding instruction criticality. In order to reduce energy consumption with maintaining high performance, each functional units in our processor has different latency and energy consumption. This paper describes the best combination of functional units for the criticality-based low-power processor. The evaluated results show two fast and four slow combination is the best, when the total number of its functional units is six.
Matching TCP Packets and Its Application to the Detection of Long Connection Chains on the Internet
Authors: Jianhua Yang, Shou-Hsuan Stephen Huang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Network attackers usually launch their attacks behind a long connection chain. One way to stop such attacks is to prevent the attackers from using computers as "stepping-stones" for their attacks. A "Step-Function" method has been proposed to detect the length of a connection chain from a host to the victim machine. The algorithm is based on the changes in packet round trip times. Due to many network protocol issues, it is impossible to match all such packets correctly. We propose two algorithms to match TCP packet in real-time. The first algorithm matched fewer packets but the matching is correct. The second one matches more packets with some uncertainty on the correctness. The two algorithms gave us almost identical results in determining the length of a connection chain. The algorithm give us a way to stop stepping-stone intrusion on the Internet in real-time.
Benchmarking of a 3D, Unstructured, Finite Volume Code of Incompressible Navier-Stokes Equation on a Cluster of Distributed-Memory Computers
Authors: S. A. Mohsen Karimian, Anthony G. Straatman
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The parallelization and performance of an implicit, unstructured, time-dependent Computational Fluid Dynamics (CFD) code is described. Parallelization of the code is done within the PETSc framework using a single-program-multiple-data (SPMD) message passing model. The parallel code is shown to scale linearly within the limit of the available number of processors. A dynamic convergence criteria (DCC) is developed to enhance the performance of the code by linking the non-linear convergence of the code and the solver convergence. The implementation of an appropirate choice of DCC in the code was shown a good improvements with the speedups of over four times in terms of wall-clock time.
Striping and scheduling for large scale multimedia servers
Authors: Kyung-Oh Lee, Jun-Ho Park, Yoon-Young Park
Venue: Journal of Computer Science and Technology (2004)

When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. Several problems in the designing of large-scale multimedia servers are addressed, with the following contributions: (1) a striping scheme is proposed that minimizes the number of seeks and hence maximizes the performance; (2) a simple and efficient mechanism is presented to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system; and (3) the characteristics and resource requirements of several scheduling schemes are investigated in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes. It is believed that the results are of value in the design of effective large-scale multimedia servers.
Modeling the author bias between two on-line computer science citation databases
Authors: Vaclav Petricek, Ingemar J. Cox, Hui Han, Isaac G. Councill, C. Lee Giles
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We examine the difference and similarities between two on-line computer science citation databases DBLP and CiteSeer. The database entries in DBLP are inserted manually while the CiteSeer entries are obtained autonomously. We show that the CiteSeer database contains considerably fewer single author papers. This bias can be modeled by an exponential process with intuitive explanation. The model permits us to predict that the DBLP database covers approximately 30% of the entire literature of Computer Science.
The Adomian decomposition method in turning point problems
Authors: Waleed Al-Hayani, Luis Casasús
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, the decomposition method is applied to boundary-value problems of ordinary differential equations with a parameter exhibiting turning points.
Three-dimensional map building for mobile robot navigation environments using a self-organizing neural network
Authors: Min Young Kim, Hyungsuck Cho
Venue: Journal of Robotic Systems (2004)

In recent years, mobile robots have been required to become more and more autonomous in such a way that they are able to sense and recognize the three-dimensional space in which they live or work. In this paper, we deal with such an environment map building problem from three-dimensional sensing data for mobile robot navigation. In particular, the problem to be dealt with is how to extract and model obstacles which are not represented on the map but exist in the real environment, so that the map can be newly updated using the modeled obstacle information. To achieve this, we propose a three-dimensional map building method, which is based on a self-organizing neural network technique called &ldquo;growing neural gas network.&rdquo; Using the obstacle data acquired from the 3D data acquisition process of an active laser range finder, learning of the neural network is performed to generate a graphical structure that reflects the topology of the input space. For evaluation of the proposed method, a series of simulations and experiments are performed to build 3D maps of some given environments surrounding the robot. The usefulness and robustness of the proposed method are investigated and discussed in detail. &copy; 2004 Wiley Periodicals, Inc.
Event-based operational semantics and a consistency result for real-time concurrent processes with action refinement
Authors: Xiu-Li Sun, Wen-Yin Zhang, Jin-Zhao Wu
Venue: Journal of Computer Science and Technology (2004)

In this paper an event-based operational interleaving semantics is proposed for real-time processes, for which action refinement and a denotational true concurrency semantics are developed and defined in terms of timed event structures. The authors characterize the timed event traces that are generated by the operational semantics in a denotational way, and show that this operational semantics is consistent with the denotational semantics in the sense that they generate the same set of timed event traces, thereby eliminating the gap between the true concurrency and interleaving semantics.
Completely iterative algebras and completely iterative monads
Authors: Stefan Milius
Venue: Information and Computation (2005)

Completely iterative theories of Calvin Elgot formalize (potentially infinite) computations as solutions of recursive equations. One of the main results of Elgot and his coauthors is that infinite trees form a free completely iterative theory. Their algebraic proof of this result is extremely complicated. We present completely iterative algebras as a new approach to the description of free completely iterative theories. Examples of completely iterative algebras include algebras on complete metric spaces. It is shown that a functor admits an initial completely iterative algebra iff it has a final coalgebra. The monad given by free completely iterative algebras is proved to be the free completely iterative monad on the given endofunctor. This simplifies substantially all previous descriptions of these monads. Moreover, the new approach is much more general than the classical one of Elgot et al. A necessary and sufficient condition for the existence of a free completely iterative monad is proved.
An Image Retrieval System Using Multispectral Random Field Models, Color, and Geometric Features
Authors: Orlando J. Hernandez, Alireza Khotanzad
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

This paper describes a novel color texture-based image retrieval system for the query of an image database to find similar images to a target image. The retrieval process involves segmenting the image into regions of uniform color texture using an unsupervised histogram clustering approach that utilizes the combination of Multispectral Simultaneous Auto Regressive (MSAR) and color features. The color texture content, location, area and shape of the segmented regions are used to develop similarity measures describing the closeness of a query image to database images. These attributes are derived from the maximum fitting square and best fillting ellipse to each of the segmented regions. The proposed similarity measure combines all these attributes to rank the closeness of the images. The performance of the system is tested on two databases containing synthetic mosaics of natural textures and natural scenes, respectively.
Higher entropy conservation and numerical stability of compressible turbulence simulations
Authors: Albert E. Honein, Parviz Moin
Venue: Journal of Computational Physics (2004)

We present a numerical formulation for the treatment of nonlinear instabilities in shock-free compressible turbulence simulations. The formulation is high order and contains no artificial dissipation. Numerical stability is enhanced through semi-discrete satisfaction of global conservation properties stemming from the second law of thermodynamics and the entropy equation. The numerical implementation is achieved using a conservative skew-symmetric splitting of the nonlinear terms. The robustness of the method is demonstrated by performing unresolved numerical simulations and large eddy simulations of compressible isotropic turbulence at a very high Reynolds number. Results show the scheme is capable of capturing the statistical equilibrium of low Mach number compressible turbulent fluctuations at infinite Reynolds number. Comparisons with the entropy splitting technique [J. Comput. Phys. 162 (2000) 33; J. Comput. Phys. 178 (2002) 307], staggered method [J. Comput. Phys. 191(2) (2003) 392], and skew-symmetric like schemes [J. Comput. Phys. 161 (2000) 114] confirm the superiority of the current approach. We also discuss a flaw in the skew-symmetric splitting implemented in the literature. Very good results are obtained based on the proper splitting.
Strength in diversity: the advance of data analysis
Authors: David J. Hand
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The scientific analysis of data is only around a century old. For most of that century, data analysis was the realm of only one discipline - statistics. As a consequence of the development of the computer, things have changed dramatically and now there are several such disciplines, including machine learning, pattern recognition, and data mining. This paper looks at some of the similarities and some of the differences between these disciplines, noting where they intersect and, perhaps of more interest, where they do not. Particular issues examined include the nature of the data with which they are concerned, the role of mathematics, differences in the objectives, how the different areas of application have led to different aims, and how the different disciplines have led sometimes to the same analytic tools being developed, but also sometimes to different tools being developed. Some conjectures about likely future developments are given.
A new multi-secret images sharing scheme using Largrange's interpolation
Authors: Jen-Bang Feng, Hsien-Chu Wu, Chwei-Shyong Tsai, Yen-Ping Chu
Venue: Journal of Systems and Software (2005)

Secret sharing is to send shares of a secret to several participants, and the hidden secret can be decrypted only by gathering the distributed shares. This paper proposes an efficient secret sharing scheme using Largrange's interpolation for generalized access structures. Furthermore, the generated shared data for each qualified set is 1/(r-1) smaller than the original secret image if the corresponding qualified set has r participants. In our sharing process, a sharing circle is constructed first and the shared data is generated from the secret images according to this sharing circle. The properties of the sharing circle not only reduce the size of generated data between two qualified sets but also maintain the security. Thus the actual ratio of the shared data to the original secret images is reduced further. The proposed scheme offers a more efficient and effective way to share multiple secrets.
Dimension of C1-splines on type-6 tetrahedral partitions
Authors: Thomas Hangelbroek, Günther Nürnberger, Christian Rössl, Hans-Peter Seidel, Frank Zeilfelder
Venue: Journal of Approximation Theory (2004)

We consider a linear space of piecewise polynomials in three variables which are globally smooth, i,e. trivariate C1-splines of arbitrary polynomial degree. The splines are defined on type-6 tetrahedral partitions, which are natural generalizations of the four-directional mesh. By using Bernstein-Bézier techniques, we analyze the structure of the spaces and establish formulae for the dimension of the smooth splines on such uniform type partitions.
Grid result checking
Authors: Cécile Germain-Renaud, Dephine Monnier-Ragaigne
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the framework of program testing or property testing, where the issue is the conformity of the program to some a-priori specification. Very large scale distributed computing systems demand to tackle the issue of computation correctness, albeit from hypothesis very different from the program testing ones. The general issues examined in this paper are the following. First, the definition of checking methods adapted to large-scale Monte-Carlo simulations; for these applications, no external criterion can be used to assess the quality of the result. Second, two result checking algorithms which minimize the overall overhead through an adaptive strategy. Finally, a specialization of this framework to a case study, the Auger astrophysics experiment. Our main contributions are: first to focus on checking Monte-Carlo simulations, which have rarely been considered previously; second to define a probabilistic checking strategy including the risk of first kind (false positive) as well as the risk of second kind (false negative) which is usually the only one considered, and which is compatible with Byzantine saboteurs; third, to exploit the probable characteristics of the behaviour of the saboteurs to optimise for the most frequent case. Finally, we show on a case study that the implementation details can be carried out
A Robust Face Detection Method
Authors: Shiqian Su, Baocai Yin
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

A new face detection method based on learning is proposed in this paper, it has three properties: First, it uses not only the local facial feature but also the global facial feature to design weak classifiers, a new kind of global facial feature called as the unified average face feature (UAFF) is proposed; Second, it uses two kinds of rectangle feature as the local feature, different from other methods, these local features are selected and calculated only in the partial regions of face; Third, these weak classifiers corresponding to the global facial features and the local facial features are combined and trained by our novel cascade classifier training algorithm to construct a cascade face detector. Because of these properties, our face detector is robust and generalizes well. Experimental results show that, with a small number of features, it can reach higher detection rate while maintain lower false alarm rate. Moreover, it can detect faces with partial occlusion.
Tangential Tallini sets in finite Grassmannians of lines
Authors: Alessandro Bichara, Corrado Zanella
Venue: Journal of Combinatorial Theory Series A (2005)

A Tallini set in a semilinear space is a set B of points, such that each line not contained in B intersects B in at most two points. In this paper, the following notion of a tangential Tallini set in the Grassmannian Γn,1,q, q odd, is investigated: a Tallini set is called tangential when it meets every ruled plane (i.e. the set of lines contained in a plane of PG(n, q)) in either q + 1 or q2 + q + 1 elements. A Tallini set QB in PG(n, q) can be associated with each tangential Tallini set B in Γn,1,q. Each l∈B is a line of PG(n, q) intersecting QB in either 0, or 1, or q + 1 points; when n ≠ 4 and B is covered by (n - 2)-dimensional projective subspaces of γn,1,q the first case does not occur. If B is a tangential Tallini set in γn,1,q covered by (n - 2)-dimensional subspaces, any of which is in PG(n, q) the set of all lines through a point and in a hyperplane, then either QB is a quadric, and B is the set of all lines contained in, or tangent to, QB, or B is a linear complex.
Generating decision regions in analog measurement spaces
Authors: Haralampos-G. D. Stratigopoulos, Yiorgos Makris
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

We develop a neural network that learns to separate the nominal from the faulty instances of a circuit in a measurement space. We demonstrate that the required separation boundaries are, in general, non-linear. Unlike previous solutions which draw hyperplanes, our network is capable of drawing the necessary non-linear hypersurfaces. The hypersurfaces translate to test criteria that are strongly correlated to functional tests. A feature selection algorithm interacts with the network to identify a discriminative low-dimensional measurement space.
A Time Series Data Management Framework
Authors: Abel Matus-Castillejos, Ric Jentzsch
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In the real world there are thousands of time series data that coexists with other data. Every day tons of data is collected in the form of time series. Time series is a collection of observations that is recorded or measured over time on a regular or irregular basis generally sequentially. Time series arise in financial, economic, and scientific applications. Typical examples are the recording of different values of stock prices, bank transactions, consumer price index, electricity and telecommunication data, etc. In theory, such data is processed, analyzed, disseminated, and presented. However, many institutions are facing some difficult issues in organizing such a vast amount of data. Therefore, the need for data management tools has become more and more important. This paper addresses this issue by proposing a framework for Time Series Data Management (TSDM). The central abstraction for the proposed domain specific framework is the notion of Business Sections, Group of Time Series, and Time Series itself. The framework integrates minimum specification regarding structural and functional aspects for time series data management.