ppxscal/embedding_network huggingface dataset:
Design and analysis of scheduling and queue management schemes for high performance switches and routers
Authors: Mounir Hamdi
Venue:  (2007)

The growth of today&rsquo;s Internet has been constrained substantially by the performance of interconnecting routers and switches. High performance routers and switches rely heavily on scheduling and queuing technologies in order to provide high throughput and quality services to today&rsquo;s Internet users. In this thesis, we design and analyze fast and efficient scheduling algorithms and fair queuing management schemes for routers and switches to achieve the above objectives. First, we prove the theoretical limitations on the queuing lengths in the framework of on-line switching scheduling with Virtual Output Queuing. Those bounds determine the size of the memory that must be allocated to switch ports without knowing the future traffic in order to avoid packet loss. We then model a particular class of scheduling problems as Batch Scheduling to relax the scheduling time constraint, and we examine its on-line competitiveness. Two randomized algorithms are proposed and evaluated by both approximation ratios and simulation. In particular, Batch Scheduling algorithms find their practical significance when facing the challenges of optical switch scheduling. Two deterministic batch scheduling algorithms of different paradigms are proposed for optical switching. A third deterministic algorithm explores the asynchronous property of optical fabrics and overcomes the reconfiguration delays. Internet research stresses more and more on the quality of service provided to the network end users rather than engineering realization of service implementation. We studied the problem of flow splitting where some sources intend to acquire more link resources than their fair share by splitting their flow into many parallel flows, which results in unfair resource allocation to the other flows on the bottleneck link. We have devised active queue management algorithms according to our theoretical analysis to detect and counteract the effects of these so called &ldquo;Network Ants&rdquo;. Technical analysis and simulation experimentation show that the algorithms are able to maintain fairness among the flows by mitigating these effects.
Pitfalls in Remote Team Coordination: Lessons Learned from a Case Study
Authors: Darja Šmite, Nils Brede Moe, Richard Torkar
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

As companies become more and more distributed, multi-site development is becoming a norm. However along with the new opportunities, geographic distribution is proven to increase the complexity of software engineering introducing challenges for remote team communication, coordination and control. In this article we present an illustrative singe-case study with an intra-organizational intra-national context focussing on the effect of geographic distribution on team coordination practices and how this influences remote team performance. Based on our findings we conclude that a) distribution significantly influences the nature of coordination; b) remote team coordination mechanisms can't be chosen disregarding the complexity of the given tasks and c) the distribution of work on complex software development tasks shall be avoided.
Design of Fuzzy Set-Based Polynomial Neural Networks with the Aid of Symbolic Encoding and Information Granulation
Authors: Sung-Kwun Oh, In-Tae Lee, Hyun-Ki Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, we introduce fuzzy-neural networks--- Fuzzy Polynomial Neural Networks (FPNN) with fuzzy set-based polynomial neurons (FSPN) whose fuzzy rules include the information granules (about the real system) obtained through Information Granulation. We have developed a design methodology (genetic optimization using Genetic Algorithms) to find the optimal structure for fuzzy-neural networks that expanded from Group Method of Data Handling (GMDH). It is the number of input variables, the order of the polynomial, the number of membership functions, and a collection of the specific subset of input variables that are the parameters of FPNN fixed by aid of genetic optimization that has search capability to find the optimal solution on the solution space. We adopt fuzzy set-based fuzzy rules as substitute for fuzzy relation-based fuzzy rules and apply the concept of Information Granulation to the proposed fuzzy set-based rules. The performance of genetically optimized FPNN (gFPNN) with fuzzy set-based polynomial neurons (FSPN) composed of fuzzy set-based rules is quantified through experimentation where we use a number of modeling benchmarks data which are already experimented with in fuzzy or neurofuzzy modeling.
A Low Power Real-Time Scheduling Scheme for the Wireless Sensor Network
Authors: Mikyung Kang, Junghoon Lee
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

This paper proposes a low power real-time scheduling scheme that minimizes power consumption and reassigns polling order on the wireless sensor networks. The proposed scheme aims at enhancing the power performance based on the maximum constant power method along with the additional auxiliary schedule which can switch the primary one when a specific channel falls in a bad state or time slot is unused. Built on top of the EDF scheduling policy, the proposed scheme also tests whether an unused slot can be reclaimed without violating the constraints of subsequent real-time streams. To improve the probability of reclaimed bandwidth, it also rearranges the polling order. The simulation results show that the proposed scheme is able to enhance success ratio and it also provides minimized power consumption.
Human firewall: case study faculty of economics Babes-Bolyai University, Clujnapoca, Romania
Authors: Sergiu Jecan
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

