ppxscal/embedding_network huggingface dataset:
Unified methodology for realizing fully-differential current-mode filters
Authors: P. Kumar, R. Senani, R. K. Sharma, S. S. Gupta
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Using the concept of nullors, an unified methodology is presented which can be used for realizing fully differential current mode filters using a variety of building blocks which can be represented by nullators and norators. The workability of the proposed approach is verified by the SPICE simulation results of an exemplary universal biquad made from multiple-output-current-conveyors. This exemplary filter can realize low pass (LP), high pass (HP), band pass (BP), band elimination (BE) and all pass filters-all in fully differential form, from the same topology. The angular frequency and ω0/Q0 or Q0 of the realized filters are orthogonally controllable. The applicability of the developed approach to derive a variety of biquads as well as higher order FD CM filters (including the electronically-tunable ones), using a number of other building blocks such as FTFNs, Current Conveyors, Controlled Current Conveyors and OTAs, is conceptualized.
Decoding higher-order motor information from primate non-primary motor cortices
Authors: Toshi Nakajima, Hajime Mushiake, Toshio Inui, Jun Tanji
Venue: Technology and Health Care (2007)

To investigate the involvement of primate non-primary motor cortices in bimanual sequential movements, we recorded neuronal activity in the supplementary motor area (SMA) and presupplementary motor area (pre-SMA) while an animal was performing bimanual motor tasks that required two sequential arm movements consisting of either pronation or supination of the right or left arms with delay periods. We also recorded electromyograms (EMGs) from the arm while the animal performed the bimanual task to compare muscle and neuronal activity. This paper focuses on the neuronal activity before the onset of sequential movements. We found that the prime-mover forelimb muscles were selectively active when an impending arm movement involved recorded muscles, but was not dependent on whether the arm movements were bimanual or unimanual. In contrast, we found that neurons in the non-primary motor cortices showed different activity depending on whether the forthcoming sequential arm movements were unimanual or bimanual. Our results suggest that neuronal activity in the SMA and pre-SMA reflects higher-order information about arm use before motor execution. By extracting this type of information, we can use it to control prosthetic arms in a more intelligent manner through a brain-machine interface.
Algorithm for solving a new class of general mixed variational inequalities in Banach spaces
Authors: Fu-Quan Xia, Nan-Jing Huang
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, a new concept of @h-proximal mapping for a proper subdifferentiable functional (which may not be convex) on a Banach space is introduced. An existence and Lipschitz continuity of the @h-proximal mapping are proved. By using properties of the @h-proximal mapping, a new class of general mixed variational inequalities is introduced and studied in Banach spaces. An existence theorem of solutions is established and a new iterative algorithm for solving the general mixed variational inequality is suggested. A convergence criteria of the iterative sequence generated by the new algorithm is also given.
Jim Gray: his contribution to industry
Authors: David Vaskevitch
Venue: ACM SIGMOD Record (2008)

Jim Gray was successful in many aspects of his life. Not only did he have a profound influence on the computer industry, but also on all of the people that he interacted with along the way. It is this balance contribution to society that makes Jim truly unique.
Comparison between a Proposed QoS Mathematical Model and other IP QoS Models
Authors: El-Bahlul Fgee, William J. Phillips, William Robertson
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Significant challenges has been introduced for IP networks with the advent of new emerging applications, such as VOIP and E-Commerce, that require delivering quality guarantees. However, IP networks were originally designed to support best effort delivery only. Three Quality of Service (QoS) models, IntServ, DiffServ and MultiProtocol Label Switching (MPLS) have been standardized by the Internet Engineering Task Force (IETF). Although these methods guarantee delivery, they have drawbacks such as complexity, restrictions of pre-defined classes and higher end-to-end delay.In this paper, a new QoS mathematical model has been proposed. This model is based on the principles of Network Calculus in which an incoming traffic flow is regulated by an arrival curve that upper bounds its rate. Then, this traffic flow is lower bounded and delayed by a service latency time at each node on its way to the destination node. This model is compared with other IP QoS models, IntServ and DiffServ.The worst case end-to-end delay is derived and illustrated by a numerical example .The proposed model has achieved the lowest end-to-end delay compared with others.
A ground-validated NDVI dataset for monitoring vegetation dynamics and mapping phenology in Fennoscandia and the Kola peninsula
Authors: P. S. A. Beck, P. Jönsson, K. -A. Høgda, S. R. Karlsen, L. Eklundh, A. K. Skidmore
Venue: International Journal of Remote Sensing (2007)

