ppxscal/embedding_network huggingface dataset:
A study of the close approach between a planet and a cloud of particles
Authors: Vivian Martins Gomes, Antonio F. B. A. Prado
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

In the present paper we study the close approach between a celestial body and a cloud of particles. This is the situation that occurs when a fragmented comet crosses the orbit of a planet like Jupiter, Saturn, etc. It is assumed that the dynamical system is formed by two main bodies that are in circular orbits around their center of mass and a cloud of particles that is moving under the gravitational attraction of the two primaries. The motion is assumed to be planar for all the particles and the dynamics given by the "patched-conic" approximation is used, which means that a series of two-body problems are used to generate analytical equations that describe the problem. The goal is to study the change of the orbit of this cloud of particles after the close approach with the planet. It is assumed that all the particles that belong to the cloud have semi-major axis a ± da and eccentricity e ± de before the close approach with the planet. It is desired to known those values after the close approach. In particular, we will study the effects of the periapsis distance in this maneuver.
Self-adaptive admission control policies for resource-sharing systems
Authors: Varun Gupta, Mor Harchol-Balter
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

We consider the problem of admission control in resource sharing systems, such as web servers and transaction processing systems, when the job size distribution has high variability, with the aim of minimizing the mean response time. It is well known that in such resource sharing systems, as the number of tasks concurrently sharing the resource is increased, the server throughput initially increases, due to more efficient utilization of resources, but starts falling beyond a certain point, due to resource contention and thrashing. Most admission control mechanisms solve this problem by imposing a fixed upper bound on the number of concurrent transactions allowed into the system, called the Multi-Programming-Limit (MPL), and making the arrivals which find the server full queue up. Almost always, the MPL is chosen to be the point that maximizes server efficiency. In this paper we abstract such resource sharing systems as a Processor Sharing (PS) server with state-dependent service rate and a First-Come-First-Served (FCFS) queue, and we analyze the performance of this model from a queueing theoretic perspective. We start by showing that, counter to the common wisdom, the peak efficiency point is not always optimal for minimizing the mean response time. Instead, significant performance gains can be obtained by running the system at less than the peak efficiency. We provide a simple expression for the static MPL that achieves near-optimal mean response time for general distributions. Next we present two traffic-oblivious dynamic admission control policies that adjust the MPL based on the instantaneous queue length while also taking into account the variability of the job size distribution. The structure of our admission control policies is a mixture of fluid control when the number of jobs in the system is high, with a stochastic component when the system is near-empty. We show via simulations that our dynamic policies are much more robust to unknown traffic intensities and burstiness in the arrival process than imposing a static MPL.
Real-time propagation measurement system and scattering object identification by 3D visualization by using VRML for ETC system
Authors: Minseok Kim, Jun-ichi Takada, Tetsuo Ando, Ryuji Soma
Venue: EURASIP Journal on Wireless Communications and Networking (2009)

In the early deployment of electric toll collecting (ETC) system, multipath interference has caused the malfunction of the system. Therefore, radio absorbers are installed in the toll gate to suppress the scattering effects. This paper presents a novel radio propagation measurement system using the beamforming with 8-elmenet antenna array to examine the power intensity distribution of the ETC gate in real time without closing the toll gates that are already open for traffic. In addition, an identification method of the individual scattering objects with 3D visualization by using virtual reality modeling language will be proposed and the validity is also demonstrated by applying to the measurement data.
Inspection by Eye Tracking for Interactive e-Learning Materials with Synthesized Voice Navigations
Authors: Kiyoshi Nosu, Ayako Kanda, Takeshi Koike
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper describes the effectiveness of eye tracking measurement in order to investigate interactive web-based e-Learning materials with synthesized voice based navigations for an introductory communication engineering course. The results demonstrate that, despite quality problems, synthesized voice navigation does lead the learner's viewpoint to an appropriate area of the learning material such as a selection/control buttons.
Reputation management algorithms for DHT-based peer-to-peer environment
Authors: Natalya Fedotova, Luca Veltri
Venue: Computer Communications (2009)