It is known the fact that the safety of a system is determinated of the most little secure part of it. Many network administrators consider that if they have a good firewall they and their network are secure. But this is really true? The most vulnerable piece from a chain can break down the whole system. And in our case, end user is the most vulnerable piece. So, Human Firewall - must be the first target for any security policy that is implemented.
How Does Students' Help-Seeking Behaviour Affect Learning?
Authors: Moffat Mathews, Tanja Mitrović
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

We examined high-level help (HLH) seeking behaviour of students by data mining in SQL-Tutor. Students who used HLH very frequently had the lowest learning rate; their learning was also shallow. They attempted very difficult problems compared to other groups but only solved very easy problems, suggesting that they were usually situated well beyond their Zone of Proximal Development. They also abandoned a large number of problems without solving them. Manual inspection of the logs showed erratic problem solving behaviour, suggesting a "guess and copy" strategy.The group of students who used HLH very infrequently seemed to contain two distinct sub-groups: students with high expertise, and students with very low expertise who still did not use HLH. Learning rates were highest for students who used moderate HLH. Students with lower usage of HLH solved the most difficult problems comparatively, without the use of HLH, and had high learning rates, suggesting the ITS is most beneficial for this group of students.
Durations of Context-Dependent Phonemes: A New Feature in Speaker Verification
Authors: Charl Johannes Heerden, Etienne Barnard
Venue: Speaker Classification II: Selected Projects (2007)

We present a text-dependent speaker verification system based on Hidden Markov Models. A set of features, based on the temporal duration of context-dependent phonemes, is used in order to distinguish amongst speakers. Our approach was tested using the YOHO corpus; it was found that the HMM-based system achieved an equal error rate (EER) of 0.68% using conventional (acoustic) features and an EER of 0.32% when the time features were combined with the acoustic features. This compares well with state-of-the-art results on the same test, and shows the value of the temporal features for speaker verification. These features may also be useful for other purposes, such as the detection of replay attacks, or for improving the robustness of speaker-verification systems to channel or speaker variations. Our results confirm earlier findings obtained on text-independent speaker recognition [1] and text-dependent speaker verification [2] tasks, and contain a number of suggestions on further possible improvements.
A Biologically Inspired Model with Fusion and Clonation of Membranes
Authors: Giorgio Delzanno, Laurent Begin
Venue: Proceedings of the 7th international conference on Unconventional Computing (2008)

P-systems represent an important class of biologically inspired computational models. In this paper, we study computational properties of a variation of P-systems with rules that model in an abstract way fusion and clonation of membranes. We focus our attention on extended P-systems with an interleaving semantics and symbol objects and we investigate decision problems like reachability of a configuration, boundedness (finiteness of the state space), and coverability (verification of safety properties). In particular we use the theory of well-structured transition systems to prove that both the coverability and the boundedness problems are decidable for PB systems with fusion and clonation. Our results represent a preliminary step towards the development of automated verification procedures for concurrent systems with biologically inspired operations like fusion and clonation.
Association-based image retrieval for automatic target recognition
Authors: Arun Kulkarni, Harikrisha Gunturu, Srikanth Datla
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Model-based automatic target recognition (ATR) systems deal with recognizing three dimensional objects from two dimensional images. In order to recognize and identify objects the ATR system must have one or more stored models. Multiple two dimensional views of each three dimensional object that may appear in the universe it deals with are stored in the database. During recognition, two dimensional view of a target object is used a query image and the search is carried out to identify the corresponding three dimensional object. Stages of a model-based ATR system include preprocessing, segmentation, feature extraction, and searching the database. One of the most important problems in a model-based ATR system is to access the most likely candidate model rapidly from a large database. In this paper we propose new architecture for a model-based ATR system that is based on association-based image retrieval. We try to mimic human memory. The human brain retrieves images by association. We use generalized bi-directional associative memories to retrieve associated images from the database. We use the ATR system to identify military vehicles from their two dimensional views.
An efficient peer-to-peer indexing tree structure for multidimensional data
Authors: Rong Zhang, Weining Qian, Aoying Zhou, Minqi Zhou
Venue: Future Generation Computer Systems (2009)

