ppxscal/embedding_network huggingface dataset:
Unified Approach to the Design of Modulo-(2^n +/- 1) Adders Based on Signed-LSB Representation of Residues
Authors: Ghassem Jaberipur, Behrooz Parhami
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

Moduli of the form 2^n +- 1, which greatly simplify certain arithmetic operations in residue number systems (RNS), have been of longstanding interest. A steady stream of designs for modulo-(2^n +- 1) adders has rendered the latency of such adders quite competitive with ordinary adders. The next logical step is to approach the problem in a unified and systematic manner that does not require each design to be taken up from scratch and to undergo the error-prone and labor-intensive optimization for high speed and low power dissipation. Accordingly, we devise a new redundant representation of mod-(2^n +- 1) residues that allows ordinary fast adders and a small amount of peripheral logic to be used for mod-(2^n +- 1) addition. Advantages of the building-block approach include shorter design time, easier exploration of the design space (area/speed/power tradeoffs), and greater confidence in the correctness of the resulting circuits. Advantages of the unified design include the possibility of fault-tolerant and gracefully degrading RNS circuit realizations with fairly low hardware redundancy.
The PlusCal Algorithm Language
Authors: Leslie Lamport
Venue: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009)

Algorithms are different from programs and should not be described with programming languages. The only simple alternative to programming languages has been pseudo-code. PlusCal is an algorithm language that can be used right now to replace pseudo-code, for both sequential and concurrent algorithms. It is based on the TLA + specification language, and a PlusCal algorithm is automatically translated to a TLA + specification that can be checked with the TLC model checker and reasoned about formally.
Randomized approximation of Sobolev embeddings, III
Authors: Stefan Heinrich
Venue: Journal of Complexity (2009)

We continue the study of randomized approximation of embeddings between Sobolev spaces on the basis of function values. The source space is a Sobolev space with nonnegative smoothness order; the target space has negative smoothness order. The optimal order of approximation (in some cases only up to logarithmic factors) is determined. Extensions to Besov and Bessel potential spaces are given and a problem recently posed by Novak and Wozniakowski is partially solved. The results are applied to the complexity analysis of weak solution of elliptic PDE.
Inference rules for high-order consistency in weighted CSP
Authors: Carlos Ansótegui, María L. Bonet, Jordi Levy, Felip Manyà
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this paper we first define a new resolution rule, called signed Max-SAT parallel resolution, and prove that it is sound and complete for signed Max-SAT. Second, we define a restriction and a generalization of the previous rule called, respectively, signed Max-SAT i-consistency resolution and signed Max-SAT (i,j)-consistency resolution. These rules have the following property: if a WCSP signed encoding is closed under signed Max-SAT i-consistency, then the WCSP is i-consistent, and if it is closed under signed Max-SAT (i,j)-consistency, then the WCSP is (i,j)-consistent. A new and practical insight derived from the definition of these new rules is that algorithms for enforcing high order consistency should incorporate an efficient and effective component for detecting minimal unsatisfiable cores. Finally, we describe an algorithm that applies directional soft consistency with the previous rules.
The ineffectiveness of within-document term frequency in text classification
Authors: W. John Wilbur, Won Kim
Venue: Information Retrieval (2009)

For the purposes of classification it is common to represent a document as a bag of words. Such a representation consists of the individual terms making up the document together with the number of times each term appears in the document. All classification methods make use of the terms. It is common to also make use of the local term frequencies at the price of some added complication in the model. Examples are the naïve Bayes multinomial model (MM), the Dirichlet compound multinomial model (DCM) and the exponential-family approximation of the DCM (EDCM), as well as support vector machines (SVM). Although it is usually claimed that incorporating local word frequency in a document improves text classification performance, we here test whether such claims are true or not. In this paper we show experimentally that simplified forms of the MM, EDCM, and SVM models which ignore the frequency of each word in a document perform about at the same level as MM, DCM, EDCM and SVM models which incorporate local term frequency. We also present a new form of the naïve Bayes multivariate Bernoulli model (MBM) which is able to make use of local term frequency and show again that it offers no significant advantage over the plain MBM. We conclude that word burstiness is so strong that additional occurrences of a word essentially add no useful information to a classifier.
Forums for preservice teachers' development: lessons learned from five years of research
Authors: Nicole Clouet, Dominique Roué, Éric Bruillard
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

