ppxscal/embedding_network huggingface dataset:
Neural substrates of contextual interference during motor learning support a model of active preparation
Authors: Emily S. Cross, Paul J. Schmitt, Scott T. Grafton
Venue: Journal of Cognitive Neuroscience (2007)

When individuals acquire new skills, initial performance is typically better and tasks are judged to be easier when the tasks are segregated and practiced by block, compared to when different tasks are randomly intermixed in practice. However, subsequent skill retention is better for a randomly practiced group, an effect known as contextual interference (CI). The present study examined the neural substrates of CI using functional magnetic resonance imaging (fMRI). Individuals learned a set of three 4-element sequences with the left hand according to a block or random practice schedule. Behavioral retest for skill retention confirmed the presence of a typical CI effect with the random group outperforming the block group. Using a go/no-go fMRI paradigm, sequence preparation during the premovement study period was separated from movement execution. Imaging data for the two groups were compared for the first 1/3 and final 1/3 of training trials. Toward the end of training, behavioral performance between the two groups was similar, although the random group would later display a performance advantage on retention testing. During study time, the random group showed greater activity in sensorimotor and premotor regions compared to the block group. These areas are associated with motor preparation, sequencing, and response selection. This pattern of recruitment is consistent with the hypothesis that CI benefits in a sequencing task are due to improved capacity to actively prepare motor responses.
A classification of finite partial linear spaces with a primitive rank 3 automorphism group of grid type
Authors: Alice Devillers
Venue: European Journal of Combinatorics (2008)

A partial linear space is a non-empty set of points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every line contains at least two points. Graphs and linear spaces are particular cases of partial linear spaces. A partial linear space which is neither a graph nor a linear space is called proper. The aim of this paper is to classify the finite proper partial linear spaces with a primitive rank 3 automorphism group of grid type.
Hybrid Multi-agent System for Cooperative Dynamic Scheduling Through Meta-Heuristics
Authors: Ana Madureira, Joaquin Santos, Nuno Gomes
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper describes a Hybrid Multi-agent Scheduling System that assumes the existence of several Agents (which are decision-making entities) distributed inside the Manufacturing System. To solve the scheduling problem, Machine Agents and Task Agents must interact and cooperate with other agents in order to obtain optimal or near-optimal global performances trough Meta-heuristics. The idea is that from local, autonomous and often conflicting agent's objectives, a global solution emerges from a community of machine agents solving locally their schedules while cooperating with other machine agents. Agents have to manage their internal behaviors and their relationships with other agents via cooperative negotiation in accordance with business policies defined by the user manager.
Motion Capture Moves into New Realms
Authors: Brett Allan King, Linda Dailey Paulson
Venue: Computer (2007)

As the technology moves beyond its use in modeling figures created by animation or computer graphics, motion-capture applications are becoming less expensive and more readily available.
A Sorting Based Algorithm for Finding a Non-dominated Set in Multi-objective Optimization
Authors: Jun Du, Zhihua Cai, Yunliang Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A sorting based algorithm is proposed in this paper for finding non-dominated set in Multi-Objective optimization. The algorithm is composed by sorting step and dominated solutions deleting step. Some enhancement techniques including primary non-dominated solutions, scoring and summation sequence are used to reduce the computational complexity. Compared with the classic Kung et al.'s efficient algorithm, experiments show sorting based algorithm performs almost the same efficiently as the Kung et al.'s algorithm when there are less objectives and solutions, and much better when there are more objectives and solutions.
Investigation of the doping and thickness effects of polysilicon oxide by rapid thermal N2O oxidation
Authors: Chyuan Haur Kao, W. H. Sung, C. S. Chen
Venue: Microelectronic Engineering (2008)

In this paper, polyoxides were grown on n+ doped polysilicon by using rapid thermal N"2O processing. The doping level of the lower polysilicon layer and the polyoxide thickness effect were investigated. Results showed that N"2O oxide grown on medium-doped polysilicon layer exhibited better characteristics than that grown on heavily-doped polysilicon layer. The polyoxide/polysilicon interface of the polyoxide grown on the heavily doped bottom poly-1 layer is smoother than that of the medium doped polyoxide, apparently due to the phosphorus concentration which facilitates SiO"2 viscous flow and prevents oxide thinning and horn formation. However, despite the smoother interface, a large amount of phosphorus via out-diffusion after subsequent oxidation process accumulates at the polysilicon/polyoxide interface and is incorporated into the polyoxide, degrading the oxide quality. Therefore, to obtain better characteristics from N"2O polyoxide grown on a medium-doped polysilicon layer, an appropriate amount of phosphorus and nitrogen should be incorporated. Further, the thicker the oxide, the worse the characteristics, due to the longer oxidation time, which results in a rougher interface, leading to larger charge trapping and smaller Qbd.
DoD's Common Programming Language Effort
Authors: D. A. Fisher
Venue: Computer (1978)

