Blackberry Engineering Screen!

Fungsi umum dari eScreen adalah untuk menampilkan Informasi tambahan dan beberapa fungsi Pengaturan (setting)

Fungsi Khusus:
1. meng-unlock GPS pada Hendheld BB dengan GPS terintegrasi.
(bagi yang pernah mencoba untuk search Sattelite namun tidak pernah dapet, mungkin ada fungsi GPS yang masih ke locked, dan bisa dibuka melalui eScreen)
2. memilih jaringan secara manual

Quote:

Originally Posted by brigjend Buat yg BB-nya carrier AT&T bisa 'memilih' opsi '3G Only' lho lewat engineering screen ini.

3. memilih atau menentukan lokasi BTS secara manual, gunanya untuk me-lock handheld dengan BTS dengan signal paling bagus di areal tertentu.
4.
5.
6.
7.

berikut adalah cara untuk menampilkan Blackberry eScreen

Special thanks to Mr. Jelounge
click link dibawah ini langsung masuk ke keygen eScreen!

Code:

eScreen Keygen

Spoiler for for download keygen eScreen:

http://rapid*share.com/files/3508430...en_eScreen.rar

Spoiler for Contoh screenshot jika berhasil dapat keygen dari browser PC:

Contoh screenshot jika berhasil dapat keygen dari browser PC :

cara membuka eScreen di BB:

1. dari PC buka file HTML diatas
2. di homescreen Handheld/BB, tekan alt+shift+H (akan menunjukan Help me Screen)
3. masukan PIN
4. masukan app. Ver (ex. 4.6.0.xxx (xxx) )
5. dibagian bawah keygen akan tertera 8 digit gabungan angka dan huruf.
6. masukan ke 8 code tersebut di help me screen. (tidak akan terlihat ketika code dimasukan)
7. setelah semua code masuk, maka layar akan langsung berganti ke eScreen.

Spoiler for for storm user:

cara buka "help me screen" di storm,
pada home screen tekan dan tahan tombol ESC, lalu tekan layar sebelah kiri atas, kemudian kanan atas, kemudian kiri atas lagi, dan kanan atas lagi.

lalu pakai cara di page 1 untuk dapat code nya.

(sudah di test dan berhasil oleh Mr. Hunt)

atau

1. Flip tampilan menjadi Landscape Mode.
2. dari Home screen, tekan dan tahan tombol 123 untuk mengaktifkan numlock.
3. tekan tombol Menu.
4. kemudian tampilkan Keyboard.
5. ketik 2*92

special thanks for Mr. kas2jr
QUOTE=kas2jr;169954224]@renzpie
thank's gan.... it's works!!
btw cara yang ke dua juga jalan koq...
mau memperjelas langkah2 nya buat cara lain selain cara yg udah di test sama bro huns.

langkah2 nya :
1. masuk ke home screen
2. munculkan keyboard dalam posisi landscape(tiduran)
3. tahan tombol !#123 sampai muncul tanda lock diatasnya, lalu tekan tombol 2*92
4. maka akan muncul help me screen.

@huns
thank's, bener udah bisa gan... ^_^

nice share!!![/quote]

Spoiler for for homescreen:

test on:
Device: BB Curve 8310
themes: Precision Mini Storm (credit goes to Mr. Lucubrb)

Spoiler for for inside BB eScreen:

1. mobile Network eScreen
2. OS eScreen
3. JVM eScreen
4. Display Event Log (sama seperti alt+LGLG)
5. Deactivate Radio (buat menyalakan dan mematikan fungsi radio/signal telp. dengan kata lain flight mode)
6. Power off (buat mematikan Handheld keseluruhan sama seperti menekan tombol tutup telp beberapa detik)

Spoiler for for sub-inside BB eScreen:

Spoiler for singkatan yang digunakan dalam eScreen:

disadur dari warung e' orang londo

Acronyms used in the Engineering Menu