The CALICO research network, which includes four research laboratories and six teacher training institutes, is devoted to the study of forums in postgraduate education. Among the numerous studies the research network has been performed, the case of preservice school librarian teachers is notable. Since 2002, two training institutes (Caen and Rouen) have shared an e-learning platform which fosters hybrid formation situations based on exchange, mutualisation and collective work. For the past 5 years, significant research has been undertaken in order to better understand the organization of such forums, the activity of participants and groups, and the evolution of discourse and so on, involving very different tools and methods. This text provides a guided tour of these research efforts, explaining their importance and putting the main results obtained into perspective. It is a step towards a better characterisation of the role and nature of the various forums used during training sessions.
Optimal testing of structured knowledge
Authors: Michael Munie, Yoav Shoham
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Adopting a decision-theoretic perspective, we investigate the problem of optimal testing of structured knowledge - the canonical example being a qualifying examination of a graduate student. The setting is characterized by several factors: examinee's knowledge structured around several inter-dependent topics, a limited "budget" of questions available to the examiner, a decision to be made (pass/fail), and an utility for good and bad decisions. The existence of multiple professors brings up additional issues such as committee formation, and the existence of multiple students brings up issues such as fairness.
Another look at statistical learning theory and regularization
Authors: Vladimir Cherkassky, Yunqian Ma
Venue: Neural Networks (2009)

The paper reviews and highlights distinctions between function-approximation (FA) and VC theory and methodology, mainly within the setting of regression problems and a squared-error loss function, and illustrates empirically the differences between the two when data is sparse and/or input distribution is non-uniform. In FA theory, the goal is to estimate an unknown true dependency (or 'target' function) in regression problems, or posterior probability P(y/x) in classification problems. In VC theory, the goal is to 'imitate' unknown target function, in the sense of minimization of prediction risk or good 'generalization'. That is, the result of VC learning depends on (unknown) input distribution, while that of FA does not. This distinction is important because regularization theory originally introduced under clearly stated FA setting [Tikhonov, N. (1963). On solving ill-posed problem and method of regularization. Doklady Akademii Nauk USSR, 153, 501-504; Tikhonov, N., & V. Y. Arsenin (1977). Solution of ill-posed problems. Washington, DC: W. H. Winston], has been later used under risk-minimization or VC setting. More recently, several authors [Evgeniou, T., Pontil, M., & Poggio, T. (2000). Regularization networks and support vector machines. Advances in Computational Mathematics, 13, 1-50; Hastie, T., Tibshirani, R., & Friedman, J. (2001). The elements of statistical learning: Data mining, inference and prediction. Springer; Poggio, T. and Smale, S., (2003). The mathematics of learning: Dealing with data. Notices of the AMS, 50 (5), 537-544] applied constructive methodology based on regularization framework to learning dependencies from data (under VC-theoretical setting). However, such regularization-based learning is usually presented as a purely constructive methodology (with no clearly stated problem setting). This paper compares FA/regularization and VC/risk minimization methodologies in terms of underlying theoretical assumptions. The control of model complexity, using regularization and using the concept of margin in SVMs, is contrasted in the FA and VC formulations.
OSGi4C: enabling OSGi for the cloud
Authors: Holger Schmidt, Jan-Patrick Elsholz, Vladimir Nikolov, Franz J. Hauck, Rüdiger Kapitza
Venue: Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE (2009)

OSGi is an industry standard for a lean Java-based component system with focus on local applications following the service-oriented architecture. Initially developed for dedicated application domains such as gateways and set-top boxes it is meanwhile used in many other areas, with Eclipse as a prominent example. OSGi allows dynamic deployment of components called bundles with automatic local dependency resolution on basis of exported Java packages. In this regard, OSGi builds an ideal basis for demand-driven deployment of complex Java applications, such as needed in the context of emerging cloud computing infrastructures. However, it lacks distributed code deployment and resolving. We present OSGi for the Cloud (OSGi4C), a novel OSGi service allowing seamless deployment of locally non-existent OSGi bundles and services on demand without requiring any changes to the OSGi platform. In OSGi4C, we use an underlying peer-to-peer infrastructure to provide, share and load OSGi bundles at runtime. Unlike related work, OSGi4C automatically resolves OSGi bundle and service dependencies. Therefore, dependent bundles that are not yet locally installed are also deployed. OSGi4C considers platform-specific implementations (e.g., native code) and non-functional requirements (e.g., performance and resource demand) while automatically discovering and selecting the best of multiple available bundles for download.
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
Authors: Shinji Imahori, Mutsunori Yagiura
Venue: Computers and Operations Research (2010)