An NDVI dataset covering Fennoscandia and the Kola peninsula was created for vegetation and climate studies, using Moderate Resolution Imaging Spectroradiometer 16-day maximum value composite data from 2000 to 2005. To create the dataset, (1) the influence of the polar night and snow on the NDVI values was removed by replacing NDVI values in winter with a pixel-specific NDVI value representing the NDVI outside the growing season when the pixel is free of snow; and (2) yearly NDVI time series were modelled for each pixel using a double logistic function defined by six parameters. Estimates of the onset of spring and the end of autumn were then mapped using the modelled dataset and compared with ground observations of the onset of leafing and the end of leaf fall in birch, respectively. Missing and poor-quality data prevented estimates from being produced for all pixels in the study area. Applying a 5 km×5 km mean filter increased the number of modelled pixels without decreasing the accuracy of the predictions. The comparison shows good agreement between the modelled and observed dates (root mean square error = 12 days, n = 108 for spring; root mean square error = 10 days, n = 26, for autumn). Fennoscandia shows a range in the onset of spring of more than 2 months within a single year and locally the onset of spring varies with up to one month between years. The end of autumn varies by one and a half months across the region. While continued validation with ground data is needed, this new dataset facilitates the detailed monitoring of vegetation activity in Fennoscandia and the Kola peninsula.
Sensory-motor enhancement in a virtual therapeutic environment
Authors: Richard A. Foulds, David M. Saxe, Arthur W. Joyce,  III, Sergei Adamovich
Venue: Virtual Reality (2008)

The sensory-motor skills of persons with neuromuscular disabilities have been shown to be enhanced by intensive and repetitive therapeutic interventions. This paper describes a form of low immersion virtual reality and a prototype, open source system that allow a user with significant physical disability to actively interact with computer-generated objects whose behaviors promote a game-like interaction. Unlike fully immersive and haptic virtual reality, this approach frees the user from head-mounted displays and gloves. It extracts the user&#x2019;s real-time silhouette from the output of a remote video camera and uses that two-dimensional outline to interact with graphical objects on screen. In contrast to video games that have been modified with specialized interfaces, this virtual interaction system promotes the repetitive use of goal directed movements of the arms and body, which are essential to promote cortical reorganization, as well as discourage unwanted changes in muscle tissue that result in contracture. A prototype system demonstrates the potential of low immersion technology to motivate users and encourage participation in therapy. It also offers the potential of accommodating the sensory-motor skills of individuals with very significant impairment. The behaviors of the computer-generated graphics can be altered to allow use by those with very limited range of motion and/or motor control. These behaviors can be adjusted to provide a continuing challenge as the user&#x2019;s skills improve. This prototype is described in terms of functional capabilities that include a silhouette extraction from a video image, and generation of graphical objects that interact with the silhouette. The work is extended with a discussion of a more sophisticated region of interest detection algorithm that can select specific parts of the body.
The mystery of "b := (b = false)"
Authors: Stuart Reges
Venue: ACM SIGCSE Bulletin (2008)

This paper describes some unusual patterns that emerged from a statistical analysis of the 1988 Advanced Placement Exam in Computer Science. Most multiple-choice questions on the exam had few significant correlations with other parts of the exam. But a small set of five questions had a nontrivial correlation with many parts of the test. One question in particular demonstrated such correlations. It asked about the effect of the assignment statement "b := (b = false)" for a boolean variable b. One interpretation of this data is that these questions are testing general programming aptitude. The paper presents the analysis along with a discussion of the possible implications.
A case study with high education student about e-gov in Portugal
Authors: Célio Gonçalo Marques, Vasco Gestosa da Silva, Ricardo Campos
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In Portugal, e-Gov is considered to be a key feature in the process of continuously developing an Information Society becoming itself a vital process in the context of modernizing public administration. Its higher priority it's to improve the quality of public services through the use of ICT (Information and Communications Technology). Although some great examples, Portugal still presents some low values in the main measures of ICT, when compared to the majority of European countries, The low investment, a almost inexistence in ICT qualification and the reduced knowledge that enterprises and citizens have about e-Gov potentiality's, are some of the obstacles to a higher success of e-Gov. In this context, we consider important to verify, as they are going to be the futures employees of public administration, the knowledge of public administration high students have about e-Gov, what it's the importance they gave to it, what services they now, use and propose.
A Fast and Accurate Iris Recognition Method Using the Complex Inversion Map and 2DPCA
Authors: Sepehr Attarchi, Karim Faez, Amin Asghari
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Iris recognition is one of the most reliable biometric technologies. In this paper, we presented a novel method for iris recognition, using a complex mapping procedure and best-fitting line for the iris segmentation and 1D Gabor filter with 2DPCA for the recognition approach. We used an intensity threshold method with Canny edge detector to extract the rough region of the pupil. For the outer boundary a median filter with prewitt compass edge detector were used to localize the rough region of the outer boundary. By selecting the bottom point of the pupil (which is not usually occluded by the eyelids and eyelashes) as a reference point, two sets of intersecting points between the horizontal lines and pupil’s inner and outer boundaries were created. Each point set was map into a new complex domain using the complex inversion map function and the best-fitting line was found on the range. Exact inner and outer boundaries of the iris were found by remapping the best-fitting lines to original domain. In the recognition procedure, we used the real term of 1D Gabor filter. In order to reduce the dimensionality of the extracted features, the new introduced 2DPCA method was used. We tested our proposed algorithm by implementing a ground truth method. Experimental results show that the proposed method has an encouraging performance in both segmentation and recognition approaches.
An Off-line Algorithm to Estimate Trajectories of Mobile Nodes Using Ad-hoc Communication (concise contribution)
Authors: Sae Fujii, Akira Uchiyama, Takaaki Umedu, Hirozumi Yamaguchi, Teruo Higashino
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In this paper, we propose an off-line algorithm calledTRACKIE to estimate trajectories of mobile nodes based onencounter information. This method only assumes reasonablenumber of landmarks and ad-hoc wireless communicationfacility of mobile nodes, and does not rely on multi-hopad-hoc networks nor global positioning system. The methodachieves low-cost estimation of trajectories and providesaccurate solution (the average estimation error was lessthan 40% of the wireless range in simulations). We haveevaluated TRACKIE with Micaz Mote and shown that estimationerror is about 2m in real environments where wirelessrange is about 3m.
A novel Arabic lemmatization algorithm
Authors: Eiman Al-Shammari, Jessica Lin
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

