百度西安分公司,西安百度推广,百度西安代理商,
  • 名片
  • 展厅
  • 简介
  • 资质
  • 资讯
icon 个人信息

icon 刘二伟

icon 行业信息
行业新闻
  • 西安百度推广李彦宏做客央…
  • 西安百度推广最新报道:框…
  • 20万大奖揭晓84%行政村落…
行业知识
  • 百度首席技术官李一男辞职…
  • 谷歌在中国就像中国企业在…
  • Rakuten将与百度在华设立…
  • 中国网民规模09年底增至3…
行业经验
  • 百度搜索推广改革更多营销…

icon 这些用户浏览过该名片
  • 武汉红酒批发
  • 武汉不锈钢制品有限责任公…
  • 重庆昶星电器维修公司
  • 上海宝光科技集团有限公司…
  • 上海宝光科技集团有限公司…
  • 重庆皇朝网络
  • 武汉金辉型材拉弯厂
  • 重庆时代服装道具五金装饰…
  • 重庆勇华加固工程技术有限…
  • 武汉液体壁纸
  • 武汉手绘培训学校
  • 海南三公里电杆水管厂
  • 武汉魔术道具批发市场
  • 武汉魔术培训中心
  • 武汉魔方批发市场
  • 武汉茶叶批发市场
  • 武汉顺心管道有限公司
  • 重庆汇丰无缝钢管有限公司…
  • 武汉吉利来易学取名咨询有…
  • 武汉小福尔摩斯商务咨询有…
icon 百度首席技术官李一男辞职 点击进入 西安百度 陕西博德信息技术有限公司 的电子名片

更新时间:2010-2-24 14:43:00


中
国主要的搜索引擎公司百度在线网络技术公司(Baidu.com Inc.)周一发布公告称,公司首席技术官李一男已因个人原因辞职。

这一消息的发布距百度首席营运长叶朋辞职仅有10天时间。百度称,叶朋也是由于个人原因辞职。

百度未在公告中透露更多细节。目前百度尚未指定这两个职位的继任者。不过,该公司在1月8日宣布叶朋辞职时还表示,提升沈皓瑜为高级副总裁,王湛为副总裁。他们之前分别担任百度商业运营副总裁和商业产品高级总监。

一些市场观察人士猜测,上述管理人士辞职可能与该公司向全新广告系统凤巢(Phoenix Next)过渡的问题有关。

野村证券公司(Nomura Securities)分析师Jin Yoon称,有迹象显示,向凤巢系统过渡可能并没有原先预计的那么顺利。

using System
using System.Data
using System.Configuration
using System.Linq
using System.Web
using System.Xml.Linq
using System.Xml
using System.Net
using System.Text.RegularExpressions
using System.Text
using System.IO