DoD's common programming language effort is aimed at reducing the development and maintenance cost and improving the quality of software for embedded computer systems. Here is a brief review of the background, scope, goals, and methods of that effort.
Color 3-D Imaging of Normal and Pathologic Intracranial Structures
Authors: Edward Farrell, Rosario Zappulla, Wen Yang
Venue: IEEE Computer Graphics and Applications (1984)

The overall feasibility of 3-D imaging for intracranial soft tissues depends on three vital areas: the display method,the display options, and the image processing system.
Practical Implementation of Stochastic Parameterized Model Order Reduction via Hermite Polynomial Chaos
Authors: Yi Zou
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper describes the stochastic model order reduction algorithm via stochastic Hermite polynomials from the practical implementation perspective. Comparing with existing work on stochastic interconnect analysis and parameterized model order reduction, we generalized the input variation representation using polynomial chaos (PC) to allow for accurate modeling of non-Gaussian input variations. We also explore the implicit system representation using sub-matrices and improved the efficiency for solving the linear equations utilizing block matrix structure of the augmented system. Experiments show that our algorithm matches with Monte Carlo methods very well while keeping the algorithm effective. And the PC representation of non-Gaussian variables gains more accuracy than Taylor representation used in previous work (Wang et al., 2004).
Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm
Authors: Taolue Chen, Jian Lu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Last decade witnesses an impressive development of embedded reactive systems, which motivates the re- search of open systems, where multiple components in- teract with each other and their environment and these interactions decide the behavior of the system. A natu- ral "common-denominator" model for open systems is the concurrent game structure, in which several players can concurrently decide on the behavior of the system. Alternating-time temporal logic (ATL), is a temporal logic geared towards the specification and verification of properties in open systems, which allows to reason on the existence of strategies for coalitions of players in or- der to enforce a given property. Probabilistic systems, i.e. system models where transitions are equipped with random information, receive increasingly attention in recent years. In this paper, we propose to study the open probabilistic system. We extend the framework of ATL in the probabilistic setting, following the style of probabilistic computation tree logic (PCTL), and obtain two probabilistic alternating-time temporal log- ics, i.e. PATL and PATL. They are interpreted over probabilistic concurrent game structures, which is a probabilistic extension of multi-player concurrent game structure. We develop model checking algorithms for both PATL and PATL.
A New Face Recognition Method Based on 2DWPCA
Authors: Ke Han, Quan Feng, Xiu-chang Zhu, Hui-yuan Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

A new method based on Two-Dimensional Within-class Principal Component Analysis (2DWPCA) is proposed for face recognition in this paper. First, the within-class image scatter matrix of each class is calculated by using the training face samples in each class, respectively. Then, according to the within-class image scatter matrix of each class, the optimal eigenvectors of each class are computed, and are selected as the optimal projection axes of each class. Finally, a minimal distance classifier is employed to classify the given test samples. The proposed method is evaluated on the NUST603 face database. Experimental results demonstrate that the method proposed in this paper is effective and feasible.
An approach to managing the execution of large SQL queries
Authors: Yabin Meng, Paul Bird, Pat Martin, Wendy Powley
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

We present an approach to managing the execution of large queries that involves the decomposition of the queries into an equivalent set of smaller queries. The smaller queries are then scheduled such that the work is accomplished with less impact on other, possibly more important queries.
Interactive Computer Graphics: Flying High Part II
Authors: W. Myers
Venue: Computer (1979)

Here are further key developments: displays that look better to the eye, higher performance in vector displays, a box that gets full speed out of electrostatic plotters, and more. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Reusability: The Case for Object-Oriented Design
Authors: B. Meyer
Venue: IEEE Software (1987)

Simply being more organized will not make the reuse problem go away. The issues are technical, not managerial. The answers lie in object-oriented design.
Quantum Approximation Error on Some Sobolev Classes
Authors: Peixin Ye
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

