ppxscal/embedding_network huggingface dataset:
Interference of Left and Right Cerebellar rTMS with Procedural Learning
Authors: Sara Torriero, Massimiliano Oliveri, Giacomo Koch, Carlo Caltagirone, Laura Petrosini
Venue: Journal of Cognitive Neuroscience (2004)

Increasing evidence suggests cerebellar involvement in procedural learning. To further analyze its role and to assess whether it has a lateralized influence, in the present study we used a repetitive transcranial magnetic stimulation interference approach in a group of normal subjects performing a serial reaction time task.We studied 36 normal volunteers: 13 subjects underwent repetitive transcranial magnetic stimulation on the left cerebellum and performed the task with the right (6 subjects) or left (7 subjects) hand; 10 subjects underwent repetitive transcranial magnetic stimulation on the right cerebellum and performed the task with the hand ipsilateral (5 subjects) or contralateral (5 subjects) to the stimulation; another 13 subjects served as controls and were not submitted to repetitive transcranial magnetic stimulation; 7 of them performed the task with the right hand and 6 with the left hand. The main results show that interference with the activity of the lateral cerebellum induces a significant decrease of procedural learning: Interference with the right cerebellar hemisphere activity induces a significant decrease in procedural learning regardless of the hand used to perform the serial reaction time task, whereas left cerebellar hemisphere activity seems more linked with procedural learning through the ipsilateral hand.In conclusion, the present study shows for the first time that a transient interference with the functions of the cerebellar cortex results in an impairment of procedural learning in normal subjects and it provides new evidences for interhemispheric differences in the lateral cerebellum.
The Effect of Improving IT Standard in IT Governance
Authors: Hang Yeop Park, Sung Hwa Jung, Young-Joong Lee, Ki Cheol Jang
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

As business environment today is ever challenging, agility and eficiency are the key success factor for an enterprise to prosper Particularly, as the information systems concerning semiconductor manufacturing have been increased the complexity and expanded the size, the role of IT gets more critical for creating effective and streamlined process. Therefore, IT is not a just technological issue but a driver for business renovation. Accordingly, IT governance should be dealt with as a business strategy and thus deserved senior management attention. Efective IT governance ensures that IT is aligned with business goals and delivers maximum value. Hence, the IT governance would be groundwork for company decision making. To attain such objectives, IT organization must peform diverse internal (Inside of IT organization) and external (outside of IT organization) activities for enhancing IT organization 's eficiencies. Among activities, setting and controlling a well-dejined, robust set of IT standard are the foundation for effective IT governance. This paper focuses on the representative interna I improvement activity; IT standard, and explores the effective IT governance pe$ormance by the IT standard Improvements at Samsung Electronics Semiconductor Business. It has been proved how efective the comprehensive control of IT standard influence on the eficiency of IT organization.
Envisioning the future of India's software services business
Authors: Michael A. Cusumano
Venue: Communications of the ACM (2006)

Forecasting coming challenges for Indian software companies.
First order random forests: Learning relational classifiers with complex aggregates
Authors: Anneleen Assche, Celine Vens, Hendrik Blockeel, Sašo Džeroski
Venue: Machine Learning (2006)

In relational learning, predictions for an individual are based not only on its own properties but also on the properties of a set of related individuals. Relational classifiers differ with respect to how they handle these sets: some use properties of the set as a whole (using aggregation), some refer to properties of specific individuals of the set, however, most classifiers do not combine both. This imposes an undesirable bias on these learners. This article describes a learning approach that avoids this bias, using first order random forests. Essentially, an ensemble of decision trees is constructed in which tests are first order logic queries. These queries may contain aggregate functions, the argument of which may again be a first order logic query. The introduction of aggregate functions in first order logic, as well as upgrading the forest's uniform feature sampling procedure to the space of first order logic, generates a number of complications. We address these and propose a solution for them. The resulting first order random forest induction algorithm has been implemented and integrated in the ACE-ilProlog system, and experimentally evaluated on a variety of datasets. The results indicate that first order random forests with complex aggregates are an efficient and effective approach towards learning relational classifiers that involve aggregates over complex selections.
FGS enhancement layer truncation with minimized intra-frame quality variation
Authors: Jian Zhou, Huairong Shao, Chia Shen, Ming-Ting Sun
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper proposes an enhancement layer truncation scheme for the fine-granularity-scalability (FGS) video. Our target is to minimize the quality variation of different parts within each frame when the last transmitted enhancement layer is truncated according to the available network bandwidth. We propose to redistribute the bits in the enhancement layer that can only be partially kept with the available bit-budget so that it is able to cover the whole frame area to raise the quality of different parts uniformly. Simulation results confirm the effectiveness of the proposed method in improving the decoded visual quality and reducing the intra-frame quality variation.
Strategic profiles and internet performance: an empirical investigation into the development of a strategic internet system
Authors: Charles H. Apigian, Bhanu S. Ragu-Nathan, T. S. Ragu-Nathan
Venue: Information and Management (2006)