Tokenization is a fundamental step in processing textual data preceding the tasks of information retrieval, text mining, and natural language processing. Tokenization is a language-dependent approach, including normalization, stop words removal, lemmatization and stemming. Both stemming and lemmatization share a common goal of reducing a word to its base. However, lemmatization is more robust than stemming as it often involves usage of vocabulary and morphological analysis, as opposed to simply removing the suffix of the word. In this work, we introduce a novel lemmatization algorithm for the Arabic Language. The new lemmatizer proposed here is a part of a comprehensive Arabic tokenization system, with a stop words list exceeding 2200 Arabic words. Currently, there are two Arabic leading stemmers: the root-based stemmer and the light stemmer. We hypothesize that lemmatization would be more effective than stemming in mining Arabic text. We investigate the impact of our new lemmatizer on unsupervised data mining techniques in comparison to the leading Arabic stemmers. We conclude that lemmatization is a better word normalization method than stemming for Arabic text.
Generating balanced parentheses and binary trees by prefix shifts
Authors: Frank Ruskey, Aaron Williams
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, ..., b2n is a member of Bn, then the k-th prefix shift is the string b1, bk, b2, ..., bk-1, bk+1, ..., b2n. Prefix shift algorithms are also known for combinations, and permutations of a multiset; the combination algorithm appears in fascicles of Knuth vol 4. We show that the algorithm is closely related to the combination algorithm, and like it, has a loopless implementation, and a ranking algorithm that uses O(n) arithmetic operations. Additionally, the algorithm can be directly translated to generate all binary trees by a loopless implementation that makes a constant number of pointer changes for each successively generated tree.
From Omega to ?P in the Crash-Recovery Failure Model with Unknown Membership
Authors: Mikel Larrea, Cristian Martín
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Unreliable failure detectors are mechanisms providing information about process failures. This paper addresses the implementation of the Eventually Perfect failure detector class, denoted P, in the crash-recovery failure model. The approach followed is to transform existing implementations of the Omega failure detector, which provides an eventual leader election functionality, into P. In a system with the minimal requirements to implement P, we first propose a generic transformation algorithm that uses the underlying Omega as a black box. Then, we enhance the algorithm to provide a common set of k correct processes. The algorithms do not require the membership of the system to be known a priori.
Symmetries, non-Euclidean metrics, and patterns in a Swift&#x2013;Hohenberg model of the visual cortex
Authors: N. Michael Mayer, Matthew Browne, J. Michael Herrmann, Minoru Asada
Venue: Biological Cybernetics (2008)

The aim of this work is to investigate the effect of the shift-twist symmetry on pattern formation processes in the visual cortex. First, we describe a generic set of Riemannian metrics of the feature space of orientation preference that obeys properties of the shift-twist, translation, and reflection symmetries. Second, these metrics are embedded in a modified Swift&#x2013;Hohenberg model. As a result we get a pattern formation process that resembles the pattern formation process in the visual cortex. We focus on the final stable patterns that are regular and periodic. In a third step we analyze the influences on pattern formation using weakly nonlinear theory and mode analysis. We compare the results of the present approach with earlier models.
Constructing double- and triple-erasure-correcting codes with high availability using mirroring and parity approaches
Authors: Gang Wang, Xiaoguang Liu, Sheng Lin, Guangjun Xie, Jing Liu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