We study the approximation of functions from anisotropic and generalized Sobolev classes under L_q ([0, 1]^d) norm in the quantum model of computation. Based on the quantum algorithm for approximation of finite imbedding from L^N_p to L^N_q, we develop a quantum algorithm for approximating the imbedding from anisotropic Sobolev classes B(W^r_p ([0, 1]^d)) to L_q ([0, 1]^d) space for all 1 \leqslant q, p \leqslant \infty and prove their optimality. Our results show that for p le q the quantum model of computation can bring a speedup of roughly squaring the rate of classical deterministic and randomized settings.
Extended Mobility Management Challenges over Cellular Networks combined with Cognitive Radio by using Multi-hop Network
Authors: Xiuhua Fu, Wenan Zhou, Junli Xu, Junde Song
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The combination of cellular networks with wireless ad-hoc networks composed of cognitive radio (CR) enabled terminals can not only address the inherent capacity and coverage limitations, but also increase the spectrum utilization as a result of opportunistic spectrum usage characterized by cognitive radio. In this paper, the network environment is referred to as CR-MANET, including location management, network handoff, spectrum handoff, where the traditional concept of mobility management is largely extended. After several anticipatory challenges facing the CRMANET being brought forward in this paper, an appropriate model for cooperative and cross-layer design is proposed. Finally, the main open research issues for efficient spectrum handoff and network mobility management are analyzed detail, which include spectrum handoff and performance optimization, location areas management, location update and paging, network handoff and QoS guarantee.
Assessing human perception
Authors: M. P. Hollier, G. Cosier
Venue: BT Technology Journal (2007)

