检索结果-内蒙古大学图书馆

The Social Affordances of the Internet for Networked Individualism

Journal of computer-Mediated Communication 2006年第3期8卷

作者： Barry Wellman Anabel Quan-Haase Jeffrey Boase Wenhong Chen Keith Hampton Isabel Díaz Kakuko Miyata In 1965 moved from his Bronx High School of Science slide rule to IBM cards and an 029 keypunch in the bowels of Harvard University. Since then he's been primarily interested in the interplay between large-scale social processes and how people use technology to be connected at work and in the community. His NetLab research network is trying to get a handle on how the Internet fits into everyday life. Wellman founded the International Network for Social Network Analysis in 1976. He is a recent Chair of the Community section of the American Sociological Association has been nominated for the Chair of the Communication and Information Technology section of the ASA the Virtual Community focus area leader for SIGGROUP/ACM and a Executive Cmmittee member of the Association for Internet Researchers. Wellman's (co)edited books are: Social Structures: A Network Approach (2d ed CSPI 2003) Networks in the Global Village (Westview Press 1999) and The Internet in Everyday Life (Blackwell Publishers 2002). Address:Centre for Urban & Community Studies University of Toronto 455 Spadina Avenue Toronto Canada M5S 2G8. Fax: +1-416-978-7162 Address:Centre for Urban & Community Studies University of Toronto 455 Spadina Avenue Toronto M5S 2G8 Canada. Address:Massachusetts Institute of Technology 77 Mass. Ave. Room 9-522 Cambridge MA 02139. Address:IN3 Av. Tibidabo 47 08035 Barcelona Spain. Phone: +*** Fax: +***. Address:Department of Sociology Meiji Gakuin University 1-2-37 Shirokanedai Minato-ku Tokyo 108-8636 JAPAN. Phone: +81-3-5421-5565 Fax: +81-3-5421-5697. Doctoral student at the Faculty of Information Studies University of Toronto. She has been a Fellow of the Knowledge Media Design Institute and the McLuhan Program in Culture and Technology. Her articles address the nature of Internet-related social change for social integration and information flow. Her articles have examined the implications of these changes for communities and her thesis focuses on organizations. University of Toronto doctoral

We review the evidence from a number of surveys in which our NetLab has been involved about the extent to which the Internet is transforming or enhancing community. The studies show that the Internet is used for connectivity locally as well as globally, although the nature of its use varies in different countries. Internet use is adding on to other forms of communication, rather than replacing them. Internet use is reinforcing the pre-existing turn to societies in the developed world that are organized around networked individualism rather than group or local solidarities. The result has important implications for civic involvement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A simple self-synchronization system for CSK/SS

A simple self-synchronization system for CSK/SS

引用

2004 IEEE International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2004

作者： Ito, Azumi Habuchi, Hiromasa Graduate School of Science and Engineering Ibaraki University Japan Department of Computer and Information Sciences Faculty of Engineering Ibaraki University Japan

In this paper, a simple self-synchronization system for Code Shift Keying/ Spread Spectrum (CSK/SS) with the differential detector is proposed. In the proposed method, a pair consists of the Manchester-coded pseudo-noise(PN) sequence and the non-Manchester-coded PN sequence is used. The cross-correlation characteristic between these sequences is used instead of the S-curve of the delay lock loop (DLL) directly. The following performances under the Additive White Gaussian Noise (AWGN) channel are evaluated;(1) the tracking error (jitter) performance and (2) the bit error rate (BER) performance that takes into account the jitter. As a result, it is shown that these performances of the proposed system are better than those of the external synchronization system. © 2004 IEEE.

关键词： Spread spectrum communication

来源：评论

学校读者我要写书评

暂无评论

How to collect balls moving in the euclidean plane

How to collect balls moving in the euclidean plane

引用

Proceedings of Computing: The Australasian Theory Symposium (CATS)

作者： Asahiro, Yuichi Horiyama, Takashi Makino, Kazuhisa Ono, Hirotaka Sakuma, Toshinori Yamashita, Masafumi Department of Social Information Systems Faculty of Information Science Kyushu Sangyo University Fukuoka 813-8503 Japan Division of Systems Science Graduate School of Engineering Science Osaka University Toyonaka Osaka 560-8531 Japan Depatment of Communications and Computer Engineering Graduate School of Informatics Kyoto University Kyoto 606-8501 Japan Department of Computer Science and Communication Engineering Graduate School of Information Science and Electrical Engineering Kyushu University Fukuoka 812-8581 Japan