CS - Circuit Switched: Identifies the circuit switched domain and the use of circuit switched data.

PS - Packet Switched: In a packet switched network, data may be transferred by dividing it into small blocks or pieces known as packets. Each packet contains information in its header to allow it to be routed by packet switches across the network. This is a more efficient means of transferring data.

PDP - Packet Data Protocol: A packet transfer protocol used in wireless GPRS networks

MCC - Mobile Country Code: A three digit number uniquely identifying a given country

MNC - Mobile Network Code: The Mobile Network Code is either a two or three digit number used to uniquely identify a given network from within a specified country

LAC - Location Area Code: Uniquely identifies a LA (Location Area) within a PLMN (Public Land Mobile Network). It may range from 0 to 65,535

RAC - Routing Area Code: Routing Area Code is a fixed length of 1 octet and identifies a routing area within a location area. The RAC is part of the RAI (Routing Area Identity)

MSC - Mobile Switching Center: A telecommunication switch or exchange within a cellular network architecture which is capable of interworking with location databases

SGSN - Serving GPRS Support Node: keeps track of the location of an individual MS (Mobile Station) and performs security functions and access control. The SGSN also exists in a UMTS network, where it connects to the RNC (Radio Network Controller) over the Iu-PS interface

DTM - Dual Transfer Mode: supporting simultaneous voice and packet data in a GSM network

ARFCN - Absolute Radio Frequency Channel Number: Within the spectrum allocated for cellular mobile communications, the radio channels are identified by ARFCN. If the system is operating in FDD (Frequency Division Duplex) mode then the channel number is associated with both the uplink and downlink radio channels. Within the GSM900 spectrum ARFCN 1 to 124 are used. In GSM1800, ARFCN 512 to 885 are used and in GSM1900 ARFCN 512 to 810 are used

PCH - Paging Channel: This is the downlink transport channel in UMTS that carries the PCCH (Paging Control Channel). It is used to broadcast paging and notification messages in a cell

TBF - Temporary Block Flow: a physical connection used by the two RR (Radio Resource) entities to support the unidirectional transfer of LLC (Logical Link Control) PDU (Protocol Data Unit) on packet data physical channels. A TBF is temporary and is maintained only for the duration of the data transfer, i.e. until there are no more RLC (Radio Link Control) / MAC (Medium Access Control) blocks to be transmitted

NMO - Network Mode of Operation: Frequency Division Duplex (FDD) and Time Division Duplex (TDD)

NCO - Numerically Controlled Oscillator: An electronic system for synthesizing a range of frequencies from a fixed timebase

RAT - Radio Access Technology: This indicates the type of radio technology to access the CN (Core Network)

GERAN - GSM EDGE Radio Access Network: a type of RAT

UTRAN - UMTS Terrestrial Radio Access Network: a type of RAT

RSSI - Recieved Signal Strength Indication (in dBm)

C1 - A cell selection algorithm employed in GSM and GPRS: The algorithm uses the power received from cells plus additional parameters in order to assess the cell that will provide the best radio connection for the MS (Mobile Station).

C2 - A GSM cell reselection algorithm: Once the MS (Mobile Station) has camped onto a cell it will continue to assess the surrounding cells to ensure it is monitoring the cell that will offer the best radio connection. As the user moves the camped on cell may become unsuitable. This situation will generate a cell reselection

CellID - The cells ID number on a network

BSIC - Base Station Identity Code: This is a code in GSM which is broadcast on the SCH (Synchronization Channel) in order to identify the NCC (Network Colour Code) and the BCC (Base Station Colour Code)

NOTE: Use It At Your Own Risk!
script tersebut bukan milik dan hasil karya gue,
gue hanya sekedar berbagi.
semoga bermanfaat!

kegunaan dan resiko dari perubahan didalam eScreen gue juga belum begitu paham (alias masih tahap Trial & Error) & semoga dengan adanya thread ini bisa saling bantu apa keuntungan dan kerugiannya.