Network technology typically contains complex and nonlinear processes, such as low bit rate codecs for data reduction. This nonlinearity means that the perceived performance cannot be predicted with conventional engineering performance metrics. Reliable objective assessment of perceived performance is required for optimal design, commissioning and monitoring of quality. This paper looks at how BT can measure, optimise and control the perceived performance of the service that is provided.The final receiver of a signal is the human user -- by modelling the senses of the human it is possible to predict whether an error would be perceptible. An auditory perceptual model has been developed and used to predict the subjective performance of a variety of nonlinear systems. Applications for the auditory model include design optimisation, as a measurement tool and as part of a nonlinear network planning tool.This paper focuses specifically on the auditory system, and how perceptual modelling is providing the basis for improved quality of voice service. However, as the global landscape adapts over the next decade, with multimedia, personal interactivity, and the concept of `virtuality' then all of the human senses need to be considered together. Future work is planned to include an elementary visual model and the combination of sensory models for the assessment of multimedia products and services.
Petaflop Essay Contest
Authors: Thomas Luu, Ron Soltz, Pavlos Vranas, Christopher M. Frenz, Francis Sullivan
Venue: Computing in Science and Engineering (2007)

CiSE's petaflop computing contest sparked an interesting influx of entries; the winning essay and the runner-up explore two ends of the computational spectrum, and the contest's organizer, Francis Sullivan, explores the topic in general.
KBSLUA: A knowledge-based system applied in river land use assessment
Authors: Tzai-Zang Lee, Chien-Hsing Wu, Hsien-Hui Wei
Venue: Expert Systems with Applications: An International Journal (2008)

The assessment of river land use is an important, but complex and time-consuming task that has to deal with a huge amount of data, domain regulations, legal aspects, and expert knowledge in terms of environmental protection, ecology, and water resource reuse. This paper presents a knowledge-based system (KBS"L"U"A) that is used to help the assessment of development plans for river land use. A salient function of the KBS"L"U"A is its user interface, which utilizes the functions of an existing geographic information system to retrieve geographic data as the inputs of assessment activities. Decision tables are used to acquire expert knowledge, and a forward chaining inference mechanism is utilized to derive assessment suggestions and assessment results. Two test cases are used to demonstrate the proposed KBS"L"U"A.
On the Memory Conflict Problem in Multiprocessor Systems
Authors: J. M. Kurtzberg
Venue: IEEE Transactions on Computers (1974)

This paper presents quadratic programming models of memory conflict in multiprocessor systems where main memory consists of a set of memory modules common to all processors. Two jobs (programs) are said to be in conflict, or subject to memory conflict, whenever at a given time portions of them must be executed in the same memory module by different processors. We are interested in minimizing the total conflict by the proper assignment of jobs to main memory. Two allocation models are considered: one in which the jobs-to-memory assignment is to be made independent of any particular processors-to-jobs schedule, that is, expected memory conflict is to be minimized over the space of all schedules; and the second in which a definite processor schedule is assumed to be available. For both models, algorithms are formulated for the assignment of jobs to memory.
Comments on "Protocols for Deadlock Detection in Distributed Database Systems"
Authors: J. R. Jagannathan
Venue: IEEE Transactions on Software Engineering (1983)

The two-phase deadlock detection protocol in the above paperl detects false deadlocks. This is contrary to what the authors claim. The false detection o. f deadlocks is shown using a counterexample.
Toward a Social Semantic Web
Authors: Alexander Mikroyannidis
Venue: Computer (2007)

The Semantic Web and Social Web are essentially compatible.
New Texture Features Based on Wavelet Transform Coinciding with Human Visual Perception
Authors: Muwei Jian, Junyu Dong, Dawei Gao, Zuojuan Liang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Wavelet decomposition is widely used in texture image retrieval and classification. Subbands statistics are normally used as feature vectors during feature selection phase. However, most previous methods seldom make further analysis of the transforms' subbands according to human visual perception. Based on wavelet decomposition, this paper proposes three new texture features which coincide with human visual perception. These features include directionality, contrast and coarseness in wavelet domain. We test our new texture features using the Brodatz texture database, and the experimental results indicate that the new texture features are consistent with human visual perception well.
Merging of legal micro-ontologies from Europen directives
Authors: Sylvie Despress, Sylvie Szulman
Venue: Artificial Intelligence and Law (2007)

This paper describes the construction method of a legal application ontology. This method is based on the merging of micro-ontologies built from European community directives. The TERMINAE construction method from texts enhanced by an alignment process with a core legal ontology is used for building micro-ontologies. A merging process allows constructing the legal ontology.
Distance-2 Cyclic Chaining of Constant-Weight Codes
Authors: D. T. Tang
Venue: IEEE Transactions on Computers (1973)

The cyclic distance-2 chaining of constant-weight codes has applications in A/ D conversions as well as in combinatorial problems involving the exhaustion of m-out-of-n combinations. It is shown in this paper that such a chaining can be obtained from the Gray code circuit and its transformations. Algorithms based on several theorems derived have been developed and programmed in APL.
Mapping resources to state functions in massively multiplayer online games
Authors: Viknashvaran Narayanasamy, Kok Wai Wong
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Resources in games are becoming more important today as the expectation of the gamers are ever increasing. This is especially true for Massively Multiplayer Online Games (MMOG). The game designer needs to handle the mass amount of resources available. Besides, the designer needs to make sure that the game architecture used are robust and scalable to meet future enhancement. The purpose of this paper is to review from the literature some of the resources available in most MMOG. Our contribution is to map those resources to states and state transition functions in games. These state functions will enable future work in designing a better resource management and control system.
CoS-based QoS management framework for grid services
Authors: Yazhe Tang, Yubin Yang, Ming Zhao, Lei Yao, Ya Li
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In service oriented grid environment, quality of service (QoS) support becomes more and more important. In this paper, we propose a QoS management framework which is based on class of service (CoS) for grid services, called CQEF. By using CoS instead of SLA in grid environment, grid service users and providers will no longer need to negotiate for a complex SLA. This will reduce the overhead effectively. In addition, using CoS means the whole grid service lifecycle has to be changed. We discuss these modifications during different phases of CQEF, including CoS definition, service registration and discovery, service deployment and monitoring. A CoS-based resource management mechanism is also presented to show how to guarantee the resource requirements of arrived requests.
Updating OO-Method Function Points
Authors: Giovanni Giachetti, Beatriz Marin, Nelly Condori-Fernandez, Juan Carlos Molina
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

In the framework of function points associated to OO-Method conceptual models (OOmFP), measuring the functional size of an information system in a precise and automatic way starting from its conceptual model is today a reality. The industrial application of the OO-Method modelling tools has resulted in their evolution, incorporating support for new functional elements .The present work shows the measurement rules associated to the new functional elements supported by OO-Method conceptual models, applying these rules in tools that generate executable code from OO-Method conceptual models. Finally, a comparative analysis is performed over OO-Method models of real systems. The comparative analysis shows the impact of new rules on the functional size measurement.
Using Attack Graphs to Design Systems
Authors: Suvajit Gupta, Joel Winstead
Venue: IEEE Security and Privacy (2007)

On a recent project, the authors found informal attack graphs were helpful in the iterative design of a system used to protect sensitive data at a customer site. In this article, they use a snippet from the project's design to illustrate the value of using attack graphs in a secure software development life cycle.
Magnifying Binary Image based on Morphology
Authors: Yajuan Wu, Minghui Wang, Xiaofeng Liu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

When a binary image is magnified, many jaggy corners are generated from traditional interpolated methods. In this paper, an interpolated method using mathematical morphology is presented. After magnifying the original image using nearest neighbor interpolation, jaggy corners that have different shapes are mined and stored in a matrix named Corners. Then colors of pixels listed in Corners and their neighboring pixels are changed. Thus, jaggy corners in the image are eliminated and the visual quality of the image is improved sufficiently.