namespace SEO
{
    public class SEOInfo
    {
        public int GetGoogleCount(string HostName)
        {
            try
            {
                string url = "http://www.google.com/search?hl=zh-CN&ie=UTF-8&q=site%3A" + HostName
                string html = new WebClient().DownloadString(url)
                //string pattern = @" 获得大约 <b>[\s\S]*?(?=</b> 条查询结果,以下是第 <b>)" 规则一
                string pattern = @"</b> 获得约 <b>[\s\S]*?(?=</b> 条结果,以下是第 <b>)"
                string number1 = Regex.Match(html, pattern, RegexOptions.IgnoreCase).Value
                string lastnumber = number1.Replace(@"</b> 获得约 <b>", "")
                lastnumber = lastnumber.Replace(",", "")
                return Convert.ToInt32(lastnumber)
            }
            catch (Exception ex)
            {
                return 0
            }
        }
        public int GetGoogleBackLinkCount(string HostName)
        {
            try
            {
                //http://www.google.cn/search?hl=zh-CN&q=link:www.yahoo.com
                string url = "http://www.google.cn/search?hl=zh-CN&q=link:" + HostName
                string html = new WebClient().DownloadString(url)
                //string pattern = @"<p id=resultStats>&nbsp约有 <b>[\s\S]*?(?=</b> 条链接到 <b>" + HostName.Trim() + "</b> 的查询结果,以下是第)"
                string pattern = @"<p id=resultStats>&nbsp约有 <b>[\s\S]*?(?=</b> 条链接到 <b>" + HostName.Trim() + "</b> 的结果,以下是第 <b>)"
                string number1 = Regex.Match(html, pattern, RegexOptions.IgnoreCase).Value
                string lastnumber = number1.Replace(@"<p id=resultStats>&nbsp约有 <b>", "")
                lastnumber = lastnumber.Replace(",", "")
                return Convert.ToInt32(lastnumber)
            }
            catch (Exception ex)
            {
                return 0
            }

        }
        /// <summary>返回百度:某期间,收录数量   
        /// 参数strTimespan代表意义   
        /// "1"请选择要查询近几天的收录量   
        /// "1"查询昨日收录情况   
        /// "7"查询最近1星期收录情况   
        ///"30"查询最近1月收录情况   
        ///"360"查询最近1年收录情况   
        ///"0"查询总的(所有日期)收录情况   
        /// </summary>   
        /// <param name="strHostName"></param>   
        /// <returns></returns>   
        public int GetBaiduCount(string strTimespan, string strHostName)
        {
            try
            {
                string uri = "http://www.baidu.com/s?lm=" + strTimespan + "&wd=site:" + strHostName
                string html = new WebClient().DownloadString(uri)
                string pattern = @"百度一下,找到相关网页[\s\S]*?(?=篇,用时)"
                //string number = new Regex(@"找到相关网页约([\d,]+)篇").Match.Groups[1].Value    
                string number1 = Regex.Match(html, pattern, RegexOptions.IgnoreCase).Value
                string lastnumber = number1.Replace("百度一下,找到相关网页", "")
                //如果有很多篇去掉约,返回纯数字串   
                if (lastnumber.Contains("约"))
                {
                    lastnumber = lastnumber.Replace("约", "")
                    lastnumber = lastnumber.Replace(",", "")
                }
                //如果一篇都没有返回0   
                if (lastnumber == "")
                {
                    lastnumber = "0"
                }
                return Convert.ToInt32(lastnumber)
            }
            catch (Exception ex)
            {
                return 0
            }
        }
        public int GetBaiduBackLinkCount(string DomainName)
        {
            try
            {
                // http://www.baidu.com/s?wd=domain:www.yahoo.com
                string uri = "http://www.baidu.com/s?wd=domain:" + DomainName
                string html = new WebClient().DownloadString(uri)
                string pattern = @"百度一下,找到相关网页[\s\S]*?(?=篇,用时)"
                string number1 = Regex.Match(html, pattern, RegexOptions.IgnoreCase).Value
                string lastnumber = number1.Replace("百度一下,找到相关网页", "")
                if (lastnumber.Contains("约"))
                {
                    lastnumber = lastnumber.Replace("约", "")
                    lastnumber = lastnumber.Replace(",", "")
                }
                //如果一篇都没有返回0   
                if (lastnumber == "")
                {
                    lastnumber = "0"
                }
                return Convert.ToInt32(lastnumber)
            }           
            catch (Exception ex)
            {
                return 0
            }

        }