As one of the most important technologies for implementing large-scale distributed systems, peer-to-peer (P2P) computing has attracted much attention in both research and industrial communities, for its advantages such as high availability, high performance, and high flexibility to the dynamics of networks. However, multidimensional data indexing remains as a big challenge to P2P computing, because of the inefficiency in search and network maintenance caused by the complicated existing index structures, which greatly limits the scalability of applications and dimensionality of the data to be indexed. We propose SDI (Swift tree structure for multidimensional Data Indexing), a swift index scheme with a simple tree structure for multidimensional data indexing in large-scale distributed systems. While keeping the query efficiency in O(logN) in terms of routing hops, SDI has extremely low maintenance costs which is proved through theoretical analysis. Furthermore, SDI overcomes the root-bottleneck problem existing in most other tree-based distributed indexing systems. Extensive empirical study verifies the superiority of SDI in both query and maintenance performance.
On the Asynchronous Nature of the Asynchronous Π-Calculus
Authors: Romain Beauxis, Catuscia Palamidessi, Frank D. Valencia
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We address the question of what kind of asynchronous communication is exactly modeled by the asynchronous &Pi; -calculus (&Pi; a ). To this purpose we define a calculus $\pi_\mathfrak{B}$ where channels are represented explicitly as special buffer processes. The base language for $\pi_\mathfrak{B}$ is the (synchronous) &Pi; -calculus, except that ordinary processes communicate only via buffers. Then we compare this calculus with &Pi; a . It turns out that there is a strong correspondence between &Pi; a and $\pi_\mathfrak{B}$ in the case that buffers are bags: we can indeed encode each &Pi; a process into a strongly asynchronous bisimilar $\pi_\mathfrak{B}$ process, and each $\pi_\mathfrak{B}$ process into a weakly asynchronous bisimilar &Pi; a process. In case the buffers are queues or stacks, on the contrary, the correspondence does not hold. We show indeed that it is not possible to translate a stack or a queue into a weakly asynchronous bisimilar &Pi; a process. Actually, for stacks we show an even stronger result, namely that they cannot be encoded into weakly (asynchronous) bisimilar processes in a &Pi; -calculus without mixed choice.
Leatherbacks Matching by Automated Image Recognition
Authors: Eric J. Pauwels, Paul M. Zeeuw, Danielle M. Bounantony
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

We describe a method that performs automated recognition of individual laetherback turtles within a large nesting population. With only minimal preprocessing required of the user, we prove able to produce unsupervised matching results. The matching is based on the Scale-Invariant Feature Transform by Lowe. A strict condition posed by biologists reads that matches should not be missed (no false negatives). A robust criterion is defined to meet this requirement. Results are reported for a considerable sample of leatherbacks.
Symmetric clock synchronization in sensor networks
Authors: Philipp Sommer, Roger Wattenhofer
Venue: Proceedings of the workshop on Real-world wireless sensor networks (2008)

In this paper we argue that achieving symmetric errors is the key to an improved understanding of clock synchronization. We present a clock synchronization algorithm with drift compensation that implements this symmetric error paradigm. The performance of the algorithm is evaluated by measurements in an indoor testbed using the TinyNode hardware platform. We show that the remaining error is symmetric and in the range of the clock granularity.
Hydrogen Adsorption and Penetration of Cx (x=58-62) Fullerenes with Defects
Authors: Xin Yue, Jijun Zhao, Jieshan Qiu
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Density functional theory calculations were performed to investigate the endohedral and exohedral adsorption of a H2 molecule on the classical and nonclassical fullerenes C x (x=58, 59, 60, 62) with seven-, eight-, and nine-membered rings. The amplitude of adsorption energies are within 0.03eV and the molecule-fullerene interaction belongs to van der Waals type. Penetration of a H2 molecule through different fullerene cages was discussed and the corresponding energy barriers were obtained. We find that the existence of large holes reduces the penetration barrier from 12.6 eV for six-membered ring on perfect C60 cage to about 8eV for seven-membered rings and to about 5eV for eight-membered rings.
New Real-Time Closed-Captioning System for Japanese Broadcast News Programs
Authors: Shinichi Homma, Akio Kobayashi, Takahiro Oku, Shoei Sato, Toru Imai, Tohru Takagi
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

A new real-time closed-captioning system for Japanese broadcast news programs is described. The system is based on a hybrid automatic speech recognition system that switches input speech between the original program sound and the rephrased speech by a "re-speaker". It minimises the number of correction operators, generally to one or two, depending on the difficulties of the speech recognition, although four correction operators were needed in our previous news system. Experiments show that the system could be used for captioning typical news programs at local stations, which have fewer staff and where simple operation is required.
Analysis of Surfaces Using Constrained Regression Models
Authors: Sune Darkner, Mert R. Sabuncu, Polina Golland, Rasmus R. Paulsen, Rasmus Larsen
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