With the rapid progress of the capacity and slow pace of the speed/MTTF of hard disks, and increasing size of storage systems, the reliability and availability of storage systems become more and more serious. This paper discusses the method of constructing double- and triple-erasure-correcting codes via combining mirroring and parity approaches in details, and presents a double-erasure code MPDC and a triple-erasure code MPPDC based on onefactorizations of complete graphs. The two codes are simple, easy to implement, and have no disk number limitation. They achieve perfect fault-free load balance and approximately optimal reconstruction load balance. The simulation results show that, compared with other double- and triple-erasure codes, MPDC and MPPDC have comparative light-load and moderate-load performance and better heavy-load performance in fault-free mode. Because parity declustering is used, the two codes are far superior to the other double- and triple-erasure codes in degraded- and reconstruction-mode performance.
Proceeding of the 6th international conference on Mobile systems, applications, and services
Venue: International Conference On Mobile Systems, Applications And Services (2008)

We welcome you to the Sixth International Conference on Mobile Systems, Applications, and Services, sponsored by ACM SIGMOBILE and USENIX, held in beautiful Breckenridge, Colorado June 17-20, 2008. We are grateful for the generous financial support provided to MobiSys 2008 by the National Science Foundation, Intel, Microsoft Research, Nokia, and IBM Research. We thank all of the faculty, staff, and students who have contributed to making MobiSys 2008 a success. In particular, we'd like to profusely thank our Program Committee Chairs Eyal de Lara and Carla Ellis and all the PC members, our local arrangements chair Mike Colagrosso, our workshops and tutorials chair Katie Siek, our posters and demonstrations chair Landon Cox, our publications chair Anmol Sheth, and our publicity chair Alex Varshavsky. In addition, we'd like to thank SIGMOBILE, our steering committee, and especially our steering committee chair Victor Bahl for all his advice and guidance during the preparations for MobiSys 2008. Mobile computing and communications have soared in popularity in recent years, and research interest has been intense and growing. With the advent of smartphone and wireless technology such as the iPhone and WiFi/WiMax, we have seen an explosion in innovation in mobile computing. The MobiSys conference captures this excitement by gathering a vibrant community of world-class researchers together to share cutting-edge ideas in mobile systems, applications, and services. We are excited to present the MobiSys 2008 program. The main conference program presents 22 sterling technical papers, a keynote speech by the renowned Roy Want of Intel, a panel discussion on key policy issues in mobile computing, and an invigorating session of 19 posters and demonstrations. In addition, we are pleased to present the Second International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (HealthNet), the first Workshop on Virtualization in Mobile Computing (MobiVirt), a tutorial on Thick Mobile Client Programming Technologies: Python for S60 and J2ME, a tutorial on Vehicular Ad Hoc Networks, and a PhD Forum. We effusively thank all the organizers of the workshops, tutorials and PhD Forum, including HealthNet's General Co-Chairs Gaetano Borriello and Chiara Petrioli and TPC Co-Chairs Maria Ebling and Robin Kravets, MobiVirt's organizers Ramon Caceres and Landon Cox, the Nokia thick client tutorial's instructors Rich Hankins and Vidya Setlur, the VANET tutorial's instructors Hannes Hartenstein and Ken Laberteaux, and the PhD Forum's organizers Arta Doci and Alan Marchiori.
Software Builders
Authors: Diomidis Spinellis
Venue: IEEE Software (2008)

The tools and processes we use to transform our system's source code into an application that we can deploy or ship have always been important, but nowadays they can mean the difference between success and failure. Software building's golden rule is that you should automate all build tasks. The most popular tool options for doing this are the facilities that your integrated development environment (IDE) provides, the various implementations of Make, and Apache Ant and Maven. Using an IDE can be problematic. Ant and Maven provide a portable solution for Java developers, while Make is more flexible and transparent. You can optimize the build process by appropriate dependency tracking and parallelization. Once an automated build process is in place, you can use it as a basis for continuous builds.
Vector field contours
Authors: T. Annen, H. Theisel, C. Rössl, G. Ziegler, H.-P. Seidel
Venue: Proceedings of graphics interface 2008 (2008)

We describe an approach to define contours of 3D vector fields and employ them as an interactive flow visualization tool. Although contours are well-defined and commonly used for surfaces and 3D scalar fields, they have no straightforward extension in vector fields. Our approach is to extract and visualize specific stream lines which show the most similar behavior to contours on surfaces. This way, the vector field contours are a particular set of isolated stream line segments that depend on the view direction and few additional parameters. We present an analysis of the usefulness of vector field contours by demonstrating their application to linear vector fields. In order to achieve interactive visualization, we develop an efficient GPU-based implementation for real-time extraction and rendering of vector field contours. We show the potential of our approach by applying it to a number of example data sets.