We investigate the best-fit heuristic algorithm by Burke et al. [2004. A new placement heuristic for the orthogonal stock-cutting problem. Operations Research 52, 655-671] for the rectangular strip packing problem. For its simplicity and good performance, the best-fit heuristic has become one of the most significant algorithms for the rectangular strip packing. In this paper, we propose an efficient implementation of the best-fit heuristic that requires O(n) space and O(nlogn) time, where n is the number of rectangles. We prove that this complexity is optimal, and we also show the practical usefulness of our implementation via computational experiments. Furthermore, we give the worst-case approximation ratio of the best-fit heuristic.
Skip-Splay: Toward Achieving the Unified Bound in the BST Model
Authors: Jonathan C. Derryberry, Daniel D. Sleator
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We present skip-splay, the first binary search tree algorithm known to have a running time that nearly achieves the unified bound. Skip-splay trees require only O(m lg lg n + UB(¿)) time to execute a query sequence ¿ = ¿ 1 ... ¿ m . The skip-splay algorithm is simple and similar to the splay algorithm.
What about the IP of your IP?: an introduction to intellectual property law for engineers and scientists
Authors: André I. Reis, Roner G. Fabris
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

This paper presents an introduction to intellectual property law for scientists and engineers, focused on patents. Patents are both a form of property and a form of knowledge dissemination. To understand the particularities of the patent law patents are compared to more common forms of property and knowledge dissemination. Similarities and differences are highlighted for didactic purposes.
Distributed Watershed Runoff and Sediment Production Model
Authors: Yu Jiyu, Xie Hehai, Liu Fanggui
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

A distributed watershed runoff and sediment production model, reflecting the influences of the spatial inhomogeneity of underlying surfaces and human activities on watershed runoff and sediment production, is constructed. It can simulate the spatial and temporal processes of runoff and sediment production under different kinds of land utilization, and provide technological support and scientific basis. Taking Chabagou watershed as a case, its simulated results are satisfactory.
Voxel-by-Voxel Functional Diffusion Mapping for Early Evaluation of Breast Cancer Treatment
Authors: Bing Ma, Charles R. Meyer, Martin D. Pickles, Thomas L. Chenevert, Peyton H. Bland, Craig J. Galbán, Alnawaz Rehemtulla, Lindsay W. Turnbull, Brian D. Ross
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

Quantitative isotropic diffusion MRI and voxel-based analysis of the apparent diffusion coefficient (ADC) changes have been demonstrated to be able to accurately predict early response of brain tumors to therapy. The ADC value changes measured during pre- and post-therapy interval are closely correlated to treatment response. This work was demonstrated using a voxel-based analysis of ADC change during therapy in the brains of both rats and humans, following rigidly registering pre- and post-therapeutic ADC MRI exams. The primary goal of this paper is to extend this voxel-by-voxel analysis to assess therapeutic response in breast cancer. Nonlinear registration (with higher degrees of freedom) between the pre- and post-treatment exams is needed to ensure that the corresponding voxels actually contain similar cellular partial contributions due to soft tissue deformations in the breast and compartmental tumor changes during treatment as well. With limited data sets, we have observed the correlation between changes of ADC values and treatment response also exists in breast cancers. With diffusion scans acquired at three different timepoints (pre-treatment, early post-treatment and late post-treatment), we have also shown that ADC changes across responders within 5 weeks are a function of time interval after the initiation of treatment. Comparison of the experimental results with pathology shows that ADC changes can be used to evaluate early response of breast cancer treatment.
Optimizing data intensive GPGPU computations for DNA sequence alignment
Authors: Cole Trapnell, Michael C. Schatz
Venue: Parallel Computing (2009)

MUMmerGPU uses highly-parallel commodity graphics processing units (GPU) to accelerate the data-intensive computation of aligning next generation DNA sequence data to a reference sequence for use in diverse applications such as disease genotyping and personal genomics. MUMmerGPU 2.0 features a new stackless depth-first-search print kernel and is 13x faster than the serial CPU version of the alignment code and nearly 4x faster in total computation time than MUMmerGPU 1.0. We exhaustively examined 128 GPU data layout configurations to improve register footprint and running time and conclude higher occupancy has greater impact than reduced latency. MUMmerGPU is available open-source at http://www.mummergpu.sourceforge.net.
Data Symbol Phase Synchronizers of Open Loop
Authors: António D. Reis, José F. Rocha, Atilio S. Gameiro, José P. Carvalho
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

In this work, we study the data symbol synchronizers of open loop. The recovered clock of this synchronizers hasn’t the capacity to follow the input changes. However, its simplicity allows operation at high data rates.We present four synchronizer types namely the tank circuit, the SAW (Surface Acoustic Wave) circuit, the monostable circuit and the astable circuit.The objective is to study the four synchronizers and to evaluate their output jitter UI-RMS (Unit Interval Root Mean Squared) versus input SNR (Signal - Noise Ratio).
Geography Information Web Service Semantic Description and Automatic Discovery Based on Web Service and OWL-S
Authors: Liang Hong, Zongyi He, Jian Xiang, Shixiang Li
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