We present a study of the relationship between the changes in the shape of the human ear due to jaw movement and acoustical feedback (AF) in hearing aids. In particular, we analyze the deformation field of the outer ear associated with the movement of the mandible (jaw bone) to understand its effect on AF and identify local regions that play a significant role. Our data contains ear impressions of 42 hearing aid users, in two different positions: open and closed mouth, and survey data including information about experienced discomfort due to AF. We use weighted support vector machines (WSVM) to investigate the separation between the presence and lack of AF and achieve classification accuracy of 80% based on the deformation field. To robustly localize the regions of the deformation field that significantly contribute to AF we employ logistic regression penalized with elastic net (EN). By visualizing the selected variables on the mean surface, we provide clinical interpretations of the results.
A climatic data information model for computing crop yields in Burkina Faso
Authors: Yu-Min Wang, Seydou Traore, Tienfuan Kerh
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

Crop yields deficit is generally attributed to cumulative effects of low precipitation and inappropriate cropping calendar in Burkina Faso. However, the relationship between water and yields could be used to determine a suitable cropping calendar. This paper applied a reference model and rainfall contribution index recently developed for Burkina Faso to model the water balance analysis using climatic data information collected from 1995 to 2006 in Ouagadougou and Banfora. Then, the crop water yield function concept is used for establishing climatic data information model to examine the final output under different planting dates. It was found that, the difference between potential and expected yields was causally related to the planting dates applied. In addition, by comparing the maximum expected yields to the average values, the yields were reduced between 5 to 18% and 4 to 23% in Ouagadougou and Banfora, respectively. Lower the difference, closer the planting dates to the suitable dates. It could be therefore suggested for alleviating the water shortage and yield deficit under rainfed condition, the suitable cropping calendars determined using the model established in this study. Finally, suitable planting dates coupled to early maturing varieties for Burkina Faso could be a very good recommendation for agriculture water management.
A Novel Facial Features Extraction Algorithm Using Gabor Wavelets
Authors: Wei Jiang, Jian Zhang, Ting-zhi Shen, Xiao-hua Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

An efficient algorithm for facial features extractions is proposed. The facial features we extracted are the edges of two eyes, nose and mouth. The algorithm is based on an improved Gabor wavelets edge detector to detect the face region and facial features regions. The experimental results show that the proposed method is robust against facial expression, illumination, and can be also effect if the person wearing glassed, and so on.
Robust normative systems
Authors: Thomas Ågotnes, Wiebe van der Hoek, Michael Wooldridge
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Although normative systems, or social laws, have proved to be a highly influential approach to coordination in multi-agent systems, the issue of compliance to such normative systems remains problematic. In all real systems, it is possible that some members of an agent population will not comply with the rules of a normative system, even if it is in their interests to do so. It is therefore important to consider the extent to which a normative system is robust, i.e., the extent to which it remains effective even if some agents do not comply with it. We formalise and investigate three different notions of robustness and related decision problems. We begin by considering sets of agents whose compliance is necessary and/or sufficient to guarantee the effectiveness of a normative system; we then consider quantitative approaches to robustness, where we try to identify the proportion of an agent population that must comply in order to ensure success, and finally, we consider a more general approach, where we characterise the compliance conditions required for success as a logical formula.
Automatic Computing Machinery
Authors: George R. Stibitz
Venue: IEEE Annals of the History of Computing (1982)

Two notes written in 1947 and 1950 respectively, with an modern introduction by the author.
Efficient Parallel Programming with Linda
Authors: Ashish Deshpande, Martin Schultz
Venue: Scientific Programming (1992)

Linda is a coordination language inverted by David Gelernter at Yale University, which when combined with a computation language (like C) yields a high-level parallel programming language for MIMD machines. Linda is based on a virtual shared associative memory containing objects called tuples. Skeptics have long claimed that Linda programs could not be efficient on distributed memory architectures. In this paper, we address this claim by discussing C-Linda's performance in solving a particular scientific computing problem, the shallow water equations, and make comparisons with alternatives available on various shared and distributed memory parallel machines.
A New Empirical Study of Weak Backdoors
Authors: Peter Gregory, Maria Fox, Derek Long
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Work by Kilby, Slaney, Thiebaux and Walsh [1] showed that the backdoors and backbones of unstructured Random 3SAT instances are largely disjoint. In this work we extend this study to the consideration of backdoors in SAT encodings of structured problems. We show that the results of Kilby et al. also apply to structured problems. Further, we analyse the frequency with which individual variables appear in backdoors for specific problem instances. In all problem classes there are variables with particularly high frequencies of backdoor membership. Backbone variables that do appear in backdoors typically appear in very few.