Radio Streaming

1. Bagi pengguna BlackBerry yang ada 3G-nya, pake jaringan 3G kalian dulu. Bagi pengguna BlackBerry yang tidak ada 3Gnya, coba dulu ya jangan menyerah.
2. Masuk Browser, di kolom Search (Google), masukin:

U SHOUTcast D.N.A.S. Status

*bisa juga kalian tambah String keyword: U SHOUTcast D.N.A.S. Status ADDKEYHERE
Contoh Tambahan Keyword:

• U SHOUTcast D.N.A.S. Status GenreMusik (Rock, Pop, Reggae, Ska, dsb)
• U SHOUTcast D.N.A.S. Status NamaRadio
• U SHOUTcast D.N.A.S. Status LokasiRadio

Search awal di Google

3. Nanti di Google, muncul result seperti ini:

Link IP: http://123.456.789:1234 atau Link nama: http://radio.ebool.com:8000

Cari Link yang harus memiliki tanda “:” (contoh: http://123.456.789:1234 atau http://radio.ebool.com:1234), kalau enggak, kita ga bisa akses radio streaming, karena kita streaming langsung nge-point web browser kita ke Server Radio yang berbasis SHOUTcast. You’re understand?

4. Setelah mendapatkan Radio yang kita inginkan, klik pada link radio yang memiliki tanda “:” di Google, sewaktu muncul window Save Item pilih OPEN! Jangan pilih SAVE! OK?

Ketika muncul window Save Item, Pilih OPEN

5. Setelah klik OPEN, kalian secara otomatis akan masuk pada Media Browser. Dan kalau berhasil akan muncul seperti ini:

Media Browser. Streaming Sukses!

6. Selamat menikmati radio kesukaan anda!
——————————————————————————–
NOTE: Bila Streaming Error akan muncul seperti ini:

ERROR STREAMING

• Straming akan mengalami error apabila File Listening yang dipake di server SHOUTcast ini menggunakan format yang ga kompatibel untuk BlackBerry (gue kurang paham, file format apa yang kompatiblel untuk streaming via BlackBerry)
• (Menurut pengalaman gue, kalo kalian berhasil menggunakan jaringan GPRS, sukur dah) Streaming akan mengalami error apabila kalian menggunakan jaringan GPRS, karena GPRS ga kuat ngeload file streaming ini. Untuk jaringan EDGE (menurut pengalaman gue), kadang bisa streaming, kadang ga bisa, tergantung sestabil mana EDGE kalian. Untuk jaringan 3G, ga diragukan lagi deh, PASTI BISA!!

Beberapa Radio Server yang gue Bookmark:

• SpinFM 94.9 FM (Radio Interlokal – Cayman Islands) – http://66.55.139.212:7480
• M-Radio 98.8 FM (Radio Lokal – Surabaya) – http://66.55.139.212:7220
  Launcher M-Radio untuk BlackBerry: DOWNLOAD!
• KASKUS Radio (Radio Lokal – KASKUS NETWORK) – http://server.kaskus.us:8096
• Dan banyak lagi, index sendiri ye.

Google North American Faculty Summit - Day 2

Posted by Andrew Tomkins, Director of Engineering, Google Research

Friday at the Google Faculty Summit, we discussed ideas around online social capabilities. Chris Messina opened the discussion with a talk about open initiatives for the social web. Damon Horowitz, founder of Aardvark, gave a talk about the Aardvark experience. But in this post, I’d like to talk about a panel I moderated on the future of the social web. The panel consisted of four experts in the area. Joseph Smarr came to Google after eight years as CTO of social networking site Plaxo. Lada Adamic is on the faculty at University of Michigan, where she studies the nature of social and information networks. Eytan Adar is also on the faculty at the University of Michigan, where he studies the evolution of production and consumption of data over time. Luis von Ahn is on the faculty of Carnegie Melon University and also an employee at Google; he studies mechanisms to connect significant human efforts to interesting problems.

One theme that received a lot of attention from panelists and audience members alike was the benefits and pitfalls of social personalization. In the context of an activity stream, there seems to be general agreement that passing lightweight updates among friends is a valuable tool for “social grooming,” or keeping light contact with friends as a way of maintaining the state of the friendship. For information discovery, however, the topic received more debate: real-world social networks have always been used to both push and pull information, but in conjunction with high-quality search, it's reasonable to ask which types of information needs can be best addressed by your friends. Social network connections typically display homophily (similarity) in the dimensions of geography and interests, so your friends are more likely to have something interesting to say about your local area and your longstanding hobbies or interests, along with other subjects. If so, the answer you receive has two added bonuses. First, your background knowledge about your friend will aid you in assessing the quality of the answer. And second, an answer from a friend satisfies not just an information need but also a human need to interact and share experiences. This socially augmented information can arrive through a push channel in which your friend already posted (for example) a review for a restaurant, or through a pull channel in which you send to your friends a request for information. The same mechanisms for social information sharing may also operate powerfully in the context of a group coming together around a shared interest or goal, rather than just in the context of an individual. Consider for example a group of students working together to understand some new material. The same two mechanisms apply: knowledge about the other students helps you evaluate their contributions, and the interactions in the group have value beyond the pure information transmitted.

There was considerable discussion about social networks' capacity to funnel information to a user through the lens of a particular viewpoint or ideology. Imagine an individual who arrives on the web as a supporter or detractor of a particular political figure or mindset, and then surrounds him or herself with like-minded people online, enjoying positive and supportive discussions but failing to encounter a diverse set of views and counter-opinions. Literature in the social sciences, beginning with the famous Asch conformity experiments from the 1950s, details the mechanisms that cause people to conform to group expectations and even abandon normal personality traits based on the norms of the new situation. And work by Nobel Prize-winning economist Thomas Schelling shows that very small and "reasonable" biases we might have towards avoiding becoming an extreme minority might lead a system to evolve into a highly balkanized state. Similar models have been proposed and evaluated in the Internet domain, and some preliminary measurements have been performed. While faculty members in the audience surmised that personalization could lead to more extremism, the group agreed there is no conclusive evidence.

Another topic we touched on is mechanism design: the problem of designing systems so that agents in the system, each acting selfishly, will together produce some desired outcome. Consider a social networking game. If the desired outcome is revenue for the game manufacturer, then the actions that increase status in the game (using real-world currency to purchase items in the game; inviting friends to join and participate in the game; clicking on advertisements in the game) are designed well to support this goal. Rewarding the action of bringing new friends into the game is one obvious approach to increasing the total user population. More subtly, any game system must provide sufficient fun to be worth the expense to users. The dramatic success of casual online games of this form (6 percent of U.S. pageviews come from these games, according to a study by Ravi Kumar and myself in the WWW 2010 conference) is a testimony to the presence of successful mechanisms of this form.

Finally, here is a small sampling of other issues that arose in the panel as controversial points or interesting areas for future research:

1. Social networks draw massive amounts of user time. We are beginning to get some limited visibility into exactly how this attention is allocated, which raises the research question of how much utility users are actually deriving from this investment of time, either in information, entertainment, social grooming or other intangibles.
2. In certain online communities, we see behavioral norms that are skewed towards public visibility of essentially all activity. Do these norms reflect the desires of the populations that choose to join the community, or do they emerge specifically because of the technical tools offered by the website that hosts the community?
3. Social networks are increasingly offering richer tools to users in an attempt to capture nuances of interactions that exist in the real world. In the fullness of time, how close will we get, and when will this happen?
4. Social networks formalize the status of a friendship, with significant breakpoints at initiation, acceptance and removal of a binary tie. The visibility of these events leads to both "overfriending" and offense when friendships are refused or removed. Are there improved mechanisms to produce and manage the relationships in online social networks, and if so, what are these mechanisms?
5. Social network graphs are notoriously difficult to partition into large regions with few edges between them (the sole exception being parts of a network that interact using different languages). A series of computational challenges arise when attempting to shard these networks for distributed analysis or serving from multiple computers.

One thing is clear from the discussion on Friday: social networks are increasingly becoming a valuable area for academic study. Faculty from widely disparate areas of computer science have thought deeply about the issues and implications of these tools; active research is ongoing in essentially all top institutions; and social network dynamics are appearing in the undergraduate curriculum. On top of that, they are an interdisciplinary phenomenon, involving not only many aspects of CS (UX, mechanism design, intense system requirements, security and privacy) but also psychology, economics and ethics, to name a few. There is much to study in order to understand these networks and maximize their societal value.

Google North American Faculty Summit - cloud computing

Posted by Brian Bershad, Director of Engineering, Site Director, Google Seattle

Of the three themes of our 2010 Faculty Summit, cloud computing was the one that pervaded all others, from security in the cloud to the presumption of cloud infrastructure behind the social web. But in our more focused discussion on cloud computing last Thursday, we started with the premise of “prodigiousness,” a concept introduced by Afred Spector, VP of Research and Special Initiatives.

While we all know that systems are huge and will get even huger, the implications of this size on programmability, manageability, power, etc. is hard to comprehend. Alfred noted that the Internet is predicted to be carrying a zetta-byte (10²¹ bytes) per year in just a few years. And growth in the number of processing elements per chip may give rise to warehouse computers of having 10¹⁰ or more processing elements. To use systems at this scale, we need new solutions for storage and computation. It was these solutions we focused on throughout our discussions.

In the plenary talk, Andrew Fikes spoke on storage system opportunities. Among many topics, he talked about shifting engineering foci to storage management and optimization not just on an individual cluster of co-located systems, but across geographically distributed clusters. The goal is so-called planetary-scale systems. This brings up all manner of diverse challenges ranging from the need to continually balance storage vs. transmission costs, the need to account for variable network latency characteristics, and the desire to optimize storage (e.g., by physically storing only one copy of a file that many feel they have rights to, or own).

We had a few roundtables in the afternoon for deeper discussions. In the table I led, we discussed two systems for “programming the data center” developed by systems researchers at Google Seattle/Kirkland. The first, Dremel, is a scalable, interactive ad-hoc query system for analysis of read-only nested databases. Dremel was recently presented in a paper at VLDB (Dremel: Interactive Analysis of Web-Scale Datasets, Sergey Melnik, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, Theo Vassilakis. In Proceedings of the 36th Int'l Conf on Very Large Data Bases, 2010). The system serves as the foundational technology behind BigQuery, a product launched in limited preview mode at Google I/O in May.

We also discussed FlumeJava, a Java library that makes it easy to develop, test and run efficient data-parallel pipelines at data center scale. FlumeJava was developed by programming languages researchers at Google Seattle, and is currently in widespread use within Google. It was presented at the recent PLDI conference (FlumeJava: easy, efficient data-parallel pipelines, Craig Chambers, Ashish Raniwala, Frances Perry, Stephen Adams, Robert R. Henry, Robert Bradshaw, Nathan Weizenbaum. In Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation). The work reflects Google’s commitment to programming language and compiler technologies at scale.

The field of data center programming has progressed substantially in the last 10 years. Dremel and FlumeJava systems represent abstractions of a higher level than the MapReduce construct we previously introduced, and we think they are easier to use (within their domain of applicability) and more automatically optimizable. With time, the field will discover new “instructions” and even better abstractions leading us to a point where computations which run on nearly unlimited processors can be expressed as easily as sequential programs. We are working hard to make progress here, and I look forward to reporting on our progress in the future.