This paper addresses the problem of integration of reputation management mechanisms into data look-up and routing processes to cope with some specific security problems in peer-to-peer (P2P) networks based on Distributed Hash Tables (DHT). The goal is to find a mode for ''good'' peers to cooperate in order to withstand malicious activity of single malevolent peers and their collusions as well. We start from consideration of individual instruments for reputation evaluation that every single peer should be provided with to autonomously define the level of its own trust towards others. We also propose a possible scenario of integration of some existing reputation management techniques and routing mechanisms in a P2P network based on the popular Kademlia algorithm. Then, we present an interaction algorithm that allows peers to obtain the global trust value for each single node through exchanging opinions in the form of local trust values independently calculated by every peer with other members of the community. Such collaboration between peers is indispensable to cope with malicious activity of inconsistent nature specific to DHT-based environment. To render the algorithm resilient to the presence of malicious participants we propose to apply solutions for Byzantine Agreement to exchange opinions among peers. We also provide mathematical evaluations concerning the complexity and computational costs of the proposed algorithm that evidence apparent improvements over the previous one.
Toward a proper model for informational development in developing countries (the Iranian experience)
Authors: Gh. A. Montazer, M. Hoseini Moghadam
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

This paper endeavors to articulate Informational Development (ID) concept as a new mode of development and then evaluates different approaches for this new mode of development, regarding the role of Information Technology (IT) in different aspects of the development such as economic growth and competitive advantage. In the last section, we propound a model for Informational Development in developing countries.
Computable aspects of closed sets
Authors: Douglas Cenzer
Venue:  (2008)

A closed set in 0,1N may be viewed the set of infinite paths through a tree; a set A is computable if there is a computer program which halts and gives the correct answer on every query to the membership predicate for A. A numbering, or enumeration, is a map from N onto a countable collection of objects; if there is a computable numbering onto a set A &sub; N then we say that A is computably enumerable (or c.e.). The set of infinite paths through a computable, or equivalently a co-c.e., tree is called an effectively closed set. In this work, we investigate: (1) numberings for different families of effectively closed sets, (2) notions of randomness for nonempty closed subsets of 2N , (3) notions of randomness for continuous functions from 2N to 2N , and (4) continuity properties of CbT , the c.e. degrees under the Turing reduction &les;bT that requires that each use be bounded by a computable function. (1) Numberings and effectively closed sets. We show that certain families (or classes of families) of effectively closed sets&mdash;such as the decidable, homogeneous, thin, small or the entire family of effectively closed sets, or string verifiable families&mdash;possess, or do not possess, (injective) computable or effective numberings. This works builds upon the seminal work by Friedberg [46], who constructed an injective numbering of the c.e. sets. (2) Randomness of closed sets. In the space of closed sets, we give a probability measure and define a version of the Martin-L&ouml;f Test for randomness. We show that random closed sets are never effectively closed, but are, on the other hand, always perfect, have measure zero, and have box dimension log 2 43 . Every random closed set contains random and non-random elements, but no n-c.e. elements. We also explore alternate notions for randomness, such as the problem of compressibility of trees. Finally, we consider the problem of when a randomly chosen closed set meets a closed Q; this is the study of capacities. (3) Randomness of continuous functions. As in (2), we give a probability measure and define a version of the Martin-L&ouml;f Test for randomness. We show that the image of a random continuous function is always non-injective and perfect, but not necessarily surjective. Furthermore, computable elements map to random elements. Also, random closed sets arise as inverse images of 0&omega;, but not, in general, as images. The former motivates a study of pseudo-distance functions. Finally, we consider our results in the context of n-randomness. (4) Continuity properties in CbT . We show in CbT that for any b &ne; 0, 0&prime;, there is an a > b such that for any x, b &and; x = 0 iff a &and; x = 0. We prove this by first showing that that the Seetapun local noncappability theorem in the c.e. Turing degrees [84] also holds in CbT . This theorem demonstrates that every b &ne; 0, 0&prime; is noncappable with any nontrivial degree below some a > b (i.e. if x < a and x &and; b = 0 thenx = 0).
Analyzing project risks within a cultural and organizational setting
Authors: Wenting Ma, Lin Liu, Wenzhong Feng, Yuhui Shan, Fei Peng
Venue: Proceedings of the 2009 ICSE Workshop on Leadership and Management in Software Architecture (2009)