Organizations continue to work on defining and developing better strategic Internet systems. The use of the Internet should not, however, adversely affect their existing business processes but rather incorporate and support them. Therefore, developing a strategic Internet system should support their strategic profile while providing high performance from its use. We took a new approach to Internet development by analyzing an organization's Internet use and performance by adopting Miles and Snow's classifications of business strategy: Defenders, Analyzers, and Prospectors. A sample of 257 IT managers and professionals helped in suggesting relationships between Internet use and performance; the consequent model was then validated. Further analysis was then conducted at the dimension level to highlight the differences between strategic profiles and the appropriate Internet use. The results indicated identifiable approaches for different strategic profiles and their desired performance levels.
Improved LUT Technique for HPA Nonlinear Pre-Distortion in OFDM Systems
Authors: Ai Bo, Yang Zhi-Xing, Pan Chang-Yong, Zhang Tao-Tao, Wang Yong, Ge Jian-Hua
Venue: Wireless Personal Communications: An International Journal (2006)

In this paper, we focus on the Look-up Table (LUT) technique for the compensation of HPA nonlinear distortion. An improved LUT method is proposed with better performance compared with conventional LUT technique in terms of convergence speeds, BER and total degradation (TD). It can get over 8 dB gain in out-of-band spectrum re-growth suppression and about 0.3 dB BER performance gain than conventional LUT technique with the same iteration times. Also, we propose an actual application of HPA with pre-distorter in OFDM transmitter.
A Dual-Method Model for Copy Detection
Authors: Yunyi Liu, Liang Liang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Web technological advances have rendered readily accessible resources making the task of plagiarizing research work of others easier. A dual-method model for copy detection of copyrights violation is presented. One method is ranking while the other is fingerprinting. A prototype system was developed to test the applicability of the model for detecting duplicates on a collection of technical articles and research papers. Experiments were run to determine the effects of combining the two methods in various detecting strategies. Results reveal that combination of the two methods yields better results than employing each method individually.
An Open Architecture for Face-to-Face Learning and Its Benefits
Authors: Georg Turban, Max Muhlhauser
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

We already had the opportunity to present our category-based concept for the support of face-to-face learning during the last symposium. In the meantime, we made further experiences that contributed to the refinement of our concept and given publication. Our last paper served to present the technical basis of our concept for the development of an open architecture and is recommended to be read, since we now present the results and benefits of its application in the classroom [1]. We will examine not only the benefits for lecturers and learners, but also provide examples that illustrate our contributions for developers and supporters. The discussion of our results will be assisted by the presentation of features, use-cases and selected results of our continuously performed evaluation. All of them will be used to demonstrate the advantage and the power of our contribution that enabled us to adopt valuable features of other systems, to integrate completely new features and to combine our systems even with external ones.
Assessing data mining results via swap randomization
Authors: Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