        public int GetYahooCount(string DomainName)
        {
            try
            {
                //http://www.yahoo.cn/s?p=site:www.yahoo.com

                string uri = "http://www.yahoo.cn/s?p=site:" + DomainName
                WebClient wb = new WebClient()
                byte[] PageDate = wb.DownloadData(uri)
                string html = Encoding.UTF8.GetString(PageDate)
                string pattern = @"<div class=""rltnum"">找到相关网页约[\s\S]*?(?=条,用时)"
                string number1 = Regex.Match(html, pattern, RegexOptions.IgnoreCase).Value
                string lastnumber = number1.Replace(@"<div class=""rltnum"">找到相关网页约", "")
                lastnumber = lastnumber.Replace(",", "")
                //如果一篇都没有返回0   
                if (lastnumber == "")
                {
                    lastnumber = "0"
                }
                return Convert.ToInt32(lastnumber)
            }
            catch (Exception ex)
            {
                return 0
            }
        }
        public int GetYahooBackLink(string DomainName)
        {
            try
            {
                //http://sitemap.cn.yahoo.com/search?bwm=i&bwmf=s&p=www.yahoo.com

                string uri = "http://sitemap.cn.yahoo.com/search?bwm=i&bwmf=s&p=" + DomainName

                WebClient wb = new WebClient()
                byte[] PageDate = wb.DownloadData(uri)
                string html = Encoding.UTF8.GetString(PageDate)
                string pattern = @"<em>链向该地址的网页: 共 <strong>[\s\S]*?(?=</strong> 条  当前显示 第<strong>)"
                string number1 = Regex.Match(html, pattern, RegexOptions.IgnoreCase).Value
                string lastnumber = number1.Replace(@"<em>链向该地址的网页: 共 <strong>", "")
                lastnumber = lastnumber.Replace(",", "")
                //如果一篇都没有返回0   
                if (lastnumber == "")
                {
                    lastnumber = "0"
                }
                return Convert.ToInt32(lastnumber)
            }
            catch (Exception ex)
            {
                return 0
            }
        }
        public string GetAlexa(string _url)
        {
            string url
            url = _url
            try
            {
                XmlReader reader
                XmlDocument doc = new XmlDocument()
                XmlNode node
                reader = XmlReader.Create("http://data.alexa.com/data/?cli=10&dat==snba&ver=7.0&url=" + url)
                doc = new XmlDocument()
                doc.Load(reader)
                node = doc.SelectSingleNode("/ALEXA/SD/POPULARITY")
                if (node != null)
                {
                    return node.Attributes["TEXT"].Value.ToString()
                    reader.Close()
                }
                else
                {
                    return null
                    reader.Close()
                }
            }
            catch
            {
                return null
            }
            finally
            {
            }
        }
        //
        /// <summary>
        /// 获取GOOGLE PR的代码:GetGooglePR(string url)
        /// </summary>
        uint GOOGLE_MAGIC = 0xE6359A60

        private uint zeroFill(uint a, int b)
        {
            checked
            {
                uint z = 0x80000000
                if (Convert.ToBoolean(z & a))
                {
                    a = (a >> 1)
                    a &= (~z)
                    a |= 0x40000000
                    a = (a >> (b - 1))
                }
                else
                {
                    a = (a >> b)
                }
            }
            return a
        }

        private uint[] mix(uint a, uint b, uint c)
        {
            a -= b a -= c a ^= (uint)(zeroFill(c, 13))
            b -= c b -= a b ^= (uint)(a << 8)
            c -= a c -= b c ^= (uint)(zeroFill(b, 13))
            a -= b a -= c a ^= (uint)(zeroFill(c, 12))
            b -= c b -= a b ^= (uint)(a << 16)
            c -= a c -= b c ^= (uint)(zeroFill(b, 5))
            a -= b a -= c a ^= (uint)(zeroFill(c, 3))
            b -= c b -= a b ^= (uint)(a << 10)
            c -= a c -= b c ^= (uint)(zeroFill(b, 15))

            return new uint[3] { a, b, c }
        }