Risk management and assessment of software project is highly relevant to the social and culture context of the development activities. This paper proposes a risk analysis approach which represents the organizational settings of a project as a social dependency network, and identifies risks originated from broken role dependency relations, unsatisfied goals, unfinished tasks, and unavailable resources amongst the network. Survey results on Chinese culture implications to software projects are incorporated as an example scenario to illustrate how to evaluate the influences of culture related factors to software project risk management using the proposed approach.
Towards an Evolvable Engineering Design Framework for Interactive Computer Design Support of Mechatronic Systems
Authors: Zhun Fan, Mogens Andreasen, Jiachuan Wang, Erik Goodman, Lars Hein
Venue: Proceeding of the 2006 conference on Integrated Intelligent Systems for Engineering Design (2006)

The paper proposes an integrated evolutionary engineering design framework that integrates the chromosome model in the domain theory, the evolutionary design, and human interaction. The evolvable chromosome model helps the designer to improve creativity in the design process, suggesting them with unconventional design concepts, and preventing them from looking for solutions only in a reduced solution space. The systematic analytical process to obtain a chromosome model before running evolutionary design algorithms also helps the designer to have a complete view of design requirements and intentions. Human interaction is integrated to the framework due to the complex and dynamic nature of engineering design. It also helps the designer to accumulate design knowledge and form a design knowledge base. An example of vibration absorber design for a typewriter demonstrates its feasibility.
On affine (non)equivalence of Boolean functions
Authors: Sugata Gangopadhyay, Deepmala Sharma, Sumanta Sarkar, Subhamoy Maitra
Venue: Computing (2009)

In this paper we construct a multiset S(f) of a Boolean function f consisting of the weights of the second derivatives of the function f with respect to all distinct two-dimensional subspaces of the domain. We refer to S(f) as the second derivative spectrum of f. The frequency distribution of the weights of these second derivatives is referred to as the weight distribution of the second derivative spectrum. It is demonstrated in this paper that this weight distribution can be used to distinguish affine nonequivalent Boolean functions. Given a Boolean function f on n variables we present an efficient algorithm having O(n22n ) time complexity to compute S(f). Using this weight distribution we show that all the 6-variable affine nonequivalent bents can be distinguished. We study the subclass of partial-spreads type bent functions known as PS ap type bents. Six different weight distributions are obtained from the set of PS ap bents on 8-variables. Using the second derivative spectrum we show that there exist 6 and 8 variable bent functions which are not affine equivalent to rotation symmetric bent functions. Lastly we prove that no non-quadratic Kasami bent function is affine equivalent to Maiorana&#x2013;MacFarland type bent functions.
Efficiency of Metaheuristics in PMJS_E/T Scheduling Problem
Authors: Marcin Bazyluk, Leszek Koszalka
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Influence of the instance size on the efficiency of metaheuristic algorithms for the parallel machine job scheduling with earliness and tardiness penalties problem (PMJS_E/T) has been considered since their emergence. Such size is understood as the number of jobs which need to be scheduled and the number of available machines, capable of their execution. Investigations show that the proper selection of a metaheuristic for a given instance becomes an important issue leading to noticeable improve of quality. This paper tries to determine that dependence and suggests some policy on the selection.
Utilizing satellite systems for mobile communications: an emerging approach
Authors: Basil M. Al-Kasasbeh, Rafa E. Al-Qutaish, Mohammad I. Muhairat
Venue: Proceedings of the 8th WSEAS international conference on Electronics, hardware, wireless and optical communication (2009)

The future trends of technologies are to achieve all systems in an integrated global one that offers all the services in a simple way. The proposed mobile communications over satellite is an advanced technology that used the facilities and benefits of both systems to achieve competitive services. The proposed system concentrated on a global system that served the entire world and gives some specialization and privacy for each country. This paper attempts to show how to implement mobile communications over satellite systems in an efficient, flexible, and cost-effective manner.
Terminal boundary condition for singularly perturbed two-point boundary value problems
Authors: Awoke Andargie, Y. N. Reddy
Venue: Neural, Parallel Scientific Computations (2008)