The problem of assessing the significance of data mining results on high-dimensional 0-1 data sets has been studied extensively in the literature. For problems such as mining frequent sets and finding correlations, significance testing can be done by, e.g., chi-square tests, or many other methods. However, the results of such tests depend only on the specific attributes and not on the dataset as a whole. Moreover, the tests are more difficult to apply to sets of patterns or other complex results of data mining. In this paper, we consider a simple randomization technique that deals with this shortcoming. The approach consists of producing random datasets that have the same row and column margins with the given dataset, computing the results of interest on the randomized instances, and comparing them against the results on the actual data. This randomization technique can be used to assess the results of many different types of data mining algorithms, such as frequent sets, clustering, and rankings. To generate random datasets with given margins, we use variations of a Markov chain approach, which is based on a simple swap operation. We give theoretical results on the efficiency of different randomization methods, and apply the swap randomization method to several well-known datasets. Our results indicate that for some datasets the structure discovered by the data mining algorithms is a random artifact, while for other datasets the discovered structure conveys meaningful information.
Optimal orthogonal boundary filter banks
Authors: R. L. de Queiroz, K. R. Rao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The use of a paraunitary filter bank for image processing requires a special treatment at image boundaries to ensure perfect reconstruction and orthogonality of these regions. Using time-varying boundary filter banks, we will discuss a procedure that explores all degrees of freedom of the border filters in a method essentially independent of signal extensions, allowing us to design optimal boundary filter banks, while maintaining fast implementation algorithms.
Control and optimization in safe nuclear energetics problem
Authors: Y. A. Svistunov, M. F. Vorogushin
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

There are considered interaction of accelerator-subcritical reactor in energy producing and nuclear waste transmutation problem. Review of some papers connected with this topic is given. Separate tasks which are related to this problem are control of nuclear reactor with accelerator, optimal choice of accelerator and reactor types, beam dynamics optimization and Structure of active reactor zone optimization. Possible construction of compact energy-producing nuclear station is proposed.
Peeking into the black box: some art and science to visualizing agent-based models
Authors: Stephen M. Guerin
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper explores current metaphors for visualizing agent-based models. Metaphors include grid, network, n-dimensional cubes and landscape visualization techniques. A final section offers some theory underlying visualization of complex systems models with emphasis on mappings to non-equilibrium systems; conserved quantities and their flows; identifying order parameters and control parameters; and the presentation of phase transitions.
A global time domain circuit simulation of a microwave rectenna: Research Articles
Authors: Brahim Essakhi, Gilles Akoun, Lionel Pichon
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

The paper presents a global time domain simulation of a microwave rectenna studied for wireless energy transfer. The novelty of the work is to take into account both distributed electromagnetic parts of the antenna and the rectifier circuit including lumped elements. From a 3D finite element time domain electromagnetic modelling of the structure an equivalent circuit of the antenna is deduced: the input impedance is obtained as a function of frequency over a broad band. Then a rational approximation gives a corresponding PSPICE representation. The electromotive force induced between the ports of the antenna during the microwave illumination is directly computed from the 3D transient scattering problem. The resulting equivalent circuit of the antenna is finally incorporated into the electronic simulator PSPICE, together with the lumped components of the rectenna (ideal diodes and load). Thus a global non-linear time domain analysis of the whole structure becomes available. The results obtained with the methods presented in the paper are compared with those resulting from other techniques. The approach developed in the work could efficiently improve the design stage of rectennas devoted to microwave power transfer. Copyright &copy; 2006 John Wiley & Sons, Ltd.
An empirical study of using rule induction and rough sets to software cost estimation
Authors: Jerzy Stefanowski
Venue: Fundamenta Informaticae (2006)

This paper concerns problems of applying the approach based on rough sets and rule induction to a software engineering data analysis. More precisely, we focus our interest on a software cost estimation problem, which includes predicting the effort required to develop a software system basing on values of cost factors. The case study of analysing the COCOMO data set, containing descriptions of representative historical projects, allows us to discuss how this approach could be used to: identify the most discriminatory cost factors, extract meaningful rule representation of classification knowledge from data, construct accurate rule based classifiers.
Spatial-temporal error concealment with side information for standard video codecs
Authors: Wenjun Zeng
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Error concealment (EC) is important for transmitting video over error prone networks such as the Internet or wireless networks. Different EC strategies have their own advantages for different scenarios. However, it is generally difficult for the decoder to figure out which strategy works the best for a specific case. This paper proposes to use data embedding to convey the necessary high level side information in a standard compliant way to help improve the decoder's EC performance. We show that the EC "mode" information (i.e.., whether spatial EC or temporal EC should be used) is critical for a spatial-temporal EC approach.
An Incremental Approach to Computational Physics Education
Authors: Kelly R. Roos
Venue: Computing in Science and Engineering (2006)