In this paper, the web service and geography information web service are introduced. The disadvantages of semantic description and automatic discovery for geography information service based on web service are analyzed. Through using web service and OWL-S, the semantic of geography information web service is described and the automatic discovery of geography information service is realized. Finally, the prototype system based on this method is developed and the feasibility of the solution is analyzed.
How does non-random spontaneous activity contribute to brain development?
Authors: Jean-Philippe Thivierge
Venue: Neural Networks (2009)

Highly non-random forms of spontaneous activity are proposed to play an instrumental role in the early development of the visual system. However, both the fundamental properties of spontaneous activity required to drive map formation, as well as the exact role of this information remain largely unknown. Here, a realistic computational model of spontaneous retinal waves is employed to demonstrate that both the amplitude and frequency of waves may play determining roles in retinocollicular map formation. Furthermore, results obtained with different learning rules show that spike precision in the order of milliseconds may be instrumental to neural development: a rule based on precise spike interactions (spike-timing-dependent plasticity) reduced the density of aberrant projections to the SC to a markedly greater extent than a rule based on interactions at much broader time-scale (correlation-based plasticity). Taken together, these results argue for an important role of spontaneous yet highly non-random activity, along with temporally precise learning rules, in the formation of neural circuits.
Stabilization of 2D NSHP recursive digital filters with guaranteed stability using PLSI polynomials
Authors: K. R. Santhi, M. Ponnavaikko, N. Gangatharan
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Two-dimensional digital filters have gained wide acceptance in recent years. For recursive filters, nonsymmetric half-plane versions (also known as semicausal) are more general than quarter-plane versions (also known as causal) in approximating arbitrary magnitude characteristics. The major problem in designing two-dimensional recursive filters is to guarantee their stability with the expected magnitude response. In general, it is very difficult to take stability constraints into account during the stage of approximation. This is the reason why it is useful to develop techniques, by which stability problem can be separated from the approximation problem. In this way, at the end of approximation process, if the filter becomes unstable, there is a need for stabilization procedures that produce a stable filter with similar magnitude response as that of the unstable filter. This paper, demonstrates a stabilization procedure for a two-dimensional nonsymmetric half-plane recursive filters based on planar least squares inverse (PLSI) polynomials. The paper's findings prove that, a new way of form-preserving transformation can be used to obtain stable PLSI polynomials. Therefore obtaining PLSI polynomial is computationally less involved with the proposed form-preserving transformation as compared to existing methods, and the stability of the resulting filters is guaranteed.
A Networks Data Collection Embedded System Based on ARM-uCLinux
Authors: Jiangchun Xu, Jiande Wu, Yuhui Li
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

In this paper, we propose a new data acquisition systembased on embedded operation system which can be used tosupervise the system remotely. The processor S3C44B0X ,which used to data collection and storage, is as the controlkernel of the system. The system adopt the uCLinux multitaskoperation system. The system have many advantages,such as high quality of real-time, friendly interface, controllingand monitoring through internet, et al.
The Use of Virtual Reality in the Treatment of Posttraumatic Stress Disorder (PTSD)
Authors: Deanne C. Simms, Susan O'Donnell, Heather Molyneaux
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

Background. Interest in the treatment of PTSD is increasing with concerns about the psychological effects of war on troops. Objective. We performed a comprehensive literature review on virtual reality (VR) for treating combat-related PTSD. Methods. Canada's primary institute for scientific and technical information (NRC-CISTI) performed the initial literature search in 2008. Of 296 items which met inclusion criteria, 20 pertained to VR in the treatment of mental health.. An additional 20 more recent items were added in 2009, making a total of 40 items reviewed. Of those, 6 empirical studies involved patients with PTSD [1, 2, 3, 4, 5, 6]. Results. VR exposure therapy (VRET) has been successfully used to treat anxiety and phobia disorders including PTSD [7, 8]. VRET may be particularly suitable for clients with combat-related PTSD as it aids in exposure treatments for these clients whom are often unable to engage in traditional therapy [9, 10]. Future research should include randomized, controlled studies employing large samples.
Patterned Growth in Extreme Environments
Authors: Penelope Boston, Jane Curnutt, Ernesto Gomez, Keith Schubert, Brian Strader
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

Abstract—In the search for life on Mars and other extraterrestrial bodies, one of the biggest problems facing us is, how do we recognize life or the remains of ancient life when we find it? We will need to recognize residual patterns left by life. One approach to recognizing these kinds of patterns is look at patterns created and left by life in extreme environments here on Earth.