        private uint GoogleCH(uint[] url, uint length, uint init)
        {
            if (length == 0)
            {
                length = (uint)url.Length
            }
            uint a, b
            a = b = 0x9E3779B9
            uint c = init
            int k = 0
            uint len = length
            uint[] m_mix = new uint[3]
            while (len >= 12)
            {
                a += (uint)(url[k + 0] + (url[k + 1] << 8) + (url[k + 2] << 16) + (url[k + 3] << 24))
                b += (uint)(url[k + 4] + (url[k + 5] << 8) + (url[k + 6] << 16) + (url[k + 7] << 24))
                c += (uint)(url[k + 8] + (url[k + 9] << 8) + (url[k + 10] << 16) + (url[k + 11] << 24))
                m_mix = mix(a, b, c)
                a = m_mix[0] b = m_mix[1] c = m_mix[2]

                k += 12
                len -= 12
            }

            c += length

            switch (len)              /* all the case statements fall through */
            {
                case 11:
                    {
                        c += (uint)(url[k + 10] << 24)
                        c += (uint)(url[k + 9] << 16)
                        c += (uint)(url[k + 8] << 8)
                        b += (uint)(url[k + 7] << 24)
                        b += (uint)(url[k + 6] << 16)
                        b += (uint)(url[k + 5] << 8)
                        b += (uint)(url[k + 4])
                        a += (uint)(url[k + 3] << 24)
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 10:
                    {
                        c += (uint)(url[k + 9] << 16)
                        c += (uint)(url[k + 8] << 8)
                        b += (uint)(url[k + 7] << 24)
                        b += (uint)(url[k + 6] << 16)
                        b += (uint)(url[k + 5] << 8)
                        b += (uint)(url[k + 4])
                        a += (uint)(url[k + 3] << 24)
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 9:
                    {
                        c += (uint)(url[k + 8] << 8)
                        b += (uint)(url[k + 7] << 24)
                        b += (uint)(url[k + 6] << 16)
                        b += (uint)(url[k + 5] << 8)
                        b += (uint)(url[k + 4])
                        a += (uint)(url[k + 3] << 24)
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                /* the first byte of c is reserved for the length */
                case 8:
                    {
                        b += (uint)(url[k + 7] << 24)
                        b += (uint)(url[k + 6] << 16)
                        b += (uint)(url[k + 5] << 8)
                        b += (uint)(url[k + 4])
                        a += (uint)(url[k + 3] << 24)
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 7:
                    {
                        b += (uint)(url[k + 6] << 16)
                        b += (uint)(url[k + 5] << 8)
                        b += (uint)(url[k + 4])
                        a += (uint)(url[k + 3] << 24)
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 6:
                    {
                        b += (uint)(url[k + 5] << 8)
                        b += (uint)(url[k + 4])
                        a += (uint)(url[k + 3] << 24)
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 5:
                    {
                        b += (uint)(url[k + 4])
                        a += (uint)(url[k + 3] << 24)
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 4:
                    {
                        a += (uint)(url[k + 3] << 24)
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 3:
                    {
                        a += (uint)(url[k + 2] << 16)
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 2:
                    {
                        a += (uint)(url[k + 1] << 8)
                        a += (uint)(url[k + 0])
                        break
                    }
                case 1:
                    {
                        a += (uint)(url[k + 0])
                        break
                    }
                /* case 0: nothing left to add */
            }
            m_mix = mix(a, b, c)
            /* report the result */
            return m_mix[2]
        }

        private uint GoogleCH(string url, uint length)
        {
            uint[] m_urluint = new uint[url.Length]
            for (int i = 0 i < url.Length i++)
            {
                m_urluint[i] = url[i]
            }
            return GoogleCH(m_urluint, length, GOOGLE_MAGIC)
        }

        private uint GoogleCH(string sURL)
        {
            return GoogleCH(sURL, 0)
        }
        private uint GoogleCH(uint[] url, uint length)
        {
            return GoogleCH(url, length, GOOGLE_MAGIC)
        }

        private uint[] c32to8bit(uint[] arr32)
        {
            uint[] arr8 = new uint[arr32.GetLength(0) * 4 + 3]

            for (int i = 0 i < arr32.GetLength(0) i++)
            {
                for (int bitOrder = i * 4 bitOrder <= i * 4 + 3 bitOrder++)
                {
                    arr8[bitOrder] = arr32[i] & 255
                    arr32[i] = zeroFill(arr32[i], 8)
                }
            }
            return arr8
        }

        //新算法,ToolBar 版本>>=2.0.114
        public string CalculateChecksum(string sURL)
        {
            uint ch = GoogleCH("info:" + sURL)

            ch = (((ch / 7) << 2) | (((uint)(ch % 13)) & 7))

            uint[] prbuf = new uint[20]
            prbuf[0] = ch
            for (int i = 1 i < 20 i++)
            {
                prbuf[i] = prbuf[i - 1] - 9
            }
            ch = GoogleCH(c32to8bit(prbuf), 80)

            return string.Format("6{0}", ch)
        }

        //老算法,ToolBar 版本<2.0.114
        public string CalculateChecksumOld(string sURL)
        {
            uint ch = GoogleCH("info:" + sURL)

            string CalculateChecksum = "6" + Convert.ToString((ch))
            return CalculateChecksum
        }
        public string GetGooglePR(string url)
        {
            WebClient wc = null
            try
            {
                wc = new WebClient()
                string str = wc.DownloadString("http://www.google.cn/search?client=navclient-auto&ch=" + CalculateChecksum(url) + "&features=Rank"
                    + "&q=info:" + url)
                string[] rs = str.Split('':'')
                string PR = rs[rs.Length - 1]
                return PR
                //PR = url+"Pr="+str+"<br>"
            }
            catch
            {
                return null
            }
            finally
            {
                wc.Dispose()
            }
        }
        //获取GOOGLE PR的代码完毕
    }
}



Yoon还称,百度管理层变动很可能与其主要竞争对手谷歌(Google Inc.)的近期风波无关。谷歌上周称可能全面撤出中国市场。

百度西安分公司Yoon称,谷歌的消息对百度来说应该算是个惊喜。

   西安百度推广凤巢系统于去年4月推出,其问世的部分原因是外界批评百度未明确区分广告和正常搜索结果。百度管理层称,该系统还为广告商提供工具,以更好地衡量广告支出回报,从而将在长期内带来更高收入。

但在该公司10月份公布第三季度业绩后举行的分析师电话会议上,沈皓瑜称,习惯于老系统的客户可能到12月1日都不会准备好转用新系统。百度宣布于12月1日全面切换到凤巢系统。

沈皓瑜当时称,这一过渡将导致公司第四季度收入较前一季度增幅减少10个百分点。

李一男2008年10月加入百度,至今仅1年有余。李一男此前是华为技术有限公司(Huawei Technologies Co.)的首席电信科学家兼副总裁。华为是一家总部设在深圳的电信设备生产商。

刘二伟 电话:86-029- 15091377765


本文出自:西安百度 陕西博德信息技术有限公司 刘二伟 的电子名片 【发给QQ msn 上的好友】【字体:大 中 小】【打印】【关闭】


icon 其他行业资讯互动
  • 怎样选择茶具
  • 怎样选择茶具
  • 注册造价工程师管理办法
  • 关于2010年第一批甲级工程造价咨询企业资质延续的公…
  • 陕西工程造价基础知识
  • 中国注册会计师协会2009年工作总结
  • 2010年经济形势和招投标工作新春报告会成功举办
  • 出具虚假验资报告会计师事务所被起诉
  • 陕西招标代理那个公司好?
  • 陕西会计师事务所哪家好
  • 宠物们的爆笑穿着
  • 济南丢狗老人找回爱犬热泪盈眶竟为好心人下跪
  • 三流浪狗结伴乞讨感动商贩
  • “禁食猫狗肉”惹争议立法不能背离民俗民情
  • 小金毛的调教方法
  • 狗狗脱毛症的诊断与防治
  • 西安宠物美容之七点注意
  • 什么是健康、低碳、环保的涂料产品
  • 不学日语就可留日学习
  • 夏天婚礼注意事项
陕西 西安市      广告行业      以上信息由 西安百度 陕西博德信息技术有限公司 提供 管理入口