Bradley University's Physics Department has developed an incremental approach to computational physics instruction. The instructionIt interweaves modern computational techniques with traditional aspects of upper-level classical mechanics and thermodynamics courses, building from simple to more complex concepts and assignments. By directly programming and controlling all aspects of their computer applications, students can best grasp computational principles.
Valuation of expansion flexibility in flexible manufacturing system investments using sequential exchange options
Authors: E. Ertugrul Karsak, C. Okan Özogul
Venue: International Journal of Systems Science (2005)

In this paper, a valuation approach that modifies traditional discounted cash flow (DCF) methodology is presented to incorporate the option premium of expansion flexibility while evaluating a flexible manufacturing system investment, Expansion flexibility allows for changing the production capacity in response to deviations in demand, while disregarding the assumption that management makes an irrevocable decision based on its future market expectations. Expansion flexibility provides a key strategic advantage by avoiding the large financial commitment at the initial investment stage and enabling investment in a phased manner according to the changes in market conditions. The aim of this paper is to present a thorough valuation methodology that accounts for both the benefits of keeping the option to expand alive and the loss of market share to competing firms if the expansion investment were delayed. In this paper, the value of expansion flexibility is computed using sequential exchange options. The proposed method employs an analytic approximation scheme for valuing American exchange options on dividend-paying assets. A numerical example demonstrates the application of the valuation framework. The options approach that incorporates the expansion flexibility option into the analysis results in a higher value than the standard DCF approach, which ignores the value of the option to expand. We also perform sensitivity analyses to see whether the expansion option increases in value in cases of high uncertainty where management can respond flexibly to new market information, and where the investment analysis ignoring flexibility yields a marginally positive net present value. The results of the proposed valuation framework are presented in comparison with a previous model that ignores the opportunity cost of delaying expansion investment.
Mechanisms of non-feedback controlling chaos and suppression of chaotic motion
Authors: A. Loskutov, S. Rybalko
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

We describe a rigorous approach to the investigation of qualitative changes in the behaviour of chaotic dynamical systems under external periodic perturbations and propose an analytical key to find such perturbations. It is proven that through a simple periodic perturbation one can stabilize the chosen periodic orbits of any unimodal maps. As an example the quadratic family maps is investigated. Also, it is proven that for piecewise linear family maps and for a two-dimensional map having a hyperbolic attractor there are feedback-free perturbations which lead to suppression of chaos and stabilization of certain periodic orbits.
MOOSE crossing: creating a learning culture
Authors: Amy Bruckman
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

MOOSE Crossing is text-based virtual reality environment (or "MUD") on the Internet designed to give kids 9 to 13 a meaningful context for reading, writing, and computer programming. The project aims use the Internet to situate constructionist learning in a supportive community context, and explores the notion of "a learning culture."
Software Defect Identification Using Machine Learning Techniques
Authors: Evren Ceylan, F. Onur Kutlubay, Ayse B. Bener
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Software engineering is a tedious job that includes people, tight deadlines and limited budgets. Delivering what customer wants involves minimizing the defects in the programs. Hence, it is important to establish quality measures early on in the project life cycle. The main objective of this research is to analyze problems in software code and propose a model that will help catching those problems earlier in the project life cycle. Our proposed model uses machine learning methods. Principal Component Analysis is used for dimensionality reduction, and Decision Tree, Multi Layer Perceptron and Radial Basis Functions are used for defect prediction. The experiments in this research are carried out with different software metric datasets that are obtained from real-life projects of three big software companies in Turkey. We can say that, the improved method that we proposed brings out satisfactory results in terms of defect prediction.
Improved algorithm for finding next-to-shortest paths
Authors: Shisheng Li, Guangzhong Sun, Guoliang Chen
Venue: Information Processing Letters (2006)

We study the problem of finding the next-to-shortest paths in a weighted undirected graph. A next-to-shortest (u, v)-path is a shortest (u, v)-path amongst (u, v)-paths with length strictly greater than the length of the shortest (u, v)-path. The first polynomial algorithm for this problem was presented in [I. Krasikov, S.D. Noble, Finding next-to-shortest paths in a graph, Inform. Process. Lett. 92 (2004) 117-119]. We improve the upper bound from O(n3m) to O(n3).