In this paper, we study how to collect n balls moving with constant velocities in the Euclidean plane by k robots moving on straight track-lines through the origin. Since all the balls might not be caught by robots, differently from Moving-Target TSP, we consider the following 3 problems in various situations: (i) deciding if k robots can collect all n balls, (ii) maximizing the number of the balls collected by k robots, and (iii) minimizing the number of the robots to collect all n balls. The situations considered here contain the cases in which track-lines are given (or not), and track-lines are identical (or not). For all problems and situations, we provide polynomial time algorithms or proofs of intractability, which clarify the tractability- intractability frontier in the ball collecting problems in the Euclidean plane. © 2004 Elsevier B.V. All rights reserved.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Bioinformatics

引用

IEEE Potentials 2004年第1期23卷 24-27页

作者： Doom, Travis Raymer, Michael Krane, Dan IEEE Wright State University United States Department of Computer Science and Engineering Graduate Faculty in Biomedical Sciences Dayton OH United States WSU Biomedical Sciences Ph.D. Program Forensic Bioinformatics Inc. United States Bioinformatics Research Group Computer Science Department Wright State University United States

No abstract available

关键词： Bioinformatics Biology computing Biological information theory Data analysis Computational biology Proteins Biochemistry Sequences Genomics Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Integration and optimization of rule-based constraint solvers

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3018卷 198-213页

作者： Abdennadher, Slim Frühwirth, Thorn Faculty of Information Engineering and Technology German University Cairo Egypt Computer Science Faculty University of Ulm Germany

One lesson learned from practical constraint solving applications is that constraints are often heterogeneous. Solving such constraints requires a collaboration of constraint solvers. In this paper, we introduce a methodology for the tight integration of CHR constraint programs into one such program. CHR is a high-level rule-based language for writing constraint solvers and reasoning systems. A constraint solver is well-behaved if it is terminating and confluent. When merging constraint solvers, this property may be lost. Based on previous results on CHR program analysis and transformation we show how to utilize completion to regain well-behavedness. We identify a class of solvers whose union is always confluent and we show that for preserving termination such a class is hard to find. The merged and completed constraint solvers may contain redundant rules. Utilizing the notion of operational equivalence, which is decidable for well-behaved CHR programs, we present a method to detect redundant rules in a CHR program. © Springer-Verlag 2004.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Kinematic analysis of human lifting movement for biped robot control

Kinematic analysis of human lifting movement for biped robot...

引用

International Workshop on Advanced Motion Control (AMC)

作者： N. Matsunaga Y. Okimura S. Kawaji Department of Computer Science Faculty of Engineering Kumamoto University Japan Department of Systems Engineering and Information Science Graduate School of Science and Technology Kumamoto University Japan

An increasing biped robot development may be viewed in terms of realization of autonomous works in real world, where robot motion with lifting and/or carrying of heavy objects must be designed. Such motion control of biped robot working by himself is an important issues, in which many configurations and motions appear depending on position of robot and object. Isaka et al. analyzed the lifting motion of skilled lifter and mentioned that the configuration of lifting is important to realize the efficient lifting with small burden to the lower back. In their analysis the motion was limited for weight lift, and the object's position was fixed. So, it is required to analyze various human lifting motions in many situations for new biped robot control. Our study aims at realization of biped robot that can walk and lifting heavy objects. In this paper, dynamic characteristics of human lifting movement are analyzed through lifting of barbell in various situations. Furthermore, based on the lifting analysis, the comparison of motion control between lifting and jumping is discussed.

关键词： Kinematics Humans Robot control Motion analysis Motion control Humanoid robots Design engineering Legged locomotion Leg Muscles

来源：评论

学校读者我要写书评

暂无评论

Determinism in cellular automata-investigation of transition rules

Determinism in cellular automata-investigation of transition...

引用

International Conference on Intelligent Sensing and information Processing (ICISIP)

作者： S. Supratid R. Sadananda Faculty of Information Technology Rangsit University Pathum Thani Thailand Computer Science Program Asian Institute of Technology Pathum Thani Thailand

Cellular automata are discrete dynamic systems whose behavior is specified in terms of local interactions. Even simple local interactions may eventually manifest themselves in terms of complex and unexpected global patterns. A number of investigations have been reported on two-dimensional lattices demonstrating exciting outcomes starting with simple initial configurations and simple rules of interactions, giving rise to the speculative possibilities of artificial life. There is a growing interest in a variety of automata including three dimensional automata and variations of transition rules, but common to all their formations are certain hard questions relating to the global determinism of the behavior of the cellular automata manifest in the local interactions. There are a number of other theoretical issues remain unresolved. A considerable theoretical work and simulation have been reported around the one-dimensional lattices, primarily because of possible visualization of the processes. In this paper we investigate the issue of density of an automata configuration and its determinism.

关键词： Lattices Automata information technology computer science Visualization Content addressable storage Centralized control Automatic control Communication system control Control systems

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for dynamic routing and wavelength assignment in WDM networks

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3358卷 893-902页