A terminal boundary condition for Singularly Perturbed two-Point Boundary value Problems (with left and right layer) is presented. By using a terminal point, the original second order problem is partitioned in to inner and outer region problems. An implicit terminal boundary condition at the terminal point is determined from the outer region problem. The outer region problem with the implicit boundary condition is solved and produces a condition for the inner region problem. The modified inner region problem (using the transformation) is solved as a two-point boundary value problem. We used Chawla's fourth order finite difference method to solve both the inner and outer region problems. The proposed method is iterative on the terminal point. To demonstrate the applicability of the method, we solved seven singular perturbation problems.
Awakening to maker methodology: the metamorphosis of a curious caterpillar
Authors: Jay Silver
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

For a couple of years, I have used what I now see to be the Maker Methodology to develop a project called "Drawdio." I first learned parts of the methodology from fellow academics who are practicing it at my lab as an un/partially/multi named part of Media Lab culture [1]. I refined how I viewed the meaning of this way of conducting research further through my interactions with several pockets of the maker community. In this paper, I will try to make more concrete what and why Maker Methodology is. Ultimately, we'll need to make close case studies of other researchers who are already using this methodology, slowly refining the nuances. But first, I'll start with a narrative about how I came to know the Maker Methodology as a slice through one project.
Cooperative Recurrent Neural Network for Multiclass Support Vector Machine Learning
Authors: Ying Yu, Youshen Xia, Mohamed Kamel
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Binary classification problem can be reformulated as one optimization problem based on support vector machines and thus is well solved by one recurrent neural network (RNN). Multi-category classification problem in one-step method is then decomposed into two sub-optimization problems.In this paper, we first modify the sub-optimization problem about the bias so that its computation is reduced and its testing accuracy of classification is improved. We then propose a cooperative recurrent neural network (CRNN) for multiclass support vector machine learning. The proposed CRNN consists of two recurrent neural networks (RNNs) and each optimization problem is solved by one of the two RNNs. The proposed CRNN combines adaptively the two RNN models so that the global optimal solutions of the two optimization problems can be obtained. Furthermore, the convergence speed of the proposed CRNN is enhanced by a scaling technique. Computed results show the computational advantages of the proposed CRNN for multiclass SVM learning.
Motion Segmentation: a Review
Authors: Luca Zappella, Xavier Lladó, Joaquim Salvi
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

Motion segmentation is an essential process for many computer vision algorithms. During the last decade, a large amount of work has been trying to tackle this challenge, however, performances of most of them still fall far behind human perception. In this paper the motion segmentation problem is studied, analyzing and reviewing the most important and newest techniques. We propose a classification of all these techniques into different categories according to their main principle and features. Moreover, we point out their strengths and weaknesses and finally we suggest further research directions.
Entropy based adaptive flow aggregation
Authors: Yan Hu, Dah-Ming Chiu, John C. S. Lui
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Internet traffic flow measurement is vitally important for network management, accounting and performance studies. Cisco's NetFlow is a widely deployed flow measurement solution that uses a configurable static sampling rate to control processor and memory usage on the router and the amount of reporting flow records generated. But during flooding attacks the memory and network bandwidth consumed by flow records can increase beyond what is available. Currently available countermeasures have their own problems: 1) reject new flows when the cache is full--some legitimate new flows will not be counted; 2) export not-terminated flows to make room for new ones--this will exhaust the export bandwidth; and 3) adapt the sampling rate to traffic rate--this will reduce the overall accuracy of accounting, including legitimate flows. In this paper, we propose an entropy based adaptive flow aggregation algorithm. Relying on information-theoretic techniques, the algorithm efficiently identifies the clusters of attack flows in real time and aggregates those large number of short attack flows into a few metaflows. Compared to currently available solutions, our solution not only alleviates the problem in memory and export bandwidth, but also significantly improves the accuracy of legitimate flows. Finally, we evaluate our system using both synthetic trace file and real trace files from the Internet.
A Survey on School Work with Computers and Collecting Information on Education for Teachers in Japan
Authors: Takeharu Ishizuka, Tatsuya Horita, Shin Sasada, Mari Wada
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

Two surveys for teachers were done in 2006 to make clear the status of equipment with ICT environment for school work, and the way of getting information for school teachers in Japan from these results. It was cleared that teachers who are getting information by web are also collecting by other traditional ways as well. The status of equipment with ICT environment for school work was wide spread, especially, for public provided computer rate for teachers was from 0% to 100% even if teachers need to use computers for their school works. For decreasing the teachers load for school works, for security reasons, and for getting information via the internet effectively, there must maintain school ICT environment.