作者： Le, Vinh Trong Ngo, Son Hong Jiang, Xiaohong Horiguchi, Susumu Guo, Minyi Graduate School of Information Science Japan Advanced Institute of Science and Technology Japan School of Information Sciences Tohoku University Sendai Japan School of Computer Science and Engineering University of Aizu Japan

In this paper, we study the challenging problem of Dynamic Routing and Wavelength Assignment (DRWA) in WDM (Wavelength-Division-Multiplexing) networks with wavelength continuity constraint, and propose an improved genetic algorithm (GA) for it. By adopting a new fitness function to consider simultaneously the path length and number of free wavelengths in cost estimation of a route, the new genetic RWA algorithm can achieve a good load balance among route candidates and result in a lower blocking probability than both the fixed alternative routing algorithm and the previous GA-based algorithm for DRWA, as verified by an extensive simulation study upon the ns-2 network simulator and some typical network topologies. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A multi-national study of reading and tracing skills in novice programmers

A multi-national study of reading and tracing skills in novi...

引用

ITiCSE 2004 Conference

作者： Lister, Raymond Fone, William McCartney, Robert Seppälä, Otto Adams, Elizabeth S. Hamer, John Moström, Jan Erik Simon, Beth Fitzgerald, Sue Lindholm, Morten Sanders, Kate Thomas, Lynda Faculty of Information Technology University of Technology Sydney Broadway NSW 2007 Australia Staffordshire University Stafford ST18 0DG United Kingdom Dept Comp. Sci. and Engineering University of Connecticut Storrs CT 06268 United States Laboratory of Info. Processing Science Helsinki University of Technology PL 5400 02015 TKK Finland Department of Computer Science James Madison University Harrisonburg VA 22807 United States Department of Computer Science University of Auckland Auckland New Zealand Department of Computing Science Umeå University 905 86 Umeå Sweden Dept of Maths and Computer Science University of San Diego San Diego CA 92110 Information and Computer Sciences Metropolitan State University St. Paul MN 55106 United States Department of Computer Science Aarhus University Aarhus DK-8200 Denmark Math/CS Department Rhode Island College Providence RI 02908 United States Department of Computer Science University of Wales Aberystwyth

A study by a ITiCSE 2001 working group ("the McCracken Group") established that many students do not know how to program at the conclusion of their introductory courses. A popular explanation for this incapacity is that the students lack the ability to problem-solve. That is, they lack the ability to take a problem description, decompose it into sub-problems and implement them, then assemble the pieces into a complete solution. An alternative explanation is that many students have a fragile grasp of both basic programming principles and the ability to systematically carry out routine programming tasks, such as tracing (or "desk checking") through code. This ITiCSE 2004 working group studied the alternative explanation, by testing students from seven countries, in two ways. First, students were tested on their ability to predict the outcome of executing a short piece of code. Second, students were tested on their ability, when given the desired function of short piece of near-complete code, to select the correct completion of the code from a small set of possibilities. Many students were weak at these tasks, especially the latter task, suggesting that such students have a fragile grasp of skills that are a prerequisite for problem-solving.

关键词： Distance education

来源：评论

学校读者我要写书评

暂无评论

How to Collect Balls Moving in the Euclidean Plane

引用

Electronic Notes in Theoretical computer science 2004年 91卷 229-245页

作者： Yuichi Asahiro Takashi Horiyama Kazuhisa Makino Hirotaka Ono Toshinori Sakuma Masafumi Yamashita Department of Social Information Systems Faculty of Information Science Kyushu Sangyo University Fukuoka 813-8503 Japan Depatment of Communications and Computer Engineering Graduate School of Informatics Kyoto University Kyoto 606-8501 Japan Division of Systems Science Graduate School of Engineering Science Osaka University Toyonaka Osaka 560-8531 Japan Department of Computer Science and Communication Engineering Graduate School of Information Science and Electrical Engineering Kyushu University Fukuoka 812-8581 Japan

In this paper, we study how to collect n balls moving with constant velocities in the Euclidean plane by k robots moving on straight track-lines through the origin. Since all the balls might not be caught by robots, differently from Moving-Target TSP, we consider the following 3 problems in various situations: (i) deciding if k robots can collect all n balls, (ii) maximizing the number of the balls collected by k robots, and (iii) minimizing the number of the robots to collect all n balls. The situations considered here contain the cases in which track-lines are given (or not), and track-lines are identical (or not). For all problems and situations, we provide polynomial time algorithms or proofs of intractability, which clarify the tractability-intractability frontier in the ball collecting problems in the Euclidean plane.

关键词： Moving-Target TSP Vehicle routing problem Partially ordered set Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：